Gossiping in chordal rings under the line model

View/Open
Document typeArticle
Defense date2000
Rights accessOpen Access
Abstract
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 efficiently as these networks. We
propose polynomial algorithms to derive optimal or near optimal
gossip protocols in the chordal ring.
Files | Description | Size | Format | View |
---|---|---|---|---|
0001mitjana.pdf | 304,3Kb | View/Open |
Except where otherwise noted, content on this work
is licensed under a Creative Commons license
:
Attribution-NonCommercial-NoDerivs 2.5 Spain