Performance Analysis of the Mobility Anchor Point in Hierarchical Mobile IPv6

Younghyun KIM
Miyoung KIM
Youngsong MUN

Publication
IEICE TRANSACTIONS on Communications   Vol.E89-B    No.10    pp.2715-2721
Publication Date: 2006/10/01
Online ISSN: 1745-1345
DOI: 10.1093/ietcom/e89-b.10.2715
Print ISSN: 0916-8516
Type of Manuscript: Special Section PAPER (Special Section on Mobile Multimedia Communications)
Category: 
Keyword: 
hierarchical mobile IPv6,  mobility anchor point,  MAP's capability,  blocking probability,  Markov chain,  

Full Text: PDF(443.4KB)>>
Buy this Article


Summary: 
Internet engineering task force (IETF) has proposed hierarchical mobile IPv6 (HMIPv6) in order to reduce a frequent location registration of a mobile node in mobile IPv6 (MIPv6). All traffics toward a mobile node must be transmitted through a MAP in HMIPv6. This brings unnecessary packet latency because of the increased processing cost of packet at the MAP. At this point, the processing cost of packet at the MAP is influenced by the packet arrival rate for a mobile node, cell mobility rate and the number of mobile nodes in MAP domain. In this paper, we analyze the MAP's performance considering the above elements. For this, we compare total cost of HMIPv6 with total cost of MIPv6 as MAP's capability after we define Markov chain model for performance analysis. Also, we define network's total profit as total cost of MIPv6 minus total cost of HMIPv6. Then, we can find optimal capability of MAP such that total profit has maximum value. Also, we use the blocking probability by the MAP's capability as performance estimation element. As a conclusion, we can observe both HMIPv6's performance by the MAP's capability and optimal capability of the MAP, and blocking probability form a relationship of trade off between them.