Game Theoretic MAP Load Balancing Scheme in HMIPv6 


Vol. 35,  No. 7, pp. 991-1000, Jul.  2010


PDF
  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.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

B. Ki and S. Kim, "Game Theoretic MAP Load Balancing Scheme in HMIPv6," The Journal of Korean Institute of Communications and Information Sciences, vol. 35, no. 7, pp. 991-1000, 2010. DOI: .

[ACM Style]

Bum-do Ki and Sung-wook Kim. 2010. Game Theoretic MAP Load Balancing Scheme in HMIPv6. The Journal of Korean Institute of Communications and Information Sciences, 35, 7, (2010), 991-1000. DOI: .

[KICS Style]

Bum-do Ki and Sung-wook Kim, "Game Theoretic MAP Load Balancing Scheme in HMIPv6," The Journal of Korean Institute of Communications and Information Sciences, vol. 35, no. 7, pp. 991-1000, 7. 2010.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880