An optimal greedy heuristic to color interval graphs
Information Processing Letters
Approximation algorithms for bin packing: a survey
Approximation algorithms for NP-hard problems
Sorting, Selection, and Routing on the Array with Reconfigurable Optical Buses
IEEE Transactions on Parallel and Distributed Systems
Online computation and competitive analysis
Online computation and competitive analysis
Efficient and scalable quicksort on a linear array with a reconfigurable pipelined bus system
Future Generation Computer Systems
Light-Trails: A Solution to IP Centric Communication in the Optical Domain
QoS-IP 2003 Proceedings of the Second International Workshop on Quality of Service in Multiservice IP Networks
RMB -- A Reconfigurable Multiple Bus Network
HPCA '96 Proceedings of the 2nd IEEE Symposium on High-Performance Computer Architecture
Light-Trail Networks: Design and Survivability
LCN '05 Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary
Heuristic and optimal techniques for light-trail assignment in optical ring WDM networks
Computer Communications
An efficient O(1) time 3D all nearest neighbor algorithm from image processing perspective
Journal of Parallel and Distributed Computing
Multihop light-trails (MLT) - a solution to extended metro networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
| Hi-index | 0.00 |
We consider the problem of scheduling communication on optical WDM (wavelength division multiplexing) networks using the light-trails technology. We seek to design scheduling algorithms such that the given transmission requests can be scheduled using a minimum number of wavelengths (optical channels). We provide algorithms and close lower bounds for two versions of the problem on an n processor linear array/ring network. In the stationary version, the pattern of transmissions (given) is assumed to not change over time. For this, a simple lower bound is c, the congestion or the maximum total traffic required to pass through any link. We give an algorithm that schedules the transmissions using O(c+logn) wavelengths. We also show a pattern for which @W(c+logn/loglogn) wavelengths are needed. In the on-line version, the transmissions arrive and depart dynamically, and must be scheduled without upsetting the previously scheduled transmissions. For this case we give an on-line algorithm which has competitive ratio @Q(logn). We show that this is optimal in the sense that every on-line algorithm must have competitive ratio @W(logn). We also give an algorithm that appears to do well in simulations (for the classes of traffic we consider), but which has competitive ratio between @W(log^2n/loglogn) and O(log^2n). We present detailed simulations of both our algorithms.