SSA

Simple scheduling algorithm for resilient packet ring networks

F. Alharbi, Nirwan Ansari

Research output: Contribution to journalArticle

10 Citations (Scopus)

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 underutilisation and unfairness problems associated with the current technologies SONET and Ethernet, respectively. The key performance objectives of RPR are to achieve high bandwidth utilisation, optimum spatial reuse on the dual rings, and fairness. The RPR standard implements three traffic classes: Class A, Class B, and Class C. The RPR MAC has one queue for each traffic class. A potential performance limitation is associated with the head-of-line blocking. When the MAC uses a single FIFO to buffer frames awaiting access, a packet that is traversing through a congestion point may block transmission of other packets destined to a point before the congestion. The use of virtual destination queues (VDQs) to avoid the head-of-line blocking is introduced. Different bandwidth allocation policies are discussed to assign rates to VDQs. Finally, a bandwidth allocation policy is proposed, which would achieve the maximum utilisation at a very low complexity.

Original languageEnglish (US)
Pages (from-to)183-188
Number of pages6
JournalIEE Proceedings: Communications
Volume153
Issue number2
DOIs
StatePublished - Apr 1 2006

Fingerprint

Frequency allocation
Scheduling algorithms
Metropolitan area networks
Ethernet
Bandwidth

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Cite this

@article{649bccef3d594c2c9918cf941d9ef90d,
title = "SSA: Simple scheduling algorithm for resilient packet ring networks",
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 underutilisation and unfairness problems associated with the current technologies SONET and Ethernet, respectively. The key performance objectives of RPR are to achieve high bandwidth utilisation, optimum spatial reuse on the dual rings, and fairness. The RPR standard implements three traffic classes: Class A, Class B, and Class C. The RPR MAC has one queue for each traffic class. A potential performance limitation is associated with the head-of-line blocking. When the MAC uses a single FIFO to buffer frames awaiting access, a packet that is traversing through a congestion point may block transmission of other packets destined to a point before the congestion. The use of virtual destination queues (VDQs) to avoid the head-of-line blocking is introduced. Different bandwidth allocation policies are discussed to assign rates to VDQs. Finally, a bandwidth allocation policy is proposed, which would achieve the maximum utilisation at a very low complexity.",
author = "F. Alharbi and Nirwan Ansari",
year = "2006",
month = "4",
day = "1",
doi = "https://doi.org/10.1049/ip-com:20045232",
language = "English (US)",
volume = "153",
pages = "183--188",
journal = "IEE Proceedings: Communications",
issn = "1350-2425",
publisher = "Institute of Electrical Engineers",
number = "2",

}

SSA : Simple scheduling algorithm for resilient packet ring networks. / Alharbi, F.; Ansari, Nirwan.

In: IEE Proceedings: Communications, Vol. 153, No. 2, 01.04.2006, p. 183-188.

Research output: Contribution to journalArticle

TY - JOUR

T1 - SSA

T2 - Simple scheduling algorithm for resilient packet ring networks

AU - Alharbi, F.

AU - Ansari, Nirwan

PY - 2006/4/1

Y1 - 2006/4/1

N2 - 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 underutilisation and unfairness problems associated with the current technologies SONET and Ethernet, respectively. The key performance objectives of RPR are to achieve high bandwidth utilisation, optimum spatial reuse on the dual rings, and fairness. The RPR standard implements three traffic classes: Class A, Class B, and Class C. The RPR MAC has one queue for each traffic class. A potential performance limitation is associated with the head-of-line blocking. When the MAC uses a single FIFO to buffer frames awaiting access, a packet that is traversing through a congestion point may block transmission of other packets destined to a point before the congestion. The use of virtual destination queues (VDQs) to avoid the head-of-line blocking is introduced. Different bandwidth allocation policies are discussed to assign rates to VDQs. Finally, a bandwidth allocation policy is proposed, which would achieve the maximum utilisation at a very low complexity.

AB - 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 underutilisation and unfairness problems associated with the current technologies SONET and Ethernet, respectively. The key performance objectives of RPR are to achieve high bandwidth utilisation, optimum spatial reuse on the dual rings, and fairness. The RPR standard implements three traffic classes: Class A, Class B, and Class C. The RPR MAC has one queue for each traffic class. A potential performance limitation is associated with the head-of-line blocking. When the MAC uses a single FIFO to buffer frames awaiting access, a packet that is traversing through a congestion point may block transmission of other packets destined to a point before the congestion. The use of virtual destination queues (VDQs) to avoid the head-of-line blocking is introduced. Different bandwidth allocation policies are discussed to assign rates to VDQs. Finally, a bandwidth allocation policy is proposed, which would achieve the maximum utilisation at a very low complexity.

UR - http://www.scopus.com/inward/record.url?scp=33644992354&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33644992354&partnerID=8YFLogxK

U2 - https://doi.org/10.1049/ip-com:20045232

DO - https://doi.org/10.1049/ip-com:20045232

M3 - Article

VL - 153

SP - 183

EP - 188

JO - IEE Proceedings: Communications

JF - IEE Proceedings: Communications

SN - 1350-2425

IS - 2

ER -