DocumentCode
2525974
Title
NEVRLATE: Scalable Resource Discovery
Author
Chander, Ajay ; Dawson, Steven ; Lincoln, Patrick ; Stringer-Calvert, David
fYear
2002
fDate
21-24 May 2002
Firstpage
382
Lastpage
382
Abstract
A scalable and expressive peer-to-peer (P2P) networking and computing framework requires efficient resource discovery services. Here we propose NEVRLATE, for Network-Efficient Vast Resource Lookup At The Edge, an efficient organization of directories or directory mirrors, providing a scalable distributed resource discovery service. NEVRLATE organizes directory servers in an approximate two-dimensional grid, or a set of sets of servers, for registration to occur in one ´horizontal´ dimension, and lookup to occur in the other ´vertical´ dimension. The payoff of organizing n servers into a structure like this is to achieve O(pn) message complexity for registration, and nearly constant complexity lookup. At extra cost NEVRLATE can provide fault tolerance, high availability and security, anonymity, and privacy. The protocol described can be seen as a way to organize Gnutella supernodes, or as a performance extension of Freenet´s architecture. In addition, it supports expressive lookup mechanisms, and may provide a basis for a truly scalable worldwide infrastructure for the semantic and the extended web.
Keywords
Availability; Computer networks; Costs; Fault tolerance; Mirrors; Network servers; Organizing; Peer to peer computing; Privacy; Protocols;
fLanguage
English
Publisher
ieee
Conference_Titel
Cluster Computing and the Grid, 2002. 2nd IEEE/ACM International Symposium on
Print_ISBN
0-7695-1582-7
Type
conf
DOI
10.1109/CCGRID.2002.1017165
Filename
1540493
Link To Document