Advertisement

Theory of Computing Systems

, Volume 31, Issue 4, pp 425–449 | Cite as

Universal Continuous Routing Strategies

  • C. Scheideler
  • B. Vöcking

Abstract.

We analyze universal routing protocols, that is, protocols that can be used for any communication pattern in any network, under a stochastic model of continuous message generation. In particular, we present two universal protocols, a store-and-forward and a wormhole routing protocol, and characterize their performance by the following three parameters: the maximum message generation rate for which the protocol is stable, the expected delay of a message from generation to service, and the time the protocol needs to recover from worst-case scenarios. Both protocols yield significant performance improvements over all previously known continuous routing protocols. In addition, we present adaptations of our protocols to continuous routing in node-symmetric networks, butterflies, and meshes.

Keywords

Generation Rate Stochastic Model Performance Improvement Communication Pattern Significant Performance 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag New York Inc. 1998

Authors and Affiliations

  • C. Scheideler
    • 1
  • B. Vöcking
    • 1
  1. 1.Department of Mathematics and Computer Science, and Heinz Nixdorf Institute, University of Paderborn, 33095 Paderborn, Germany {chrsch,voecking}@uni-paderborn.deDE

Personalised recommendations