Comparison between a Proposed QoS Mathematical Model and other IP QoS Models

Significant challenges has been introduced for IP networks with the advent of new emerging applications, such as VOIP and E-commerce, that require delivering quality guarantees. However, IP networks were originally designed to support best effort delivery only. Three quality of service (QoS) models, IntServ, DiffServ and multiprotocol label switching (MPLS) have been standardized by the Internet engineering task force (IETF). Although these methods guarantee delivery, they have drawbacks such as complexity, restrictions of predefined classes and higher end-to-end delay. In this paper, a new QoS mathematical model has been proposed. This model is based on the principles of network calculus in which an incoming traffic flow is regulated by an arrival curve that upper bounds its rate. Then, this traffic flow is lower bounded and delayed by a service latency time at each node on its way to the destination node. This model is compared with other IP QoS models, IntServ and DiffServ. The worst case end-to-end delay is derived and illustrated by a numerical example .The proposed model has achieved the lowest end-to-end delay compared with others.

[1]  S. Sivakumar,et al.  Implementing an IPv6 QoS management scheme using flow label & class of service fields , 2004, Canadian Conference on Electrical and Computer Engineering 2004 (IEEE Cat. No.04CH37513).

[2]  Zoubir Mammeri,et al.  Delay bound Guarantees with WFQ-based CBQ discipline , 2004, Twelfth IEEE International Workshop on Quality of Service, 2004. IWQOS 2004..

[3]  El Bahlul Fgee,et al.  Scalable qos and qos management models for ip networks , 2006 .

[4]  Patrick Thiran,et al.  A short tutorial on network calculus. I. Fundamental bounds in communication networks , 2000, 2000 IEEE International Symposium on Circuits and Systems. Emerging Technologies for the 21st Century. Proceedings (IEEE Cat No.00CH36353).

[5]  Roch Guérin,et al.  Quality-of-Service in Packet Networks: Basic Mechanisms and Directions , 1999, Comput. Networks.

[6]  Jean-Yves Le Boudec,et al.  Network Calculus: A Theory of Deterministic Queuing Systems for the Internet , 2001 .

[7]  Don Towsley,et al.  Theories and models for Internet quality of service , 2002, Proc. IEEE.

[8]  Towela P. R. Nyirenda-Jere,et al.  Impact of Traffic Aggregation on Network Capacity and Quality of Service : Preliminary Results , 2001 .

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