基于快速DAD的分层移动IPv6切换算法

针对分层移动IPv6(HMIPv6)在重复地址检测(DAD)环节耗时严重的问题,提出一种基于快速DAD的HMIPv6切换算法.该算法通过引入IP地址分配管理(IAAM)模块建立DAD查表和地址主动生成机制,可大大加快DAD进程,且实现简单.仿真结果表明,经过算法优化后的HMIPv6(F-DAD-HMIPv6)可使域内切换延迟减少到202ms,域间切换延迟减少到339ms,优于MIPv6和HMIPv6.     

一种新的基于移动IPv6的快速切换方案

基本的移动IPv6（MIPv6）切换延迟非常大,不能满足实时业务的要求。本文基于对MIPv6的切换时延的分析,提出了一种IEEE802．11无线局域网环境下MIPv6的低时延切换方法,该方法通过结合使用连接触发器和快速路由器公告,并通过IP地址与MAC地址的映射机制来优化切换过程。仿真结果表明,该方法能够有效降低节点切换过程的时延,同时其性能优于以往相关的工作。     

基于无线局域网的移动IPv6链路层切换

随着实时业务(如VOIP)的快速发展,移动IPv6技术的切换过程时延已经不能满足现代通信的需求,因此改进切换时延,提高切换质量很有必要.本文介绍了当一个移动节点(MN)尝试进行基于无线局域网的MIPv6链路层的切换时,利用邻居图算法或邻居缓存机制来减少扫描延迟,从而减少总切换延迟.     

WLAN的移动IPv6快速切换研究

移 动 IPv6 标准切换包括移动 节点的二层切换、路由发 现、重复地址检测(DAD)、家 乡代理绑定更新(BU)、通信节 点绑定更新这几个环节,在此期 间移动节点不能收发应用的 IP 分 组。在无线链路质量不佳,或者 家乡代理与移动节点距离遥远等 情况下,标准切换过程引起的分 组传输延时和分组丢失无法满足 实时业务的要求。 移动 IPv6 的快速移动切换 研究是当前的一个热点,IETF 对 此提出了移动 IPv6 快速移动切换(FMIPv6)草案。FMIPv6 利用移 动节点或网络的二层链路信息, 对移动切换事件进行预测或快速 响应,通…     

一种减少移动IPv6切换延时的新方法

切换问题是移动计算环境中最基本的问题。理想的切换是指同时具备快速切换和平滑切换能力的无缝切换;快速切换就是要求系统具有最小的切换时延,平滑切换则要求系统具备最低的丢包率。现提出一种基于组播的平滑切换框架模型,该模型的基本思想是让移动节点本身携带途经的接入路由器绑定更新队列,每当移动节点到达一个新的链路并获得该链路的转交地址,就向家乡代理和队列成员进行组播。该模型有效地减少了数据包的丢失率,减少了延时,并与现有的快速切换/IPv6路由优化技术能很好地结合起来。     

移动IPv6切换技术的研究

切换技术是移动IPv6技术的关键技术之一,其优劣在很大程度上决定了MN在移动通信过程中的通信质量。本文介绍了移动IPv6的工作原理,阐述了移动IPv6切换的关键技术,以及三种切换的实现方式。     

一种移动IPv6的切换优化方案

移动节点在两个不同子网之间移动时产生切换。移动节点的切换技术是保证实时业务服务质量的关键问题之一。目前比较经典的三种切换机制是快速移动IPv6、层次型移动IPv6和快速层次移动IPv6。在简单介绍了三种机制原理并分析了它们的不足后,提出了一种自适应移动IPv6切换时延优化方案。     

快速层次移动IPv6的乒乓切换研究

针对现有的预测式FMIPv6(快速移动IPv6)没有提供域内乒乓切换机制,因而可能导致大量远程注册开销和系统通信开销的问题,在FMIPv6的基础上引入HMIPv6(分层移动IPv6)层次结构,提出了一种基于FHMIPv6(快速层次移动IPv6)的乒乓切换优化方案。分析结果表明,与FHMIPv6相比,所提方案在乒乓切换模式下能够有效减少时延和丢包率,进一步提高吞吐量。     

基于流的移动IPv6快速切换方法

文章介绍了一种基于流的移动IPv6快速切换方法．即路由器利用IPv6的业务流的信息把各个业务流重定向到移动节点的新转交地址上．这种重定向的方式是在MN绑定更新注册的过程中进行的．使得移动节点在向家乡代理的注册还未完成之前．便能与通信对端进行正常通信，这样大大减少了切换时延．提高了切换效率．另外．本文通过理论分析．将此方法与常规的移动IPv6和分层移动IPv6机制进行了比较．并利用NS-2网络模拟器的仿真数椐对在此方法下不同类型的业务流的传输进行了分析，验证其具有较为良好的性能。     

基于IPv6的快速切换改进方案

在移动IP网络中,当前的移动性管理方案由于其基本协议的切换时延较大、丢包率较高而不能适应实时业务和移动通信的要求,所以需要改善移动性管理策略的切换性能,尽量实现无缝切换和零丢包率。提出了一种基于移动IPv6的快速切换的改进方案,采用一种新的地址分配方式使得移动节点能够在移动至新的网络后迅速获取新的转交地址,有效地减少了切换所产生的时延和丢包率,具有较好的切换性能。     

A Scheme for Supporting Fast Handover in Hierarchical Mobile IPv6 Networks

This Letter proposes a scheme that supports a fast handover effectively in hierarchical mobile IPv6 networks (F‐HMIPv6) by optimizing the associated data and control flows during the handover. By NS‐2 simulation, we show that the proposed scheme can give better handover performance than a simple combination of existing schemes.     

基于特征投影的移动IPv6快速切换方法

研究了移动IPv6协议中的越区切换问题,提出了一种基于特征投影的移动IPv6快速切换方法。该方法通过构造先验切换经验与小区覆盖范围的映射关系来协助移动接入网关对切换目的地进行预测。仿真结果表明,文中方法能够获得比FPMIPv6更小的切换延迟,并具有较好的鲁棒性。     

移动IPv6切换时延优化新方法

移动IPv6中,移动节点(MN)在不同子网间移动时,既不中断与通信对端(CN)的通信,也不用改变其本身的IP地址.但是当MN与其家乡代理(HA)之间相距较远时,移动IPv6切换时延较大,对于实时性要求较高的业务无法适用.本文分析比较了目前移动IPv6常用的切换时延优化方法,提出了一种自适应快速层次移动IPv6切换时延优化方法,减小了移动IPv6切换时延,提高了网络的性能.     

A New Enhanced Fast Handover Algorithm in Hierarchical Mobile IPv6 Network

1　Introduction　MobileIPv6requirestheMobileNode (MN)toregisterwiththeHomeAgent (HA)andtheCorre spondentNode (CN)whenitchangesitspointofattachmentintheInternet[1～ 3] .Therefore ,thiscauseMobileIPv6toincurlongdelayintheregis tration process,andaddsignalingtraffictothebackbonenetworkespeciallywhentheHAandCNarefarawayfromtheMN .Inordertominimizethisdelay ,andthesignalingoverhead presentinMobileIPv6,literatures[4～7] proposeHierarchicalMobileIPv6(HMIPv6)architectureandafasthan dover…     

层次移动IPv6的增强切换方案

随着互联网技术与移动通信技术飞速发展,移动IPv6技术已经成为下一代移动互联网的研究热点。切换技术是影响移动互联网实时运行质量的重要技术之一。低延迟、低丢包的无缝切换方案对移动IPv6的性能至关重要。层次移动IPv6(HMIPv6)利用移动锚点(MAP)降低了延迟和数据丢失。然而,只有移动节点在同一MAP域的网络上进行切换时,HMIPv6才能有效减少延迟。当移动节点在不同MAP域的网络移动时,其切换性能并不优于标准移动IPv6。文章针对层次移动IPv6提出了一种增强切换方案(EHMIPv6),该方案在HMIPv6的基础上实现并行重复地址检测(PDAD),以减少不同区域网络间切换的延迟。分析表明,该方案比HMIPv6具有更好的性能。     

基于重叠网络的移动IPv6快速切换

基本的移动IPv6切换延迟太大，不能满足实时业务的要求。本文提出了一种基于重叠网络的移动IPv6快速切换算法，这种算法通过在两个不同的IPv6子网间设置重叠网络来实现IP层的无缝(零延迟)切换。文中给出了算法实现的网络结构及其切换过程，并且对其性能进行了分析。算法实现了移动IPv6快速切换，在大部分情况下都可以达到最佳性能。     

Link Synchronous Mobile IPv4 Handover Algorithms

The performance of the base Mobile IP handover algorithm for moving the Mobile Node’s network layer point of attachment from one subnet to another has been recognized as a potential performance bottleneck for some time. In this paper, we discuss a collection of algorithms that use a link synchronous approach to Mobile IP handover. In the link synchronous approach, information on the progress of switching the link is used to drive handover at the IP level. We present a comprehensive analysis of handover packet drop, and develop analytical models of how the link synchronous algorithms help to mitigate it. We use data from a handover emulator to test the analytical models, and to compare the performance of the different algorithms under a variety of link conditions. Data from implementations on IS-2000 and 802.11b show how the link synchronous algorithms behave on real radio protocols. The results indicate that the link synchronous algorithms can reduce packet loss substantially, with best results possible if the link layer provides information on the move prior to the link switch. James Kempf is a Research Fellow at DoCoMo USA Laboratories. He holds a Ph.D. from the University of Arizona, Tucson, AZ. Previously, James worked at Sun Microsystems for 13 years, and contributed to numerous research projects involving wireless networking, mobile computing, and service discovery. James is a former member of the Internet Architecture Board, and co-chaired the SEND and Seamoby IETF Working Groups. James continues to be an active contributor to Internet standards in the areas of security and mobility for next generation, Internet protocol-based mobile systems. Ajoy Singh is a Principal Staff Engineer at Motorola GTSS Division where he has led the development of radio network controllers and the various components of core networks for 3GPP-based HSDPA and 3GPP2-based CDMA prototype systems. He holds a Master’s degree from DePaul University, Chicago, IL. Ajoy is the co-developer of several pending patents on cellular radio technology, and has contributed to the standardization of seamless mobility protocols through the Seamoby and Mobile IP IETF Working Groups and through IEEE 802.21. Jonathan Wood is an independent contractor and has been working with DoCoMo Labs since 2001. He is currently contributing to research on next generation mobility and networking infrastructures. Previously at Sun Microsystems, Jonathan focused on Solaris networking and 4G wireless network research. Atsushi Takeshita is a Director at the NTT DoCoMo Multimedia Laboratories in Yokoska Research Park, Japan. Prior to that, he was Director of the Autonomous Communication Laboratory in DoCoMo USA Laboratories, and one of the founding members of DoCoMo USA Laboratories. Atsushi joined NTT DoCoMo in 1988 and has since been engaged in the research and development of multimedia information retreival and delivery, the mobile Internet, and mobile terminal architectures. He is a member of the Association for Computing Machinery (ACM) and Information Processing Society of Japan. Nat Natarajan joined Motorola in 1993, and is a Fellow of the Technical Staff at Motorola. He received his Ph.D. from Ohio State University in Columbus, OH. Prior to working at Motorola, Nat served as a research staff member for over 12 years with IBM Thomas J. Watson Research Center, Yorktown Heights, NY, working primarily on packet switched data, voice and integrated networks as well as wireless data and satellite networks, and he has been a major contributor to the IEEE 802.11 standard approved in 1997. Nat is a Motorola Distinguished Innovator, holding 30 patents, and is a Senior Member of IEEE. Nat’s current technical interests are Beyond 3G/4G mobile networking systems based on IP technologies.     

Analysis of Fast Handover Mechanisms for Hierarchical Mobile IPv6 Network Mobility

When a mobile network dynamically changes its point of attachment to the Internet, the various types of movements by a mobile router require handovers, and network mobility (NEMO) is concerned with the management of this movement of mobile networks. Accordingly, this paper investigates the mobile router movement patterns in NEMO network environments, and defines fast hierarchical NEMO handover scenarios based on classified movement patterns. Due to unexpected link breakdowns during the handover procedure, the NEMO handover requires additional latency and packet delivery costs depending on when the breaks occur. For the various handover failure cases, it is also essential to analyze these overhead costs to evaluate and compare the performance of a fast handover. In this paper, the overheads associated with a NEMO fast handover include the latency, buffering cost, and packet loss cost, all of which are formulated based on a timing diagram.

Fast Handover Mechanism for Seamless Multicasting Services in Mobile IPv6 Wireless Networks

This paper proposes a fast handover mechanism to provide a seamless multicast service for Mobile IPv6 hosts. With the proposed Fast handover based on a Mobile IP-Multi casting (FMIP-M) protocol, the selection of a new multicast service method, service preparation, and initialization procedures are all performed during the fast handover period, thereby enabling a reliable and efficient multicast service. When mobile hosts move to other networks, they can encounter data loss, out-of-synch problems for multicast data, and multicast service exchange latency. Therefore, the proposed FMIP-M allows the new access router to select a suitable multicast service method according to the multicast service-related network conditions and supports a reliable multicast transmission by compensating for data losses from the previous access router. An analysis is conducted of the overheads associated with a fast multicast handover, including the signaling cost and multicast packet-forwarding cost, where the costs are formulated based on timing diagrams, and compared with a fast handover using Mobile IPv6. The performance analysis and numerical results confirm that the proposed FMIP-M provides a fast multicast handover and reliable service with a relatively small signaling cost and packet-delivery cost.