HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Journal articles

Gossiping in chordal rings under the line model

Lali Barrière Johanne Cohen 1 Margarida Mitjana
1 RESEDAS - Software Tools for Telecommunications and Distributed Systems
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : This paper is devoted to the gossip (or all-to-all) problem in the chordal ring under the one-port line model. The line model assumes long distance calls between non neighboring processors. In this sense, the line model is strongly related to circuit-switched networks, wormhole routing, optical networks supporting wavelength division multiplexing, ATM switching, and networks supporting connected mode routing protocols. Since the chordal rings are competitors of networks as meshes or tori because of theirs short diameter and bounded degree, it is of interest to ask whether they can support intensive communications (typically all-to-all) as eÆciently as these networks. We propose polynomial algorithms to derive optimal or near optimal gossip protocols in the chordal ring.
Document type :
Journal articles
Complete list of metadata

Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Tuesday, September 26, 2006 - 2:46:20 PM
Last modification on : Friday, February 4, 2022 - 3:30:17 AM


  • HAL Id : inria-00100504, version 1



Lali Barrière, Johanne Cohen, Margarida Mitjana. Gossiping in chordal rings under the line model. Theoretical Computer Science, Elsevier, 2001, 264 (1), pp.53-64. ⟨inria-00100504⟩



Record views