T Computer Networks: Routing Lectures. c Janne Lindqvist 1/59
|
|
|
- Jacob Flynn
- 7 years ago
- Views:
Transcription
1 T Computer Networks, Autumn /59 T Computer Networks: Routing Lectures c Janne Lindqvist janne.lindqvist@tml.hut.fi 1/59
2 T Computer Networks, Autumn /59 Goals of the Set of Lectures The big picture Routing protocols distance vector (RIP) link state (OSPF) path vector (BGP) multicast Routing algorithms c Janne Lindqvist janne.lindqvist@tml.hut.fi 2/59
3 T Computer Networks, Autumn /59 Intuition Common analogy: the postal service But Internet routing is not quite like the postal service What were the roles of an IP address? c Janne Lindqvist janne.lindqvist@tml.hut.fi 3/59
4 T Computer Networks, Autumn /59 Review direct delivery vs. indirect delivery routing table static routing vs. dynamic routing autonomous system (AS) subnet addressing Classless Inter-Domain Routing (CIDR) c Janne Lindqvist janne.lindqvist@tml.hut.fi 4/59
5 T Computer Networks, Autumn /59 Routing Protocols Interior Gateway Protocols (IGP) vs. Exterior Gateway Protocols (EGP) distance vector vs. link state vs. path vector c Janne Lindqvist janne.lindqvist@tml.hut.fi 5/59
6 T Computer Networks, Autumn /59 Routing Protocols routing protocols transmit routing information between routers routing protocols DO NOT forward/route packets c Janne Lindqvist janne.lindqvist@tml.hut.fi 6/59
7 T Computer Networks, Autumn /59 Bellman-Ford Algorithm Bellman-Ford algorithm, single-source shortest path distributed Bellman-Ford algorithm, all-pairs shortest path On a Routing Problem - Richard Bellman, Quarterly of Applied Mathematics, Volume XVI, 1958 c Janne Lindqvist janne.lindqvist@tml.hut.fi 7/59
8 T Computer Networks, Autumn /59 Bellman-Ford Algorithm 1/3 If a node is in the shortest path between A and B, then the path from the node to A must be the shortest path and the path from the node to B must also be the shortest path. D j current estimate of the minimum cost from node j to the destination node C ij link cost from node i to node j C ii = 0 C ik = if nodes i and k are not directly connected c Janne Lindqvist janne.lindqvist@tml.hut.fi 8/59
9 T Computer Networks, Autumn /59 Bellman-Ford Algorithm 2/3 1. Initialization D i =, i d D d = 0 2. Updating: For each i d, D i = min j {C ij + D j }, j i Repeat step 2 until no more changes occur in the iteration. c Janne Lindqvist janne.lindqvist@tml.hut.fi 9/59
10 T Computer Networks, Autumn /59 Bellman-Ford Algorithm 3/3 Good news travel quickly, bad news travel slowly. Count to Infinity problem c Janne Lindqvist janne.lindqvist@tml.hut.fi 10/59
11 T Computer Networks, Autumn /59 Cost Examples 1/capacity packet delay congestion c Janne Lindqvist janne.lindqvist@tml.hut.fi 11/59
12 T Computer Networks, Autumn /59 Routing Information Protocol 1/3 RIP-1 RFC 1058, June 1988 RIP-2 RFC 2453, November 1998 (subnets etc) According to Huitema Routing in the Internet, 2nd edition, the most widely used routing protocol in the Internet. c Janne Lindqvist janne.lindqvist@tml.hut.fi 12/59
13 T Computer Networks, Autumn /59 RIP 2/3 uses UDP metric: hop two message types: request and response infinity is 16 split horizon and poisoned reverse triggered updates c Janne Lindqvist janne.lindqvist@tml.hut.fi 13/59
14 T Computer Networks, Autumn /59 RIP 3/3 split horizon: minimum cost to a given destination is not sent to a neighbor if the neighbor is the next node along the shortest path split horizon with poisoned reverse: minimum cost to a given destination is set to infinity if the neighbor is the next node along the shortest path c Janne Lindqvist janne.lindqvist@tml.hut.fi 14/59
15 T Computer Networks, Autumn /59 Next Link state routing Routing security Alternatives to packet routing Summary c Janne Lindqvist janne.lindqvist@tml.hut.fi 15/59
16 T Computer Networks, Autumn /59 Routing Protocols Interior Gateway Protocols (IGP) vs. Exterior Gateway Protocols (EGP) distance vector vs. link state vs. path vector c Janne Lindqvist janne.lindqvist@tml.hut.fi 16/59
17 T Computer Networks, Autumn /59 Link State Routing According to Tanenbaum, link state protocols: 1. discover neighbors and learn their network addresses 2. measure delay or cost (metric) to each neighbor 3. send the learned data to all other routers 4. compute shortest path to every other router c Janne Lindqvist janne.lindqvist@tml.hut.fi 17/59
18 T Computer Networks, Autumn /59 Neighbor Discovery HELLO packet to each point-to-point line (neighbors) reply to HELLO with a globally unique name a broadcast network (LAN) is considered as a node c Janne Lindqvist janne.lindqvist@tml.hut.fi 18/59
19 T Computer Networks, Autumn /59 Measuring the Link Cost ECHO packet reply to ECHO immediately delay: count round-trip time and divide it by two or delay: the above several times and count the average c Janne Lindqvist janne.lindqvist@tml.hut.fi 19/59
20 T Computer Networks, Autumn /59 Sending the Data Packets 1/2 The learned data is sent as packets consisting: identity of the sender sequence number age list of neighbors Why? How to ensure delivery to all routers? c Janne Lindqvist janne.lindqvist@tml.hut.fi 20/59
21 T Computer Networks, Autumn /59 Sending the Data Packets 2/3 Flooding distribution algorithm sequence number is incremented for every packet (source router, sequence number) pairs are tracked when a new link state protocol packet arrives if new, FORWARD except to the link it arrived if duplicate, DISCARD if old, DISCARD or if old, FORWARD to the router sending old packets c Janne Lindqvist janne.lindqvist@tml.hut.fi 21/59
22 T Computer Networks, Autumn /59 Sending the Data Packets 3/3 Flooding distribution algorithm problems router crashes: what is my sequence number? sequence number corruption solution: Age c Janne Lindqvist janne.lindqvist@tml.hut.fi 22/59
23 T Computer Networks, Autumn /59 Counting the Shortest Path Dijkstra s algorithm: single-source shortest path not distributed! c Janne Lindqvist janne.lindqvist@tml.hut.fi 23/59
24 T Computer Networks, Autumn /59 Interior Gateway Link State Protocol OSPF - Open Shortest Path First silly name, almost all protocols try to find the shortest path complex, many books only about OSPF c Janne Lindqvist janne.lindqvist@tml.hut.fi 24/59
25 T Computer Networks, Autumn /59 Summary What are the fundamental differences between: distance vector routing link state routing? distributed computation vs. centralized computation! c Janne Lindqvist janne.lindqvist@tml.hut.fi 25/59
26 T Computer Networks, Autumn /59 Routing Is Not Always Necessary bridges (comeback in Wireless LAN) Virtual LAN (VLAN) Which to choose? The domain of network engineering. c Janne Lindqvist janne.lindqvist@tml.hut.fi 26/59
27 T Computer Networks, Autumn /59 Routing Security 1/2 RIP-1 RFC 1058, June 1988 RIP-2 RFC 2453, November 1998 (subnets, authentication etc) c Janne Lindqvist janne.lindqvist@tml.hut.fi 27/59
28 T Computer Networks, Autumn /59 Routing Security 2/2 What does authentication solve? Denial of Service (DoS)? Address Resolution Protocol (ARP) spoof? Medium Access Control (MAC) spoof? c Janne Lindqvist janne.lindqvist@tml.hut.fi 28/59
29 T Computer Networks, Autumn /59 What did we cover? Distance vector routing Distributed Bellman-Ford algorithm Link state routing Routing security Alternatives to packet routing c Janne Lindqvist janne.lindqvist@tml.hut.fi 29/59
30 T Computer Networks, Autumn /59 What did we not cover? Multicast routing Routing in ad hoc networks Quality of Service Routing MPLS c Janne Lindqvist janne.lindqvist@tml.hut.fi 30/59
31 T Computer Networks, Autumn /59 Summary of Part I If you don t remember anything else: routing protocols exchange information about networks routing protocols do not forward packets c Janne Lindqvist janne.lindqvist@tml.hut.fi 31/59
32 T Computer Networks, Autumn /59 Goals of the Set of Lectures The big picture Routing protocols distance vector (RIP) link state (OSPF) path vector (BGP) Routing algorithms c Janne Lindqvist janne.lindqvist@tml.hut.fi 32/59
33 T Computer Networks, Autumn /59 Routing Protocols Interior Gateway Protocols (IGP) vs. Exterior Gateway Protocols (EGP) distance vector vs. link state vs. path vector c Janne Lindqvist janne.lindqvist@tml.hut.fi 33/59
34 T Computer Networks, Autumn /59 Autonomous Systems (AS) stub multihomed transit Today: autonomous systems c Janne Lindqvist janne.lindqvist@tml.hut.fi 34/59
35 T Computer Networks, Autumn /59 Why IGP and EGP? Why the classification: intradomain interdomain? Discuss! c Janne Lindqvist janne.lindqvist@tml.hut.fi 35/59
36 T Computer Networks, Autumn /59 Answer to Why IGP and EGP? If every AS had only two routers. It would mean routers in the Internet. Impossible with distance vector and link state protocols We need a divided routing scheme. c Janne Lindqvist janne.lindqvist@tml.hut.fi 36/59
37 T Computer Networks, Autumn /59 Policy Routing Route preferences: do not use path that goes through AS 12 Which destinations are reported to which neighbors Path editing Practical examples university networks vs. corporate networks traffic originated and ending in Canada must not leave Canada c Janne Lindqvist janne.lindqvist@tml.hut.fi 37/59
38 T Computer Networks, Autumn /59 Top-level Internet Routing peering points Finland, two Ethernet switches FICIX1 Espoo, Otaniemi FICIX2 Helsinki, Pasila 1 or 10 Gigabit Ethernet c Janne Lindqvist janne.lindqvist@tml.hut.fi 38/59
39 T Computer Networks, Autumn /59 Routing Protocols Interior Gateway Protocols (IGP) vs. Exterior Gateway Protocols (EGP) distance vector vs. link state vs. path vector c Janne Lindqvist janne.lindqvist@tml.hut.fi 39/59
40 T Computer Networks, Autumn /59 Border Gateway Protocol (BGP-4) Border routers BGP speakers Used between autonomous systems Provides reachability and path information TCP as transport c Janne Lindqvist janne.lindqvist@tml.hut.fi 40/59
41 T Computer Networks, Autumn /59 BGP-4 Message Types Message Types 1 OPEN 2 UPDATE 3 NOTIFICATION 4 KEEPALIVE c Janne Lindqvist janne.lindqvist@tml.hut.fi 41/59
42 T Computer Networks, Autumn /59 BGP-4 OPEN Message Version AS number Hold Time BGP Identifier: IP address Parameters Used to initialize communication c Janne Lindqvist janne.lindqvist@tml.hut.fi 42/59
43 T Computer Networks, Autumn /59 BGP-4 UPDATE Message List of destinations to be removed. List of new available destinations and paths to them. Information from the receiver s perspective. c Janne Lindqvist janne.lindqvist@tml.hut.fi 43/59
44 T Computer Networks, Autumn /59 BGP-4 Why Paths? Why UPDATE message contains path information? Discuss! c Janne Lindqvist janne.lindqvist@tml.hut.fi 44/59
45 T Computer Networks, Autumn /59 Answer to BGP-4 Why paths? Detect loops Policy routing However, cannot be used to deduce the optimal route. c Janne Lindqvist janne.lindqvist@tml.hut.fi 45/59
46 T Computer Networks, Autumn /59 BGP-4 KEEPALIVE Message For testing reachability Sending interval should be 1/3 of the hold timer c Janne Lindqvist janne.lindqvist@tml.hut.fi 46/59
47 T Computer Networks, Autumn /59 BGP-4 NOTIFICATION Message For error reporting AS routing loop Hold time unacceptable etc. c Janne Lindqvist janne.lindqvist@tml.hut.fi 47/59
48 T Computer Networks, Autumn /59 To Make Things Not Simple intradomain: I-BGP interdomain: E-BGP c Janne Lindqvist janne.lindqvist@tml.hut.fi 48/59
49 T Computer Networks, Autumn /59 BGP Security misconfigurations e.g. a route that should have been filtered is exported e.g. October 2003 WorldCom s internal routers crashed attacks c Janne Lindqvist janne.lindqvist@tml.hut.fi 49/59
50 T Computer Networks, Autumn /59 BGP Security No integrity, freshness or authentication for messages. No validation of AS authority for reachability information. No validation of announced path attributes. c Janne Lindqvist janne.lindqvist@tml.hut.fi 50/59
51 T Computer Networks, Autumn /59 Attacks Against BGP Eavesdropping Replay Messsage insertion Message deletion Message modification Man-in-the-middle Denial of service c Janne Lindqvist janne.lindqvist@tml.hut.fi 51/59
52 T Computer Networks, Autumn /59 Damage from Attacks starvation network congestion and delay blackhole looping eavesdrop cut and partition churn and instability resource exhaustion c Janne Lindqvist janne.lindqvist@tml.hut.fi 52/59
53 T Computer Networks, Autumn /59 Protection from Attacks TCP MD5 option filtering (S-BGP?) c Janne Lindqvist janne.lindqvist@tml.hut.fi 53/59
54 T Computer Networks, Autumn /59 Functions of IP Address unicast address interface identifier (socket binds to IP) topological locator (routing) multicast address group identifier c Janne Lindqvist janne.lindqvist@tml.hut.fi 54/59
55 T Computer Networks, Autumn /59 Multicast in Theory Routers use multicast routing protocols to establish connectivity across Internet. Hosts tell routers that they want to receive from group G i. Any host can send to the group. Sending and receiving is simple by socket APIs. bandwidth-efficient group communication c Janne Lindqvist janne.lindqvist@tml.hut.fi 55/59
56 T Computer Networks, Autumn /59 Multicast Routing Protocols flooding source-tree core-tree mesh hybrid Everyone has a favorite protocol (including me!) c Janne Lindqvist janne.lindqvist@tml.hut.fi 56/59
57 T Computer Networks, Autumn /59 The Dichotomy Revisited intradomain Distance Vector Multicast Routing Protocol (DVMRP) Multicast Extensions to OSPF (MOSPF) Protocol Independent Multicast (PIM-SM) (PIM-DM) interdomain Multicast Source Discovery Protocol (MSDP) Border Gateway Multicast Protocol (BGMP) c Janne Lindqvist janne.lindqvist@tml.hut.fi 57/59
58 T Computer Networks, Autumn /59 The Big Picture Default route in a host. OSPF in the access network in an AS. BGP between ASes. And additionally PIM and MBONE for multicast. c Janne Lindqvist janne.lindqvist@tml.hut.fi 58/59
59 T Computer Networks, Autumn /59 That s All Questions? c Janne Lindqvist janne.lindqvist@tml.hut.fi 59/59
Route Discovery Protocols
Route Discovery Protocols Columbus, OH 43210 Jain@cse.ohio-State.Edu http://www.cse.ohio-state.edu/~jain/ 1 Overview Building Routing Tables Routing Information Protocol Version 1 (RIP V1) RIP V2 OSPF
Dynamic Routing Protocols II OSPF. Distance Vector vs. Link State Routing
Dynamic Routing Protocols II OSPF Relates to Lab 4. This module covers link state routing and the Open Shortest Path First (OSPF) routing protocol. 1 Distance Vector vs. Link State Routing With distance
Exterior Gateway Protocols (BGP)
Exterior Gateway Protocols (BGP) Internet Structure Large ISP Large ISP Stub Dial-Up ISP Small ISP Stub Stub Stub Autonomous Systems (AS) Internet is not a single network! The Internet is a collection
Internet Control Message Protocol (ICMP)
SFWR 4C03: Computer Networks & Computer Security Jan 31-Feb 4, 2005 Lecturer: Kartik Krishnan Lecture 13-16 Internet Control Message Protocol (ICMP) The operation of the Internet is closely monitored by
Outline. Internet Routing. Alleviating the Problem. DV Algorithm. Routing Information Protocol (RIP) Link State Routing. Routing algorithms
Outline Internet Routing Venkat Padmanabhan Microsoft Research 9 pril 2001 Routing algorithms distance-vector (DV) link-state (LS) Internet Routing border gateway protocol (BGP) BGP convergence paper Venkat
Layer 3 Routing User s Manual
User s Manual Second Edition, July 2011 www.moxa.com/product 2011 Moxa Inc. All rights reserved. User s Manual The software described in this manual is furnished under a license agreement and may be used
Routing in Small Networks. Internet Routing Overview. Agenda. Routing in Large Networks
Routing in Small Networks Internet Routing Overview AS, IGP,, BGP in small networks distance vector or link state protocols like RIP or OSPF can be used for dynamic routing it is possible that every router
Inter-domain Routing. Outline. Border Gateway Protocol
Inter-domain Routing Outline Border Gateway Protocol Internet Structure Original idea Backbone service provider Consumer ISP Large corporation Consumer ISP Small corporation Consumer ISP Consumer ISP Small
Router and Routing Basics
Router and Routing Basics Malin Bornhager Halmstad University Session Number 2002, Svenska-CNAP Halmstad University 1 Routing Protocols and Concepts CCNA2 Routing and packet forwarding Static routing Dynamic
Advanced Networking Routing: RIP, OSPF, Hierarchical routing, BGP
Advanced Networking Routing: RIP, OSPF, Hierarchical routing, BGP Renato Lo Cigno Routing Algorithms: One or Many? Is there a single routing protocol in the Internet? How can different protocols and algorithms
Module 7. Routing and Congestion Control. Version 2 CSE IIT, Kharagpur
Module 7 Routing and Congestion Control Lesson 4 Border Gateway Protocol (BGP) Specific Instructional Objectives On completion of this lesson, the students will be able to: Explain the operation of the
Interconnecting Cisco Networking Devices Part 2
Interconnecting Cisco Networking Devices Part 2 Course Number: ICND2 Length: 5 Day(s) Certification Exam This course will help you prepare for the following exam: 640 816: ICND2 Course Overview This course
Chapter 4. Distance Vector Routing Protocols
Chapter 4 Distance Vector Routing Protocols CCNA2-1 Chapter 4 Note for Instructors These presentations are the result of a collaboration among the instructors at St. Clair College in Windsor, Ontario.
Distance Vector Routing Protocols. Routing Protocols and Concepts Ola Lundh
Distance Vector Routing Protocols Routing Protocols and Concepts Ola Lundh Objectives The characteristics of distance vector routing protocols. The network discovery process of distance vector routing
Based on Computer Networking, 4 th Edition by Kurose and Ross
Computer Networks Internet Routing Based on Computer Networking, 4 th Edition by Kurose and Ross Intra-AS Routing Also known as Interior Gateway Protocols (IGP) Most common Intra-AS routing protocols:
CSC458 Lecture 6. Homework #1 Grades. Inter-domain Routing IP Addressing. Administrivia. Midterm will Cover Following Topics
CSC458 Lecture 6 Inter-domain Routing IP Addressing Stefan Saroiu http://www.cs.toronto.edu/syslab/courses/csc458 University of Toronto at Mississauga Homework #1 Grades Fraction of Students 100 80 60
Internet Firewall CSIS 4222. Packet Filtering. Internet Firewall. Examples. Spring 2011 CSIS 4222. net15 1. Routers can implement packet filtering
Internet Firewall CSIS 4222 A combination of hardware and software that isolates an organization s internal network from the Internet at large Ch 27: Internet Routing Ch 30: Packet filtering & firewalls
IP Routing Configuring RIP, OSPF, BGP, and PBR
13 IP Routing Configuring RIP, OSPF, BGP, and PBR Contents Overview..................................................... 13-6 Routing Protocols.......................................... 13-6 Dynamic Routing
Inter-domain Routing Basics. Border Gateway Protocol. Inter-domain Routing Basics. Inter-domain Routing Basics. Exterior routing protocols created to:
Border Gateway Protocol Exterior routing protocols created to: control the expansion of routing tables provide a structured view of the Internet by segregating routing domains into separate administrations
Routing Protocols (RIP, OSPF, BGP)
Chapter 13 Routing Protocols (RIP, OSPF, BGP) INTERIOR AND EXTERIOR ROUTING RIP OSPF BGP 1 The McGraw-Hill Companies, Inc., 2000 1 Introduction Packets may pass through several networks on their way to
order ateway Sicherheit im Internet, Patrick Lederer,, 18.05.2004
B G order ateway M ulticast P rotocol 1 Abstract 1. Introduction 1. Introduction 2. Tasks and Rules of Border Routers 3. Implementations 4. Bidirectional Trees 4.1 Third Party Dependency 4.2 Method of
Lecture 8: Routing I Distance-vector Algorithms. CSE 123: Computer Networks Stefan Savage
Lecture 8: Routing I Distance-vector Algorithms CSE 3: Computer Networks Stefan Savage This class New topic: routing How do I get there from here? Overview Routing overview Intra vs. Inter-domain routing
Computer Networks 1 (Mạng Máy Tính 1) Lectured by: Dr. Phạm Trần Vũ
Computer Networks 1 (Mạng Máy Tính 1) Lectured by: Dr. Phạm Trần Vũ 1 Lecture 7: Network Layer in the Internet Reference: Chapter 5 - Computer Networks, Andrew S. Tanenbaum, 4th Edition, Prentice Hall,
6.263 Data Communication Networks
6.6 Data Communication Networks Lecture : Internet Routing (some slides are taken from I. Stoica and N. Mckewon & T. Griffin) Dina Katabi dk@mit.edu www.nms.csail.mit.edu/~dina Books Text Book Data Communication
Border Gateway Protocol (BGP)
Border Gateway Protocol (BGP) Petr Grygárek rek 1 Role of Autonomous Systems on the Internet 2 Autonomous systems Not possible to maintain complete Internet topology information on all routers big database,
IP Multicasting. Applications with multiple receivers
IP Multicasting Relates to Lab 10. It covers IP multicasting, including multicast addressing, IGMP, and multicast routing. 1 Applications with multiple receivers Many applications transmit the same data
GregSowell.com. Mikrotik Routing
Mikrotik Routing Static Dynamic Routing To Be Discussed RIP Quick Discussion OSPF BGP What is Routing Wikipedia has a very lengthy explanation http://en.wikipedia.org/wiki/routing In the context of this
Using the Border Gateway Protocol for Interdomain Routing
CHAPTER 12 Using the Border Gateway Protocol for Interdomain Routing The Border Gateway Protocol (BGP), defined in RFC 1771, provides loop-free interdomain routing between autonomous systems. (An autonomous
Lecture 12: Link-state Routing"
Lecture 2: Link-state Routing" CSE 23: Computer Networks Alex C. Snoeren HW 3 due next Tuesday! Lecture 2 Overview" Routing overview Intra vs. Inter-domain routing Link-state routing protocols CSE 23 Lecture
Computer Networks. Main Functions
Computer Networks The Network Layer 1 Routing. Forwarding. Main Functions 2 Design Issues Services provided to transport layer. How to design network-layer protocols. 3 Store-and-Forward Packet Switching
Routing with OSPF. Introduction
Routing with OSPF Introduction The capabilities of an internet are largely determined by its routing protocol. An internet's scalability, its ability to quickly route around failures, and the consumption
Internet Control Protocols Reading: Chapter 3
Internet Control Protocols Reading: Chapter 3 ARP - RFC 826, STD 37 DHCP - RFC 2131 ICMP - RFC 0792, STD 05 1 Goals of Today s Lecture Bootstrapping an end host Learning its own configuration parameters
How To Understand Bg
Table of Contents BGP Case Studies...1 BGP4 Case Studies Section 1...3 Contents...3 Introduction...3 How Does BGP Work?...3 ebgp and ibgp...3 Enabling BGP Routing...4 Forming BGP Neighbors...4 BGP and
640-816: Interconnecting Cisco Networking Devices Part 2 v1.1
640-816: Interconnecting Cisco Networking Devices Part 2 v1.1 Course Introduction Course Introduction Chapter 01 - Small Network Implementation Introducing the Review Lab Cisco IOS User Interface Functions
OSPF Version 2 (RFC 2328) Describes Autonomous Systems (AS) topology. Propagated by flooding: Link State Advertisements (LSAs).
OSPF Version 2 (RFC 2328) Interior gateway protocol (IGP). Routers maintain link-state database. Describes Autonomous Systems (AS) topology. Propagated by flooding: Link State Advertisements (LSAs). Router
Course Overview: Learn the essential skills needed to set up, configure, support, and troubleshoot your TCP/IP-based network.
Course Name: TCP/IP Networking Course Overview: Learn the essential skills needed to set up, configure, support, and troubleshoot your TCP/IP-based network. TCP/IP is the globally accepted group of protocols
College 5, Routing, Internet. Host A. Host B. The Network Layer: functions
CSN-s 5/1 College 5, Routing, Internet College stof 1 Inleiding: geschiedenis, OSI model, standaarden, ISOC/IETF/IRTF structuur Secties: 1.2, 1.3, 1.4, 1.5 2 Fysieke laag: Bandbreedte/bitrate Secties:
Introduction to LAN/WAN. Network Layer
Introduction to LAN/WAN Network Layer Topics Introduction (5-5.1) Routing (5.2) (The core) Internetworking (5.5) Congestion Control (5.3) Network Layer Design Isues Store-and-Forward Packet Switching Services
Data Networking and Architecture. Delegates should have some basic knowledge of Internet Protocol and Data Networking principles.
Data Networking and Architecture The course focuses on theoretical principles and practical implementation of selected Data Networking protocols and standards. Physical network architecture is described
Internet inter-as routing: BGP
Internet inter-as routing: BGP BGP (Border Gateway Protocol): the de facto standard BGP provides each AS a means to: 1. Obtain subnet reachability information from neighboring ASs. 2. Propagate the reachability
Routing Protocols. Interconnected ASes. Hierarchical Routing. Hierarchical Routing
Routing Protocols scale: with 200 million destinations: can t store all dest s in routing tables! routing table exchange would swamp links! Hierarchical Routing Our routing study thus far - idealization
Final Exam. Route Computation: One reason why link state routing is preferable to distance vector style routing.
UCSD CSE CS 123 Final Exam Computer Networks Directions: Write your name on the exam. Write something for every question. You will get some points if you attempt a solution but nothing for a blank sheet
Border Gateway Protocol (BGP-4)
Vanguard Applications Ware IP and LAN Feature Protocols Border Gateway Protocol (BGP-4) Notice 2008 Vanguard Networks 25 Forbes Blvd Foxboro, MA 02035 Phone: (508) 964 6200 Fax: (508) 543 0237 All rights
Lecture 2.1 : The Distributed Bellman-Ford Algorithm. Lecture 2.2 : The Destination Sequenced Distance Vector (DSDV) protocol
Lecture 2 : The DSDV Protocol Lecture 2.1 : The Distributed Bellman-Ford Algorithm Lecture 2.2 : The Destination Sequenced Distance Vector (DSDV) protocol The Routing Problem S S D D The routing problem
Administrative Distance
RIP is a distance vector routing protocol. It shares routing information through the local broadcast in every 30 seconds. In this tutorial we will explain RIP routing fundamentals with examples such as
Examination. IP routning på Internet och andra sammansatta nät, DD2491 IP routing in the Internet and other complex networks, DD2491
Examination IP routning på Internet och andra sammansatta nät, DD2491 IP routing in the Internet and other complex networks, DD2491 Date: December 15 2009 14:00 18:00 1. No help material is allowed - You
Outline. EE 122: Interdomain Routing Protocol (BGP) BGP Routing. Internet is more complicated... Ion Stoica TAs: Junda Liu, DK Moon, David Zats
Outline EE 22: Interdomain Routing Protocol (BGP) Ion Stoica TAs: Junda Liu, DK Moon, David Zats http://inst.eecs.berkeley.edu/~ee22/fa9 (Materials with thanks to Vern Paxson, Jennifer Rexford, and colleagues
Link-State Routing Protocols
Link-State Routing Protocols Malin Bornhager Halmstad University Session Number 2002, Svenska-CNAP Halmstad University 1 Objectives Link-state routing protocol Single-area OSPF concepts Single-area OSPF
BGP overview BGP operations BGP messages BGP decision algorithm BGP states
BGP overview BGP operations BGP messages BGP decision algorithm BGP states 1 BGP overview Currently in version 4. InterAS (or Interdomain) routing protocol for exchanging network reachability information
CHAPTER 10 IP MULTICAST
CHAPTER 10 IP MULTICAST This chapter is about IP multicast, the network layer mechanisms in the Internet to support applications where data is sent from a sender to multiple receivers. The first section
Lecture 18: Border Gateway Protocol"
Lecture 18: Border Gateway Protocol" CSE 123: Computer Networks Alex C. Snoeren HW 3 due Wednesday! Some figures courtesy Mike Freedman Lecture 18 Overview" Path-vector Routing Allows scalable, informed
Protocol Specification & Design. The Internet and its Protocols. Course Outline (trivia) Introduction to the Subject Teaching Methods
The Internet and its Protocols Protocol Specification & Design Robert Elz kre@munnari.oz.au kre@coe.psu.ac.th http://fivedots.coe.psu.ac.th/~kre/ Friday: 13:30-15:00 (Rm: 101)???: xx:x0-xx:x0 (Rm:???)
OSPF Routing Protocol
OSPF Routing Protocol Contents Introduction Network Architecture Campus Design Architecture Building Block Design Server Farm Design Core Block Design WAN Design Architecture Protocol Design Campus Design
CLASSLESS INTER DOMAIN ROUTING - CIDR
CLASSLESS INTER DOMAIN ROUTING - CIDR Marko Luoma Helsinki University of Technology Laboratory of Telecommunications Technology Marko.Luoma@hut.fi ABSTRACT As the Internet evolved and become more familiar
Wide Area Networks. Learning Objectives. LAN and WAN. School of Business Eastern Illinois University. (Week 11, Thursday 3/22/2007)
School of Business Eastern Illinois University Wide Area Networks (Week 11, Thursday 3/22/2007) Abdou Illia, Spring 2007 Learning Objectives 2 Distinguish between LAN and WAN Distinguish between Circuit
Administra0via. STP lab due Wednesday (in BE 301a!), 5/15 BGP quiz Thursday (remember required reading), 5/16
BGP Brad Smith Administra0via How are the labs going? This week STP quiz Thursday, 5/9 Next week STP lab due Wednesday (in BE 301a!), 5/15 BGP quiz Thursday (remember required reading), 5/16 Following
Internet Protocol version 4 Part I
Internet Protocol version 4 Part I Claudio Cicconetti International Master on Information Technology International Master on Communication Networks Engineering Table of Contents
Cisco CCNP 642 901 Optimizing Converged Cisco Networks (ONT)
Cisco CCNP 642 901 Optimizing Converged Cisco Networks (ONT) Course Number: 642 901 Length: 5 Day(s) Certification Exam This course will help you prepare for the following exams: Cisco CCNP Exam 642 901:
Chapter 49 Border Gateway Protocol version 4 (BGP-4)
Chapter 49 Border Gateway Protocol version 4 (BGP-4) Introduction... 1-3 Overview of BGP-4... 1-3 BGP Operation... 1-5 BGP Attributes... 1-6 BGP Route Selection... 1-8 Classless Inter-domain Routing (CIDR)
The Internet. Internet Technologies and Applications
The Internet Internet Technologies and Applications Aim and Contents Aim: Review the main concepts and technologies used in the Internet Describe the real structure of the Internet today Contents: Internetworking
Comparison of RIP, EIGRP, OSPF, IGRP Routing Protocols in Wireless Local Area Network (WLAN) By Using OPNET Simulator Tool - A Practical Approach
Comparison of RIP, EIGRP, OSPF, IGRP Routing Protocols in Wireless Local Area Network (WLAN) By Using OPNET Simulator Tool - A Practical Approach U. Dillibabau 1, Akshay 2, M. Lorate Shiny 3 UG Scholars,
Internetworking and Internet-1. Global Addresses
Internetworking and Internet Global Addresses IP servcie model has two parts Datagram (connectionless) packet delivery model Global addressing scheme awaytoidentifyall H in the internetwork Properties
Introduction to Dynamic Routing Protocols
CHAPTER 3 Introduction to Dynamic Routing Protocols Objectives Upon completion of this chapter, you should be able to answer the following questions: Can you describe the role of dynamic routing protocols
RARP: Reverse Address Resolution Protocol
SFWR 4C03: Computer Networks and Computer Security January 19-22 2004 Lecturer: Kartik Krishnan Lectures 7-9 RARP: Reverse Address Resolution Protocol When a system with a local disk is bootstrapped it
Behavior Analysis of TCP Traffic in Mobile Ad Hoc Network using Reactive Routing Protocols
Behavior Analysis of TCP Traffic in Mobile Ad Hoc Network using Reactive Routing Protocols Purvi N. Ramanuj Department of Computer Engineering L.D. College of Engineering Ahmedabad Hiteishi M. Diwanji
APNIC elearning: BGP Basics. Contact: training@apnic.net. erou03_v1.0
erou03_v1.0 APNIC elearning: BGP Basics Contact: training@apnic.net Overview What is BGP? BGP Features Path Vector Routing Protocol Peering and Transit BGP General Operation BGP Terminology BGP Attributes
O 10.16.1.0/27 [110/129] via 192.168.1.5, 00:00:05, Serial0/0/1
![O 10.16.1.0/27 [110/129] via 192.168.1.5, 00:00:05, Serial0/0/1](/thumbs/39/20242582.jpg "O 10.16.1.0/27 [110/129] via 192.168.1.5, 00:00:05, Serial0/0/1")
1 Which two statements are true regarding the advantages of the use of static routes? (Choose increased security reduced effort in configuring routes the administrator maintains control over routing easier
Faculty of Engineering Computer Engineering Department Islamic University of Gaza 2012. Network Chapter# 19 INTERNETWORK OPERATION
Faculty of Engineering Computer Engineering Department Islamic University of Gaza 2012 Network Chapter# 19 INTERNETWORK OPERATION Review Questions ٢ Network Chapter# 19 INTERNETWORK OPERATION 19.1 List
Week 4 / Paper 1. Open issues in Interdomain Routing: a survey
Week 4 / Paper 1 Open issues in Interdomain Routing: a survey Marcelo Yannuzzi, Xavier Masip-Bruin, Olivier Bonaventure IEEE Network, Nov.-Dec. 2005, vol. 19, no. 6, pp. 49 56 Main point There are many
100-101: Interconnecting Cisco Networking Devices Part 1 v2.0 (ICND1)
100-101: Interconnecting Cisco Networking Devices Part 1 v2.0 (ICND1) Course Overview This course provides students with the knowledge and skills to implement and support a small switched and routed network.
Introduction to TCP/IP
Introduction to TCP/IP Raj Jain The Ohio State University Columbus, OH 43210 Nayna Networks Milpitas, CA 95035 Email: Jain@ACM.Org http://www.cis.ohio-state.edu/~jain/ 1 Overview! Internetworking Protocol
ITRI CCL. IP Routing Primer. Paul C. Huang, Ph.D. ITRI / CCL / N300. CCL/N300; Paul Huang 1999/6/2 1
IP Routing Primer Paul C. Huang, Ph.D. ITRI / / N300 /N300; Paul Huang 1999/6/2 1 Basic Addressing / Subnetting Class A 0 Network Host Host Host 127 networks / 16,777,216 hosts Class A natural mask 255.0.0.0
Agenda. Distributed System Structures. Why Distributed Systems? Motivation
Agenda Distributed System Structures CSCI 444/544 Operating Systems Fall 2008 Motivation Network structure Fundamental network services Sockets and ports Client/server model Remote Procedure Call (RPC)
8.2 The Internet Protocol
TCP/IP Protocol Suite HTTP SMTP DNS RTP Distributed applications Reliable stream service TCP UDP User datagram service Best-effort connectionless packet transfer Network Interface 1 IP Network Interface
Datagram-based network layer: forwarding; routing. Additional function of VCbased network layer: call setup.
CEN 007C Computer Networks Fundamentals Instructor: Prof. A. Helmy Homework : Network Layer Assigned: Nov. 28 th, 2011. Due Date: Dec 8 th, 2011 (to the TA) 1. ( points) What are the 2 most important network-layer
VXLAN: Scaling Data Center Capacity. White Paper
VXLAN: Scaling Data Center Capacity White Paper Virtual Extensible LAN (VXLAN) Overview This document provides an overview of how VXLAN works. It also provides criteria to help determine when and where
Routing. An Engineering Approach to Computer Networking
Routing An Engineering Approach to Computer Networking What is it? Process of finding a path from a source to every destination in the network Suppose you want to connect to Antarctica from your desktop
CS335 Sample Questions for Exam #2
CS335 Sample Questions for Exam #2.) Compare connection-oriented with connectionless protocols. What type of protocol is IP? How about TCP and UDP? Connection-oriented protocols Require a setup time to
Chapter 3 LAN Configuration
Chapter 3 LAN Configuration This chapter describes how to configure the advanced LAN features of your ProSafe Dual WAN Gigabit Firewall with SSL & IPsec VPN. This chapter contains the following sections
BGP. 1. Internet Routing
BGP 1. Internet Routing (C) Herbert Haas 2005/03/11 1 Internet Routing Interior Gateway Protocols (IGPs) not suitable for Inter-ISP routing Technical metrics only No policy features Inter-ISP routing is
IP Routing Features. Contents
7 IP Routing Features Contents Overview of IP Routing.......................................... 7-3 IP Interfaces................................................ 7-3 IP Tables and Caches........................................
Active measurements: networks. Prof. Anja Feldmann, Ph.D. Dr. Nikolaos Chatzis Georgios Smaragdakis, Ph.D.
Active measurements: networks Prof. Anja Feldmann, Ph.D. Dr. Nikolaos Chatzis Georgios Smaragdakis, Ph.D. Outline Organization of Internet routing Types of domains Intra- and inter-domain routing Intra-domain
Network Protocol Configuration
Table of Contents Table of Contents Chapter 1 Configuring IP Addressing... 1 1.1 IP Introduction... 1 1.1.1 IP... 1 1.1.2 IP Routing Protocol... 1 1.2 Configuring IP Address Task List... 2 1.3 Configuring
DD2491 p1 2008. Inter-domain routing and BGP part I Olof Hagsand KTH/CSC
DD2491 p1 2008 Inter-domain routing and BGP part I Olof Hagsand KTH/CSC Inter-domain routing The objective of inter-domain routing is to bind together all the thousands of independent IP networks that
Routing in packet-switching networks
Routing in packet-switching networks Circuit switching vs. Packet switching Most of WANs based on circuit or packet switching Circuit switching designed for voice Resources dedicated to a particular call
ICS 351: Today's plan
ICS 351: Today's plan Quiz, on overall Internet function, linux and IOS commands, network monitoring, protocols IPv4 addresses: network part and host part address masks IP interface configuration IPv6
Lecture 13: Distance-vector Routing. Lecture 13 Overview. Bellman-Ford Algorithm. d u (z) = min{c(u,v) + d v (z), c(u,w) + d w (z)}
Lecture : istance-vector Routing S : omputer Networks hris Kanich Quiz TOMORROW Lecture Overview istance vector ssume each router knows its own address and cost to reach each of its directly connected
Chapter 6 Configuring IP
Chapter 6 Configuring IP This chapter describes the Internet Protocol (IP) parameters on HP ProCurve routing switches and switches and how to configure them. After you add IP addresses and configure other
- Routing Information Protocol -
1 - Routing Information Protocol - RIP (Routing Information Protocol) RIP is a standardized Distance Vector protocol, designed for use on smaller networks. RIP was one of the first true Distance Vector
Lesson 5-3: Border Gateway Protocol
Unit 5: Intradomain and Interdomain Protocols Lesson 5-3: Gateway Protocol At a Glance The Gateway Protocol (BGP) is an interdomain routing protocol used in TCP/IP internetworks. BGP was created to allow
- Multicast - Types of packets
1 Types of packets - Multicast - Three types of packets can exist on an IPv4 network: Unicast A packet sent from one host to only one other host. A hub will forward a unicast out all ports. If a switch
Question 1. [7 points] Consider the following scenario and assume host H s routing table is the one given below:
![Question 1. [7 points] Consider the following scenario and assume host H s routing table is the one given below:](/thumbs/29/13901983.jpg "Question 1. [7 points] Consider the following scenario and assume host H s routing table is the one given below:")
Computer Networks II Master degree in Computer Engineering Exam session: 11/02/2009 Teacher: Emiliano Trevisani Last name First name Student Identification number You are only allowed to use a pen and
Advanced Routing. FortiOS Handbook v3 for FortiOS 4.0 MR3
Advanced Routing FortiOS Handbook v3 for FortiOS 4.0 MR3 FortiOS Handbook Advanced Routing v3 4 January 2013 01-433-98043-20120116 Copyright 2012 Fortinet, Inc. All rights reserved. Fortinet, FortiGate,
CS 3251- Computer Networks 1: Routing Algorithms
CS 35- Computer Networks : Routing Algorithms Professor Patrick Tranor 0//3 Lecture 3 Reminders The due date for Homework was moved to Thursda. Reason: Allow ou to attend toda s lecture. Project is still
Introduction to Metropolitan Area Networks and Wide Area Networks
Introduction to Metropolitan Area Networks and Wide Area Networks Chapter 9 Learning Objectives After reading this chapter, you should be able to: Distinguish local area networks, metropolitan area networks,
Introduction to LAN/WAN. Network Layer (part II)
Introduction to LAN/WAN Network Layer (part II) Topics The Network Layer Introduction Routing (5.2) The Internet (5.5) IP, IP addresses ARP (5.5.4) OSPF (5.5.5) BGP (5.5.6) Congestion Control (5.3) Internetworking
Computer Networks Administration Help Manual Sana Saadaoui Jemai Oliver Wellnitz
Technische Universität Braunschweig Institut für Betriebssysteme und Rechnerverbund Computer Networks Administration Help Manual Sana Saadaoui Jemai Oliver Wellnitz Braunschweig, 27 th March 2007 Contents
Border Gateway Protocol BGP4 (2)
Border Gateway Protocol BGP4 (2) Professor Richard Harris School of Engineering and Advanced Technology (SEAT) Presentation Outline Border Gateway Protocol - Continued Computer Networks - 1/2 Learning
IP Routing Configuring Static Routes
11 IP Routing Configuring Static Routes Contents Overview..................................................... 11-3 IP Addressing.............................................. 11-3 Networks.................................................