DOCSLIB.ORG

Study and Analysis on Optimal Scheduling Data-Driven Peer-To-Peer Streaming

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

International Journal of Engineering Research & Technology (IJERT) ISSN: 2278-0181 Vol. 1 Issue 6, August - 2012 Study and analysis on Optimal scheduling Data-Driven Peer-to-Peer Streaming 1 2 B.Kundan D.Jamuna currently emerging throughout society, enabled by Abstract: Internet technologies in general. We propose a new architecture for on-demand media streaming centered around the peer-to-peer (P2P) The basic idea of data-driven streaming paradigm. The key idea of the architecture is that peers protocol is very simple and similar to that of Bit- share some of their resources with the system. As peers Torrent. The protocol contains two steps. In the first contribute resources to the system, the overall system step, each node independently selects its neighbors so capacity increases and more clients can be served.. In as to form an unstructured overlay network, called the these applications, each node independently selects gossip-style overlay construction or membership some other nodes as its neighbors (i.e., gossip style management. The second step is named block overlay construction) and exchanges streaming data scheduling: The live media content is divided into with the neighbors (i.e., data scheduling). To improve blocks (or segments or packets), and every node the performance of such protocol, many existing works announces what blocks it has to its neighbors. Then focus on the gossip-style overlay construction issue. each node explicitly requests the blocks of interest from However, few of them concentrate on optimizing the its neighbors according to their announcement. In this streaming data scheduling to maximize the throughput project, we present our analytical model and of a constructed overlay. In this paper, we analytically corresponding solutions to tackle the block scheduling study the scheduling problem in data-driven streaming problem in data-driven protocol. We first model this system and model it as a classical min-cost network scheduling problem as a classical min-cost network flow problem. We then propose both the global optimal flow problem and propose a global optimal solution in scheduling scheme and distributed heuristic algorithm order to find out the ideal throughput improvement in to optimize the system throughput. Furthermore, we theory. Since this solution is centralized and requires introduce layered video coding into data-driven global knowledge, based on its basic idea, we then protocol and extend our algorithm to deal with the end- propose a heuristic algorithm that is fully distributed host heterogeneity. and asynchronous with only local information exchange. Furthermore, we employ layered video Keywords: Peer-to-peer systems, optimal scheduling, coding to encode the video into multiple rates and Distributed hash tables extend our algorithm to improve the satisfaction of the users with heterogeneous access bandwidth. `1.INTRODUCTION: In Existing system we using two approaches A peer-to-peer, commonly abbreviated to P2P, for online media streaming called unicast based distributed network architecture is composed of approaches and multicast based approach. There are participants that make a portion of their resources (such two approaches that use unicast for on-demand as processing power, disk storage or network streaming centralized content distribution networks bandwidth) directly available to other network (CDN). In the centralized approach we have participants, without the need for central coordination maintaining the powerful server, this approach is easy instances (such as servers or stable hosts). Peers are to deploy and manage. But the scalability process leads both suppliers and consumers of resources, in contrast to the failure in the network. There are two other to the traditional client-server model where only servers critical, but less obvious, disadvantages of the supply, and clients consume. Peer-to-peer was centralized approach: high cost and load on the popularized by file sharing systems like Napster. Peer- backbone network. On the negative side, this approach to-peer file sharing networks have inspired new requires deploying and managing proxies at many structures and philosophies in other areas of human locations. While deploying proxies increases the overall interaction. In such social contexts, peer-to-peer as a system capacity, it multiplies the cost. The capacity is meme refers to the egalitarian social networking that is still limited by the aggregate resources of the proxies. In multicast they have following two techniques www.ijert.org 1 International Journal of Engineering Research & Technology (IJERT) ISSN: 2278-0181 Vol. 1 Issue 6, August - 2012 network level and application level in both they constructing the network in the tree and client act as a leaf. Centralized approach: high cost and load on the backbone network. On the negative side, this approach requires deploying and managing proxies at many locations. While deploying proxies increases the overall system capacity, it multiplies the cost. The capacity is still limited by the aggregate resources of the proxies. In multicast they have following two techniques network level and application level in both they constructing the network in the tree and client act as a leaf. The main purpose of the proposed system the scheduling problem in data-driven streaming system and model it as a classical min-cost network flow problem. We then propose both the global optimal scheduling scheme and distributed heuristic algorithm to optimize the system throughput. Furthermore, we Fig: 2.1 Peer-to-peer systems Architecture introduce layered video coding into data-driven protocol and extend our algorithm to deal with the end- host heterogeneity. We present our analytical model Peer-to-peer systems often implement an and corresponding solutions to tackle the block Application Layer overlay network on top of the native scheduling problem in data-driven protocol. We first or physical network topology. Such overlays are used model this scheduling problem as a classical min-cost for indexing and peer discovery. Content is typically network flow problem and propose a global optimal exchanged directly over the underlying Internet solution in order to find out the ideal throughput Protocol (IP) network. Anonymous peer-to-peer improvement in theory. Since this solution is systems are an exception, and implement extra routing centralized and requires global knowledge, based on its layers to obscure the identity of the source or basic idea, we then propose a heuristic algorithm that is destination of queries. In structured peer-to-peer fully distributed and asynchronous with only local networks, connections in the overlay are fixed. They information exchange. This scheduling problem as a typically use distributed hash table-based (DHT) classical min-cost network flow problem and propose a indexing, such as in the Chord system (MIT). global optimal solution in order to find out the ideal Unstructured peer-to-peer networks do not provide any throughput improvement in theory. Since this solution algorithm for organization or optimization of network is centralized and requires global knowledge, based on connections. In particular, three models of unstructured its basic idea, we then propose a heuristic algorithm that architecture are defined. In pure peer-to-peer systems is fully distributed and asynchronous with only local the entire network consists solely of equipotent peers. information exchange. There is only one routing layer, as there are no preferred nodes with any special infrastructure function. Hybrid peer-to-peer systems allow such infrastructure 2. Peer-to-Peer systems: nodes to exist, often called supernodes. In centralized peer-to-peer systems, a central server is used for A peer-to-peer, commonly abbreviated to P2P, indexing functions and to bootstrap the entire system. distributed network architecture is composed of Although this has similarities with a structured participants that make a portion of their resources (such architecture, the connections between peers are not as processing power, disk storage or network determined by any algorithm. The first prominent and bandwidth) directly available to other network popular peer-to-peer file sharing system, Napster, was participants, without the need for central coordination an example of the centralized model. Gnutella and instances (such as servers or stable hosts).Peer-to-peer Freenet, on the other hand, are examples of the networks are typically formed dynamically by ad-hoc decentralized model. Kazaa is an example of the hybrid additions of nodes. In an 'ad-hoc' network, the removal model. P2P networks are typically used for connecting of nodes has no significant impact on the network. The nodes via largely ad hoc connections. Sharing content distributed architecture of an application in a peer-to- files (see file sharing) containing audio, video, data or peer system provides enhanced scalability and service anything in digital format is very common, and real robustness. Figure shows architecture of peer-to-peers. www.ijert.org 2 International Journal of Engineering Research & Technology (IJERT) ISSN: 2278-0181 Vol. 1 Issue 6, August - 2012 time data, such as telephony traffic, is also passed using it, there is no guarantee that flooding will find a peer P2P technology. that has the desired data. Flooding also causes a high amount of signaling traffic in the network and hence A pure P2P network does not have the notion such networks typically have very poor search
Recommended publications
  • Osiris Secure Social Backup

    Osiris Secure Social Backup

    James Bown Osiris Secure Social Backup Computer Science Tripos, Part II Project St John’s College May 17, 2011 The cover page image is the hieroglyphic representation of the Ancient Egyptian god of the underworld, Osiris. His legend tells of how he was torn into pieces and later resurrected by bringing them together once again. The font used to generate this image was used with the kind permission of Mark-Jan Nederhof (http://www.cs.st-andrews.ac.uk/~mjn/). Proforma Name: James Bown College: St John’s College Project Title: Osiris – Secure Social Backup Examination: Computer Science Tripos, Part II Project Date: May 17, 2011 Word Count: 11,841 Project Originator: Malte Schwarzkopf Supervisor: Malte Schwarzkopf Original Aims of the Project To produce a distributed system enabling mutually beneficial peer-to-peer backup between groups of friends. Each user provides storage space on their personal machine for other users to back up their data. In exchange, they have the right to back up their own files onto their friends’ machines. I focus on the challenges of space efficient distribution and fault tolerant retrieval of data. The use of convergent encryption and a strict security policy maintains confidentiality of data. Work Completed All success criteria specified in the proposal have been not only fulfilled, but exceeded. I have implemented a concurrent and distributed peer-to-peer backup system that is able to send, retrieve and remove files from the network, recover from node failure or loss, and provide high security supporting convergent encryption. Finally, I have completed a number of additional extensions.
  • Henry Jenkins Convergence Culture Where Old and New Media

    Henry Jenkins Convergence Culture Where Old and New Media

    Henry Jenkins Convergence Culture Where Old and New Media Collide n New York University Press • NewYork and London Skenovano pro studijni ucely NEW YORK UNIVERSITY PRESS New York and London www.nyupress. org © 2006 by New York University All rights reserved Library of Congress Cataloging-in-Publication Data Jenkins, Henry, 1958- Convergence culture : where old and new media collide / Henry Jenkins, p. cm. Includes bibliographical references and index. ISBN-13: 978-0-8147-4281-5 (cloth : alk. paper) ISBN-10: 0-8147-4281-5 (cloth : alk. paper) 1. Mass media and culture—United States. 2. Popular culture—United States. I. Title. P94.65.U6J46 2006 302.230973—dc22 2006007358 New York University Press books are printed on acid-free paper, and their binding materials are chosen for strength and durability. Manufactured in the United States of America c 15 14 13 12 11 p 10 987654321 Skenovano pro studijni ucely Contents Acknowledgments vii Introduction: "Worship at the Altar of Convergence": A New Paradigm for Understanding Media Change 1 1 Spoiling Survivor: The Anatomy of a Knowledge Community 25 2 Buying into American Idol: How We are Being Sold on Reality TV 59 3 Searching for the Origami Unicorn: The Matrix and Transmedia Storytelling 93 4 Quentin Tarantino's Star Wars? Grassroots Creativity Meets the Media Industry 131 5 Why Heather Can Write: Media Literacy and the Harry Potter Wars 169 6 Photoshop for Democracy: The New Relationship between Politics and Popular Culture 206 Conclusion: Democratizing Television? The Politics of Participation 240 Notes 261 Glossary 279 Index 295 About the Author 308 V Skenovano pro studijni ucely Acknowledgments Writing this book has been an epic journey, helped along by many hands.
  • Defense Against the Dark Arts of Copyright Trolling Matthew As G

    Defense Against the Dark Arts of Copyright Trolling Matthew As G

    Loyola University Chicago, School of Law LAW eCommons Faculty Publications & Other Works 2018 Defense Against the Dark Arts of Copyright Trolling Matthew aS g Jake Haskell Follow this and additional works at: https://lawecommons.luc.edu/facpubs Part of the Civil Procedure Commons, and the Intellectual Property Law Commons Defense Against the Dark Arts of Copyright Trolling Matthew Sag &Jake Haskell * ABSTRACT: In this Article, we offer both a legal and a pragmaticframework for defending against copyright trolls. Lawsuits alleging online copyright infringement by John Doe defendants have accounted for roughly half of all copyright casesfiled in the United States over the past threeyears. In the typical case, the plaintiffs claims of infringement rely on a poorly substantiatedform pleading and are targeted indiscriminately at noninfringers as well as infringers. This practice is a subset of the broaderproblem of opportunistic litigation, but it persists due to certain unique features of copyright law and the technical complexity of Internet technology. The plaintiffs bringing these cases target hundreds or thousands of defendants nationwide and seek quick settlements pricedjust low enough that it is less expensive for the defendant to pay rather than to defend the claim, regardless of the claim's merits. We report new empirical data on the continued growth of this form of copyright trolling in the United States. We also undertake a detailed analysis of the legal andfactual underpinnings of these cases. Despite theirunderlying weakness, plaintiffs have exploited information asymmetries, the high cost of federal court litigation, and the extravagant threat of statutory damages for copyright infringement to leverage settlementsfrom the guilty and the innocent alike.
  • A Privacy-Preserving Decentralized Storage with Payments Based on a Blockchain

    A Privacy-Preserving Decentralized Storage with Payments Based on a Blockchain

    A Privacy-preserving Decentralized Storage with Payments Based on a Blockchain Dissertation zur Erlangung des Doktorgrades Dr. rer. nat. der Fakultat¨ fur¨ Ingenieurwissenschaften, Informatik und Psychologie der Universitat¨ Ulm Henning Johannes Gustav Kopp aus Villingen-Schwenningen 2018 Institut f¨urVerteilte Systeme Universit¨atUlm, Deutschland Amtierender Dekan: Prof. Maurits Ortmanns Gutachter: Prof. Frank Kargl Gutachter: Prof. Frederik Armknecht Tag der Promotion: 20.12.2018 Summary Recently, the paradigm of cloud storage has seen wide acceptance in industry and for personal use. One of its core principles is to outsource storage, such that users can be billed flexibly by their actual demand. However, outsourcing storage such as private data or business secrets leads to privacy problems, as control over the data is lost to the storage provider. This is intensified by the fact that often privacy is considered only as an afterthought in these systems and not integrated into the design from the beginning. Privacy-preserving alternatives to these centralized cloud storage providers are peer-to-peer systems like Freenet or GNUnet. In these systems, participants can donate storage to other users of the system. Privacy plays a vital role in these systems, as, e. g., participants are unable to access data of other users if they are not authorized to do so, even if the data of the other users resides on their own hard disk. However, these decentralized systems suffer from limited contribution due to a lack of incentives to participate. Naively enhancing these systems with the possibility of payments such that storage providers can earn money, infringes privacy, since tracing of payment flows provides links between users and their storage providers.
  • The Perfect Way by Anna Bonus Kingsford and Edward Maitland the Perfect Way Or the Finding of Christ

    The Perfect Way by Anna Bonus Kingsford and Edward Maitland the Perfect Way Or the Finding of Christ

    The Perfect Way by Anna Bonus Kingsford and Edward Maitland The Perfect Way or The Finding of Christ by Anna Bonus Kingsford and Edward Maitland Published in 1888 Boston, Mass.: ESOTERIC PUBLISHING COMPANY, 478 Shawmut Avenue. (Revised and Enlarged Edition.) Page 1 The Perfect Way by Anna Bonus Kingsford and Edward Maitland AUTHORS’ EXPLANATION These lectures were delivered in London, before a private audience, in the months of May, June, and July, 1881. The changes made in this edition calling for indication, are, – the substitution of another Lecture for No. V., and consequent omission of most of the plates; the rewriting, in the whole or part, of paragraphs 6 - 8 and 28 in No. I.; 34 - 36 in No. II.; 5 - 8, 12, 13, 22, 23, 42, 43, 54, and 55, in No. IX. (the latter paragraphs being replaced by a new one); the lengthening of Appendices II, and VI; the addition of a new Part to Appendix XIII. (formerly No. IX); and the substitution of eight new Appendices for Nos:. VII., and VIII. The alterations involve no change or withdrawal of doctrine, but only extension of scope, amplification of statement, or modification of expression. A certain amount of repetition being inseparable from the form adopted, – that of a series of expository lectures, each requiring to be complete in itself, – and the retention of that form being unavoidable, – no attempt has been made to deal with the instances in which repetition occurs. PREFACE TO THE AMERICAN EDITION In presenting an American edition of THE PERFECT WAY, or, The Finding of Christ, to the reading and inquiring public, we have been actuated by the conviction that a comprehensive textbook of the “new views,” or the restored wisdom and knowledge of the ages regarding religion or the perfect life, was imperatively required, wherein the subject was treated in a manner luminous, instructive, and entertaining, and which, without abridgement, or inferiority of material or workmanship, could yet be sold at a price that would bring the work within the means of the general public.
  • Privacy Enhancing Technologies for the Internet III: Ten Years Later

    Privacy Enhancing Technologies for the Internet III: Ten Years Later

    Privacy Enhancing Technologies for the Internet III: Ten Years Later Ian Goldberg David R. Cheriton School of Computer Science University of Waterloo Waterloo, ON [email protected] 1 Introduction In 1997 with Wagner and Brewer, and again in 2002, we looked at the then-current state of privacy-enhancing technologies (PETs) for the Internet. [27, 26] Now, in 2007, we take a third look. Technologies to help users maintain their privacy online are as important today as ever before—if not more so. Identity theft is the fastest-growing crime in the US today [47] and it is all too easy for would-be identity thieves to harvest personal information from the online trails Internet users leave every day. Losses of large databases of personal information are an almost daily occurrence [2]; for example, retailers’ servers are penetrated [44], databases are traded between government and private companies [36] and laptops containing social security numbers are stolen [35]. In 1997, we discussed the dossier effect: all available information about a person gets cross-referenced, and the resulting dossier ends up being used for many purposes, lawful and not. This practice has expanded over the years; the companies that compile and sell these dossiers are known as data brokers. Choicepoint is a prime example—in 2005, this data broker sold dossiers on over 150,000 Americans to a group of criminals. [10] The PETs we discuss here give people a way to control how much of their personal information is revealed when they use the Internet. By controlling the spread of this information, they can limit the size of the data brokers’ dossiers about them.
  • Bittorrent and Fountain Codes: Friends Or Foes?

    Bittorrent and Fountain Codes: Friends Or Foes?

    BitTorrent and fountain codes: friends or foes? Salvatore Spoto, Rossano Gaeta, Marco Grangetto, Matteo Sereno Dipartimento di informatica Università di Torino Peer to peer and file sharing applications Peer to peer paradigm has a huge diffusion nowadays [1] It can be employed for a lot of different applications: • File sharing: BitTorrent [2][3] , eDonkey, eMule, DC++ • Video Streaming : SopCast, PPLive, PPStream • Distribuited portals: Osiris • Others: Skype, Sciencenet, Spotify BitTorrent is doubtless the reference architecture for file sharing BitTorrent protocol 1 BitTorrent adopts a multi-part download scheme: File’s pieces Piece’s blocks b1 b2 b3 b4 … • The file is divided into pieces, each piece into blocks. • Peers are synchronized between them at piece level. • Each client knows what pieces have been completely downloaded from his neighbors. • Peers exchange between them piece’s blocks BitTorrent protocol 2: rarest first and tit for tat Main BitTorrent’s strategies: - Tit-for-Tat: assures reciprocity between downloading and uploading rates. - Rarest first: assures a fair distribution of file’s pieces Note that only complete pieces can be shared and distributed Many research works claim that BitTorrent has near-optimal performance [4] [5] [6] Flash crowd, high churn rates Some phenomena can cripple BitTorrent performance: • Flash crowd: many peer join or leave the network at the same time • High churn rates: peers join and leave the network at high rates Example of simulated population's dynamics in a network affected by flash • Many peer leave the overlay network at crowd and high Churn rates. the same time Modifying BitTorrent protocol 1: Luby-transform codes LT codes [7][8] are a class a fountain codes that use simple XOR operations to encode and decode the message.
  • Bittorrent Protocol the Mainline Dht

    Bittorrent Protocol the Mainline Dht

    Università degli Studi di Pisa Dipartimento di Informatica P2P Systems and Blockchains Spring 2021, instructor: Laura Ricci [email protected] Lesson 6: BITTORRENT PROTOCOL THE MAINLINE DHT 4/3/2021 Dipartimento di Informatica Laura Ricci Università degli Studi di Pisa The Bittorrent Protocol, the Mainline DHT, 1 BITTORRENT: OVERVIEW key idea: in 2002, Bran Cohen content popularity exhibits temporal locality (Flash Crowds) e.g. CNN on 9/11, new movie/game release,... goal: efficient content distribution system initially focused on distributing content efficiently, not on searching distribute the same file to all peers throughput increases with the number of downloaders an efficient use of network bandwidth single publisher, multiple downloaders later introduce also searching functionality: Kademlia has many “legal” publishers Blizzard Entertainment using it to distribute the beta of their new game Dipartimento di Informatica Laura Ricci Università degli Studi di Pisa The Bittorrent Protocol, the Mainline DHT, 2 THE CLIENT SERVER MODEL Dipartimento di Informatica Laura Ricci Università degli Studi di Pisa The Bittorrent Protocol, the Mainline DHT, 3 BITTORRENT IN A NUTSHELL more nodes can serve the content, not only one server needs a mechanism to detect which node is currently providing the content introducing the tracker taking trace of who is currently providing the content Joe connects to the tracker announcing the content the tracker now knows Joe is providing the file only for a better visualization nodes are arranged
  • Randomness, Age, Work: Ingredients for Secure Distributed Hash Tables

    Randomness, Age, Work: Ingredients for Secure Distributed Hash Tables

    Università degli Studi di Padova Departimento di Ingegneria dell’Informazione TESI DI DOTTORATO Randomness, Age, Work: Ingredients for Secure Distributed Hash Tables Dottorando: Vincenzo-Maria Cappelleri Supervisore: Prof. Enoch Peserico Direttore della Scuola: Prof. Matteo Bertocco Coordinatore d’indirizzo: Prof. Carlo Ferrari January 31st, 2017 i Preface My journey among distributed systems began when I was an under- graduate student. Since then I became immensely fascinated from their aesthetically pleasing complexity, especially when dealing with spontaneous networks. The enormous number of things that can go wrong, the variety of the machines hosting their instances, it all reminds me of the complexity in human society. The security problems affecting these contraptions however has always deeply bugged me. With this work, even in its simplicity, I hope to offer the community yet another idea on how to puta patch on it. Stylistically, this dissertation is written using the plural noun. In “The Sybil Attack” Douceur wrote: “Use of the plural pronoun is customary even in solely authored research papers; however, given the subject of the present paper, its use herein is particularly ironic”. For the importance that his work had on all my endeavor, I thought it was appropriate to join in this little joke. I’ve never been good at inscriptions. Nonetheless my gratitude goes to friends and family and, albeit I will not explicitly write their names, they definitely know my thoughts are for them asI write these few lines. Vincenzo-Maria Cappelleri Padova January 31st, 2017 ii Abstract Distributed Hash Tables (DHTs) are a popular and natu- ral choice when dealing with dynamic resource location and routing.
  • Architecture of P2P Systems

    Architecture of P2P Systems

    Architecture of P2P systems Peer-to-peer systems often implement an abstract overlay network, built at Application Layer, on top of the native or physical network topology. Such overlays are used for indexing and peer discovery and make the P2P system independent from the physical network topology. Content is typically exchanged directly over the underlying Internet Protocol (IP) network. Anonymous peer-to-peer systems are an exception, and implement extra routing layers to obscure the identity of the source or destination of queries. In structured peer-to-peer networks, peers (and, sometimes, resources) are organized following specific criteria and algorithms, which lead to overlays with specific topologies and properties. They typically use distributed hash table-based (DHT) indexing, such as in the Chord system (MIT).[2] Unstructured peer-to-peer networks do not impose any structure on the overlay networks. Peers in these networks connect in an ad-hoc fashion[3]. Ideally, unstructured P2P systems would have absolutely no centralized system, but in practice there are several types of unstructured systems with various degrees of centralization. Three categories can easily be seen. In pure peer-to-peer systems the entire network consists solely of equipotent peers. There is only one routing layer, as there are no preferred nodes with any special infrastructure function. Hybrid peer-to-peer systems allow such infrastructure nodes to exist, often called supernodes.[4] . In centralized peer-to-peer systems, a central server is used for indexing functions and to bootstrap the entire system. Although this has similarities with a structured architecture, the connections between peers are not determined by any algorithm.
  • A Discussion on the Ethical Issues in Peer-To-Peer Network Monitoring

    A Discussion on the Ethical Issues in Peer-To-Peer Network Monitoring

    A Discussion on the Ethical Issues in Peer-to-Peer Network Monitoring Nicolas Small, James Meneghello, Kevin Lee, Nazanin Sabooniha, Raymond Schippers School of Information Technology, Murdoch University, Murdoch 6150, Western Australia, Australia Abstract—Peer-to-peer networks have gained a significant monitoring. In Section IV the paper discusses the ethical im- amount of popularity since their inception, being used in a plications of researching and performing peer-to-peer network wide variety of contexts; both legal and illegal. The demand monitoring. Section V discusses these issues in the context of a for monitoring techniques able to analyse performance, identify copyright infringers and detect the presence of peer-to-peer case study of the monitoring of several Peer-to-Peer protocols. traffic on networks has similarly risen. Along with them ethical Finally, Section VI presents some conclusions. issues have surfaced, awareness of which is essential when planning research requiring peer-to-peer monitoring. This paper II. PEER-TO-PEER NETWORKS discusses the collection of data through the monitoring of peer-to- Peer-to-Peer (P2P) is a style of network architecture in peer networks and identifies areas of particular ethical concern in its use. which participants each share a part of their resources (storage capacity, bandwidth, processing power, etc.) for the purpose I. INTRODUCTION of operating in collaboration to achieve a specific task. Each node in the network should be capable of supplying services Peer-to-peer networks constitute a significant amount of or content directly with other nodes, without communications Internet traffic present on today’s networking infrastructure being required to pass through intermediary servers [7].

  • Distributed Social Platforms for Confidentiality and Resilience

    Distributed Social Platforms for Confidentiality and Resilience Enrico Franchi, Michele Tomaiuolo University of Parma, Italy ABSTRACT Social networking sites have deeply changed the perception of the web in the last years. Although the current approach to build social networking systems is to create huge centralized systems owned by a single company, such strategy has many drawbacks, e.g., lack of privacy, lack of anonymity, risks of censorship and operating costs. These issues contrast with some of the main requirements of information systems, including: (i) confidentiality, i.e., the interactions between a user and the system must remain private unless explicitly public; (ii) integrity; (iii) accountability; (iv) availability; (v) identity and anonymity. Moreover, social networking platforms are vulnerable to many kind of attacks: (i) masquerading, which occurs when a user disguises his identity and pretends to be another user; (ii) unauthorized access; (iii) denial of service; (iv) repudiation, which occurs when a user participates in an activity and later claims he did not; (v) eavesdropping; (vi) alteration of data; (vii) copy and replay attacks; and, in general, (viii) attacks making use of social engineering techniques. In order to overcome both the intrinsic defects of centralized systems and the general vulnerabilities of social networking platforms, many different approaches have been proposed, both as federated (i.e., consisting of multiple entities cooperating to provide the service, but usually distinct from users) or peer-to-peer systems (with users directly cooperating to provide the service); in this work we reviewed the most interesting ones. Eventually, we present our own approach to create a solid distributed social networking platform consisting in a novel peer-to-peer system that leverages existing, widespread and stable technologies such as distributed hash tables and BitTorrent.