Jump to content

User:Paulopennings/sandbox

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Paulopennings (talk | contribs) at 18:18, 18 November 2015. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In computing and specifically peer-to-peer file sharing, seeding is the uploading of already downloaded content for others to download from. A peer, a computer that is connected to the network, becomes a seed when having acquired the entire set of data. This data consists out of small parts so that seeds can effectively share their content with other peers, handing out the missing pieces. A peer deliberately chooses to become a seed by leaving on the upload task when content is downloaded. This means that there should be motivation to seed. The opposite of a seed is a leech (computing), a peer that downloads more than it uploads.

Background

Seeding is a practice within peer-to-peer file sharing, a content distribution model that connects computers with the use of a peer-to-peer (P2P) software program in order to share desired content. This is different from the client-server model, where content is directly distributed from its server to a client. To make peer-to-peer file sharing function effectively, content is divided into parts of 256 kilobyte (KB). This segmented downloading makes the parts that peers miss be allocated by seeds. It also makes downloads go faster, as content can be exchanged between peers. All peers (including seeds) sharing the same content are called a swarm.[1]

Advantages

Advantages.

Disadvantages

Disadvantages.

This is my first reference[2]. This is my second reference[3]. This is my third reference[4]. This is my fourth reference[5]. This is my fifth reference[6]. This is my sixth reference[7]. This is my seventh reference[8]. This is my eight reference[9].

References

  1. ^ Bera, D., Esposito, F., Matta, I., Michiardi, P. (2011). On The Impact Of Seed Scheduling In Peer-To-Peer Networks. Computer Science Department, Boston University
  2. ^ Yang, S., Jin, H., Liao, X., Yao, H., Huang, Q., Tu, X. (2009). Measuring Web Feature Impacts In Peer-To-Peer File Sharing Systems. Hushing University of Science and Technology
  3. ^ Halldorson, U., Hasslinger, G., Sigurdsson, M. (2007). Potentials And Challenges Of Peer-To-Peer Based Content Distribution. Telematics And Informatics 24
  4. ^ Bera, D., Esposito, F., Matta, I., Michiardi, P. (2011). On The Impact Of Seed Scheduling In Peer-To-Peer Networks. Computer Science Department, Boston University
  5. ^ Hajek, B., Zhu, Ji. (2011). The Missing Piece Syndrome In Peer-To-Peer Communication. Department of Electrical And Computer Engineering
  6. ^ Hlavacs, H., Wiedlich, R., Treutner, T. (2011). Energy efficient peer-to-peer file sharing. Springer Science and Business Media
  7. ^ As-Sayid-Ahmad, L., Hawa, M., Khalif, L. (2012). On Enhancing Reputation Management Using Peer-To-Peer Interaction History. Springer Science and Business Media
  8. ^ Despotovic, Z., Hossfeld, T., Kellerer, W., Lehrieder, F., Oechsner, S., Michel, M. (2011). Mitigating Unfairness In Locality-Aware Peer-To-Peer Networks. International Journal Of Network Management
  9. ^ Epema, D., Meester, L., Meulpolder, M. (2012). The Problem Of Upload Competition In Peer-To-Peer Systems With Incentive Mechanisms. Concurrency And Computation: Practice And Experience