Local anchor scheme for reducing signaling costs in personalcommunications networks

A personal communications network (PCN) location tracking scheme called local anchoring is introduced which reduces the signalling cost as compared to the location management strategy proposed in the IS-41 standard. Local anchoring reduces the number of location registration messages between the home location register (HLR) and the visitor location registers (VLRs) in a way that location change is reported to a nearby VLR called the local anchor (LA) instead of to the HLR. This method successfully reduces the cost for location tracking when the call arrival rate is low relative to the mobility rate and the cost for location registration is high. A dynamic local anchoring mechanism is then introduced which dynamically selects the LA such that the expected cost for location registration and call delivery can be further reduced. It is demonstrated that the cost of dynamic local anchoring is always lower than or equal to that of the IS-41 scheme     

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     

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

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

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

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

Research on HLR mobility database failure recovery and performance analysis for CDMA2000 systems

In this paper, a novel Home Location Register(HLR) mobility database recovery scheme is proposed. With database backing-up and signal sending as its key processes, the presented scheme is designed for the purpose of both decreasing system costs and reducing number of lost calls. In our scheme, an algorithm is developed for an HLR to identify such VLRs that there are new MSs roaming into them since the latest HLR database backing up. The identification of those VLRs is used by the HLR to send Unreliable Roaming Data Directive messages to each of them to get the correct location information of those new MSs.Additionally, two kinds of relationships, one between the number of lost calls and the database backing-up period and the other between the backing-up cost and the period, are well analyzed. Both analytical and numerical results indicate that there will be an optimal HLR database backing-up period if certain system parameters are given and the total cost can be consequently minimized.     

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.     

Per-user checkpointing for mobility database failure restoration

This paper studies the failure restoration of mobility database for Universal Mobile Telecommunications System (UMTS). We consider a per-user checkpointing approach for the home location register (HLR) database. In this approach, individual HLR records are saved into a backup database from time to time. When a failure occurs, the backup record is restored back to the mobility database. We first describe a commonly used basic checkpoint algorithm. Then, we propose a new checkpoint algorithm. An analytic model is developed to compare these two algorithms in terms of the checkpoint cost and the probability that an HLR backup record is obsolete. This analytic model is validated against simulation experiments. Numerical examples indicate that our new algorithm may significantly outperform the basic algorithm in terms of both performance measures.     

An efficient location cache scheme for three‐level database architecture in PCS networks

Recently, hierarchical architecture for location databases has been proposed in order to accommodate the growing number of personal communication systems users. With the three‐level hierarchical database architecture, which is compatible with the current cellular mobile systems, newly developed additional databases, including the regional location database (RLR), are positioned between the HLR and the VLRs. We propose an efficient cache scheme, the double T‐thresholds location cache scheme, which could reduce the network and database costs to lookup a portable using the three‐level architecture. This scheme extends the existing T‐threshold location cache scheme, which is effective only under the two‐level architecture of location databases currently adopted by IS‐41 and GSM. The idea behind our proposed scheme is to use two pieces of cache information, VLR and RLR, which serve the called portables. These two pieces are required in order to exploit not only the locality of a registration area (RA), but also the locality of a regional registration area (RRA), a wide area covered by the RLR. We also use two threshold values in order to determine whether the two pieces are obsolete. In order to model the RRA residence time, the branching Erlang‐∞ distribution is introduced. The cost analysis presented in this paper shows that the double T‐thresholds location cache scheme significantly reduces the network and database costs for most patterns of portables. Copyright © 2001 John Wiley & Sons, Ltd.     

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.     

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     

Analysis and Comparison of Location Strategies for Reducing Registration Cost in PCS Networks

In mobile environments, a personal communication service (PCS) network must keep track of the location of each mobile user in order to correctly deliver calls. A basic scheme used in the standard IS-41 and GSM protocols is to always update the location of a mobile user whenever the mobile user moves to a new location. The problem with this approach is that the cost of location update operations is very high especially when the mobile user moves frequently. In recent years, various location management strategies for reducing the location update cost have been proposed. However, the performance issue of these proposed algorithms remains to be investigated. In this paper, we develop two Markov chains to analyze and compare the performance of two promising location update strategies, i.e., the two location algorithm (TLA) and the forwarding and resetting algorithm (FRA). By utilizing the Markov chain, we are able to quickly answer what-if questions regarding the performance of PCS networks under various workload conditions and also identify conditions under which one strategy can perform better than the others. Using the cost due to location update and search operations between two successive calls to a mobile user as a performance measure, we show that when the mobile user exhibits a high degree of locality and the mobile user's call-to-mobility ratio (CMR) is low, TLA can significantly outperform both FRA and IS-41. On the other hand, when CMR is high, FRA is the winner. Furthermore, unlike TLA which may perform worse than IS-41 at high CMR values, FRA at identified optimal conditions can always perform at least as good as IS-41, suggesting that FRA over TLA should be used as a generic scheme in reducing the location cost in the PCS network to cover all possible per-user CMR values.     

3G 蜂窝网络中GLR 故障恢复分析

在3G蜂窝网络中,归属位置寄存器(HLR)、网关位置寄存器(GLR)、访问位置寄存器(VLR)组成三级数据库结构。当漫游移动用户在GLR中的位置信息错误或过时时,对该用户的入呼将失败。由于三层结构设计中,GLR与HLR的通信一般涉及国际长途信令,使得GLR的故障恢复设计非常重要。为尽可能减少对长途资源的占有,对GLR故障恢复提出了一种新的算法并对其性能作了相应的分析。     

An analysis of location record checkpointing interval for mobility database in PCS networks

Mobility database that stores the users’ location records is very important to connect calls to mobile users on personal communication networks. If the mobility database fails, calls to mobile users may not be set up in time. This paper studies failure restoration of mobility database. We study per-user location record checkpointing schemes that checkpoint a user’s record into a non-volatile storage from time to time on a per-user basis. When the mobility database fails, the user location records can be restored from the backup storage. Numeric analysis has been used to choose the optimum checkpointing interval so that the overall cost is minimized. The cost function that we consider includes the cost of checkpointing a user’s location record and the cost of paging a user due to an invalid location record. Our results indicate that when user registration intervals are exponentially distributed, the user record should never be checkpointed if checkpointing costs more than paging. Otherwise, if paging costs more, the user record should be always checkpointed when a user registers.     

Restoration scheme of mobility databases by mobility learning andprediction in PCS networks

This paper proposes a restoration scheme based on mobility learning and prediction in the presence of the failure of mobility databases in personal communication systems (PCSs). In PCSs, mobility databases must maintain the current location information of users to provide a fast connection for them. However, the malfunction of mobility databases may cause some location information to be lost. As a result, without an explicit restoration procedure, incoming calls to users may be rejected. Therefore, an explicit restoration scheme against the malfunction of mobility databases is needed to guarantee continuous service availability to users. Introducing mobility learning and prediction into the restoration process allows systems to locate users after a failure of mobility databases. In failure-free operations, the movement patterns of users are learned by a neuro-fuzzy inference system (NFIS). After a failure, an inference process of the NFIS is initiated and the users' future location is predicted. This is used to locate lost users after a failure. This proposal differs from previous approaches using a checkpoint because it does not need a backup process nor additional storage space to store checkpoint information. In addition, simulations show that our proposal can reduce the cost needed to restore the location records of lost users after a failure when compared to the checkpointing scheme     

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     

Two-way calling public CT2 telepoint system

In most current implementations of CT2 telepoint systems, only handset initiated calls are allowed. This paper describes a design to allow two-way calling for the CT2 public telepoint system with minimal modifications to the current CT2 infrastructure and the public switched telephone network (PSTN). The design makes use of centralized databases in the home location register (HLR) and visitor location registers (VLR) to track the location of handsets. This location information is stored in the VLR and HLR, and is used by the PSTN to route incoming calls destined for CT2 handsets to the appropriate CT2 telepoint base station (TBS). The TBS connect to the PSTN local exchanges (LE) through the integrated services digital network (ISDN) basic rate interfaces (BRI) for fast out-of-band signaling. We present simulation results of the system with the objective of determining where congestion might occur within the system and to understand the impact of the new implementation on the PSTN. The results indicate that the performance of the system will be limited by the VLR processing speed and the number of ISDN BRI's connecting the ISDN front end (IFE) to the PSTN     

On optimizing the location update costs in the presence of database failures

This paper studies the database failure recovery procedure for cellular phone networks as part of the Electronic Industries Association/Telecommunications Industry Association Interim Standard 41 (EIA/TIA IS-41). Before the location information of the database is recovered, phone calls may be lost. The restoration process can be sped up by having the mobile phones to periodically confirm their existence by radio contact with the cellular network. We show that, under some cost assumptions, periodic update interval should be chosen to be approximately equal to the call interarrival time, with more frequent updates for more unreliable system. We also show that the cost of an optimized system is relatively small and stable, if the system is even moderately reliable. Finally, if the system is at least moderately reliable, the effects of call origination rate and the rate at which Location Areas are crossed, are rather small, assuming that the periodic update interval was chosen as stated above. Thus, in such cases, optimization of the size of the Location Area can be made independent of the optimization of the periodic update process.     

A batch‐update strategy for the distributed HLRs architecture in PCS networks

Owing to the increasing population of mobile subscribers, the rapidly expanding signaling traffic has become a challenge to the mobility management in PCS networks. Multiple database schemes to reduce signal traffic and to solve the bottleneck problem of the single home location register (HLR) architecture have been proposed by many researchers. However, in most of the multiple location databases or HLR systems, extra signaling is required for the multiple database updates. We propose a batch‐update strategy, instead of the immediate update method, for the location‐tracking schemes with replication to reduce the signaling overhead. In this paper, we first introduce a distributed HLRs architecture in which each HLR is associated with a localized set of VLRs and the location registrations and queries are processed locally. Then we propose our batch‐update strategy and present two pointing schemes for inter‐HLR call deliveries. The numerical result shows that our approach can effectively decrease the signaling cost of location registration and call delivery compared with the IS‐41 standard. Copyright © 2002 John Wiley & Sons, Ltd.     

Phone number portability for PCS systems with ATM backbones usingdistributed dynamic hashing

Current cellular subscribers have a geographic phone number (e.g., in AMPS and US digital cellular systems) or a number which contains the network provider's identity (e.g., in GSM), and whenever subscribers register or receive (and possibly, originate) a call, a home location register (HLR) database has to be queried. The wired infrastructure supports a function called global title translation (GTT) that converts the subscriber's number to an HLR database address. A special feature of next generation wireless access service will be to support personal communication services (PCS) and wireless subscribers with portable personal numbers, or nongeographic phone numbers (NGPNs), that do not indicate the service provider or HLR database serving the user. In addition, the GTT function may not be available when the wired backbone is an ATM network. Thus a key function required in future wireless access systems with wired ATM backbones will be the ability to translate an NGPN to the identity of the HLR which serves the subscriber, a process we call NGPN translation. We discuss the requirements of NGPN translation and some alternative schemes. We propose two schemes for fast, efficient, scalable and flexible NGPN translation which use ideas of dynamic hashing, caching, and indirection. The schemes use a hash function in the visiting location registers (VLRs) (or serving SCP) and a set of distributed translation servers which store the NGPN-to-HLR mapping. We discuss how the operations required to maintain the translation information can be performed. Finally, we perform a simplified analysis of the scalability of the alternative schemes as well as the hash-based schemes we propose