网格树协议在GENI试验台上的评估

2018 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN) Pub Date : 2018-06-01 DOI:10.1109/LANMAN.2018.8475108

P. Willis, N. Shenoy

{"title":"网格树协议在GENI试验台上的评估","authors":"P. Willis, N. Shenoy","doi":"10.1109/LANMAN.2018.8475108","DOIUrl":null,"url":null,"abstract":"Loop avoidance is essential in switched networks to avoid broadcast storms. Logical Spanning Trees are constructed on the physical meshed topologies to overcome the broadcast storm problem. However, during topology changes, frame forwarding latency is introduced when re-converging and identifying new spanning tree paths. Meshed Tree algorithms (MTA) offer a new approach. Meshed Trees support multiple tree branches from a single root to cut down on re-convergence latency on link failures. A Meshed Tree Protocol (MTP) based on MTA is currently under development as an IEEE standard. In this article, MTP is evaluated for convergence delay in comparison with Rapid Spanning Tree Protocol (RSTP) on the GENI testbed.","PeriodicalId":103856,"journal":{"name":"2018 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"The Evaluation of a Meshed Tree Protocol on the GENI Testbed\",\"authors\":\"P. Willis, N. Shenoy\",\"doi\":\"10.1109/LANMAN.2018.8475108\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Loop avoidance is essential in switched networks to avoid broadcast storms. Logical Spanning Trees are constructed on the physical meshed topologies to overcome the broadcast storm problem. However, during topology changes, frame forwarding latency is introduced when re-converging and identifying new spanning tree paths. Meshed Tree algorithms (MTA) offer a new approach. Meshed Trees support multiple tree branches from a single root to cut down on re-convergence latency on link failures. A Meshed Tree Protocol (MTP) based on MTA is currently under development as an IEEE standard. In this article, MTP is evaluated for convergence delay in comparison with Rapid Spanning Tree Protocol (RSTP) on the GENI testbed.\",\"PeriodicalId\":103856,\"journal\":{\"name\":\"2018 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN)\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LANMAN.2018.8475108\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LANMAN.2018.8475108","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

在交换网络中，环路避免是避免广播风暴的关键。为了克服广播风暴问题，在物理网格拓扑结构上构造了逻辑生成树。但是，在拓扑变化过程中，在重新收敛和识别新的生成树路径时会引入帧转发延迟。网格树算法(MTA)提供了一种新的方法。网状树支持从一个根开始的多个分支，以减少链路故障时的重新收敛延迟。基于MTA的网状树协议(MTP)目前正在作为IEEE标准进行开发。本文通过与快速生成树协议(RSTP)在GENI测试平台上的比较，对MTP的收敛延迟进行了评估。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

The Evaluation of a Meshed Tree Protocol on the GENI Testbed

Loop avoidance is essential in switched networks to avoid broadcast storms. Logical Spanning Trees are constructed on the physical meshed topologies to overcome the broadcast storm problem. However, during topology changes, frame forwarding latency is introduced when re-converging and identifying new spanning tree paths. Meshed Tree algorithms (MTA) offer a new approach. Meshed Trees support multiple tree branches from a single root to cut down on re-convergence latency on link failures. A Meshed Tree Protocol (MTP) based on MTA is currently under development as an IEEE standard. In this article, MTP is evaluated for convergence delay in comparison with Rapid Spanning Tree Protocol (RSTP) on the GENI testbed.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2018 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN)

自引率

0.00%

发文量