使用树编号在MPLS网络上部署多播通信

O. Banimelhem, J. Atwood, A. Agarwal
{"title":"使用树编号在MPLS网络上部署多播通信","authors":"O. Banimelhem, J. Atwood, A. Agarwal","doi":"10.1109/ISCC.2005.47","DOIUrl":null,"url":null,"abstract":"A new scheme for deploying multicasting in MPLS networks is proposed. Each possible tree in an MPLS network is assigned a number, which is then used to classify the corresponding multicast session into its FEC. We call this approach tree numbering (TN). It provides the capability to aggregate different multicast flows (sessions) having the same tree \"shape\". The assigned number is calculated distributedly by adding the partial weight values generated by the LSRs and the ingress LER of the corresponding tree. The key point in our approach is that the assigned numbers needed to distinguish the \"shapes\" of all the possible trees depend on the number of possible egress LERs could be reached by that ingress LERs and not on the number of the LSRs (core routers). In terms of the memory size, the proposed approach outperforms the approach that stores the IP addresses of the multicast tree or the one that store the concatenation of the sub codes generated by the ingress LER and the LSRs.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Deploying multicast communication over MPLS networks using tree numbering\",\"authors\":\"O. Banimelhem, J. Atwood, A. Agarwal\",\"doi\":\"10.1109/ISCC.2005.47\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new scheme for deploying multicasting in MPLS networks is proposed. Each possible tree in an MPLS network is assigned a number, which is then used to classify the corresponding multicast session into its FEC. We call this approach tree numbering (TN). It provides the capability to aggregate different multicast flows (sessions) having the same tree \\\"shape\\\". The assigned number is calculated distributedly by adding the partial weight values generated by the LSRs and the ingress LER of the corresponding tree. The key point in our approach is that the assigned numbers needed to distinguish the \\\"shapes\\\" of all the possible trees depend on the number of possible egress LERs could be reached by that ingress LERs and not on the number of the LSRs (core routers). In terms of the memory size, the proposed approach outperforms the approach that stores the IP addresses of the multicast tree or the one that store the concatenation of the sub codes generated by the ingress LER and the LSRs.\",\"PeriodicalId\":315855,\"journal\":{\"name\":\"10th IEEE Symposium on Computers and Communications (ISCC'05)\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-06-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"10th IEEE Symposium on Computers and Communications (ISCC'05)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCC.2005.47\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"10th IEEE Symposium on Computers and Communications (ISCC'05)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCC.2005.47","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

提出了一种在MPLS网络中部署组播的新方案。在MPLS网络中,每个可能的树都被分配一个号码,然后用这个号码将相应的多播会话划分到它的FEC中。我们称这种方法为树编号(TN)。它提供了聚合具有相同树“形状”的不同多播流(会话)的功能。分配数是由lsr生成的部分权重值和相应树的入口LER相加而得到的。在我们的方法中,关键的一点是,分配的数字需要区分所有可能的树的“形状”,这取决于可能的出口ler的数量,而不是取决于lsr(核心路由器)的数量。就内存大小而言,该方法优于存储组播树的IP地址的方法或存储由入口LER和lsr生成的子码的连接的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Deploying multicast communication over MPLS networks using tree numbering
A new scheme for deploying multicasting in MPLS networks is proposed. Each possible tree in an MPLS network is assigned a number, which is then used to classify the corresponding multicast session into its FEC. We call this approach tree numbering (TN). It provides the capability to aggregate different multicast flows (sessions) having the same tree "shape". The assigned number is calculated distributedly by adding the partial weight values generated by the LSRs and the ingress LER of the corresponding tree. The key point in our approach is that the assigned numbers needed to distinguish the "shapes" of all the possible trees depend on the number of possible egress LERs could be reached by that ingress LERs and not on the number of the LSRs (core routers). In terms of the memory size, the proposed approach outperforms the approach that stores the IP addresses of the multicast tree or the one that store the concatenation of the sub codes generated by the ingress LER and the LSRs.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信