Distributed Barter--Based Directory Services

Authors:
David Cabanillas;Steven Willmott;Ulises Cortés
Affiliations:
Universitat Politècnica de Catalunya, Software Department, E-08034 Barcelona;Universitat Politècnica de Catalunya, Software Department, E-08034 Barcelona;Universitat Politècnica de Catalunya, Software Department, E-08034 Barcelona
Venue:
Proceedings of the 2008 conference on Artificial Intelligence Research and Development: Proceedings of the 11th International Conference of the Catalan Association for Artificial Intelligence
Year:
2008

Citing 9
Cited 0

Wide area traffic: the failure of Poisson modeling

IEEE/ACM Transactions on Networking (TON)
Using LDAP directory caches

PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
DNS performance and the effectiveness of caching

IEEE/ACM Transactions on Networking (TON)
Serving DNS Using a Peer-to-Peer Lookup Service

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
FPN: A Distributed Hash Table for Commercial Applications

HPDC '04 Proceedings of the 13th IEEE International Symposium on High Performance Distributed Computing
Autonomic Peer-to-Peer Service Directory

IEICE - Transactions on Information and Systems
Clearing algorithms for barter exchange markets: enabling nationwide kidney exchanges

Proceedings of the 8th ACM conference on Electronic commerce
Beehive: O(1)lookup performance for power-law query distributions in peer-to-peer overlays

NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Beehive: O(1)lookup performance for power-law query distributions in peer-to-peer overlays

NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

The allocation of resources amongst a set of autonomous entities with contradicting interests is a recurring and relevant theme in distributed domains. In this paper we present the design, implementation and evaluation of a distributed directory service based on a bartering mechanism in order to improve robustness in data retention. A directory service maps the names of network resources to their respective network addresses. A distributed directory service maintains this information not at a single node in a network, but across many nodes. The major challenge addressed in this paper is to build a workable system which not only responds to queries from users but A) ensures that directory items are never lost in the system and B) optimizes query response time with respect to different patterns of query arrival.