PPT-Introduction to IP Routing

Geoff Huston Routing How do packets get from A to B in the Internet A B Internet Connectionless Forwarding Each router switch makes a LOCAL decision to forward the packet towards B A B R1. 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:. . Local Number Portability:. What VoIP Providers Need to Know. Wednesday. October 14, 2009. Astricon. 2009 – Glendale, AZ. Jim.Dalton@TransNexus.com. Why VoIP Service Providers Need Number Portability. Wireshark. Rahul. Hiran. TDTS11:Computer Networks and . Internet . Protocols. 1. Note: T. he . slides are adapted and modified based on slides from the book’s companion Web site, as well as modified slides by . 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. Chapter 6:. Network Layer. Dimitris. . Mavrovouniotis. Chapter Outline. 6. .0 Introduction. 6. .1 Network Layer Protocols. 6. .2 Routing. 6. .3 Routers. 6.4 Configure a Cisco Router. 6.5 Summary. Section 6.1:. 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. 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…. 19. Network Layer . (Routing Algorithms). slides are modified from . J. Kurose & K. Ross. University of Nevada – Reno. Computer Science & Engineering Department. Fall . 2011. CPE 400 / 600. Chapter 1 - Lecture 3. 2/2/2017. Introduction. Protocol . “. layers. ”. Networks are complex, with many . “. pieces. ”. :. Hosts. Clients/Servers. Switches . Layer 2 routing: MAC. Routers. Layer 3 routing: IP. 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?.