This is the user sandbox of Paulopennings. A user sandbox is a subpage of the user's user page. It serves as a testing spot and page development space for the user and is not an encyclopedia article. Create or edit your own sandbox here.

Other sandboxes: Main sandbox | Template sandbox

Finished writing a draft article? Are you ready to request review of it by an experienced editor for possible inclusion in Wikipedia? Submit your draft for review!

Seeding (computing)

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 it tries to download. 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 the upload task active when content is downloaded. This means that there should be motivation to seed. The opposite of a seed is a leech, a peer that downloads more than he or she 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. An example of such a peer-to-peer software program is BitTorrent. Peer-to-peer file sharing 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]

Data shared via peer-to-peer file sharing contains shared file content, computing cycles and disk storage, among other resources.^[2]

Motivations

In peer-to-peer file sharing, the strength of a swarm depends on user behaviour, as peers ideally upload more than they download. This is done by seeding, and there are different motivations to do this. There are two popular motivations to seed, of which one is the reputation-based incentive mechanism and the other is the tit for tat mechanism. As the name reveals, the former is based on the reputation of a peer, meaning that those peers who have a good reputation will get a better treatment from the uploader.^[2] The tit for tat mechanism prevents peers from downloading content if they do not upload to the peers they download from. The latter forces a peer to upload.^[3]

Though it only is a social norm to seed, some scholars see the practice of uploading parts of the data bulk to others as a duty, claiming that “downloaders are forced to reward uploads in order to compensate for their resource consumption and encourage further altruistic behaviour.”^[2] Other scholars are milder and believe that a group of highly motivated seeders could already provide a notion of fairness by scheduling when to seed, uploading more effectively.^[1]

Threats

Leechers, peers that download more than they upload, are a threat to peer-to-peer file sharing and the practice of seeding. Where the goal of seeding is to upload more than to download, thus contributing to the sharing of content, leechers stop uploading as soon as their download is finished. What this means is that seeders must upload more parts of the data bulk in order to guarantee a healthy download. Leeching is also referred to as free-riding, temporal downloading users that, by not seeding, do not support the distribution of content.

Although leeching is a threat to peer-to-peer sharing and an opposite of seeding, it is not regarded as an immediate problem. With downloads rising, upload is still guaranteed, though few contributors in the system account for most services.^[4]

Opportunities

Research sees opportunities for seeding as a practice that caters contribution within peer-to-peer file sharing and the distribution of content in the digital world in general. A term for this is economic traffic management (ETM), which is concerned with traffic management solutions to involve all peers, both seeder and leecher. It is ETM’s goal to unite peers that have different objectives and to make the sharing of content with peer-to-peer file sharing more efficient. Locality awareness is raised as the most promising concepts by scholars. This entails stimulating peers to seed downloads in their neighbourhood, which speeds up the upload speed and saves inter-domain traffic over the Internet.^[5]

  Other opportunities that have arisen out of research are to schedule seeding^[6] and use models that reduce the power consumption of seeding computers.^[7]

Legal issues

Peer-to-peer file sharing and, with that, seeding, is known as a platform for illegal content. With the sharing being done between peers all over the world, there is no supervision. Control over illegal or manipulated content is therefore difficult. Seeding is a part of this and a peer can therefore be involved in helping other peers downloading illegal content.^[8]

On the other hand there are also examples of mainstream applications that use peer-to-peer file sharing. Skype is such an example but so are a lot of real-time communication systems.

References

^ ^a ^b 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
^ ^a ^b ^c As-Sayid-Ahmad, L., Hawa, M., Khalif, L. (2012). On Enhancing Reputation Management Using Peer-To-Peer Interaction History. Springer Science and Business Media
^ Hajek, B., Zhu, Ji. (2011). The Missing Piece Syndrome In Peer-To-Peer Communication. Department of Electrical And Computer Engineering
^ 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
^ 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
^ 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
^ Hlavacs, H., Wiedlich, R., Treutner, T. (2011). Energy efficient peer-to-peer file sharing. Springer Science and Business Media
^ Halldorson, U., Hasslinger, G., Sigurdsson, M. (2007). Potentials And Challenges Of Peer-To-Peer Based Content Distribution. Telematics And Informatics 24

[bera-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

[ahmad-2] As-Sayid-Ahmad, L., Hawa, M., Khalif, L. (2012). On Enhancing Reputation Management Using Peer-To-Peer Interaction History. Springer Science and Business Media

[3] Hajek, B., Zhu, Ji. (2011). The Missing Piece Syndrome In Peer-To-Peer Communication. Department of Electrical And Computer Engineering

[4] 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

[5] 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

[6] 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

[7] Hlavacs, H., Wiedlich, R., Treutner, T. (2011). Energy efficient peer-to-peer file sharing. Springer Science and Business Media

[8] Halldorson, U., Hasslinger, G., Sigurdsson, M. (2007). Potentials And Challenges Of Peer-To-Peer Based Content Distribution. Telematics And Informatics 24

[1]

[2]

[3]

[4]

[5]

[6]

[7]

[8]

User:Paulopennings/sandbox