Statistical admission control using delay distribution measurements
نویسندگان
چکیده
منابع مشابه
DDM : Statistical Admission Control Using Delay Distribution Measurement
Measurement-based admission control algorithms exploit the statistical multiplexing nature of input traffic to admit more flows into a system than is possible when assuming that each admitted flow is fully loaded. However, most previous measurement-based admission control algorithms did not have a satisfactory solution to the problem of guaranteeing distinct per-flow delay bounds while exploiti...
متن کاملAverage Delay Guarantee in Server Systems Using Admission Control
Although server technology provides a mean to support a wide range of online services and applications, their ad-hoc configuration poses significant challenges to the performance, availability and economical costs of applications. One of the main concerns is that under a heavy load, the delay introduced by a server in the transaction process may grow unbounded. This paper precisely addresses th...
متن کاملJoint routing and admission control problem under statistical delay and jitter constraints in MPLS networks
0140-3664/$ see front matter 2008 Elsevier B.V. A doi:10.1016/j.comcom.2008.07.002 * Corresponding author. Tel.: +1 5148037134. E-mail addresses: hichem-ayed.harhira@polymtl [email protected] (S. Pierre). Admission control algorithms are crucial for ensuring a near optimal resource allocation while guaranteeing the required Quality of Service (QoS) constraints. In this paper, a new routing and ...
متن کاملDYE JET VELOCITY DISTRIBUTION MEASUREMENTS USING PHOTOTHERMAL DEFLECTION SPECTROSCOPY
We demonstrate that photothermal deflection spectroscopy can be used to measure velocity distributions in dye jets. Such measurements are useful in determining the quality of flow in dye jets, The quality of jets is very important for a stable and naanow linewidth operation of dye lasers
متن کاملDelay-constrained routing problems: Accurate scheduling models and admission control
It has been recently shown [7] that the problem of routing a new packet flow in a computer network subject to a constraint on the worst-case end-to-end delay of its packets can be formulated as a Mixed-Integer Second-Order Cone Program (MISOCP), and solved with general-purpose tools on instances of realistic size in time compatible with real-time use. However, that result was obtained for only ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Multimedia Computing, Communications, and Applications
سال: 2006
ISSN: 1551-6857,1551-6865
DOI: 10.1145/1201730.1201732