Sciweavers

346 search results - page 30 / 70
» Routing networks for distributed hash tables
Sort
View
P2P
2005
IEEE
189views Communications» more  P2P 2005»
14 years 1 months ago
Proximity Neighbor Selection for a DHT in Wireless Multi-Hop Networks
A mobile ad hoc network (MANET) is a multi-hop wireless network having no infrastructure. Thus, the mobile nodes have to perform basic control tasks, such as routing, and higher-l...
Curt Cramer, Thomas Fuhrmann
INFOCOM
2005
IEEE
14 years 1 months ago
FISSIONE: a scalable constant degree and low congestion DHT scheme based on Kautz graphs
Abstract— The distributed hash table (DHT) scheme has become the core component of many large-scale peer-to-peer networks. Degree, diameter, and congestion are important measures...
Dongsheng Li, Xicheng Lu, Jie Wu
OSDI
2004
ACM
14 years 7 months ago
Chain Replication for Supporting High Throughput and Availability
Chain replication is a new approach to coordinating clusters of fail-stop storage servers. The approach is intended for supporting large-scale storage services that exhibit high t...
Robbert van Renesse, Fred B. Schneider
ISPAN
2005
IEEE
14 years 1 months ago
A Hybrid Algorithm for Dynamic Lightpath Protection in Survivable WDM Optical Networks
- Dynamic lightpath protection in survivable WDM networks requires finding a pair of diverse routes (i.e., a primary route and a backup route that are link-disjoint) that form a cy...
Vinh Trong Le, Son-Hong Ngo, Xiaohong Jiang, Susum...
TPDS
1998
122views more  TPDS 1998»
13 years 7 months ago
Managing Statistical Behavior of Large Data Sets in Shared-Nothing Architectures
—Increasingly larger data sets are being stored in networked architectures. Many of the available data structures are not easily amenable to parallel realizations. Hashing scheme...
Isidore Rigoutsos, Alex Delis