| | This Article | |
| |
| |
| | Share | |
| |
| |
| | Bibliographic References | |
| |
| |
| | Add to: | |
| |
 Digg
 Furl
 Spurl
 Blink
 Simpy
 Google
 Del.icio.us
 Y!MyWeb
| |
| | Search | |
| |
| |
| | |
A Core Stateless Bandwidth Broker Architecture for Scalable Support of Guaranteed Services
February 2004 (vol. 15 no. 2)
pp. 167-182
Abstract—We present a novel bandwidth broker architecture for scalable support of guaranteed services that decouples the QoS control plane from the packet forwarding plane. More specifically, under this architecture, core routers do not maintain any QoS reservation states, whether per-flow or aggregate. Instead, the QoS reservation states are stored at and managed by a bandwidth broker. There are several advantages of such a bandwidth broker architecture. Among others, it avoids the problem of inconsistent QoS states faced by the conventional hop-by-hop, distributed admission control approach. Furthermore, it allows us to design efficient admission control algorithms without incurring any overhead at core routers. The proposed bandwidth broker architecture is designed based on a core stateless virtual time reference system developed recently. This virtual time reference system provides a unifying framework to characterize, in terms of their abilities to support delay guarantees, both the per-hop behaviors of core routers and the end-to-end properties of their concatenation. In this paper, we focus on the design of efficient admission control algorithms under the proposed bandwidth broker architecture. We consider both per-flow end-to-end guaranteed delay services and class-based guaranteed delay services with flow aggregation. Using our bandwidth broker architecture, we demonstrate how admission control can be done on a per domain basis instead of on a “hop-by-hop” basis. Such an approach may significantly reduce the complexity of the admission control algorithms. In designing class-based admission control algorithms, we investigate the problem of dynamic flow aggregation in providing guaranteed delay services and devise a new apparatus to effectively circumvent this problem. We conduct detailed analyses to provide theoretical underpinning for our schemes as well as to establish their correctness. Simulations are also performed to demonstrate the efficacy of our schemes.
[1] 167 T. Anderson et al., Requirements for Separation of IP Control and Forwarding Internet Draft, Feb. 2002.[2] S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, and W. Weiss, An Architecture for Differentiated Services RFC 2475, Dec. 1998.[3] R. Braden, D. Clark, and S. Shenker, Integrated Services in the Internet Architecture: An Overview RFC 1633, June 1994.[4] R. Braden, L. Zhang, S. Berson, S. Herzog, and S. Jamin, Resource Reservation Protocol (RSVP) Version 1 Functional Specification RFC 2205, Sept. 1997.[5] R. Callon, P. Doolan, N. Feldman, A. Fredette, G. Swallow, and A. Viswanathan, A Framework for Multiprotocol Label Switching Internet Draft, Sept. 1999.[6] A. Demers, S. Keshav, and S. Shenker, Analysis and Simulation of a Fair Queueing Algorithm Proc. ACM SIGCOMM, pp. 1-12, Sept. 1989.[7] Z. Duan, Z.-L. Zhang, Y.T. Hou, and L. Gao, Decoupling QoS Control from Core Routers: A Novel Bandwidth Broker Architecture for Scalable Support of Guaranteed Services technical report, Dept. of Computer Science and Eng., Univ. of Minnesota, Jan. 2000.[8] L. Georgiadis, R. Guérin, V. Peris, and K.N. Sivarajan, Efficient Network QoS Provisioning Based on Per Node Traffic Shaping IEEE/ACM Trans. Networking, vol. 4, no. 4, pp. 482-501, 1996.[9] R. Guérin, S. Blake, and S. Herzog, Aggregating RSVP-Based QoS Requests Internet Draft, 1997.[10] K. Nichols, V. Jacobson, and L. Zhang, A Two-Bit Differentiated Services Architecture for the Internet RFC 2638, July 1999.[11] S. Rampal and R. Guérin, Flow Grouping for Reducing Reservation Requirements for Guaranteed Delay Service Internet Draft, July 1997.[12] E.C. Rosen, A. Viswanathan, and R. Callon, Multiprotocol Label Switching Architecture Internet Draft, Aug. 1999.[13] S. Shenker, C. Partridge, and R. Guérin, Specification of Guaranteed Quality of Service RFC 2212, Sept. 1997.[14] I. Stoica and H. Zhang, Providing Guaranteed Services Without Per Flow Management Proc. ACM SIGCOMM, Sept. 1999.[15] I. Stoica, H. Zhang, S. Shenker, R. Yavatkar, D. Stephens, A. Malis, Y. Bernet, Z. Wang, F. Baker, J. Wroclawski, C. Song, and R. Wilder, Per Hop Behaviors Based on Dynamic Packet States Internet Draft, Feb. 1999.[16] A. Terzis, J. Ogawa, S. Tsui, L. Wang, and L. Zhang, A Prototype Implementation of the Two-Tier Architecture for Differentiated Services Proc. IEEE Real-Time Technology and Applications Symp., 1999.[17] L. Wang, A. Terzis, and L. Zhang, A New Proposal of RSVP Refreshes Proc. IEEE Int'l Conf. Network Protocols, Nov. 1999.[18] L. Wang, A. Terzis, and L. Zhang, RSVP Refresh Overhead Reduction by State Compression Internet Draft, June 1999.[19] H. Zhang and D. Ferrari,“Rate-controlled static-priority queueing,” Proc. IEEE INFOCOM, pp. 227-236, June 1993.[20] L. Zhang, Virtual Clock: A New Traffic Control Algorithm for Packet Switching Networks Proc. ACM SIGCOMM, pp. 19-29, Sept. 1990.[21] L. Zhang, S. Deering, D. Estrin, S. Shenker, and D. Zappala, "RSVP: A New Resource Reservation Protocol," IEEE Network, vol. 7, no. 5, pp. 8-18, Sept. 1993.[22] Z.-L. Zhang, Z. Duan, and Y.T. Hou, Virtual Time Reference System: A Unifying Scheduling Framework for Scalable Support of Guaranteed Services IEEE J. Selected Areas in Comm., special issue on Internet QoS, Dec. 2000.[23] Z.-L. Zhang, Z. Duan, and Y.T. Hou, On Scalable Design of Bandwidth Brokers IEICE Trans. Comm., vol. 84, no. B(8), Aug. 2001.
Index Terms:
Network resource management, quality of services, bandwidth broker, admission control, flow aggregation.
Citation:
Zhenhai Duan, Zhi-Li Zhang, Yiwei Thomas Hou, Lixin Gao, "A Core Stateless Bandwidth Broker Architecture for Scalable Support of Guaranteed Services," IEEE Transactions on Parallel and Distributed Systems, vol. 15, no. 2, pp. 167-182, Feb. 2004, doi:10.1109/TPDS.2004.1264799
