论文部分内容阅读
在当前几种常见的路由重建算法基础上,提出了一种基于k跳回溯机制的服务切换路由重建算法.根据移动终端的移动速度和网络的实际带宽情况动态选择位置更新信息的逆向回溯跳数k.本算法在位置更新信息的回溯过程中,寻找k跳范围内最优的路由重建公共点,使得呼叫节点经过该节点到达移动终端目标用户站的通信路由能够得到优化.同时,本算法要求接收到位置更新信息的中间节点以其到达目标用户站的最优通信路由转发接收到的数据包,降低服务切换过程中的数据包转发代价,使正在进行的网络服务能够在原用户站和目标用户站之间平滑地切换.
Based on several common routing rebuilding algorithms, this paper proposes a service handover routing rebuilding algorithm based on k-hop backtracking mechanism.According to the moving speed of mobile terminal and the actual network bandwidth, k. In the backtracking of location update information, this algorithm looks for the best route to reconstruct the common point in the k-hop range so that the communication route from the calling node to the destination user station of the mobile terminal can be optimized. At the same time, this algorithm requires The intermediate node that receives the location update message forwards the received data packet with the optimal communication route to the target subscriber station and reduces the data packet forwarding cost during the service switching so that the ongoing network service can provide the original subscriber station and the target subscriber Switch smoothly between stations.