Access delay performance of resilient packet ring under bursty periodic class B traffic load

Robichaud, Y.; Huang, Changcheng; Yang, Jinmei; Peng, Hong

doi:10.1109/icc.2004.1312693

Cited by 7 publications

(4 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Complementary aspects of the RPR have been examined in several recent studies. The fairness of the RPR bandwidth allocation has, for instance, been studied in [7][8][9][10][11][12], while the access delay, congestion control, and quality of service of the RPR have been studied in [13][14][15]. The RPR protection performance has been studied in [16,17].…”

Section: Related Workmentioning

confidence: 99%

Multicasting in a WDM-upgraded Resilient Packet Ring

et al. 2007

View full text Add to dashboard Cite

͑Doc. ID 75837͒ The recently approved IEEE 802.17 Resilient Packet Ring (RPR) network deteriorates under multicast traffic to legacy ring technologies that do not support spatial reuse. We extend our multicast approach with spatial reuse from a currently single-channel RPR to WDM-upgraded multichannel RPR networks, where each node can transmit packets on all wavelengths and receive on one wavelength, and analyze their multicast capacity. Our analysis provides a convenient method for evaluating the multicast and reception capacities of WDM-upgraded RPR networks for a wide range of uniform unicast, multicast, and broadcast traffic scenarios.

show abstract

Section: Related Workmentioning

confidence: 99%

Multicasting in a WDM-upgraded Resilient Packet Ring

et al. 2007

View full text Add to dashboard Cite

show abstract

“…These oscillations that span nearly the entire range of the link capacity not only hinder spatial reuse but also decrease throughput as well as increase delay jitter. Novel fairness algorithms have been proposed that are able to mitigate the oscillations and achieve nearly complete spatial reuse [11][12][13]. The stability and convergence of the aggressive-mode (AM) fairness algorithm of RPR was examined in Ref.…”

Section: A Related Workmentioning

confidence: 99%

Multicasting in IEEE 802.17 resilient packet ring

et al. 2006

View full text Add to dashboard Cite

By using destination stripping and shortest-path routing, the new standard IEEE 802.17 resilient packet ring (RPR) allows for spatial reuse, resulting in a significantly increased capacity compared to source-stripping legacy ring networks. We show that for multicast traffic the performance of RPR reduces to that of legacy ring networks that do not support spatial reuse. We propose a bandwidth-efficient and cost-sensitive multicast approach for RPR networks that exploits RPR's built-in topology discovery and supplementary time-to-live field to enable spatial reuse for multicast traffic. By means of analysis and simulation we investigate the proposed multicast approach in terms of transmission, multicast, and reception capacities as well as throughput efficiency for different numbers of nodes and multicast fanout under various traffic scenarios. Our findings show that for multicast traffic, the transmission capacity and multicast capacity of RPR are increased significantly, in particular for small to medium multicast group sizes, and a multicast throughput efficiency of 100% is achieved. Besides the performance gain, the proposed multicast approach is able to maintain RPR's simplicity.

show abstract

“…RPR tries to overcome previous MAN technologies shortcomings in high-speed networks ( [2], [5]). Its salient features include dual counter-rotating ring topology with simple operation and management; automatic topology discovery; fast protection mechanism; interworking with the IEEE 802 family of networks; multiple class of services; support of efficient statistical multiplexing, dynamic bandwidth reclamation and spatial reuse through destination-stripping to attain high utilization; simple shortest path routing through either inner or outer ringlets; and distributed fairness algorithm with traffic shaping to share fairness eligible traffic among competing nodes, avoiding starvation problems.…”

Section: Introductionmentioning

confidence: 99%

Improved fairness algorithm to prevent tail node induced oscillations in RPR

Robichaud

Huang

IEEE International Conference on Communications, 2005. ICC 2005. 2005

View full text Add to dashboard Cite

-The IEEE P802.17 workgroup has standardized a ring network architecture and associated protocol called Resilient Packet Ring (RPR). RPR tries to overcome previous MAN technologies shortcomings in high-speed networks. The RPR fairness mechanism suffers from severe permanent oscillations under certain conditions. Several propositions were made to solve this problem but all needed significant modifications of the current RPR protocol. In this paper, we propose an improved algorithm to prevent tail node induced oscillations. It requires only simple modifications to the current fair rate advertisement mechanism of RPR. Our simulation results show that the improvements work under various conditions and increase the average throughput of RPR.

show abstract

Access delay performance of resilient packet ring under bursty periodic class B traffic load

Cited by 7 publications

References 4 publications

Multicasting in a WDM-upgraded Resilient Packet Ring

Multicasting in a WDM-upgraded Resilient Packet Ring

Multicasting in IEEE 802.17 resilient packet ring

Improved fairness algorithm to prevent tail node induced oscillations in RPR

Contact Info

Product

Resources

About