Improving network convergence with Multiple Spanning Tree Protocol

被引：0
|
作者：
Stanica, Roxana [1 ]
机构：
[1] SC Civitas Syst SRL, Craiova, Romania
来源：
CONTROL ENGINEERING AND APPLIED INFORMATICS | 2013年 / 15卷 / 01期
关键词：
network; protocol; bridge; convergence; topology change; command;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this paper are presented detailed explanations of Spanning Tree features and new developed commands to improve network convergence (hello-timer, forward-delay, MaxAge, max-hops, and priority for Bridge Protocol Data Units (BPDUs)). The Multiple Spanning Tree Protocol (MSTP) allows multiple spanning tree instances (MSTI) while mapping each Virtual Local Area Network (VLAN) or VLAN group to the most appropriate instance. Using MSTP, a recovery time (for link or device failure) of less than 50 milliseconds can be obtained and can be decreased to 15 milliseconds.
引用
收藏
页码：79 / 87
页数：9
相关论文
共 50 条
  • [41] STAR: A transparent Spanning Tree Bridge Protocol with alternate routing
    Lui, KS
    Lee, WC
    Nahrstedt, K
    ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2002, 32 (03) : 33 - 46
  • [42] Study on Cloud Security Based on Trust Spanning Tree Protocol
    Yingxu Lai
    Zenghui Liu
    Qiuyue Pan
    Jing Liu
    International Journal of Theoretical Physics, 2015, 54 : 3311 - 3330
  • [43] Extension and convergence analysis of the univariate direct quadrature spanning tree method
    Ferreira, Gabriel G. S.
    Lage, Paulo L. C.
    Silva, Luiz Fernando L. R.
    POWDER TECHNOLOGY, 2017, 322 : 301 - 313
  • [44] Multiple sequence alignment using minimum spanning tree
    Zhu, MJ
    Hu, GW
    Zheng, QL
    Peng, H
    PROCEEDINGS OF 2005 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-9, 2005, : 3352 - 3356
  • [45] Best Multiple Spanning Tree in Metro Ethernet Networks
    Mirjalily, Ghasem
    Sigari, F. Akhavan
    Saadat, Reza
    SECOND INTERNATIONAL CONFERENCE ON COMPUTER AND ELECTRICAL ENGINEERING, VOL 2, PROCEEDINGS, 2009, : 117 - 121
  • [46] USING LOCAL ADAPTATIONS TO RECONFIGURE A SPANNING TREE OF A NETWORK
    PRUHS, KR
    DISCRETE APPLIED MATHEMATICS, 1995, 57 (01) : 67 - 74
  • [47] Minimum spanning tree problem of uncertain random network
    Yuhong Sheng
    Zhongfeng Qin
    Gang Shi
    Journal of Intelligent Manufacturing, 2017, 28 : 565 - 574
  • [48] Optimally balanced spanning tree od the star network
    Rescigno, AA
    IEEE TRANSACTIONS ON COMPUTERS, 2001, 50 (01) : 88 - 91
  • [49] Hop-based routing protocol based on energy efficient Minimum Spanning Tree for Wireless Sensor Network
    Messous, Sana
    Liouane, Noureddine
    Pegatoquet, Alain
    Auguin, Michel
    2018 INTERNATIONAL CONFERENCE ON ADVANCED SYSTEMS AND ELECTRICAL TECHNOLOGIES (IC_ASET), 2017, : 421 - 426
  • [50] On finding a minimum spanning tree in a network with random weights
    McDiarmid, C
    Johnson, T
    Stone, HS
    RANDOM STRUCTURES & ALGORITHMS, 1997, 10 (1-2) : 187 - 204
12345