ATM网络中多点通信的动态可编程共享虚拟路径分配算法

S. Selvakumar, J. Karthik, G.V. Ravi Shankar, Y. Ramakrishna
{"title":"ATM网络中多点通信的动态可编程共享虚拟路径分配算法","authors":"S. Selvakumar, J. Karthik, G.V. Ravi Shankar, Y. Ramakrishna","doi":"10.1109/TENCON.1999.818398","DOIUrl":null,"url":null,"abstract":"Multicast defined as the delivery of a packet simultaneously to more than one destination by a single transmit operation is the means to achieve point-to-multipoint and multipoint-to-multipoint communication arising from the multimedia communication applications. Multipoint-to-multipoint communication requires the creation of a multicast tree. Though ATM networks are capable of providing guaranteed QoS, the support for efficient group communication (multicasting) is necessary. Unfortunately as the ATM networks belong to the class of non-broadcast multiple access (NBMA) achieving such a simultaneous transmission in terms of multicasting is very difficult. This paper addresses the issue of multicast connection establishment and proposes a new, 'dynamic programmable shared virtual path assignment' algorithm for the creation of a multicast tree. The proposed algorithm realizes each branch of a multicast tree by a segmented VP and reserves the required resources for each VP. Further, the nodes in which the multicast tree edges branch out are realized as virtual path junctions (VPJs). At VPJs two streams (VPs) of a group from two input links are merged into one input stream (VP) for an output link by performing copy or split and merge operations. The output of the merge operation at each VPJ is a function of the programmable filter installed at each VPJ. The filter may be programmed to guarantee the desired QoS of each member of a group.","PeriodicalId":121142,"journal":{"name":"Proceedings of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A dynamic programmable shared virtual path assignment algorithm for multipoint communication in ATM networks\",\"authors\":\"S. Selvakumar, J. Karthik, G.V. Ravi Shankar, Y. Ramakrishna\",\"doi\":\"10.1109/TENCON.1999.818398\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Multicast defined as the delivery of a packet simultaneously to more than one destination by a single transmit operation is the means to achieve point-to-multipoint and multipoint-to-multipoint communication arising from the multimedia communication applications. Multipoint-to-multipoint communication requires the creation of a multicast tree. Though ATM networks are capable of providing guaranteed QoS, the support for efficient group communication (multicasting) is necessary. Unfortunately as the ATM networks belong to the class of non-broadcast multiple access (NBMA) achieving such a simultaneous transmission in terms of multicasting is very difficult. This paper addresses the issue of multicast connection establishment and proposes a new, 'dynamic programmable shared virtual path assignment' algorithm for the creation of a multicast tree. The proposed algorithm realizes each branch of a multicast tree by a segmented VP and reserves the required resources for each VP. Further, the nodes in which the multicast tree edges branch out are realized as virtual path junctions (VPJs). At VPJs two streams (VPs) of a group from two input links are merged into one input stream (VP) for an output link by performing copy or split and merge operations. The output of the merge operation at each VPJ is a function of the programmable filter installed at each VPJ. The filter may be programmed to guarantee the desired QoS of each member of a group.\",\"PeriodicalId\":121142,\"journal\":{\"name\":\"Proceedings of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030)\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-09-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TENCON.1999.818398\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TENCON.1999.818398","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

多播是多媒体通信应用中出现的一种实现点对多点和多点对多点通信的手段,通过一次传输操作将数据包同时传送到多个目的地。多点对多点通信需要创建多播树。虽然ATM网络能够提供有保证的QoS,但支持高效的组通信(组播)是必要的。然而,由于ATM网络属于非广播多址(NBMA)类型,因此在组播方面实现这种同时传输是非常困难的。本文针对组播连接的建立问题,提出了一种新的“动态可编程共享虚拟路径分配”算法,用于组播树的创建。该算法通过分段VP实现组播树的每个分支,并为每个VP保留所需的资源。此外,将组播树边缘分支的节点实现为虚拟路径结点(VPJs)。在VPJs中,通过执行复制或拆分合并操作,将来自两个输入链路的组的两个流(VP)合并为输出链路的一个输入流(VP)。每个VPJ上的合并操作的输出是安装在每个VPJ上的可编程滤波器的函数。可以对过滤器进行编程以保证组中每个成员的期望QoS。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A dynamic programmable shared virtual path assignment algorithm for multipoint communication in ATM networks
Multicast defined as the delivery of a packet simultaneously to more than one destination by a single transmit operation is the means to achieve point-to-multipoint and multipoint-to-multipoint communication arising from the multimedia communication applications. Multipoint-to-multipoint communication requires the creation of a multicast tree. Though ATM networks are capable of providing guaranteed QoS, the support for efficient group communication (multicasting) is necessary. Unfortunately as the ATM networks belong to the class of non-broadcast multiple access (NBMA) achieving such a simultaneous transmission in terms of multicasting is very difficult. This paper addresses the issue of multicast connection establishment and proposes a new, 'dynamic programmable shared virtual path assignment' algorithm for the creation of a multicast tree. The proposed algorithm realizes each branch of a multicast tree by a segmented VP and reserves the required resources for each VP. Further, the nodes in which the multicast tree edges branch out are realized as virtual path junctions (VPJs). At VPJs two streams (VPs) of a group from two input links are merged into one input stream (VP) for an output link by performing copy or split and merge operations. The output of the merge operation at each VPJ is a function of the programmable filter installed at each VPJ. The filter may be programmed to guarantee the desired QoS of each member of a group.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信