Scheduled System Maintenance:
On Wednesday, July 29th, IEEE Xplore will undergo scheduled maintenance from 7:00-9:00 AM ET (11:00-13:00 UTC). During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

Peer-to-Peer Computing, 2004. Proceedings. Proceedings. Fourth International Conference on

Date 25-27 Aug. 2004

Filter Results

Displaying Results 1 - 25 of 52
  • P2P applications using the semantic information oriented network

    Publication Year: 2004 , Page(s): 272 - 273
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (602 KB) |  | HTML iconHTML  

    This paper describes P2P applications using an advanced P2P platform called SIONet. Based on its metadata-based routing and easy communication creation capabilities, various kinds of P2P applications can be constructed. Effective discovery, P2P content delivery with digital rights management, semi-active information exchanging community, and P2P ad hoc community are constructed. These are expected... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A framework for testing distributed systems

    Publication Year: 2004 , Page(s): 262 - 263
    Cited by:  Papers (3)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (230 KB) |  | HTML iconHTML  

    Thorough testing of distributed systems, particularly peer-to-peer systems can prove difficult due to the problems inherent in deploying, controlling and monitoring many nodes simultaneously. This problem will only increase as the scale of distributed systems continues to grow. This framework implements a test bed environment using a semi-centralized peer-to-peer network as a substrate for sharing... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Percolation search in power law networks: making unstructured peer-to-peer networks scalable

    Publication Year: 2004 , Page(s): 2 - 9
    Cited by:  Papers (32)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (321 KB) |  | HTML iconHTML  

    We introduce a scalable searching protocol for locating and retrieving content in random networks with power-law (PL) and heavy-tailed degree distributions. The proposed algorithm is capable of finding any content in the network with probability one in time O(logN), with a total traffic that provably scales sub-linearly with the network size, N. Unlike other proposed solutions, there is no need to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Semantic-laden peer-to-peer service directory

    Publication Year: 2004 , Page(s): 184 - 191
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (378 KB) |  | HTML iconHTML  

    The most intuitive way to build a service directory application that allows for service entities to register or search for services on top of a structured peer-to-peer network is to build reverse indices at appropriate nodes on the network. However, this implies trust on the reliability and integrity of other nodes on the network, which may be too risky an assumption for businesses. This paper pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • P2P-4-DL: digital library over peer-to-peer

    Publication Year: 2004 , Page(s): 264 - 265
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (260 KB) |  | HTML iconHTML  

    The P2P-4-DL project aims to investigate and build a DL system that would operate over a P2P structure. Rather than storing digital objects centrally they remain the responsibility of the individual peers that provide them. This allows the system to utilise network resources more efficiently as well as providing users with a greater sense of control over the digital objects they share. Our prototy... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cache updates in a peer-to-peer network of mobile agents

    Publication Year: 2004 , Page(s): 10 - 17
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (292 KB) |  | HTML iconHTML  

    In open multi-agent systems, agents need resources provided by other agents but they are not aware of which agents provide particular resources. We consider a peer-to-peer approach, in which each agent maintains a local cache with information about k resources, that is for each of the k resources, an agent that provides it. However, when an agent or a resource moves, cache entries become obsolete.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reliable peer-to-peer end system multicasting through replication

    Publication Year: 2004 , Page(s): 235 - 242
    Cited by:  Papers (7)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (355 KB) |  | HTML iconHTML  

    A key challenge in peer-to-peer computing system is to provide decentralized and yet reliable services on top of a network of loosely coupled, weakly connected and possibly unreliable peers. This work presents an effective dynamic passive replication scheme designed to provide reliable multicast service in peer-cast, an efficient and self-configurable peer-to-peer end system multicast (ESM) system... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PKI-based security for peer-to-peer information sharing

    Publication Year: 2004 , Page(s): 45 - 52
    Cited by:  Papers (9)  |  Patents (6)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (263 KB) |  | HTML iconHTML  

    Freeflow of information is the feature that has made peer-to-peer information sharing applications popular. However, this very feature holds back the acceptance of these applications by the corporate and scientific communities. In these communities it is important to provide confidentiality and integrity of communication and to enforce access control to shared resources. We present a collection of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reputation management framework and its use as currency in large-scale peer-to-peer networks

    Publication Year: 2004 , Page(s): 124 - 132
    Cited by:  Papers (9)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (417 KB) |  | HTML iconHTML  

    We propose a reputation management framework for large-scale peer-to-peer (P2P) networks, wherein all nodes are assumed to behave selfishly. The proposed framework has several advantages. It enables a form of virtual currency, such that the reputation of nodes is a measure of their wealth. The framework is scalable and provides protection against attacks by malicious nodes. The above features are ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A robust protocol for building superpeer overlay topologies

    Publication Year: 2004 , Page(s): 202 - 209
    Cited by:  Papers (41)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (495 KB) |  | HTML iconHTML  

    The concept of superpeer has been introduced to improve the performance of popular file-sharing applications. A superpeer is a node in a P2P network that operates as a server for a set of clients, and as an equal w.r.t. other superpeers. By exploiting heterogeneity, the superpeer paradigm allows P2P networks to run more efficiently, without compromising their decentralized nature. This paper descr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The different dimensions of dynamicity

    Publication Year: 2004 , Page(s): 244 - 251
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (598 KB) |  | HTML iconHTML  

    In a peer-to-peer (P2P) network, a 'fabric' of overlay links helps peers discover and use other peers' resources. This fabric, however, is highly dynamic and constantly changing. While different measures of dynamicity have been implicitly and explicitly proposed, there is lack of deeper understanding about the various aspects of dynamicity. We systematically evaluate and quantify different dimensi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the correctness of query results in XML P2P databases

    Publication Year: 2004 , Page(s): 18 - 25
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (858 KB) |  | HTML iconHTML  

    In XML peer-to-peer (p2p) database systems, query results are usually assumed to be incomplete. Incompleteness issues derive from the unstable and open-ended nature of the network, where new nodes may connect at any time, and existing nodes may suddenly disappear. The incompleteness of input data used for query evaluation may also lead to the incorrectness of query results, which greatly affects t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Highways: proximity clustering for scalable peer-to-peer network

    Publication Year: 2004 , Page(s): 266 - 267
    Cited by:  Papers (6)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (271 KB) |  | HTML iconHTML  

    The "location-aware" construction of overlay networks requires the identification of nodes that are efficient with respect to network delay and available bandwidth. In this short paper, we propose Highways to create clusters of nodes using a novel "location-aware" method, based on a scalable and distributed network coordinate system. This helps to build overlay routing tables to achieve better pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the security of polling protocols in peer-to-peer systems

    Publication Year: 2004 , Page(s): 36 - 44
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (281 KB) |  | HTML iconHTML  

    The peer-to-peer (P2P) network model differs from the well established client-server model in that all members of the network are assigned an equal role. P2P networks are recently gaining increasing popularity. Providing security in distributed content sharing in P2P networks is an important challenge. This paper identifies security vulnerabilities in the protocols for sharing servants' reputation... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Information leak in the Chord lookup protocol

    Publication Year: 2004 , Page(s): 28 - 35
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (533 KB) |  | HTML iconHTML  

    In peer-to-peer (P2P) systems, it is often essential that connected systems (nodes) relay messages which did not originate locally, on to the greater network. As a result, an intermediate node might be able to determine a large amount of information about the system, such as the querying tendencies of other nodes. This represents an inherent security issue in P2P networks. Therefore, we ask the fo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PeerStore: better performance by relaxing in peer-to-peer backup

    Publication Year: 2004 , Page(s): 72 - 79
    Cited by:  Papers (4)  |  Patents (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (271 KB) |  | HTML iconHTML  

    Backup is cumbersome. To be effective, backups have to be made at regular intervals, forcing users to organize and store a growing collection of backup media. In this paper we propose a novel peer-to-peer backup system, PeerStore, that allows the user to store his backups on other people's computers instead. PeerStore is an adaptive, cost-effective system suitable for all types of networks ranging... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive peer-to-peer topologies

    Publication Year: 2004 , Page(s): 53 - 62
    Cited by:  Papers (11)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (334 KB) |  | HTML iconHTML  

    We present a peer-level protocol for forming adaptive, self-organizing topologies for data-sharing P2P networks. This protocol is based on the idea that a peer should directly connect to those peers from which it is most likely to download satisfactory content. We show that the resulting topologies are more efficient than standard Gnutella topologies. Furthermore, we show that these adaptive topol... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PROST: a programmable structured peer-to-peer overlay network

    Publication Year: 2004 , Page(s): 280 - 281
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (220 KB) |  | HTML iconHTML  

    We present the idea of a programmable structured P2P architecture. Our proposed system allows the key-based routing infrastructure, which is common to all structured P2P overlays, to be shared by multiple applications. Furthermore, our architecture allows the dynamic and on-demand deployment of new applications and services on top of the shared routing layer. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A placement scheme for peer-to-peer networks based on principles from geometry

    Publication Year: 2004 , Page(s): 134 - 141
    Cited by:  Papers (6)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (414 KB) |  | HTML iconHTML  

    Crucial for the performance of peer-to-peer networks based on geometric topologies is the measurement complexity and quality of the mapping function used to map a node in the network to a point in the geometric target space. In this paper we study how results from mathematics as well as data mining can be applied to this mapping problem. Using a metric space model for networks and results from mat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • P2P-based collaborative spam detection and filtering

    Publication Year: 2004 , Page(s): 176 - 183
    Cited by:  Papers (23)  |  Patents (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (289 KB) |  | HTML iconHTML  

    Spam is one of the major problems of today email systems. While many solutions have been proposed to automatically detect and filter spam, spammers are getting more and more technically sophisticated and aware of internal workings of anti-spam systems, finding ways to disguise their emails to get around the different controls that can be enforced. We propose a decentralized privacy-preserving appr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of Pastry in a heterogeneous system

    Publication Year: 2004 , Page(s): 278 - 279
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (289 KB) |  | HTML iconHTML  

    We study how Pastry performs in a heterogeneous network environment of varying size. The large traffic overhead for management traffic makes the overlay nonfunctional if it grows too large. This can be circumvented by partitioning the routing tables at the cost of increased path lengths and response times. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cooperative pull-push cycle for searching a hybrid P2P network

    Publication Year: 2004 , Page(s): 192 - 199
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (594 KB) |  | HTML iconHTML  

    Information acquisition is a great challenge in the context of a continually growing Web. Nowadays, large Web search engines are primarily designed to assist an information pull by the user. On this platform, only actual information needs are handled without assistance of long-term needs. To overcome these shortcomings we propose a cooperative system for information pull and push on a peer-to-peer... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis and application of passive peer influence on peer-to-peer inter-domain traffic

    Publication Year: 2004 , Page(s): 142 - 150
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (4843 KB) |  | HTML iconHTML  

    As a result of widespread of peer-to-peer (P2P) file sharing applications, it is a serious problem that inter-domain traffic between Internet service provider (ISP) networks increases. We present a novel inter-domain traffic flow model focusing on the presence of a passive peer, and proposes a new P2P traffic control method based on the model. This method uses a filter considering P2P flow charact... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Building adaptive peer-to-peer systems

    Publication Year: 2004 , Page(s): 268 - 269
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (199 KB) |  | HTML iconHTML  

    Most peer-to-peer systems are built upon the assumption that their running environment is homogeneous. However, for Internet-scale applications this assumption could lead to performance limitations. We propose a framework for building peer-to-peer systems which use performance monitoring techniques to adapt to changes in their environment. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • "P2P scrabble. Can P2P games commence?"

    Publication Year: 2004 , Page(s): 100 - 107
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (312 KB) |  | HTML iconHTML  

    The article considers the design of P2P games without trusted, centralized resources. The main difficulty is how to prevent the possibility of cheating. The article considers scrabble as a case study and attempts to solve issues such as maintenance of public, private, and concealed public state, as well as secret drawing from a finite set of objects. The issues of state replication are considered ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.