PPT-Routing Around Decoys Max Schuchard, John Geddes,

Christopher Thompson Nicholas Hopper Proposed in FOCI11 USINIX Security11 and CCS11 Presented by Aman Goel Decoy Routing and its adversary Decoy routing a new approach against web censorship. e making routing decision It should process properties like correctness simplici ty robustness stability fairness and optimality Note optimality is always with re spect to chosen criterion Optimality principle if router is on optimal path from rout umnedu John Geddes geddescsumnedu Christopher Thompson cthompsoncsberkeleyedu Nicholas Hopper hoppercsumnedu 1 Department of Computer Science and Engineering Univers ity of Minnesota Twin Cities 2 Department of Electrical Engineering and Computer umnedu John Geddes geddescsumnedu Christopher Thompson cthompsoncsberkeleyedu Nicholas Hopper hoppercsumnedu 1 Department of Computer Science and Engineering Univers ity of Minnesota Twin Cities 2 Department of Electrical Engineering and Computer Michael . Schapira. (Yale University . and . UC Berkeley). Joint work with . Yaping. Zhu . and . Jennifer Rexford . (Princeton University). Once Upon a Time… . Internet Inter-Network Routing:. . DeHart. Computer Science & Engineering. Washington University. . www.arl.wustl.edu. GEC-10: . Slick Packets. Demonstration. Slick Packets. Source-Controlled Routing Architecture. Designed by Brighten Godfrey’s group at U. Illinois. VANETs. SAMEERA SIDDIQUI. PhD STUDENT. UNIVERSITY OF OTTAWA. 0. Introduction . Problems in Routing Procedures. Classification Of Routing Protocols. Taxonomy of Previous Literature. Objective of the Project. Michael . Schapira. Joint work with . Yaping. Zhu . and . Jennifer Rexford. (Princeton University). Once Upon a Time… . Internet Inter-Network Routing:. . Small network. Single administrative entity. Framework . documents. Joel Halpern. IETF 84 . – Routing Area Open Meeting. 1. Drafts included. draft-atlas-irs-problem-statement-00. draft-ward-irs-framework-00. draft-atlas-irs-policy-framework-00. Addressing routing scalability issues. NSF Ignite Project . 1. Routing protocol challenges . All Routing . P. rotocols face. S. calability issues – dependency on network size. Flooding on information changes. Alexander Nadel . Intel, Israel. FMCAD. Mountain View CA, USA. October 4, 2016. 1. 2. ". PhysicalDesign. " by Linear77 - Own work. Licensed under CC BY 3.0 via . Wikimedia . Commons - https://commons.wikimedia.org/wiki/File:PhysicalDesign.png#/media/File:PhysicalDesign.png. Read the TexPoint manual before you delete this box.: . A. A. A. A. A. Application of the Week: Games / Art. Uncountable possibilities, below, e.g., a beer coaster that can interact with other coasters…. Presented by :. Pallavi Kasula. Background. Autonomous systems (AS). Border Gateway Protocol (BGP). Internet Censorship. Decoy Routing. Routing Around Decoys(RAD). Autonomous System(AS). Internet . Comprises of interconnected Autonomous Systems. Routing Distance Vector (DV) Routing Sets up minimum distance routes to all nodes in a network Routing tables created at each node with following fields: The core algorithm is based on ‘ Bellman Ford shortest path algorithm Geoff Huston. APNIC. The Internet’s routing system works by rumour. “I tell you what I know, and you tell your mates, and your mates tell their mates, and …”. But what if I tell you a lie? . Or someone maliciously alters what I’m trying to tell you?.