Efficient collective communciation in optical networks

DOI10.1016/S0304-3975(98)00018-8zbMath0961.90020OpenAlexW2045970714MaRDI QIDQ1575944

Jean-Claude Bermond, Ugo Vaccaro, Luisa Gargano, Adele A. Rescigno, Stéphane Pérennes

Publication date: 23 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00018-8

zbMATH Keywords

communication networksgossipingoptical networkswavelength division multiplexingbroadcastingmulti-hopsingle-hop

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Communication theory (94A05)

Related Items (10)

Forwarding and optical indices of 4-regular circulant networks ⋮ The undirected optical indices of complete \(m\)-ary trees ⋮ Routing and wavelength assignment for hypercube in array-based WDM optical networks ⋮ Routing permutations and involutions on optical ring networks: Complexity results and solution to an open problem ⋮ Recursive cubes of rings as models for interconnection networks ⋮ Multi-hop all-to-all optical routings in Cartesian product networks ⋮ Combinatorial constructions of fault-tolerant routings with levelled minimum optical indices ⋮ Sparse and limited wavelength conversion in all-optical tree networks ⋮ Approximation algorithms for routing and call scheduling in all-optical chains and rings. ⋮ A FEW FAMILIES OF CAYLEY GRAPHS AND THEIR EFFICIENCY AS COMMUNICATION NETWORKS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Large fault-tolerant interconnection networks
• Optimal algorithms for dissemination of information in generalized communication modes
• Methods and problems of communication in usual networks
• Expanding and forwarding
• On forwarding indices of networks
• Minimale \(n\)-fach kantenzusammenhängende Graphen
• Efficient routing in all-optical networks
• The Communication Complexity of Atomic Commitment and of Gossiping
• A survey of gossiping and broadcasting in communication networks
• Minimum-time line broadcast networks
• Gossiping in Minimal Time
• Efficient wavelength routing on directed fiber trees
• Software Libraries for Linear Algebra Computations on High Performance Computers
• Optimal algorithms for broadcast and gossip in the edge-disjoint path modes
• The relationship between gossiping in vertex-disjoint paths mode and bisection width
• Fault-tolerant broadcasting and gossiping in communication networks

This page was built for publication: Efficient collective communciation in optical networks