Chapter 6 Associativity-Based Long-Lived Routing
6.1 A New Routing Paradigm
Research on routing for communication networks has been on-going for many years. The significance of a routing algorithm is to compute a path from one node to another within a finite time. When multiple paths exist, then some form of selection criteria is needed. A common and widely used route selection criteria is shortest path. A path that results in the shortest end-to-end route is usually preferred. Shortest path can sometime refer to minimum-hop, that is, the least number of links used in the route. This has strong implications on total link utilization and the state of network congestion.
Many routing algorithms developed over the years are variants of shortest ...
Get Ad Hoc Mobile Wireless Networks: Protocols and Systems now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
