|国家预印本平台
首页|一种新的基于T-MPLS网络的分布式拓扑发现算法

一种新的基于T-MPLS网络的分布式拓扑发现算法

Novel Topology Discovery Algorithm Based on

中文摘要英文摘要

本文针对传送MPLS(T-MPLS)中的拓扑发现问题展开深入研究,提出一种分布式拓扑发现算法。该算法采用单跳传输的拓扑更新消息通过获得邻居节点的拓扑信息来对本地拓扑进行更新。网络节点同时引入周期性概念,使得拓扑更新消息在网络中数量处于可控状态,从而避免了由于网络变化导致的拓扑更新报文的突发,减少网络拥塞的风险。和现有基于泛洪机制的拓扑发现方法相比,具有开销小、发现时间短等明显优势。本文基于简化的环网和Mesh网络模型进行分析建模,证明其在拓扑更新时间可控方面和减少网络拥塞方面的有效性,并搭建仿真平台对其进行验证。

his article researches topology discovery issues in Transport MPLS networks and a novel distributed topology discovery Algorithm is proposed. The Algorithm uses single-hop topology messages from neighbor to realize the topology discovery. By introducing cyclical concept to the topology discovery algrithm, the number of topology discovery messages is keeping in a controllable status. Thus, the algorithm can avoid the burst of topology discovery messages and reduce the risk of network congestion. Comparing with existing topology discovery algorithms which based on the flooding mechanism, the new algorithm has the advantages of small overhead and good controllability. Based on model building and analysis of simplified Ring networks and the Mesh networks, this article proves that the distributed topology discovery algorithm is effective in controllability and reducing network congestion.

顾畹仪、李彬、段若琳、张永军

通信

拓扑发现-MPLS分布式

opology Discovery-MPLSistributed Algorithm

顾畹仪,李彬,段若琳,张永军.一种新的基于T-MPLS网络的分布式拓扑发现算法[EB/OL].(2010-01-29)[2025-08-02].http://www.paper.edu.cn/releasepaper/content/201001-1275.点此复制

评论