Stig Venaas, Balaji Ganesh, Kesavan Thiruvenkatasamy,

Slides:



Advertisements
Similar presentations
Draft-ietf-pim-port-06. port-06 update Changes made in response to second wglc comments and following discussion Many minor editorial issues fixed Changed.
Advertisements

OSPF Header OSPF HEADER OSPF HEADER for this project Types we will use
RIP V1 W.lilakiatsakun.
Cs/ee 143 Communication Networks Chapter 6 Internetworking Text: Walrand & Parekh, 2010 Steven Low CMS, EE, Caltech.
Courtesy: Nick McKeown, Stanford
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Peer to Peer Discovery Nate Thrasher. Peer to Peer Discovery ● 2 Basic Categories – Hardware Discovery – Information Discovery ● JXTA (
1 Internet Networking Spring 2006 Tutorial 7 DVMRP.
1 DYNAMIC HOST REGISTRATION -- INTERNET GROUP MANAGEMENT PROTOCOL Yi-Cheng Lin.
Routing.
Routing Information Protocol (RIP). Intra-and Interdomain Routing An internet is divided into autonomous systems. An autonomous system (AS) is a group.
Spring 2008CS 3321 Intradomain Routing Outline Algorithms Scalability.
26-TCP Dr. John P. Abraham Professor UTPA. TCP  Transmission control protocol, another transport layer protocol.  Reliable delivery  Tcp must compensate.
Internetworking Internet: A network among networks, or a network of networks Allows accommodation of multiple network technologies Universal Service Routers.
Interdomain multicast routing with IPv6 Stig Venaas University of Southampton Jerome Durand RENATER Mickael Hoerdt University Louis Pasteur - LSIIT.
Interdomain IPv6 multicast Stig Venaas UNINETT. PIM-SM and Rendezvous Points Interdomain multicast routing is usually done with a protocol called PIM-SM.
Spring 2006CS 3321 Intradomain Routing Outline Algorithms Scalability.
Chapter 24 Transport Control Protocol (TCP) Layer 4 protocol Responsible for reliable end-to-end transmission Provides illusion of reliable network to.
IPv6 Site Renumbering Gap Analysis draft-ietf-6renum-gap-analysis-01 draft-ietf-6renum-gap-analysis-01 Bing Liu(speaker), Sheng Jiang, Brian.E.Carpenter.
Draft-ietf-pim-source- discovery-bsr-01 IJsbrand Wijnands, Stig Venaas, Michael Brig,
Draft-cardenas-dff-05.txt March 26, 2012 Ulrich Herberg (Fujitsu)
ICMPv6 Error Message Types Informational Message Types.
Magnus Westerlund 1 The RTSP Core specification draft-ietf-mmusic-rfc2326bis-06.txt Magnus Westerlund Aravind Narasimhan Rob Lanphier Anup Rao Henning.
Spring 2000CS 4611 Routing Outline Algorithms Scalability.
1 Chapter 4: Internetworking (IP Routing) Dr. Rocky K. C. Chang 16 March 2004.
RIP Routing Protocol. 2 Routing Recall: There are two parts to routing IP packets: 1. How to pass a packet from an input interface to the output interface.
Lecture 7. Building Forwarding Tables There are several methods Static Method Dynamic Methods Centralized Distributed Distance Vector Link State.
CS 6401 Intra-domain Routing Outline Introduction to Routing Distance Vector Algorithm.
Network Layer 3 Application Presentation Session Transport Network Data Link Physical OSI Model.
Address Resolution Protocol Yasir Jan 20 th March 2008 Future Internet.
DVMRP Distance Vector Multicast Routing Protocol Jerad Bates UMBC - Fall 2006.
EAP Applicability IETF-86 Joe Salowey. Open Issues Open Issues with Retransmission and re- authentication Remove text about lack of differentiation in.
RIP.
BGP 1. BGP Overview 2. Multihoming 3. Configuring BGP.
Dynamic Routing Protocols part2
Routing Protocols (RIP, OSPF, BGP)
RPSEC WG Issues with Routing Protocols security mechanisms
Objective: ARP.
Routing Information Protocol (RIP)
In-Band Authentication Extension for Protocol Independent Multicast (PIM) draft-bhatia-zhang-pim-auth-extension-00 Manav Bhatia
(draft-archana-pimwg-pim-ping-00.txt)
What is a router? A router is a device that connects multiple computers together. Not to be confused with a switch Routers transmit packets of data across.
Rip Routing Protocol.
IETF Taiwan draft-wijnands-pim-source-discovery-bsr-00
draft-ietf-pim-source-discovery-bsr-05
2002 IPv6 技術巡迴研討會 IPv6 Mobility
Routing.
Chapter 5: Dynamic Routing
Internet Control Message Protocol (ICMP)
Link state routing In link state routing, if each node in the domain has the entire topology of the domain list of nodes and links, how they are connected.
OSPF & ISIS Flooding Reduction
Draft-venaas-bier-pfm-sd-00 PIM Flooding Mechanism and Source Discovery for BIER Stig Venaas, IJsbrand Wijnands, Mankamana.
Multicast Outline Multicast revisited
Intradomain Routing Outline Introduction to Routing
RFC 1058 & RFC 2453 Routing Information Protocol
Dr. John P. Abraham Professor UTPA
Viet Nguyen Jianqing Liu Yaqin Tang
Dr. John P. Abraham Professor UTPA
draft-pim-with-ipv4-prefix-over-ipv6-nh
Dynamic Routing Protocols part3 B
Routing.
Draft-pfister-bier-mld-02 BIER Ingress Multicast Flow Overlay using Multicast Listener Discovery Protocols Pierre Pfister, IJsbrand.
draft-ietf-pim-source-discovery-bsr-06
draft-pim-with-ipv4-prefix-over-ipv6-nh
MVPN Source Discovery Interoperation
draft-ietf-pim-ipv4-prefix-over-ipv6-nh
draft-ietf-pim-ipv4-prefix-over-ipv6-nh-01
draft-venaas-bier-mtud-01
Reliable PIM Registers draft-anish-reliable-pim-register
Presenter: Raunak Banthia
Presentation transcript:

draft-venaas-pim-port-pfm-00 PIM Flooding Protocol over Reliable Transport IETF 104 Stig Venaas, stig@cisco.com Balaji Ganesh, balagane@cisco.com Kesavan Thiruvenkatasamy, kethiruv@cisco.com Ramakrishnan Chokkanathapuram, ramaksun@cisco.com

The idea PFM relies on sending periodic updates. A first hop router would every 60s or so send a full update with all active sources. We want to send it often so that state can be updated in case of packet loss. If the signaling was reliable we would rarely need to send full updates. PFM is hop-by-hop. Can we utilize PIM PORT which offers reliable transport between neighbors?

Solution 1/2 Establish PORT connections between neighbors according to PIM PORT RFC. We define a new PORT message for sending PFM updates. They contain a major and a minor sequence number, and the PFM message itself according to PFM RFC. We define a new PORT message to request an update from a neighbor. It contains a list of originators and which sequence number/version was last received from each of them. A neighbor will respond by sending everything it has that is newer from the specified originators, plus everything from other originators.

Solution 2/2 When a router receives PFM messages newer than what it already has, it updates its own information and forwards what is new to its neighbors. When a PORT connection is established to a neighbor, a router would ask the neighbor if it has anything newer than what it currently has. Whenever the neighbor learns anything new after that, it is assumed that it will tell us. In this way we make all the routers have the latest information.

Sequence numbers We use a major sequence number that is increased each time a full update is sent, and a minor number that is increased each time a triggered delta is sent. A full update has minor sequence number 0. When a router receives a full update it replaces all previous information from the originator with the full update. When it receives a minor update, it stores that while keeping all existing info. How to ensure that the major sequence number is increased across restarts? Derive it from the clock? Add a mechanism to find what is the largest major number stored in the domain? May borrow ideas from IGPs.