Browse > Article

Game Theoretic MAP Load Balancing Scheme in HMIPv6  

Ki, Bum-Do (서강대학교 정보통신대학원)
Kim, Sung-Wook (서강대학교 컴퓨터공학과)
Abstract
The Hierarchical Mobile IPv6 (HMIPv6) has been proposed to accommodate frequent mobility of the Mobile Node. HMIPv6 can effectively reduce the signaling overhead and latency. However, it has a problem that the registration of a mobile node concentrates on the furthest MAP(Mobility Anchor Point) when the mobile node enters into a new domain. This paper proposes a new load distribution mechanism by using the concept of Nash Bargaining Solution. The main advantage of the proposed scheme can prevent load concentration from being registered to the specified MAP based on the weight value according to the available resource-ratio of a MAP. With a simulation study, the proposed scheme can improve network performance under widely diverse traffic load intensities.
Keywords
HMIP; MAP; Load Balancing; Game Theory; Nash Bargaining Solution;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 H. Soliman, C. Castelluccia, K. El Malki and L. Bellier, Hierarchical Mobile IPv6 Mobility Management (HMIPv6), RFC4140, Aug. 2005.
2 James F. Kurose and Keith W. Ross, Computer Networking : A Top-Down Approach, 4th Edition, Addison-Wesley, 2008.
3 정원식, 이수경, "적응적 MAP 선택을 통한 HMIPv6 네트워크의 성능 향상 알고리즘", 한국통신학회논문지 '06-11 Vol.31 No.11B, pp.945-946, 2006.   과학기술학회마을
4 Rajeev S. Koodli and Charles E. Perkins, MOBILEINTER-NETWORKING WITH IPv6 Concepts, Principles, and Practices, Wiley-Interscience, 2007.
5 Allen B. MacKenzie and Luiz A. DaSilva, Game Theory for Wireless Engineers, Morgan & Claypool Publishers, 2006.
6 성기혁, HMIPv6상에서의 MAP 부하 분산 알고리즘, 한양대학교 대학원, pp.13-14, 2007.
7 노명화, 계층적 이동 IPv6환경에서 이동단말의 특성을 고려한 비용 효율적인 MAP 선택 기법, 강원대학교 대학원, pp.6-7, 2007.
8 한동근, 게임이론-전략적 의사결정의 이론과 응용-, 경문사, 1997.
9 이승종, HMIPv6환경에서의 효율적인 MAP 선택 방안, 건국대학교 대학원, pp.29-32, 2005.