1st International ICST Conference on Multimedia Services Access Networks

Research Article

Efficient P2P data dissemination in a homogeneous capacity network using structured mesh

  • @INPROCEEDINGS{10.1109/MSAN.2005.1489946,
        author={Thinh  Nguyen and Duc  Tran and Sen-ching  Cheung},
        title={Efficient P2P data dissemination in a homogeneous capacity network using structured mesh},
        proceedings={1st International ICST Conference on Multimedia Services Access Networks},
        publisher={IEEE},
        proceedings_a={MSAN},
        year={2005},
        month={8},
        keywords={},
        doi={10.1109/MSAN.2005.1489946}
    }
    
  • Thinh Nguyen
    Duc Tran
    Sen-ching Cheung
    Year: 2005
    Efficient P2P data dissemination in a homogeneous capacity network using structured mesh
    MSAN
    IEEE
    DOI: 10.1109/MSAN.2005.1489946
Thinh Nguyen1,*, Duc Tran2,*, Sen-ching Cheung3,*
  • 1: Oregon State University, EECS Department, Corvallis, OR 97330
  • 2: University of Dayton, Computer Science Department, Dayton, OH 45469
  • 3: University of Kentucky, EECS Department, Lexington, KY 40506
*Contact email: thinhq@eecs.oregonstate.edu, duc.tran@notes.udayton.edu, cheung@engr.uky.edu

Abstract

Efficient data dissemination from a single source node to multiple receiving nodes on the Internet is crucial for many applications such as P2P streaming. Existing data dissemination schemes are typically accomplished using the overlay multicast trees. These overlay multicast trees, however, do not achieve the full bandwidth capacity since the leaf nodes do not contribute their bandwidth to the system. On the other hand, all the nodes in a properly constructed topology can contribute their bandwidth, resulting in high overall system throughput. In this paper, we define the notion of throughput efficiency to measure the performance of different data dissemination schemes from a single source node to multiple destination nodes. Using the proposed throughput efficiency, we propose an algorithm for constructing an overlay structured forest that enables high-bandwidth data dissemination in a network with roughly homogeneous capacity. The proposed structured forest and the associated data dissemination algorithm are designed to achieve the following: (1) end-to-end delay from the source node to any node is small (O((logN)2)), (2) the out-degree of any node is small (O(C)), and (3) bandwidth usages of all the nodes are optimal.