Efficient collective communciation in optical networks
type: Item
instance of: scholarly article
title: Efficient collective communciation in optical networks
zbMATH Open document ID: 0961.90020
DOI: 10.1016/S0304-3975(98)00018-8
author: Jean-Claude Bermond
author: Luisa Gargano
author: Adele A. Rescigno
author: Ugo Vaccaro
author: Stéphane Pérennes
published in: Theoretical Computer Science
publication date: 2000-08-23T00:00:00Z
Mathematics Subject Classification ID: 90B18
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 94A05
zbMATH DE Number: 1495217
zbMATH Keywords: communication networks
zbMATH Keywords: broadcasting
zbMATH Keywords: gossiping
zbMATH Keywords: optical networks
zbMATH Keywords: wavelength division multiplexing
zbMATH Keywords: single-hop
zbMATH Keywords: multi-hop
MaRDI profile type: Publication
cites work: Q3128902
cites work: Q4886092
cites work: Q3680833
cites work: Large fault-tolerant interconnection networks
cites work: Q4001523
cites work: Software Libraries for Linear Algebra Computations on High Performance Computers
cites work: Minimum-time line broadcast networks
cites work: Optimal algorithms for dissemination of information in generalized communication modes
cites work: Methods and problems of communication in usual networks
cites work: A survey of gossiping and broadcasting in communication networks
cites work: On forwarding indices of networks
cites work: Q4870160
cites work: Optimal algorithms for broadcast and gossip in the edge-disjoint path modes
cites work: Efficient wavelength routing on directed fiber trees
cites work: The relationship between gossiping in vertex-disjoint paths mode and bisection width
cites work: Gossiping in Minimal Time
cites work: Q4276003
cites work: Minimale \(n\)-fach kantenzusammenhängende Graphen
cites work: Q4252739
cites work: Fault-tolerant broadcasting and gossiping in communication networks
cites work: Efficient routing in all-optical networks
cites work: Expanding and forwarding
cites work: The Communication Complexity of Atomic Commitment and of Gossiping
full work available at URL: s0304-3975(98)00018-8
OpenAlex ID: W2045970714
description: scientific article; zbMATH DE number 1495217