Random Walks in Routing Landscapes: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 02:5202:52, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 2,258 bytes +2,258‎ Created page with "Title: Random Walks in Routing Landscapes Abstract: This research paper presents a combinatorial optimization view on the routing problem for connectionless packet networks using the metaphor of a landscape. It examines the main properties of routing landscapes and how they can help in evaluating the problem's difficulty and generating effective algorithms. It also presents the random walk statistical technique to evaluate the main properties of these landscapes and pro..."
Retrieved from "https://simplesci.org/wiki/Random_Walks_in_Routing_Landscapes"