A Premium Traffic Management in DiffServ Through End-to-End Delay Budget Partitioning

Our novel Call Admission Control (CAC) scheme [1], [2] determines the number of Expedited Forwarding (EF) (Premium) flows accepted, based on e2e available bandwidth measurement. However, it does not control the number of flows that could be accepted at a node or over a link along a selected routing path for an EF flow. Hence we complemented the functionality of CAC withoriginal traffic management algorithms [2], [3] to balance EF traffic along the selected routing path for new EF flows and consequently across Differentiated Services (DiffServ) network. The novelty of these algorithms emerges from the fact that they employ an optimization dimension of EF traffic, namely the partitioning of End-to-End (e2e) delay required for a new flow into per-link or per-DiffServ node along the selected routing path. Furthermore, some network resource policies are incorporated with these algorithms to apportion the e2e resource required for EF traffic flows intoper-DiffServ node requirement along the selected routing path. We demonstrate through analysis and simulation that our proposed optimal e2e delay budget management algorithms are superior to Equi-Partitioning (EP) algorithm for DiffServ in guaranteeing e2e delay bounds required forEF flows. Furthermore, highly loaded DiffServ nodes are assigned low delay budget and the opposite for low loaded DiffServ nodes, which result in increasing DiffServ network resource utilization.

[1]  Hamada Alshaer,et al.  Expedited Forwarding End to End Delay Jitter in the Differentiated Services Networks , 2004, HSNMC.

[2]  Vijay Sivaraman,et al.  Providing end-to-end statistical delay guarantees with earliest deadline first scheduling and per-hop traffic shaping , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[3]  H. Alshaer,et al.  Expedited forwarding end-to-end delay budget partitioning , 2006, CCNC 2006. 2006 3rd IEEE Consumer Communications and Networking Conference, 2006..

[4]  Henning Schulzrinne,et al.  Real-time communication in packet-switched networks , 1994, Proc. IEEE.

[5]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the multiple node case , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[6]  Rene Leonardo Cruz.  A Calculus for Network Delay and a Note on Topologies of Interconnection Networks , 1987 .

[7]  Van Jacobson,et al.  A Two-bit Differentiated Services Architecture for the Internet , 1999, RFC.

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

[9]  Lisa Zhang,et al.  Minimizing end-to-end delay in high-speed networks with a simple coordinated schedule , 2004, J. Algorithms.

[10]  Donald F. Towsley,et al.  Local Allocation of End-to-End Quality-of-Service in High-Speed Networks , 1993, Modelling and Evaluation of ATM Networks.

[11]  Domenico Ferrari,et al.  Rate-Controlled Service Disciplines , 1994, J. High Speed Networks.

[12]  Hamada Alshaer,et al.  Expedited Forwarding End to End Delay Variations , 2004, ICT.

[13]  David D. Clark,et al.  Explicit allocation of best-effort packet delivery service , 1998, TNET.

[14]  James W. Layland,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[15]  Jean-Yves Le Boudec,et al.  An Expedited Forwarding PHB (Per-Hop Behavior) , 2002, RFC.

[16]  Dinesh C. Verma,et al.  A Scheme for Real-Time Channel Establishment in Wide-Area Networks , 1990, IEEE J. Sel. Areas Commun..

[17]  Ariel Orda,et al.  QoS routing in networks with inaccurate information: theory and algorithms , 1999, TNET.

[18]  Ariel Orda,et al.  A scalable approach to the partition of QoS requirements in unicast and multicast , 2002, IEEE/ACM Transactions on Networking.

[19]  Ariel Orda,et al.  Optimal partition of QoS requirements on unicast paths and multicast trees , 2002, TNET.

[20]  James F. Kurose,et al.  Open issues and challenges in providing quality of service guarantees in high-speed networks , 1993, CCRV.

[21]  Murali S. Kodialam,et al.  Minimum interference routing with applications to MPLS traffic engineering , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[22]  Edward W. Knightly,et al.  Providing end-to-end statistical performance guarantees with bounding interval dependent stochastic models , 1994, SIGMETRICS.

[23]  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.

[24]  Hamada Alshaer,et al.  Expedited Forwarding Delay Budget Through a Novel Call Admission Control , 2004, ECUMN.

[25]  Yuval Shavitt,et al.  Optimal partition of QoS requirements with discrete cost functions , 2000, IEEE Journal on Selected Areas in Communications.

[26]  GeorgiadisL.,et al.  Optimal multiplexing on a single link , 2006 .

[27]  Zheng Wang,et al.  An Architecture for Differentiated Services , 1998, RFC.

[28]  QUTdN QeO,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

[29]  Yuval Shavitt,et al.  Optimal partition of QoS requirements with discrete cost functions , 2000, IEEE J. Sel. Areas Commun..

[30]  Funda Ergün,et al.  QoS routing with performance-dependent costs , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[31]  Donald F. Towsley,et al.  Call admission and resource reservation for multicast sessions , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[32]  Murali S. Kodialam,et al.  Resource allocation in a multicast tree , 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).