Sciweavers

5079 search results - page 115 / 1016
» Hidden-Action in Network Routing
Sort
View
HOTNETS
2010
14 years 4 months ago
Packet re-cycling: eliminating packet losses due to network failures
This paper presents Packet Re-cycling (PR), a technique that takes advantage of cellular graph embeddings to reroute packets that would otherwise be dropped in case of link or nod...
Suksant Sae Lor, Raul Landa, Miguel Rio
CORR
2010
Springer
189views Education» more  CORR 2010»
14 years 10 months ago
ACRR: Ad Hoc On-Demand Distance Vector Routing with Controlled Route Requests
Reactive routing protocols like Ad-hoc On-Demand Distance Vector Routing (AODV) and Dynamic Source Routing in Ad-Hoc Wireless Networks (DSR) which are used in Mobile and Ad-hoc Ne...
Jayesh Kataria, P. S. Dhekne, Sugata Sanyal
IMC
2003
ACM
15 years 3 months ago
On the correlation between route dynamics and routing loops
Routing loops are caused by inconsistencies in the routing state of the network. Although undesirable from this aspect, they can provide insight into the routing dynamics that cau...
Ashwin Sridharan, Sue B. Moon, Christophe Diot
CONEXT
2009
ACM
14 years 11 months ago
Improving internet-wide routing protocols convergence with MRPC timers
The behavior of routing protocols during convergence is critical as it impacts end-to-end performance. Network convergence is particularly important in BGP, the current interdomai...
Anthony J. Lambert, Marc-Olivier Buob, Steve Uhlig
SIGCOMM
2006
ACM
15 years 3 months ago
Policy-based routing with non-strict preferences
Traditional studies of routing problems often assumed strict preferences on paths, by eliminating ambiguity in path comparisons, or imposing a priori deterministic tie-breaking. S...
Chi-kin Chau