Location of Repository

Self stabilizing smoothing and counting

By Maurice Herlihy and Srikanta Tirthapura

Abstract

A smoothing network is a distributed data structure that accepts tokens on input wires and routes them to output wires. It ensures that however imbalanced the traffic on input wires, the numbers of tokens emitted on output wires are approximately balanced. Prior work on smoothing networks always assumed that such networks were properly initialized. In a real distributed system, however, network switches may be rebooted or replaced dynamically, and it may not be practical to determine the correct initial state for the new switch. Prior analyses do not work under these new assumptions. This paper makes the following contributions. First, we show that some well-known 1-smoothing networks, known as counting networks, when started in an arbitrary initial state (perhaps chosen by an adversary), remain remarkably smooth, degrading from 1-smooth to �-smooth, where is the number of input/output wires. Second, we show that the same networks can be made eventually 1-smooth by “piggy-backing ” a small amount of additional information on messages when (and only when) trouble is detected. 1

Year: 2003
OAI identifier: oai:CiteSeerX.psu:10.1.1.186.4679
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.brown.edu/resear... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.