Lightwave networks based on de Bruijn graphs
TLDR
De Bruijn graphs are proposed as logical topologies for multihop lightwave networks consisting of all-optical routing nodes interconnected by point-to-point fiber links and a physical topology based on a de Bruijn graph can support a large number of stations using a relatively small number of wavelengths.Abstract:
Proposes de Bruijn graphs as logical topologies for multihop lightwave networks. After deriving bounds on the throughput and delay performance of any logical topology, the authors compute the throughput and delay performance of de Bruijn graphs for two different routing schemes and compare it with their bounds and the performance of shufflenets. For a given maximum nodal in- and out-degree and average number of hops between stations, a logical topology based on a de Bruijn graph can support a larger number of stations than a shufflenet and this number is close to the maximum that can be supported by any topology. The authors also propose de Bruijn graphs as good physical topologies for wavelength routing lightwave networks consisting of all-optical routing nodes interconnected by point-to-point fiber links. The worst-case loss experienced by a transmission is proportional to the maximum number of hops (diameter). For a given maximum nodal in- and out-degree and diameter, a physical topology based on a de Bruijn graph can support a large number of stations using a relatively small number of wavelengths. >read more
Citations
More filters
Journal ArticleDOI
Routing and wavelength assignment in all-optical networks
TL;DR: The authors derive an upper bound on the carried traffic of connections for any routing and wavelength assignment (RWA) algorithm in a reconfigurable optical network and quantifies the amount of wavelength reuse achievable in large networks as a function of the number of wavelengths, number of edges, and number of nodes for randomly constructed networks as well as de Bruijn networks.
Journal ArticleDOI
Design of logical topologies for wavelength-routed optical networks
TL;DR: The problem of designing a logical topology over a wavelength-routed all-optical network (AON) physical topology is studied and several heuristic topology design algorithms are compared against that of randomly generated topologies, as well as lower bounds.
Journal ArticleDOI
Models of blocking probability in all-optical networks with and without wavelength changers
TL;DR: A traffic model for circuit switched all-optical networks (AONs) is introduced which is used to calculate the blocking probability along a path for networks with and without wavelength changers.
Journal ArticleDOI
Benefits of wavelength translation in all-optical clear-channel networks
M. Kovacevic,Anthony S. Acampora +1 more
TL;DR: It is shown that the analytical models match the simulation results very well in the case of the centralized switch and the mesh network, and wavelength translation can significantly improve the performance of a large mesh-torus network.
Journal ArticleDOI
All-Optical Network Consortium-ultrafast TDM networks
Richard A. Barry,Vincent W. S. Chan,Katherine L. Hall,E. S. Kintzer,John D. Moores,Kristin A. Rauschenbach,Eric A. Swanson,L.E. Adams,Christopher Richard Doerr,S.G. Finn,Hermann A. Haus,Erich P. Ippen,W.S. Wong,M. Haner +13 more
TL;DR: In this paper, the authors describe the results of the Advanced Research Projects Agency (ARPA) sponsored Consortium on Wideband All-Optical Networks (COWOP) which is developing architectures, technology components, and applications for ultrafast 100 Gb/s time-division multiplexing (TDM) optical networks.
References
More filters
Journal ArticleDOI
Fast Pattern Matching in Strings
TL;DR: An algorithm is presented which finds all occurrences of one given string within another, in running time proportional to the sum of the lengths of the strings, showing that the set of concatenations of even palindromes, i.e., the language $\{\alpha \alpha ^R\}^*$, can be recognized in linear time.
Book
Shift register sequences
TL;DR: The Revised Edition of Shift Register Sequences contains a comprehensive bibliography of some 400 entries which cover the literature concerning the theory and applications of shift register sequences.
Proceedings ArticleDOI
ShuffleNet: an application of generalized perfect shuffles to multihop lightwave networks
M.G. Hluchyj,M.J. Karol +1 more
TL;DR: The authors propose a multihop wavelength-division-multiplexing (WDM) approach, referred to as ShuffleNet, for achieving concurrency in distributed lightwave networks, which achieves high efficiency for uniform traffic loads.
Journal ArticleDOI
Shuffle Net: an application of generalized perfect shuffles to multihop lightwave networks
M.G. Hluchyj,Mark J. Karol +1 more
TL;DR: A multihop wavelength-division multiplexing (WDM) approach, referred to as Shuffle Net, for achieving concurrency in distributed lightwave networks is proposed, avoiding both wavelength-agility and pretransmission-coordination problems.
Journal ArticleDOI
An overview of lightwave packet networks
A.S. Acampora,M.J. Karol +1 more
TL;DR: The unique systems opportunities offered by, and the unique systems constraints imposed by, lightwave technology as it applies to the field of distributed packet networks are examined.