High Performance Fair Bandwidth Allocation for Resilient Packet Rings

The Resilient Packet Ring (RPR) IEEE 802.17 standard is under development as a new high-speed backbone technology for metropolitan area networks. A key performance objective of RPR is to simultaneously achieve high utilization, spatial reuse, and fairness, an objective not achieved by current technologies such as SONET and Gigabit Ethernet nor by legacy ring technologies such as FDDI. The core technical challenge for RPR is the design of a bandwidth allocation algorithm that dynamically achieves these properties. The difficulty is in the distributed nature of the problem, that upstream ring nodes must inject traffic at a rate according to congestion and fairness criteria downstream. Unfortunately, the proposed algorithms in the current draft standards have a number of critical limitations. For example, we show that in a two-flow two-link scenario with unbalanced and constant-rate traffic demand, a draft RPR algorithm will suffer from dramatic bandwidth oscillations within nearly the entire range of the link capacity. Moreover, such oscillations hinder spatial reuse and decrease throughput significantly. In this paper, we introduce a new dynamic bandwidth allocation algorithm called Distributed Virtual-time Scheduling in Rings (DVSR). The key idea is for nodes to compute a simple lower bound of temporally and spatially aggregated virtual time using per-ingress counters of packet (byte) arrivals. We show that with this information propagated along the ring, each node can remotely approximate the ideal fair rate for its own traffic at each downstream link. Hence, DVSR flows rapidly converge to their ring-wide fair rates while maximizing spatial reuse. To evaluate DVSR, we bound the deviation in service between DVSR and an idealized reference model, thereby bounding the unfairness. With simulations, we find that compared to current techniques, DVSR’s convergence times are an order of magnitude faster (e.g., 2 vs. 50 msec), oscillations are mitigated (e.g., ranges of 1% vs. up to 100%), and nearly complete spatial reuse is achieved (e.g., 0.1% throughput loss vs. 14%).

[1]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[2]  Vaduvur Bharghavan,et al.  Achieving MAC layer fairness in wireless packet networks , 2000, MobiCom '00.

[3]  George Varghese,et al.  Efficient fair queueing using deficit round-robin , 1996, TNET.

[4]  Laurent Massoulié,et al.  Bandwidth sharing: objectives and algorithms , 2002, TNET.

[5]  Leandros Tassiulas,et al.  Performance measures and scheduling policies in ring networks , 1995, TNET.

[6]  S. Jamaloddin Golestani,et al.  A self-clocked fair queueing scheme for broadband applications , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[7]  H. T. Kung,et al.  Credit-Based Flow Control for ATM Networks , 1994, SIGCOMM 1994.

[8]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[9]  Jean C. Walrand,et al.  Explicit rate flow control for ABR services in ATM networks , 2000, TNET.

[10]  Haiyun Luo,et al.  A new model for packet scheduling in multihop wireless networks , 2000, MobiCom '00.

[11]  Yoram Ofek,et al.  Metaring-a full-duplex ring with fairness and spatial reuse , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[12]  Roch Guérin,et al.  Throughput properties of fair policies in ring networks , 1993, TNET.

[13]  George Suwala,et al.  The Cisco SRP MAC Layer Protocol , 2000, RFC.

[14]  R. Shreedhar,et al.  Efficient Fair Queuing Using Deficit Round - , 1997 .

[15]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[16]  Giuseppe Anastasi,et al.  Performance evaluation of the MetaRing MAC protocol carrying asynchronous traffic , 1997, J. High Speed Networks.

[17]  Jean C. Walrand,et al.  Fair end-to-end window-based congestion control , 2000, TNET.