Sciweavers

177 search results - page 13 / 36
» Stackelberg Routing in Arbitrary Networks
Sort
View
INFOCOM
2007
IEEE
14 years 5 months ago
Routing, Anycast, and Multicast for Mesh and Sensor Networks
Abstract— This paper studies routing schemes and their distributed construction in limited wireless networks, such as sensor or mesh networks. We argue that the connectivity of s...
Roland Flury, Roger Wattenhofer
SSS
2007
Springer
14 years 5 months ago
Stabilization of Loop-Free Redundant Routing
Consider a network of processes that exchange messages via FIFO communication channels. Each process chooses a subset of its neighboring processes to be its successors. Furthermore...
Jorge Arturo Cobb
COCOON
2007
Springer
14 years 5 months ago
Improved Throughput Bounds for Interference-Aware Routing in Wireless Networks
We propose new algorithms and improved bounds for interference-aware routing in wireless networks. First, we prove that n arbitrarily matched source-destinations pairs with average...
Chiranjeeb Buragohain, Subhash Suri, Csaba D. T&oa...
ISAAC
2007
Springer
102views Algorithms» more  ISAAC 2007»
14 years 5 months ago
Depth of Field and Cautious-Greedy Routing in Social Networks
Social networks support efficient decentralized search: people can collectively construct short paths to a specified target in the network. Rank-based friendship—where the prob...
David Barbella, George Kachergis, David Liben-Nowe...
COMSWARE
2007
IEEE
14 years 5 months ago
Survivable Routing in WDM Weighted Networks
: In this paper, we investigate the problem of routing lightpaths on an arbitrary physical topology following a Design Protection approach, such that virtual topology remains conne...
Debasis Mandal, Satyajit Nath, Bivas Mitra