Random Walks in Routing Landscapes

Simple item page
dc.creatorMichalareas, T.
dc.creatorSacks, L.
dc.date2001-09-18
dc.date.accessioned2026-07-07T03:17:31Z
dc.date.available2026-07-07T03:17:31Z
dc.descriptionIn 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.
dc.description5 pages, 4 figures
dc.identifierhttps://arxiv.org/abs/cs/0109028
dc.identifierhttp://arxiv.org/abs/cs/0109028
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/30751
dc.subjectNetworking and Internet Architecture
dc.subjectComputational Complexity
dc.subjectC.2.2
dc.titleRandom Walks in Routing Landscapes
dc.typetext

Files

Collections

arXiv