Space-eeciency for Routing Schemes of Stretch Factor Three

Abstract

We deal with routing algorithms on arbitrary n-node networks. A routing algorithm is a deterministic distributed algorithm which routes messages from any source to any destination. It includes not only the classical routing tables, but also the routing algorithm that generates paths with loops. Our goal is to design routing algorithms which minimize, for… (More)

Topics

Cite this paper

@inproceedings{Gavoille1997SpaceeeciencyFR, title={Space-eeciency for Routing Schemes of Stretch Factor Three}, author={Cyril Gavoille and Marc Gengler}, year={1997} }