Skip to main content

Path Table based Routing Mechanism in Software-Defined Optical Transport Networks (SD-OTN)
draft-li-sdnrg-path-table-routing-in-sd-otn-07

Document Type Expired Internet-Draft (individual)
Expired & archived
Authors Li Xin , Yu Zhou , Dajiang Wang , Zhenyu Wang , Jiayu Wang, Wenzhe Li , Shan Yin , Shanguo Huang
Last updated 2020-04-09 (Latest revision 2019-10-07)
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 dynamic establishment and removal of an end-to-end light-path consume a lot of time which are also the main burden of control plane in optical transport networks. With the frequent arrival and departure of services, the control plane needs to handle a large number of control and management messages to conduct path computation, resource reservation and cross connection configuration. This draft proposes a novel routing mechanism based on Path Table for software-defined optical transport networks (SD-OTN). The Path Table reserves partial activated established light-paths that can be directly used by subsequent requests for subsequent services. This new routing mechanism can reduce the network load and save routing time for some services.

Authors

Li Xin
Yu Zhou
Dajiang Wang
Zhenyu Wang
Jiayu Wang
Wenzhe Li
Shan Yin
Shanguo Huang

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)