Frame-based matching algorithms for optical switches

Yihan Li; S. Panwar; H. J. Chao

doi:10.1109/HPSR.2003.1226687

Frame-based matching algorithms for optical switches

Yihan Li, S. Panwar, H. J. Chao

Electrical and Computer Engineering

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

Abstract

Virtual output queuing is widely used by fixed-length high-speed electronic switches to overcome head-of-line blocking. This is done by means of matching algorithms. These matching algorithms have typically been cell-based. That is, in every time slot, a new matching set is calculated and the switch fabric is updated to connect matched inputs and outputs. Fabric reconfiguration in an optical switch is not as fast as in an electronic switch. During reconfiguration, no data can be transferred. Given this overhead, it is not efficient to update connections between inputs and outputs for every time slot. We present frame-based matching algorithms for optical packet switches, so that connections can be updated less frequently to reduce the bandwidth loss. The implementation complexity and performance of these schemes are studied.

Original language	English (US)
Title of host publication	HPSR 2003 - 2003 Workshop on High Performance Switching and Routing
Publisher	IEEE Computer Society
Pages	97-102
Number of pages	6
ISBN (Print)	0780377109, 9780780377103
DOIs	https://doi.org/10.1109/HPSR.2003.1226687
State	Published - 2003
Event	2003 Workshop on High Performance Switching and Routing, HPSR 2003 - Torino, Italy Duration: Jun 24 2003 → Jun 27 2003

Publication series

Name	IEEE International Conference on High Performance Switching and Routing, HPSR
ISSN (Print)	2325-5595
ISSN (Electronic)	2325-5609

Other

Other	2003 Workshop on High Performance Switching and Routing, HPSR 2003
Country/Territory	Italy
City	Torino
Period	6/24/03 → 6/27/03

Keywords

Virtual Output Queueing
exhaustive service
optical switching
polling systems
scheduling

ASJC Scopus subject areas

Hardware and Architecture
Electrical and Electronic Engineering

Access to Document

10.1109/HPSR.2003.1226687

Cite this

Frame-based matching algorithms for optical switches. / Li, Yihan; Panwar, S.; Chao, H. J.
HPSR 2003 - 2003 Workshop on High Performance Switching and Routing. IEEE Computer Society, 2003. p. 97-102 1226687 (IEEE International Conference on High Performance Switching and Routing, HPSR).

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

Li, Y, Panwar, S & Chao, HJ 2003, Frame-based matching algorithms for optical switches. in HPSR 2003 - 2003 Workshop on High Performance Switching and Routing., 1226687, IEEE International Conference on High Performance Switching and Routing, HPSR, IEEE Computer Society, pp. 97-102, 2003 Workshop on High Performance Switching and Routing, HPSR 2003, Torino, Italy, 6/24/03. https://doi.org/10.1109/HPSR.2003.1226687

@inproceedings{4f3602c3f0624cbf9215b64cc69a378a,

title = "Frame-based matching algorithms for optical switches",

abstract = "Virtual output queuing is widely used by fixed-length high-speed electronic switches to overcome head-of-line blocking. This is done by means of matching algorithms. These matching algorithms have typically been cell-based. That is, in every time slot, a new matching set is calculated and the switch fabric is updated to connect matched inputs and outputs. Fabric reconfiguration in an optical switch is not as fast as in an electronic switch. During reconfiguration, no data can be transferred. Given this overhead, it is not efficient to update connections between inputs and outputs for every time slot. We present frame-based matching algorithms for optical packet switches, so that connections can be updated less frequently to reduce the bandwidth loss. The implementation complexity and performance of these schemes are studied.",

keywords = "Virtual Output Queueing, exhaustive service, optical switching, polling systems, scheduling",

author = "Yihan Li and S. Panwar and Chao, {H. J.}",

year = "2003",

doi = "10.1109/HPSR.2003.1226687",

language = "English (US)",

isbn = "0780377109",

series = "IEEE International Conference on High Performance Switching and Routing, HPSR",

publisher = "IEEE Computer Society",

pages = "97--102",

booktitle = "HPSR 2003 - 2003 Workshop on High Performance Switching and Routing",

}

TY - GEN

T1 - Frame-based matching algorithms for optical switches

AU - Li, Yihan

AU - Panwar, S.

AU - Chao, H. J.

PY - 2003

Y1 - 2003

N2 - Virtual output queuing is widely used by fixed-length high-speed electronic switches to overcome head-of-line blocking. This is done by means of matching algorithms. These matching algorithms have typically been cell-based. That is, in every time slot, a new matching set is calculated and the switch fabric is updated to connect matched inputs and outputs. Fabric reconfiguration in an optical switch is not as fast as in an electronic switch. During reconfiguration, no data can be transferred. Given this overhead, it is not efficient to update connections between inputs and outputs for every time slot. We present frame-based matching algorithms for optical packet switches, so that connections can be updated less frequently to reduce the bandwidth loss. The implementation complexity and performance of these schemes are studied.

AB - Virtual output queuing is widely used by fixed-length high-speed electronic switches to overcome head-of-line blocking. This is done by means of matching algorithms. These matching algorithms have typically been cell-based. That is, in every time slot, a new matching set is calculated and the switch fabric is updated to connect matched inputs and outputs. Fabric reconfiguration in an optical switch is not as fast as in an electronic switch. During reconfiguration, no data can be transferred. Given this overhead, it is not efficient to update connections between inputs and outputs for every time slot. We present frame-based matching algorithms for optical packet switches, so that connections can be updated less frequently to reduce the bandwidth loss. The implementation complexity and performance of these schemes are studied.

KW - Virtual Output Queueing

KW - exhaustive service

KW - optical switching

KW - polling systems

KW - scheduling

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

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

U2 - 10.1109/HPSR.2003.1226687

DO - 10.1109/HPSR.2003.1226687

M3 - Conference contribution

AN - SCOPUS:33749471422

SN - 0780377109

SN - 9780780377103

T3 - IEEE International Conference on High Performance Switching and Routing, HPSR

SP - 97

EP - 102

BT - HPSR 2003 - 2003 Workshop on High Performance Switching and Routing

PB - IEEE Computer Society

T2 - 2003 Workshop on High Performance Switching and Routing, HPSR 2003

Y2 - 24 June 2003 through 27 June 2003

ER -

Frame-based matching algorithms for optical switches

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this