Service Distribution using OSPF
draft-pillay-esnault-ospf-service-distribution-03
| Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Authors | Padma Pillay-Esnault , Derek M. Yeung , Burjiz | ||
| Last updated | 2017-01-09 (Latest revision 2016-07-08) | ||
| RFC stream | (None) | ||
| Intended RFC status | (None) | ||
| Formats | |||
| Stream | Stream state | (No stream defined) | |
| Consensus boilerplate | Unknown | ||
| RFC Editor Note | (None) | ||
| IESG | IESG state | Expired | |
| Telechat date | (None) | ||
| Responsible AD | (None) | ||
| Send notices to | (None) |
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
Abstract
The Open Shortest Path First (OSPF) protocol is used to carry data on behalf of other services using the Opaque Link State Advertisements. The protocol's flooding mechanism is well suited to cover the data propagation requirements of services such as Traffic Engineering. However, the current mechanism cannot scale for a large number of services nor satisfy some of their new set of requirements. This document describes a new mechanism in OSPF to support service and data distribution for a large number of services, computation of preferred service access points and a controlled service data exchange.
Authors
Padma Pillay-Esnault
Derek M. Yeung
Burjiz
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)