{"title":"一种ATM网络多播的混合多MCS模型","authors":"Tae-Young Byun, K. Han","doi":"10.1109/ICOIN.2001.905637","DOIUrl":null,"url":null,"abstract":"This paper presents a multicasting scheme to reduce the average end-to-end path delay on the multicast tree by removing duplicated or non-shortest paths, which we call improper paths, over ATM networks. First, we explain these improper paths that may be found in the full MCS model, and classify them into 4 types. Then, we propose methods to assign the group members to MCS to remove improper paths. Simulation results show the proposed scheme may provide much less end-to-end delay than existing multiple MCS schemes.","PeriodicalId":332734,"journal":{"name":"Proceedings 15th International Conference on Information Networking","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A hybrid multiple MCS model for multicast over ATM networks\",\"authors\":\"Tae-Young Byun, K. Han\",\"doi\":\"10.1109/ICOIN.2001.905637\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a multicasting scheme to reduce the average end-to-end path delay on the multicast tree by removing duplicated or non-shortest paths, which we call improper paths, over ATM networks. First, we explain these improper paths that may be found in the full MCS model, and classify them into 4 types. Then, we propose methods to assign the group members to MCS to remove improper paths. Simulation results show the proposed scheme may provide much less end-to-end delay than existing multiple MCS schemes.\",\"PeriodicalId\":332734,\"journal\":{\"name\":\"Proceedings 15th International Conference on Information Networking\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-01-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 15th International Conference on Information Networking\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICOIN.2001.905637\",\"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 15th International Conference on Information Networking","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOIN.2001.905637","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A hybrid multiple MCS model for multicast over ATM networks
This paper presents a multicasting scheme to reduce the average end-to-end path delay on the multicast tree by removing duplicated or non-shortest paths, which we call improper paths, over ATM networks. First, we explain these improper paths that may be found in the full MCS model, and classify them into 4 types. Then, we propose methods to assign the group members to MCS to remove improper paths. Simulation results show the proposed scheme may provide much less end-to-end delay than existing multiple MCS schemes.