Title page for etd-0610113-174153


[Back to Results | New Search]

URN etd-0610113-174153
Author Chun-Hao Wen
Author's Email Address No Public.
Statistics This thesis had been viewed 5357 times. Download 76 times.
Department Computer Science and Engineering
Year 2012
Semester 2
Degree Ph.D.
Type of Document
Language English
Title Toward Minimizing Average Finish Time of P2P File Delivery
Date of Defense 2013-06-28
Page Count 84
Keyword
  • duplicate
  • file delivery
  • peer-to-peer
  • Min-Min algorithm
  • Abstract Peer-to-Peer (P2P) overlay networking is an important development for distributed systems and the evolution of Internet architecture. It has demonstrated its feasibility and economic potential for services involving millions of users. A fundamental challenge is to minimize average finish time, TA, of completing data delivery from a single source to multiple receivers with a constrained capacity for propagating data. When a network has n users and heterogeneous capacity, we have 2n possible deployments in the network, and the problem of finding out the best one has been proved to be NP-Complete. A great deal of research has followed to find the best deployments, thus we can minimize the empirical result of delay or finish time. Among many factors to affect TA, the critical considerations are capacity scheduling, data propagating and file locating.
    The optimal timing reference of TA remains an open problem. This dissertation proposes two method of P2P file delivery that significantly reduces TA with understanding that peers often leave the network when completing file downloading. The methods construct structured overlay networks with an improved Min-Min algorithm for scheduling, and a data segment matrix for tracking and avoiding duplicate data delivery.
    Two P2P test-beds consisting of hundreds of nodes with automatically generated queries are developed. Evaluation using these test-beds provides strong empirical evi-dences that the approaches proposed in this dissertation provide a better combination of efficiency and robustness than other common alternatives such as BT in peer-churn condition. Moreover, the results reveal that there can be a scalability wall of Amdahl's Law when increasing the number of peer in P2P overlay network. The P2P network can achieve superior performance by clustering the number of peer are in suitable size, and provide a substitute peer to replace the last peer.
    Advisory Committee
  • Chu-Sing Yang - chair
  • Jain-Shing Liu - co-chair
  • Hsiao-Kuang Wu - co-chair
  • Cheng-Fu Chou - co-chair
  • Wan-Jiun Liao - co-chair
  • Ying-Chih Lin - co-chair
  • Wei-Kuang Lai - co-chair
  • Shi-Huang Chen - co-chair
  • Chun-Hung Lin - advisor
  • Files
  • etd-0610113-174153.pdf
  • Indicate in-campus at 3 year and off-campus access at 5 year.
    Date of Submission 2013-07-10

    [Back to Results | New Search]


    Browse | Search All Available ETDs

    If you have more questions or technical problems, please contact eThesys