Average Case Analysis of Greedy Routing algorithms on Arrays

  title={Average Case Analysis of Greedy Routing algorithms on Arrays},
  author={Frank Thomson Leighton},
In this paper, we analyze the average case behavior of greedy routing algorithms on arrays under a variety of assumptions. Overall, we find that certain greedy algorithms perform surprisingly well on average. For example, given an N x N array or torus where every node starts with one packet headed for a random destination, we show that some (but not all) greedy store-andforward algorithms route every packet to its destinrt, tion with only O(log N) delay per packet and maximum queuesize 4 with… CONTINUE READING

From This Paper

Topics from this paper.

Similar Papers

Loading similar papers…