M. Padmaraj, S. Nair, M. Marchetti, G. Chiruvolu, Maher Ali
{"title":"具有多个生成树的企业以太网流量工程","authors":"M. Padmaraj, S. Nair, M. Marchetti, G. Chiruvolu, Maher Ali","doi":"10.1109/ICW.2005.78","DOIUrl":null,"url":null,"abstract":"IEEE 802.1s multiple spanning tree protocol (MSTP) is part of a family of standards for local and metropolitan area networks based on Ethernet protocol. MSTP allows a set of regions to be defined whose logical union spans the entire network, which in turn defines the association between VLANs and Spanning Tree Instances. In this paper we propose an algorithmic approach for constructing multiple spanning tree regions in the enterprise network domain which will provide better convergence time, reusability of VLAN tags, protection from failures, and optimal broadcast domain size.","PeriodicalId":255955,"journal":{"name":"2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05)","volume":"30 1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"Traffic engineering in enterprise ethernet with multiple spanning tree regions\",\"authors\":\"M. Padmaraj, S. Nair, M. Marchetti, G. Chiruvolu, Maher Ali\",\"doi\":\"10.1109/ICW.2005.78\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"IEEE 802.1s multiple spanning tree protocol (MSTP) is part of a family of standards for local and metropolitan area networks based on Ethernet protocol. MSTP allows a set of regions to be defined whose logical union spans the entire network, which in turn defines the association between VLANs and Spanning Tree Instances. In this paper we propose an algorithmic approach for constructing multiple spanning tree regions in the enterprise network domain which will provide better convergence time, reusability of VLAN tags, protection from failures, and optimal broadcast domain size.\",\"PeriodicalId\":255955,\"journal\":{\"name\":\"2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05)\",\"volume\":\"30 1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-08-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICW.2005.78\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICW.2005.78","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Traffic engineering in enterprise ethernet with multiple spanning tree regions
IEEE 802.1s multiple spanning tree protocol (MSTP) is part of a family of standards for local and metropolitan area networks based on Ethernet protocol. MSTP allows a set of regions to be defined whose logical union spans the entire network, which in turn defines the association between VLANs and Spanning Tree Instances. In this paper we propose an algorithmic approach for constructing multiple spanning tree regions in the enterprise network domain which will provide better convergence time, reusability of VLAN tags, protection from failures, and optimal broadcast domain size.