Sciweavers

61 search results - page 6 / 13
» Stability of a localized and greedy routing algorithm
Sort
View
TPDS
2010
126views more  TPDS 2010»
13 years 2 months ago
Stabilizing Distributed R-Trees for Peer-to-Peer Content Routing
Publish/subscribe systems provide useful platforms for delivering data (events) from publishers to subscribers in a decoupled fashion. Developing efficient publish/subscribe scheme...
Silvia Bianchi, Pascal Felber, Maria Gradinariu Po...
ESA
2006
Springer
105views Algorithms» more  ESA 2006»
13 years 11 months ago
Navigating Low-Dimensional and Hierarchical Population Networks
Abstract. Social networks are navigable small worlds, in which two arbitrary people are likely connected by a short path of intermediate friends that can be found by a "decent...
Ravi Kumar, David Liben-Nowell, Andrew Tomkins
ICDCIT
2007
Springer
14 years 1 months ago
Self-stabilizing Routing Algorithms for Wireless Ad-Hoc Networks
This paper considers the problem of unicasting in wireless ad hoc networks. Unicasting is the problem of finding a route between a source and a destination and forwarding the mess...
Rohit Ashok Khot, Ravikant Poola, Kishore Kothapal...
SLS
2009
Springer
224views Algorithms» more  SLS 2009»
14 years 2 months ago
High-Performance Local Search for Solving Real-Life Inventory Routing Problems
Abstract. In this paper, a real-life routing and scheduling problem encountered is addressed. The problem, which consists in optimizing the delivery of fluids by tank trucks on a ...
Thierry Benoist, Bertrand Estellon, Fréd&ea...
ISPA
2005
Springer
14 years 1 months ago
Near Optimal Routing in a Small-World Network with Augmented Local Awareness
In order to investigate the routing aspects of small-world networks, Kleinberg [13] proposes a network model based on a d-dimensional lattice with long-range links chosen at random...
Jianyang Zeng, Wen-Jing Hsu, Jiangdian Wang