Selective-request round-robin scheduling for VOQ packet switch architecture

Dong Lin; Ying Jiang; Mounir Hamdi

doi:10.1109/icc.2011.5962480

Selective-request round-robin scheduling for VOQ packet switch architecture

Dong Lin^*, Ying Jiang, Mounir Hamdi

^*Corresponding author for this work

Hong Kong University of Science and Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

11 Citations (Scopus)

Abstract

Virtual Output Queuing (VOQ) is widely used by input-queued (IQ) packet switches to eliminate the head-of-line (HoL) blocking problem. A lot of research has been devoted to design iterative arbitration algorithms to maximize the throughput of this architecture. Nevertheless, these approaches require either a high computation complexity or large contention resolution times for high-speed switches. We investigate in this paper the performance of various such algorithms and based on the analysis of pointer desynchronization effect, we propose a new algorithm approximating maximum size matching (MSM) called Selective Request Round Robin (SRRR) which performs extremely well under various traffic models and is easy to implement in hardware.

Original language	English
Title of host publication	2011 IEEE International Conference on Communications, ICC 2011
DOIs	https://doi.org/10.1109/icc.2011.5962480
Publication status	Published - 2011
Externally published	Yes
Event	2011 IEEE International Conference on Communications, ICC 2011 - Kyoto, Japan Duration: 5 Jun 2011 → 9 Jun 2011

Publication series

Name	IEEE International Conference on Communications
ISSN (Print)	0536-1486

Conference

Conference	2011 IEEE International Conference on Communications, ICC 2011
Country/Territory	Japan
City	Kyoto
Period	5/06/11 → 9/06/11

Access to Document

10.1109/icc.2011.5962480

Cite this

@inproceedings{59483df65dba4276a11965c6c5427273,

title = "Selective-request round-robin scheduling for VOQ packet switch architecture",

abstract = "Virtual Output Queuing (VOQ) is widely used by input-queued (IQ) packet switches to eliminate the head-of-line (HoL) blocking problem. A lot of research has been devoted to design iterative arbitration algorithms to maximize the throughput of this architecture. Nevertheless, these approaches require either a high computation complexity or large contention resolution times for high-speed switches. We investigate in this paper the performance of various such algorithms and based on the analysis of pointer desynchronization effect, we propose a new algorithm approximating maximum size matching (MSM) called Selective Request Round Robin (SRRR) which performs extremely well under various traffic models and is easy to implement in hardware.",

author = "Dong Lin and Ying Jiang and Mounir Hamdi",

year = "2011",

doi = "10.1109/icc.2011.5962480",

language = "English",

isbn = "9781612842332",

series = "IEEE International Conference on Communications",

booktitle = "2011 IEEE International Conference on Communications, ICC 2011",

note = "2011 IEEE International Conference on Communications, ICC 2011 ; Conference date: 05-06-2011 Through 09-06-2011",

}

TY - GEN

T1 - Selective-request round-robin scheduling for VOQ packet switch architecture

AU - Lin, Dong

AU - Jiang, Ying

AU - Hamdi, Mounir

PY - 2011

Y1 - 2011

N2 - Virtual Output Queuing (VOQ) is widely used by input-queued (IQ) packet switches to eliminate the head-of-line (HoL) blocking problem. A lot of research has been devoted to design iterative arbitration algorithms to maximize the throughput of this architecture. Nevertheless, these approaches require either a high computation complexity or large contention resolution times for high-speed switches. We investigate in this paper the performance of various such algorithms and based on the analysis of pointer desynchronization effect, we propose a new algorithm approximating maximum size matching (MSM) called Selective Request Round Robin (SRRR) which performs extremely well under various traffic models and is easy to implement in hardware.

AB - Virtual Output Queuing (VOQ) is widely used by input-queued (IQ) packet switches to eliminate the head-of-line (HoL) blocking problem. A lot of research has been devoted to design iterative arbitration algorithms to maximize the throughput of this architecture. Nevertheless, these approaches require either a high computation complexity or large contention resolution times for high-speed switches. We investigate in this paper the performance of various such algorithms and based on the analysis of pointer desynchronization effect, we propose a new algorithm approximating maximum size matching (MSM) called Selective Request Round Robin (SRRR) which performs extremely well under various traffic models and is easy to implement in hardware.

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

U2 - 10.1109/icc.2011.5962480

DO - 10.1109/icc.2011.5962480

M3 - Conference contribution

AN - SCOPUS:80052167621

SN - 9781612842332

T3 - IEEE International Conference on Communications

BT - 2011 IEEE International Conference on Communications, ICC 2011

T2 - 2011 IEEE International Conference on Communications, ICC 2011

Y2 - 5 June 2011 through 9 June 2011

ER -

Selective-request round-robin scheduling for VOQ packet switch architecture

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this