Wide-sense nonblocking networks
SIAM Journal on Discrete Mathematics
On-line algorithms for path selection in a nonblocking network
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Expanders that beat the eigenvalue bound: explicit construction and applications
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
How much can hardware help routing?
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Architectures for linear lightwave networks
Architectures for linear lightwave networks
A linear lightwave Benes network
IEEE/ACM Transactions on Networking (TON)
All-to-all optical routing in optimal chordal rings of degree four
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Efficient Fault-Tolerant Routing in Multihop Optical WDM Networks
IEEE Transactions on Parallel and Distributed Systems
Sparse and limited wavelength conversion in all-optical tree networks
Theoretical Computer Science
Bandwidth allocation in WDM tree networks
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Robust Routing in Wide-Area WDM Networks
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Optical Routing of Uniform Instances in Tori
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Multicasting in Optical Networks
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
New Results for Path Problems in Generalized Stars, Complete Graphs, and Brick Wall Graphs
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Recent Advances in Wavelength Routing
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
A 2-Approximation Algorithm for Path Coloring on Trees of Rings
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Dynamic Reconfiguration of an Optical Interconnect
ANSS '03 Proceedings of the 36th annual symposium on Simulation
A 2-approximation algorithm for path coloring on a restricted class of trees of rings
Journal of Algorithms
An algorithmic Friedman--Pippenger theorem on tree embeddings and applications to routing
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Path problems in generalized stars, complete graphs, and brick wall graphs
Discrete Applied Mathematics - Special issue: Efficient algorithms
A general approach for all-to-all routing in multihop WDM optical networks
IEEE/ACM Transactions on Networking (TON)
Journal of Discrete Algorithms
Island hopping and path colouring with applications to WDM network design
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Finding multiple routing paths in wide-area WDM networks
Computer Communications
Path problems in generalized stars, complete graphs, and brick wall graphs
Discrete Applied Mathematics - Special issue: Efficient algorithms
A power-efficient all-optical on-chip interconnect using wavelength-based oblivious routing
Proceedings of the fifteenth edition of ASPLOS on Architectural support for programming languages and operating systems
Combinatorial constructions of fault-tolerant routings with levelled minimum optical indices
Discrete Applied Mathematics
Approximation algorithms for path coloring in trees
Efficient Approximation and Online Algorithms
Wavelength routing of uniform instances in all-optical rings
Discrete Optimization
Systolic routing in an optical ring with logarithmic shortcuts
HPCC'07 Proceedings of the Third international conference on High Performance Computing and Communications
| Hi-index | 0.01 |
This paper studies the problem of dedicating routes to connections in optical networks. In optical networks, the vast bandwidth available in an optical fiber is utilized by partitioning it into several channels, each at a different optical wavelength. A connection between two nodes is assigned a specific wavelength, with the constraint that no two connections sharing a link in the network can be assigned the same wavelength. This paper considers optical networks with and without switches, and different types of routing in these networks. It presents optimal or near-optimal constructions of optical networks in these cases and algorithms for routing connections, specifically permutation routing for the networks constructed here.