Universal continuous routing strategies

Publisher Website
Google Scholar
Abstract
In this paper we present routing protocols that are universal m the sense that they route messages along arbitrary (simple or shortest) paths in arbitrary networks. We study these protocols under a stochastic model of continuous message generation. The performance of such protocols is characterized by 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. Our main results are a universal continuous store-and-forward routing protocol and a universal continuous wormhole routing protocol. Both protocols yield slgmficant performance improvements over all previously known continuous routing protocols In addition, we present adaptations of our main results to continuous routing m node-symmetric networks, butterfhes, and meshes

This publication has 0 references indexed in Scilit: