Sciweavers

482 search results - page 83 / 97
» On routing table growth
Sort
View
P2P
2009
IEEE
167views Communications» more  P2P 2009»
14 years 2 months ago
ID Repetition in Kad
ID uniqueness is essential in DHT-based systems as peer lookup and resource searching rely on IDmatching. Many previous works and measurements on Kad do not take into account that...
Jie Yu, Chengfang Fang, Jia Xu, Ee-Chien Chang, Zh...
ICIW
2008
IEEE
14 years 2 months ago
NAT Traversal for Pure P2P e-Learning System
Abstract—In this paper, we present Network Address Translator (NAT) traversal technique suitable for pure P2P applications, such as a distributed asynchronous Web-Based Training ...
Kazuo Kuramochi, Takao Kawamura, Kazunori Sugahara
PIMRC
2008
IEEE
14 years 2 months ago
A Distributed IP Mobility Approach for 3G SAE
—Future generations of mobile operator networks, based on an all-IP-based flat architecture and a multitude of different access technologies, require a proper IP-based mobility ...
Mathias Fischer, Frank-Uwe Andersen, Andreas K&oum...
INFOCOM
2007
IEEE
14 years 2 months ago
Stochastic Analysis and Improvement of the Reliability of DHT-Based Multicast
Abstract— This paper investigates the reliability of applicationlevel multicast based on a distributed hash table (DHT) in a highly dynamic network. Using a node residual lifetim...
Guang Tan, Stephen A. Jarvis
CLUSTER
2006
IEEE
14 years 1 months ago
A Simple Synchronous Distributed-Memory Algorithm for the HPCC RandomAccess Benchmark
The RandomAccess benchmark as defined by the High Performance Computing Challenge (HPCC) tests the speed at which a machine can update the elements of a table spread across globa...
Steven J. Plimpton, Ron Brightwell, Courtenay Vaug...