9 search results - page 1 / 2 » Neighbor Table Construction and Update in a Dynamic Peer-to-... |
ICDCS
2003
IEEE
13 years 10 months ago
2003
IEEE
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...
ISCAPDCS
2003
13 years 6 months ago
2003
The quick construction of the Shortest Path Tree (SPT) is essential to achieve fast routing speed for an interior network using link state protocols, such as OSPF and IS-IS. Whene...
AINA
2009
IEEE
13 years 12 months ago
2009
IEEE
—This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which i...
IAJIT
2007
13 years 5 months ago
2007
: Routing is an important functional aspect in wireless ad-hoc networks that handles discovering and maintaining the paths between nodes within a network. Due to nodes mobility, th...
SIGMETRICS
2004
ACM
13 years 10 months ago
2004
ACM
Measurement studies indicate a high rate of node dynamics in p2p systems. In this paper, we address the question of how high a rate of node dynamics can be supported by structured...