Sciweavers

315 search results - page 35 / 63
» Dynamic vs. Oblivious Routing in Network Design
Sort
View
IEEEARES
2006
IEEE
15 years 7 months ago
Replication Strategies for Reliable Decentralised Storage
Distributed hash tables (DHTs) can be used as the basis of a resilient lookup service in unstable environments: local routing tables are updated to reflected changes in the netwo...
Matthew Leslie, Jim Davies, Todd Huffman
ICC
2009
IEEE
124views Communications» more  ICC 2009»
14 years 11 months ago
Routing Games for Traffic Engineering
Abstract--Current data network scenario makes Traffic Engineering (TE) a very challenging task. The ever growing access rates and new applications running on end-hosts result in mo...
Federico Larroca, Jean-Louis Rougier
ITCC
2005
IEEE
15 years 7 months ago
Customizing a Geographical Routing Protocol for Wireless Sensor Networks
— Several problems are required to be fixed in order to apply geographical routing protocol Greedy Perimeter Stateless Routing (GPSR) in wireless sensor networks. First, GPSR is...
Jian Chen, Yong Guan, Udo W. Pooch
ICDCS
2003
IEEE
15 years 6 months ago
Neighbor Table Construction and Update in a Dynamic Peer-to-Peer Network
In a system proposed by Plaxton, Rajaraman and Richa (PRR), the expected cost of accessing a replicated object was proved to be asymptotically optimal for a static set of nodes an...
Huaiyu Liu, Simon S. Lam
IPCCC
2005
IEEE
15 years 7 months ago
Dynamic localization control for mobile sensor networks
Localization is a fundamental operation in mobile and self-configuring networks such as sensor networks and mobile ad hoc networks. For example, sensor location is often critical...
Sameer Tilak, Vinay Kolar, Nael B. Abu-Ghazaleh, K...