Wavelength routing in optical networks of diameter two

Authors:
Christopher Jagger;Andrew Thomason
Affiliations:
DPMMS, Centre for Mathematical Sciences, Wilberforce Road, Cambridge, UK;DPMMS, Centre for Mathematical Sciences, Wilberforce Road, Cambridge, UK
Venue:
Journal of Computational and Applied Mathematics - Special issue: Probabilistic methods in combinatorics and combinatorial optimization
Year:
2002

Citing 4
Cited 0

Introduction to finite fields and their applications

Introduction to finite fields and their applications
Edge separators of planar and outerplanar graphs with applications

Journal of Algorithms
Efficient routing in all-optical networks

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Multiwavelength optical networks with limited wavelength conversion

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider optical networks with routing by wavelength division multiplexing. We show that wavelength switching is unnecessary in routings where communication paths use at most two edges. We then exhibit routings in some explicit pseudo-random graphs, showing that they achieve optimal performance subject to constraints on the number of edges and the maximal degree. We also observe the relative inefficiency of planar networks.