QoS guarantees of point-to-multipoint VPLS connections

Guaranteeing the statistical delay for real time connections is an area of interest for many researchers, consequently, several analytical and measurement based admission control algorithms (MBAC) are proposed. The proposed analytical algorithms provide solutions based on traffic fluid models or service disciplines which do not isolate the different flows at the schedular. The proposed MBAC algorithm can not meet the distinct violation probability requirements of a connection. Thus, in this paper we propose a new MBAC algorithm, which is capable of meeting the distinct violation probability requirement. The algorithm utilizes the weighted fair queueing (WFQ) scheduler that is capable of isolating the traffic flows. The proposed algorithm is different from other MBAC algorithms, since it admits requests based on delay measurement rather than bandwidth measurement as most MBAC algorithms do. This facilitates meeting the distinct violation probability requirement of the connections. The simulation results revealed that the proposed algorithm can admit three times the deterministic algorithm for distinct delay requirements.

[1]  H. T. Mouftah,et al.  A distributed bandwidth-guaranteed routing algorithm for point-to-multipoint VPLS virtual connections , 2005, IEEE International Conference on Communications, 2005. ICC 2005. 2005.

[2]  Andrew W. Moore,et al.  An implementation-based comparison of Measurement-Based Admission Control algorithms , 2004, J. High Speed Networks.

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

[4]  Albert G. Greenberg,et al.  A flexible model for resource management in virtual private networks , 1999, SIGCOMM '99.

[5]  Nsf Ncr,et al.  A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single Node Case* , 1991 .

[6]  Edward W. Knightly,et al.  Measurement-based admission control with aggregate traffic envelopes , 2001, TNET.

[7]  Simon Crosby,et al.  Statistical properties of a near-optimal measurement-based CAC algorithm , 1997, IEEE ATM '97 Workshop Proceedings (Cat. No.97TH8316).

[8]  Amarnath Mukherjee,et al.  On the Dynamics and Significance of Low Frequency Components of Internet Load , 1992 .

[9]  Tzi-cker Chiueh,et al.  Probabilistic delay guarantees using delay distribution measurement , 2004, MULTIMEDIA '04.

[10]  R. J. Gibbensa,et al.  Measurement-based connection admission control , 2007 .

[11]  Peter B. Danzig,et al.  A measurement-based admission control algorithm for integrated services packet networks , 1995, SIGCOMM '95.

[12]  Scott Shenker,et al.  Comments on the performance of measurement-based admission control algorithms , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[13]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[14]  Peter B. Danzig,et al.  A measurement-based admission control algorithm for integrated service packet networks , 1997, TNET.

[15]  Martin Reisslein,et al.  Measurement‐based admission control for bufferless multiplexers , 2001, Int. J. Commun. Syst..

[16]  Alberto Leon-Garcia,et al.  A simulation study of delay and delay variation in ATM networks .I. CBR traffic , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[17]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the single node case , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[18]  David Tse,et al.  A time-scale decomposition approach to measurement-based admission control , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[19]  S. Floyd.  Comments on Measurement-based Admissions Control for Controlled-Load Services , 1996 .

[20]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.

[21]  Bernd Girod,et al.  Congestion-distortion optimized scheduling of video over a bottleneck link , 2004, IEEE 6th Workshop on Multimedia Signal Processing, 2004..

[22]  Nick G. Duffield,et al.  Entropy of ATM Traffic Streams: A Tool for Estimating QoS Parameters , 1995, IEEE J. Sel. Areas Commun..