𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Improved balancing heuristics for optimizing shortest path routing

✍ Scribed by Makarem Bamatraf; Mohamed Othman

Book ID
108100655
Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
379 KB
Volume
30
Category
Article
ISSN
0140-3664

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Load-balancing in MANET shortest-path ro
Load-balancing in MANET shortest-path routing protocols
✍ Oussama Souihli; Mounir Frikha; Mahmoud Ben Hamouda πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 970 KB

Mobile ad hoc networks (MANET) are infrastructure-less networks, dynamically formed by an independent system of mobile nodes that are connected via wireless links. Because routing is performed by nodes with limited resources, load should be efficiently distributed through the network. Otherwise, hea

Optimal routing in shortest-path data ne
Optimal routing in shortest-path data networks
✍ K. G. Ramakrishnan; Manoel A. Rodrigues πŸ“‚ Article πŸ“… 2002 πŸ› Institute of Electrical and Electronics Engineers 🌐 English βš– 249 KB πŸ‘ 1 views
Worst Case Bounds for Shortest Path Inte
Worst Case Bounds for Shortest Path Interval Routing
✍ Cyril Gavoille; Eric GuΓ©vremont πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 285 KB

Consider shortest path inter¨al routing, a popular memory-balanced method for Ž . solving the routing problem on arbitrary networks. Given a network G, let IRS G denote the maximum number of intervals necessary to encode groups of destinations on an edge, minimized over all shortest path interval ro