PPT-A Routing Extension for HELD

draftwinterbottomecritprivloc04 James Winterbottom Hannes Tschofenig Laura Liess Motivation and Scope Location on its own is not good enough to get an emergency call to where it needs to go. 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 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:. . Wireless Mesh Networks. A. Bhorkar. University Qualifying Examination. University of California, San Diego. Motivation. 2. Wireless Mesh Networks. . Characteristics. :. Fixed, unlimited energy, virtually unlimited processing power. Distance Vector and Link State. RIP. OSPF. Internet Routing. IP implements datagram forwarding. Both hosts and routers. Have an IP module. Forward datagrams. IP forwarding is table-driven. Table known as routing table. 2. Multicasting. Multicast communications refers to one-to-many or many-to-many communications. . IP Multicasting refers to the implementation of multicast communication in the Internet. Multicast is driven by receivers: Receivers indicate interest in . 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…. 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 with Expanding Roles . 2. Flow of Seminar. Introduction . Concept of Extension-plus . Key elements of Extension-plus. Extension –Extension plus: key shift . Research studies. Conclusion. . Government initiatives . 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?.