Recurrence equation as basis for designing hot-potato routing protocols

Authors:
Ville Leppänen;Martti Penttonen
Affiliations:
University of Turku;University of Kuopio
Venue:
CompSysTech '04 Proceedings of the 5th international conference on Computer systems and technologies
Year:
2004

Citing 9
Cited 0

Randomized algorithms

Randomized algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Packet routing in fixed-connection networks: a survey

Journal of Parallel and Distributed Computing
Randomized greedy hot-potato routing

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Work-optimal simulation of PRAM models on meshes

Nordic Journal of Computing
Parallel Alternating-Direction Access Machine

MFCS '96 Proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science
Solving Fundamental Problems on Sparse-Meshes

SWAT '98 Proceedings of the 6th Scandinavian Workshop on Algorithm Theory
Optimal Embedding of a Toroidal Array in a Linear Array

FCT '91 Proceedings of the 8th International Symposium on Fundamentals of Computation Theory
Hot-Potato Routing Algorithms for Sparse Optical Torus

ICPPW '01 Proceedings of the 2001 International Conference on Parallel Processing Workshops

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this work we demonstrate the use of generating functions for solving recurrence equations, which can occur e.g. in the analysis of routing protocols. We prove an exact bound for the expectation of packets reaching their target in a torus, when the routing protocol makes the packets to favor with probability p in each node a diagonal route to their target. Higher probability increases expectation of successful packets. We consider designing routing protocols according to the scenario and compare them to known results.