Extremal shape-controlled traffic patterns in high-speed networks

We consider a variable bit-rate connection with a deterministically shaped random traffic process, as specified by communications networking standards. Regarding randomness, we assume no restricted model other than the natural requirement that the process be stationary and ergodic. Given only the shape parameters, we consider the open problem of determining the maximum service bandwidth required to achieve a given bound on the probability that the packet-transfer delay exceeds a certain threshold. The shape parameters together with a probabilistic bound on the packet-transfer delay define a variable bit-rate "channel"; an equivalent problem is to determine the "capacity" of this channel. To this end, we consider a queue with a constant service rate and a shaped arrival process and obtain tight bounds on queue occupancy and queueing delay. In particular, we describe that traffic pattern (among all stationary-ergodic and deterministically constrained arrival processes) which achieves the probabilistic bound.

[1]  George Kesidis,et al.  Bandwidth adjustments using online packet-level measurements , 1999, Optics East.

[2]  Venkat Anantharam,et al.  A methodology for the design of optimal traffic shapers in communication networks , 1999, IEEE Trans. Autom. Control..

[3]  Hiroshi Saito,et al.  Call admission control in an ATM network using upper bound of cell loss probability , 1992, IEEE Trans. Commun..

[4]  George Kesidis,et al.  Worst-case performance of a buffer with independent shaped arrival processes , 2000, IEEE Communications Letters.

[5]  Takis Konstantopoulos,et al.  On the dynamics and performance of stochastic fluid systems , 2000, Journal of Applied Probability.

[6]  Jean C. Walrand,et al.  Effective bandwidths for multiclass Markov fluids and other ATM sources , 1993, TNET.

[7]  Bharat T. Doshi,et al.  Deterministic rule based traffic descriptors for broadband ISDN: worst case behavior and connection acceptance control , 1993, Proceedings of GLOBECOM '93. IEEE Global Telecommunications Conference.

[8]  Gustavo de Veciana,et al.  Conservation laws and reflection mappings with an application to multiclass mean value analysis for stochastic fluid queues , 1996 .

[9]  P. Glynn,et al.  Logarithmic asymptotics for steady-state tail probabilities in a single-server queue , 1994, Journal of Applied Probability.

[10]  Debasis Mitra,et al.  Effective bandwidth of general Markovian traffic sources and admission control of high speed networks , 1993, TNET.

[11]  Philippe Oechslin,et al.  Worst Case Arrivals of Leaky Bucket Constrained Sources: The Myth of the On-Off source , 1997 .

[12]  François Baccelli,et al.  Elements Of Queueing Theory , 1994 .

[13]  Donald F. Towsley,et al.  Source time scale and optimal buffer/bandwidth trade-off for regulated traffic in an ATM node , 1997, Proceedings of INFOCOM '97.

[14]  Alexei A. Gaivoronski,et al.  Worst case analysis of ATM sources with application to access engineering of broadband multiservice networks , 1994 .

[15]  Keith W. Ross,et al.  Packet multiplexers with adversarial regulated traffic , 2002, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[16]  Venkat Anantharam,et al.  Optimal flow control schemes that regulate the burstiness of traffic , 1995, TNET.

[17]  Venkat Anantharam,et al.  Burst reduction properties of the leaky bucket flow control scheme in ATM networks , 1994, IEEE Trans. Commun..

[18]  Debasis Mitra,et al.  A New Approach for Allocating Buffers and Bandwidth to Heterogeneous Regulated Traffic in an ATM Node , 1995, IEEE J. Sel. Areas Commun..

[19]  James Roberts.  Virtual spacing for flexible traffic control , 1994 .

[20]  George Kesidis.  ATM network performance (2nd ed.) , 2000 .

[21]  D. Mitra,et al.  Multiple Time Scale Regulation and Worst Case Processes for ATM Network Control , 1995, Proceedings of 1995 34th IEEE Conference on Decision and Control.

[22]  Rene L. Cruz,et al.  A calculus for network delay, Part I: Network elements in isolation , 1991, IEEE Trans. Inf. Theory.

[23]  Cheng-Shang Chang,et al.  Stability, queue length, and delay of deterministic and stochastic queueing networks , 1994, IEEE Trans. Autom. Control..

[24]  Ayalvadi J. Ganesh,et al.  Bayesian network management , 1998, Queueing Syst. Theory Appl..

[25]  Frank P. Kelly,et al.  Effective bandwidths at multi-class queues , 1991, Queueing Syst. Theory Appl..

[26]  George Kesidis.  ATM Network Performance , 1996, Springer US.

[27]  Nick Duffield,et al.  Large deviations and overflow probabilities for the general single-server queue, with applications , 1995 .