基于k跳回溯机制的服务切换路由重建算法  

k-Hop Backtracking Based Rerouting Algorithm for Handoff Processing

作　　者：杜文峰[1] 贾维嘉[1] 王国军[1] 陆文彦[1] 

机构地区：[1]中南大学信息科学与工程学院,湖南长沙410083

出　　处：《小型微型计算机系统》2006年第10期1850-1855,共6页Journal of Chinese Computer Systems

基　　金：国家科技部"九七三"项目(2003CB317003)资助;香港城市大学战略发展计划项目(7001709;7001587)资助.

摘　　要：在当前几种常见的路由重建算法基础上,提出了一种基于k跳回溯机制的服务切换路由重建算法.根据移动终端的移动速度和网络的实际带宽情况动态选择位置更新信息的逆向回溯跳数k.本算法在位置更新信息的回溯过程中,寻找k跳范围内最优的路由重建公共点,使得呼叫节点经过该节点到达移动终端目标用户站的通信路由能够得到优化.同时,本算法要求接收到位置更新信息的中间节点以其到达目标用户站的最优通信路由转发接收到的数据包,降低服务切换过程中的数据包转发代价,使正在进行的网络服务能够在原用户站和目标用户站之间平滑地切换.This paper proposes a rerouting scheme for handoff processing based on k-hop backtracking mechanism, The proposed scheme dynamically chooses the number of backtracking hops, κ, according to the velocity of wireless devices and the current bandwidth of the network, During the backtracking of Location Update, the proposed scheme finds out the optimal common node in the link of original Subscriber Station and destination Subscriber Station, through which the new route from the Correspond node to mobile node can achieve the optimal route cost in k-hop backtracking range, Meanwhile, all intermediate nodes, on receiving Location Update, will forward packets to the destination Subscriber Station with its optimal route, which greatly reduces the cost of packets forwarding,

关 键 词：服务切换 路由重建 无线网络 回溯 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]