身份与位置标识分离映射解析关键技术研究
|
摘要
日益增加的网络用户数量、多家乡(多归属)接入设计、流量工程以及策略路由等原因,使得网络路由表规模在过去的几年中急剧增大,导致互联网路由与寻址系统正面临着严重的可扩展问题。产生该问题的主要原因之一就是IP地址的语义过载,即在当前互联网体系结构中,IP地址既代表一个合法的互联网用户身份,又标识用户终端在网络中的位置,承载双重语义信息。同时随着新业务的不断出现,人们对移动性的要求越来越高,虽然移动IP的出现,使互联网对移动性的支持有了一定的改进,但是由于IP地址双重身份一直制约移动IP相关技术性能的提升,网络身份与位置标识的分离成为解决互联网中的路由扩展性、移动性支持、安全性等问题的重要基础,身份与位置标识分离映射技术成为当前互联网领域研究的热点之一。
本文研究工作依托于国家973计划重大项目“一体化可信网络与普适服务体系基础研究”。该项目提出了一体化可信网络模型,通过引入接入标识和交换路由标识来实现身份和位置的分离。接入标识代表终端的公开身份信息,而交换路由标识代表终端的位置信息;通过身份标识与位置标识的分离映射机制克服传统互联网中由IP地址双重身份带来的种种问题,能够满足新业务对多种接入方式、路由可扩展性、移动性、安全性等方面的需求,实现网络一体化并为用户提供普适服务。身份与位置分离映射机制中最核心的问题是如何实现身份和位置标识之间映射信息的高效解析。
本论文针对映射信息解析的关键技术展开研究,主要解决大规模标识映射信息表项的分布式存储、快速查询、映射关系快速更新问题。主要的研究成果和创新点如下:
1、通过深入研究互联网的初始设计思路,对IP地址既代表用户的身份又标识其网络位置的双重属性问题进行了深入研究和分析,提出了基于映射表项活跃特性的三态多层级分布式映射体系NISMA(Network Identifiers Separating and Mapping based on Activity)来实现网络身份标识与接入位置标识的分离映射。该体系将解析架构分为动态时变层、亚稳态汇聚层和稳态冗余层。描述了NISMA的基本原理,设计了映射信息的生成、扩散和更新流程,并对其性能进行了分析,结果表明所提出的映射体系是合理的。
2、针对NISMA中亚稳态汇聚层标识映射存储问题,基于路由标识(RLOC)空间的层次化可汇聚特点,提出了一种具有网络位置感知能力的标识映射信息存储算法(N3-Chord),设计出网络位置感知的分布式HASH表(NLA-DHT);NLA-DHT选择的映射信息存储位置与网络节点所分配的节点标识之间具有良好的网络拓扑位置一致性,相应地基于NLA-DHT设计的N3-Chord算法具有更好的查询性能,同时满足标识映射存储对网络故障的容错性要求。
3、为了进一步提高映射表项的查询效率,针对动态时变层的映射表项查询优化问题,从标识分离映射网络通信行为的双向交互特性出发,提出一种通信对端对源端标识映射查询行为的定向推送预取策略。同时,基于马尔可夫模型预测标识映射信息重用的概率,提出一种基于标识映射信息生命期的自适应缓存管理算法MRPP,使占网络流量90%的分组都可以通过ASR缓存查找完成映射关系查询,不用到Chord环中节点(映射服务器)进行查找,提高了算法的性能。
4、由于实现了身份标识和位置标识的分离,终端移动切换势必会引起映射表项的更新,为了使更新机制更好地支持终端移动性,提出了一种逆向路由重定向无缝切换方法(RRDSS)。在该方法中,由终端移动到的新ASR向原ASR发送路由重定向消息,该消息会由原ASR根据移动节点的连接信息,向目的节点进行逆向回溯,发送给沿途的节点进行重定向,直到到达原ASR和新ASR的最近公共前继路由器终止。分析表明,该方法切换时延可以满足一体化网络环境下网络实时应用的要求,终端移动节点对这一过程没有感知,能够实现基于NISMA机制的移动终端的快速切换,满足了无缝切换的网络性能需求,大量节省了系统无线接入资源。
本论文针对身份与位置标识分离映射解析提出了基于映射活跃特性的网络标识分离映射体系NISMA,在此基础上提出的N3-Chord映射信息存储算法、定向推送的预取策略、MRPP缓存管理算法、逆向路由重定向的快速切换方法,有望对新一代信息网络特别是移动互联网络的发展与应用起到促进作用。
With the increment of network users, multi-homing, traffic engineering and policy routing, the scale of the DFZ routing tables increases dramatically in recent years, which results in that the routing and addressing system of Internet faces seriously scalable problems. One of the main reasons is the overload of IP address in semantics. That is to say, in the current Internet architecture IP address is used to represent an identity of a legal internet user and its locator in the network by using its network number, which means the IP address possesses double identities. With the emergence of new services, the demand on mobility increases greatly. Although the mobile IP can improve the support of Internet for mobility slightly, the overloaded IP semantics limits the improvement of its performance. However,the separation of identity and location presents a fundamental solution for the support of mobility, security and routing scalability. As a result, with the rapid growth of the Internet technology, the separation of identifier and locator will become a hot research topic in recent years.
The project of Universal trustworthy Network and pervasive Services belongs to the National Basic Research Program (973 Program).The project team proposes the universal trustworthy Network model, which realizes the separation of the identity and location by introducing two identifiers Access Identifier (AID) and Routing Locator (RLOC), where AID represents the identifier of the terminal and RLOC represents the locator of the terminal. The separation of identifier and locator could solve the problems caused by double identity of IP address in traditional network, and it could meet the new business requirements for multi access, mobility, security and so on. Additionally, it unifies users, business and network resources as a whole and provides users pervasive services well. The key problem of the identifier and locator separation mapping mechanism is how to realize the effective resolution.
This dissertation researches on the key technologies of the mapping information resolution, which aims at solving the distributed storage, rapid query and fast update of the massive identifier mapping information item. The main research results and innovation points are as follows:
1. By studying the original design idea of the Internet and the double identities of IP address, the network identifier separation and mapping mechanism NISMA(Network Identifiers Separating and Mapping based on Activity) was proposed according to the idea of the capacity structure, which divided the analyze structure into the active time variable class, metastable state class and homeostasis state class .And then we described the basic principle of the NISMA mechanism ,designed the process of the mapping information generation, extension and update, and the performance was analyzed. The result shows that the mapping system is reasonable.
2. Aiming at the storage problems of identifier mapping in the NISMA metastable state class, a network Locality-Aware identifier mapping information storage algorithm(N3-Chord) was designed based on the character of hierarchy and aggregation in RLOC structure .On that basis, a new Locality-Aware distributable Hash table(NLA-DHT) which has good network topological locality consistency is designed. Evaluation results manifests that N3-Chord based on NLA-DHT has better query performance and could satisfy the fault-Tolerance demand of the mapping storage to network.
3. In order to enhance the query efficiency of the mapping relationship, aiming at the optimization problem of mapping table item query, a pre-caching strategy of the access switch router are proposed based on Identifiers Separating and Mapping from the bidirectional interactive character of the communication activity in the identity separation network. At the same time, Markov Model is introduced to estimate the probability of identifier mapping message repetition and then a new self-adaptive cache management algorithm MRPP is proposed based on message Life-Cycle of identifier mapping. The simulation results manifest that the 90 percent of lookup could be finished in the ASR cache and needn’t make lookup in the Chord circle code, which means that our method enhances the performance of the algorithm.
4. Because of the implement of the separation of Identifier and Routing Locator, the move and switch of the terminal will result in the update of the mapping table item. In order to make the update mechanism support the terminal movement, a reverse re-direction welded switch system is proposed. In this approach, the new ASR moved from the terminal send re-direction message to the original ASR and the message can trace to the destination node conversely from the original ASR according to the connection information of mobile node. Analysis shows that,the handoff delay of this method can meet the requirements of network real-time applications under the UNet environment,realize the fast switch of the terminal based on NISMA mechanism, and satisfy the network performance demand of welded switch and save the system wireless access resource.
The dissertation proposes a network identifier separation and mapping mechanism NISMA based on capacity structure aiming at the separation mapping mechanism of the identity identifier and the routing identifier .On that basis we present N3-Chord mapping information storage algorithm, aimed prefetching policy, MRPP cache management algorithm and the approach of swift handoff on routing reverse re-direction. The above work in this dissertation is expected to play a significant role on the next-generation Internet, especially on the mobile information network.
本文研究工作依托于国家973计划重大项目“一体化可信网络与普适服务体系基础研究”。该项目提出了一体化可信网络模型,通过引入接入标识和交换路由标识来实现身份和位置的分离。接入标识代表终端的公开身份信息,而交换路由标识代表终端的位置信息;通过身份标识与位置标识的分离映射机制克服传统互联网中由IP地址双重身份带来的种种问题,能够满足新业务对多种接入方式、路由可扩展性、移动性、安全性等方面的需求,实现网络一体化并为用户提供普适服务。身份与位置分离映射机制中最核心的问题是如何实现身份和位置标识之间映射信息的高效解析。
本论文针对映射信息解析的关键技术展开研究,主要解决大规模标识映射信息表项的分布式存储、快速查询、映射关系快速更新问题。主要的研究成果和创新点如下:
1、通过深入研究互联网的初始设计思路,对IP地址既代表用户的身份又标识其网络位置的双重属性问题进行了深入研究和分析,提出了基于映射表项活跃特性的三态多层级分布式映射体系NISMA(Network Identifiers Separating and Mapping based on Activity)来实现网络身份标识与接入位置标识的分离映射。该体系将解析架构分为动态时变层、亚稳态汇聚层和稳态冗余层。描述了NISMA的基本原理,设计了映射信息的生成、扩散和更新流程,并对其性能进行了分析,结果表明所提出的映射体系是合理的。
2、针对NISMA中亚稳态汇聚层标识映射存储问题,基于路由标识(RLOC)空间的层次化可汇聚特点,提出了一种具有网络位置感知能力的标识映射信息存储算法(N3-Chord),设计出网络位置感知的分布式HASH表(NLA-DHT);NLA-DHT选择的映射信息存储位置与网络节点所分配的节点标识之间具有良好的网络拓扑位置一致性,相应地基于NLA-DHT设计的N3-Chord算法具有更好的查询性能,同时满足标识映射存储对网络故障的容错性要求。
3、为了进一步提高映射表项的查询效率,针对动态时变层的映射表项查询优化问题,从标识分离映射网络通信行为的双向交互特性出发,提出一种通信对端对源端标识映射查询行为的定向推送预取策略。同时,基于马尔可夫模型预测标识映射信息重用的概率,提出一种基于标识映射信息生命期的自适应缓存管理算法MRPP,使占网络流量90%的分组都可以通过ASR缓存查找完成映射关系查询,不用到Chord环中节点(映射服务器)进行查找,提高了算法的性能。
4、由于实现了身份标识和位置标识的分离,终端移动切换势必会引起映射表项的更新,为了使更新机制更好地支持终端移动性,提出了一种逆向路由重定向无缝切换方法(RRDSS)。在该方法中,由终端移动到的新ASR向原ASR发送路由重定向消息,该消息会由原ASR根据移动节点的连接信息,向目的节点进行逆向回溯,发送给沿途的节点进行重定向,直到到达原ASR和新ASR的最近公共前继路由器终止。分析表明,该方法切换时延可以满足一体化网络环境下网络实时应用的要求,终端移动节点对这一过程没有感知,能够实现基于NISMA机制的移动终端的快速切换,满足了无缝切换的网络性能需求,大量节省了系统无线接入资源。
本论文针对身份与位置标识分离映射解析提出了基于映射活跃特性的网络标识分离映射体系NISMA,在此基础上提出的N3-Chord映射信息存储算法、定向推送的预取策略、MRPP缓存管理算法、逆向路由重定向的快速切换方法,有望对新一代信息网络特别是移动互联网络的发展与应用起到促进作用。
With the increment of network users, multi-homing, traffic engineering and policy routing, the scale of the DFZ routing tables increases dramatically in recent years, which results in that the routing and addressing system of Internet faces seriously scalable problems. One of the main reasons is the overload of IP address in semantics. That is to say, in the current Internet architecture IP address is used to represent an identity of a legal internet user and its locator in the network by using its network number, which means the IP address possesses double identities. With the emergence of new services, the demand on mobility increases greatly. Although the mobile IP can improve the support of Internet for mobility slightly, the overloaded IP semantics limits the improvement of its performance. However,the separation of identity and location presents a fundamental solution for the support of mobility, security and routing scalability. As a result, with the rapid growth of the Internet technology, the separation of identifier and locator will become a hot research topic in recent years.
The project of Universal trustworthy Network and pervasive Services belongs to the National Basic Research Program (973 Program).The project team proposes the universal trustworthy Network model, which realizes the separation of the identity and location by introducing two identifiers Access Identifier (AID) and Routing Locator (RLOC), where AID represents the identifier of the terminal and RLOC represents the locator of the terminal. The separation of identifier and locator could solve the problems caused by double identity of IP address in traditional network, and it could meet the new business requirements for multi access, mobility, security and so on. Additionally, it unifies users, business and network resources as a whole and provides users pervasive services well. The key problem of the identifier and locator separation mapping mechanism is how to realize the effective resolution.
This dissertation researches on the key technologies of the mapping information resolution, which aims at solving the distributed storage, rapid query and fast update of the massive identifier mapping information item. The main research results and innovation points are as follows:
1. By studying the original design idea of the Internet and the double identities of IP address, the network identifier separation and mapping mechanism NISMA(Network Identifiers Separating and Mapping based on Activity) was proposed according to the idea of the capacity structure, which divided the analyze structure into the active time variable class, metastable state class and homeostasis state class .And then we described the basic principle of the NISMA mechanism ,designed the process of the mapping information generation, extension and update, and the performance was analyzed. The result shows that the mapping system is reasonable.
2. Aiming at the storage problems of identifier mapping in the NISMA metastable state class, a network Locality-Aware identifier mapping information storage algorithm(N3-Chord) was designed based on the character of hierarchy and aggregation in RLOC structure .On that basis, a new Locality-Aware distributable Hash table(NLA-DHT) which has good network topological locality consistency is designed. Evaluation results manifests that N3-Chord based on NLA-DHT has better query performance and could satisfy the fault-Tolerance demand of the mapping storage to network.
3. In order to enhance the query efficiency of the mapping relationship, aiming at the optimization problem of mapping table item query, a pre-caching strategy of the access switch router are proposed based on Identifiers Separating and Mapping from the bidirectional interactive character of the communication activity in the identity separation network. At the same time, Markov Model is introduced to estimate the probability of identifier mapping message repetition and then a new self-adaptive cache management algorithm MRPP is proposed based on message Life-Cycle of identifier mapping. The simulation results manifest that the 90 percent of lookup could be finished in the ASR cache and needn’t make lookup in the Chord circle code, which means that our method enhances the performance of the algorithm.
4. Because of the implement of the separation of Identifier and Routing Locator, the move and switch of the terminal will result in the update of the mapping table item. In order to make the update mechanism support the terminal movement, a reverse re-direction welded switch system is proposed. In this approach, the new ASR moved from the terminal send re-direction message to the original ASR and the message can trace to the destination node conversely from the original ASR according to the connection information of mobile node. Analysis shows that,the handoff delay of this method can meet the requirements of network real-time applications under the UNet environment,realize the fast switch of the terminal based on NISMA mechanism, and satisfy the network performance demand of welded switch and save the system wireless access resource.
The dissertation proposes a network identifier separation and mapping mechanism NISMA based on capacity structure aiming at the separation mapping mechanism of the identity identifier and the routing identifier .On that basis we present N3-Chord mapping information storage algorithm, aimed prefetching policy, MRPP cache management algorithm and the approach of swift handoff on routing reverse re-direction. The above work in this dissertation is expected to play a significant role on the next-generation Internet, especially on the mobile information network.
引文
[1]董平,秦雅娟,张宏科.支持普适服务的一体化网络研究[J].电子学报, 2007, 35 (4): 599-606.
[2]张宏科,苏伟.新网络体系基础研究——一体化网络与普适服务[J].电子学报, 2007,35(4): 594-598.
[3]杨冬,周华春,张宏科.基于一体化网络的普适服务研究[J].电子学报, 2007, 35 (4): 607-613.
[4]董平,杨冬,秦雅娟,张宏科.新一代互联网移动管理机制研究[J].电子学报, 2008, 36(10): 1916-1922.
[5] Tabbane.S. Location management methods for third generation mobile systems[J]. Communications Magazine, IEEE, 1997, 35(8):72-78.
[6] Jianwei Zhang, Renjie Pi, Fuzhou Yao, Jicheng Quan, Yunfei Guo. Router UDP Switch support NAT Traversal[A]. In: The 2nd International Conference on Pervasive Computing and its Application[C], Birmingham, England, UK, July 2007.
[7] Moskowitz R.Host identity protocol[EB/OL]. Internet draft, http://tools.ietf.org/html/draft-moskowitz-hip-09, IETF, 2004.
[8] Moskowitz R. Host identity protocol architecture[EB/OL]. Internet draft, http://tools.ietf.org/html/draft-moskowitz-hip-arch-06 , IETF, 2004.
[9] Nikander P. Integrating security, mobility, and multi-homing in a HIP way[A]. In: Proc. Of the Network and Distributed Systems Security Symp (NDSS 2003) [C], San Diego, CA, 2003:87?99.
[10] M Ishiyama, M Kunishi, F Teraoka. An Analysis of Mobility Handling in LIN6[A].In: International Symposium on Wireless Personal Multimedia Communication[C], 2001.
[11] D.Farinacci. Locator/ID Separation Protocol(LISP)[EB/OL]. Internet draft, http://tools.ietf.org/html/draft-farinacci-lisp-12, IETF, 2009.
[12] D. Meyer.The locator identifier separation protocol (LISP)[J]. Internet Protocol Journal, 2008, 11(1):23–36.
[13] L. Mathy, Lancaster U, L. Iannone,O. Bonaventure. LISP-DHT: Towards a DHT to map identifiers onto locators[EB/OL]. Internet draft, http://inl.info.ucl.ac.be/system/files/draft-mathy-lisp-dht-00.txt, IETF, 2008.
[14] Eriksson J. PeerNet: Pushing peer-to-peer down the stack[A]. In: Proc. of the Int’l Workshop on Peer-To-Peer Systems 2003 (IPTPS 2003)[C], Berkeley, CA, USA, 2003:268?277.
[15] Hong X, Xu K, Gerla M. Scalable routing protocols for mobile ad hoc networks[J]. IEEE Network, 2002, 6(4):11?21.
[16] C.Vogt. Six/One: A Solution for Routing and Addressing in IPv6[EB/OL]. Internet draft, http://tools.ietf.org/html/draft-vogt-rrg-six-one-01, IETF, 2007.
[17] B.Zhang,D.Massey,D.Pei,L.Wang,L.Zhang,R.Oliveira.A Secure and Scalable Internet Routing Architecture [R].Technical Report TR-06-01, University of Arizona, Apr 2006.
[18] G Huston. Architectural Commentary on Site Multi-homing using a Level 3 Shim [EB/OL]. Internet draft, http://tools.ietf.org/html/draft-ietf-shim6-arch-00 , IETF, 2005.
[19] XU Xiaohu, GUO Dayong. Hierarchical routing architecture (HRA) [A]. In:Proceedings of Next Generation Internet Networks(NGI’08)[C], Piscataway, NJ, USA: IEEE, 2008: 92-99.
[20] K.Imai, M.Yabusaki, T.Ihara. IP2 Architecture towards Mobile Net and Internet Convergence[C].WTC2003, Sept 2002.
[21] M.O’Dell. GSE-An Alternate Addressing Architecture for IPv6[EB/OL]. Inernet draft, http://www.watersprings.org/pub/id/draft-ietf-ipngwg-gseaddr-00.txt, IETF, 1997.
[22] R. Whittle. Ivip Mapping Database Fast Push[EB/OL]. Internet draft, http://tools.ietf.org/html/draft-whittle-ivip-db-fast-push-01 , IETF, 2008.
[23] D. Farinacci, V. Fuller, D. Meyer. LISP alternative topology (LISP-ALT)[EB/OL]. Internet draft, http://tools.ietf.org/html/draft-ietf-lisp-alt-01, IETF, Nov 2007.
[24] S. Brim, D. Farinacci, D. Meyer, J. Curran. EID mappings multicast across cooperating systems for LISP[EB/OL]. Internet draft, http://tools.ietf.org/html/draft-curran-lisp-emacs-00, IETF, Nov 2007.
[25] S. Brim, N. Chiappa, D. Farinacci, V. Fuller, D. Lewis, D. Meyer. LISP-CONS: A content distribution overlay network service for LISP[EB/OL]. Internet draft, http://tools.ietf.org/html/draft-meyer-lisp-cons-04, IETF, Nov 2007.
[26] E. Lear. NERD: A not-so-novel EID to RLOC database[EB/OL]. Internet draft, http://tools.ietf.org/html/draft-lear-lisp-nerd-04, IETF, Jan 2008.
[27] C. Vogt. A DNS-based resolution system for IP address mappings[EB/OL]. http://www.ietf.org/proceedings/08mar/slides/RRG-4.pdf.
[28] B. Herrin. Tunnel Route Reduction Protocol (TRRP) [EB/OL]. http://bill.herrin.us/network/trrp.html.
[29] Hongbin Luo, Yajuan Qin, Hongke Zhang. A DHT-based Identifier-to-locator Mapping Approach for a Scalable Internet [J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2009, 20(10).
[30]程光,龚俭,丁伟.大规模互联网活动IP流分布研究[J].计算机科学, 2003,30(4):43-46.
[31] D. Jen, M. Meisel, D. Massey, L. Wang, B. Zhang, L. Zhang. APT: A Practical Transit Mapping Service [EB/OL].Internet draft, http://tools.ietf.org/html/draft-jen-apt-00. IETF, July 2007.
[32]彭艳兵,龚俭,丁伟,徐加羚.自相似活跃子网前缀空间的路由查找[J].计算机学报, 2005, 28(8): 107-115
[33] Kihong Park,Walter Willinger. Self-similar Network Traffic and Performance Evaluation[M]. Wiley-Inter science Publication, by John Wiley & Sons , Inc. , 2000, 531～553.
[34] Robin Whittle. Ivip Mapping Database Fast Push [EB/OL]. Internet draft, http://tools.ietf.org/id/draft-whittle-ivip-db-fast-push-03.txt. IETF, January 2010
[35]马卫东,李幼平,马建国,周明天.面向Web网页的区域用户行为实证研究[J].计算机学报.2008(31): 960-967.
[36] Letong Sun, Xia Yin, Zhiliang Wang, Jianping Wu. LMS: A Layered Mapping System For Scalable Routing[C]. 13th IEEE Global Internet Symposium 2010
[37] B. Carpenter. General Identifier-Locator Mapping Considerations[EB/OL]. Internet draft, http://tools.ietf.org/html/draft-carpenter-idloc-map-cons-01, IETF, June 2007.
[38] Weiyu Wu, Yang Chen, Xinyi Zhang,etc. LDHT: Locality-aware Distributed Hash Tables[A]. In: Proc. of the International Conference on Information Networking 2008 (ICOIN’08)[C], Busan, Korea, Jan 2008.
[39] I. Stoica, R. Morris, D. Karger, etc. Chord: A scalable peer-to-peer lookup service for internet applications[A]. In: Proceedings of SIGCOMM 2001[C], San Deigo, CA, 2001: 146-160.
[40] Feng Hong, Li Minglu,etc. PChord:Improvement on Chord to Achieve Better Routing Efficiency by Exploiting Proximity[A]. In Proceedings of International Conference on Distributed Computing Systems Worksshops(ICDCSW’05)[C],Ohio, USA, 2005:806-811.
[41] J.Xiong, Y. Zhang, P. Hong, J. Li. Chord6:IPv6 based topology-aware chord[A].In Proceedings of the Joint International conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (ICAS/ICNS2005)[C], Aug 2005: 19-23.
[42] I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications[A]. In Proc. of ACM SIGCOMM[C], New York, USA, ACM Press, 2001:149?160.
[43] P2Psim: A Simulator for Peer-to-Peer (P2P) Protocols [EB/OL]. http://pdos.csail.mit.edu/p2psim, July 2007.
[44] F. Dabek, J. Li, E. Sit, J. Robertson, M. Kaashoek, R. Morris. Designing a DHT for Low Latency and High Throughput[A]. In: Proc. of the 1st Symposium on Networked System Design and Implementation(NSDI '04)[C], 2004: 85-98.
[45] The Kingdata Set[EB/OL]. http://pdos.csail.mit.edu/p2psim/kingdata.
[46] GT-ITM Homepage[EB/OL]. http://www.cc.gatech.edu/projects/gtitm/.
[47] Ian Clarke, Oskar Sandberg, Brandon Wiley, Theodore W. Hong. Freenet: A Distributed Anonymous Information Storage and Retrieval System[A]. In: International Workshop on Design Issues in Anonymity and Unobservability[C], Berkeley, CA, USA, 2000: 46-66.
[48]郑冬冬,余宏亮,郑纬民.基于分段的适应性流媒体缓存管理算法[J].清华大学学报(自然科学版), 2007, 47(7): 1204-1207.
[49] Mazen Kharbutli,Yan Solihin. Counter-Based Cache Replacement Algorithms[A]. In: Proceedings of the 2005 International Conference on Computer Design(ICCD2005)[C], IEEE Computer Society, Washington, DC, USA, 2005: 61– 68.
[50] Balamash A, Krunz M. An overview of web caching replacement algorithms[J]. IEEE Communications Surveys and Tutorials, 2004, 6(2): 44-56.
[51] Rizzo L, Vicisano L. Replacement Policies for a Proxy Cache[J]. IEEE/ACM Transactions on Networking, 2000, 8(2): 158-170.
[52] He Chen, Chen Zhaoxiong, Heyan H. Summary of web caching technology[J]. Mini-Micro Systems, 2004, 25(5): 836-842.
[53] E.J. O’Neil, O’Neil, G. Weikum. The LRU-K page replacement algorithm for database disk buffering[A]. In: Proceedings of ACM SIGMOD[C], NewYork, NY, USA, 1993, 22(2): 297-306.
[54] Podlipnig S, Boszormenyi L. A survey of web cache replacement stategies[J]. ACM Computing Surveys, 2003, 35 (4): 374-398.
[55] Carlos Cunha, Azer Bestavros, Mark Crovella. Characteristics of WWW client-based traces[R]. Technical Report TR-95-010, Boston University, CS Dept, Boston, MA 02215, April 1995.
[56] A. Das, J. Gehrke, M. Riedewald. Approximate join processing over data streams[A]. In: Proceedings of the ACM International Conference on Management of Data (SIGMOD)[C], San Diego, California, 2003: 40-51.
[57] Jin S, Bestavros A. Greedy dual* web caching algorithm: exploiting the two sources of temporal locality in Web request streams[J]. Computer Communications, 2001, 24(2): 174-183.
[58] Gabor Szabo, Bernardo A. Huberman, Predicting the popularity of online content [EB/OL]. http://www.hpl.hp.com/research/idl/papers/predictions/predictions.pdf.
[59]徐利治.现代数学手册-随机数学卷[M].湖北:华中科技大学出版社, 2000年12月, P776-820.
[60]李康宁,卢艳民,陈红.基于马尔可夫预测模型的数据流滑动窗口近似连接缓存管理策略[A].见:计算机研究与发展[C],卷43(增刊),第11期:130-136,第二十三届中国数据库学术会议, 2006.
[61]张磊,邱绍峰. 4G移动通信技术[J].通信技术, 2007, 11(40):193-195.
[62] Wong.V.W-S, Leung.V.C.M. Location management for next-generation personal communications networks[J]. Network, IEEE, 2000, 14:18-24.
[63]郭梯云,邬国扬,李建东.移动通信[M].西安:西安电子科技大学出版社, 2005, P27-55.
[64] N.Nasser, A.Hasswa, H.Hassanein. Handoffs in fourth generation heterogeneous networks[J]. IEEE Communications Magazine, 2006, 44(10):96-103.
[65] Y.B.Lin,A.C.Pang.Comparing soft and hard handoffs[J].IEEE Transactions on Vehicular Technology, 2000, 49(3):792-798.
[66] D.Tcha, S.Kang, G.Jin. Load analysis of the soft handoff scheme in a CDMA cellular system[J]. IEEE Selected Areas in Communications, 2001, 19(6):1147-1152.
[67] C.Lee, R.Steele. Effect of soft and softer handoffs on CDMA system capacity[J]. IEEE Transactions on Vehicular Technology, 1998, 47(3):830-841.
[68] R.Droms, Ed., J.Bound.Dynamic Host Configuration Protocol for IPv6(DHCPv6)[S]. IETF, RFC-3315, July 2003.
[69] R.Droms. Dynamic host configuration protocol[S]. IETF, RFC-2231, 1997.
[70] R.Droms, J.Bound, B.Volz, T.Lemon, C.Perkins, M.Carney. Dynamic host configuration protocol for IPv6(DHCPv6)[S]. IETF, RFC-3315, 2003.
[71] Kent S, R.Atkinson. IP Authentication Header(AH)[S]. IETF, RFC-2402, November 1998.
[72] Kent S, R.Atkinson. IP Encapsulating Security Payload(ESP)[S]. RFC-2406, November 1998.
[73] D.Johnson,C.Perkins,J.Arkko. Mobility support in IPv6[S]. IETF, RFC-3775, June 2004.
[74] J.Arkko,V.Devarapalli,F.Dupont.Using IPsec to Protect Mobile IPv6 Signaling Between Mobile Nodes and Home Agents[S].IETF, RFC-3776, June 2004
[75] E. Fogelstroem, A. Jonsson, Ericsson. Mobile IPv4 Regional Registration[S]. IETF, RFC-4587, 2007
[76] M. Chakrabarty, I. Saha Misra, D. Saha, A. Mukherjee. A Comparative Study of Existing Protocols Supporting IP Mobility[A]. In: Proceedings of International Conference of World Wireless Congress (WWC2003)[C], San Fransisco, USA, 2003.
[77] Campbell A.T, Gomez J, Kim S, Wan CY, Turanyi Z.R, Valko A.G. Comparison of IP micromobility protocols[J]. Wireless Communications, IEEE, 2002, 9(1): 72-82.
[78] C.Perkins, D.B.Johnson. Route optimisation in mobile IP[EB/OL]. Internet draft, http://tools.ietf.org/id/draft-ietf-mobileip-optim-09.txt, IETF, 2001.
[79] K.E1 Malki, H.Soliman. Fast Handoffs in Mobile IPv4[EB/OL]. Internet draft,http://tools.ietf.org/html/draft-elmalki-mobileip-fast-handoffs-03, IETF,2000.
[80] H.Soliman, C.Castelluccia, K.EI Malki, L. Bellier. Hierarchical Mobile IPv6 Mobility Management(HMIPv6)[S]. IETF, RFC-4140, August 2005.
[81] P.McCann. Mobile IPv6 Fast Handovers for 802.ll Networks[S]. IETF, RFC-4260, November 2005.
[82] C.Perkins, D.B.Johnson. Route Optimisation in Mobile IP[J]. Cluster Computing, 2004, 1(2): 161-176.
[83] R.Hsieh, Z.G.Zhou, A.Seneviratne. S-MIP:a seamless handoff architecture for mobile IP[A]. In: Twenty-Second Annua Joint Conference of the IEEE Computer and Communications Societies(INFOCOM 2003)[C], San Franeisco,USA, 2003:1774-1784.
[84] R.Koodli. Fast Handovers for Mobile IPv6[S]. IETF, RFC-4068, Jun 2005.
[85] H.Y.Jung, S.J.Koh, H.Soliman et al. Fast Handover for Hierarchical MIPv6(F-HMIPv6) [EB/OL].Internet draft, http://tools.ietf.org/html/draft-jung-mobopts-fhmipv6-00, IETF, June 2004.
[86] H.Soliman, C.Castelluccia, K.El Malki, L.Bellier. Hierarchical Mobile IPv6 Mobility Management(HMIPv6)[S]. IETF, RFC-4140, August 2005.
[87] H.Soliman, C.Castelluccia, K.E1-Malki et al. Hierarchical MIPv6 mobility management (HMIPv6)[S]. IETF, RFC-4140, June2003.
[88] W.C.Ma, Y.G.Fang. Dynamic hierarchical mobility management strategy for mobile IP networks[J]. IEEE Journal on Selected Areas in Communications, 2004, 22(4):664-676.
[89] Xavier Perez-Costa, Marc Torrent-Moreno, Hanners Hartenstein. A performance comparison of Mobile IPv6, Hierarchical Mobile IPv6, fast handovers for Mobbile IPv6 and their combination[A]. In: ACM SIGMOBILE Mobile Computing and Communications Review[C], October 2003, 7(4): 5-19.
[90] J.Zhang, D.A.J.Pearce. Proactive care-of adddress test for route optimization in FMIPv6[A]. In: Proceddings of the 3rd ACM international workshop on Wireless mobile applications and services on WLAN hotspots(WMASH‘05)[C], Cologne, Germany, 2005:92-95.
[91] Toni Janevsky.Traffic Analysis and Design of Wireless IP Networks[M].Artech House, Inc., Norwood, MA, USA, 2003
[92] D.B.Johnson, C.Perkins, J.Arkko. Mobility support in IPv6[S]. IETF, RFC-3775, 2004.
[93] T.Narten, E.Nordmark, W.Simpson. Neighbor discovery for IP version 6(IPv6)[S]. IETF, RFC-2461,1998.
[94] M.Liebsch et.al. Candidate Aecess Router Discovery(CARD)[S], IETF, RFC-4066, July 2005.
[95] UC Berkeley. The Network Simulator: Building Ns [EB/OL]. http://www.isi.edu/nsnam/ns/ns-build.html.
[96] National Institute of Standards and Technology(NIST). mobility package for NS-2 [EB/OL].http://www.antd.nist.gov/seamlessandsecure/pubtool.shtml#tools.
[2]张宏科,苏伟.新网络体系基础研究——一体化网络与普适服务[J].电子学报, 2007,35(4): 594-598.
[3]杨冬,周华春,张宏科.基于一体化网络的普适服务研究[J].电子学报, 2007, 35 (4): 607-613.
[4]董平,杨冬,秦雅娟,张宏科.新一代互联网移动管理机制研究[J].电子学报, 2008, 36(10): 1916-1922.
[5] Tabbane.S. Location management methods for third generation mobile systems[J]. Communications Magazine, IEEE, 1997, 35(8):72-78.
[6] Jianwei Zhang, Renjie Pi, Fuzhou Yao, Jicheng Quan, Yunfei Guo. Router UDP Switch support NAT Traversal[A]. In: The 2nd International Conference on Pervasive Computing and its Application[C], Birmingham, England, UK, July 2007.
[7] Moskowitz R.Host identity protocol[EB/OL]. Internet draft, http://tools.ietf.org/html/draft-moskowitz-hip-09, IETF, 2004.
[8] Moskowitz R. Host identity protocol architecture[EB/OL]. Internet draft, http://tools.ietf.org/html/draft-moskowitz-hip-arch-06 , IETF, 2004.
[9] Nikander P. Integrating security, mobility, and multi-homing in a HIP way[A]. In: Proc. Of the Network and Distributed Systems Security Symp (NDSS 2003) [C], San Diego, CA, 2003:87?99.
[10] M Ishiyama, M Kunishi, F Teraoka. An Analysis of Mobility Handling in LIN6[A].In: International Symposium on Wireless Personal Multimedia Communication[C], 2001.
[11] D.Farinacci. Locator/ID Separation Protocol(LISP)[EB/OL]. Internet draft, http://tools.ietf.org/html/draft-farinacci-lisp-12, IETF, 2009.
[12] D. Meyer.The locator identifier separation protocol (LISP)[J]. Internet Protocol Journal, 2008, 11(1):23–36.
[13] L. Mathy, Lancaster U, L. Iannone,O. Bonaventure. LISP-DHT: Towards a DHT to map identifiers onto locators[EB/OL]. Internet draft, http://inl.info.ucl.ac.be/system/files/draft-mathy-lisp-dht-00.txt, IETF, 2008.
[14] Eriksson J. PeerNet: Pushing peer-to-peer down the stack[A]. In: Proc. of the Int’l Workshop on Peer-To-Peer Systems 2003 (IPTPS 2003)[C], Berkeley, CA, USA, 2003:268?277.
[15] Hong X, Xu K, Gerla M. Scalable routing protocols for mobile ad hoc networks[J]. IEEE Network, 2002, 6(4):11?21.
[16] C.Vogt. Six/One: A Solution for Routing and Addressing in IPv6[EB/OL]. Internet draft, http://tools.ietf.org/html/draft-vogt-rrg-six-one-01, IETF, 2007.
[17] B.Zhang,D.Massey,D.Pei,L.Wang,L.Zhang,R.Oliveira.A Secure and Scalable Internet Routing Architecture [R].Technical Report TR-06-01, University of Arizona, Apr 2006.
[18] G Huston. Architectural Commentary on Site Multi-homing using a Level 3 Shim [EB/OL]. Internet draft, http://tools.ietf.org/html/draft-ietf-shim6-arch-00 , IETF, 2005.
[19] XU Xiaohu, GUO Dayong. Hierarchical routing architecture (HRA) [A]. In:Proceedings of Next Generation Internet Networks(NGI’08)[C], Piscataway, NJ, USA: IEEE, 2008: 92-99.
[20] K.Imai, M.Yabusaki, T.Ihara. IP2 Architecture towards Mobile Net and Internet Convergence[C].WTC2003, Sept 2002.
[21] M.O’Dell. GSE-An Alternate Addressing Architecture for IPv6[EB/OL]. Inernet draft, http://www.watersprings.org/pub/id/draft-ietf-ipngwg-gseaddr-00.txt, IETF, 1997.
[22] R. Whittle. Ivip Mapping Database Fast Push[EB/OL]. Internet draft, http://tools.ietf.org/html/draft-whittle-ivip-db-fast-push-01 , IETF, 2008.
[23] D. Farinacci, V. Fuller, D. Meyer. LISP alternative topology (LISP-ALT)[EB/OL]. Internet draft, http://tools.ietf.org/html/draft-ietf-lisp-alt-01, IETF, Nov 2007.
[24] S. Brim, D. Farinacci, D. Meyer, J. Curran. EID mappings multicast across cooperating systems for LISP[EB/OL]. Internet draft, http://tools.ietf.org/html/draft-curran-lisp-emacs-00, IETF, Nov 2007.
[25] S. Brim, N. Chiappa, D. Farinacci, V. Fuller, D. Lewis, D. Meyer. LISP-CONS: A content distribution overlay network service for LISP[EB/OL]. Internet draft, http://tools.ietf.org/html/draft-meyer-lisp-cons-04, IETF, Nov 2007.
[26] E. Lear. NERD: A not-so-novel EID to RLOC database[EB/OL]. Internet draft, http://tools.ietf.org/html/draft-lear-lisp-nerd-04, IETF, Jan 2008.
[27] C. Vogt. A DNS-based resolution system for IP address mappings[EB/OL]. http://www.ietf.org/proceedings/08mar/slides/RRG-4.pdf.
[28] B. Herrin. Tunnel Route Reduction Protocol (TRRP) [EB/OL]. http://bill.herrin.us/network/trrp.html.
[29] Hongbin Luo, Yajuan Qin, Hongke Zhang. A DHT-based Identifier-to-locator Mapping Approach for a Scalable Internet [J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2009, 20(10).
[30]程光,龚俭,丁伟.大规模互联网活动IP流分布研究[J].计算机科学, 2003,30(4):43-46.
[31] D. Jen, M. Meisel, D. Massey, L. Wang, B. Zhang, L. Zhang. APT: A Practical Transit Mapping Service [EB/OL].Internet draft, http://tools.ietf.org/html/draft-jen-apt-00. IETF, July 2007.
[32]彭艳兵,龚俭,丁伟,徐加羚.自相似活跃子网前缀空间的路由查找[J].计算机学报, 2005, 28(8): 107-115
[33] Kihong Park,Walter Willinger. Self-similar Network Traffic and Performance Evaluation[M]. Wiley-Inter science Publication, by John Wiley & Sons , Inc. , 2000, 531～553.
[34] Robin Whittle. Ivip Mapping Database Fast Push [EB/OL]. Internet draft, http://tools.ietf.org/id/draft-whittle-ivip-db-fast-push-03.txt. IETF, January 2010
[35]马卫东,李幼平,马建国,周明天.面向Web网页的区域用户行为实证研究[J].计算机学报.2008(31): 960-967.
[36] Letong Sun, Xia Yin, Zhiliang Wang, Jianping Wu. LMS: A Layered Mapping System For Scalable Routing[C]. 13th IEEE Global Internet Symposium 2010
[37] B. Carpenter. General Identifier-Locator Mapping Considerations[EB/OL]. Internet draft, http://tools.ietf.org/html/draft-carpenter-idloc-map-cons-01, IETF, June 2007.
[38] Weiyu Wu, Yang Chen, Xinyi Zhang,etc. LDHT: Locality-aware Distributed Hash Tables[A]. In: Proc. of the International Conference on Information Networking 2008 (ICOIN’08)[C], Busan, Korea, Jan 2008.
[39] I. Stoica, R. Morris, D. Karger, etc. Chord: A scalable peer-to-peer lookup service for internet applications[A]. In: Proceedings of SIGCOMM 2001[C], San Deigo, CA, 2001: 146-160.
[40] Feng Hong, Li Minglu,etc. PChord:Improvement on Chord to Achieve Better Routing Efficiency by Exploiting Proximity[A]. In Proceedings of International Conference on Distributed Computing Systems Worksshops(ICDCSW’05)[C],Ohio, USA, 2005:806-811.
[41] J.Xiong, Y. Zhang, P. Hong, J. Li. Chord6:IPv6 based topology-aware chord[A].In Proceedings of the Joint International conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (ICAS/ICNS2005)[C], Aug 2005: 19-23.
[42] I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications[A]. In Proc. of ACM SIGCOMM[C], New York, USA, ACM Press, 2001:149?160.
[43] P2Psim: A Simulator for Peer-to-Peer (P2P) Protocols [EB/OL]. http://pdos.csail.mit.edu/p2psim, July 2007.
[44] F. Dabek, J. Li, E. Sit, J. Robertson, M. Kaashoek, R. Morris. Designing a DHT for Low Latency and High Throughput[A]. In: Proc. of the 1st Symposium on Networked System Design and Implementation(NSDI '04)[C], 2004: 85-98.
[45] The Kingdata Set[EB/OL]. http://pdos.csail.mit.edu/p2psim/kingdata.
[46] GT-ITM Homepage[EB/OL]. http://www.cc.gatech.edu/projects/gtitm/.
[47] Ian Clarke, Oskar Sandberg, Brandon Wiley, Theodore W. Hong. Freenet: A Distributed Anonymous Information Storage and Retrieval System[A]. In: International Workshop on Design Issues in Anonymity and Unobservability[C], Berkeley, CA, USA, 2000: 46-66.
[48]郑冬冬,余宏亮,郑纬民.基于分段的适应性流媒体缓存管理算法[J].清华大学学报(自然科学版), 2007, 47(7): 1204-1207.
[49] Mazen Kharbutli,Yan Solihin. Counter-Based Cache Replacement Algorithms[A]. In: Proceedings of the 2005 International Conference on Computer Design(ICCD2005)[C], IEEE Computer Society, Washington, DC, USA, 2005: 61– 68.
[50] Balamash A, Krunz M. An overview of web caching replacement algorithms[J]. IEEE Communications Surveys and Tutorials, 2004, 6(2): 44-56.
[51] Rizzo L, Vicisano L. Replacement Policies for a Proxy Cache[J]. IEEE/ACM Transactions on Networking, 2000, 8(2): 158-170.
[52] He Chen, Chen Zhaoxiong, Heyan H. Summary of web caching technology[J]. Mini-Micro Systems, 2004, 25(5): 836-842.
[53] E.J. O’Neil, O’Neil, G. Weikum. The LRU-K page replacement algorithm for database disk buffering[A]. In: Proceedings of ACM SIGMOD[C], NewYork, NY, USA, 1993, 22(2): 297-306.
[54] Podlipnig S, Boszormenyi L. A survey of web cache replacement stategies[J]. ACM Computing Surveys, 2003, 35 (4): 374-398.
[55] Carlos Cunha, Azer Bestavros, Mark Crovella. Characteristics of WWW client-based traces[R]. Technical Report TR-95-010, Boston University, CS Dept, Boston, MA 02215, April 1995.
[56] A. Das, J. Gehrke, M. Riedewald. Approximate join processing over data streams[A]. In: Proceedings of the ACM International Conference on Management of Data (SIGMOD)[C], San Diego, California, 2003: 40-51.
[57] Jin S, Bestavros A. Greedy dual* web caching algorithm: exploiting the two sources of temporal locality in Web request streams[J]. Computer Communications, 2001, 24(2): 174-183.
[58] Gabor Szabo, Bernardo A. Huberman, Predicting the popularity of online content [EB/OL]. http://www.hpl.hp.com/research/idl/papers/predictions/predictions.pdf.
[59]徐利治.现代数学手册-随机数学卷[M].湖北:华中科技大学出版社, 2000年12月, P776-820.
[60]李康宁,卢艳民,陈红.基于马尔可夫预测模型的数据流滑动窗口近似连接缓存管理策略[A].见:计算机研究与发展[C],卷43(增刊),第11期:130-136,第二十三届中国数据库学术会议, 2006.
[61]张磊,邱绍峰. 4G移动通信技术[J].通信技术, 2007, 11(40):193-195.
[62] Wong.V.W-S, Leung.V.C.M. Location management for next-generation personal communications networks[J]. Network, IEEE, 2000, 14:18-24.
[63]郭梯云,邬国扬,李建东.移动通信[M].西安:西安电子科技大学出版社, 2005, P27-55.
[64] N.Nasser, A.Hasswa, H.Hassanein. Handoffs in fourth generation heterogeneous networks[J]. IEEE Communications Magazine, 2006, 44(10):96-103.
[65] Y.B.Lin,A.C.Pang.Comparing soft and hard handoffs[J].IEEE Transactions on Vehicular Technology, 2000, 49(3):792-798.
[66] D.Tcha, S.Kang, G.Jin. Load analysis of the soft handoff scheme in a CDMA cellular system[J]. IEEE Selected Areas in Communications, 2001, 19(6):1147-1152.
[67] C.Lee, R.Steele. Effect of soft and softer handoffs on CDMA system capacity[J]. IEEE Transactions on Vehicular Technology, 1998, 47(3):830-841.
[68] R.Droms, Ed., J.Bound.Dynamic Host Configuration Protocol for IPv6(DHCPv6)[S]. IETF, RFC-3315, July 2003.
[69] R.Droms. Dynamic host configuration protocol[S]. IETF, RFC-2231, 1997.
[70] R.Droms, J.Bound, B.Volz, T.Lemon, C.Perkins, M.Carney. Dynamic host configuration protocol for IPv6(DHCPv6)[S]. IETF, RFC-3315, 2003.
[71] Kent S, R.Atkinson. IP Authentication Header(AH)[S]. IETF, RFC-2402, November 1998.
[72] Kent S, R.Atkinson. IP Encapsulating Security Payload(ESP)[S]. RFC-2406, November 1998.
[73] D.Johnson,C.Perkins,J.Arkko. Mobility support in IPv6[S]. IETF, RFC-3775, June 2004.
[74] J.Arkko,V.Devarapalli,F.Dupont.Using IPsec to Protect Mobile IPv6 Signaling Between Mobile Nodes and Home Agents[S].IETF, RFC-3776, June 2004
[75] E. Fogelstroem, A. Jonsson, Ericsson. Mobile IPv4 Regional Registration[S]. IETF, RFC-4587, 2007
[76] M. Chakrabarty, I. Saha Misra, D. Saha, A. Mukherjee. A Comparative Study of Existing Protocols Supporting IP Mobility[A]. In: Proceedings of International Conference of World Wireless Congress (WWC2003)[C], San Fransisco, USA, 2003.
[77] Campbell A.T, Gomez J, Kim S, Wan CY, Turanyi Z.R, Valko A.G. Comparison of IP micromobility protocols[J]. Wireless Communications, IEEE, 2002, 9(1): 72-82.
[78] C.Perkins, D.B.Johnson. Route optimisation in mobile IP[EB/OL]. Internet draft, http://tools.ietf.org/id/draft-ietf-mobileip-optim-09.txt, IETF, 2001.
[79] K.E1 Malki, H.Soliman. Fast Handoffs in Mobile IPv4[EB/OL]. Internet draft,http://tools.ietf.org/html/draft-elmalki-mobileip-fast-handoffs-03, IETF,2000.
[80] H.Soliman, C.Castelluccia, K.EI Malki, L. Bellier. Hierarchical Mobile IPv6 Mobility Management(HMIPv6)[S]. IETF, RFC-4140, August 2005.
[81] P.McCann. Mobile IPv6 Fast Handovers for 802.ll Networks[S]. IETF, RFC-4260, November 2005.
[82] C.Perkins, D.B.Johnson. Route Optimisation in Mobile IP[J]. Cluster Computing, 2004, 1(2): 161-176.
[83] R.Hsieh, Z.G.Zhou, A.Seneviratne. S-MIP:a seamless handoff architecture for mobile IP[A]. In: Twenty-Second Annua Joint Conference of the IEEE Computer and Communications Societies(INFOCOM 2003)[C], San Franeisco,USA, 2003:1774-1784.
[84] R.Koodli. Fast Handovers for Mobile IPv6[S]. IETF, RFC-4068, Jun 2005.
[85] H.Y.Jung, S.J.Koh, H.Soliman et al. Fast Handover for Hierarchical MIPv6(F-HMIPv6) [EB/OL].Internet draft, http://tools.ietf.org/html/draft-jung-mobopts-fhmipv6-00, IETF, June 2004.
[86] H.Soliman, C.Castelluccia, K.El Malki, L.Bellier. Hierarchical Mobile IPv6 Mobility Management(HMIPv6)[S]. IETF, RFC-4140, August 2005.
[87] H.Soliman, C.Castelluccia, K.E1-Malki et al. Hierarchical MIPv6 mobility management (HMIPv6)[S]. IETF, RFC-4140, June2003.
[88] W.C.Ma, Y.G.Fang. Dynamic hierarchical mobility management strategy for mobile IP networks[J]. IEEE Journal on Selected Areas in Communications, 2004, 22(4):664-676.
[89] Xavier Perez-Costa, Marc Torrent-Moreno, Hanners Hartenstein. A performance comparison of Mobile IPv6, Hierarchical Mobile IPv6, fast handovers for Mobbile IPv6 and their combination[A]. In: ACM SIGMOBILE Mobile Computing and Communications Review[C], October 2003, 7(4): 5-19.
[90] J.Zhang, D.A.J.Pearce. Proactive care-of adddress test for route optimization in FMIPv6[A]. In: Proceddings of the 3rd ACM international workshop on Wireless mobile applications and services on WLAN hotspots(WMASH‘05)[C], Cologne, Germany, 2005:92-95.
[91] Toni Janevsky.Traffic Analysis and Design of Wireless IP Networks[M].Artech House, Inc., Norwood, MA, USA, 2003
[92] D.B.Johnson, C.Perkins, J.Arkko. Mobility support in IPv6[S]. IETF, RFC-3775, 2004.
[93] T.Narten, E.Nordmark, W.Simpson. Neighbor discovery for IP version 6(IPv6)[S]. IETF, RFC-2461,1998.
[94] M.Liebsch et.al. Candidate Aecess Router Discovery(CARD)[S], IETF, RFC-4066, July 2005.
[95] UC Berkeley. The Network Simulator: Building Ns [EB/OL]. http://www.isi.edu/nsnam/ns/ns-build.html.
[96] National Institute of Standards and Technology(NIST). mobility package for NS-2 [EB/OL].http://www.antd.nist.gov/seamlessandsecure/pubtool.shtml#tools.