Adaptive MAP Selection Mechanism for HMIPv6

碩士 === 淡江大學 === 資訊工程學系碩士班 === 95 === Hierarchical Mobile IPv6 Management (HMIPv6) which is drawn up by the IETF (Internet Engineering Task Force) utilizes the Mobile Anchor Point (MAP) to reduce the considerable number of binding update messages among the mobile node, correspondent node, and the mob...

Full description

Bibliographic Details
Main Authors: Chien-Shan Kuo, 郭建杉
Other Authors: Kuei-Ping Shih
Format: Others
Language:zh-TW
Published: 2007
Online Access:http://ndltd.ncl.edu.tw/handle/87770550626961342696
Description
Summary:碩士 === 淡江大學 === 資訊工程學系碩士班 === 95 === Hierarchical Mobile IPv6 Management (HMIPv6) which is drawn up by the IETF (Internet Engineering Task Force) utilizes the Mobile Anchor Point (MAP) to reduce the considerable number of binding update messages among the mobile node, correspondent node, and the mobile node''s home agent. Accrdoing to the HMIPv6 mechanism, the MAP of higher layer can efficiently reduce the frequency of binding update messages; it will have higher loading of service and become the bottleneck of the whole network. Because the MAP’s bandwidth of services is finite and if MAP serves as the gateway at the same time, the whole network will be crashed due to overloading. The thesis proposes a MAP selection mechanism that takes the mobile node''s particular characteristics which include the mobility velocity and quantity of communication services into consideration, the research can manage MAPs efficiently. Besides, the research also designs the MAP Load Balance mechanism to avoid the network crash due to the overloaded MAP. The experimental results show that proposed adaptive MAP selection mechanism even in a great deal of mobile nodes scenario also can reduce the number of binding update messages efficiently. Besides, the proposed method comparing with other common ones is still superior.