Sciweavers

2926 search results - page 240 / 586
» Partially Optimal Routing
Sort
View
SIGCOMM
1997
ACM
15 years 8 months ago
Scalable High Speed IP Routing Lookups
Internet address lookup is a challenging problem because of increasing routing table sizes, increased traffic, higher speed links, and the migration to 128 bit IPv6 addresses. IP...
Marcel Waldvogel, George Varghese, Jonathan S. Tur...
ADHOC
2008
183views more  ADHOC 2008»
15 years 4 months ago
On ant routing algorithms in ad hoc networks with critical connectivity
This paper shows a novel self-organizing approach for routing datagrams in ad hoc networks, called Distributed Ant Routing (DAR). This approach belongs to the class of routing alg...
Laura Rosati, Matteo Berioli, Gianluca Reali
CORR
2008
Springer
97views Education» more  CORR 2008»
15 years 4 months ago
Efficient Algorithms and Routing Protocols for Handling Transient Single Node Failures
Single node failures represent more than 85% of all node failures in the today's large communication networks such as the Internet [10]. Also, these node failures are usually...
Amit M. Bhosle, Teofilo F. Gonzalez
CN
2007
154views more  CN 2007»
15 years 4 months ago
Disjoint multipath routing using colored trees
— Multipath routing (MPR) is an effective strategy to achieve robustness, load balancing, congestion reduction, and increased throughput in computer networks. Disjoint multipath ...
Srinivasan Ramasubramanian, Harish Krishnamoorthy,...
CN
2004
138views more  CN 2004»
15 years 3 months ago
Overhead energy considerations for efficient routing in wireless sensor networks
Energy is the most critical resource in the life of a wireless sensor node. Therefore, its usage must be optimized to maximize the network life. It is known that for higher path l...
E. Ilker Oyman, Cem Ersoy