2/16/2008. Outline Computer Networking Lecture 11 Routing. Sending Link States by Flooding. Link State Protocol Concept

Size: px
Start display at page:

Download "2/16/2008. Outline Computer Networking Lecture 11 Routing. Sending Link States by Flooding. Link State Protocol Concept"

Transcription

1 //8 Outline - omputer Networking Lecture Routing Link tate OP Peter teenkiste epartments of omputer cience and Electrical and omputer Engineering IP Multicast ervice asics - Networking, pring 8 Host/Router Interaction MOP/VMRP Link tate Protocol oncept ending Link tates by looding Every node gets complete copy of graph»every node floods network with data about its outgoing links Every node computes routes to every other node»using single-source, shortest-path algorithm Process performed whenever needed»when connections die / reappear X Wants to end Information» ends on all outgoing links When Y Receives Information from Z» end on all links other than Z Need to stop propagation X X (a) (c) X X (b)» Use sequence number to recognize and discard old packets» lso: limit hop count or time in the network (d) iven ijkstra s lgorithm»raph with source node s and edge costs c(u,v)»etermine least cost path from s to every node v hortest Path irst lgorithm»traverse graph in order of least cost from source ijkstra s lgorithm: oncept E ets» lready have least cost path to it» : Reachable in hop from node in» : annot reach directly from node in urrent Path osts Label» d(v) = path cost rom s to v Path» Keep track of last link in path

2 //8 ijkstra s lgorithm: Initially ijkstra s lgorithm: Initially E urrent Path osts E urrent Path osts No nodes done in horizon d(v) to node shown in red»only consider links from done nodes ijkstra s lgorithm ijkstra s lgorithm E urrent Path osts E urrent Path osts elect node v in horizon with minimum d(v) dd link used to add node to shortest path tree Update d(v) information Repeat 9 9 ijkstra s lgorithm ijkstra s lgorithm E urrent Path osts E Update d(v) values» an cause addition of new nodes to horizon inal tree shown in green

3 //8 Link tate haracteristics OP Routing Protocol With consistent Ls*, all nodes compute consistent loop-free paths an still have transient loops» Routers may update database at slightly different times Packet from may loop around if knows about failure and & do not Open»Open standard created by IET hortest-path first»nother name for ijkstra s algorithm More prevalent than RIP OP Reliable looding OP looding Operation Transmit link state advertisements» Originating router Typically, minimum IP address for router» Link I I of router at other end of link» Metric ost of link» Link-state age Incremented each second Packet expires when reaches» equence number Incremented each time sending new link information X Receives L from Y» With equence Number q» Looks for entry with same origin/link I ases» No entry present dd entry, propagate to all neighbors other than Y» Entry present with sequence number p < q Update entry, propagate to all neighbors other than Y» Entry present with sequence number p > q end entry back to Y To tell Y that it has out-of-date information» Entry present with sequence number p = q Ignore it looding Issues doption of OP When should it be performed» Periodically» When status of link changes etected by connected node What happens when router goes down & back up» equence number reset to Other routers may have entries with higher sequence numbers» Router will send out Ls with number» Will get back Ls with last valid sequence number p» Router sets sequence number to p+ & resends RIP viewed as outmoded»ood when networks small and routers had limited memory & computational power OP dvantages»ast convergence when configuration changes

4 //8 omparison of L and V lgorithms omparison of L and V lgorithms Message complexity L: with n nodes, E links, O(nE) messages V: exchange between neighbors only peed of onvergence L: omplex computation» ut can forward before computation» may have oscillations V: convergence time varies» may be routing loops» count-to-infinity problem» (faster with triggered updates) pace requirements:» L maintains entire topology» V maintains only neighbor state 9 9 Robustness: what happens if router malfunctions? L: node can advertise incorrect link cost each node computes only its own table V: V node can advertise incorrect path cost each node s table used by others errors propagate thru network Other tradeoffs Making LP flood reliable Outline Multicast Routing Link tate Unicast: one source to one destination OP Multicast: one source to many destinations IP Multicast ervice asics Main goal: efficient data distribution Host/Router Interaction MOP/VMRP Multicast Efficient ata istribution Example pplications rc rc roadcast audio/video Push-based systems oftware distribution Web-cache updates Teleconferencing (audio, video, shared whiteboard, text editor) Multi-player games erver/service location Other distributed applications

5 //8 IP Multicast rchitecture Logical Naming ervice model Host-to-router protocol (IMP) Hosts Routers ingle name/address maps to logically related set of destinations»estination set = multicast group Multicast routing protocols (various) Key challenge: scalability»ingle name/address independent of group growth or changes Multicast Router Responsibilities IP Multicast ervice Model (rfc) Learn of the existence of multicast groups (through advertisement) Identify links with group members Establish state to route packets»replicate packets on appropriate interfaces»routing entry: rc, incoming interface List of outgoing interfaces Each group identified by a single IP address roups may be of any size Members of groups may be located anywhere in the Internet Members of groups can join and leave at will enders need not be members roup membership not known explicitly nalogy:» Each multicast address is like a radio frequency, on which anyone can transmit, and to which anyone can tune-in IP Multicast ddresses IP Multicast PI lass IP addresses» roup I How to allocated these addresses?»well-known multicast addresses, assigned by IN»Transient multicast addresses, assigned and reclaimed dynamically, e.g., by sdr program 9 9 ending same as before Receiving two new operations»join-ip-multicast-roup(group- address, interface)»leave-ip-multicast-roup(groupaddress, interface)»receive multicast packets for joined groups via normal IP-Receive operation»implemented using socket options

6 //8 Multicast cope ontrol mall TTLs TTL expanding-ring search to reach or find a nearby subset of a group s Multicast cope ontrol Large TTLs dministrative TTL oundaries to keep multicast traffic within an administrative domain, e.g., for privacy or resource reasons The rest of the Internet n administrative domain TTL threshold set on interfaces to these links, greater than the diameter of the admin. domain Overview IP Multicast rchitecture IP Multicast ervice asics Host/Router Interaction MOP/VMRP ervice model Host-to-router protocol (IMP) Multicast routing protocols (various) Hosts Routers Internet roup Management Protocol How IMP Works End system to router protocol is IMP Each host keeps track of which mcast groups are subscribed to» ocket PI informs IMP process of all joins Objective is to keep router up-to-date with group membership of entire LN» Routers need not know who all the members are, only that members exist Routers: Hosts: On each link, one router is elected the querier uerier periodically sends a Membership uery message to the all-systems group (...), with TTL = On receipt, hosts start random timers (between and seconds) for each multicast group to which they belong

7 //8 How IMP Works (cont.) How IMP Works (cont.) Routers: Hosts: Note that, in normal case, only one report message per group present is sent in response to a query» Power of randomization + suppression uery interval is typically -9 seconds When a host s timer for group expires, it sends a Membership Report to group, with TTL = Other members of hear the report and stop their timers Routers hear all reports, and time out non-responding groups When a host first joins a group, it sends one or two immediate reports, instead of waiting for a query Overview IP Multicast rchitecture IP Multicast ervice asics Host/Router Interaction MOP/VMRP ervice model Host-to-router protocol (IMP) Multicast routing protocols (various) Hosts Routers 9 9 Routing Techniques Multicast OP (MOP) asic objective build distribution tree for multicast packets lood and prune» egin by flooding traffic to entire network» Prune branches with no receivers» Examples: VMRP, PIM-M» Unwanted state where there are no receivers Link-state multicast protocols» Routers advertise groups for which they have receivers to entire network» ompute trees on demand» Example: MOP» Unwanted state where there are no senders dd-on to OP (Open hortest-path irst, a link-state, intra-domain routing protocol) Multicast-capable routers flag link state routing advertisements Link-state packets include multicast group addresses to which local members have joined Routing algorithm augmented to compute shortest-path distribution tree from a source to any set of destinations 7

8 //8 Example Link ailure/topology hange Z Z W W T T Receiver Receiver Receiver Receiver Membership hange Impact on Route omputation W T Receiver Receiver Z Receiver annot pre-compute multicast trees for all possible sources ompute on demand when first packet from a source to a group arrives New link-state advertisement» May lead to addition or deletion of outgoing interfaces if it contains different group addresses» May lead to re-computation of entire tree if links are changed istance-vector Multicast Routing Example Topology VMRP consists of two major components:» conventional distance-vector routing protocol (like RIP)» protocol for determining how to forward multicast packets, based on the routing table VMRP router forwards a packet if» The packet arrived from the link used to reach the source of the packet (reverse path forwarding check RP)» If downstream links have not pruned the tree

9 //8 roadcast with Truncation Prune Prune (s,g) Prune (s,g) 9 9 raft teady tate Report (g) raft (s,g) raft (s,g) ailure of IP Multicast upporting Multicast on the Internet Not widely deployed even after years!» Use carefully e.g., on LN or campus, rarely over WN Various failings» calability of routing protocols» Hard to manage» Hard to implement TP equivalent» Hard to get applications to use IP Multicast without existing wide deployment» Hard to get router vendors to support functionality and hard to get IPs to configure routers to enable pplication IP Network Internet architecture? t which layer should multicast be implemented?? lternative: application layer multicast peer-to-peer 9

IP Forwarding Computer Networking. Routes from Node A. Graph Model. Lecture 10: Intra-Domain Routing

IP Forwarding Computer Networking. Routes from Node A. Graph Model. Lecture 10: Intra-Domain Routing IP orwarding - omputer Networking Lecture : Intra-omain Routing RIP (Routing Information Protocol) & OSP (Open Shortest Path irst) The Story So ar IP addresses are structure to reflect Internet structure

More information

IP Forwarding Computer Networking. Graph Model. Routes from Node A. Lecture 11: Intra-Domain Routing

IP Forwarding Computer Networking. Graph Model. Routes from Node A. Lecture 11: Intra-Domain Routing IP Forwarding 5-44 omputer Networking Lecture : Intra-omain Routing RIP (Routing Information Protocol) & OSPF (Open Shortest Path First) The Story So Far IP addresses are structured to reflect Internet

More information

Third Generation Routers

Third Generation Routers IP orwarding 5-5- omputer Networking 5- Lecture : Routing Peter Steenkiste all www.cs.cmu.edu/~prs/5-- The Story So ar IP addresses are structured to reflect Internet structure IP packet headers carry

More information

More on Network Routing and Internet Protocol

More on Network Routing and Internet Protocol omputer Networks //03 More on Network Routing and Internet Protocol Kai Shen Network Routing Link state routing: ijkstra s algorithm efficient approach to calculate least cost routes all routers need complete

More information

Computer Networking. Intra-Domain Routing. RIP (Routing Information Protocol) & OSPF (Open Shortest Path First)

Computer Networking. Intra-Domain Routing. RIP (Routing Information Protocol) & OSPF (Open Shortest Path First) Computer Networking Intra-Domain Routing RIP (Routing Information Protocol) & OSPF (Open Shortest Path First) IP Forwarding The Story So Far IP addresses are structured to reflect Internet structure IP

More information

Routers & Routing : Computer Networking. Binary Search on Ranges. Speeding up Prefix Match - Alternatives

Routers & Routing : Computer Networking. Binary Search on Ranges. Speeding up Prefix Match - Alternatives Routers & Routing -44: omputer Networking High-speed router architecture Intro to routing protocols ssigned reading [McK9] Fast Switched ackplane for a Gigabit Switched Router Know RIP/OSPF L-4 Intra-omain

More information

What is Routing? EE 122: Shortest Path Routing. Example. Internet Routing. Ion Stoica TAs: Junda Liu, DK Moon, David Zats

What is Routing? EE 122: Shortest Path Routing. Example. Internet Routing. Ion Stoica TAs: Junda Liu, DK Moon, David Zats What is Routing? Routing implements the core function of a network: : Shortest Path Routing Ion Stoica Ts: Junda Liu, K Moon, avid Zats http://inst.eecs.berkeley.edu/~ee/fa9 (Materials with thanks to Vern

More information

Multicast Routing : Computer Networking. Example Applications. Overview

Multicast Routing : Computer Networking. Example Applications. Overview Multicast outing 5-744: Computer Networking Unicast: one source to one estination Multicast: one source to many estinations Two main functions: Efficient ata istribution Logical naming of a group L-0 Multicast

More information

Multicast Routing. Overview. Multicast Efficient Data Distribution

Multicast Routing. Overview. Multicast Efficient Data Distribution Multicast outing Unicast: one source to one destination Multicast: one source to many destinations Two main functions: Efficient data distribution Logical naming of a group L-20 Multicast 2 Overview What/Why

More information

CS 457 Networking and the Internet. Shortest-Path Problem. Dijkstra s Shortest-Path Algorithm 9/29/16. Fall 2016

CS 457 Networking and the Internet. Shortest-Path Problem. Dijkstra s Shortest-Path Algorithm 9/29/16. Fall 2016 9/9/6 S 7 Networking and the Internet Fall 06 Shortest-Path Problem Given: network topology with link costs c(x,y): link cost from node x to node y Infinity if x and y are not direct neighbors ompute:

More information

CS 43: Computer Networks. 23: Routing Algorithms November 14, 2018

CS 43: Computer Networks. 23: Routing Algorithms November 14, 2018 S 3: omputer Networks 3: Routing lgorithms November, 08 Last class NT: Network ddress Translators: NT is mostly bad, but in some cases, it s a necessary evil. IPv6: Simpler, faster, better Tunneling: IPv6

More information

ETSF10 Internet Protocols Routing on the Internet

ETSF10 Internet Protocols Routing on the Internet ETSF10 Internet Protocols Routing on the Internet 2014, Part 2, Lecture 1.2 Jens Andersson Internet Hierarchy 2014-11-10 ETSF05/ETSF05/ETSF10 - Internet Protocols 2 Hierarchical Routing aggregate routers

More information

MLD. MLDv1 (defined in RFC 2710), which is derived from IGMPv2. MLDv2 (defined in RFC 3810), which is derived from IGMPv3.

MLD. MLDv1 (defined in RFC 2710), which is derived from IGMPv2. MLDv2 (defined in RFC 3810), which is derived from IGMPv3. Introduction to Multicast listener discovery protocol () is used by an IPv6 router to discover the presence of multicast listeners on directly-attached subnets. Multicast listeners are nodes wishing to

More information

Table of Contents 1 PIM Configuration 1-1

Table of Contents 1 PIM Configuration 1-1 Table of Contents 1 PIM Configuration 1-1 PIM Overview 1-1 Introduction to PIM-DM 1-2 How PIM-DM Works 1-2 Introduction to PIM-SM 1-4 How PIM-SM Works 1-5 Introduction to Administrative Scoping in PIM-SM

More information

What is Multicasting? Multicasting Fundamentals. Unicast Transmission. Agenda. L70 - Multicasting Fundamentals. L70 - Multicasting Fundamentals

What is Multicasting? Multicasting Fundamentals. Unicast Transmission. Agenda. L70 - Multicasting Fundamentals. L70 - Multicasting Fundamentals What is Multicasting? Multicasting Fundamentals Unicast transmission transmitting a packet to one receiver point-to-point transmission used by most applications today Multicast transmission transmitting

More information

EE 122: Intra-domain routing

EE 122: Intra-domain routing EE : Intra-domain routing Ion Stoica September 0, 00 (* this presentation is based on the on-line slides of J. Kurose & K. Rose) Internet Routing Internet organized as a two level hierarchy First level

More information

Network service model. Network service model. Network Layer (part 1) Virtual circuits. By the end of this lecture, you should be able to.

Network service model. Network service model. Network Layer (part 1) Virtual circuits. By the end of this lecture, you should be able to. Netork Layer (part ) y the end of this lecture, you should be able to. xplain the operation of distance vector routing algorithm xplain shortest path routing algorithm escribe the major points of RIP and

More information

IP Multicast Technology Overview

IP Multicast Technology Overview IP multicast is a bandwidth-conserving technology that reduces traffic by delivering a single stream of information simultaneously to potentially thousands of businesses and homes. Applications that take

More information

Advanced Networking. Multicast

Advanced Networking. Multicast Advanced Networking Multicast Renato Lo Cigno Renato.LoCigno@dit.unitn.it Homepage: disi.unitn.it/locigno/index.php/teaching-duties/advanced-networking Multicasting Addresses that refer to group of hosts

More information

CEN445 Network Protocols and Algorithms. Chapter 2. Routing Algorithms. Dr. Ridha Ouni

CEN445 Network Protocols and Algorithms. Chapter 2. Routing Algorithms. Dr. Ridha Ouni 3/4/04 EN44 Network Protocols and lgorithms hapter Routing lgorithms Dr. Ridha Ouni Department of omputer Engineering ollege of omputer and Information Sciences King Saud University References Some slides

More information

Multicast Communications

Multicast Communications Multicast Communications Multicast communications refers to one-to-many or many-tomany communications. Unicast Broadcast Multicast Dragkedja IP Multicasting refers to the implementation of multicast communication

More information

List of groups known at each router. Router gets those using IGMP. And where they are in use Where members are located. Enhancement to OSPF

List of groups known at each router. Router gets those using IGMP. And where they are in use Where members are located. Enhancement to OSPF Multicast OSPF OSPF Open Shortest Path First Link State Protocol Use Dijkstra s algorithm (SPF) Calculate shortest path from the router to every possible destination Areas Limit the information volume

More information

Configuring IP Multicast Routing

Configuring IP Multicast Routing 34 CHAPTER This chapter describes how to configure IP multicast routing on the Cisco ME 3400 Ethernet Access switch. IP multicasting is a more efficient way to use network resources, especially for bandwidth-intensive

More information

IP Multicast. What is multicast?

IP Multicast. What is multicast? IP Multicast 1 What is multicast? IP(v4) allows a host to send packets to a single host (unicast), or to all hosts (broadcast). Multicast allows a host to send packets to a subset of all host called a

More information

IPv6 PIM. Based on the forwarding mechanism, IPv6 PIM falls into two modes:

IPv6 PIM. Based on the forwarding mechanism, IPv6 PIM falls into two modes: Overview Protocol Independent Multicast for IPv6 () provides IPv6 multicast forwarding by leveraging static routes or IPv6 unicast routing tables generated by any IPv6 unicast routing protocol, such as

More information

ASM. Engineering Workshops

ASM. Engineering Workshops 1 ASM 2 ASM Allows SPTs and RPTs RP: Matches senders with receivers Provides network source discovery Typically uses RPT to bootstrap SPT RPs can be learned via: Static configuration recommended Anycast-RP

More information

WAN Technology and Routing

WAN Technology and Routing PS 60 - Network Programming WN Technology and Routing Michele Weigle epartment of omputer Science lemson University mweigle@cs.clemson.edu March, 00 http://www.cs.clemson.edu/~mweigle/courses/cpsc60 WN

More information

Table of Contents 1 IGMP Configuration 1-1

Table of Contents 1 IGMP Configuration 1-1 Table of Contents 1 IGMP Configuration 1-1 IGMP Overview 1-1 IGMP Versions 1-1 Introduction to IGMPv1 1-2 Enhancements in IGMPv2 1-3 Enhancements in IGMPv3 1-4 IGMP SSM Mapping 1-5 Protocols and Standards

More information

Multicast Technology White Paper

Multicast Technology White Paper Multicast Technology White Paper Keywords: Multicast, IGMP, IGMP Snooping, PIM, MBGP, MSDP, and SSM Mapping Abstract: The multicast technology implements high-efficiency point-to-multipoint data transmission

More information

Computer Networks. Routing

Computer Networks. Routing Computer Networks Routing Topics Link State Routing (Continued) Hierarchical Routing Broadcast Routing Sending distinct packets Flooding Multi-destination routing Using spanning tree Reverse path forwarding

More information

Multicast Communications. Slide Set were original prepared by Dr. Tatsuya Susa

Multicast Communications. Slide Set were original prepared by Dr. Tatsuya Susa Multicast Communications Slide Set were original prepared by Dr. Tatsuya Susa Outline 1. Advantages of multicast 2. Multicast addressing 3. Multicast Routing Protocols 4. Multicast in the Internet 5. IGMP

More information

Review: Routing in Packet Networks Shortest Path Algorithms: Dijkstra s & Bellman-Ford. Routing: Issues

Review: Routing in Packet Networks Shortest Path Algorithms: Dijkstra s & Bellman-Ford. Routing: Issues Review: Routing in Packet Networks Shortest Path lgorithms: ijkstra s & ellman-ford Routing: Issues How are routing tables determined? Who determines table entries? What info used in determining table

More information

Advanced Network Training Multicast

Advanced Network Training Multicast Division of Brocade Advanced Network Training Multicast Larry Mathews Systems Engineer lmathews@brocade.com Training Objectives Session will concentrate on Multicast with emphasis on Protocol Independent

More information

CSE/EE 461 Distance Vector Routing

CSE/EE 461 Distance Vector Routing S/ 46 istance Vector Routing Last Time Introduction to the Network layer Internetworks atagram and virtual circuit services Internet Protocol (IP) packet format The Network layer Provides end-to-end data

More information

COMP 3331/9331: Computer Networks and Applications

COMP 3331/9331: Computer Networks and Applications OMP /9: omputer Networks and pplications Week 9 Network Layer: Routing Reading Guide: hapter 4: Sections 4.5 Network Layer nnouncements v Labs Lab 4 ongestion ontrol Lab 5 Simple Router (start up for ssignment,

More information

IP Multicast. Falko Dressler Regionales Rechenzentrum Grundzüge der Datenkommunikation IP Multicast

IP Multicast. Falko Dressler Regionales Rechenzentrum Grundzüge der Datenkommunikation IP Multicast Falko Dressler Regionales Rechenzentrum falko.dressler@rrze.uni-erlangen.de 1 Agenda Basics Principles of IP multicast, addressing, TTL Internet Group Management Protocol (IGMP) IGMPv1, v2, v3 Layer-2

More information

FSOS Multicast Configuration Guide

FSOS Multicast Configuration Guide FSOS Multicast Configuration Guide Contents 1 Configuring IP Multicast-Routing...6 1.1 Overview...6 1.2 Configuration... 6 1.3 Validation... 6 2 Configuring IGMP... 8 2.1 Overview...8 2.2 References...9

More information

Module 7 Implementing Multicast

Module 7 Implementing Multicast Module 7 Implementing Multicast Lesson 1 Explaining Multicast Why Multicast? Used when sending same data to multiple receivers Better bandwidth utilization Less host/router processing Used when addresses

More information

Configuring IP Multicast Routing

Configuring IP Multicast Routing CHAPTER 46 This chapter describes how to configure IP multicast routing on the Catalyst 3750-E or 3560-E switch. IP multicasting is a more efficient way to use network resources, especially for bandwidth-intensive

More information

Distance-Vector Routing: Distributed B-F (cont.)

Distance-Vector Routing: Distributed B-F (cont.) istance-vector Routing: istributed - (cont.) xample [ istributed ellman-ord lgorithm ] ssume each node i maintains an entry (R(i,x), L(i,x)), where R(i,x) is the next node along the current shortest path

More information

Bridges. Bridge Functions. Example of No-frills Bridge. No-frills Bridges. Example of Learning Bridge. Learning Bridges

Bridges. Bridge Functions. Example of No-frills Bridge. No-frills Bridges. Example of Learning Bridge. Learning Bridges ridge Functions To extend size of LNs either geographically or in terms number of users. Protocols that include collisions can be performed in a collision domain of limited size. In ring networks the number

More information

Routing. 9: Intro to Routing Algorithms. Routing. Roadmap. Routing Algorithm classification: Static or Dynamic?

Routing. 9: Intro to Routing Algorithms. Routing. Roadmap. Routing Algorithm classification: Static or Dynamic? Routing 9: Intro to Routing lgorithms Last Modified: // :: PM : Netork Layer a- IP Routing each router is supposed to send each IP datagram one step closer to its Ho do they do that? Static Routing Hierarchical

More information

FiberstoreOS IPv6 Multicast Configuration Guide

FiberstoreOS IPv6 Multicast Configuration Guide FiberstoreOS IPv6 Multicast Configuration Guide Contents 1 Configuring IPv6 Multicast-Routing... 5 1.1 Overview... 5 1.2 Configuration... 5 1.3 Validation...5 2 Configuring MLD... 7 2.1 Overview... 7 2.2

More information

Multicast H3C Low-End Ethernet Switches Configuration Examples. Table of Contents

Multicast H3C Low-End Ethernet Switches Configuration Examples. Table of Contents Table of Contents Table of Contents Chapter 1 Protocol Overview... 1-1 1.1 Overview... 1-1 1.2 Support of Features... 1-2 1.3 Configuration Guidance... 1-3 1.3.1 Configuring IGMP Snooping... 1-3 1.3.2

More information

ITEC310 Computer Networks II

ITEC310 Computer Networks II ITEC310 Computer Networks II Chapter 22 Network Layer:, and Routing Department of Information Technology Eastern Mediterranean University Objectives 2/131 After completing this chapter you should be able

More information

CSE 123A Computer Networks

CSE 123A Computer Networks CSE 123A Computer Networks Winter 2005 Lecture 12 Internet Routing: Multicast Today: Multicast routing Multicast service model Host interface Host-router interactions (IGMP) Multicast Routing Limiters

More information

Routing Unicast routing protocols

Routing Unicast routing protocols Routing Unicast routing protocols Jens A Andersson Electrical and Information Technology R1 Choosing an Optimal Path R4 5 R7 5 10 40 R6 6 5 B R2 15 A 20 4 10 10 R8 R3 5 10 R5 1 Router A router is a type

More information

Configuring IP Multicast Routing

Configuring IP Multicast Routing 39 CHAPTER This chapter describes how to configure IP multicast routing on the Catalyst 3560 switch. IP multicasting is a more efficient way to use network resources, especially for bandwidth-intensive

More information

Multicast service model Host interface Host-router interactions (IGMP) Multicast Routing Distance Vector Link State. Shared tree.

Multicast service model Host interface Host-router interactions (IGMP) Multicast Routing Distance Vector Link State. Shared tree. CSE 123A Computer Networks Fall 2009 Lecture 10 Internet Routing: Multicast Today: Multicast routing Multicast service model Host interface Host-router interactions (IGMP) Multicast Routing Distance Vector

More information

Exercises to Communication Systems

Exercises to Communication Systems Exercises to Communication Systems IP Multicast Additional Slides Dr.-Ing. Falko Dressler Department of Computer Science 7 University of Erlangen ÜKS, WS 05/06 1 IP Multicast Introduction Internet Group

More information

Overview. Problem: Find lowest cost path between two nodes Factors static: topology dynamic: load

Overview. Problem: Find lowest cost path between two nodes Factors static: topology dynamic: load Dynamic Routing Overview Forwarding vs Routing forwarding: to select an output port based on destination address and routing table routing: process by which routing table is built Network as a Graph C

More information

Multicast Protocol Configuration Examples H3C S7500 Series Ethernet Switches Release Table of Contents

Multicast Protocol Configuration Examples H3C S7500 Series Ethernet Switches Release Table of Contents Table of Contents Table of Contents Chapter 1 Multicast Protocol Overview... 1-1 1.1 Overview... 1-1 1.2 Configuration Guidance... 1-2 1.2.1 Configuring IGMP Snooping... 1-2 1.2.2 Configuring IGMP... 1-5

More information

What is it? Basics. Moving from DigiComms I. Digital Communications II

What is it? Basics. Moving from DigiComms I. Digital Communications II What is it? Routing igital ommunications II Process of finding a path from a source to every destination in the network Suppose you want to connect to ntarctica from your desktop What route should you

More information

Distance vector and RIP

Distance vector and RIP DD2490 p4 2008 Distance vector and RIP Olof Hagsand KTHNOC/NADA Literature RIP lab RFC 245: RIPv2. Sections 1 2 contains some introduction that can be useful to understand the context in which RIP is specified..1.4

More information

ETSF10 Internet Protocols Routing on the Internet

ETSF10 Internet Protocols Routing on the Internet ETSF10 Internet Protocols Routing on the Internet 2013, Part 2, Lecture 1.2 Jens Andersson (Kaan Bür) Routing on the Internet Unicast routing protocols (part 2) [ed.5 ch.20.3] Multicast routing, IGMP [ed.5

More information

Initialization: Loop until all nodes in N

Initialization: Loop until all nodes in N Routing Routing lgorithm classification Routing protocol Goal: determine good path (sequence of routers) thru netork from source to dest. Graph abstraction for routing s: graph nodes are routers graph

More information

Advanced Computer Networks. Lecture 4 Internetworking and Routing

Advanced Computer Networks. Lecture 4 Internetworking and Routing Advanced Computer Networks Lecture 4 Internetworking and Routing 1 Techniques Naïve: Flooding Outline Distance vector: Distributed Bellman Ford Algorithm Link state: Dijkstra s Shortest Path First-based

More information

RIP Configuration. RIP Overview. Operation of RIP. Introduction. RIP routing table. RIP timers

RIP Configuration. RIP Overview. Operation of RIP. Introduction. RIP routing table. RIP timers Table of Contents RIP Configuration 1 RIP Overview 1 Operation of RIP 1 Operation of RIP 2 RIP Version 2 RIP Message Format 3 Protocols and Standards 4 Configuring RIP Basic Functions 5 Configuration Prerequisites

More information

Why multicast? The concept of multicast Multicast groups Multicast addressing Multicast routing protocols MBONE Multicast applications Conclusions

Why multicast? The concept of multicast Multicast groups Multicast addressing Multicast routing protocols MBONE Multicast applications Conclusions Tuomo Karhapää tuomo.karhapaa@otaverkko.fi Otaverkko Oy Why multicast? The concept of multicast Multicast groups Multicast addressing Multicast routing protocols MBONE Multicast applications Conclusions

More information

Let s focus on clarifying questions. More Routing. Logic Refresher. Warning. Short Summary of Course. 10 Years from Now.

Let s focus on clarifying questions. More Routing. Logic Refresher. Warning. Short Summary of Course. 10 Years from Now. Let s focus on clarifying questions I love the degree of interaction in this year s class More Routing all Scott Shenker http://inst.eecs.berkeley.edu/~ee/ Materials with thanks to Jennifer Rexford, Ion

More information

Multicast Communications. Tarik Čičić, 4. March. 2016

Multicast Communications. Tarik Čičić, 4. March. 2016 Multicast Communications Tarik Čičić, 4. March. 06 Overview One-to-many communication, why and how Algorithmic approach: Steiner trees Practical algorithms Multicast tree types Basic concepts in multicast

More information

Configuring IP Multicast Routing

Configuring IP Multicast Routing CHAPTER 45 This chapter describes how to configure IP multicast routing on the Catalyst 3750 Metro switch. IP multicasting is a more efficient way to use network resources, especially for bandwidth-intensive

More information

Configuring a Rendezvous Point

Configuring a Rendezvous Point Version History Version Number Date Notes 1 03/15/2002 This document was created. The purpose of this document is to outline four recommended methods for configuring a rendezvous point (RP) in a Protocol

More information

ÉCOLE POLYTECHNIQUE FÉDÉRALE DE LAUSANNE! 1. Link state flooding topology information finding the shortest paths (Dijkstra)

ÉCOLE POLYTECHNIQUE FÉDÉRALE DE LAUSANNE! 1. Link state flooding topology information finding the shortest paths (Dijkstra) ontents ÉOL POLYTHNIQU ÉÉRL LUSNN! 1. Link state flooding topology information finding the shortest paths (ijkstra)! 2. Hierarchical routing with areas! 3. OSP Link State Routing database modelling neighbor

More information

Discussion 8: Link State Routing. CSE 123: Computer Networks Marti Motoyama & Chris Kanich

Discussion 8: Link State Routing. CSE 123: Computer Networks Marti Motoyama & Chris Kanich iscussion 8: Link State Routing S : omputer Networks Marti Motoyama & hris Kanich Schedule Project Questions: mail hris, post to moodle, or attend his OH Homework Questions? Link State iscussion S iscussion

More information

Routing Outline. EECS 122, Lecture 15

Routing Outline. EECS 122, Lecture 15 Fall & Walrand Lecture 5 Outline EECS, Lecture 5 Kevin Fall kfall@cs.berkeley.edu Jean Walrand wlr@eecs.berkeley.edu Definition/Key Questions Distance Vector Link State Comparison Variations EECS - Fall

More information

PIM Configuration. Page 1 of 9

PIM Configuration. Page 1 of 9 PIM Configuration Page 1 of 9 Contents Contents...2 Chapter 1 PIM Configuration...3 1.1 PIM Description...3 1.1.1 Principles of PIM-DM...3 1.1.2 Principles of PIM-SM...4 1.1.3 Principles of PIM-SSM...5

More information

Multicast routing protocols

Multicast routing protocols Multicast routing protocols IGMP IP Group Management Protocol PIM Protocol Independent Multicast MOSPF Multicast OSPF DVMRP DV Multicast Routing Protocol E7310-Multicast-2/Comnet 1 Multicast in local area

More information

IP Multicasting: Explaining Multicast Cisco Systems, Inc. All rights reserved. Cisco Academy

IP Multicasting: Explaining Multicast Cisco Systems, Inc. All rights reserved. Cisco Academy IP Multicasting: Explaining Multicast 2008 Cisco Systems, Inc. All rights reserved. Cisco Academy 1 IP Multicast Distribute information to large audiences over an IP network 2008 Cisco Systems, Inc. All

More information

Routing. Jens A Andersson Communication Systems

Routing. Jens A Andersson Communication Systems Routing Jens A Andersson Communication Systems R1 Choosing an Optimal Path R4 5 R7 5 10 40 R6 6 5 B R2 15 A 20 4 10 10 R8 R3 5 R5 10 Router A router is a type of internetworking device that passes data

More information

Developing IP Muiticast Networks

Developing IP Muiticast Networks Developing IP Muiticast Networks Volume I Beau Williamson Cisco SYSTEMS CISCO PRESS Cisco Press 201 West 103rd Street Indianapolis, IN 46290 USA Table of Contents Introduction xviii Part I Fundamentals

More information

Chapter 21 RIP Configuration Guidelines

Chapter 21 RIP Configuration Guidelines Chapter 21 RIP Configuration Guidelines To configure the Routing Information Protocol (RIP), you include the following statements: protocols { rip { any-sender; authentication-key password; authentication-type

More information

Computer Networks. Wenzhong Li. Nanjing University

Computer Networks. Wenzhong Li. Nanjing University Computer Networks Wenzhong Li Nanjing University 1 Chapter 4. Internetworking The Internet Protocol IP Address ARP and DHCP ICMP IPv6 Mobile IP Internet Routing BGP and OSPF IP Multicasting Multiprotocol

More information

DD2490 p IP Multicast routing. Multicast routing. Olof Hagsand KTH CSC

DD2490 p IP Multicast routing. Multicast routing. Olof Hagsand KTH CSC DD2490 p4 2010 IP Multicast routing Multicast routing Olof Hagsand KTH CSC 1 Literature RFC 4601 Section 3 (you may need some definitions from Section 2). See reading instructions on web. 2 Deployment

More information

EECS 122, Lecture 16. Link Costs and Metrics. Traffic-Sensitive Metrics. Traffic-Sensitive Metrics. Static Cost Metrics.

EECS 122, Lecture 16. Link Costs and Metrics. Traffic-Sensitive Metrics. Traffic-Sensitive Metrics. Static Cost Metrics. EECS 122, Lecture 16 Kevin Fall kfall@cs.berkeley.edu edu Link Costs and Metrics Routing protocols compute shortest/cheapest paths using some optimization criteria Choice of criteria has strong effect

More information

Hosts & Router. Multicast sent. Forwarded by Router as members exist on other LAN TRANSCEIVER TRANSCEIVER TRANSCEIVER TRANSCEIVER. 10Bbase2.

Hosts & Router. Multicast sent. Forwarded by Router as members exist on other LAN TRANSCEIVER TRANSCEIVER TRANSCEIVER TRANSCEIVER. 10Bbase2. Link Level gain Ethernet Base Hosts Router Base Multicast sent Base Forwarded by Router as members exist on other L Base Group Members receive packet Other hosts ignore it Easy on traditional cable ethernet

More information

IPv6 Multicast: PIM Sparse Mode

IPv6 Multicast: PIM Sparse Mode Finding Feature Information, page 1 Information About IPv6 Multicast PIM Sparse Mode, page 1 How to Configure IPv6 Multicast PIM Sparse Mode, page 6 Configuration Examples for IPv6 Multicast PIM Sparse

More information

Multicast EECS 122: Lecture 16

Multicast EECS 122: Lecture 16 Multicast EECS 1: Lecture 16 Department of Electrical Engineering and Computer Sciences University of California Berkeley Broadcasting to Groups Many applications are not one-one Broadcast Group collaboration

More information

TCP/IP Networking. Part 3: Forwarding and Routing

TCP/IP Networking. Part 3: Forwarding and Routing TP/IP Networking Part 3: Forwarding and Routing Routing of IP Packets There are two parts to routing IP packets:. How to pass a packet from an input interface to the output interface of a router ( IP forwarding

More information

Lecture 19: Multicast. CSE 123: Computer Networks Stefan Savage

Lecture 19: Multicast. CSE 123: Computer Networks Stefan Savage Lecture 19: Multicast CSE 123: Computer Networks Stefan Savage Today: Multicast routing Multicast service model Host interface Host-router interactions (IGMP) Multicast outing Limiters Distance Vector

More information

BASIC MULTICAST TROUBLESHOOTING. Piotr Wojciechowski (CCIE #25543)

BASIC MULTICAST TROUBLESHOOTING. Piotr Wojciechowski (CCIE #25543) BASIC MULTICAST TROUBLESHOOTING Piotr Wojciechowski (CCIE #25543) ABOUT ME Senior Network Engineer MSO at VeriFone Inc. Previously Network Solutions Architect at one of top polish IT integrators CCIE #25543

More information

CSCE 463/612 Networks and Distributed Processing Spring 2018

CSCE 463/612 Networks and Distributed Processing Spring 2018 CSCE 463/612 Networks and Distributed Processing Spring 2018 Network Layer IV Dmitri Loguinov Texas A&M University April 12, 2018 Original slides copyright 1996-2004 J.F Kurose and K.W. Ross 1 Chapter

More information

Lecture 9. Network Layer (cont d) Network Layer 1-1

Lecture 9. Network Layer (cont d) Network Layer 1-1 Lecture 9 Network Layer (cont d) Network Layer 1-1 Agenda Routing Tables Unicast and Multicast Routing Protocols Routing Algorithms Link State and Distance Vector Routing Information and Open Shortest

More information

Lecture 4. The Network Layer (cont d)

Lecture 4. The Network Layer (cont d) Lecture 4 The Network Layer (cont d) Agenda Routing Tables Unicast and Multicast Routing Protocols Routing Algorithms Link State and Distance Vector Routing Information and Open Shortest Path First Protocols

More information

Chapter 4: Network Layer

Chapter 4: Network Layer hapter 4: Network Layer hapter goals: understand principles behind layer services: routing (path selection) dealing with scale how a router works advanced topics: IPv6, multicast instantiation and implementation

More information

AODV Route Requests (RREQ) are forwarded in a manner similar to DSR

AODV Route Requests (RREQ) are forwarded in a manner similar to DSR d oc On-emand istance Vector (OV) R includes source routes in packet headers Resulting large headers can sometimes degrade performance particularly when data contents of a packet are small OV attempts

More information

06/02/ Local & Metropolitan Area Networks. Overview. Routing algorithm ACOE322. Lecture 6 Routing

06/02/ Local & Metropolitan Area Networks. Overview. Routing algorithm ACOE322. Lecture 6 Routing Local & Metropolitan rea Networks OE3 Lecture 6 Routing r. L. hristofi Overview The main function of the network layer is routing packets from the source to the destination machine. The only exception

More information

Network Layer (Routing)

Network Layer (Routing) Network Layer (Routing) Topics Network service models Datagrams (packets), virtual circuits IP (Internet Protocol) Internetworking orwarding (Longest Matching Prefix) Helpers: ARP and DHP ragmentation

More information

IPv6 Multicast: PIM Sparse Mode

IPv6 Multicast: PIM Sparse Mode IPv6 multicast provides support for intradomain multicast routing using PIM sparse mode (PIM-SM). PIM-SM uses unicast routing to provide reverse-path information for multicast tree building, but it is

More information

Configuring MLD. Overview. MLD versions. How MLDv1 operates. MLD querier election

Configuring MLD. Overview. MLD versions. How MLDv1 operates. MLD querier election Contents Configuring MLD 1 Overview 1 MLD versions 1 How MLDv1 operates 1 How MLDv2 operates 3 MLD message types 4 MLD SSM mapping 7 MLD proxying 8 Protocols and standards 9 MLD configuration task list

More information

Operation Manual IPv4 Routing H3C S3610&S5510 Series Ethernet Switches. Table of Contents

Operation Manual IPv4 Routing H3C S3610&S5510 Series Ethernet Switches. Table of Contents Table of Contents Table of Contents Chapter 1 Static Routing Configuration... 1-1 1.1 Introduction... 1-1 1.1.1 Static Route... 1-1 1.1.2 Default Route... 1-1 1.1.3 Application Environment of Static Routing...

More information

Contents. Configuring MSDP 1

Contents. Configuring MSDP 1 Contents Configuring MSDP 1 Overview 1 How MSDP works 1 MSDP support for VPNs 6 Protocols and standards 6 MSDP configuration task list 7 Configuring basic MSDP features 7 Configuration prerequisites 7

More information

Intra-domain Routing

Intra-domain Routing Intra-domain Routing Outline Introduction to Routing Distance Vector Algorithm CS 640 1 Goal Build router forwarding tables in an internetwork using intra-domain routing protocols High level approach Distributed

More information

Fairness Example: high priority for nearby stations Optimality Efficiency overhead

Fairness Example: high priority for nearby stations Optimality Efficiency overhead Routing Requirements: Correctness Simplicity Robustness Under localized failures and overloads Stability React too slow or too fast Fairness Example: high priority for nearby stations Optimality Efficiency

More information

CS118 Discussion Week 7. Taqi

CS118 Discussion Week 7. Taqi CS118 Discussion Week 7 Taqi Outline Hints for project 2 Lecture review: routing About Course Project 2 Please implement byte-stream reliable data transfer Cwnd is in unit of bytes, not packets How to

More information

IP Multicast Technology Overview

IP Multicast Technology Overview IP multicast is a bandwidth-conserving technology that reduces traffic by delivering a single stream of information simultaneously to potentially thousands of businesses and homes. Applications that take

More information

HP 5920 & 5900 Switch Series

HP 5920 & 5900 Switch Series HP 5920 & 5900 Switch Series IP Multicast Configuration Guide Part number: 5998-3373 Software version: Release2207 Document version: 6W100-20121130 Legal and notice information Copyright 2012 Hewlett-Packard

More information

Routing in a network

Routing in a network Routing in a network Focus is small to medium size networks, not yet the Internet Overview Then Distance vector algorithm (RIP) Link state algorithm (OSPF) Talk about routing more generally E.g., cost

More information

CSE/EE 461 Lecture 7 Bridging LANs. Last Two Times. This Time -- Switching (a.k.a. Bridging)

CSE/EE 461 Lecture 7 Bridging LANs. Last Two Times. This Time -- Switching (a.k.a. Bridging) S/ 461 Lecture 7 ridging LNs Last Two Times Medium ccess ontrol (M) protocols Part of the Link Layer t the heart of Local rea Networks (LNs) ow do multiple parties share a wire or the air? Random access

More information

Hierarchical Routing. Our routing study thus far - idealization all routers identical network flat not true in practice

Hierarchical Routing. Our routing study thus far - idealization all routers identical network flat not true in practice Hierarchical Routing Our routing study thus far - idealization all routers identical network flat not true in practice scale: with 200 million destinations: can t store all destinations in routing tables!

More information