Journal ArticleDOI
Scheduling transmissions in WDM broadcast-and-select networks
Gerard R. Pieris,Galen Sasaki +1 more
TLDR
The authors consider all-to-all transmission schedules, which are defined to be ones that schedule a packet transmission between each input-output pair, and present upper and lower bounds for the minimum length of such schedules.Abstract:
Considers a broadcast-and-select, wavelength division multiplexed (WDM), optical communication network that is packet switched and time slotted. The amount of time it takes transmitters and receivers to tune from one wavelength to another is assumed to be T slots. The authors consider all-to-all transmission schedules, which are defined to be ones that schedule a packet transmission between each input-output pair. They present upper and lower bounds for the minimum length of such schedules. In particular, if each of N inputs has a tunable transmitter and each of N outputs has a tunable receiver then the minimum length is between (N+o(N))(/spl radic/T+1) and ((N+o(N))/spl radic/T. This provides some insight into the relationship between packet delay and T. The authors also consider schedules that do not allow packet transmissions while a transmitter or receiver is tuning from one wavelength to another. >read more
Citations
More filters
Proceedings ArticleDOI
Efficient routing in all-optical networks
Prabhakar Raghavan,Eli Upfal +1 more
TL;DR: This work presents licient routing techniques for the two types of photonic switches that dominate current research in all-optical networks, and studies the problem of routing a set of requests on sparse networks using a limited number of wavelengths.
Proceedings ArticleDOI
Efficient routing and scheduling algorithms for optical networks
TL;DR: This paper classifies several models related to optical networks and presents optimal or near-optimal algorithms for permutation routing and/or scheduling problems in many of these models.
Journal ArticleDOI
Efficient scheduling of nonuniform packet traffic in a WDM/TDM local lightwave network with arbitrary transceiver tuning latencies
TL;DR: A passive-star-based, broadcast-and-select, local lightwave network which can support a limited number of wavelength-division multiplexed (WDM) channels, but serve a much larger number of nodes, is considered and exploits well-known results from scheduling theory to create efficient transmission schedules.
Journal ArticleDOI
Guaranteed scheduling for switches with configuration overhead
Brian Towles,William J. Dally +1 more
TL;DR: Three algorithms that provide performance guarantees for scheduling switches, such as optical switches, with configuration overhead are presented and it is shown that DOUBLE and LIST offer the lowest required speedup to emulate an unconstrained switch across a wide range of port count and delay.
Journal ArticleDOI
Packet scheduling in broadcast WDM networks with arbitrary transceiver tuning latencies
TL;DR: It is shown that it is possible to appropriately dimension the network to minimize the effects of even large values of the tuning latency, and develop heuristics which give schedules of length equal or very close to the lower bound.
References
More filters
Book
Linear and nonlinear programming
David G. Luenberger,Yinyu Ye +1 more
TL;DR: Strodiot and Zentralblatt as discussed by the authors introduced the concept of unconstrained optimization, which is a generalization of linear programming, and showed that it is possible to obtain convergence properties for both standard and accelerated steepest descent methods.
Proceedings ArticleDOI
Efficient routing and scheduling algorithms for optical networks
TL;DR: This paper classifies several models related to optical networks and presents optimal or near-optimal algorithms for permutation routing and/or scheduling problems in many of these models.
Proceedings ArticleDOI
A time-wavelength assignment algorithm for a WDM star network
Aura Ganz,Y. Gao +1 more
TL;DR: The first time-wavelength assignment algorithm for wavelength division multiplexing (WDM) star-based local and metropolitan area networks is presented and obtains a TDM/WDM schedule with minimal packet transmission duration, while minimizing the tuning time.
Proceedings ArticleDOI
Bus-oriented interconnection topologies for single-hop communication among multi-transceiver stations
TL;DR: The author presents the topological design space of single-hop interconnection among multitransceiver stations (no intermediate switches and no forwarding) and explores a class of such interconnections for which the throughput with a uniform traffic pattern is proportional to the square of the number of transceivers per station.