Studying the Effective Bandwidth through the Distribution of One-Way Delays

This paper describes a method of estimating the effective bandwidth through modeling the tail probability of one-way cumulative variable delays. In order to estimate the effective bandwidth of a fixed one-way path, a sequence of probing packets are sent from a source to a sink along the one-way path. The one-way cumulative variable delays are first estimated based on the local time measurements made at the two end nodes with respect to their skew-free local clocks. The modeling of the distribution of one-way cumulative variable delays is based on the assumption that the traffic pattern along the one-way path follows a Gaussian distribution. Under the assumption of Gaussian traffic, the tail probability of the one-way cumulative variable delays can be expressed in an exponential form. The effective bandwidth of a fixed one-way path is derived from the exponent of the exponential-form tail probability of the one-way cumulative variable delays. Our method has been numerically analyzed using data samples collected from network simulations. The numerical analysis shows that, at lower delay bounds, the effective bandwidth estimated from our modeling is quite comparable to the effective bandwidth calculated from the empirical tail probability of the one-way variable delays measured in simulations. At the higher delay bounds, the effective bandwidth estimated from our modeling is projected to be more accurate than the the effective bandwidth calculated from the empirical measurements.

[1]  Dan Keun Sung,et al.  Effective bandwidth for a single server queueing system with fractional Brownian input , 2005, Perform. Evaluation.

[2]  Eduardo Magaña,et al.  One-way Delay Measurement and Characterization , 2007, International Conference on Networking and Services (ICNS '07).

[3]  Choi Jin-Hee,et al.  One-Way Delay Estimation and Its Application , 2005 .

[4]  Scott Shenker,et al.  Specification of Guaranteed Quality of Service , 1997, RFC.

[5]  Israel Cidon,et al.  One-way delay estimation using network-wide measurements , 2006, IEEE Transactions on Information Theory.

[6]  Jean C. Walrand,et al.  Decoupling bandwidths for networks: a decomposition approach to resource management , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

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

[8]  Frank Kelly,et al.  Notes on effective bandwidths , 1994 .

[9]  Hamid Ahmadi,et al.  Equivalent Capacity and Its Application to Bandwidth Allocation in High-Speed Networks , 1991, IEEE J. Sel. Areas Commun..

[10]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[11]  David L. Mills,et al.  Network Time Protocol (Version 3) Specification, Implementation and Analysis , 1992, RFC.

[12]  Jean C. Walrand,et al.  Effective bandwidths: Call admission, traffic policing and filtering for ATM networks , 1995, Queueing Syst. Theory Appl..

[13]  David L. Mills,et al.  Network Time Protocol (Version 3) Specification, Implementation , 1992 .

[14]  David L. Mills Improved algorithms for synchronizing computer network clocks , 2001 .

[15]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .

[16]  Konstantina Papagiannaki,et al.  Analysis of point-to-point packet delay in an operational network , 2007, Comput. Networks.

[17]  David L. Black,et al.  An Architecture for Differentiated Service , 1998 .

[18]  Dan Grossman,et al.  New Terminology and Clarifications for Diffserv , 2002, RFC.

[19]  Ness B. Shroff,et al.  A measurement-analytic framework for QoS estimation based on the dominant time scale , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[20]  David L. Mills Improved algorithms for synchronizing computer network clocks , 1994, SIGCOMM 1994.

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

[22]  R. M. Loynes,et al.  The stability of a queue with non-independent inter-arrival and service times , 1962, Mathematical Proceedings of the Cambridge Philosophical Society.

[23]  C H Chang,et al.  EFFECTIVE BANDWIDTH IN HIGHSPEED DIGITAL NETWORKS , 1995 .

[24]  Ness B. Shroff,et al.  New bounds and approximations using extreme value theory for the queue length distribution in high-speed networks , 1998, 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.

[25]  Ward Whitt,et al.  Exponential Approximations for Tail Probabilities in Queues, I: Waiting Times , 1995, Oper. Res..

[26]  Van Jacobson,et al.  Controlling Queue Delay , 2012, ACM Queue.