3G中增强的3层动态位置管理建模与分析

基于3G网络中由HLR(home location register)、GLR(gateway location register)、VLR(visitor location register)构成的3层数据库结构,提出了基于移动的增强动态位置管理策略,重点分析了该策略下位置更新和寻呼的代价模型。并使用该代价模型对3G网络中基于移动的增强动态位置管理策略、基于移动的基本动态位置管理策略和静态位置管理策略进行了评价,计算结果显示增强动态位置管理策略要优于基于移动的基本位置管理策略和静态位置管理策略。     

移动网络前向指针策略的鉴权管理研究

鉴权管理是移动通信移动管理中非常重要的技术,其策略的选择将直接影响网络中各网元的信令负荷。本文主要讨论移动通信系统前向指针位置管理策略中的鉴权管理。当用户在远离其HLR的不同VLR对应覆盖区域移动时,系统通过向其原VLR索取剩余鉴权数据或向其HLR申请新鉴权数据来实现用户的鉴权管理。通过鉴权开销及被呼处理时延等指标的分析,本文提出的鉴权管理算法较适合于CMR较小的MS鉴权管理;当MS的CMR增大时,本文提出的鉴权管理算法与二层管理策略如GSM或IS-41移动系统的开销及时延等指标逐渐接近。     

一种基于前向指针的移动性管理策略

R.Jain在移动通信中利用前向指针技术减少对HLR的访问和系统代价．本文建立的理论模型对这种方法的性能进行了分析，呼叫移动比高时使用指针策略反而会增加系统开销．针对这个问题．本文提出一种自适应方法，仿真结果表明该方法随着呼叫移动比变化可自动调整到最佳的最大指针链长度，并能在呼叫移动比高时自动停止使用指针策略．     

一种基于前向提针的移动性管理策略

Ｒ．Ｊａｉｎ在移动通信中利用前向指针技术减少对ＨＬＲ的访问和系统代价。本文建立的理论模型对这种方法的性能进行了分析图，呼叫移动比高时使用指针策略反而会增加系统开销。针对这个问题。本文提出一种自适应方法，仿真结果表明该方法随着呼叫移动比变化可自动调整到最佳的最大指针链长度，并能在呼叫移动比高时自动停止使用指针策略．     

LEO卫星系统星上VLR数据库管理方案

在低轨(LEO)卫星通信系统中,航行在国外的特殊终端位置更新时需查询国内地面站访问位置寄存器(VLR),导致了长距离的信令开销.为此,提出一种星上VLR数据库管理方案,使移动终端能通过查询星上VLR进行位置更新操作.将该方案运用于具体低轨卫星系统进行仿真.结果表明,该方案能优化系统的位置管理性能.     

指针推进移动性管理策略中指针链长度的概率

为了降低移动通信网络中位置跟踪操作的代价,指针推进策略被提出.显然,指针链长度的确定对这一策略的有效应用是至为重要的.已有论文假定移动台在位置区的逗留时间服从指数分布的条件下,对指针链的长度进行研究,但指数分布的特殊性,限制了其研究结果的应用.本文推广了上述结果,研究了移动台在位置区的逗留时间服从一般概率分布的指针推进策略,通过构造向量马氏过程,利用密度演化方法,导出了指针链长度的概率公式,这个公式可用于对各种指针推进策略性能的评价.     

3G认证和密钥分配协议的形式化分析及改进

介绍了第三代移动通信系统所采用的认证和密钥分配(AKA)协议,网络归属位置寄存器/访问位置寄存器(HLR/VLR)对用户UE(用户设备)的认证过程和用户UE对网络HLR/VLR的认证过程分别采用了两种不同的认证方式,前者采用基于"询问-应答"式的认证过程,后者采用基于"知识证明"式的认证过程.使用BAN形式化逻辑分析方法分别对这两种认证过程进行了分析,指出在假定HLR与VLR之间系统安全的前提下,基于"知识证明"式的认证过程仍然存在安全漏洞.3GPP采取基于顺序号的补充措施;同时,文中指出了另一种改进方案.     

基于联合备份的服务功能链可靠性保障的部署方法

在网络功能虚拟化(NFV)环境中,针对服务功能链(SFC)部署时的可靠性问题,该文提出对备份虚拟网络功能选择、备份实例放置和服务功能链部署的联合优化方法。首先,定义一个单位开销可靠性提高值的虚拟网络功能衡量标准,改进备份虚拟网络功能选择方法;其次,采用联合备份的方式调整相邻备份实例之间的放置策略,以降低带宽资源开销;最后,将整个服务功能链可靠性保障的部署问题构建成整数线性规划模型,并提出一种基于最短路径的启发式算法,克服整数线性规划求解的复杂性。仿真结果表明,该方法在优先满足网络服务可靠性需求的同时,优化资源配置,提高了请求接受率。     

TD—HSDPA中联合检测因子的新型检测方法以及映射方法

介绍了在TD-SCDMA快速下行分组接入技术(TD-HSDPA)系统中链路级仿真与系统级仿真之间的映射方法,主要探讨了联合检测增益在链路级获取和系统级应用的两个方面.重点阐述了如何根据链路级仿真得到联合检测的干扰消除因子的统计特性,并将其映射到系统级仿真的SINR模型中的策略.对比于传统仿真方法论中所采用的固定干扰消除因子的策略,文章所设计的映射策略具有更高的准确性和可靠性,并能够更好地适应实时的信道环境.     

基于深度信念网络资源需求预测的虚拟网络功能动态迁移算法

针对5G网络场景下缺乏对资源需求的有效预测而导致的虚拟网络功能(VNF)实时性迁移问题,该文提出一种基于深度信念网络资源需求预测的VNF动态迁移算法。该算法首先建立综合带宽开销和迁移代价的系统总开销模型,然后设计基于在线学习的深度信念网络预测算法预测未来时刻的资源需求情况,在此基础上采用自适应学习率并引入多任务学习模式优化预测模型,最后根据预测结果以及对网络拓扑和资源的感知,以尽可能地减少系统开销为目标,通过基于择优选择的贪婪算法将VNF迁移到满足资源阈值约束的底层节点上,并提出基于禁忌搜索的迁移机制进一步优化迁移策略。仿真表明,该预测模型能够获得很好的预测效果,自适应学习率加快了训练网络的收敛速度,与迁移算法结合在一起的方式有效地降低了迁移过程中的系统开销和服务级别协议(SLA)违例次数,提高了网络服务的性能。     

Location tracking with distributed HLR's and pointer forwarding

Location tracking operations in a personal communications service (PCS) network are expensive. A location tracking algorithm called pointer forwarding has been proposed to reduce the location update cost. The key observation behind forwarding is that if users change PCS registration areas (RAs) frequently, but receive calls relatively infrequently, it should be possible to avoid registrations at the home-location register (HLR) database by simply setting up a forwarding pointer from the previous visitor-location register (VLR). Calls to a given user will first query the user's HLR to determine the first VLR, which the user was registered at, and then follow a chain of forwarding pointers to the user's current VLR. To reduce the “find” cost in call delivery, the PCS provider may distribute HLR databases in the network. This paper integrates the concept of distributed HLRs with pointer forwarding, and the new scheme is referred to as the pointer forwarding with distributed HLR (PFDHLR). Since no registration to the HLR is performed in the pointer forwarding scheme when a user moves to the new locations, the cost of updating multiple HLRs is eliminated in PFDHLR. Our study indicates that PFDHLR may significantly reduce the mobility management cost compared with the single HLR approach     

Two-level pointer forwarding strategy for location management in PCS networks

For a IPCS network to effectively deliver services to its mobile users, it must have an efficient way to keep track of the mobile users. The location management fulfills this task through location registration and paging. To reduce the signaling traffic, many schemes such as a local anchor (LA) scheme, per-user caching scheme and pointer forwarding scheme have been proposed in the past. In this paper, we present a new location management scheme which intends to mitigate the signaling traffic as well as reduce the tracking delay in the PCS systems. In this strategy, we choose a set of visitor location registers (VLRs) traversed by users as the mobility agents (MA), which form another level of management in order to make some registration signaling traffic localized. The idea is as follows: instead of always updating to the home location register (HLR), which would become the bottleneck otherwise, many location updates are carried out in the mobility agents. Thus, the two-level pointer forwarding scheme is designed to reduce the signaling traffic: pointers can be set up between VLRs as the traditional pointer forwarding scheme and can also be set up between MAs. The numerical results show that this strategy can significantly reduce the network signaling traffic for users with low CMR without increasing much of the call setup delay.     

One-step pointer forwarding strategy for location tracking indistributed HLR environment

One of the main challenges in personal communication service (PCS) is to locate many mobiles that may move frequently from place to place. Such a system operation is called location tracking. Many network signals flow, and database queries are required to achieve such a task. In addition to the two-level hierarchical strategy in IS-41 and GSM, several strategies have been proposed to improve the efficiency of location tracking. Pointer forwarding was used to reduce the expensive home location register (HLR) accesses. Previously, the distributed HLR scheme was proposed to prevent the HLR from becoming a bottleneck in the signaling network. However, the length of a forwarding pointer chain may be lengthened in a distributed HLR environment. We propose a more efficient strategy to overcome this potential problem. This strategy attempts to migrate the locating chains in a distributed HLR system when a mobile issues a registration operation. As a consequence, the length of any forwarding pointer chain does not exceed one in our strategy. Simulation results indicate that our strategy significantly decreases the locating cost. In fact, this strategy provides an upper bound of location tracking time owing to the fact that the length of any locating path does not exceed one. Furthermore, obsolete entries in local databases visitor location registers can be reclaimed in this strategy     

An auxiliary user location strategy employing forwarding pointers to reduce network impacts of PCS

We propose an auxiliary strategy, calledper-user forwarding, for locating users who move from place to place while using Personal Communications Services (PCS). The forwarding strategy augments the basic location strategy proposed in existing standards such as GSM and IS-41, with the objective of reducing network signalling and database loads in exchange for increased CPU processing and memory costs. The key observation behind forwarding is that if users change PCS registration areas frequently but receive calls relatively infrequently, it should be possible to avoid registrations at the Home Location Register (HLR) database, by simply setting up a forwarding pointer from the previous Visitor Location Register (VLR). Calls to a given user will first query the user's HLR to determine the first VLR which the user was registered at, and then follow a chain of forwarding pointers to the user's current VLR. We use a reference PCS architecture and the notion of a user'scall-to-mobility ratio (CMR) to quantify the costs and benefits of using forwarding and classes of users for whom it would be beneficial. We show that under a variety of assumptions forwarding is likely to yield significant net benefits in terms of reduced signalling network traffic and database loads for certain classes of users. For instance, under certain cost assumptions, for users withCMR<0.5, forwarding can result in 20–60% savins over the basic strategy. This net benefit is due to the significant saving in location update compared to a penalty of moderately increased call setup times for the infrequent occasions when these users do receive calls.     

基于前转指针的平滑主动位置恢复方案

提出了一种基于前转指针的平滑主动位置恢复方案,以位置数据库的处理能力和有线信令消耗,换取无线资源的节省。无需终端的周期性位置更新操作,即可使移动通信系统获得对位置数据库的容错能力。同时,在故障期内采用前转位置指针,使移动用户感知不到HLR故障的存在,具有持续的出呼叫能力。     

Location Management in PCS Networks by Caching Two-Level Forwarding-Pointers

One of the challenging tasks in Personal Communication Services (PCS) is to efficiently maintain the location of PCS subscribers who move from one region to another (hereafter called mobile users). When a mobile user receives a call, the network has to quickly determine its current location. The existing location management scheme suffers from high signaling traffic in locating the mobile users. Two-level forwarding pointer scheme has been proposed from per-user forwarding pointer scheme to reduce the cost of signaling traffic. In this paper, we enhance the two-level forwarding pointer scheme. When a mobile user moves from its current Registered Area (RA), which is served by Mobile Switching Center (MSC), to another RA the local switch that acts as a parent of those two MSCs maintains this movement in its memory (hereafter called cache entry). A cache entry is used to locate rapidly the mobile user instead of querying the Home Location Register (HLR) and waiting for its reply. HLR is centralized in the network and far away from the mobile users so that the signaling traffic crossing it is expensive. Sometimes the cache entry may be failed to reach the mobile user then a two-level forwarding pointers will be created from the corresponding Visitor Location Register (VLR), attached to its MSC, through a correct path to locate the mobile user. Thus, there is a saving in cost of querying the underlying HLR. The analytical results indicate that such proposal efficiently reduces the signaling traffic cost for all values of Call to Mobility Ratio (CMR), this is especially considerable when CMR ≥1, without any increase in the call setup delay. Salah M. Ramadan (samohra@yahoo.com) received the BS and MS degrees from Computers Engineering Department, Al-Azhar University, Cairo, Egypt, in 1995 and 2002, respectively. From 2002, he was a Ph.D. student in Computers Engineering Department at Al-Azhar University and is currently pursuing the Ph.D. degree, where he is a research assistant in the Wireless Networks Branch. His research interests include traffic management in ATM networks, routing protocols, mobility management in PCS networks, and mobile computing. He is currently an instructor in Cisco Academy, Egypt. Ahmed M. El-Sherbini (Sherbini@mcit.gov.eg) received the Ph.D. in Electrical and Communication Engineering, Case Western University, U.S.A. March 1983 and M.Sc. in Communication Engineering, Cairo University, Giza, Egypt, June 1980. (M. Sc. Research Studies at the Ecole Nationale Superieure des Telecommunications (ENST), Paris, France). He is the Director, National Telecommunication Institute – Ministry of Communications and Information Technology, Egypt and Professor of Electrical and Communication Engineering Dept. Faculty of Engineering, Cairo University, Egypt. M. I. Marie received his B.Sc., M.Sc. and Ph.D. in electronic and communication engineering from Cairo University on 1972, 1981, 1985, respectively. Now he is a professor of communications at Computer and System Engineering department Al-Azhar University, Cairo, Egypt. His fields of interest includes digital communication, computer networks and protocols development. M. Zaki (azhar@mailer.scu.eun.eg) is the professor of software engineering, Computer and System Engineering Department, Faculty of Engineering, Al-Azhar University at Cairo. He received his B.Sc. and M.Sc. degrees in electrical engineering from Cairo University in 1968 and 1973 respectively. He received his Ph.D. degrees in computer engineering from Warsaw Technical University, Poland in 1977. His fields of interest include artificial intelligence, soft computing, and distributed system.     

带门槛的环形搜索移动性管理策略中移动台所 越过的位置区环数

位置管理或移动性管理是移动计算研究领域的一个具有挑战性的问题.我国及其他国家目前正在使用的个人通信网络如GSM、IS-41中,用两层数据库HLR/VLR支持位置管理.在这些网络中,每当移动台从一个位置区LA(Location area)移动到另一个位置区,其基本的位置管理策略(简称"基本策略")不管是否必要均立即进行位置更新操作,因而造成系统资源的极大浪费,降低了系统的性能.本文给出一种带门槛的环形搜索策略(简称"门槛环形策略")——将位置区分成环,设定一个门槛(整数),当移动台越过的位置区的环数没有达到门槛时,系统不进行位置更新操作,以减少位置管理的费用.在假定移动台的呼入是一个泊松过程,移动台在各个位置区的逗留时间是符合一般概率分布的随机变量的条件下,推导出在两次呼入之间移动台处于各位置区环的概率及移动台所越过的位置区环数公式,给出了"门槛环形策略"的位置管理费用小于"基本策略"的条件.     

Determination of the Registration Point for Location Update by Dynamic Programming in PCS

Location management is important to effectively keep track of mobile terminals with reduced signal flows and database queries. Even though dynamic location management strategies are known to show good performance, we in this paper consider the static location management strategy which is easy to implement. A system with single home location register and pointer forwarding is assumed. A mobile terminal is assumed to have memory to store the IDs of visitor location registers (VLRs) each of which has the forwarding pointer to identify its current location. To obtain the registration point which minimizes the database access and signaling cost from the current time to the time of power-off probabilistic dynamic programming formulation is presented. A Selective Pointer Forwarding scheme is proposed which is based on one-step dynamic programming. The proposed location update scheme determines the least cost temporary VLR which point forwards the latest location of the mobile. The computational results show that the proposed scheme outperforms IS-41, pure Pointer Forwarding, and One-step Pointer Forwarding at the expense of small storage and a few computations at the mobile terminals.     

Improving the fault tolerance of GSM networks

A PCS network constantly tracks the locations of the mobile stations so that incoming calls can be delivered to the target mobile stations. In general, a two-level database system is used to store location information of the mobile stations. When the location databases fail, incoming calls may be lost. This article describes the standard GSM database failure restoration procedure which reduces the number of lost calls. Then we propose an efficient visitor location register (VLR) identification algorithm for the home location register (HLR) failure recovery procedure, which utilizes mobile station movement information to speed up the recovery procedure