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.
Type de document :
Article dans une revue
Theoretical Computer Science, Elsevier, 2001, 264 (1), pp.53-64
Liste complète des métadonnées

Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 14:46:20
Dernière modification le : jeudi 17 mai 2018 - 12:52:03


  • 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〉



Consultations de la notice