Skip to main content

Performance Metric of Convergence Time of Information Flooding in Multi- Area GMPLS Networks
draft-zhangm-ccamp-metric-02

Document Type Expired Internet-Draft (individual)
Expired & archived
Authors Hui Ding , Yunbin Xu , Haiyi Zhang , Yongli Zhao , Min Zhang
Last updated 2012-04-23 (Latest revision 2011-10-21)
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

As one of the requirements of link state based routing protocols such as OSPF, link state update packets are intervally or reactively disseminate in the network in order to keep the information of topology and links resource synchronized at each control node. Considering large scale networks, massive messages are flooded in the control plane of General Multi-Protocol Label Switching (GMPLS) based multi-area networks. The convergence time of link state based routing protocols will have a significant impact on the performance of the networks. So measuring and analyzing the convergence time of information flooding in multi-areas becomes very important. This document provides suggestions for measuring OSPF multi-area control plane convergence. A performance metric of convergence time of information flooding is proposed to characterize the ability of information synchronization in multi-area networks.

Authors

Hui Ding
Yunbin Xu
Haiyi Zhang
Yongli Zhao
Min Zhang

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