Sciweavers

374 search results - page 30 / 75
» Evaluating path queries over route collections
Sort
View
SIGCOMM
2003
ACM
14 years 20 days ago
A routing underlay for overlay networks
We argue that designing overlay services to independently probe the Internet—with the goal of making informed application-specific routing decisions—is an untenable strategy....
Akihiro Nakao, Larry L. Peterson, Andy C. Bavier
ICPPW
2002
IEEE
14 years 11 days ago
ARA - The Ant-Colony Based Routing Algorithm for MANETs
A mobile ad-hoc network (MANET) is a collection of mobile nodes which communicate over radio. These kind of networks are very flexible, thus they do not require any existing infr...
Mesut Günes, Udo Sorges, Imed Bouazizi
GLOBECOM
2007
IEEE
14 years 1 months ago
Uncertainty Mitigation for Utility-Oriented Routing in Wireless Ad Hoc Networks
— Link and node reliability are important metrics in wireless ad hoc networks. Therefore, evaluating and quantifying reliability has become the cornerstone of research in this ...
Feng Li, Avinash Srinivasan, Mingming Lu, Jie Wu
TON
2002
99views more  TON 2002»
13 years 7 months ago
Computing shortest paths for any number of hops
In this paper we introduce and investigate a new" path optimization problem which we denote as the All Hops Optimal Path AHOP problem. The problem involves identifying, for a...
Roch Guérin, Ariel Orda
MOBICOM
1999
ACM
13 years 11 months ago
Optimizing the End-to-End Performance of Reliable Flows Over Wireless Links
We present the results of a performance evaluation of link layer error recovery over wireless links. Our analysis is based upon a case study of the circuit-switched data service i...
Reiner Ludwig, Almudena Konrad, Anthony D. Joseph