Buy Scheduling Algorithms for Data Distribution in Peer-To-Peer Collaborative File Distribution Networks
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Home > Science, Technology & Agriculture > Energy technology and engineering > Electrical engineering > Scheduling Algorithms for Data Distribution in Peer-To-Peer Collaborative File Distribution Networks
Scheduling Algorithms for Data Distribution in Peer-To-Peer Collaborative File Distribution Networks

Scheduling Algorithms for Data Distribution in Peer-To-Peer Collaborative File Distribution Networks


     0     
5
4
3
2
1



Out of Stock


Notify me when this book is in stock
X
About the Book

This dissertation, "Scheduling Algorithms for Data Distribution in Peer-to-peer Collaborative File Distribution Networks" by Siu-kei, Jonathan, Chan, 陳兆基, was obtained from The University of Hong Kong (Pokfulam, Hong Kong) and is being sold pursuant to Creative Commons: Attribution 3.0 Hong Kong License. The content of this dissertation has not been altered in any way. We have altered the formatting in order to facilitate the ease of printing and reading of the dissertation. All rights not granted by the above license are retained by the author. Abstract: Abstract of thesis entitled Scheduling Algorithms for Data Distribution in Peer-to-Peer Collaborative File Distribution Networks submitted by CHAN Siu Kei, Jonathan for the degree of Master of Philosophy at The University of Hong Kong in October 2006 Peer-to-Peer (P2P) applications have become immensely popular among Internet users. One of the most popular applications of P2P networks is collaborative sharing of large video/audio files and software. Some examples of applications in widespread use are BitTorrent, Gnutella, Kazaa and Napster. Traditional methods for file sharing, such as the client/server approach (e.g. File Transfer Protocol, World Wide Web), are not scalable with increased network size. P2P file sharing solves this problem by allowing peers to act as servers. Interestingly, in a well-designed P2P file sharing network, performance generally improves as the number of peers participating in the file sharing session increases, as each peer can download simultaneously from multiple peers. P2P file sharing systems have attracted considerable attention in the past few years since their inception. However, the research to date has mainly focused on peer and content discovery, overlay topology formation, fairness and incentive issues. Little attention has been devoted to investigate the data distribution problem, which is also a core component of any file sharing application. In this study, we present an initial attempt at addressing this collaborative file distribution problem, and formally define the scheduling problem in simplified contexts. We develop several algorithms (Rarest Piece First, Most Demanding Node First, Bipartite Matching and Maximum Flow Algorithms) to solve the data distribution problem and study their performance. We deduce theoretical bounds on the minimum download time experienced by users and also perform simulations to evaluate our algorithms. Simulation results show that our novel graph-based Bipartite Matching or Maximum Flow Algorithms outperform other algorithms in terms of total download time required. Therefore, we believe our algorithms may be employed as the core scheduling modules in P2P file sharing applications. (Total number of words: 280) Signed ______________________ CHAN Siu Kei, Jonathan DOI: 10.5353/th_b3704588 Subjects: Peer-to-peer architecture (Computer networks) Computer scheduling Algorithms


Best Sellers


Product Details
  • ISBN-13: 9781361471036
  • Publisher: Open Dissertation Press
  • Publisher Imprint: Open Dissertation Press
  • Height: 279 mm
  • No of Pages: 120
  • Weight: 572 gr
  • ISBN-10: 1361471034
  • Publisher Date: 27 Jan 2017
  • Binding: Hardback
  • Language: English
  • Spine Width: 8 mm
  • Width: 216 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Scheduling Algorithms for Data Distribution in Peer-To-Peer Collaborative File Distribution Networks
Open Dissertation Press -
Scheduling Algorithms for Data Distribution in Peer-To-Peer Collaborative File Distribution Networks
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Scheduling Algorithms for Data Distribution in Peer-To-Peer Collaborative File Distribution Networks

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    Fresh on the Shelf


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!