draft-ietf-i2rs-rib-info-model-06.txt		draft-ietf-i2rs-rib-info-model-07.txt
	Network Working Group N. Bahadur, Ed.		Network Working Group N. Bahadur, Ed.
	Internet-Draft Bracket Computing		Internet-Draft Bracket Computing
	Intended status: Informational R. Folkes, Ed.		Intended status: Informational S. Kini, Ed.
	Expires: September 10, 2015 Juniper Networks, Inc.		Expires: April 2, 2016 Ericsson
	S. Kini, Ed.
	Ericsson
	J. Medved		J. Medved
	Cisco		Cisco
	March 09, 2015		September 30, 2015
	Routing Information Base Info Model		Routing Information Base Info Model
	draft-ietf-i2rs-rib-info-model-06		draft-ietf-i2rs-rib-info-model-07
	Abstract		Abstract
	Routing and routing functions in enterprise and carrier networks are		Routing and routing functions in enterprise and carrier networks are
	typically performed by network devices (routers and switches) using a		typically performed by network devices (routers and switches) using a
	routing information base (RIB). Protocols and configuration push		routing information base (RIB). Protocols and configuration push
	data into the RIB and the RIB manager installs state into the		data into the RIB and the RIB manager installs state into the
	hardware; for packet forwarding. This draft specifies an information		hardware; for packet forwarding. This draft specifies an information
	model for the RIB to enable defining a standardized data model. Such		model for the RIB to enable defining a standardized data model. Such
	a data model can be used to define an interface to the RIB from an		a data model can be used to define an interface to the RIB from an
	entity that may even be external to the network device. This		entity that may even be external to the network device. This
	interface can be used to support new use-cases being defined by the		interface can be used to support new use-cases being defined by the
	IETF I2RS WG.		IETF I2RS WG.
	Status of This Memo		Status of this Memo
	This Internet-Draft is submitted in full conformance with the		This Internet-Draft is submitted in full conformance with the
	provisions of BCP 78 and BCP 79.		provisions of BCP 78 and BCP 79.
	Internet-Drafts are working documents of the Internet Engineering		Internet-Drafts are working documents of the Internet Engineering
	Task Force (IETF). Note that other groups may also distribute		Task Force (IETF). Note that other groups may also distribute
	working documents as Internet-Drafts. The list of current Internet-		working documents as Internet-Drafts. The list of current Internet-
	Drafts is at http://datatracker.ietf.org/drafts/current/.		Drafts is at http://datatracker.ietf.org/drafts/current/.
	Internet-Drafts are draft documents valid for a maximum of six months		Internet-Drafts are draft documents valid for a maximum of six months
	and may be updated, replaced, or obsoleted by other documents at any		and may be updated, replaced, or obsoleted by other documents at any
	time. It is inappropriate to use Internet-Drafts as reference		time. It is inappropriate to use Internet-Drafts as reference
	material or to cite them other than as "work in progress."		material or to cite them other than as "work in progress."
	This Internet-Draft will expire on September 10, 2015.		This Internet-Draft will expire on April 2, 2016.
	Copyright Notice		Copyright Notice
	Copyright (c) 2015 IETF Trust and the persons identified as the		Copyright (c) 2015 IETF Trust and the persons identified as the
	document authors. All rights reserved.		document authors. All rights reserved.
	This document is subject to BCP 78 and the IETF Trust's Legal		This document is subject to BCP 78 and the IETF Trust's Legal
	Provisions Relating to IETF Documents		Provisions Relating to IETF Documents
	(http://trustee.ietf.org/license-info) in effect on the date of		(http://trustee.ietf.org/license-info) in effect on the date of
	publication of this document. Please review these documents		publication of this document. Please review these documents
	carefully, as they describe your rights and restrictions with respect		carefully, as they describe your rights and restrictions with respect
	to this document. Code Components extracted from this document must		to this document. Code Components extracted from this document must
	include Simplified BSD License text as described in Section 4.e of		include Simplified BSD License text as described in Section 4.e of
	the Trust Legal Provisions and are provided without warranty as		the Trust Legal Provisions and are provided without warranty as
	described in the Simplified BSD License.		described in the Simplified BSD License.
	Table of Contents		Table of Contents
	1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 3		1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . 4
	1.1. Conventions used in this document . . . . . . . . . . . . 5		1.1. Conventions used in this document . . . . . . . . . . . . 6
	2. RIB data . . . . . . . . . . . . . . . . . . . . . . . . . . 5		2. RIB data . . . . . . . . . . . . . . . . . . . . . . . . . . . 6
	2.1. RIB definition . . . . . . . . . . . . . . . . . . . . . 5		2.1. RIB definition . . . . . . . . . . . . . . . . . . . . . . 6
	2.2. Routing instance . . . . . . . . . . . . . . . . . . . . 6		2.2. Routing instance . . . . . . . . . . . . . . . . . . . . . 7
	2.3. Route . . . . . . . . . . . . . . . . . . . . . . . . . . 7		2.3. Route . . . . . . . . . . . . . . . . . . . . . . . . . . 8
	2.4. Nexthop . . . . . . . . . . . . . . . . . . . . . . . . . 8		2.4. Nexthop . . . . . . . . . . . . . . . . . . . . . . . . . 9
	2.4.1. Nexthop types . . . . . . . . . . . . . . . . . . . . 11		2.4.1. Nexthop types . . . . . . . . . . . . . . . . . . . . 11
	2.4.2. Nexthop list attributes . . . . . . . . . . . . . . . 12		2.4.2. Nexthop list attributes . . . . . . . . . . . . . . . 12
	2.4.3. Nexthop content . . . . . . . . . . . . . . . . . . . 12		2.4.3. Nexthop content . . . . . . . . . . . . . . . . . . . 12
	2.4.4. Special nexthops . . . . . . . . . . . . . . . . . . 13		2.4.4. Special nexthops . . . . . . . . . . . . . . . . . . . 13
	3. Reading from the RIB . . . . . . . . . . . . . . . . . . . . 14		3. Reading from the RIB . . . . . . . . . . . . . . . . . . . . . 13
	4. Writing to the RIB . . . . . . . . . . . . . . . . . . . . . 14		4. Writing to the RIB . . . . . . . . . . . . . . . . . . . . . . 13
	5. Notifications . . . . . . . . . . . . . . . . . . . . . . . . 15		5. Notifications . . . . . . . . . . . . . . . . . . . . . . . . 14
	6. RIB grammar . . . . . . . . . . . . . . . . . . . . . . . . . 15		6. RIB grammar . . . . . . . . . . . . . . . . . . . . . . . . . 14
	6.1. Nexthop grammar explained . . . . . . . . . . . . . . . . 18		6.1. Nexthop grammar explained . . . . . . . . . . . . . . . . 17
	7. Using the RIB grammar . . . . . . . . . . . . . . . . . . . . 18		7. Using the RIB grammar . . . . . . . . . . . . . . . . . . . . 18
	7.1. Using route preference . . . . . . . . . . . . . . . . . 18		7.1. Using route preference . . . . . . . . . . . . . . . . . . 18
	7.2. Using different nexthops types . . . . . . . . . . . . . 19		7.2. Using different nexthops types . . . . . . . . . . . . . . 18
	7.2.1. Tunnel nexthops . . . . . . . . . . . . . . . . . . . 19		7.2.1. Tunnel nexthops . . . . . . . . . . . . . . . . . . . 18
	7.2.2. Replication lists . . . . . . . . . . . . . . . . . . 19		7.2.2. Replication lists . . . . . . . . . . . . . . . . . . 18
	7.2.3. Weighted lists . . . . . . . . . . . . . . . . . . . 19		7.2.3. Weighted lists . . . . . . . . . . . . . . . . . . . . 19
	7.2.4. Protection . . . . . . . . . . . . . . . . . . . . . 20		7.2.4. Protection . . . . . . . . . . . . . . . . . . . . . . 19
	7.2.5. Nexthop chains . . . . . . . . . . . . . . . . . . . 21		7.2.5. Nexthop chains . . . . . . . . . . . . . . . . . . . . 20
	7.2.6. Lists of lists . . . . . . . . . . . . . . . . . . . 21		7.2.6. Lists of lists . . . . . . . . . . . . . . . . . . . . 21
	7.3. Performing multicast . . . . . . . . . . . . . . . . . . 23		7.3. Performing multicast . . . . . . . . . . . . . . . . . . . 22
	8. RIB operations at scale . . . . . . . . . . . . . . . . . . . 24		8. RIB operations at scale . . . . . . . . . . . . . . . . . . . 23
	8.1. RIB reads . . . . . . . . . . . . . . . . . . . . . . . . 24		8.1. RIB reads . . . . . . . . . . . . . . . . . . . . . . . . 23
	8.2. RIB writes . . . . . . . . . . . . . . . . . . . . . . . 24		8.2. RIB writes . . . . . . . . . . . . . . . . . . . . . . . . 23
	8.3. RIB events and notifications . . . . . . . . . . . . . . 24		8.3. RIB events and notifications . . . . . . . . . . . . . . . 23
	9. Security Considerations . . . . . . . . . . . . . . . . . . . 25		9. Security Considerations . . . . . . . . . . . . . . . . . . . 24
	10. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 25		10. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 24
	11. Acknowledgements . . . . . . . . . . . . . . . . . . . . . . 25		11. Acknowledgements . . . . . . . . . . . . . . . . . . . . . . . 24
	12. References . . . . . . . . . . . . . . . . . . . . . . . . . 25		12. References . . . . . . . . . . . . . . . . . . . . . . . . . . 24
	12.1. Normative References . . . . . . . . . . . . . . . . . . 25		12.1. Normative References . . . . . . . . . . . . . . . . . . . 24
	12.2. Informative References . . . . . . . . . . . . . . . . . 25		12.2. Informative References . . . . . . . . . . . . . . . . . . 24
	Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 26
			Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . . 25
	1. Introduction		1. Introduction
	Routing and routing functions in enterprise and carrier networks are		Routing and routing functions in enterprise and carrier networks are
	traditionally performed in network devices. Traditionally routers		traditionally performed in network devices. Traditionally routers
	run routing protocols and the routing protocols (along with static		run routing protocols and the routing protocols (along with static
	config) populate the Routing information base (RIB) of the router.		config) populate the Routing information base (RIB) of the router.
	The RIB is managed by the RIB manager and the RIB manager provides a		The RIB is managed by the RIB manager and the RIB manager provides a
	north-bound interface to its clients i.e. the routing protocols to		north-bound interface to its clients i.e. the routing protocols to
	insert routes into the RIB. The RIB manager consults the RIB and		insert routes into the RIB. The RIB manager consults the RIB and
	skipping to change at page 16, line 29		skipping to change at page 16, line 4
	<route-attributes> ::= <ROUTE_PREFERENCE> [<LOCAL_ONLY>]		<route-attributes> ::= <ROUTE_PREFERENCE> [<LOCAL_ONLY>]
	[<address-family-route-attributes>]		[<address-family-route-attributes>]
	<address-family-route-attributes> ::= <ip-route-attributes> |		<address-family-route-attributes> ::= <ip-route-attributes> |
	<mpls-route-attributes> |		<mpls-route-attributes> |
	<ethernet-route-attributes>		<ethernet-route-attributes>
	<ip-route-attributes> ::= <>		<ip-route-attributes> ::= <>
	<mpls-route-attributes> ::= <>		<mpls-route-attributes> ::= <>
	<ethernet-route-attributes> ::= <>		<ethernet-route-attributes> ::= <>
	<route-vendor-attributes> ::= <>		<route-vendor-attributes> ::= <>
			<nexthop> ::= <nexthop-base> | <nexthop-lb> |
	<nexthop> ::= <NEXTHOP_BASE> <nexthop-base> |		<nexthop-protection> | <nexthop-replicate>
	<NEXTHOP_LOAD_BALANCE> <nexthop-lb> |
	<NEXTHOP_PROTECTION> <nexthop-protection> |
	<NEXTHOP_REPLICATE> <nexthop-replicate>
	<nexthop-lb> ::= <NEXTHOP_LB_WEIGHT> <nexthop-lb-member>		<nexthop-lb> ::= <NEXTHOP_LB_WEIGHT> <nexthop-lb-member>
	(<NEXTHOP_LB_WEIGHT> <nexthop-lb-member>) ...		(<NEXTHOP_LB_WEIGHT> <nexthop-lb-member>) ...
	<NEXTHOP_LB_WEIGHT> is a number between 1 and 99.		<NEXTHOP_LB_WEIGHT> is a number between 1 and 99.
	<nexthop-lb-member> ::= <nexthop>		<nexthop-lb-member> ::= <nexthop>
	<nexthop-protection> = <NEXTHOP_PREFERENCE> <nexthop>		<nexthop-protection> = <NEXTHOP_PREFERENCE> <nexthop>
	(<NEXTHOP_PREFERENCE> <nexthop>)...		(<NEXTHOP_PREFERENCE> <nexthop>)...
	Each <NEXTHOP_PREFERENCE> should have a unique value within a		Each <NEXTHOP_PREFERENCE> should have a unique value within a
	<nexthop-protection>.		<nexthop-protection>.
	skipping to change at page 19, line 36		skipping to change at page 19, line 9
	destinations. The destinations, in turn, could be complex nexthops		destinations. The destinations, in turn, could be complex nexthops
	in themselves - at a level supported by the network device. Point to		in themselves - at a level supported by the network device. Point to
	multipoint and broadcast are examples that involve replication.		multipoint and broadcast are examples that involve replication.
	A replication list (at the simplest level) can be represented as:		A replication list (at the simplest level) can be represented as:
	<nexthop> ::= <NEXTHOP_REPLICATE> <nexthop> [ <nexthop> ... ]		<nexthop> ::= <NEXTHOP_REPLICATE> <nexthop> [ <nexthop> ... ]
	The above can be derived from the grammar as follows:		The above can be derived from the grammar as follows:
	<nexthop> ::= <NEXTHOP_REPLICATE> <nexthop-replicate>		<nexthop> ::= <nexthop-replicate>
	<nexthop> ::= <NEXTHOP_REPLICATE> <nexthop> <nexthop> ...		<nexthop> ::= <NEXTHOP_REPLICATE> <nexthop> <nexthop> ...
	7.2.3. Weighted lists		7.2.3. Weighted lists
	A weighted list is used to load-balance traffic among a set of		A weighted list is used to load-balance traffic among a set of
	nexthops. From a modeling perspective, a weighted list is very		nexthops. From a modeling perspective, a weighted list is very
	similar to a replication list, with the difference that each member		similar to a replication list, with the difference that each member
	nexthop MUST have a NEXTHOP_LB_WEIGHT associated with it.		nexthop MUST have a NEXTHOP_LB_WEIGHT associated with it.
	A weighted list (at the simplest level) can be represented as:		A weighted list (at the simplest level) can be represented as:
	<nexthop> ::= <NEXTHOP_LOAD_BALANCE> (<nexthop> <NEXTHOP_LB_WEIGHT>)		<nexthop> ::= <NEXTHOP_LOAD_BALANCE> (<nexthop> <NEXTHOP_LB_WEIGHT>)
	[(<nexthop> <NEXTHOP_LB_WEIGHT>)... ]		[(<nexthop> <NEXTHOP_LB_WEIGHT>)... ]
	The above can be derived from the grammar as follows:		The above can be derived from the grammar as follows:
	<nexthop> ::= <NEXTHOP_LOAD_BALANCE> <nexthop-lb>		<nexthop> ::= <nexthop-lb>
	<nexthop> ::= <NEXTHOP_LOAD_BALANCE>		<nexthop> ::= <NEXTHOP_LOAD_BALANCE>
	<NEXTHOP_LB_WEIGHT> <nexthop-lb-member>		<NEXTHOP_LB_WEIGHT> <nexthop-lb-member>
	(<NEXTHOP_LB_WEIGHT> <nexthop-lb-member>) ...		(<NEXTHOP_LB_WEIGHT> <nexthop-lb-member>) ...
	<nexthop> ::= <NEXTHOP_LOAD_BALANCE> (<NEXTHOP_LB_WEIGHT> <nexthop>)		<nexthop> ::= <NEXTHOP_LOAD_BALANCE> (<NEXTHOP_LB_WEIGHT> <nexthop>)
	(<NEXTHOP_LB_WEIGHT> <nexthop>) ...		(<NEXTHOP_LB_WEIGHT> <nexthop>) ...
	7.2.4. Protection		7.2.4. Protection
	A primary/backup protection can be represented as:		A primary/backup protection can be represented as:
	<nexthop> ::= <1> <interface-primary> <2> <interface-backup>)		<nexthop> ::= <NEXTHOP_PROTECTION> <1> <interface-primary>
			<2> <interface-backup>)
	The above can be derived from the grammar as follows:		The above can be derived from the grammar as follows:
	<nexthop> ::= <NEXTHOP_PROTECTION> <nexthop-protection>		<nexthop> ::= <nexthop-protection>
	<nexthop> ::= <NEXTHOP_PROTECTION> (<NEXTHOP_PREFERENCE> <nexthop>		<nexthop> ::= <NEXTHOP_PROTECTION> (<NEXTHOP_PREFERENCE> <nexthop>
	(<NEXTHOP_PREFERENCE> <nexthop>)...)		(<NEXTHOP_PREFERENCE> <nexthop>)...)
	<nexthop> ::= <NEXTHOP_PROTECTION> (<NEXTHOP_PREFERENCE> <nexthop>		<nexthop> ::= <NEXTHOP_PROTECTION> (<NEXTHOP_PREFERENCE> <nexthop>
	(<NEXTHOP_PREFERENCE> <nexthop>))		(<NEXTHOP_PREFERENCE> <nexthop>))
	<nexthop> ::= <NEXTHOP_PROTECTION> ((<NEXTHOP_PREFERENCE> <nexthop-base>		<nexthop> ::= <NEXTHOP_PROTECTION> ((<NEXTHOP_PREFERENCE> <nexthop-base>
	(<NEXTHOP_PREFERENCE> <nexthop-base>))		(<NEXTHOP_PREFERENCE> <nexthop-base>))
	<nexthop> ::= <NEXTHOP_PROTECTION> (<1> <interface-primary>		<nexthop> ::= <NEXTHOP_PROTECTION> (<1> <interface-primary>
	(<2> <interface-backup>))		(<2> <interface-backup>))
	Traffic can be load-balanced among multiple primary nexthops and a		Traffic can be load-balanced among multiple primary nexthops and a
	skipping to change at page 23, line 7		skipping to change at page 22, line 7
	multicast and the inner lists are weighted lists for load balancing.		multicast and the inner lists are weighted lists for load balancing.
	Lets take an example of a network element has to replicate traffic to		Lets take an example of a network element has to replicate traffic to
	two other network elements. Traffic to the first network element		two other network elements. Traffic to the first network element
	should be load balanced equally over two interfaces outgoing-1-1 and		should be load balanced equally over two interfaces outgoing-1-1 and
	outgoing-1-2. Traffic to the second network element should be load		outgoing-1-2. Traffic to the second network element should be load
	balanced over three interfaces outgoing-2-1, outgoing-2-2 and		balanced over three interfaces outgoing-2-1, outgoing-2-2 and
	outgoing-2-3 in the ratio 20:20:60.		outgoing-2-3 in the ratio 20:20:60.
	This can be derived from the grammar as follows:		This can be derived from the grammar as follows:
	<nexthop> ::= <NEXTHOP_REPLICATE> <nexthop-replicate>		<nexthop> ::= <nexthop-replicate>
	<nexthop> ::= <NEXTHOP_REPLICATE> (<nexthop> <nexthop>...)		<nexthop> ::= <NEXTHOP_REPLICATE> (<nexthop> <nexthop>...)
	<nexthop> ::= <NEXTHOP_REPLICATE> (<nexthop> <nexthop>)		<nexthop> ::= <NEXTHOP_REPLICATE> (<nexthop> <nexthop>)
	<nexthop> ::= <NEXTHOP_REPLICATE> ((<NEXTHOP_LOAD_BALANCE> <nexthop-lb>)		<nexthop> ::= <NEXTHOP_REPLICATE> ((<NEXTHOP_LOAD_BALANCE> <nexthop-lb>)
	(<NEXTHOP_LOAD_BALANCE> <nexthop-lb>))		(<NEXTHOP_LOAD_BALANCE> <nexthop-lb>))
	<nexthop> ::= <NEXTHOP_REPLICATE> ((<NEXTHOP_LOAD_BALANCE>		<nexthop> ::= <NEXTHOP_REPLICATE> ((<NEXTHOP_LOAD_BALANCE>
	(<NEXTHOP_LB_WEIGHT> <nexthop-lb-member>		(<NEXTHOP_LB_WEIGHT> <nexthop-lb-member>
	(<NEXTHOP_LB_WEIGHT> <nexthop-lb-member>) ...))		(<NEXTHOP_LB_WEIGHT> <nexthop-lb-member>) ...))
	((<NEXTHOP_LOAD_BALANCE>		((<NEXTHOP_LOAD_BALANCE>
	(<NEXTHOP_LB_WEIGHT> <nexthop-lb-member>		(<NEXTHOP_LB_WEIGHT> <nexthop-lb-member>
	(<NEXTHOP_LB_WEIGHT> <nexthop-lb-member>) ...))		(<NEXTHOP_LB_WEIGHT> <nexthop-lb-member>) ...))
	skipping to change at page 25, line 25		skipping to change at page 24, line 25
	external agent MUST send requests to the RIB manager that comply with		external agent MUST send requests to the RIB manager that comply with
	the supported data-model. The data-model MUST specify the behavior		the supported data-model. The data-model MUST specify the behavior
	of the RIB manager on handling of unsupported data requests.		of the RIB manager on handling of unsupported data requests.
	10. IANA Considerations		10. IANA Considerations
	This document does not generate any considerations for IANA.		This document does not generate any considerations for IANA.
	11. Acknowledgements		11. Acknowledgements
	The authors would like to thank the working group co-chairs and		The authors would like to thank Ron Folkes, the working group co-
	reviewers on their comments and suggestions on this draft. The		chairs and reviewers on their comments and suggestions on this draft.
	following people contributed to the design of the RIB model as part		The following people contributed to the design of the RIB model as
	of the I2RS Interim meeting in April 2013 - Wes George, Chris		part of the I2RS Interim meeting in April 2013 - Wes George, Chris
	Liljenstolpe, Jeff Tantsura, Susan Hares and Fabian Schneider.		Liljenstolpe, Jeff Tantsura, Susan Hares and Fabian Schneider.
	12. References		12. References
	12.1. Normative References		12.1. Normative References
	[RFC2119] Bradner, S., "Key words for use in RFCs to Indicate		[RFC2119] Bradner, S., "Key words for use in RFCs to Indicate
	Requirement Levels", BCP 14, RFC 2119, March 1997.		Requirement Levels", BCP 14, RFC 2119, DOI 10.17487/
			RFC2119, March 1997,
			<http://www.rfc-editor.org/info/rfc2119>.
	12.2. Informative References		12.2. Informative References
	[I-D.hares-i2rs-use-case-vn-vc]		[I-D.hares-i2rs-use-case-vn-vc]
	Hares, S. and M. Chen, "Use Cases for Virtual Connections		Hares, S. and M. Chen, "Use Cases for Virtual Connections
	on Demand (VCoD) and Virtual Network on Demand (VNoD)		on Demand (VCoD) and Virtual Network on Demand (VNoD)
	using Interface to Routing System", draft-hares-i2rs-use-		using Interface to Routing System",
	case-vn-vc-03 (work in progress), July 2014.		draft-hares-i2rs-use-case-vn-vc-03 (work in progress),
			July 2014.
	[I-D.ietf-i2rs-problem-statement]		[I-D.ietf-i2rs-problem-statement]
	Atlas, A., Nadeau, T., and D. Ward, "Interface to the		Atlas, A., Nadeau, T., and D. Ward, "Interface to the
	Routing System Problem Statement", draft-ietf-i2rs-		Routing System Problem Statement",
	problem-statement-06 (work in progress), January 2015.		draft-ietf-i2rs-problem-statement-06 (work in progress),
			January 2015.
	[I-D.white-i2rs-use-case]		[I-D.white-i2rs-use-case]
	White, R., Hares, S., and A. Retana, "Protocol Independent		White, R., Hares, S., and A. Retana, "Protocol Independent
	Use Cases for an Interface to the Routing System", draft-		Use Cases for an Interface to the Routing System",
	white-i2rs-use-case-06 (work in progress), July 2014.		draft-white-i2rs-use-case-06 (work in progress),
			July 2014.
	[RFC4915] Psenak, P., Mirtorabi, S., Roy, A., Nguyen, L., and P.		[RFC4915] Psenak, P., Mirtorabi, S., Roy, A., Nguyen, L., and P.
	Pillay-Esnault, "Multi-Topology (MT) Routing in OSPF", RFC		Pillay-Esnault, "Multi-Topology (MT) Routing in OSPF",
	4915, June 2007.		RFC 4915, DOI 10.17487/RFC4915, June 2007,
			<http://www.rfc-editor.org/info/rfc4915>.
	[RFC5120] Przygienda, T., Shen, N., and N. Sheth, "M-ISIS: Multi		[RFC5120] Przygienda, T., Shen, N., and N. Sheth, "M-ISIS: Multi
	Topology (MT) Routing in Intermediate System to		Topology (MT) Routing in Intermediate System to
	Intermediate Systems (IS-ISs)", RFC 5120, February 2008.		Intermediate Systems (IS-ISs)", RFC 5120, DOI 10.17487/
			RFC5120, February 2008,
			<http://www.rfc-editor.org/info/rfc5120>.
	[RFC5511] Farrel, A., "Routing Backus-Naur Form (RBNF): A Syntax		[RFC5511] Farrel, A., "Routing Backus-Naur Form (RBNF): A Syntax
	Used to Form Encoding Rules in Various Routing Protocol		Used to Form Encoding Rules in Various Routing Protocol
	Specifications", RFC 5511, April 2009.		Specifications", RFC 5511, DOI 10.17487/RFC5511,
			April 2009, <http://www.rfc-editor.org/info/rfc5511>.
	Authors' Addresses		Authors' Addresses
	Nitin Bahadur (editor)		Nitin Bahadur (editor)
	Bracket Computing		Bracket Computing
	320 Soquel Way		320 Soquel Way
	Sunnyvale, CA 94085		Sunnyvale, CA 94085
	US		US
	Email: nitin_bahadur@yahoo.com		Email: nitin_bahadur@yahoo.com
	Ron Folkes (editor)
	Juniper Networks, Inc.
	1194 N. Mathilda Avenue
	Sunnyvale, CA 94089
	US
	Phone: +1 408 745 2000
	Email: ronf@juniper.net
	URI: www.juniper.net
	Sriganesh Kini (editor)		Sriganesh Kini (editor)
	Ericsson		Ericsson
	Email: sriganesh.kini@ericsson.com		Email: sriganesh.kini@ericsson.com
	Jan Medved		Jan Medved
	Cisco		Cisco
	Email: jmedved@cisco.com		Email: jmedved@cisco.com
End of changes. 21 change blocks.
	80 lines changed or deleted		76 lines changed or added
This html diff was produced by rfcdiff 1.42. The latest version is available from http://tools.ietf.org/tools/rfcdiff/