{"title":"基于全ip架构的双节点移动网络结构中切换的优化组播树","authors":"Y. Benallouche, D. Barth","doi":"10.1109/ICWMC.2008.18","DOIUrl":null,"url":null,"abstract":"This paper considers two nodes (base station (BS), access gateway (AG)) mobile network architecture based on a all IP infrastructure. We propose to use a multicast tree from an AG to some BS on which mobility could be predicted. The problem is well defined and the complexity proof and reduction are well discussed. We focus on a distributed process to control multicast functionalities in each IP router to obtain a constraint delay multicast tree compatible with the embedded IP routing that minimises the number of used links. After defining the related problem from a graph theory point of view, we show that it is NP-complete and not approximable. Then, we describe a distributed algorithm and we compare its performance to the ones of a proposed centralised algorithm.","PeriodicalId":308667,"journal":{"name":"2008 The Fourth International Conference on Wireless and Mobile Communications","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Optimized Multicast Tree for Handover in a Two-Nodes Mobile Network Architecture Based on a All-IP Infrastructure\",\"authors\":\"Y. Benallouche, D. Barth\",\"doi\":\"10.1109/ICWMC.2008.18\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper considers two nodes (base station (BS), access gateway (AG)) mobile network architecture based on a all IP infrastructure. We propose to use a multicast tree from an AG to some BS on which mobility could be predicted. The problem is well defined and the complexity proof and reduction are well discussed. We focus on a distributed process to control multicast functionalities in each IP router to obtain a constraint delay multicast tree compatible with the embedded IP routing that minimises the number of used links. After defining the related problem from a graph theory point of view, we show that it is NP-complete and not approximable. Then, we describe a distributed algorithm and we compare its performance to the ones of a proposed centralised algorithm.\",\"PeriodicalId\":308667,\"journal\":{\"name\":\"2008 The Fourth International Conference on Wireless and Mobile Communications\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-07-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 The Fourth International Conference on Wireless and Mobile Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICWMC.2008.18\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 The Fourth International Conference on Wireless and Mobile Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICWMC.2008.18","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Optimized Multicast Tree for Handover in a Two-Nodes Mobile Network Architecture Based on a All-IP Infrastructure
This paper considers two nodes (base station (BS), access gateway (AG)) mobile network architecture based on a all IP infrastructure. We propose to use a multicast tree from an AG to some BS on which mobility could be predicted. The problem is well defined and the complexity proof and reduction are well discussed. We focus on a distributed process to control multicast functionalities in each IP router to obtain a constraint delay multicast tree compatible with the embedded IP routing that minimises the number of used links. After defining the related problem from a graph theory point of view, we show that it is NP-complete and not approximable. Then, we describe a distributed algorithm and we compare its performance to the ones of a proposed centralised algorithm.