Paper Info
Title
Scheduling high-rate sessions in Fractional Lambda Switching networks: Algorithm and analysis
Abstract
This work addresses the high-rate session scheduling problem in fractional lambda switching (FlambdaS) networks. With its global phase synchronization and pipeline forwarding (PF) operation, FlambdaS offers promising network performance and scalability over its competitors, e.g., time division multiplexing (such as SONET/SDH) and wavelength division multiplexing (WDM). Yet, Non-Immediate Forwarding (NIF) brings challenging complexity to session scheduling, where other known scheduling methods (e.g. RWTA) are not applicable. A forwarding graph is used to wholly examine the huge schedule space for an end-to-end high-rate NIF session. An efficient scheduling algorithm, eSSM, is proposed to explore all possibilities on the graph and present the optimized non-blocking schedule. Complexity bounds are then devised analytically and experimentally verified under specific circumstances. A low-complexity heuristic is proposed to avoid the complexity of eSSM in low-load networks.
Year
DOI
Venue
2008
10.1109/ISCC.2008.4625707
Marrakech
Keywords
Field
DocType
computational complexity,scheduling,telecommunication switching,SDH,SONET,WDM,forwarding graph,fractional lambda switching networks,global phase synchronization,high-rate session scheduling,pipeline forwarding operation,time division multiplexing,wavelength division multiplexing
Algorithm design,Job shop scheduling,Fair-share scheduling,Scheduling (computing),Computer science,Computer network,Schedule,Time-division multiplexing,Computational complexity theory,Distributed computing,Scalability
Conference
ISSN
ISBN
Citations 
1530-1346 E-ISBN : 978-1-4244-2703-1
978-1-4244-2703-1
0
PageRank 
References 
Authors
0.34
4
3
Name
Order
Citations
PageRank
Thu-Huong Truong1396.28
Mario Baldi245154.09
Yoram Ofek360881.68