Dynamic inter-SLA resource sharing in path-oriented differentiated services networks

ABSTRACT

This paper proposes novel resource sharing schemes for differentiated services (DiffServ) networks, to achieve both high resource utilization and quality of service (QoS) guarantee. Service level agreements (SLAs) are negotiated at network boundaries and supported by path-oriented resource mapping within the network. The recently proposed SLA management scheme based on virtual partitioning (Bouillet et al., 2002) allows overloaded SLAs to exploit the spare capacity of underloaded SLAs for efficient resource utilization, however, at the the cost of possible SLA violation of the underloaders. In the bandwidth borrowing scheme proposed here, the dedicated bandwidth for underloaded SLAs is determined and adaptively adjusted at network boundaries according to the actual traffic load and QoS policies; the available spare capacity is then properly distributed to related links for lending to others. On the other hand, the traffic flows admitted with borrowed bandwidth are tagged and may be preempted later when the original bandwidth owner needs to claim back the resources. Through a detailed implementation design and extensive computer simulation results we show that, by bandwidth borrowing, both SLA compliance and high resource utilization can be achieved in various load conditions, with some side benefits such as call-level service differentiation, small admission overhead, and convenience for policy-based management. In addition, we propose a distributed bandwidth pushing scheme that can dynamically adjust the spare bandwidth distribution over the network. Combining bandwidth pushing with bandwidth borrowing, the resource utilization can be further improved.

REFERENCES

• 1: S. Blake , D. Black , M. Carlson , E. Davies , Z. Wang , W. Weiss, An Architecture for Differentiated Service, RFC Editor, 1998
• 2: K. Nichols , V. Jacobson , L. Zhang, A Two-bit Differentiated Services Architecture for the Internet, RFC Editor, 1999
• 3: [3] A. Terzis, L. Wang, J. Ogawa, and L. Zhang, "A two-tier resource management model for the Internet," in Proc. IEEE GLOBECOM, 1999, vol. 3, pp. 1779-1791.
• 4: Zhi-Li Zhang , Zhenhai Duan , Lixin Gao , Yiwei Thomas Hou, Decoupling QoS control from core routers: a novel bandwidth broker architecture for scalable support of guaranteed services, Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, p.71-83, August 28-September 01, 2000, Stockholm, Sweden
• 5: [5] X. Xiao, A. Hannan, B. Bailey, and L. M. Ni, "Traffic engineering with MPLS in the Internet," IEEE Network, vol. 14, no. 2, pp. 28-33, Mar./ Apr. 2000.
• 6: D. Awduche , J. Malcolm , J. Agogbua , M. O'Dell , J. McManus, Requirements for Traffic Engineering Over MPLS, RFC Editor, 1999
• 7: [7] F. P. Kelly, P. B. Key, and S. Zachary, "Distributed admission control," IEEE J. Sel. Areas Commun., vol. 18, no. 12, pp. 2617-2628, Dec. 2000.
• 8: [8] E. Mykoniati, C. Charalampous, P. Georgatsos, T. Damilatis, D. Goderis, P. Trimintzios, G. Pavlou, and D. Griffin, "Admission control for providing QoS in DiffServ IP networks: the TEQUILA approach," IEEE Commun. Mag., vol. 41, no. 1, pp. 38-44, Jan. 2003.
• 9: [9] Y. Cheng and W. Zhuang, "Effective bandwidth of multiclass Markovian traffic sources and admission control with dynamic buffer partitioning," IEEE Trans. Commun., vol. 51, no. 9, pp. 1524-1535, Sep. 2003.
• 10: [10] G. Armitage, "MPLS: the magic behind the myths," IEEE Commun. Mag., vol. 38, no. 1, pp. 124-131, Jan. 2000.
• 11: [11] G. Swallow, "MPLS advantages for traffic engineering," IEEE Commun. Mag., vol. 37, no. 12, pp. 54-57, Dec. 1999.
• 12: [12] E. Bouillet, D. Mitra, and K. G. Ramakrishnan, "The structure and management of service level agreements in networks," IEEE J. Sel. Areas Commun., vol. 20, no. 4, pp. 691-699, May 2002.
• 13: [13] P. Trimintzios et al., "A management and control architecture for providing IP differentiated services in MPLS-based networks," IEEE Commun. Mag., vol. 39, no. 5, pp. 80-88, May 2001.
• 14: [14] S. Wang, D. Xuan, R. Bettati, and W. Zhao, "Providing absolute differentiated services for real-time applications in static-priority scheduling networks," in Proc. IEEE INFOCOM, 2001, vol. 2, pp. 669-678.
• 15: Chie Dou , Fang-Ching Ou, Performance Study of Bandwidth Reallocation Algorithms for Dynamic Provisioning in Differential Services Networks, Proceedings of the The 15th International Conference on Information Networking, p.700, January 31-February 02, 2001
• 16: [16] J. Qiu and E. W. Knightly, "Inter-class resource sharing using statistical service envelopes," in Proc. IEEE INFOCOM, 1999, vol. 3, pp. 1404-1411.
• 17: [17] R. R. Boorstyn, A. Burchard, J. Liebeherr, and C. Oottamakorn, "Statistical service assurances for traffic scheduling algorithms," IEEE J. Sel. Areas Commun., vol. 18, no. 12, pp. 2651-2664, Dec. 2000.
• 18: [18] C. Cetinkaya, V. Kanodia, and E. W. Knightly, "Scalable services via egress admission control," IEEE Trans. Multimedia, vol. 3, no. 1, pp. 69-81, Mar. 2001.
• 19: Jingyu Qiu , Edward W. Knightly, Measurement-based admission control with aggregate traffic envelopes, IEEE/ACM Transactions on Networking (TON), v.9 n.2, p.199-210, April 2001 [doi>10.1109/90.917076]
• 20: [20] S. C. Borst and D. Mitra, "Virtual partitioning for robust resource sharing: Computational techniques for heterogeneous traffic," IEEE J. Sel. Areas Commun., vol. 16, no. 5, pp. 668-678, Jun. 1998.
• 21: [21] R. Garg and H. Saran, "Fair bandwidth sharing among virtual networks: A capacity resizing approach," in Proc. IEEE INFOCOM, 2000, vol. 1, pp. 255-264.
• 22: Arthur W. Berger , Ward Whitt, Effective bandwidths with priorities, IEEE/ACM Transactions on Networking (TON), v.6 n.4, p.447-460, Aug. 1998 [doi>10.1109/90.720887]
• 23: [23] R. J. Gibbens and F. P. Kelly, "Network programming methods for loss networks," IEEE J. Sel. Areas Commun., vol. 13, no. 7, pp. 1189-1198, Sep. 1995.
• 24: [24] P. B. Key, "Optimal control and trunk reservation in loss networks," Prob. Eng. Info. Sci., vol. 4, pp. 203-242, 1990.
• 25: [25] P. Flegkas, P. Trimintzios, and G. Pavlou, "A policy-based quality of service management system for IP DiffServ network," IEEE Network, vol. 16, no. 2, pp. 50-56, Mar.-Apr. 2002.
• 26: V. Jacobson , K. Nichols , K. Poduri, An Expedited Forwarding PHB, RFC Editor, 1999
• 27: J. Heinanen , F. Baker , W. Weiss , J. Wroclawski, Assured Forwarding PHB Group, RFC Editor, 1999
• 28: [28] D. Mitra and K. G. Ramakrishnan, "A case study of multiservice, multipriority traffic engineering design for data networks," in Proc. IEEE GLOBECOM, 1999, vol. 1B, pp. 1077-1083.
• 29: [29] Y. Cheng and W. Zhuang, "Diffserv resource allocation for fast handoff in wireless mobile internet," IEEE Commun. Mag., vol. 40, no. 5, pp. 130-136, May 2002.
• 30: Vern Paxson , Sally Floyd, Wide area traffic: the failure of Poisson modeling, IEEE/ACM Transactions on Networking (TON), v.3 n.3, p.226-244, June 1995 [doi>10.1109/90.392383]
• 31: A. Feldmann , A. C. Gilbert , W. Willinger , T. G. Kurtz, The changing nature of network traffic: scaling phenomena, ACM SIGCOMM Computer Communication Review, v.28 n.2, p.5-29, Apr. 1998 [doi>10.1145/279345.279346]
• 32: Sugih Jamin , Peter B. Danzig , Scott J. Shenker , Lixia Zhang, A measurement-based admission control algorithm for integrated service packet networks, IEEE/ACM Transactions on Networking (TON), v.5 n.1, p.56-70, Feb. 1997 [doi>10.1109/90.554722]

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.3 Network Operations

Additional Classification:
  C. Computer Systems Organization
  C.4 PERFORMANCE OF SYSTEMS
      Subjects: Design studies; Reliability, availability, and serviceability; Performance attributes

General Terms:
Algorithms, Design, Performance

Keywords:
bandwidth borrowing, diffServ, inter-SLA resource sharing, resource allocation, service level agreement