Sciweavers

2926 search results - page 13 / 586
» Partially Optimal Routing
Sort
View
SODA
2004
ACM
120views Algorithms» more  SODA 2004»
13 years 8 months ago
Optimal routing in Chord
We propose optimal routing algorithms for Chord [1], a popular topology for routing in peer-to-peer networks. Chord is an undirected graph on 2b nodes arranged in a circle, with e...
Prasanna Ganesan, Gurmeet Singh Manku
ICCCN
2007
IEEE
14 years 1 months ago
Utility-Based Routing in Communication Networks with Unstable Links
Abstract—Traditional Dijkstra and Bellman-Ford routing algorithms can only provide the best route to each destination based on a fixed link cost model. We propose a utility-base...
Mingming Lu, Jie Wu
GLOBECOM
2007
IEEE
13 years 11 months ago
Distributed Energy-Efficient Cooperative Routing in Wireless Networks
Recently, cooperative routing in wireless networks has gained much interest due to its ability to exploit the broadcast nature of the wireless medium in designing powerefficient ro...
Ahmed S. Ibrahim, Zhu Han, K. J. Ray Liu
IPPS
1993
IEEE
13 years 11 months ago
New Wormhole Routing Algorithms for Multicomputers
Abstract. Development of wormhole routing techniques so far has been largely independent of the results available for store-and-forward routing in literature. In this paper, we pro...
Rajendra V. Boppana, Suresh Chalasani
IJHPCN
2006
151views more  IJHPCN 2006»
13 years 7 months ago
Adaptive local searching and caching strategies for on-demand routing protocols in ad hoc networks
: On-demand routing protocols are widely used in mobile ad hoc networks due to their capability of adjusting to frequent network topology changes within acceptable routing overhead...
Zhao Cheng, Wendi B. Heinzelman