Skip to main content
SpringerLink
Log in

Periodic Gossiping in Commuted Networks

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

In this paper we deal with global communication schemes such as broadcasting or multicasting, in a packet (sub)network in which each node participates in the same distributed application. We want the communication scheme to be performed periodically as often as possible and with some bandwidth guarantee. Such periodicity properties are needed, for example, by multimedia and grid computation applications. We consider commuted switches in the network, i.e., each outgoing link of the switch is assigned to at most one incoming link. Each switch avoids intermediate buffering. Given a network G and a global communication scheme S, an algorithm performing S in G consists in commuting each switch and in specifying to each emitting node the infinite sequence of steps at which it will send a message. The period of this algorithm is the greatest number of steps between two messages emitted by a node. The window of the algorithm is the maximal number of steps needed by a message to reach its destination(s). We first give a general definition of the model of network we consider and of the global communication schemes we study, i.e., the many-to-all scheme where many nodes have one message to send to all the other ones. One well-known case of the many-to-all scheme we especially focus on is gossiping. We present a general way of periodically performing these communication schemes, by covering the graph by substructures called octopuses. Then we show that optimizing the period and the windoware two different problems.We end by giving some examples of applications in the torus network.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Laboratoire PRiSM, Université Versailles Saint-Quentin, 45 av. des États-Unis, 78035 Versailles Cedex, France

    Dominique Barth

  2. Laboratoire de Recherche en Informatique, UMR CNRS 8623, Bât. 490, Centre d’Orsay, Université Paris-Sud, 91405 Orsay, France

    Pascal Berthomé

Authors
  1. Dominique Barth
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pascal Berthomé
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Dominique Barth or Pascal Berthomé.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Barth, D., Berthomé, P. Periodic Gossiping in Commuted Networks. Theory Comput Systems 37, 559–584 (2004). https://doi.org/10.1007/s00224-004-1197-8

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-004-1197-8

Keywords

Search

Navigation