Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks

DOI10.1016/S0166-218X(97)00113-3zbMath0907.90137OpenAlexW2059416361MaRDI QIDQ1392538

Stéphane Pérennes

Publication date: 28 July 1998

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

gossipingbroadcastingshuffle-exchange graphde Bruijn related networks

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

On the \(k\)-tuple domination of de Bruijn and Kautz digraphs ⋮ Lower bounds on systolic gossip ⋮ Faster gossiping on butterfly networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on recursive properties of the de Bruijn, Kautz and FFT digraphs
• Broadcasting and spanning trees in de Bruijn and Kautz networks
• Table of large \(({\Delta{}}, D)\)-graphs
• The Hamiltonian property of consecutive-\(d\) digraphs
• Methods and problems of communication in usual networks
• Broadcasting in butterfly and deBruijn networks
• Connectivity of Regular Directed Graphs with Small Diameters
• Families of Fixed Degree Graphs for Processor Interconnection
• A Design for Directed Graphs with Minimum Diameter
• A survey of gossiping and broadcasting in communication networks
• Design to Minimize Diameter on Building-Block Network
• Broadcasting in Bounded Degree Graphs
• On even factorizations and the chromatic index of the Kautz and de Bruijn digraphs

This page was built for publication: Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks