Parallel fair round robin scheduling in WDM packet switching networks

Deming Liu, Yann-Hang Lee, Yoonmee Doh

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Assuming data traffic of fixed-length cells, we propose a frame-oriented scheduling discipline, PFRR (parallel fair round robin), for WDM optical switches by applying pfair (proportionate fairness) scheduling so that deterministic communication performance is guaranteed. Bandwidth reservation for an active session is performed by holding a number of cell slots for the session in a two-dimension frame, which is transferred iteratively over the multiple channels in an optical fiber. To determine the transmission order of cells in a frame, pfair scheduling is used so that the cells belonging to a session are distributed over the frame as uniformly as possible. Through the analysis by network calculus and by network simulator, it is shown that PFRR possesses tight delay bounds and lenient buffer requirements. Also, with a minor modification to PFRR, a new service discipline called MPFRR is proposed that can be used as traffic regulator to support sessions with jitter requirements.

Original languageEnglish (US)
Pages (from-to)503-513
Number of pages11
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3090
StatePublished - 2004

Fingerprint

Packet Switching
Songbirds
Packet switching
Packet networks
Switching networks
Wavelength division multiplexing
Scheduling
Cell
Fairness
Optical Fibers
Optical switches
Network Calculus
Calculi
Traffic
Jitter
Optical Switch
Telecommunication traffic
Optical fibers
Reservation
Requirements

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

@article{6d1d76f048594edb8d5e3405ff71487c,
title = "Parallel fair round robin scheduling in WDM packet switching networks",
abstract = "Assuming data traffic of fixed-length cells, we propose a frame-oriented scheduling discipline, PFRR (parallel fair round robin), for WDM optical switches by applying pfair (proportionate fairness) scheduling so that deterministic communication performance is guaranteed. Bandwidth reservation for an active session is performed by holding a number of cell slots for the session in a two-dimension frame, which is transferred iteratively over the multiple channels in an optical fiber. To determine the transmission order of cells in a frame, pfair scheduling is used so that the cells belonging to a session are distributed over the frame as uniformly as possible. Through the analysis by network calculus and by network simulator, it is shown that PFRR possesses tight delay bounds and lenient buffer requirements. Also, with a minor modification to PFRR, a new service discipline called MPFRR is proposed that can be used as traffic regulator to support sessions with jitter requirements.",
author = "Deming Liu and Yann-Hang Lee and Yoonmee Doh",
year = "2004",
language = "English (US)",
volume = "3090",
pages = "503--513",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - Parallel fair round robin scheduling in WDM packet switching networks

AU - Liu, Deming

AU - Lee, Yann-Hang

AU - Doh, Yoonmee

PY - 2004

Y1 - 2004

N2 - Assuming data traffic of fixed-length cells, we propose a frame-oriented scheduling discipline, PFRR (parallel fair round robin), for WDM optical switches by applying pfair (proportionate fairness) scheduling so that deterministic communication performance is guaranteed. Bandwidth reservation for an active session is performed by holding a number of cell slots for the session in a two-dimension frame, which is transferred iteratively over the multiple channels in an optical fiber. To determine the transmission order of cells in a frame, pfair scheduling is used so that the cells belonging to a session are distributed over the frame as uniformly as possible. Through the analysis by network calculus and by network simulator, it is shown that PFRR possesses tight delay bounds and lenient buffer requirements. Also, with a minor modification to PFRR, a new service discipline called MPFRR is proposed that can be used as traffic regulator to support sessions with jitter requirements.

AB - Assuming data traffic of fixed-length cells, we propose a frame-oriented scheduling discipline, PFRR (parallel fair round robin), for WDM optical switches by applying pfair (proportionate fairness) scheduling so that deterministic communication performance is guaranteed. Bandwidth reservation for an active session is performed by holding a number of cell slots for the session in a two-dimension frame, which is transferred iteratively over the multiple channels in an optical fiber. To determine the transmission order of cells in a frame, pfair scheduling is used so that the cells belonging to a session are distributed over the frame as uniformly as possible. Through the analysis by network calculus and by network simulator, it is shown that PFRR possesses tight delay bounds and lenient buffer requirements. Also, with a minor modification to PFRR, a new service discipline called MPFRR is proposed that can be used as traffic regulator to support sessions with jitter requirements.

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

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

M3 - Article

AN - SCOPUS:35048857008

VL - 3090

SP - 503

EP - 513

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -