In recent years, the number of Peer-to-Peer (P2P) applications has increased significantly. One important problem in many P2P applications is how to efficiently disseminate data from a single source to multiple receivers on the Internet. A successful model used for analyzing this problem is a graph consisting of nodes and edges, with a capacity assigned to each edge. In some situations however, it is inconvenient to use this model. To that end, we propose to study the problem of efficient data dissemination in a source constraint network. A source constraint network is modeled as a graph in which, the capacity is associated with a node, rather than an edge. The contributions of this paper include (a) a quantitative data dissemination in any source constraint network, (b) a set of topologies suitable for data dissemination in P2P networks, and (c) an architecture and implementation of a P2P system based on the proposed optimal topologies. We will present the experimental results of our P2P system deployed on PlanetLab nodes demonstrating that our approach achieves near optimal throughput while providing scalability, low delay and bandwidth fairness among peers.
|Number of pages||15|
|Journal||IEEE Transactions on Multimedia|
|State||Published - Apr 2008|
Bibliographical noteFunding Information:
Manuscript received October 16, 2006; revised October 21, 2007. This work was supported under by the NSF under Grant Cyber Trust 0524831 and Grant CNS-0615055. The associate editor coordinating the review of this manuscript and approving it for publication was Dr. Hayder Radha.
Copyright 2008 Elsevier B.V., All rights reserved.
- Multimedia screening
- P2P networks
ASJC Scopus subject areas
- Signal Processing
- Media Technology
- Computer Science Applications
- Electrical and Electronic Engineering