• DocumentCode
    2286791
  • Title

    Using Degree-Based Strategy for Network Coding in Content Distribution Network

  • Author

    Li, Tingyi ; Wang, JinLin ; You, Jiali

  • Author_Institution
    Nat. Network New Media Eng. Res. Center, CAS, Beijing
  • fYear
    2008
  • fDate
    20-22 Dec. 2008
  • Firstpage
    487
  • Lastpage
    491
  • Abstract
    In a content distribution network based on overlay networks, the peer´s upload bandwidth is always constrained. To optimize the system performance, one problem is how to assign the upload capacity to the right neighbors for transferring data blocks. In a system using network coding technology, a strategy which is to select the right neighbors based upon the degrees of them is proposed. The selection probability of each neighbor is determined by its degree. After. this strategy is applied, the utilization of network is improved, and the distribution progress is shortened. From the simulation, we found that the performance of content distribution is obviously better than the baseline system on three metrics, including maximum finish time, average finish time and standard deviation.
  • Keywords
    channel capacity; channel coding; peer-to-peer computing; average finish time; content distribution network; data blocks; degree-based strategy; maximum finish time; network coding technology; overlay networks; peer upload bandwidth; selection probability; standard deviation; upload capacity; Bandwidth; Computer networks; Content addressable storage; Distributed computing; Mesh networks; Network coding; Network topology; Peer to peer computing; Scheduling; System performance;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer and Electrical Engineering, 2008. ICCEE 2008. International Conference on
  • Conference_Location
    Phuket
  • Print_ISBN
    978-0-7695-3504-3
  • Type

    conf

  • DOI
    10.1109/ICCEE.2008.20
  • Filename
    4741033