Scheduling algorithms for shared fiber-delay-line optical packet switches - Part I: The single-stage case

Soung Y. Liew, Gang Hu, H. Jonathan Chao

Research output: Contribution to journalArticle

Abstract

In all-optical packet switching, packets may arrive at an optical switch in an uncoordinated fashion. When contention occurs, fiber delay lines (FDLs) are needed to delay (buffer) the packets that have lost the contention to some future time slots for the desired output ports. There have been several optical-buffered switch architectures and FDL assignment algorithms proposed in the literature. However, most of them either have high implementation complexity or fail to schedule in advance departure time for the delayed packets. This paper studies the packet scheduling algorithms for the single-stage shared-FDL optical packet switch. Three new FDL assignment algorithms are proposed, namely sequential FDL assignment (SEFA), multicell FDL assignment (MUFA), and parallel iterative FDL assignment (PIFA) algorithms for the switch. The proposed algorithms can make FDLs and output-port reservation so as to schedule departure time for packets. Owing to FDL and/or output-port conflicts, the packets that fail to be scheduled are discarded before entering the switch so that they do not occupy any FDL resources. It is shown by simulation that with these algorithms, the optical-buffered switch can achieve a loss rate of ∼ 10-7 even at the load of 0.9. These algorithms are extended to the three-stage Clos-network optical packet switches in the companion paper.

Original languageEnglish (US)
Pages (from-to)1586-1600
Number of pages15
JournalJournal of Lightwave Technology
Volume23
Issue number4
DOIs
StatePublished - Apr 2005

Fingerprint

scheduling
Electric delay lines
delay lines
Scheduling algorithms
switches
Switches
fibers
Fibers
Optical switches
schedules
output
packet switching
Packet switching
optical switching
Fiber optic networks
slots
resources
buffers

Keywords

  • All-optical network
  • Fiber delay line (FDL)
  • Optical packet switching
  • Scheduling algorithm

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Atomic and Molecular Physics, and Optics

Cite this

Scheduling algorithms for shared fiber-delay-line optical packet switches - Part I : The single-stage case. / Liew, Soung Y.; Hu, Gang; Chao, H. Jonathan.

In: Journal of Lightwave Technology, Vol. 23, No. 4, 04.2005, p. 1586-1600.

Research output: Contribution to journalArticle

@article{d4141affe66843a590b36f5f894f6fe1,
title = "Scheduling algorithms for shared fiber-delay-line optical packet switches - Part I: The single-stage case",
abstract = "In all-optical packet switching, packets may arrive at an optical switch in an uncoordinated fashion. When contention occurs, fiber delay lines (FDLs) are needed to delay (buffer) the packets that have lost the contention to some future time slots for the desired output ports. There have been several optical-buffered switch architectures and FDL assignment algorithms proposed in the literature. However, most of them either have high implementation complexity or fail to schedule in advance departure time for the delayed packets. This paper studies the packet scheduling algorithms for the single-stage shared-FDL optical packet switch. Three new FDL assignment algorithms are proposed, namely sequential FDL assignment (SEFA), multicell FDL assignment (MUFA), and parallel iterative FDL assignment (PIFA) algorithms for the switch. The proposed algorithms can make FDLs and output-port reservation so as to schedule departure time for packets. Owing to FDL and/or output-port conflicts, the packets that fail to be scheduled are discarded before entering the switch so that they do not occupy any FDL resources. It is shown by simulation that with these algorithms, the optical-buffered switch can achieve a loss rate of ∼ 10-7 even at the load of 0.9. These algorithms are extended to the three-stage Clos-network optical packet switches in the companion paper.",
keywords = "All-optical network, Fiber delay line (FDL), Optical packet switching, Scheduling algorithm",
author = "Liew, {Soung Y.} and Gang Hu and Chao, {H. Jonathan}",
year = "2005",
month = "4",
doi = "10.1109/JLT.2005.844196",
language = "English (US)",
volume = "23",
pages = "1586--1600",
journal = "Journal of Lightwave Technology",
issn = "0733-8724",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "4",

}

TY - JOUR

T1 - Scheduling algorithms for shared fiber-delay-line optical packet switches - Part I

T2 - The single-stage case

AU - Liew, Soung Y.

AU - Hu, Gang

AU - Chao, H. Jonathan

PY - 2005/4

Y1 - 2005/4

N2 - In all-optical packet switching, packets may arrive at an optical switch in an uncoordinated fashion. When contention occurs, fiber delay lines (FDLs) are needed to delay (buffer) the packets that have lost the contention to some future time slots for the desired output ports. There have been several optical-buffered switch architectures and FDL assignment algorithms proposed in the literature. However, most of them either have high implementation complexity or fail to schedule in advance departure time for the delayed packets. This paper studies the packet scheduling algorithms for the single-stage shared-FDL optical packet switch. Three new FDL assignment algorithms are proposed, namely sequential FDL assignment (SEFA), multicell FDL assignment (MUFA), and parallel iterative FDL assignment (PIFA) algorithms for the switch. The proposed algorithms can make FDLs and output-port reservation so as to schedule departure time for packets. Owing to FDL and/or output-port conflicts, the packets that fail to be scheduled are discarded before entering the switch so that they do not occupy any FDL resources. It is shown by simulation that with these algorithms, the optical-buffered switch can achieve a loss rate of ∼ 10-7 even at the load of 0.9. These algorithms are extended to the three-stage Clos-network optical packet switches in the companion paper.

AB - In all-optical packet switching, packets may arrive at an optical switch in an uncoordinated fashion. When contention occurs, fiber delay lines (FDLs) are needed to delay (buffer) the packets that have lost the contention to some future time slots for the desired output ports. There have been several optical-buffered switch architectures and FDL assignment algorithms proposed in the literature. However, most of them either have high implementation complexity or fail to schedule in advance departure time for the delayed packets. This paper studies the packet scheduling algorithms for the single-stage shared-FDL optical packet switch. Three new FDL assignment algorithms are proposed, namely sequential FDL assignment (SEFA), multicell FDL assignment (MUFA), and parallel iterative FDL assignment (PIFA) algorithms for the switch. The proposed algorithms can make FDLs and output-port reservation so as to schedule departure time for packets. Owing to FDL and/or output-port conflicts, the packets that fail to be scheduled are discarded before entering the switch so that they do not occupy any FDL resources. It is shown by simulation that with these algorithms, the optical-buffered switch can achieve a loss rate of ∼ 10-7 even at the load of 0.9. These algorithms are extended to the three-stage Clos-network optical packet switches in the companion paper.

KW - All-optical network

KW - Fiber delay line (FDL)

KW - Optical packet switching

KW - Scheduling algorithm

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

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

U2 - 10.1109/JLT.2005.844196

DO - 10.1109/JLT.2005.844196

M3 - Article

VL - 23

SP - 1586

EP - 1600

JO - Journal of Lightwave Technology

JF - Journal of Lightwave Technology

SN - 0733-8724

IS - 4

ER -