Substrate Support for Peer-To-Peer Applications

Total Page:16

File Type:pdf, Size:1020Kb

Substrate Support for Peer-To-Peer Applications SUBSTRATE SUPPORT FOR PEER-TO-PEER APPLICATIONS A Dissertation Presented to the Faculty of the Graduate School of Cornell University in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy by Vivek Vishnumurthy January 2009 c 2009 Vivek Vishnumurthy ALL RIGHTS RESERVED SUBSTRATE SUPPORT FOR PEER-TO-PEER APPLICATIONS Vivek Vishnumurthy, Ph.D. Cornell University 2009 Peer-to-peer (P2P) applications in general, and unstructured applications in particular, have been very popular in the recent past. In this thesis, we identify common problems encountered in the course of developing different diverse peer-to-peer applications, and propose solutions to them. The broad problems we study are, namely, (i) load-balancing in heterogeneous unstructured P2P net- works, where capacities to support load differ among the different members of the network, and application load is to be distributed in accordance with mem- bers’ capacities to support it, and (ii) “extreme” nearest neighbor discovery in P2P networks, where the intent is to discover the latency-wise nearest peer in a P2P network, even when the nearest peer is in the same extended LAN or cam- pus network. The goal of this thesis is to come up with a powerful set of basic mechanisms that the developers of many different P2P applications can reuse, rather than having to repeatedly reinvent the same solutions. We examine two main causes of load in unstructured networks: the under- lying random graph, and the process of random node selection, where ran- dom peers are periodically picked to handle application load. We extensively evaluate different approaches to do heterogeneous random graph construction and peer selection, and identify our Swaplinks algorithm as the best approach. Swaplinks builds robust graphs where node degrees are close to their desired degrees, provides a good base to perform random peer selection, and is virtu- ally free of tuning knobs, making it very practical to deploy. In our study of the extreme-nearest neighbor discovery problem, we identify and demonstrate a condition we call the clustering condition caused by the Inter- net last-hop architecture – under the clustering condition, many different peers are located at about the same latency from one another, making it expensive for previous nearest-peer solutions to correctly find the nearest peer. We pro- pose different solutions to overcome this problem, and show, using preliminary evaluations, that one of them is very attractive. BIOGRAPHICAL SKETCH Vivek was born in the city of Shimoga in Karnataka state in India, and was brought up in Bangalore, Karnataka, India. He got his Bachelor of Technology (B.Tech.) degree from the Indian Institute of Technology at Madras (IIT-Madras) in 2002. He has been in Cornell University from August 2002 to August 2008. He received an M.S. degree from Cornell in 2007 and is expecting the Ph.D. degree to be conferred in January 2009. He will be joining MokaFive, a start-up based on desktop virtualization, as a Software Engineer in September 2008. iii ACKNOWLEDGEMENTS Firstly, I would like to convey my gratitude to my advisor Paul Francis for his guidance throughout my Ph.D. research. His insistence on simplicity and prac- ticality in the course of research is something I hope to retain over my future career. I would also like to thank my committee members Jon Kleinberg and David Shmoys, and Emin G ¨un Sirer, Robbert van Renesse, and Eva Tardos for their help and comments at various points of my research. I am grateful to Sergio Gelato, Daniel Kartch, Steve Holland, Aleksey Nogin, Andrew Myers, and Nate Nystrom for developing the Latex template this thesis is based on. Many thanks to the people who laid out the plans of beautiful Cornell Uni- versity and Ithaca – towards the end of my PhD I was even enjoying the cold winters here! I have been lucky to have friendly and helpful officemates throughout my PhD. Heartfelt thanks to Ashwin, Oren, Liviu, Parvati, and Panda. Many thanks to Saikat, Hitesh, Bernard, Dan, Alan, Oliver, Jed, and Kevin in the Systems Lab for all the fun technical discussions and non-technical interac- tions over the years. I have been extremely fortunate to have an awesome and caring set of friends – thanks to Animashree, Ashwin, Lavanya, Mahesh, Muthu, Pappu, Parvathi- nathan, Parvati, Prakash Linga, Smita, Surabhi, and Vidhyashankar, without whom my stay in Cornell and Ithaca would have been far less enjoyable. Also, thanks to Lavanya, Ashwin, and Parvati for making sure (to the extent possible!) that I was actually working on my thesis when I was supposed to! Finally, I will forever be indebted to my parents and my sister for having instilled into me the value of education and hard work, for their constant and iv unwavering support, and for always encouraging me to strive for the best. v TABLE OF CONTENTS BiographicalSketch.............................. iii Acknowledgements.............................. iv TableofContents ............................... vi ListofTables.................................. viii ListofFigures ................................. ix 1 Introduction 1 1.1 Contributionsofthisthesis . 2 1.2 Bibliography............................... 6 2 Related Work 7 2.1 Load-balancing in Unstructured P2P Networks . .. 7 2.1.1 Unstructured Graph Construction . 7 2.1.2 RandomPeerSelection. 10 2.2 Heterogeneous Peer Selection Using Structured Approaches ... 13 2.3 Findingthenearestpeer . 16 3 Heterogeneous Overlay Construction and Random Node Selection in Unstructured P2P Networks 22 3.1 Introduction ............................... 22 3.2 InitialNodeDiscovery . 26 3.3 Algorithms for graph construction . 27 3.3.1 SelfLoops(SL).......................... 32 3.3.2 TheInverse-Probabilitywalks . 34 3.3.3 IterativeScaling(IS) . 35 3.3.4 SomeIssueswithBiasedWalkApproaches . 36 3.3.5 Swaplinks(SW)......................... 38 3.4 SelectionWalks ............................. 41 3.5 Distributed Outdegree Computation . 43 3.6 ExperimentalResults . 45 3.6.1 Graph Construction (Homogeneous Case) . 49 3.6.2 GraphConstructionUnderHeterogeneity . 51 3.6.3 Quality of Random Selection on Homogeneous Graphs . 54 3.6.4 SelectionwithHeterogeneity . 58 3.6.5 ScalingtoLargerSizes . 59 3.6.6 TheCursorApproach . 61 3.7 ConclusionsandDiscussion . 62 3.8 Acknowledgements........................... 63 vi 4 Comparison of Structured and Unstructured Approaches to Heteroge- neous Peer Selection 64 4.1 Introduction ............................... 64 4.2 SwaplinksImplementation . 66 4.3 AdaptingtheBambooDHTtoHeterogeneity . 68 4.3.1 TheBambooDistributedHashTable . 68 4.3.2 KRB ............................... 69 4.4 PerformanceEvaluation . 73 4.4.1 Evaluation under representative churn scenarios . ... 74 4.4.2 Extremechurn ......................... 86 4.4.3 EvaluationoverPlanetLab. 90 4.4.4 Smart-Pinging.......................... 92 4.5 ConclusionsandDiscussion . 94 4.6 Acknowledgments ........................... 96 5 FindingthenearestpeerinP2Pnetworks 97 5.1 Introduction ............................... 97 5.2 TheLast-HopClusteringEffectintheInternet . 100 5.2.1 TheClusteringCondition . 104 5.2.2 Common Assumptions Behind Nearest-Peer Algorithms . 105 5.2.3 Behavior of Sample Nearest-Peer Algorithms Under the ClusteringCondition. 107 5.3 ClusteringConditionintheInternet . 109 5.3.1 LatencyMeasurementResultsoverDNSservers . 110 5.3.2 MeasurementoverAzureusClientIPAddresses . 116 5.4 Meridian Simulations under the Clustering Condition . ..... 120 5.5 MechanismstoHandleClusteringEffect. 125 5.6 ConclusionsandFutureWork . 132 5.7 Acknowledgments ........................... 133 6 Summary,ConclusionsandFutureWork 134 6.1 Limitations, Future Enhancements, and Open Problems . 136 6.2 OffshootsfromThesisResearch . 137 Bibliography 140 vii LIST OF TABLES 3.1 Summary of the different walk strategies for a walk at node A; A node N is a neighbor of A, and wN is the probability that a walk at A is forwarded to N. virt − deg denotesthevirtual degree. 34 3.2 Homogeneous graph construction: Degree distribution, diameter, and build-loads of the different mechanisms. All graphs except Scamp have exactly 5 outlinks per node, and use 10-hop build walks. Diam and Dist are the average estimated diameter and the average inter- node distance, estimated using a sample set of 20 nodes. Dev(Deg) is the standard deviation of degrees, Indeg-95pc is the average 95th per- centile value, and MaxIndeg is the average maximum value of the in- degree. BLoad-Add and BLoad-Kill are the loads caused due to node addition and node deletion, resp. (*)Scamp’s Indeg-95pc and MaxIn- deg values correspond to the total degree, since its outdegree is not a constant. ................................. 48 3.3 Graphparametersfor50,000nodechurnedgraphs. .. 60 4.1 Swaplinks results for moderate and extreme capacity distribu- tionsunderhighandlowchurn. 79 4.2 Modification of various timeout parameters according to churn settings. “Original” denotes the values in the original Bamboo code distribution. The first four parameters determine the fre- quency of pings and exchanges of neighbor-sets between differ- ent nodes. †discard nbr timeout denotes the time between when a Bamboo node suspects a neighbor to be down (due to failure of message delivery) and when it actually decides it’s down (due to lack of response to subsequent pings). ‡KRB-period is the period between successive KRB load messages sent to random locations inthenetwork. ............................. 81 4.3 KRB results for moderate and extreme capacity
Recommended publications
  • Looking up Data in P2p Systems
    LOOKING UP DATA IN P2P SYSTEMS Hari Balakrishnan, M. Frans Kaashoek, David Karger, Robert Morris, Ion Stoica∗ MIT Laboratory for Computer Science 1. Introduction a good example of how the challenges of designing P2P systems The recent success of some widely deployed peer-to-peer (P2P) can be addressed. file sharing applications has sparked new research in this area. We The recent algorithms developed by several research groups for are interested in the P2P systems that have no centralized control the lookup problem present a simple and general interface, a dis- or hierarchical organization, where the software running at each tributed hash table (DHT). Data items are inserted in a DHT and node is equivalent in functionality. Because these completely de- found by specifying a unique key for that data. To implement a centralized systems have the potential to significantly change the DHT, the underlying algorithm must be able to determine which way large-scale distributed systems are built in the future, it seems node is responsible for storing the data associated with any given timely to review some of this recent research. key. To solve this problem, each node maintains information (e.g., The main challenge in P2P computing is to design and imple- the IP address) of a small number of other nodes (“neighbors”) in ment a robust distributed system composed of inexpensive com- the system, forming an overlay network and routing messages in puters in unrelated administrative domains. The participants in a the overlay to store and retrieve keys. typical P2P system might be home computers with cable modem One might believe from recent news items that P2P systems are or DSL links to the Internet, as well as computers in enterprises.
    [Show full text]
  • Conducting and Optimizing Eclipse Attacks in the Kad Peer-To-Peer Network
    Conducting and Optimizing Eclipse Attacks in the Kad Peer-to-Peer Network Michael Kohnen, Mike Leske, and Erwin P. Rathgeb University of Duisburg-Essen, Institute for Experimental Mathematics, Ellernstr. 29, 45326 Essen [email protected], [email protected], [email protected] Abstract. The Kad network is a structured P2P network used for file sharing. Research has proved that Sybil and Eclipse attacks have been possible in it until recently. However, the past attacks are prohibited by newly implemented secu- rity measures in the client applications. We present a new attack concept which overcomes the countermeasures and prove its practicability. Furthermore, we analyze the efficiency of our concept and identify the minimally required re- sources. Keywords: P2P security, Sybil attack, Eclipse attack, Kad. 1 Introduction and Related Work P2P networks form an overlay on top of the internet infrastructure. Nodes in a P2P network interact directly with each other, i.e., no central entity is required (at least in case of structured P2P networks). P2P networks have become increasingly popular mainly because file sharing networks use P2P technology. Several studies have shown that P2P traffic is responsible for a large share of the total internet traffic [1, 2]. While file sharing probably accounts for the largest part of the P2P traffic share, also other P2P applications exist which are widely used, e.g., Skype [3] for VoIP or Joost [4] for IPTV. The P2P paradigm is becoming more and more accepted also for professional and commercial applications (e.g., Microsoft Groove [5]), and therefore, P2P technology is one of the key components of the next generation internet.
    [Show full text]
  • Diapositiva 1
    TRANSFERENCIA O DISTRIBUCIÓN DE ARCHIVOS ENTRE IGUALES (peer-to-peer) Características, Protocolos, Software, Luis Villalta Márquez Configuración Peer-to-peer Una red peer-to-peer, red de pares, red entre iguales, red entre pares o red punto a punto (P2P, por sus siglas en inglés) es una red de computadoras en la que todos o algunos aspectos funcionan sin clientes ni servidores fijos, sino una serie de nodos que se comportan como iguales entre sí. Es decir, actúan simultáneamente como clientes y servidores respecto a los demás nodos de la red. Las redes P2P permiten el intercambio directo de información, en cualquier formato, entre los ordenadores interconectados. Peer-to-peer Normalmente este tipo de redes se implementan como redes superpuestas construidas en la capa de aplicación de redes públicas como Internet. El hecho de que sirvan para compartir e intercambiar información de forma directa entre dos o más usuarios ha propiciado que parte de los usuarios lo utilicen para intercambiar archivos cuyo contenido está sujeto a las leyes de copyright, lo que ha generado una gran polémica entre defensores y detractores de estos sistemas. Las redes peer-to-peer aprovechan, administran y optimizan el uso del ancho de banda de los demás usuarios de la red por medio de la conectividad entre los mismos, y obtienen así más rendimiento en las conexiones y transferencias que con algunos métodos centralizados convencionales, donde una cantidad relativamente pequeña de servidores provee el total del ancho de banda y recursos compartidos para un servicio o aplicación. Peer-to-peer Dichas redes son útiles para diversos propósitos.
    [Show full text]
  • Forever Remembered
    July 2015 Vol. 2 No. 7 National Aeronautics and Space Administration KENNEDY SPACE CENTER’S magazine FOREVER REMEMBERED Earth Solar Aeronautics Mars Technology Right ISS System & Research Now Beyond NASA’S National Aeronautics and Space Administration LAUNCH KENNEDY SPACE CENTER’S SCHEDULE SPACEPORT MAGAZINE Date: July 3, 12:55 a.m. EDT Mission: Progress 60P Cargo Craft CONTENTS Description: In early July, the Progress 60P resupply vehicle — 4 �������������������Solemn shuttle exhibit shares enduring lessons an automated, unpiloted version of the Soyuz spacecraft that is used to ����������������Flyby will provide best ever view of Pluto 10 bring supplies and fuel — launches 14 ����������������New Horizons spacecraft hones in on Pluto to the International Space Station. http://go.nasa.gov/1HUAYbO 24 ����������������Firing Room 4 used for RESOLVE mission simulation Date: July 22, 5:02 p.m. EDT 28 ����������������SpaceX, NASA will rebound from CRS-7 loss Mission: Expedition 44 Launch to 29 ����������������Backup docking adapter to replace lost IDA-1 the ISS Description: In late July, Kjell SHUN FUJIMURA 31 ����������������Thermal Protection System Facility keeping up Lindgren of NASA, Kimiya Yui of JAXA and Oleg Kononenko of am an education specialist in the Education Projects and 35 ����������������New crew access tower takes shape at Cape Roscosmos launch aboard a Soyuz I Youth Engagement Office. I work to inspire students to pursue science, technology, engineering, mathematics, or 36 ����������������Innovative thinking converts repair site into garden spacecraft from the Baikonur Cosmodrome, Kazakhstan to the STEM, careers and with teachers to better integrate STEM 38 ����������������Proposals in for new class of launch services space station.
    [Show full text]
  • Hartkad: a Hard Real-Time Kademlia Approach
    HaRTKad: A Hard Real-Time Kademlia Approach Jan Skodzik, Peter Danielis, Vlado Altmann, Dirk Timmermann University of Rostock Institute of Applied Microelectronics and Computer Engineering 18051 Rostock, Germany, Tel./Fax: +49 381 498-7284 / -1187251 Email: [email protected] Abstract—The Internet of Things is becoming more and time behavior. Additionally, many solutions leak flexibility and more relevant in industrial environments. As the industry itself need a dedicated instance for administrative tasks. These issues has different requirements like (hard) real-time behavior for will becomes more relevant in the future. As mentioned in many scenarios, different solutions are needed to fulfill future challenges. Common Industrial Ethernet solution often leak [3], the future for the industry will be more intelligent devices, scalability, flexibility, and robustness. Most realizations also which can act more dynamically. Facilities as one main area require special hardware to guarantee a hard real-time behavior. of application will consist of more devices still requiring real- Therefore, an approach is presented to realize a hard real- time or even hard real-time behavior. So we think, the existing time network for automation scenarios using Peer-to-Peer (P2P) solutions will not fulfill the future challenges in terms of technology. Kad as implementation variant of the structured decentralized P2P protocol Kademlia has been chosen as base scalability, flexibility, and robustness. for the realization. As Kad is not suitable for hard real-time Peer-to-Peer (P2P) networks instead offer an innovative applications per se, changes of the protocol are necessary. Thus, alternative to the typical Client-Server or Master-Slave concepts Kad is extended by a TDMA-based mechanism.
    [Show full text]
  • P2P Protocols
    CHAPTER 1 P2P Protocols Introduction This chapter lists the P2P protocols currently supported by Cisco SCA BB. For each protocol, the following information is provided: • Clients of this protocol that are supported, including the specific version supported. • Default TCP ports for these P2P protocols. Traffic on these ports would be classified to the specific protocol as a default, in case this traffic was not classified based on any of the protocol signatures. • Comments; these mostly relate to the differences between various Cisco SCA BB releases in the level of support for the P2P protocol for specified clients. Table 1-1 P2P Protocols Protocol Name Validated Clients TCP Ports Comments Acestream Acestream PC v2.1 — Supported PC v2.1 as of Protocol Pack #39. Supported PC v3.0 as of Protocol Pack #44. Amazon Appstore Android v12.0000.803.0C_642000010 — Supported as of Protocol Pack #44. Angle Media — None Supported as of Protocol Pack #13. AntsP2P Beta 1.5.6 b 0.9.3 with PP#05 — — Aptoide Android v7.0.6 None Supported as of Protocol Pack #52. BaiBao BaiBao v1.3.1 None — Baidu Baidu PC [Web Browser], Android None Supported as of Protocol Pack #44. v6.1.0 Baidu Movie Baidu Movie 2000 None Supported as of Protocol Pack #08. BBBroadcast BBBroadcast 1.2 None Supported as of Protocol Pack #12. Cisco Service Control Application for Broadband Protocol Reference Guide 1-1 Chapter 1 P2P Protocols Introduction Table 1-1 P2P Protocols (continued) Protocol Name Validated Clients TCP Ports Comments BitTorrent BitTorrent v4.0.1 6881-6889, 6969 Supported Bittorrent Sync as of PP#38 Android v-1.1.37, iOS v-1.1.118 ans PC exeem v0.23 v-1.1.27.
    [Show full text]
  • Smart Regulation in the Age of Disruptive Technologies
    SMART REGULATION IN THE AGE OF DISRUPTIVE TECHNOLOGIES Andrea Renda CEPS, Duke, College of Europe 13 March 2018 A New Wave of Regulatory Governance? • First wave: structural reforms (1970s-1980s) • Privatizations, liberalizations • Second wave: regulatory reform (1980s-1990s) • Ex ante filters + “Less is more” • Third wave: regulatory governance/management (2000s) • Policy cycle concept + importance of oversight • Better is more? Alternatives to regulation, nudges, etc. • Fourth wave: coping with disruptive technologies? (2010s) Competition Collusion Access Discrimination Digital Technology as “enabler” Jobs Unemployment Enforcement Infringement Key emerging challenges • From national/EU to global governance • From ex post to ex ante/continuous market monitoring (a new approach to the regulatory governance cycle) • Need for new forms of structured scientific input (a new approach to the innovation principle, and to innovation deals) • From regulation “of” technology to regulation “by” technology • A whole new set of alternative policy options • Away from neoclassical economic analysis, towards multi-criteria analysis and enhance risk assessment/management/evaluation Alternative options & Problem definition Regulatory cycle Impact Analysis Risk assessment, Risk management Evaluation dose-response Emerging, disruptive Policy strategy and Learning technology experimentation • Scientific input and forecast • Mission-oriented options • Ongoing evaluation • Mission-led assessment • Pilots, sprints, sandboxes, tech- • Pathway updates • Long-term
    [Show full text]
  • Research Article a P2P Framework for Developing Bioinformatics Applications in Dynamic Cloud Environments
    Hindawi Publishing Corporation International Journal of Genomics Volume 2013, Article ID 361327, 9 pages http://dx.doi.org/10.1155/2013/361327 Research Article A P2P Framework for Developing Bioinformatics Applications in Dynamic Cloud Environments Chun-Hung Richard Lin,1 Chun-Hao Wen,1,2 Ying-Chih Lin,3 Kuang-Yuan Tung,1 Rung-Wei Lin,1 and Chun-Yuan Lin4 1 Department of Computer Science and Engineering, National Sun Yat-sen University, No. 70 Lien-hai Road, Kaohsiung City 80424, Taiwan 2 Department of Information Technology, Meiho University, No. 23 Pingkuang Road, Neipu, Pingtung 91202, Taiwan 3 Department of Applied Mathematics, Feng Chia University, No. 100 Wenhwa Road, Seatwen, Taichung City 40724, Taiwan 4 Department of Computer Science and Information Engineering, Chang Gung University, No. 259 Sanmin Road, Guishan Township, Taoyuan 33302, Taiwan Correspondence should be addressed to Ying-Chih Lin; [email protected] Received 22 January 2013; Revised 5 April 2013; Accepted 20 April 2013 Academic Editor: Che-Lun Hung Copyright © 2013 Chun-Hung Richard Lin et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Bioinformatics is advanced from in-house computing infrastructure to cloud computing for tackling the vast quantity of biological data. This advance enables large number of collaborative researches to share their works around the world. In view of that, retrieving biological data over the internet becomes more and more difficult because of the explosive growth and frequent changes. Various efforts have been made to address the problems of data discovery and delivery in the cloud framework, but most of them suffer the hindrance by a MapReduce master server to track all available data.
    [Show full text]
  • I2P, the Invisible Internet Projekt
    I2P, The Invisible Internet Projekt jem September 20, 2016 at Chaostreff Bern Content 1 Introduction About Me About I2P Technical Overview I2P Terminology Tunnels NetDB Addressbook Encryption Garlic Routing Network Stack Using I2P Services Using I2P with any Application Tips and Tricks (and Links) Conclusion jem | I2P, The Invisible Internet Projekt | September 20, 2016 at Chaostreff Bern Introduction About Me 2 I Just finished BSc Informatik at BFH I Bachelor Thesis: "Analysis of the I2P Network" I Focused on information gathering inside and evaluation of possible attacks against I2P I Presumes basic knowledge about I2P I Contact: [email protected] (XMPP) or [email protected] (GPG 0x28562678) jem | I2P, The Invisible Internet Projekt | September 20, 2016 at Chaostreff Bern Introduction About I2P: I2P = TOR? 3 Similar to TOR... I Goal: provide anonymous communication over the Internet I Traffic routed across multiple peers I Layered Encryption I Provides Proxies and APIs ...but also different I Designed as overlay network (strictly separated network on top of the Internet) I No central authority I Every peer participates in routing traffic I Provides integrated services: Webserver, E-Mail, IRC, BitTorrent I Much smaller and less researched jem | I2P, The Invisible Internet Projekt | September 20, 2016 at Chaostreff Bern Introduction About I2P: Basic Facts 4 I I2P build in Java (C++ implementation I2Pd available) I Available for all major OS (Linux, Windows, MacOS, Android) I Small project –> slow progress, chaotic documentation,
    [Show full text]
  • Darmstadt University of Technology the Edonkey 2000
    Darmstadt University of Technology The eDonkey 2000 Protocol Oliver Heckmann, Axel Bock KOM Technical Report 08/2002 Version 0.8 December 2002 Last major update 22.05.03 Last minor update 27.06.03 E-Mail: {heckmann, bock}@kom.tu-darmstadt.de Multimedia Communications (KOM) Department of Electrical Engineering & Information Technology & Department of Computer Science Merckstraße 25 • D-64283 Darmstadt • Germany Phone: +49 6151 166150 Fax: +49 6151 166152 Email: [email protected] URL: http://www.kom.e-technik.tu-darmstadt.de/ 1. Introduction The Edonkey2000 Protocol is one of the most successful file sharing protocols and used by the original Edonkey2000 client and the open source clients mldonkey and EMule. The Edonkey2000 Protocol can be classified as decentral file sharing protocol with distributed servers. Contrary to the original Gnutella Protocol it is not completely decentral as it uses servers; contrary to the original Napster protocol it does not use a single server (farm) which is a single point of failure, instead it uses servers that are run by power users and offers mechanisms for inter-server communication. Unlinke Peer-to-Peer (P2P) proto- cols like KaZaa, Morpheus, or Gnutella the eDonkey network has a client/server based structure. The servers are slightly similar to the KaZaa supernodes, but they do not share any files, only manage the information distribution and work as several central dictionaries which hold the information about the shared files and their respective client locations. In the Edonkey network the clients are the nodes sharing data. Their files are indexed by the servers. If they want to have a piece of data (a file), they have to connect using TCP to a server or send a short search request via UDP to one or more servers to get the necessary information about other clients sharing that file.
    [Show full text]
  • Copyright Infringement (DMCA)
    Copyright Infringement (DMCA) Why it is important to understand the DMCA: Kent State University (KSU) is receiving more and more copyright infringement notices every semester, risking the loss of ‘safe harbor’ status. Resident students, KSU faculty, staff, and student employees, and the University itself could be at risk of costly litigation, expensive fines, damage to reputation, and possible jail time. What you need to know about KSU’s role: ● KSU is not a policing organization. ● KSU does not actively monitor computing behavior. ● KSU reacts to infringement notices generated by agents of the copyright holders ● KSU expends a significant amount of time/money protecting the identity of students by maintaining ‘safe harbor’ status KSU is ‘the good guy’ – we’re focused on educating our community What you need to know if your student receives a copyright infringement notice: They were identified as using P2P software and illegally sharing copyrighted material (whether downloading to their computer or allowing others to download from their computer). They will be informed of the notice via email, and their network connection to external resources (sites outside of KSU) will be disabled to maintain ‘safe harbor’ status until such time as they have complied with the University’s requirements under the DMCA. They can face sanctions ranging from blocked connectivity to dismissal from the University. Definition of terms: DMCA: The Digital Millennium Copyright Act of 1998 was signed into law in the United States to protect the intellectual property rights of copyright holders of electronic media (music, movies, software, games, etc.). The DMCA allows KSU to operate as an OSP.
    [Show full text]
  • Instructions for Using Your PC ǍʻĒˊ Ƽ͔ūś
    Instructions for using your PC ǍʻĒˊ ƽ͔ūś Be careful with computer viruses !!! Be careful of sending ᡅĽ/ͼ͛ᩥਜ਼ƶ҉ɦϹ࿕ZPǎ Ǖễƅ͟¦ᰈ Make sure to install anti-virus software in your PC personal profile and ᡅƽញƼɦḳâ 5☦ՈǍʻPǎᡅ !!! information !!! It is very dangerous !!! ᫬ΚTẝ«ŵ┭ՈT Stop violation of copyright concerning illegal acts of ơųጛňƿՈ☢ͩ ⚷<ǕO਍ᜐ&« transmitting music and ₑᡅՈϔǒ]ᡅ others through the Don’t forget to backup ඡȭ]dzÑՈ Internet !!! important data !!! Ȥᩴ̣é If another person looks in at your E-mail, it’s a big ὲâΞȘᝯɣ׏r problem !!! Don’t install software in dz]ǣrPǎᡅ ]ᡅîPéḳâ╓ ͛ƽញ4̶ᾬϹ࿕ ۅTake care of keeping your some other PCs without ੥ˊΙǺ password !!! permission !!! ₐ Stop sending the followings !!! ؄ŌՈϹوInformation against public order and Somebody targets on your PC for Pǎ]ᡅǕễạǑ͘͝ࢭÛ ΞȘƅ¦Ƿń morals illegal access !!! Ոƅ͟ǻᢊ᫁᫨ĐՈ ࿕Ϭ⓶̗ʵ£࿁îƷljĈ Information about discrimination, Shut out those attacks with firewall untruth and bad reputation against a !!! Ǎʻ ᰻ǡT person ᤘἌ᭔ ᆘჍഀ ጠᅼૐᾑ ᭼᭨᭞ᮞęɪᬡ෉ᬡǰɟ ᆘȐೈ࿴ ᾑ૥ ጠᅼ3ظ ᤘἌ᭔ ǰɟᯓۀ᭞ᮞ᭿ᮐᮧ᭪᭑᭎ᮖ᭤ᬞᬢ ഄᅤ Έʡȩîᬡ͒ͮᬢـ ᅼܘᆘȐೈ ǸᆜሹظᤘἌ᭔࿴ ཬᴔ ᭼᭨᭞ᮞᬞᬢŽᬍ᭑᭎ᮖ᭤̛ɏ᭨ᮀ᭳ᭅ ரἨ᳜ᄌ࿘Π ؼ˨ഀ ୈ᡼ὼ$ ഄጵ↬3L ʍ୰ᬞᯓ ᄨῼ33 Ȋථᬚᬌᬻᯓ ഄ˽ ઁǢᬝຨϙଙͮـᅰჴڹެ ሤᆵͨ˜Ɍ ጵႸᾀ żᆘ᭔ ᬝᬜ᫞Ϊ̎UઁɃᬢ ࡶ୰ᬝ᭲ᮧ᭪ᬢ ᄨؼᾭᄨ ᾑ૥ ٕ࿩ᅨ ΰ̛ᬞ᭫ᮌᯓ ᭻᭮᭚᭍᭮ᮂᭅ ሬČ ཬȴ3 ᾘɤɟ3 Ƌᬿᬍᬞᯓ ᫾ᬿᬒᬼۏąഄᅼ Ѹᆠᅨ ᮌᮧᮖᭅ ⃸ᛴܠ ఼ ᆬð3 ᤘἌ᭔࿴ ƂŬᯓ ᭨ᮀ᭳᭑᭒᭍ᭅƖ̳ᬞ ĩᬡ᭼᭨᭞ᮞᬞٴ ரἨ᳜ᄌ࿘ ᭼᭤ᮚᮧ᭴ᬡɼǂᬢ ڹެ ᵌೈჰ˨ ˜ϐ ᛄሤ↬3 ᆜೈᯌ ϤᏤ ᬊᬖ᫾ᬽᬊᬻ᫹ᯓ ᭏ᮞ᭤᭳ᮧᮖᬊᬝ᫷ᬚ ሬČʀ ͌ǜ ąഄᅼ ΰ̛ᬞ ޅ᫾᫿᫵ᬝᬒᬡ᭼᭨᭞ᮞᭅ ᤘἌ᭔Π ͬϐʼ ᆬð3 ʏͦᬞɃᬌᬾȩî ēᬖᬙ᫷ᬾᯓ ܘˑˑᏬୀΠ ᄨؼὼ ሹ ߍɋᬞ᫵ᬒᬾȩî ᮀᭌ᭏᭍᭑᭔ᮧᮖwƫᬚފᴰᆘ࿘ჸ $±ᅠʀ =Ė ܘ૥Čٍᅨ ᙌۨ5ࡨٍὼ ሹ ഄϤᏤ ᤘἌ᭔ ኩ˰Π3 ᬢ͒ͮᬊᬝ᫷ᯓ ᭢ᮎ᭮᭳᭍᭑᭳ᬊᬻ᫹ᯓـ ʧʧ¥¥ᬚᬚP2PP2P᭨᭨ᮀᮀ᭳᭳᭑᭑᭒᭒᭍᭍ᬢᬢ DODO NOTNOT useuse P2PP2P softwaresoftware ̦̦ɪɪᬚᬚᬀᬀᬱᬱᬎᬎᭆᭆᯓᯓ inin campuscampus networknetwork !!!! Z ʧ¥᭸᭮᭳ᮚᮧ᭚ᬞ᫽ᬄᬾ੒ͮᬢȴƏΜˉ᭢᭤᭱ Z All communications in our campus network are ᬈᬿᬙ᫷ᬱᬌ᫟ʧ¥ᬚP2P᭨ᮀ always monitored automatically.
    [Show full text]