Frame-based matching algorithms for optical switches

Research output: Chapter in Book/Report/Conference proceedingConference 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 languageEnglish (US)
Title of host publicationHPSR 2003 - 2003 Workshop on High Performance Switching and Routing
PublisherIEEE Computer Society
Pages97-102
Number of pages6
ISBN (Print)0780377109, 9780780377103
DOIs
StatePublished - 2003
Event2003 Workshop on High Performance Switching and Routing, HPSR 2003 - Torino, Italy
Duration: Jun 24 2003Jun 27 2003

Other

Other2003 Workshop on High Performance Switching and Routing, HPSR 2003
CountryItaly
CityTorino
Period6/24/036/27/03

Fingerprint

Optical switches
Switches
Bandwidth

Keywords

  • exhaustive service
  • optical switching
  • polling systems
  • scheduling
  • Virtual Output Queueing

ASJC Scopus subject areas

  • Hardware and Architecture
  • Electrical and Electronic Engineering

Cite this

Li, Y., Panwar, S., & Chao, H. J. (2003). Frame-based matching algorithms for optical switches. In HPSR 2003 - 2003 Workshop on High Performance Switching and Routing (pp. 97-102). [1226687] IEEE Computer Society. https://doi.org/10.1109/HPSR.2003.1226687

Frame-based matching algorithms for optical switches. / Li, Yihan; Panwar, Shivendra; Chao, H. Jonathan.

HPSR 2003 - 2003 Workshop on High Performance Switching and Routing. IEEE Computer Society, 2003. p. 97-102 1226687.

Research output: Chapter in Book/Report/Conference proceedingConference 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 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
Li Y, Panwar S, Chao HJ. Frame-based matching algorithms for optical switches. In HPSR 2003 - 2003 Workshop on High Performance Switching and Routing. IEEE Computer Society. 2003. p. 97-102. 1226687 https://doi.org/10.1109/HPSR.2003.1226687
Li, Yihan ; Panwar, Shivendra ; Chao, H. Jonathan. / Frame-based matching algorithms for optical switches. HPSR 2003 - 2003 Workshop on High Performance Switching and Routing. IEEE Computer Society, 2003. pp. 97-102
@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 = "exhaustive service, optical switching, polling systems, scheduling, Virtual Output Queueing",
author = "Yihan Li and Shivendra Panwar and Chao, {H. Jonathan}",
year = "2003",
doi = "10.1109/HPSR.2003.1226687",
language = "English (US)",
isbn = "0780377109",
pages = "97--102",
booktitle = "HPSR 2003 - 2003 Workshop on High Performance Switching and Routing",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - Frame-based matching algorithms for optical switches

AU - Li, Yihan

AU - Panwar, Shivendra

AU - Chao, H. Jonathan

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 - exhaustive service

KW - optical switching

KW - polling systems

KW - scheduling

KW - Virtual Output Queueing

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

SN - 0780377109

SN - 9780780377103

SP - 97

EP - 102

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

PB - IEEE Computer Society

ER -