Distributed bandwidth allocation for resilient packet ring networks

Authors:
Fahd Alharbi;Nirwan Ansari
Affiliations:
Advanced Networking Laboratory, Department of Electrical and Computer Engineering, New Jersey Institute of Technology, University Heights, Newark, NJ 07102, USA;Advanced Networking Laboratory, Department of Electrical and Computer Engineering, New Jersey Institute of Technology, University Heights, Newark, NJ 07102, USA
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2005

Citing 4
Cited 2

Parallel and distributed computation: numerical methods

Parallel and distributed computation: numerical methods
Design, analysis, and implementation of DVSR: a fair high-performance protocol for packet rings

IEEE/ACM Transactions on Networking (TON)
IEEE 802.17 resilient packet ring tutorial

IEEE Communications Magazine
The IEEE 802.17 media access protocol for high-speed metropolitan-area resilient packet rings

IEEE Network: The Magazine of Global Internetworking

Active queue management for MAC client implementation of resilient packet rings

ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Achieving destination differentiation in ingress aggregated fairness for resilient packet rings by weighted destination based fair dropping

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Resilient Packet Ring (RPR), defined under IEEE 802.17, has been proposed as a high-speed backbone technology for metropolitan area networks. RPR is introduced to mitigate the underutilization and unfairness problems associated with the current technologies, SONET and Ethernet, respectively. The key performance objectives of RPR are to achieve high bandwidth utilization, optimum spatial reuse on the dual rings, and fairness. The challenge is to design an algorithm that can react dynamically to the traffic flows in achieving these objectives. The RPR fairness algorithm is comparatively simple, but it poses some critical limitations that require further investigation and remedy. One of the major problems is that the amount of bandwidth allocated by the algorithm oscillates severely under unbalanced traffic scenarios. These oscillations are barrier to achieving spatial reuse and high bandwidth utilization. DVSR was another algorithm proposed to solve the fairness issue with no oscillation at the steady state, but at the expense of a high computational complexity O(NlogN), where N is the number of nodes in the ring. In this paper, we propose the Distributed Bandwidth Allocation (DBA) algorithm to allocate bandwidth fairly to RPR nodes with a very low computational complexity O(1) that will converge to the exact max-min fairness in a few round trip times with no oscillation at the steady state.