Optimized Multicast Tree for Handover in a Two-Nodes Mobile Network Architecture Based on a All-IP Infrastructure

Y. Benallouche, D. Barth
{"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}
引用次数: 3

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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于全ip架构的双节点移动网络结构中切换的优化组播树
本文考虑了基于全IP基础设施的两个节点(基站(BS)、接入网关(AG))移动网络体系结构。我们建议使用一个多播树,从一个AG到一些BS,在这个树上可以预测移动。对问题进行了很好的定义,并对复杂性的证明和约简进行了很好的讨论。我们将重点放在控制每个IP路由器中的组播功能的分布式过程上,以获得与嵌入式IP路由兼容的约束延迟组播树,从而最大限度地减少使用的链路数量。在从图论的角度定义了相关问题之后,我们证明了它是np完全的,并且是不可逼近的。然后,我们描述了一种分布式算法,并将其性能与所提出的集中式算法进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Comparative Analysis of the Resource Consumption in Message Oriented Middleware with XML and Binary Encoded Messages Performability Model of Vertical Handoff in Wireless Data Network Mobile Ad Hoc Communication Networks: Capacity Analysis and Design Security Analysis of Interleave-Division Multiple Access: Next Generation Competitor Data-Centric Density Control for Wireless Sensor Networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1