{"title":"PDMRP:一种可编程的分布式组播路由协议","authors":"N. Huang, Chien-Yu Yeh, Chung-Ching Chiou","doi":"10.1109/ICC.1998.685200","DOIUrl":null,"url":null,"abstract":"One of the most critical task for group communications lies in the establishment of multicast trees on the network. Two famous multicast trees are the shortest path-based trees and the Steiner-based trees. The former is suitable for those applications (such as video conferences) which wish to have a low propagation delay between the source (chairman site) to each of the receivers (member sites). The latter is well-suited for those (such as VoD services) which tend to consume as small as possible network resources (bandwidth). So far the routers have to implement separate routing protocols in order to support the construction of different kinds of multicast trees. This paper proposes a programmable distributed multicast routing protocol (PDMRP) for the routers so that different multicast trees can be established easily by only tuning a cost parameter.","PeriodicalId":218354,"journal":{"name":"ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"PDMRP: a programmable distributed multicast routing protocol\",\"authors\":\"N. Huang, Chien-Yu Yeh, Chung-Ching Chiou\",\"doi\":\"10.1109/ICC.1998.685200\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"One of the most critical task for group communications lies in the establishment of multicast trees on the network. Two famous multicast trees are the shortest path-based trees and the Steiner-based trees. The former is suitable for those applications (such as video conferences) which wish to have a low propagation delay between the source (chairman site) to each of the receivers (member sites). The latter is well-suited for those (such as VoD services) which tend to consume as small as possible network resources (bandwidth). So far the routers have to implement separate routing protocols in order to support the construction of different kinds of multicast trees. This paper proposes a programmable distributed multicast routing protocol (PDMRP) for the routers so that different multicast trees can be established easily by only tuning a cost parameter.\",\"PeriodicalId\":218354,\"journal\":{\"name\":\"ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220)\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-06-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICC.1998.685200\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICC.1998.685200","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
PDMRP: a programmable distributed multicast routing protocol
One of the most critical task for group communications lies in the establishment of multicast trees on the network. Two famous multicast trees are the shortest path-based trees and the Steiner-based trees. The former is suitable for those applications (such as video conferences) which wish to have a low propagation delay between the source (chairman site) to each of the receivers (member sites). The latter is well-suited for those (such as VoD services) which tend to consume as small as possible network resources (bandwidth). So far the routers have to implement separate routing protocols in order to support the construction of different kinds of multicast trees. This paper proposes a programmable distributed multicast routing protocol (PDMRP) for the routers so that different multicast trees can be established easily by only tuning a cost parameter.