Sciweavers

111 search results - page 12 / 23
» An Optimal Routing Scheme for Multiple Broadcast
Sort
View
CONEXT
2006
ACM
14 years 1 months ago
Using forgetful routing to control BGP table size
Running the Border Gateway Protocol (BGP), the Internet’s interdomain routing protocol, consumes a large amount of memory. A BGP-speaking router typically stores one or more rou...
Elliott Karpilovsky, Jennifer Rexford
ICC
2009
IEEE
101views Communications» more  ICC 2009»
14 years 2 months ago
Interference Subtraction with Supplementary Cooperation in Wireless Cooperative Networks
Abstract—In wireless networks, the broadcast nature of wireless transmission enables cooperation by sharing the same transmissions with nearby receivers and thus can help improve...
Zhengguo Sheng, Zhiguo Ding, Kin K. Leung
INFOCOM
2009
IEEE
14 years 2 months ago
Diverse Routing in Networks with Probabilistic Failures
—We develop diverse routing schemes for dealing with multiple, possibly correlated, failures. While disjoint path protection can effectively deal with isolated single link failur...
Hyang-Won Lee, Eytan Modiano
TWC
2008
113views more  TWC 2008»
13 years 7 months ago
Capacity of opportunistic routing in multi-rate and multi-hop wireless networks
Abstract-- Opportunistic routing (OR) copes with the unreliable transmissions by exploiting the broadcast nature of the wireless medium and spatial diversity of the multi-hop wirel...
Kai Zeng, Wenjing Lou, Hongqiang Zhai
SIGCOMM
1999
ACM
13 years 11 months ago
A Simple Approximation to Minimum-Delay Routing
The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is ve...
Srinivas Vutukury, J. J. Garcia-Luna-Aceves