Gossiping in chordal rings under the line model - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Theoretical Computer Science Year : 2001

Gossiping in chordal rings under the line model

Lali Barrière
  • Function : Author
Margarida Mitjana
  • Function : Author


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.

Dates and versions

inria-00100504 , version 1 (26-09-2006)



Lali Barrière, Johanne Cohen, Margarida Mitjana. Gossiping in chordal rings under the line model. Theoretical Computer Science, 2001, 264 (1), pp.53-64. ⟨10.1016/S0304-3975(00)00213-9⟩. ⟨inria-00100504⟩
41 View
0 Download



Gmail Facebook Twitter LinkedIn More