DOCSLIB.ORG

Download Times, Bandwidth and Energy Consumption in the Network, Internet Bandwidth Cost, and Traffic Load Imbalance in the Network

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Download Times, Bandwidth and Energy Consumption in the Network, Internet Bandwidth Cost, and Traffic Load Imbalance in the Network Content Sharing and Distribution in Wireless Community Networks by Amr Alasaad B.Sc., King Saud University, 2000 M.Sc., The University of Southern California, 2005 A THESIS SUBMITTED IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF DOCTOR OF PHILOSOPHY in The Faculty of Graduate Studies (Electrical and Computer Engineering) THE UNIVERSITY OF BRITISH COLUMBIA (Vancouver) April 2013 c Amr Alasaad 2013 Abstract We consider the problem of content sharing and distribution in a wireless mesh community network (WMCN). Due to the community oriented nature of such networks, and with the evolution of advanced mobile computing devices; it is projected that the demand for content sharing and distribution in wireless community networks will dramatically increase in the coming years. A popular scheme for content sharing and distribution is through the use of Peer-to-Peer (P2P) technology. This dissertation studies the technical challenges involved while deploying P2P applications over WMCNs. We advance the thesis that support from a number of infrastructure nodes in a wire- less community network to P2P applications running on top of the wireless community network such as P2P content sharing and P2P media streaming, results in significant performance enhancement. Such support from infrastructure nodes benefits from aware- ness of the underlying network topology (i.e., information available at relay nodes about the true physical connections between nodes in the network). Cross-layer information exchange between the P2P system and the WMCN opens the door to developing efficient algorithms and schemes for P2P communications that account for the specific features of WMCNs (e.g., contention for wireless medium between neighbouring nodes and traffic in- terference). Moreover, such support benefits from the underutilized resources (e.g., storage and bandwidth resources) at a large number of infrastructure nodes in the WMCN. This creates the possibility of replicating into the caches of those under-utilized infrastructure nodes P2P contents that are desired by the community, and enabling those infrastructure nodes to participate in content distribution and play the role of helpers in P2P content ii Abstract sharing and distribution. Our main contribution in this dissertation is P2P-with-helpers: Hybrid approaches for content sharing and distribution in a wireless community network that rely on sup- port from infrastructure nodes to the P2P applications. We show that P2P-with-helpers approaches significantly enhance the performance of P2P content sharing and distribu- tion in WMCNs. The performance enhancements reflect aspects such as average content download times, bandwidth and energy consumption in the network, Internet bandwidth cost, and traffic load imbalance in the network. iii Preface This thesis is based on the research work conducted at the Department of Electrical and Computer Engineering at UBC under supervision of Dr. Victor C.M. Leung and Dr. Sathish Gopalakrishnan. I am the principal author of all chapters in this dissertation. Chapter 2 of this dissertation has been partially published in the proceedings of the IEEE Globecom 2010 Conference and IEEE PACRIM 2009 Conference, and in the journal of Wireless Communications and Mobile Computing (cf. the list of articles and papers below). Chapter 3 has been partially published in proceedings of the IEEE PIMRC 2011 and IEEE Globecom 2010 Workshop on Ubiquitous Computing and Networks, and is to partially appear in the journal of Wireless Communications and Mobile Computing (cf. the list of articles and papers below). Chapter 4 of this dissertation has been partially published in the proceedings of the IEEE ICC GCN 2012 Workshop, and in the journal of Peer-to-Peer Networking and Applications, special issue on Peer-to-Peer as infrastructure service (cf. the list of articles and papers below). Chapter 5 of this dissertation is to partially appear in the journal of Telecommunication systems, special issue on innovations in emerging multimedia communication systems (cf. the list of articles and papers below). Chapter 6 of this dissertation has been partially published in the proceedings of the IEEE PIMRC 2009, and in the journal of ACM/Springer Wireless networks (cf. the list of articles and papers below). iv Preface The research related to these publications was conducted by myself under supervision of Dr. Victor C.M. Leung and Dr. Sathish Gopalakrishnan. The research ideas, analytical evaluations, mathematical modelling, and simulation programs are all the results of my work. My supervisors helped with discussions, providing research guidance, defining the problems, checking the validity of my analytical and simulation results, and proofreading the respective conference papers and journal articles. One of the papers used in Chapter 6 was co-authored with Mr. Hasen Nicanfar, who is also a PhD candidate in the Department of Electrical and Computer Engineering at UBC. Mr. Nicanfar helped in setting up the simulation environment used to evaluate the ideas proposed in Chapter 6. In the following, a list of articles and papers where the results in this thesis have been partially published/accepted is provided. In some cases, the conference papers contain materials overlapping with the journal papers. Journal Papers Accepted/Published: • (Part of Chapter 2) A. Alasaad, S. Gopalakrishnan, and V. C.M. Leung, \Extending P2PMesh: Topology-aware schemes for efficient Peer-to-Peer data sharing in wireless mesh networks," in Wireless Communications and Mobile Computing, John Wiley & Sons, Ltd., vol. 13, no. 5, pp. 483{499, 2013. • (Part of Chapter 3) A. Alasaad, S. Gopalakrishna,n and V. C.M. Leung, \Replica- tion schemes for Peer-to-Peer content in wireless mesh networks with infrastructure support," accepted for publication in Wireless Communications and Mobile Com- puting, John Wiley & Sons, Ltd. • (Part of Chapter 4) A. Alasaad, S. Gopalakrishnan, and V. C.M. Leung, \Mod- elling and performance analysis of content sharing and distribution on community networks with infrastructure support," in Peer-to-Peer Networking and Applica- tions, special issue on Peer-to-Peer as infrastructure service, Springer New York, v Preface published online in August 2012. DOI: 10.1007/s12083-012-0167-1. • (Part of Chapter 5) A. Alasaad, S. Gopalakrishnan, and V. C.M. Leung, \A hybrid approach for cost-effective media streaming based on prediction of demand in com- munity networks," accepted for publication in Telecommunication Systems, special issue on innovations in emerging multimedia communication systems, Springer New York. • (Part of Chapter 6) A. Alasaad, H. Nicanfar, S. Gopalakrishnan, and V. C.M. Leung, \A ring-based multicast network topology with QoS support in wireless mesh networks," in ACM/Springer Wireless Networks, published online in March 2013. DOI:10.1007/s11276-013-0559-z. Conference Papers Published: • (Part of Chapter 2) A. Alasaad, S. Gopalakrishnan, and V. C.M. Leung, \Peer- to-Peer file sharing over wireless mesh networks," in Proc. of the IEEE PACRIM Conference, pp. 697{702, Victoria, BC, August 2009. • (Part of Chapter 2) A. Alasaad, S. Gopalakrishnan, and V. C.M. Leung, \Mitigating load imbalance in wireless mesh networks with mixed application traffic types," in Proc. of the IEEE Globecom Conference, pp. 1{5, Miami, FL, December 2010. • (Part of Chapter 3) A. Alasaad, S. Gopalakrishnan, and V. C.M. Leung, \Repli- cation schemes for Peer-to-Peer content in wireless mesh networks with network support," in Proc. of the IEEE PIMRC Conference, pp. 1135{1139, Toronto, ON, September 2011. • (Part of Chapter 3) A. Alasaad, S. Gopalakrishnan, and V. C.M. Leung, \Content caching and replication schemes for Peer-to-Peer file sharing in wireless mesh net- works," in Proc. of the IEEE Globecom Workshop on Ubiquitous Computing and Networks, pp. 1707{1711, Miami, FL, December 2010. vi Preface • (Part of Chapter 4) A. Alasaad, S. Gopalakrishnan, and V. C.M. Leung, \Green content distribution in wireless mesh networks," in Proc. of the IEEE ICC GCN Workshop, pp. 5896{5900, Ottawa, ON, June 2012. • (Part of Chapter 6) A. Alasaad, S. Gopalakrishnan, and V. C.M. Leung, \An ar- chitecture with QoS support for application layer multicasting over wireless mesh networks," in Proc. of the IEEE PIMRC Conference, pp. 1562{1566, Tokyo, Japan, September 2009. vii Table of Contents Abstract ......................................... ii Preface ......................................... iv Table of Contents . viii List of Tables .....................................xiii List of Figures .....................................xiv List of Acronyms . xviii Acknowledgements ..................................xix Dedication .......................................xxi 1 Introduction .................................... 1 1.1 Architecture of WMCNs . 1 1.2 Wireless Communities Around the World . 2 1.3 Services and Applications in WMCNs . 3 1.4 Content Sharing in WMCNs . 3 1.5 P2P Communication in WMCNs . 6 1.5.1 Fundamental Challenges of P2P Communication in WMCNs . 6 1.6 Research Motivation . 7 viii Table of Contents 1.7 Main Research Contribution: Hybrid Approaches for Content Sharing and Distribution in WMCNs . 9 1.8 Summary of Research Contributions . 11 2 P2PMesh: Topology-aware Schemes for Efficient Peer-to-Peer Content Sharing and Distribution1 ............................ 19 2.1 Introduction . 19 2.2 Related Work . 24 2.3 Design and Architecture of the P2PMesh . 27 2.3.1 Content Lookup in P2PMesh . 28 2.3.2 Selection of Content Providers
Load more

Recommended publications
  • Uila Supported Apps
    Uila Supported Applications and Protocols updated Oct 2020 Application/Protocol Name Full Description 01net.com 01net website, a French high-tech news site. 050 plus is a Japanese embedded smartphone application dedicated to 050 plus audio-conferencing. 0zz0.com 0zz0 is an online solution to store, send and share files 10050.net China Railcom group web portal. This protocol plug-in classifies the http traffic to the host 10086.cn. It also 10086.cn classifies the ssl traffic to the Common Name 10086.cn. 104.com Web site dedicated to job research. 1111.com.tw Website dedicated to job research in Taiwan. 114la.com Chinese web portal operated by YLMF Computer Technology Co. Chinese cloud storing system of the 115 website. It is operated by YLMF 115.com Computer Technology Co. 118114.cn Chinese booking and reservation portal. 11st.co.kr Korean shopping website 11st. It is operated by SK Planet Co. 1337x.org Bittorrent tracker search engine 139mail 139mail is a chinese webmail powered by China Mobile. 15min.lt Lithuanian news portal Chinese web portal 163. It is operated by NetEase, a company which 163.com pioneered the development of Internet in China. 17173.com Website distributing Chinese games. 17u.com Chinese online travel booking website. 20 minutes is a free, daily newspaper available in France, Spain and 20minutes Switzerland. This plugin classifies websites. 24h.com.vn Vietnamese news portal 24ora.com Aruban news portal 24sata.hr Croatian news portal 24SevenOffice 24SevenOffice is a web-based Enterprise resource planning (ERP) systems. 24ur.com Slovenian news portal 2ch.net Japanese adult videos web site 2Shared 2shared is an online space for sharing and storage.
    [Show full text]
  • Peer-To-Peer Software and Use of NRC Computers to Process SUNSI Frequently Asked Questions
    Peer-to-Peer Software and Use of NRC Computers to Process SUNSI Frequently Asked Questions 1. What is peer-to-peer software? Peer-to-peer, or P2P, file-sharing systems provide users with the ability to share files on their computers with other people through the Internet. The most popular P2P software is free and is used to share music, movies, and games, and for Instant Messaging. 2. Why is P2P a problem? P2P software provides the capability for users to access files on other users’ computers beyond those intended for sharing (i.e., music). For example, if you have P2P software on your computer and you also do your own tax preparation on your computer and store a copy of the tax return on your hard drive, other people anywhere in the world may be able to access the files containing your tax return. 3. Have sensitive government files been obtained through the use of P2P? Yes. There are documented incidents where P2P software was used to obtain sensitive government information when peer-to-peer software was installed on a government or home computer. 4. Is someone obtaining sensitive information the only threat? No. P2P can also make it easier for computer viruses and other malicious software to be installed on your computer without your knowledge. 5. Have other Federal agencies adopted similar policies? Yes, other Federal agencies have adopted similar policies. The Office of Management and Budget wrote the requirements for government-wide adoption in 2004. Additionally, due to the increased awareness of the P2P threat that has arisen since 2004, DOT, DHS, DOE, DOD, and other agencies have issued specific P2P policies.
    [Show full text]
  • ARK​ ​​Whitepaper
    ARK Whitepaper ​ ​​ A Platform for Consumer Adoption ​ ​ ​ ​ ​ ​ ​ ​ v.1.0.3 The ARK Crew ARK Whitepaper v.1.0.3 ​ ​ ​ ​ ​ ​ ​ ​ Table Of Contents ​ ​ ​ ​ Overview………………………………………………………………...……………………………….……………….………………………………………………………….….3 ​ Purpose of this Whitepaper………………………………………………………………………………………………………………………..….……….3 ​ ​ ​ ​ ​ ​ ​ Why?…………………………………………………………………………………………………………………….…………………………………………………….…………..4 ​ ​ ARK…………………………………………………………………………………………………….……………….…………………………………………………………………..5 ​ ​ ARK IS………………………………………………………………………………………………....……………….………………………………………………………………..5 ​ ​ ​ ​ ARK: Technical Details……………………………………….…….…..…………………………...……………….………………...…………………………...6 ​ ​ ​ ​ ​ ​ - Delegated Proof of Stake…………………………….……………...………………………….……………………………………….………...…...6 ​ ​​ ​ ​ ​ ​ ​ ​ ​ - Hierarchical Deterministic (HD) Wallets ​ ​​ ​ ​ ​ ​ ​ ​ (BIP32)…………………………………………………….....…………………..…..8 ​ - Fees……………………………………………………………………………………………………………….……………….…...………………………………..……...8 ​ ​​ ​ - ARK Delegates and Delegate Voting.…………………………………………………………………………………...………………….9 ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ - Bridged Blockchains (SmartBridges)....................………………………………………………………………….………...…….10 ​ ​​ ​ ​ ​ ​ ​ - POST ARK-TEC Token Distribution …………………..…………………………………….………………….………..……..…..……….11 ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ - Testnet Release……………………………………………….…………………………………………………………………….………...….....12 ​ ​ ​ And Beyond?…………………………………………………………………….………...……………………………………….………………………...……….…12 ​ ​ ​ ​ Addendum 1: ARK IS…(Cont.)...……..……..…………....…..………...………………………………………...………………………......……12
    [Show full text]
  • Trail's End Rewards
    Get more YESSES with the TRAIL’S END REWARDS New Trail’s End App EARN BIGGER REWARDS THAN EVER BEFORE Accept cash and credit cards (FREE CREDIT CARD PROCESSING), BUY THE PRIZE(S) YOU WANT WITH AN AMAZON.COM GIFT CARD track sales and inventory, and sign up for available storefronts. TO REDEEM YOUR AMAZON.COM GIFT CARD, SCOUTS MUST HAVE A REGISTERED TRAIL’S END ACCOUNT. SEE MORE PRIZES AT REWARDS.TRAILS-END.COM The App for All the Ways You Sell! Sell REWARD IDEAS: 2018 TOP SELLERS $3,500 Storefronts Door-to-Door Online At Work Local Businesses $88,073 $88,017 Earn a $225 Beck Mason Amazon.com Gift Card Virginia Michigan BONUS LEVEL $ TRAIL’S END SCHOLARSHIP PROGRAM REWARD IDEAS: Sell $2,500 of qualifying Trail’s End products in any calendar year and have 6% of $80,000 your total sales count towards your own Trail’s End Scholarship. Once enrolled, 6% of your sales each year will go towards the scholarship. You only have to hit the $2,500 minimum one time. Visit www.trails-end.com/scholarship for full Download Register Set Your Goal Start Selling $60,000 program details. Sell REWARD IDEAS: $40,000 FAMILY VACATION! $2,500 KEEP GOING! + + Earn a $150 FREE SHIPPING on EVERY online order! Hotels.com Uber New Amazon.com Gift Card $20,000 Gift Card Gift Card Luggage Set Sell REWARD IDEAS: NO LIMIT $1,500 Reach friends and family far away by sharing your personalized Scout Sell above $15,000 and earn 8% of your total sales in Earn a $75 fundraising page from the app via email, text, and social media.
    [Show full text]
  • Simulacijski Alati I Njihova Ograničenja Pri Analizi I Unapređenju Rada Mreža Istovrsnih Entiteta
    SVEUČILIŠTE U ZAGREBU FAKULTET ORGANIZACIJE I INFORMATIKE VARAŽDIN Tedo Vrbanec SIMULACIJSKI ALATI I NJIHOVA OGRANIČENJA PRI ANALIZI I UNAPREĐENJU RADA MREŽA ISTOVRSNIH ENTITETA MAGISTARSKI RAD Varaždin, 2010. PODACI O MAGISTARSKOM RADU I. AUTOR Ime i prezime Tedo Vrbanec Datum i mjesto rođenja 7. travanj 1969., Čakovec Naziv fakulteta i datum diplomiranja Fakultet organizacije i informatike, 10. listopad 2001. Sadašnje zaposlenje Učiteljski fakultet Zagreb – Odsjek u Čakovcu II. MAGISTARSKI RAD Simulacijski alati i njihova ograničenja pri analizi i Naslov unapređenju rada mreža istovrsnih entiteta Broj stranica, slika, tablica, priloga, XIV + 181 + XXXVIII stranica, 53 slike, 18 tablica, 3 bibliografskih podataka priloga, 288 bibliografskih podataka Znanstveno područje, smjer i disciplina iz koje Područje: Informacijske znanosti je postignut akademski stupanj Smjer: Informacijski sustavi Mentor Prof. dr. sc. Željko Hutinski Sumentor Prof. dr. sc. Vesna Dušak Fakultet na kojem je rad obranjen Fakultet organizacije i informatike Varaždin Oznaka i redni broj rada III. OCJENA I OBRANA Datum prihvaćanja teme od Znanstveno- 17. lipanj 2008. nastavnog vijeća Datum predaje rada 9. travanj 2010. Datum sjednice ZNV-a na kojoj je prihvaćena 18. svibanj 2010. pozitivna ocjena rada Prof. dr. sc. Neven Vrček, predsjednik Sastav Povjerenstva koje je rad ocijenilo Prof. dr. sc. Željko Hutinski, mentor Prof. dr. sc. Vesna Dušak, sumentor Datum obrane rada 1. lipanj 2010. Prof. dr. sc. Neven Vrček, predsjednik Sastav Povjerenstva pred kojim je rad obranjen Prof. dr. sc. Željko Hutinski, mentor Prof. dr. sc. Vesna Dušak, sumentor Datum promocije SVEUČILIŠTE U ZAGREBU FAKULTET ORGANIZACIJE I INFORMATIKE VARAŽDIN POSLIJEDIPLOMSKI ZNANSTVENI STUDIJ INFORMACIJSKIH ZNANOSTI SMJER STUDIJA: INFORMACIJSKI SUSTAVI Tedo Vrbanec Broj indeksa: P-802/2001 SIMULACIJSKI ALATI I NJIHOVA OGRANIČENJA PRI ANALIZI I UNAPREĐENJU RADA MREŽA ISTOVRSNIH ENTITETA MAGISTARSKI RAD Mentor: Prof.
    [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]
  • RIVERSIDE COMMUNITY COLLEGE DISTRICT FOUNDATION Gift Acceptance Policy I. Introduction the Riverside Community College District
    RIVERSIDE COMMUNITY COLLEGE DISTRICT FOUNDATION Gift Acceptance Policy I. Introduction The Riverside Community College District Foundation is a private non-profit organization whose mission is to raise private philanthropic funding for the benefit of the Riverside Community College District (RCCD) and its Colleges. The Foundation is responsible for the solicitation and management of private gifts to RCCD. This policy is designed to help facilitate the gift-giving process and to provide guidance to the entire RCCD community, outside advisors who assist in the gift planning process and to prospective donors who wish to make gifts to the Foundation. II. General Policies A. All gifts to the Foundation will comply with IRS requirements governing nonprofit 501(c)(3) corporations. In addition, the Foundation utilizes the standards and guidelines set forth by the Council for Advancement in Support of Fundraising (CASE). B. Any formal solicitation of gifts to the Foundation will be made only by or in consultation with an authorized representative of the Foundation, including Foundation staff and members of the RCCD Foundation Board Directors. C. Only the Executive Director of the Foundation, or his/her designee, is permitted to accept gifts on behalf of the Foundation. All gift activity will be reported and reviewed regularly by the RCCD Foundation Finance Committee. D. The Foundation may reject any gift that it determines is inconsistent with the mission, goals or objectives of the Foundation, the District or Colleges, or if the gift is determined to not be in the best interests of the Foundation to accept. E. Donors should be strongly encouraged to seek the advice of independent legal and tax counsel in all matters pertaining to gifts to the Foundation.
    [Show full text]
  • Olympian Exchange
    LINUXUSER Apollon File Sharing with Apollon and GiFT OLYMPIAN EXCHANGE The operators of the popular Internet-based file sharing network, Kazaa, only provide software for Windows systems, but the GiFT project brings www.sxc.hu Kazaa support to Linux. BY CARSTEN SCHNOBER azaa [1], the popular Internet- Kazaa makes it difficult for the Linux rent version. Box 1 describes how to add based file sharing network, has community to join the network, as the plugins. Kthe biggest user-base and offers peer-to-peer software Kazaa provides is GiFT is not a client program but a its users the widest range of services. So restricted to Microsoft operating sys- background daemon. When launched, it far, Kazaa has owed its popularity to tems. opens a connection to the P2P networks, Windows users – possibly due to the The GiFT project [2] now has a Linux- providing a gateway to local programs. prominence of illegal copies of expen- based plugin for users who want to The KDE program Apollon [8] uses the sive software packages, which are use- share files worldwide via Kazaa. The GiFT daemon and gives users a GUI for less to most Linux users. Additionally, plugin implements the Fasttrack protocol easy access to the file sharing platforms. used by Kazaa and additionally supports Installation the Gnutella [3] file The Arkollon program installs the Apol- sharing network. At the lon GUI and GiFT, including plugins for same time, OpenFast- track provides an alter- Table 1: Required Packages native to Kazaa. There RPM Debian is another plugin for zlib-devel zlib1g-dev the Ares network [4], libtool libltdl3-dev and the GiFT home- db-devel libdb4.2-dev page also refers to plu- libmagic-devel libmagic-dev gins for Napster [5], libvorbis-devel libvorbis-dev Soulseek [6] and E- imagemagick-devel libmagick-dev Donkey [7], which are qt3-devel libqt3-mt-dev incomplete or no qt3-devel-tools qt3-dev-tools kdelibs3-devel kdelibs4-dev Figure 1: Arkollon installs Apollon automatically.
    [Show full text]
  • Dat - Distributed Dataset Synchronization and Versioning
    Dat - Distributed Dataset Synchronization And Versioning Maxwell Ogden, Karissa McKelvey, Mathias Buus Madsen April 2017, Code for Science Abstract cloud storage services which fixes many issues with broken links but rely on proprietary code and services Dat is a protocol designed for syncing folders of data, requiring users to store their data on centralized cloud even if they are large or changing constantly. A crypto- infrastructure which has implications on cost, transfer graphically secure register of changes to the data over speeds, vendor lock-in and user privacy. time is used to ensure dataset versions are distributed Distributed file sharing tools can become faster as as exact copies of exact versions. Any byte range files become more popular, removing the bandwidth of any version of any file can be efficiently streamed bottleneck and making file distribution cheaper. They from a Dat repository over a network connection. Con- also use link resolution and discovery systems which sumers can choose to fully or partially replicate the can prevent broken links meaning if the original source contents of a remote Dat repository, and can also goes offline other backup sources can be automatically subscribe to live changes. Dat uses built-in public key discovered. However these file sharing tools today are cryptography to encrypt network traffic, allowing it not supported by Web browsers, do not have good to make certain privacy and security guarantees. A privacy guarantees, and do not provide a mechanism group of Dat clients can connect to each other to form for updating files without redistributing a new dataset a public or private decentralized network to exchange which could mean entire redownloading data you al- data amognst each other in a swarm.
    [Show full text]
  • Applications: G
    Applications: G This chapter contains the following sections: • G4, on page 5 • GACP, on page 6 • Gaia Online, on page 7 • Game Center, on page 8 • Game Front, on page 9 • Game Informer, on page 10 • GamerCom, on page 11 • GAMERSKY, on page 12 • GameSpot, on page 13 • GameSpy, on page 14 • GameStop, on page 15 • GameTrailers, on page 16 • Ganglia, on page 17 • Ganji, on page 18 • Gantter, on page 19 • Garmin, on page 20 • Gateway, on page 21 • Gawker, on page 22 • Gazprom Media, on page 23 • Gbridge, on page 24 • gdomap, on page 25 • GDS DataBase, on page 26 • GearBest, on page 27 • Geewa, on page 28 • Geico, on page 29 • generic audio/video, on page 30 • Genesis PPP, on page 31 • Genie, on page 32 • Genieo, on page 33 • Genieo Web Filter, on page 34 • GENRAD, on page 35 • Gfycat, on page 36 Applications: G 1 Applications: G • GG, on page 37 • GG Media, on page 38 • GGP, on page 39 • Ghaneely, on page 40 • GIFSoup.com, on page 41 • giFT, on page 42 • Giganews, on page 43 • ginad, on page 44 • GIOP, on page 45 • GIPHY, on page 46 • GISMETEO, on page 47 • GIST, on page 48 • GitHub, on page 49 • Gizmodo, on page 50 • GKrellM, on page 51 • Glide, on page 52 • Globo, on page 53 • Glympse, on page 54 • Glype, on page 55 • Glype Proxy, on page 56 • Gmail, on page 57 • Gmail attachment, on page 58 • GMTP, on page 59 • GMX Mail, on page 60 • GNOME, on page 61 • GNU Generation Foundation NCP 678, on page 62 • GNU Project, on page 63 • Gnucleus, on page 64 • GnucleusLAN, on page 65 • Gnutella, on page 66 • Gnutella2, on page 67 • GO.com, on page
    [Show full text]
  • Distributed Lookup: Part 1: Distributed Hash Tables
    CS 417 – DISTRIBUTED SYSTEMS Week 9: Distributed Lookup: Part 1: Distributed Hash Tables © 2021 Paul Krzyzanowski. No part of this content, may be reproduced or reposted in Paul Krzyzanowski whole or in part in any manner without the permission of the copyright owner. Distributed Lookup • Store (key, value) data Object Storage • Look up a key to get the value • Cooperating set of nodes store data • Ideally: – No central coordinator • Peer-to-peer system: all systems have the same capabilities – Some nodes can be down CS 417 © 2021 Paul Krzyzanowski 2 Approaches 1. Central coordinator – Napster 2. Flooding – Gnutella 3. Distributed hash tables – CAN, Chord, Amazon Dynamo, Tapestry, … CS 417 © 2021 Paul Krzyzanowski 3 1. Central Coordinator • Example: Napster – Central directory – Identifies content (names) and the servers that host it – lookup(name) → {list of servers} – Download from any of available servers • Pick the best one by pinging and comparing response times • Another example: GFS – Controlled environment compared to Napster – Content for a given key is broken into chunks – Master handles all queries … but not the data CS 417 © 2021 Paul Krzyzanowski 4 1. Central Coordinator - Napster • Pros – Super simple – Search is handled by a single server (master) – The directory server is a single point of control • Provides definitive answers to a query • Cons – Master has to maintain state of all peers – Server gets all the queries – The directory server is a single point of control • No directory, no service! CS 417 © 2021 Paul Krzyzanowski 5 2. Query Flooding • Example: Gnutella distributed file sharing • Each node joins a group – but only knows about some group members – Well-known nodes act as anchors – New nodes with files inform an anchor about their existence – Nodes use other nodes they know about as peers CS 417 © 2021 Paul Krzyzanowski 6 2.
    [Show full text]
  • Title: P2P Networks for Content Sharing
    Title: P2P Networks for Content Sharing Authors: Choon Hoong Ding, Sarana Nutanong, and Rajkumar Buyya Grid Computing and Distributed Systems Laboratory, Department of Computer Science and Software Engineering, The University of Melbourne, Australia (chd, sarana, raj)@cs.mu.oz.au ABSTRACT Peer-to-peer (P2P) technologies have been widely used for content sharing, popularly called “file-swapping” networks. This chapter gives a broad overview of content sharing P2P technologies. It starts with the fundamental concept of P2P computing followed by the analysis of network topologies used in peer-to-peer systems. Next, three milestone peer-to-peer technologies: Napster, Gnutella, and Fasttrack are explored in details, and they are finally concluded with the comparison table in the last section. 1. INTRODUCTION Peer-to-peer (P2P) content sharing has been an astonishingly successful P2P application on the Internet. P2P has gained tremendous public attention from Napster, the system supporting music sharing on the Web. It is a new emerging, interesting research technology and a promising product base. Intel P2P working group gave the definition of P2P as "The sharing of computer resources and services by direct exchange between systems". This thus gives P2P systems two main key characteristics: • Scalability: there is no algorithmic, or technical limitation of the size of the system, e.g. the complexity of the system should be somewhat constant regardless of number of nodes in the system. • Reliability: The malfunction on any given node will not effect the whole system (or maybe even any other nodes). File sharing network like Gnutella is a good example of scalability and reliability.
    [Show full text]