• TUCS Publication Series
• How to Publish in TUCS Series
• Publication Search
• Publication Graph
• Publication Input
• Publication Input Guide
• JuFo Browser

Recurrence Equation as Basis for Designing Hot-Potato Routing Protocols

Ville Leppänen, Martti Penttonen, Recurrence Equation as Basis for Designing Hot-Potato Routing Protocols. In: Proceedings of the International Conference on Computer Systems and Technologies, CompSysTech'04, IIIB.1.1 - 6, 2004.

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.

BibTeX entry:

@INPROCEEDINGS{inpLePe04a,
  title = {Recurrence Equation as Basis for Designing Hot-Potato Routing Protocols},
  booktitle = {Proceedings of  the International Conference on Computer Systems and Technologies, CompSysTech'04},
  author = {Leppänen, Ville and Penttonen, Martti},
  pages = {IIIB.1.1 - 6},
  year = {2004},
}

Belongs to TUCS Research Unit(s): Algorithmics and Computational Intelligence Group (ACI)

Edit publication