Attribute-based access to distributed data over P2P networks

Divyakant Agrawal, Amr El Abbadi, Subhash Suri

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

Peer-to-peer (P2P) networks are distributed data sharing systems with no dedicated and centralized infrastructure. These systems are attractive because they deliver on the Internet's promise of true decentralization, offering scalability, availability, fault tolerance, robustness, and low barriers to entry. While P2P systems have been used so far mainly for file sharing, their true potential lies as a vast, loosely connected world wide infrastructure for sharing resources, data and information. However, many challenging research problems must be addressed and solved before this vision can materialize. This paper addresses a natural step in the evolution of P2P: going beyond simple file sharing based on exact-name based lookups to data and information sharing where data is accessed based on its attributes or properties. We have identified diverse applications such as network monitoring, astronomy data applications, event-notification systems, and Grid computing that can benefit directly from attribute-based access to distributed data over P2P systems. Based on the application requirements, we propose three new models for both data distribution and data accesses. For each of these models, we propose CAN and CHORD like structures for data storage and information retrieval. A novel aspect of our development is that one of the models identified is directly applicable for building content-based publish/subscribe systems over P2P networks.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science
EditorsS. Bhalla
Pages244-263
Number of pages20
Volume3433
Publication statusPublished - 2005
Externally publishedYes
Event4th International Workshop on Databases in Networked Information Systems, DNIS 2005 - Aizu-Wakamatsu, Japan
Duration: 28 Mar 200530 Mar 2005

Other

Other4th International Workshop on Databases in Networked Information Systems, DNIS 2005
CountryJapan
CityAizu-Wakamatsu
Period28/3/0530/3/05

Fingerprint

Peer to peer networks
Astronomy
Grid computing
Fault tolerance
Information retrieval
Scalability
Availability
Internet
Data storage equipment
Monitoring

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Cite this

Agrawal, D., El Abbadi, A., & Suri, S. (2005). Attribute-based access to distributed data over P2P networks. In S. Bhalla (Ed.), Lecture Notes in Computer Science (Vol. 3433, pp. 244-263)

Attribute-based access to distributed data over P2P networks. / Agrawal, Divyakant; El Abbadi, Amr; Suri, Subhash.

Lecture Notes in Computer Science. ed. / S. Bhalla. Vol. 3433 2005. p. 244-263.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Agrawal, D, El Abbadi, A & Suri, S 2005, Attribute-based access to distributed data over P2P networks. in S Bhalla (ed.), Lecture Notes in Computer Science. vol. 3433, pp. 244-263, 4th International Workshop on Databases in Networked Information Systems, DNIS 2005, Aizu-Wakamatsu, Japan, 28/3/05.
Agrawal D, El Abbadi A, Suri S. Attribute-based access to distributed data over P2P networks. In Bhalla S, editor, Lecture Notes in Computer Science. Vol. 3433. 2005. p. 244-263
Agrawal, Divyakant ; El Abbadi, Amr ; Suri, Subhash. / Attribute-based access to distributed data over P2P networks. Lecture Notes in Computer Science. editor / S. Bhalla. Vol. 3433 2005. pp. 244-263
@inproceedings{628ee4189544423e9f1d3d9d969962da,
title = "Attribute-based access to distributed data over P2P networks",
abstract = "Peer-to-peer (P2P) networks are distributed data sharing systems with no dedicated and centralized infrastructure. These systems are attractive because they deliver on the Internet's promise of true decentralization, offering scalability, availability, fault tolerance, robustness, and low barriers to entry. While P2P systems have been used so far mainly for file sharing, their true potential lies as a vast, loosely connected world wide infrastructure for sharing resources, data and information. However, many challenging research problems must be addressed and solved before this vision can materialize. This paper addresses a natural step in the evolution of P2P: going beyond simple file sharing based on exact-name based lookups to data and information sharing where data is accessed based on its attributes or properties. We have identified diverse applications such as network monitoring, astronomy data applications, event-notification systems, and Grid computing that can benefit directly from attribute-based access to distributed data over P2P systems. Based on the application requirements, we propose three new models for both data distribution and data accesses. For each of these models, we propose CAN and CHORD like structures for data storage and information retrieval. A novel aspect of our development is that one of the models identified is directly applicable for building content-based publish/subscribe systems over P2P networks.",
author = "Divyakant Agrawal and {El Abbadi}, Amr and Subhash Suri",
year = "2005",
language = "English",
volume = "3433",
pages = "244--263",
editor = "S. Bhalla",
booktitle = "Lecture Notes in Computer Science",

}

TY - GEN

T1 - Attribute-based access to distributed data over P2P networks

AU - Agrawal, Divyakant

AU - El Abbadi, Amr

AU - Suri, Subhash

PY - 2005

Y1 - 2005

N2 - Peer-to-peer (P2P) networks are distributed data sharing systems with no dedicated and centralized infrastructure. These systems are attractive because they deliver on the Internet's promise of true decentralization, offering scalability, availability, fault tolerance, robustness, and low barriers to entry. While P2P systems have been used so far mainly for file sharing, their true potential lies as a vast, loosely connected world wide infrastructure for sharing resources, data and information. However, many challenging research problems must be addressed and solved before this vision can materialize. This paper addresses a natural step in the evolution of P2P: going beyond simple file sharing based on exact-name based lookups to data and information sharing where data is accessed based on its attributes or properties. We have identified diverse applications such as network monitoring, astronomy data applications, event-notification systems, and Grid computing that can benefit directly from attribute-based access to distributed data over P2P systems. Based on the application requirements, we propose three new models for both data distribution and data accesses. For each of these models, we propose CAN and CHORD like structures for data storage and information retrieval. A novel aspect of our development is that one of the models identified is directly applicable for building content-based publish/subscribe systems over P2P networks.

AB - Peer-to-peer (P2P) networks are distributed data sharing systems with no dedicated and centralized infrastructure. These systems are attractive because they deliver on the Internet's promise of true decentralization, offering scalability, availability, fault tolerance, robustness, and low barriers to entry. While P2P systems have been used so far mainly for file sharing, their true potential lies as a vast, loosely connected world wide infrastructure for sharing resources, data and information. However, many challenging research problems must be addressed and solved before this vision can materialize. This paper addresses a natural step in the evolution of P2P: going beyond simple file sharing based on exact-name based lookups to data and information sharing where data is accessed based on its attributes or properties. We have identified diverse applications such as network monitoring, astronomy data applications, event-notification systems, and Grid computing that can benefit directly from attribute-based access to distributed data over P2P systems. Based on the application requirements, we propose three new models for both data distribution and data accesses. For each of these models, we propose CAN and CHORD like structures for data storage and information retrieval. A novel aspect of our development is that one of the models identified is directly applicable for building content-based publish/subscribe systems over P2P networks.

UR - http://www.scopus.com/inward/record.url?scp=24644481510&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=24644481510&partnerID=8YFLogxK

M3 - Conference contribution

VL - 3433

SP - 244

EP - 263

BT - Lecture Notes in Computer Science

A2 - Bhalla, S.

ER -