DocumentCode
2445953
Title
Optimized Multicast Tree for Handover in a Two-Nodes Mobile Network Architecture Based on a All-IP Infrastructure
Author
Benallouche, Y. ; Barth, Dominique
Author_Institution
PRiSM, Univ. de Versailles, Versailles
fYear
2008
fDate
July 27 2008-Aug. 1 2008
Firstpage
179
Lastpage
184
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.
Keywords
distributed algorithms; mobile communication; multicast communication; routing protocols; transport protocols; trees (mathematics); IP routing; access gateway mobile network; all-IP infrastructure; base station mobile network; constraint delay multicast tree; distributed algorithm; graph theory; optimized multicast tree; two-node mobile network architecture; Broadcasting; Costs; Delay; Distributed algorithms; Extremities; Graph theory; Multicast algorithms; Routing; Transmitters; Tree graphs; Mobile network; distributed algorithm; multicast IP;
fLanguage
English
Publisher
ieee
Conference_Titel
Wireless and Mobile Communications, 2008. ICWMC '08. The Fourth International Conference on
Conference_Location
Athens
Print_ISBN
978-0-7695-3274-5
Electronic_ISBN
978-0-7695-3274-5
Type
conf
DOI
10.1109/ICWMC.2008.18
Filename
4591283
Link To Document