Random Walks in Routing Landscapes

Details Random Walks in Routing Landscapes Random Walks in Routing Landscapes

2001-09-18

arxiv.org/abs/cs/0109028v1

Computer Science

Networking and Internet Architecture

5 pages, 4 figures

Scientific paper

In this paper we present a combinatorial optimisation view on the routing problem for connectionless packet networks by using the metaphor of a landscape. We examine the main properties of the routing landscapes as we define them and how they can help us on the evaluation of the problem difficulty and the generation of effective algorithms. We also present the random walk statistical technique to evaluate the main properties of those landscapes and a number of examples to demonstrate the use of the method.

Affiliated with

Also associated with

No associations

Rating

Random Walks in Routing Landscapes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Random Walks in Routing Landscapes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Random Walks in Routing Landscapes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-424895