draft-ietf-bier-use-cases-06.txt   draft-ietf-bier-use-cases-07.txt 
Network Working Group N. Kumar Network Working Group N. Kumar
Internet-Draft R. Asati Internet-Draft R. Asati
Intended status: Informational Cisco Intended status: Informational Cisco
Expires: July 20, 2018 M. Chen Expires: January 29, 2019 M. Chen
X. Xu X. Xu
Huawei Huawei
A. Dolganow A. Dolganow
Nokia Nokia
T. Przygienda T. Przygienda
Ericsson Juniper Networks
A. Gulko A. Gulko
Thomson Reuters Thomson Reuters
D. Robinson D. Robinson
id3as-company Ltd id3as-company Ltd
V. Arya V. Arya
DirecTV Inc DirecTV Inc
C. Bestler C. Bestler
Nexenta Nexenta
January 16, 2018 July 28, 2018
BIER Use Cases BIER Use Cases
draft-ietf-bier-use-cases-06.txt draft-ietf-bier-use-cases-07.txt
Abstract Abstract
Bit Index Explicit Replication (BIER) is an architecture that Bit Index Explicit Replication (BIER) is an architecture that
provides optimal multicast forwarding through a "BIER domain" without provides optimal multicast forwarding through a "BIER domain" without
requiring intermediate routers to maintain any multicast related per- requiring intermediate routers to maintain any multicast related per-
flow state. BIER also does not require any explicit tree-building flow state. BIER also does not require any explicit tree-building
protocol for its operation. A multicast data packet enters a BIER protocol for its operation. A multicast data packet enters a BIER
domain at a "Bit-Forwarding Ingress Router" (BFIR), and leaves the domain at a "Bit-Forwarding Ingress Router" (BFIR), and leaves the
BIER domain at one or more "Bit-Forwarding Egress Routers" (BFERs). BIER domain at one or more "Bit-Forwarding Egress Routers" (BFERs).
skipping to change at page 2, line 12 skipping to change at page 2, line 12
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 https://datatracker.ietf.org/drafts/current/. Drafts is at https://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 July 20, 2018. This Internet-Draft will expire on January 29, 2019.
Copyright Notice Copyright Notice
Copyright (c) 2018 IETF Trust and the persons identified as the Copyright (c) 2018 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
(https://trustee.ietf.org/license-info) in effect on the date of (https://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
skipping to change at page 3, line 7 skipping to change at page 3, line 7
5. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 13 5. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 13
6. Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . 13 6. Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . 13
7. Contributing Authors . . . . . . . . . . . . . . . . . . . . 13 7. Contributing Authors . . . . . . . . . . . . . . . . . . . . 13
8. References . . . . . . . . . . . . . . . . . . . . . . . . . 13 8. References . . . . . . . . . . . . . . . . . . . . . . . . . 13
8.1. Normative References . . . . . . . . . . . . . . . . . . 14 8.1. Normative References . . . . . . . . . . . . . . . . . . 14
8.2. Informative References . . . . . . . . . . . . . . . . . 14 8.2. Informative References . . . . . . . . . . . . . . . . . 14
Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 15 Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 15
1. Introduction 1. Introduction
Bit Index Explicit Replication (BIER) [I-D.ietf-bier-architecture] is Bit Index Explicit Replication (BIER) [RFC8279] is an architecture
an architecture that provides optimal multicast forwarding through a that provides optimal multicast forwarding through a "BIER domain"
"BIER domain" without requiring intermediate routers to maintain any without requiring intermediate routers to maintain any multicast
multicast related per-flow state. BIER also does not require any related per-flow state. BIER also does not require any explicit
explicit tree-building protocol for its operation. A multicast data tree-building protocol for its operation. A multicast data packet
packet enters a BIER domain at a "Bit-Forwarding Ingress Router" enters a BIER domain at a "Bit-Forwarding Ingress Router" (BFIR), and
(BFIR), and leaves the BIER domain at one or more "Bit-Forwarding leaves the BIER domain at one or more "Bit-Forwarding Egress Routers"
Egress Routers" (BFERs). The BFIR router adds a BIER header to the (BFERs). The BFIR router adds a BIER header to the packet. The BIER
packet. The BIER header contains a bit-string in which each bit header contains a bit-string in which each bit represents exactly one
represents exactly one BFER to forward the packet to. The set of BFER to forward the packet to. The set of BFERs to which the
BFERs to which the multicast packet needs to be forwarded is multicast packet needs to be forwarded is expressed by setting the
expressed by setting the bits that correspond to those routers in the bits that correspond to those routers in the BIER header.
BIER header.
The obvious advantage of BIER is that there is no per flow multicast The obvious advantage of BIER is that there is no per flow multicast
state in the core of the network and there is no tree building state in the core of the network and there is no tree building
protocol that sets up tree on demand based on users joining a protocol that sets up tree on demand based on users joining a
multicast flow. In that sense, BIER is potentially applicable to multicast flow. In that sense, BIER is potentially applicable to
many services where Multicast is used and not limited to the examples many services where Multicast is used and not limited to the examples
described in this draft. In this document we are describing a few described in this draft. In this document we are describing a few
use-cases where BIER could provide benefit over using existing use-cases where BIER could provide benefit over using existing
mechanisms. mechanisms.
skipping to change at page 14, line 6 skipping to change at page 14, line 6
7. Contributing Authors 7. Contributing Authors
Dirk Trossen Dirk Trossen
InterDigital Inc InterDigital Inc
Email: dirk.trossen@interdigital.com Email: dirk.trossen@interdigital.com
8. References 8. References
8.1. Normative References 8.1. Normative References
[I-D.ietf-bier-architecture]
Wijnands, I., Rosen, E., Dolganow, A., Przygienda, T., and
S. Aldrin, "Multicast using Bit Index Explicit
Replication", draft-ietf-bier-architecture-02 (work in
progress), July 2015.
[I-D.ietf-bier-mvpn] [I-D.ietf-bier-mvpn]
Rosen, E., Sivakumar, M., Wijnands, I., Aldrin, S., Rosen, E., Sivakumar, M., Wijnands, I., Aldrin, S.,
Dolganow, A., and T. Przygienda, "Multicast VPN Using Dolganow, A., and T. Przygienda, "Multicast VPN Using
BIER", draft-ietf-bier-mvpn-01 (work in progress), July BIER", draft-ietf-bier-mvpn-01 (work in progress), July
2015. 2015.
[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, Requirement Levels", BCP 14, RFC 2119,
DOI 10.17487/RFC2119, March 1997, DOI 10.17487/RFC2119, March 1997,
<https://www.rfc-editor.org/info/rfc2119>. <https://www.rfc-editor.org/info/rfc2119>.
[RFC8279] Wijnands, IJ., Ed., Rosen, E., Ed., Dolganow, A.,
Przygienda, T., and S. Aldrin, "Multicast Using Bit Index
Explicit Replication (BIER)", RFC 8279,
DOI 10.17487/RFC8279, November 2017,
<https://www.rfc-editor.org/info/rfc8279>.
8.2. Informative References 8.2. Informative References
[I-D.ietf-spring-segment-routing] [I-D.ietf-spring-segment-routing]
Filsfils, C., Previdi, S., Decraene, B., Litkowski, S., Filsfils, C., Previdi, S., Decraene, B., Litkowski, S.,
and r. rjs@rob.sh, "Segment Routing Architecture", draft- and r. rjs@rob.sh, "Segment Routing Architecture", draft-
ietf-spring-segment-routing-04 (work in progress), July ietf-spring-segment-routing-04 (work in progress), July
2015. 2015.
[RFC4601] Fenner, B., Handley, M., Holbrook, H., and I. Kouvelas, [RFC4601] Fenner, B., Handley, M., Holbrook, H., and I. Kouvelas,
"Protocol Independent Multicast - Sparse Mode (PIM-SM): "Protocol Independent Multicast - Sparse Mode (PIM-SM):
skipping to change at page 16, line 18 skipping to change at page 16, line 18
Andrew Dolganow Andrew Dolganow
Nokia Nokia
750D Chai Chee Rd 750D Chai Chee Rd
06-06 Viva Business Park 469004 06-06 Viva Business Park 469004
Singapore Singapore
Email: andrew.dolganow@nokia.com Email: andrew.dolganow@nokia.com
Tony Przygienda Tony Przygienda
Ericsson Juniper Networks
300 Holger Way 1194 N. Mathilda Ave
San Jose, CA 95134 Sunnyvale, CA 95089
USA USA
Email: antoni.przygienda@ericsson.com Email: prz@juniper.net
Arkadiy Gulko Arkadiy Gulko
Thomson Reuters Thomson Reuters
195 Broadway 195 Broadway
New York NY 10007 New York NY 10007
USA USA
Email: arkadiy.gulko@thomsonreuters.com Email: arkadiy.gulko@thomsonreuters.com
Dom Robinson Dom Robinson
 End of changes. 10 change blocks. 
28 lines changed or deleted 27 lines changed or added

This html diff was produced by rfcdiff 1.47. The latest version is available from http://tools.ietf.org/tools/rfcdiff/