Performance Analysis of the Mobility Anchor Point in Hierarchical Mobile IPv6

Younghyun KIM; Miyoung KIM; Youngsong MUN

doi:10.1093/ietcom/e89-b.10.2715

Performance Analysis of the Mobility Anchor Point in Hierarchical Mobile IPv6

Younghyun KIM, Miyoung KIM, Youngsong MUN

Full Text Views

0

Cite this

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.

Publication: IEICE TRANSACTIONS on Communications Vol.E89-B No.10 pp.2715-2721

Publication Date: 2006/10/01

Publicized

Online ISSN: 1745-1345

DOI: 10.1093/ietcom/e89-b.10.2715

Type of Manuscript: Special Section PAPER (Special Section on Mobile Multimedia Communications)

Category

Cite this

Copy

Younghyun KIM, Miyoung KIM, Youngsong MUN, "Performance Analysis of the Mobility Anchor Point in Hierarchical Mobile IPv6" in IEICE TRANSACTIONS on Communications, vol. E89-B, no. 10, pp. 2715-2721, October 2006, doi: 10.1093/ietcom/e89-b.10.2715.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e89-b.10.2715/_p

Copy

@ARTICLE{e89-b_10_2715,
author={Younghyun KIM, Miyoung KIM, Youngsong MUN, },
journal={IEICE TRANSACTIONS on Communications},
title={Performance Analysis of the Mobility Anchor Point in Hierarchical Mobile IPv6},
year={2006},
volume={E89-B},
number={10},
pages={2715-2721},
abstract={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.},
keywords={},
doi={10.1093/ietcom/e89-b.10.2715},
ISSN={1745-1345},
month={October},}

Copy

TY - JOUR
TI - Performance Analysis of the Mobility Anchor Point in Hierarchical Mobile IPv6
T2 - IEICE TRANSACTIONS on Communications
SP - 2715
EP - 2721
AU - Younghyun KIM
AU - Miyoung KIM
AU - Youngsong MUN
PY - 2006
DO - 10.1093/ietcom/e89-b.10.2715
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E89-B
IS - 10
JA - IEICE TRANSACTIONS on Communications
Y1 - October 2006
AB - 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.
ER -