NEVRLATE: Scalable Resource Discovery

  • Authors:
  • Ajay Chander;Steven Dawson;Paptrick Lincoln;David Stringer-Calvert

  • Affiliations:
  • -;-;-;-

  • Venue:
  • CCGRID '02 Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

A scalable and expressive peer-to-peer (P2P) networkingand computing framework requires efficient resourcediscovery services.Here we propose NEVRLATE, forNetwork-Efficient Vast Resource Lookup At The Edge, anefficient organization of directories or directory mirrors,providing a scalable distributed resource discovery service.NEVRLATE organizes directory servers in an approximatetwo-dimensional grid, or a set of sets of servers, forregistration to occur in one 'horizontal' dimension, andlookup to occur in the other 'vertical' dimension.The payoff of organizing n servers into a structure like this is toachieve O(pn) message complexity for registration, andnearly constant complexity lookup.At extra cost NEVRLATEcan provide fault tolerance, high availability and security,anonymity, and privacy.The protocol described can be seenas a way to organize Gnutella supernodes, or as a performanceextension 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.