TY - JOUR

T1 - Packet multiplexers with adversarial regulated traffic

AU - Rajagopal, Srini

AU - Reisslein, Martin

AU - Ross, Keith W.

N1 - Funding Information:
We gratefully thank Jean-Yves LeBoudec for introducing to us the LoPresti et al. paper and for sharing with us his insights into the LoPresti et al. paper. This paper was supported partially by NSF grant NCR96-12781.

PY - 2002/2/15

Y1 - 2002/2/15

N2 - We consider a finite-buffer packet multiplexer to which traffic arrives from several independent sources. The traffic from each of the sources is regulated, i.e. the amount of traffic that can enter the multiplexer is constrained by known regulator constraints. The regulator constraints depend on the source and are more general than those resulting from cascaded leaky buckets. We assume that the traffic is adversarial to the extent permitted by the regulators. For lossless multiplexing, we show that if the original multiplexer is lossless it is possible to allocate bandwidth and buffer to the sources so that the resulting segregated systems are lossless. For lossy multiplexing, we use our results for lossless multiplexing to estimate the loss probability of the multiplexer. Our estimate involves transforming the original system into two independent resource systems, and using adversarial sources for the two independent resources to obtain a bound on the loss probability of the transformed system. We show that the adversarial sources are not extremal on-off sources, even when the regulator consists of a peak rate controller in series with a leaky bucket. We explicitly characterize the form of the adversarial source for the transformed problem. We also provide numerical results for the case of the simple regulator.

AB - We consider a finite-buffer packet multiplexer to which traffic arrives from several independent sources. The traffic from each of the sources is regulated, i.e. the amount of traffic that can enter the multiplexer is constrained by known regulator constraints. The regulator constraints depend on the source and are more general than those resulting from cascaded leaky buckets. We assume that the traffic is adversarial to the extent permitted by the regulators. For lossless multiplexing, we show that if the original multiplexer is lossless it is possible to allocate bandwidth and buffer to the sources so that the resulting segregated systems are lossless. For lossy multiplexing, we use our results for lossless multiplexing to estimate the loss probability of the multiplexer. Our estimate involves transforming the original system into two independent resource systems, and using adversarial sources for the two independent resources to obtain a bound on the loss probability of the transformed system. We show that the adversarial sources are not extremal on-off sources, even when the regulator consists of a peak rate controller in series with a leaky bucket. We explicitly characterize the form of the adversarial source for the transformed problem. We also provide numerical results for the case of the simple regulator.

KW - Buffer-bandwidth tradeoff curve

KW - Call admission control

KW - Leaky bucket

KW - Quality-of-service guarantees

KW - Resource allocation

KW - Statistical multiplexing

KW - Worst-case sources

UR - http://www.scopus.com/inward/record.url?scp=0037082695&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0037082695&partnerID=8YFLogxK

U2 - 10.1016/S0140-3664(01)00359-0

DO - 10.1016/S0140-3664(01)00359-0

M3 - Article

AN - SCOPUS:0037082695

SN - 0140-3664

VL - 25

SP - 239

EP - 253

JO - Computer Communications

JF - Computer Communications

IS - 3

ER -