Dynamic Inter-SLA Resources Sharing in Differentiated Services Networks Based on Effective Bandwidth Allocation

  • Yu Cheng
  • Weihua Zhuang
Part of the The Springer International Series in Engineering and Computer Science book series (SECS, volume 712)


The differentiated services (DiffServ) architecture has been proposed as a scalable traffic management mechanism to ensure Internet quality-of-service (QoS) without using per-flow resource reservation and per-flow signaling, but it sacrifices the ability to accurately configure the network devices and to efficiently utilize the network resources. To address the problem, the DiffServ model should be augmented with traffic engineering tools and dynamic resource allocation techniques. This chapter investigates dynamic resource allocation over a traffic engineered DiffServ network, where the multiprotocol label switching (MPLS) technique is used to establish a path-oriented environment in a DiffServ domain for efficient resource management. A bandwidth borrowing technique is developed for dynamic resource sharing among SLAs. It improves re- source utilization on the time scale of a traffic flow lifetime, by exploiting the spare capacity of underloaded SLAs to admit traffic for overloaded SLAs. The call-level implementation of the bandwidth borrowing requires the effective bandwidth calculation for each traffic flow. For this purpose, the assured service is extended to provide loss probability guarantees and to derive an effective bandwidth expression based on such extension.


Traffic Flow Admission Control Effective Bandwidth Dynamic Resource Allocation Expedite Forwarding 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, and W. Weiss, “An architecture for differentiated services.” Internet RFC 2475, Dec. 1998.Google Scholar
  2. [2]
    V. Jacobson, K. Nichols, and K. Poduri, “An expedited forwarding PHB.” Internet RFC 2598, June 1999.Google Scholar
  3. [3]
    J. Heinanen, F. Baker, W. Weiss, and J. Wroclawski, “Assured forwarding PHB group.” Internet RFC 2597, June 1999.Google Scholar
  4. [4]
    A. Terzis, L. Wang, J. Ogawa, and L. Zhang, “A two-tier resource management model for the Internet,” in Proc. of IEEE GLOBECOM’99, vol. 3, pp. 1779–1791, 1999.Google Scholar
  5. [5]
    Z.-L. Zhang, Z. Duan, L. Gao, and Y. T. Hou, “Decoupling QoS control from core routers: A novel bandwidth broker architecture for scalable support of guaranteed services,” in Proc. of ACM SIG-COMM’OO, pp. 71–83, 2000.Google Scholar
  6. [6]
    P. Trimintzios and et al., “A management and control architecture for providing IP differentiated services in MPLS-based networks,” IEEE Communications Magazine, vol. 39, pp. 80–88, May 2001.Google Scholar
  7. [7]
    Y. Bernet and et al., “A framework for Integrated services operation over Diffserv networks.” Internet Draft, Sept. 1999. draft-ietf-issll-diffserv-rsvp-03.txt.Google Scholar
  8. [8]
    X. Xiao, A. Hannan, B. Bailey, and L. M. Ni, “Traffic engineering with MPLS in the Internet,” IEEE Network, vol. 14, pp. 28–33, March/April 2000.CrossRefGoogle Scholar
  9. [9]
    D. Awduche, J. Malcolm, J. Agogbua, M. O’Dell, and J. McManus, “Requirements for traffic engineering over MPLS.” Internet RFC 2702, Sept. 1999.Google Scholar
  10. [10]
    G. Armitage, “MPLS: The magic behind the myths,” IEEE Communications Magazine, vol. 38, pp. 124–131, Jan. 2000.CrossRefGoogle Scholar
  11. [11]
    G. Swallow, “MPLS advantages for traffic engineering,” IEEE Communications Magazine, vol. 37, pp. 54–57, Dec. 1999.CrossRefGoogle Scholar
  12. [12]
    C. Dou and F.-C. Ou, “Performance study of bandwidth reallocation algorithms for dynamic provisioning in differentiated services networks,” in Proc. of 15th International Conference on Information Networking, pp. 700–705, 2001.Google Scholar
  13. [13]
    C. Cetinkaya, V. Kanodia, and E. W. Knightly, “Scalable services via egress admission control,” IEEE Transactions on Multimedia, vol. 3, pp. 69–81, March 2001.CrossRefGoogle Scholar
  14. [14]
    J. Qiu and E. W. Knightly, “Measurement-based admission control with aggregate traffic envelopes,” IEEE/ACM Transactions on Networking, vol. 9, pp. 199–210, April 2001.CrossRefGoogle Scholar
  15. [15]
    Q. Ma and P. Steenkiste, “Supporting dynamic inter-class resource sharing: A multi-class QoS routing algorithm,” in Proc. of IEEE INFOCOM‘99, vol. 2, pp. 649–660, 1999.Google Scholar
  16. [16]
    J. Qiu and E. W. Knightly, “Inter-class resource sharing using statistical service envelopes,” in Proc. of IEEE INFOCOM’99, vol. 3, pp. 1404–1411, 1999.Google Scholar
  17. [17]
    S. C. Borst and D. Mitra, “Virtual partitioning for robust resource sharing: Computational techniques for heterogeneous traffic,” IEEE Journal on Selected Areas in Communications, vol. 16, pp. 668–678, June 1998.CrossRefGoogle Scholar
  18. [18]
    R. Garg and H. Saran, “Fair bandwidth sharing among virtual networks: A capacity resizing approach,” in Proc. of IEEE INFOCOM’00, vol. 1, pp. 255–264, 2000.Google Scholar
  19. [19]
    Y. Bernet and et al., “A framework for Differentiated Services.” Internet Draft, Feb. 1999. draft-ietf-diffserv-framework-02.txt.Google Scholar
  20. [20]
    D. Mitra and K. G. Ramakrishnan, “A case study of multiservice, multipriority traffic engineering design for data networks,” in Proc. of IEEE GLOBECOM’99, vol. 1 B, pp. 1077–1083, 1999.Google Scholar
  21. [21]
    A. Terzis, J. Ogawa, S. Tsui, L. Wang, and L. Zhang, “A prototype implementation of the two-tier architecture for differentiated services,” in Proc. of IEEE RTAS’99, 1999. Scholar
  22. [22]
    S. Floyd and V. Jacobson, “Link-sharing and resource management models for packet networks,” IEEE/ACM Transactions on Networking, vol. 34, pp. 365–386, Aug. 1995.CrossRefGoogle Scholar
  23. [23]
    V. G. Kulkarni, L. Gun, and P. F. Chimento, “Effective bandwidth vectors for multiclass traffic multiplexed in a partitioned buffer,” IEEE Journal on Selected Areas in Communications, vol. 13, pp. 1039–1047, Aug. 1995.CrossRefGoogle Scholar
  24. [24]
    Y. Cheng and W. Zhuang, “Optimal buffer partitioning for multiclass markovian traffic sources,” in Proc. of IEEE GLOBECOM’01, pp. 1852–1856, 2001.Google Scholar
  25. [25]
    A. I. Elwalid and D. Mitra, “Effective bandwidth of general Markovian traffic sources and admission control of high speed networks,” IEEE/ACM Transactions on Networking, vol. 1, pp. 329–343, June 1993.CrossRefGoogle Scholar
  26. [26]
    A. I. Elwalid and D. Mitra, “Fluid models for the analysis and design of statistical multiplexing with loss priorities on multiple classes of bursty traffic,” in Proc. of IEEE INFOCOM’92, vol. 1, pp. 415 – 425, 1992.Google Scholar
  27. [27]
    Y. Cheng and W. Zhuang, “Effective bandwidth of multiclass markovain traffic sources and admission control with dynamic buffer partitioning.” Accepted for presentation at IEEE GLOBECOM’02. Google Scholar

Copyright information

© Springer Science+Business Media New York 2003

Authors and Affiliations

  • Yu Cheng
    • 1
  • Weihua Zhuang
    • 1
  1. 1.Centre for Wireless Communications (CWC) Department of Electrical and Computer EngineeringUniversity of WaterlooWaterlooCanada

Personalised recommendations