A practical approach to scheduler implementation for optical burst/packet switching

Authors:
Franco Callegati;Aldo Campi;Walter Cerroni
Affiliations:
Department of Electronics, Computer Science and Systems, University of Bologna, Italy;Department of Electronics, Computer Science and Systems, University of Bologna, Italy;Department of Electronics, Computer Science and Systems, University of Bologna, Italy
Venue:
ONDM'10 Proceedings of the 14th conference on Optical network design and modeling
Year:
2010

Citing 5
Cited 3

Terabit burst switching

Journal of High Speed Networks - Special issue on optical networking
Control architecture in optical burst-switched WDM networks

IEEE Journal on Selected Areas in Communications
Optical routing of asynchronous, variable length packets

IEEE Journal on Selected Areas in Communications
Efficient burst scheduling algorithms in optical burst-switched networks using geometric techniques

IEEE Journal on Selected Areas in Communications
Optical burst switching: a new area in optical networking research

IEEE Network: The Magazine of Global Internetworking

Fast and versatile scheduler design for optical packet/burst switching

Optical Switching and Networking
Review: A parallel iterative scheduler for asynchronous Optical Packet Switching networks

Optical Switching and Networking
Self-healing in transparent optical packet switching mesh networks: A reinforcement learning perspective

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

Optical Burst and Packet Switching represent two key paradigms to build bandwidth-efficient IP over DWDM networks. Due to very strict time constraints, one of the major implementation issues common to both technologies is the actual feasibility of the scheduler that is in charge of assigning transmission resources to burst/packets upon request while executing optimized algorithms for contention resolution. This paper demonstrates how a specific formulation of the scheduling problem can be the basis for a cost-effective and practical implementation of the scheduler control logic, resulting in processing times that are greatly reduced and could show very limited dependence on the traffic conditions.