Optimal parallel scheduling algorithms in WDM packet interconnects

Zhenghao Zhang; Yuanyuan Yang

doi:10.1201/9781420011296

Optimal parallel scheduling algorithms in WDM packet interconnects

Zhenghao Zhang
, Yuanyuan Yang

Electrical Engineering

Stony Brook University

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

Abstract

In this chapter, we consider packet scheduling in wavelength-division-multiplexing (WDM) optical interconnects with limited range wavelength conversion and shared buffer. We will describe how an optimal packet schedule, by which packet loss and packet delay can be minimized, can be found by a parallel algorithm. We will formalize the problem as a matching problem in a bipartite graph and show step-by-step how the algorithm is derived on the basis of properties of the special bipartite graph.

Original language	English
Title of host publication	Handbook of Parallel Computing
Subtitle of host publication	Models, Algorithms and Applications
Publisher	CRC Press
Pages	23-1-23-20
ISBN (Electronic)	9781420011296
ISBN (Print)	9781584886235
DOIs	https://doi.org/10.1201/9781420011296
State	Published - Jan 1 2007

Access to Document

10.1201/9781420011296

Cite this

@inbook{848c4bfcdcb14ef3a9fac2ad9e2077bf,

title = "Optimal parallel scheduling algorithms in WDM packet interconnects",

abstract = "In this chapter, we consider packet scheduling in wavelength-division-multiplexing (WDM) optical interconnects with limited range wavelength conversion and shared buffer. We will describe how an optimal packet schedule, by which packet loss and packet delay can be minimized, can be found by a parallel algorithm. We will formalize the problem as a matching problem in a bipartite graph and show step-by-step how the algorithm is derived on the basis of properties of the special bipartite graph.",

author = "Zhenghao Zhang and Yuanyuan Yang",

note = "Publisher Copyright: {\textcopyright} 2007 by Taylor \& Francis Group, LLC.",

year = "2007",

month = jan,

day = "1",

doi = "10.1201/9781420011296",

language = "English",

isbn = "9781584886235",

pages = "23--1--23--20",

booktitle = "Handbook of Parallel Computing",

publisher = "CRC Press",

}

TY - CHAP

T1 - Optimal parallel scheduling algorithms in WDM packet interconnects

AU - Zhang, Zhenghao

AU - Yang, Yuanyuan

PY - 2007/1/1

Y1 - 2007/1/1

N2 - In this chapter, we consider packet scheduling in wavelength-division-multiplexing (WDM) optical interconnects with limited range wavelength conversion and shared buffer. We will describe how an optimal packet schedule, by which packet loss and packet delay can be minimized, can be found by a parallel algorithm. We will formalize the problem as a matching problem in a bipartite graph and show step-by-step how the algorithm is derived on the basis of properties of the special bipartite graph.

AB - In this chapter, we consider packet scheduling in wavelength-division-multiplexing (WDM) optical interconnects with limited range wavelength conversion and shared buffer. We will describe how an optimal packet schedule, by which packet loss and packet delay can be minimized, can be found by a parallel algorithm. We will formalize the problem as a matching problem in a bipartite graph and show step-by-step how the algorithm is derived on the basis of properties of the special bipartite graph.

UR - https://www.scopus.com/pages/publications/85056072870

U2 - 10.1201/9781420011296

DO - 10.1201/9781420011296

M3 - Chapter

AN - SCOPUS:85056072870

SN - 9781584886235

SP - 23-1-23-20

BT - Handbook of Parallel Computing

PB - CRC Press

ER -

Optimal parallel scheduling algorithms in WDM packet interconnects

Abstract

Access to Document

Other files and links

Fingerprint

Cite this