Sciweavers

482 search results - page 26 / 97
» On routing table growth
Sort
View
QOFIS
2004
Springer
14 years 1 months ago
Policy-Aware Connectionless Routing
The current Internet implements hop-by-hop packet forwarding based entirely on globally-unique identifiers specified in packet headers, and routing tables that identify destinati...
Bradley R. Smith, J. J. Garcia-Luna-Aceves
ADHOC
2006
86views more  ADHOC 2006»
13 years 7 months ago
An implementation framework for trajectory-based routing in ad hoc networks
Routing in ad-hoc networks is a complicated task because of many reasons. The nodes are low-memory, lowpowered, and they cannot maintain routing tables large enough for well-known ...
Murat Yuksel, Ritesh Pradhan, Shivkumar Kalyanaram...
SAINT
2008
IEEE
14 years 2 months ago
Analysis of a Self-Organizing Maintenance Algorithm under Constant Churn
An increasing proportion of distributed hash tables (DHTs) maintain additional routing information regarding each node’s immediately surrounding neighbors in a network overlay. ...
Richard Price, Tien Tuan Anh Dinh, Georgios K. The...
EJWCN
2010
118views more  EJWCN 2010»
13 years 2 months ago
Field Division Routing
Multi-hop communication objectives and constraints impose a set of challenging requirements that create difficult conditions for simultaneous optimization of features such as scala...
Milenko Drinic, Darko Kirovski, Lin Yuan, Gang Qu,...
P2P
2009
IEEE
114views Communications» more  P2P 2009»
14 years 2 months ago
Why Kad Lookup Fails
A Distributed Hash Table (DHT) is a structured overlay network service that provides a decentralized lookup for mapping objects to locations. In this paper, we study the lookup pe...
Hun Jeong Kang, Eric Chan-Tin, Nicholas Hopper, Yo...