{"title":"一种多协议标签交换流量工程中带预计算的路由算法","authors":"Tao He, Suoping Wang","doi":"10.1002/ett.1481","DOIUrl":null,"url":null,"abstract":"The Label Switch Path routing algorithm in Multiprotocol Label Switching (MPLS) has become an important topic in Traffic Engineering. This paper presents a new routing scheme with precomputation, called the Least Maximum Flow Categories Routing Algorithm. In the MPLS network, different ingress–egress pairs have different maximum flow values on different links. Each link has a vector consisting of the maximum flow values flowing through it. This paper considers these vectors as weights of links and presents a method for calculating them. Simulation results show that the algorithm has the same precision as the other algorithms but has less computational complexity. Copyright © 2011 John Wiley & Sons, Ltd.","PeriodicalId":50473,"journal":{"name":"European Transactions on Telecommunications","volume":"6 1","pages":"315-321"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A routing algorithm with precomputation for Multiprotocol Label Switching Traffic Engineering\",\"authors\":\"Tao He, Suoping Wang\",\"doi\":\"10.1002/ett.1481\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Label Switch Path routing algorithm in Multiprotocol Label Switching (MPLS) has become an important topic in Traffic Engineering. This paper presents a new routing scheme with precomputation, called the Least Maximum Flow Categories Routing Algorithm. In the MPLS network, different ingress–egress pairs have different maximum flow values on different links. Each link has a vector consisting of the maximum flow values flowing through it. This paper considers these vectors as weights of links and presents a method for calculating them. Simulation results show that the algorithm has the same precision as the other algorithms but has less computational complexity. Copyright © 2011 John Wiley & Sons, Ltd.\",\"PeriodicalId\":50473,\"journal\":{\"name\":\"European Transactions on Telecommunications\",\"volume\":\"6 1\",\"pages\":\"315-321\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"European Transactions on Telecommunications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1002/ett.1481\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"European Transactions on Telecommunications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/ett.1481","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
