DOCSLIB.ORG

Censorship-Resistant Collaboration with a Hybrid DTN/P2P Network

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Censorship-Resistant Collaboration with a Hybrid DTN/P2P Network Censorship-resistant Collaboration with a Hybrid DTN/P2P Network Masterarbeit von Philipp Hagemeister aus Braunschweig vorgelegt am Lehrstuhl fur¨ Rechnernetze und Kommunikationssysteme Prof. Dr. Martin Mauve Heinrich-Heine-Universitat¨ Dusseldorf¨ Marz¨ 2012 Acknowledgments My thanks go to Marc Fontaine for asking stupid questions that turned out to be quite clever, and for pointing out that correctness is essential both in the real and the physical world. I also thank Paul Baade for demanding impossible features which turned out to be the last piece in the puzzle. Julius Rommler¨ has notified me of orthographical, typographical, and (inadvertently) semantical er- rors. And told me to use fewer big words. Thanks! I wish to thank Denis Lutke-Wiesmann¨ for proofreading the thesis, and the footnotes. Sven Hager found lots of overly short, overly long, and overly wrong statements. Thanks! Thanks to Prof. Martin Mauve for coming up with the idea, shielding us from bureaucracy, asking for explanation and rationale at every step, and finding all the errors nobody else found. iii Contents List of Figures viii 1 Motivation 1 1.1 Distribution of Speech . .2 1.2 Threat Model . .2 1.2.1 Nontechnical Attacks . .2 1.2.2 Internet Access . .3 1.2.3 Control over the User’s Computer . .4 1.2.4 Total Shutoff . .4 1.2.5 Physical Attacks . .5 1.2.6 IP Blocking . .5 1.2.7 DNS censorship . .6 1.2.8 Deep Packet Inspection . .6 1.2.9 Active Attacks . .8 1.2.10 Conclusions . .9 1.3 Decentralization . 10 1.4 Collaboration . 10 1.5 Structure of this Thesis . 11 2 Components 12 2.1 Peer-To-Peer Networks . 13 2.1.1 Bootstrapping . 13 2.1.2 NAT Traversal . 16 2.1.3 Broadcasting . 17 2.1.4 Integration Notes . 18 2.2 Delay-Tolerant Networks . 19 2.2.1 Integration Notes . 20 2.3 Security . 21 2.3.1 Trust Models . 22 2.3.2 Integration Notes . 24 2.4 Anonymization Networks . 27 v Contents 2.4.1 Mix networks . 29 2.4.2 Hidden services . 31 2.4.3 Common implementations . 32 2.4.4 Integration Notes . 34 2.5 Revision Control . 36 2.5.1 Centralized Revision Control . 37 2.5.2 Graph-based Distributed Revision Control . 37 2.5.3 Excursus: Content-Addressable Storage . 39 2.5.4 P2P Revision Control . 41 2.5.5 Patch-based Distributed Revision Control . 41 2.5.6 Document-oriented Database Systems . 42 2.5.7 Integration Notes . 43 3 Architecture 44 3.1 Implementation Architecture . 45 3.1.1 Finding Project Nodes . 48 3.2 Applications and Projects . 48 3.2.1 Project Structure . 48 3.2.2 The ProjectListApplication . 50 3.2.3 Application Services . 51 3.2.4 Revision Control Application Services . 51 3.2.5 Interaction with the Application Core . 53 3.2.6 Policy Drafting Application . 53 3.2.7 Write Authorization . 54 3.2.8 Read Authorization . 55 3.3 Transports . 56 3.4 Web Application . 57 3.4.1 Server Fallback . 58 3.4.2 Preventing Malicious Fallback Servers . 59 3.4.3 Offline Web Applications . 60 3.4.4 Client-Side Web Applications . 61 4 Implementation 63 5 Conclusion 65 5.1 Future Work . 66 5.1.1 General . 66 5.1.2 P2P . 66 5.1.3 DTN . 67 vi Contents 5.1.4 Security . 67 5.1.5 Version Control . 67 5.1.6 Anonymization Networks & Transports . 67 5.1.7 Web Application . 68 5.1.8 User Interface . 68 Bibliography 69 vii List of Figures 1.1 Screenshot of a packet dump of two HTTP requests to pku.edu.cn, the latter of which is terminated by an injected TCP RST packet (in red) . .8 2.1 Crude broadcasting in an unstructured vs optimal broadcasting in a structured P2P network . 17 2.2 Model of an anonymization network. The attacker can intercept an encrypted version of the traffic between sender and first node, encrypted traffic that goes to one of the nodes in the network as well as plain traffic between exit node and receiver. 27 2.3 Terms in a Revision Graph. Note that the revision identifiers are for illustrative pur- poses only. 36 2.4 Merging different versions of a branch in a graph-based distributed revision control system. 38 2.5 Screenshot of the revision graph after simplistic automated merging with git. 39 2.6 git’s usage of content-addressable storage. The content of the blocks is shown inside the rectangle, and the hash of the content at the lower right of each rectangle. The arrows visualize the relations between the blocks, but are not explicitly stored by the CAS, but a function of the content. 40 3.1 High-level overview of the architecture . 44 3.2 Overview of the Implementation Architecture . 45 3.3 Project header . 49 3.4 Example block database state. The content of the blocks has been simplified; in prac- tice, each block content contains the file name, revision id, and the content of the file at that revision. 52 3.5 Example optimized listRoot answer . 52 3.6 Detail view of the transports in the implementation architecture . 57 3.7 User interface for server fallback . 59 3.8 Fallback verification model . 60 4.1 Screenshot of the policy drafting application. 64 4.2 Screenshot of the configuration of a DTN endpoint. 64 viii Chapter 1 Motivation Development of policies such as laws, political manifestos, examination regulations, articles, source code, and any other form of speech1 can be greatly enhanced by computer supported cooperative work systems. Unfortunately, speech – especially if political – faces attempts to censor or suppress it all over the world. The 2011 ”Freedom in the World” report of Freedomhouse[Pud11] rates 47 countries (with one third of the world population) as ”Not Free”. In these countries, people are denied basic civil liberties such as political participation. Similarly, the Amnesty International Report 2011[FIS11] mentions serious restrictions on freedom of speech and political participation in 48 countries (about 40% of the world’s population). Unsurprisingly, efforts have been made to censor computer-supported speech alongside more tradi- tional censorship methods. Freedomhouse’s Freedom On The Net Report 2011 [KCU11] rates 11 countries (with one quarter of the world population) as ”Not Free”, indicating that experts reported significant restrictions on access to and providers of controversial information. The OpenNet Initia- tive, which automatically measures availability of ”provocative” and ”objectionable” resources instead of relying on human expertise, confirms these assessments by finding significant censorship of these resources in 13 countries (with one quarter of the world population), and any censorship in 42 (60% of the population) in recent measurements[oni11]. Technology should resist censorship and allow free speech whenever possible. In fact, one could argue that free speech is needed the most in the face of censorship. Enabling censorship-resistant free speech has its downsides: The same technology that can be used to debate about democracy or draft an appeal for human rights can be used to foster racism or create a terrorist manifesto2. While 1In this thesis, speech is used in the legal sense, as an umbrella term for any distribution and development of potentially objectionable content. 2Although as scientists, we hope formal analyzers can find and point out fallacies in extremist thought. 1 Chapter 1 Motivation these usage scenarios cannot be prevented without centralized control, I assume that the benefits of unfettered speech outweigh their downsides. The goal of this thesis is to develop a framework which allows collaboration in the face of govern- mental censorship, and implement a prototype. 1.1 Distribution of Speech Current systems for delivering speech include traditional media (e.g. television, newspapers) as well as internet-based services. Traditional media requires significant infrastructure and easily controllable delivery channels (relatively large parts of the radio spectrum and significant transportation vehi- cles/personnel, respectively) and is therefore owned or tightly controlled in non-democratic countries. In democratic countries, the huge barriers to entry can facilitate a concentration of media ownership, which, while not governmental, may impede or.
Load more

Recommended publications
  • Anonsocialmix: Anonymous P2P File Sharing Over Social Networks
    AnonSocialMix: Anonymous P2P File Sharing Over Social Networks Student Name: Rajdeep Mukherjee IIIT-D-MTech-CS-GEN-MT15051 July, 2017 Indraprastha Institute of Information Technology New Delhi Thesis Committee Dr. Sambuddho Chakravarty, IIIT Delhi (Advisor) Dr. Tanmoy Chakraborty, IIIT Delhi (Internal Examiner) Dr. Vinay Joseph Ribeiro, IIT Delhi (External Examiner) Submitted in partial fulfillment of the requirements for the Degree of M.Tech. in Computer Science, in Information Security Category ©2017 IIIT-D MTech-CS-GEN-17-MT15051 All rights reserved Certificate This is to certify that the thesis titled “AnonSocialMix: Anonymous P2P File Sharing Over Social Networks" submitted by Rajdeep Mukherjee for the partial fulfillment of the requirements for the degree of Master of Technology in Computer Science & Engineering is a record of the bonafide work carried out by him under my guidance and supervision in the Security and Privacy group at Indraprastha Institute of Information Technology, Delhi. This work has not been submitted anywhere else for the reward of any other degree. Dr.Sambuddho Chakravarty Indraprastha Institute of Information Technology, New Delhi 2 Abstract Peer-to-peer (P2P) file sharing accounts for one of the major sources of the Internet traffic. As privacy and anonymity issues continue to grow due to constant censorship and network surveil- lance, more and more Internet users are getting attracted towards the facilities for anonymous communication. Extensive research has been conducted over the years towards the design and development of several anonymous P2P file sharing protocols and systems. Size of the Anonymity Set plays a crucial role in determining the degree of anonymity being provided by such networks.
    [Show full text]
  • IPFS and Friends: a Qualitative Comparison of Next Generation Peer-To-Peer Data Networks Erik Daniel and Florian Tschorsch
    1 IPFS and Friends: A Qualitative Comparison of Next Generation Peer-to-Peer Data Networks Erik Daniel and Florian Tschorsch Abstract—Decentralized, distributed storage offers a way to types of files [1]. Napster and Gnutella marked the beginning reduce the impact of data silos as often fostered by centralized and were followed by many other P2P networks focusing on cloud storage. While the intentions of this trend are not new, the specialized application areas or novel network structures. For topic gained traction due to technological advancements, most notably blockchain networks. As a consequence, we observe that example, Freenet [2] realizes anonymous storage and retrieval. a new generation of peer-to-peer data networks emerges. In this Chord [3], CAN [4], and Pastry [5] provide protocols to survey paper, we therefore provide a technical overview of the maintain a structured overlay network topology. In particular, next generation data networks. We use select data networks to BitTorrent [6] received a lot of attention from both users and introduce general concepts and to emphasize new developments. the research community. BitTorrent introduced an incentive Specifically, we provide a deeper outline of the Interplanetary File System and a general overview of Swarm, the Hypercore Pro- mechanism to achieve Pareto efficiency, trying to improve tocol, SAFE, Storj, and Arweave. We identify common building network utilization achieving a higher level of robustness. We blocks and provide a qualitative comparison. From the overview, consider networks such as Napster, Gnutella, Freenet, BitTor- we derive future challenges and research goals concerning data rent, and many more as first generation P2P data networks, networks.
    [Show full text]
  • A Transport Layer Abstraction for Peer-To-Peer Networks Ronaldo A
    A Transport Layer Abstraction for Peer-to-Peer Networks Ronaldo A. Ferreira, Christian Grothoff and Paul Ruth Department of Computer Sciences Purdue University g frf,grothoff,ruth @cs.purdue.edu http://www.gnu.org/software/GNUnet/ B Abstract— The initially unrestricted host-to-host communica- same peer-to-peer network. In fact, two peers A and may tion model provided by the Internet Protocol has deteriorated want to use differentmodes of communicationon the same link. due to political and technical changes caused by Internet growth. For example, suppose node B is behind a NAT box and cannot While this is not a problem for most client-server applications, peer-to-peer networks frequently struggle with peers that are be reached directly via UDP or TCP. In a system with multiple only partially reachable. We describe how a peer-to-peer frame- transport protocols, A could initiate a connection by sending an B A work can hide diversity and obstacles in the underlying Internet e-mail to B (SMTP) and then have contact via TCP, al- and provide peer-to-peer applications with abstractions that hide lowing A to continue further communication on a bidirectional transport specific details. We present the details of an implemen- TCP connection. tation of a transport service based on SMTP. Small-scale bench- marks are used to compare transport services over UDP, TCP, and We will use GNUnet as our reference peer-to-peer system, SMTP. but it should be clear that the idea of a transport abstraction can be applied to other systems. GNUnet is a peer-to-peer frame- work whose main focus is on security [1], [5].
    [Show full text]
  • Recognition and Investigation of Listening in Anonymous Communication Systems 1 K
    AEGAEUM JOURNAL ISSN NO: 0776-3808 Recognition and investigation of listening in anonymous communication systems 1 K. Balasubramanian, 2 Dr. S. Kannan, 3 S. Sharmila 1Associate Professor, Department of CSE, E.G.S Pillay Engineering College, Nagapattinam, Tamil Nadu, India. Email: [email protected] 2, Professor, Department of CSE, E.G.S Pillay Engineering College, Nagapattinam, Tamil Nadu, India. 3, P.G Student, Department of CSE, E.G.S Pillay Engineering College, Nagapattinam, Tamil Nadu, India. Abstract components through which client activity is steered can Mysterious correspondence systems similar to listen in and get delicate information, for example, user Tor, mostly secure the secrecy of client activity by verification qualifications. This circumstance can scrambling all interchanges inside the overlay system. conceivably decline when clients utilize intermediary based frameworks to get to similar administrations However, when the transferred activity achieves the without utilizing end-to-end encryption, as the quantity limits of the system, toward its end, the first client of hosts or hubs that can listen stealthily on their activity is definitely presented to the last node on the movement increments. Different open and private path. Accordingly, users sending sensitive information, systems may square access to interpersonal interaction similar to verification accreditations, over such and other prominent online administrations for systems, risk having their information between different reasons. Under these conditions, users accepted and uncovered, unless end-to-end encryption regularly depend on utilizing disseminated proxying frameworks to prevent their activity from being is utilized. Listening can be performed by malicious or filtered. They fall back on such mechanisms so as to compromised relay nodes, and additionally any rebel evade system activity filtering in light of source, goal, arrange substance on the way toward the actual end.
    [Show full text]
  • Tools for Breaking out of PRISM
    Tools for Breaking out of PRISM Christian Grothoff The GNUnet Project \Never doubt your ability to change the world." {Glenn Greenwald Everybody Has Secrets I Business & Trade Secrets I Political opinions I Illegal activities Send everything to US in plaintext Keeping Secrets I Encryption: baseline I Hide meta-data: state of the art I Practice today? Keeping Secrets I Encryption: baseline I Hide meta-data: state of the art I Practice today? Send everything to US in plaintext I PRISM enables real-time surveillance and access to stored content I Data collected: E-mails, instant messages, videos, photos, stored data (likely files), voice chats, file transfers, video conferences, log-in times, and social network profiles I Tiny part of NSA: $20 M budget I Guardian: \The PRISM program allows the intelligence services direct access to the companies servers." I Cooperating providers: Microsoft, Yahoo, Google, Facebook, PalTalk, YouTube, Skype, AOL, Apple I Guardian: \The PRISM program allows the intelligence services direct access to the companies servers." I Cooperating providers: Microsoft, Yahoo, Google, Facebook, PalTalk, YouTube, Skype, AOL, Apple I PRISM enables real-time surveillance and access to stored content I Data collected: E-mails, instant messages, videos, photos, stored data (likely files), voice chats, file transfers, video conferences, log-in times, and social network profiles I Tiny part of NSA: $20 M budget US discussion focuses on spying on US citizens and legality under US law. Frank Church (D-Idaho): \The NSA's capability at any
    [Show full text]
  • Social Network Based Anonymous Communication in Tor Peng Zhou, Xiapu Luo, Ang Chen, and Rocky K
    1 STor: Social Network based Anonymous Communication in Tor Peng Zhou, Xiapu Luo, Ang Chen, and Rocky K. C. Chang Department of Computing, The Hong Kong Polytechnic University, Hunghom, Hong Kong cspzhouroc,csxluo,csachen,csrchang @comp.polyu.edu.hk f g Abstract—Anonymity networks hide user identities with the help of relayed anonymity routers. However, the state-of-the-art anonymity networks do not provide an effective trust model. As a result, users cannot circumvent malicious or vulnerable routers, thus making them susceptible to malicious router based attacks (e.g., correlation attacks). In this paper, we propose a novel social network based trust model to help anonymity networks circumvent malicious routers and obtain secure anonymity. In particular, we design an input independent fuzzy model to determine trust relationships between friends based on qualitative and quantitative social attributes, both of which can be readily obtained from existing social networks. Moreover, we design an algorithm for propagating trust over an anonymity network. We integrate these two elements in STor, a novel social network based Tor. We have implemented STor by modifying the Tor’s source code and conducted experiments on PlanetLab to evaluate the effectiveness of STor. Both simulation and PlanetLab experiment results have demonstrated that STor can achieve secure anonymity by establishing trust-based circuits in a distributed way. Although the design of STor is based on Tor network, the social network based trust model can be adopted by other anonymity networks. Index Terms—Social Network, Anonymous Communication, Tor, Fuzzy Model F 1 INTRODUCTION alone can be easily bypassed by an attacker.
    [Show full text]
  • Technology Stack for Decentralized Mobile Services
    Technology Stack for Decentralized Mobile Services Matouš Skála Technology Stack for Decentralized Mobile Services by Matouš Skála to obtain the degree of Master of Science at the Delft University of Technology, to be defended publicly on Monday August 31, 2020 at 3:00 PM. Student number: 4893964 Project duration: November 15, 2019 – August 31, 2020 Thesis committee: Dr.ir. J.A. Pouwelse, TU Delft, supervisor Dr. J.S. Rellermeyer, TU Delft Dr. N. Yorke-Smith, TU Delft An electronic version of this thesis is available at http://repository.tudelft.nl/. Preface When I was choosing my thesis topic, I originally came up with an idea of designing a decen- tralized social network. After realizing how ambitious that goal was, I later decided to focus on more fundamental issues first and create a library that would allow for building any de- centralized applications, running purely on an overlay network consisting of smartphones. Rather than reinventing the wheel, I took inspiration from an existing networking library de- veloped at TU Delft over the last decade and created its wire-compatible implementation in Kotlin. Interestingly, in the end, I have even implemented a trivial social network to demon- strate the usage of the library, returning back to the original idea. I would like to thank my supervisor Johan Pouwelse for an endless stream of fresh ideas and valuable feedback, and to PhD students of the Delft Blockchain Lab for numerous coffee meetings and for serving me as a walking documentation of the existing codebase. Matouš Skála Prague,
    [Show full text]
  • Copyright Assignment Agreement for Contributors to GNU Taler
    Copyright Assignment Agreement for Contributors to GNU Taler Between: GNUnet e.V., a German association of GNUnet developers registered in München and seated in Garching bei München, represented by an authorized currently elected representative of the GNUnet e.V. Vorstand, hereinafter refer- red to as GNUnet e.V., And: hereinafter referred to as the Contributor. IT HAVING BEEN PREVIOUSLY ESTABLISHED: • That the GNU Taler project is directed and supported by GNUnet e.V., which aims to develop the GNU Taler software as part of the GNU project, distributed under GNU licenses (GNU Aero GPL, GNU GPL v3+, GNU LGPL) on the date of signing of this contract; • That this development project is opened to contributions submitted by individuals outside of GNUnet e.V., contributions which may be ocially submitted by their holder to GNUnet e.V. for the purpose of being integrated by the latter into the GNU Taler software, in successive versions edited and distributed by GNUnet e.V. or the GNU project; • That GNUnet e.V. wishes, in this context, to centralize copyright ownership on any new contribution integrated into the GNU Taler software edited and distributed by it; • That the Contributor wishes to participate, or authorize its personnel to participate, in the development of the aforementioned software; • That GNUnet e.V. has a publicly available licensing and collaborative development agree- ment with Taler Systems S.A. enabling Taler Systems S.A. to productize GNU Taler as a free software project subject to licensing constraints compatible with those imposed on GNUnet e.V. and granted to GNUnet e.V.
    [Show full text]
  • Unveiling the I2P Web Structure: a Connectivity Analysis
    Unveiling the I2P web structure: a connectivity analysis Roberto Magan-Carri´ on,´ Alberto Abellan-Galera,´ Gabriel Macia-Fern´ andez´ and Pedro Garc´ıa-Teodoro Network Engineering & Security Group Dpt. of Signal Theory, Telematics and Communications - CITIC University of Granada - Spain Email: [email protected], [email protected], [email protected], [email protected] Abstract—Web is a primary and essential service to share the literature have analyzed the content and services offered information among users and organizations at present all over through this kind of technologies [6], [7], [2], as well as the world. Despite the current significance of such a kind of other relevant aspects like site popularity [8], topology and traffic on the Internet, the so-called Surface Web traffic has been estimated in just about 5% of the total. The rest of the dimensions [9], or classifying network traffic and darknet volume of this type of traffic corresponds to the portion of applications [10], [11], [12], [13], [14]. Web known as Deep Web. These contents are not accessible Two of the most popular darknets at present are The Onion by search engines because they are authentication protected Router (TOR; https://www.torproject.org/) and The Invisible contents or pages that are only reachable through the well Internet Project (I2P;https://geti2p.net/en/). This paper is fo- known as darknets. To browse through darknets websites special authorization or specific software and configurations are needed. cused on exploring and investigating the contents and structure Despite TOR is the most used darknet nowadays, there are of the websites in I2P, the so-called eepsites.
    [Show full text]
  • Privacy-Preserving P2P Data Sharing with Oneswarm
    Privacy-Preserving P2P Data Sharing with OneSwarm Tomas Isdal Michael Piatek Arvind Krishnamurthy Thomas Anderson University of Washington ABSTRACT On one side, protocols like BitTorrent are high performance and Privacy—the protection of information from unauthorized disclo- robust, but participants are easily monitored by anyone who cares sure—is increasingly scarce on the Internet. The lack of privacy to look [33, 30, 29]. On the other, anonymization networks (e.g., is particularly true for popular peer-to-peer data sharing applica- Tor [14] and Freenet [12]) emphasize privacy, but offer compara- tions such as BitTorrent where user behavior is easily monitored by tively poor performance. third parties. Anonymizing overlays such as Tor and Freenet can In this paper, we explore a new design point in this tradeoff be- improve user privacy, but only at a cost of substantially reduced tween privacy and performance. We describe the design and imple- performance. Most users are caught in the middle, unwilling to mentation of a file-sharing protocol called OneSwarm, intended to sacrifice either privacy or performance. provide much better performance than Tor and Freenet, and much In this paper, we explore a new design point in this tradeoff be- better privacy than BitTorrent. Our goal is to provide good enough tween privacy and performance. We describe the design and imple- performance that users turn on privacy by default for all of their mentation of a new P2P data sharing protocol, called OneSwarm, non-public data sharing. To this end, data objects shared via One- that provides users much better privacy than BitTorrent and much Swarm are located and transferred using disposable, temporary ad- better performance than Tor or Freenet.
    [Show full text]
  • Let's Make a GNU One! P≡P Privacy by Default
    Speaker GNUnet.org IRC:sva [email protected] twitter@sva Let's make a GNU one! p≡p Privacy by Default. GNUnet 1970/80: Internet v1.0. Wow, I can access your computer, you can check out mine! Awesome! 2010/20: Internet v1.1. Sure I can access other computers and use their services. Wait, What? hey can also access mine!? 2025/30: Internet v2.0. "nd-to#end encryption and anonymi$ation of the ways data flows. p≡p Privacy by Default. Whats the problem of v1.1.? Network knows & learns too much Insecure de%au!ts & high comp!exities )entrali$ed components *e.g. IANA, ICANN, DNS, …) Administrators can be a target! /isuse of those flaws happens a!! over! p≡p Privacy by Default. Idea 0GNUnet is a mesh routing layer %or end#to#end encrypted networking and a %ramework %or distri.uted applications designed to replace the old insecure Internet protocol stack.1 GNUnet.org *%ounded 2332, %ollowed in academia) p≡p Privacy by Default. Layers *very hard- simplified version of the Internet: Google, FB ' Co +NS9:.;3< )=9U+= I=9BG= "thernet Physical Layer p≡p Privacy by Default. Layers Internet: GNUnet6 Google, FB & Co ... +NS/X.;3< ... )=9U+= ... I=/BGP ... "thernet ... =hysical Layer ... p≡p Privacy by Default. Layers Internet: GNUnet6 Google, FB & Co ... +NS/X.;3< ... )=9U+= ... I=/BGP ... "thernet ... =hysical Layer > =S/TCP9WLAN/... p≡p Privacy by Default. Layers GNUnet6 Start with what we have: ... e.g. )=, U+=, S/ =, H =, H =S, WLAN, Bluetooth, ,. ... Unreliable, out-o%-order packet ... delivery semantics. ... Automated ransport Selection *ATS- decides.
    [Show full text]
  • Achieving Optimal Capacity Partitioning in P2P Networks Using Game and Control Theoretic Approaches
    Achieving Optimal Capacity Partitioning in P2P Networks using Game and Control Theoretic Approaches A thesis submitted in fulfilment of the requirements for the degree of PhD by Nitin Singh Singha DEPARTMENT OF ELECTRICAL ENGINEERING INDIAN INSTITUTE OF TECHNOLOGY KANPUR March 2018 ii Synopsis Name of the student: Nitin Singh Singha Roll No: 13104180 Degree for which submitted: PhD Department: Electrical Engineering Thesis title: Achieving Optimal Capacity Partitioning in P2P Networks using Game and Control Theoretic Approaches Thesis supervisor: Dr. Yatindra Nath Singh Month and year of thesis submission: March 2018 Traditionally Peer-to-Peer (P2P) network users use wired network technology like LAN for accessing the Internet. However nowadays, wireless technology can pro- vide high speed data service at lower costs. This has led to widespread use of wireless technology in office, home and hotels to provide Internet connectivity. Further, wireless technology is also being used to provide Internet services in public places like airports, railway stations and restaurants etc. Therefore, many P2P users are now using wireless networks like WiFi, WLAN, LTE and WiMAX (in time division duplex (TDD) mode), where nodes are connected to the backbone network through an access link. The uplink and downlink data flows through the same access link. The access link capacity is fixed, but its partitioning between uplink and downlink can be varied by a user such that increasing upload capacity reduces download capacity and vice-versa. In a P2P network, since users act both as a server and a client, so they need to simultaneously utilize their upload and download capacities, optimally.
    [Show full text]