Distributed bandwidth allocation for resilient packet ring networks

Document Type

Article

Publication Date

10-5-2005

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(Nlog N), 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. © 2005 Elsevier B.V. All rights reserved.

Identifier

22944458831 (Scopus)

Publication Title

Computer Networks

External Full Text Location

https://doi.org/10.1016/j.comnet.2004.12.004

ISSN

13891286

First Page

161

Last Page

171

Issue

2

Volume

49

This document is currently not available here.

Share

COinS