PCS网络位置管理方案性能分析  

Performance analysis of location management scheme for PCS networks

作　　者：尚长兴[1] 崔平非[2] 俞定玖[1] 季新生[1] 

机构地区：[1]国家数字交换系统工程技术研究中心,河南郑州450002 [2]信息工程大学信息工程学院,河南郑州450002

出　　处：《计算机工程与设计》2006年第2期190-194,共5页Computer Engineering and Design

基　　金：国家863高技术研究发展基金项目(MII-C3G-02-20/863-317-03-01-02-20)

摘　　要：PCS(Personal Communication Service)网络中位置管理开销昂贵;为减小开销,研究人员提出了许多种方案。研究了基于LRA(Lazy Replication Algorithm)的位置管理方案,建立了分析模型,以相邻两次呼叫期间实现位置管理所花费的开销为指标,对IS-41和LRA两者的性能进行了比较。研究表明,对于高移动性或远离归属地的用户,LRA显著优于IS-41;另一方面,对于呼叫多发生于两个服务区间或低移动性的用户I,S-41优于LRA;从总体上看,LRA性能优于IS-41。Location management costs in apersonal communication services network are expensive; many schemes have been proposed to reduce the costs. A new location management scheme was studied, which was based on the lazy replication algorithm （LRA）. An analytical model was proposed to compare performance of LRA with performance oflS-41 protocol, using the location management cost between two successive calls. Study indicates that when mobile user has a high mobility or user moves far away from its home location, LRA could significantly outperform IS-41. On the other hand, for the user （caller or callee） whose counterpart is more likely in a different service area or a low mobility user, IS-41 is the winner. All in all, LRA is better than IS-41 in performance.

关 键 词：位置管理 个人通信服务 性能分析 呼叫移动比 懒惰复制算法 

分 类 号：TN915[电子电信—通信与信息系统]