Proceedings ArticleDOI
Lightnet: lightpath based solutions for wide bandwidth WANs
Imrich Chlamtac,Aura Ganz,G. Karmi +2 more
- pp 1014-1021
TLDR
The proposed lightpath architecture trades the ample bandwidth obtained by using multiple wavelengths for a reduction in the number of processing stages and a simplification of each switching stage, leading to substantially increased throughput.Abstract:
An inherent problem of conventional point-to-point wide area network (WAN) architectures is that they cannot translate optical transmission bandwidth into comparable user-available throughput due to the limiting electronic processing speed of the switching nodes. A solution to wavelength division multiplexing (WDM)-based WAN networks that addresses this limitation is presented. The proposed lightpath architecture trades the ample bandwidth obtained by using multiple wavelengths for a reduction in the number of processing stages and a simplification of each switching stage, leading to substantially increased throughput. The principle of the lightpath architecture is the construction and use of a virtual topology network in the wavelength domain, embedded in the original network. A study is made of the embedding of virtual networks whose topologies are regular, using algorithms which provide bounds on the number of wavelengths, switch sizes, and average number of switching stages per packet transmission. >read more
Citations
More filters
Journal ArticleDOI
WDM-based local lightwave networks. I. Single-hop systems
TL;DR: The characteristics of lightwave technology that facilitate the design of wavelength-division-multiplexing (WDM) networks are reviewed, and it is explained how WDM local networks can be built based on the single-hop and multihop approaches.
Journal ArticleDOI
WDM-based local lightwave networks. II. Multihop systems
TL;DR: A survey of wavelength-division-multiplexing (WDM)-based local lightwave networks is presented, and regular topologies that have been studied as candidates for multihop light wave networks, including the perfect shuffle, the de Bruijn graph, the toroid, and the hypercube are discussed.
Journal ArticleDOI
Some principles for designing a wide-area WDM optical network
TL;DR: In this paper, the authors explore design principles for next-generation optical wide-area networks, employing wavelength-division multiplexing (WDM) and targeted to nationwide coverage, and formulate the virtual topology design problem as an optimization problem with one of two possible objective functions: (1) for a given traffic matrix, minimize the networkwide average packet delay (corresponding to a solution for present traffic demands), or (2) maximize the scale factor by which the traffic matrix can be scaled up (to provide the maximum capacity upgrade for future traffic demands).
Journal ArticleDOI
Network performance and integrity enhancement with optical path layer technologies
TL;DR: The optical path layer concept proposed exploits and consolidates the layered transport network architecture and optical technologies, and will open up new opportunities for creating a B-ISDN that is bandwidth abundant and has a high degree of integrity.
Journal ArticleDOI
The 'staggering switch': an electronically controlled optical packet switch
TL;DR: In this paper, an almost-all-optical packet switch that does not rely on recirculating loops for storage implementation is presented, based on two rearrangeably nonblocking stages interconnected by optical delay lines with different amounts of delay.
References
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Book
Graph Algorithms
TL;DR: A thoroughly revised second edition of Shimon Even's Graph Algorithms, with a foreword by Richard M. Karp and notes by Andrew V Goldberg, explains algorithms in a formal but simple language with a direct and intuitive presentation.
Journal ArticleDOI
Expected computation time for Hamiltonian path problem
Yuri Gurevich,Saharon Shelah +1 more
TL;DR: In this paper, the authors consider the problem of finding an algorithm that is fact on average with respect to a natural probability distribution on inputs and consider the Hamilto problem from that point of view.