This Article 
 Bibliographic References 
 Add to: 
Bandwidth Management for Supporting Differentiated Service Aware Traffic Engineering
September 2007 (vol. 18 no. 9)
pp. 1320-1331
This paper presents a bandwidth management framework for the support of the differentiated service aware traffic engineering (DS-TE) in the multiprotocol label switching (MPLS) networks. Our bandwidth management framework contains both bandwidth allocation and preemption mechanisms, in which the link bandwidth is managed in two dimensions: class type and preemption priority. We put forward a Max- Min bandwidth constraint model, in which we propose a novel "use it or lend it" strategy. The new model is able to guarantee a minimum bandwidth for each class type without causing resource fragmentation. Furthermore, we design three new bandwidth preemption algorithms for three bandwidth constraint models, respectively. An extensive simulation study is carried out to evaluate the effectiveness of the bandwidth constraint models and preemption algorithms. Comparing with the existing constraint models and preemption rules, the proposed Max-Min constraint model and preemption algorithms improve not only bandwidth efficiency, but also robustness and fairness. They achieve significant performance improvement for the well-behaving traffic classes, in terms of bandwidth utilization, bandwidth blocking and preemption probability. We also provide guidelines for selecting different DS-TE bandwidth management mechanisms.

[1] F. Le Faucheur et al., MPLS Support of Differentiated Services, IETF RFC 3270, May 2002.
[2] S. Blake et al., An Architecture for Differentiated Services, IETF RFC 2475, Dec. 1998.
[3] D. Awduche et al., RSVP-TE Extension to RSVP for LSP Tunnels, RFC 3209, Dec. 2001.
[4] D. Awduche et al., Overview and Principles of Internet Traffic Engineering, RFC 3272, May 2002.
[5] D. Awduche et al., Requirements for Traffic Engineering over MPLS, IETF RFC 2702, Sept. 1999.
[6] F. Le Faucheur and W. Lai, Requirements for Support of Differentiated Service Aware MPLS Traffic Engineering, IETF RFC 3564, July 2003.
[7] F. Le Faucheur et al., “Maximum Allocation Bandwidth Constraints Model for Diff-Serv-Aware MPLS Traffic Engineering,” IETF Internet draft, 2004.
[8] F. Le Faucheur et al., “Russian Dolls Bandwidth Constraints Model for Diff-Serv-Aware MPLS Traffic Engineering,” IETF Internet draft, 2004.
[9] W.S. Lai, “Traffic Engineering for MPLS,” Proc. Internet Performance and Control of Network Systems III Conf., vol. 4865, pp. 256-267, July 2002.
[10] F. Kamoun and L. Kleinrock, “Analysis of Shared Finite Storage in a Computer Network Node Environment under General Traffic Conditions,” IEEE Trans. Comm., vol. 28, no. 7, pp. 992-1003, July 1980.
[11] D. Mitra and I. Ziedins, “Hierarchical Virtual Partitioning: Algorithms for Virtual Private Networking,” Proc. IEEE GLOBECOM '97, pp. 1784-1891, 1997.
[12] S.C. Borst and D. Mitra, “Virtual Partitioning for Robust Resource Sharing: Computational Techniques for Heterogeneous Traffic,” IEEE J. Selected Areas in Comm., vol. 16, no. 5, pp. 668-678, June 1998.
[13] E. Bouillet, D. Mitra, and K.G. Ramakrishnan, “The Structure and Management of Service Level Agreements in Networks,” IEEE J.Selected Areas in Comm., vol. 20, no. 4, pp. 691-699, May 2002.
[14] W. Jia et al., “Distributed Admission Control for Anycast Flows,” IEEE Trans. Parallel and Distributed Systems, vol. 15, no. 8, pp. 673-686, Aug. 2004.
[15] M. Peyravian and A.D. Kshemkalyani, “Decentralized Network Connection Preemption Algorithms,” Computer Network and ISDN System, vol. 30, no. 11, pp. 1029-1043, June 1998.
[16] S. Jeon, R.T. Abler, and A.E. Goulart, “The Optimal Connection Preemption Algorithm in a Multi-Class Network,” Proc. IEEE Int'l Conf. Comm. (ICC '02), pp. 2294-2298, Apr. 2002.
[17] J.C. de Oliveira et al., “A New Preemption Policy for DiffServ-Aware Traffic Engineering to Minimize Rerouting,” Proc. IEEE INFOCOM '02, May 2002.
[18] C. Scoglio et al., “TEAM: A Traffic Engineering Automated Manager for DiffServ-Based MPLS Networks,” IEEE Comm. Magazine, pp. 134-145, Oct. 2004.
[19] R. Guerin, A. Orda, and D. Williams, “QoS Routing Mechanisms and OSPF Extensions,” Proc. GLOBECOM '97, pp. 1903-1908, Nov. 1997.
[20] Q. Ma and P. Steenkiste, “Supporting Dynamic Inter-Class Resource Sharing: A Multi-Class QoS Routing Algorithm,” Proc. IEEE INFOCOM '99, pp. 649-660, 1999.
[21] W.C. Lee, M.G. Hluchyj, and P.A. Humblet, “Routing Subject to Quality-of-Service Constraints in Integrated Communication Networks,” IEEE Network, vol. 9, no. 4, pp. 14-16, July-Aug. 1995.
[22] F. Le Faucheur et al., Protocol Extensions for Support of Differentiated-Service-Aware MPLS Traffic Engineering, IETF Internet draft, Mar. 2004.
[23] Z. Duan et al., “A Core Stateless Bandwidth Broker Architecture for Scalable Support of Guaranteed Services,” IEEE Trans. Parallel and Distributed Systems, vol. 15, no. 2, pp. 167-181, Feb. 2004.
[24] B. Teitelbaum et al., “Internet2 QBone: Building a Testbed for Differentiated Services,” IEEE Network, vol. 13, no. 5, pp. 8-16, Sept. 1999.
[25] J. Ash, “Max Allocation with Reservation Bandwidth Constraints Model for DiffServ-Aware MPLS Traffic Engineering and Performance Comparison,” IETF Internet draft, Jan. 2004.
[26] L. Kalampoukas, A. Verma, and K.K. Ramakrishnan, “An Efficient Rate Allocation Algorithm for ATM Networks Providing Max-Min Fairness,” Proc. Sixth IFIP Int'l Conf. High-Performance Networking, pp. 143-154, Sept. 1995.
[27] Y.T. Hou, S.S. Panwar, and H.H.-Y. Tzeng, “On Generalized Max-Min Rate Allocation and Distributed Convergence Algorithm for Packet Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 15, no. 5, pp. 401-416, May 2004.

Index Terms:
Resource Management, Admission Control, Differentiated Service, Traffic Engineering
Tong Shan, Oliver Yang, "Bandwidth Management for Supporting Differentiated Service Aware Traffic Engineering," IEEE Transactions on Parallel and Distributed Systems, vol. 18, no. 9, pp. 1320-1331, Sept. 2007, doi:10.1109/TPDS.2007.1052
Usage of this product signifies your acceptance of the Terms of Use.