Sciweavers

88 search results - page 9 / 18
» Hardness of Directed Routing with Congestion
Sort
View
ALGORITHMICA
2005
225views more  ALGORITHMICA 2005»
13 years 9 months ago
Better Alternatives to OSPF Routing
The current standard for intra-domain network routing, Open Shortest Path First (OSPF), suffers from a number of problems--the tunable parameters (the weights) are hard to optimiz...
Jessica H. Fong, Anna C. Gilbert, Sampath Kannan, ...
SPAA
2003
ACM
14 years 3 months ago
A practical algorithm for constructing oblivious routing schemes
In a (randomized) oblivious routing scheme the path chosen for a request between a source s and a target t is independent from the current traffic in the network. Hence, such a sc...
Marcin Bienkowski, Miroslaw Korzeniowski, Harald R...
IPPS
2008
IEEE
14 years 4 months ago
LiteLoad: Content unaware routing for localizing P2P protocols
In today’s extensive worldwide Internet traffic, some 60% of network congestion is caused by Peer to Peer sessions. Consequently ISPs are facing many challenges like: paying fo...
Shay Horovitz, Danny Dolev
SIGCOMM
2006
ACM
14 years 3 months ago
A measurement study on the impact of routing events on end-to-end internet path performance
Extensive measurement studies have shown that end-to-end Internet path performance degradation is correlated with routing dynamics. However, the root cause of the correlation betw...
Feng Wang, Zhuoqing Morley Mao, Jia Wang, Lixin Ga...
GLOBECOM
2010
IEEE
13 years 7 months ago
Correlation-Resilient Path Selection in Multi-Path Routing
Multi-path routing is effective to enhance network availability, by selecting multiple failure-independent paths for reaching one destination in the hope to survive individual pat...
Xin Zhang, Adrian Perrig