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}
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.