Sciweavers

456 search results - page 81 / 92
» On Routing in Distributed Hash Tables
Sort
View
ICN
2005
Springer
15 years 3 months ago
A Fast Path Recovery Mechanism for MPLS Networks
The major concept of the Multi-Protocol Label Switching (MPLS) network uses the Label Switch Path (LSP) technique that provides high performance in packet delivery without routing ...
Jenhui Chen, Chung-Ching Chiou, Shih-Lin Wu
CN
2004
114views more  CN 2004»
14 years 9 months ago
Representing the Internet as a succinct forest
Effective placement of resources used to support distributed services in the Internet depends on an accurate representation of Internet topology and routing. Representations of au...
Jim Gast, Paul Barford
TMC
2010
138views more  TMC 2010»
14 years 7 months ago
Reliable Anchor-Based Sensor Localization in Irregular Areas
—Localization is a fundamental problem in wireless sensor networks and its accuracy impacts the efficiency of location-aware protocols and applications, such as routing and stora...
Bin Xiao, Lin Chen, Qingjun Xiao, Minglu Li
116
Voted
P2PKM
2004
14 years 11 months ago
Merging G-Grid P2P Systems While Preserving Their Autonomy
Peer-to-Peer (P2P) systems share and manage huge amounts of data and resources distributed across a large number of machines. In pure P2P environments the control is totally decent...
Gianluca Moro, Gabriele Monti, Aris M. Ouksel
DBISP2P
2005
Springer
131views Database» more  DBISP2P 2005»
15 years 3 months ago
Symmetric Replication for Structured Peer-to-Peer Systems
Structured peer-to-peer systems rely on replication as a basic means to provide fault-tolerance in presence of high churn. Most select replicas using either multiple hash functions...
Ali Ghodsi, Luc Onana Alima, Seif Haridi