Analysis of Randomized Scheduling Algorithm for a Practical Bufferless Optical Network

We evaluate a plausible bufferless star-based packet-switched optical network. A randomized scheduling algorithm is used to resolve contention, alleviating the need for a centralized controller to coordinate the edge nodes. A bipartite graph matching algorithm is proposed to be used at the core node...

Full description

Saved in:
Bibliographic Details
Published in:IEEE communications letters 2007-06, Vol.11 (6), p.537-539
Main Authors: Seddighian, P., Leon-Garcia, A., Rusch, L.A.
Format: Article
Language:English
Subjects:
Algorithm design and analysis
Algorithms
Applied sciences
Architecture
Bipartite graph
Buffers
Centralized control
Computer simulation
Exact sciences and technology
Graph matching
Mesh networks
Optical buffering
Optical communication
Optical fiber communications
Optical fiber networks
Optical packet switching
Optical switches
Optical telecommunications
Scheduling
Scheduling algorithm
Switching and signalling
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Traffic control
Transmission and modulation (techniques and equipments)
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We evaluate a plausible bufferless star-based packet-switched optical network. A randomized scheduling algorithm is used to resolve contention, alleviating the need for a centralized controller to coordinate the edge nodes. A bipartite graph matching algorithm is proposed to be used at the core node to minimize the packet drop rate. We examine the performance of the system via simulation, to establish the potential of this architecture for practical packet-switched optical networks.
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2007.070192