A forwarding strategy to reduce network impacts of PCS

Jain, Ravi; Lin, Yi‐Bing; Lo, Chi-Chun; Mohan, Seshadri

doi:10.1109/infcom.1995.515912

Cited by 54 publications

(22 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…An example is the FRA(k) scheme [14] where k is a design parameter. The basic idea under FRA is that, whenever a mobile user moves to a new VLR area, only a pointer is set-up between the two involved VLRs and there is no need to inform the HLR about the location change.…”

Section: Degradable Location Managementmentioning

confidence: 99%

“…The advantage of forwarding over non-forwarding mechanisms in the mobile network was discussed in [14]. Basically, instead of informing the HLR every time the mobile user crosses a VLR boundary, only a forwarding pointer is set up between involved VLRs.…”

Section: Framentioning

confidence: 99%

“…Recall that IS-41 lies at one extreme of the spectrum, for which the average update cost per move is equal to T . The average cost of PLA, FRA and LAA, as defined by Equations (8), (11) and (14), are shown in Figures 10, 11 and 12, respectively, along with that of IS-41 for comparison purposes. These figures show that for the case when τ = 0.3T and when the CMR is small, PLA, FRA and LAA can all significantly outperform IS-41.…”

Section: Analysis and Comparisonmentioning

confidence: 99%

“…Therefore the goal is to minimize the total cost incurred in servicing location-update and calldelivery operations. For the two-tier HLR-VLR architecture, it has been separately reported that when the frequency of incoming calls is higher than the mobile user's mobility, that is when the call-to-mobility ratio (CMR) is high, the location cache scheme [13] is effective, while when CMR is low the forwarding and resetting algorithm (FRA) [14,15], the paging and location update algorithm (PLA) [16] and the local anchor algorithm (LAA) [17] are effective. There is no systematic way to categorize these location management algorithms and to compare their performance characteristics [8].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A Comparative Cost Analysis of Degradable Location Management Algorithms in Wireless Networks

Chen

Gu²

2002

The Computer Journal

View full text Add to dashboard Cite

In this paper, we develop a uniform framework to provide a cost analysis of location update and search operations for a class of degradable location management algorithms in personal communication service (PCS) networks for tracking mobile users in the two-tier HLR (Home Location Register)-VLR (Visitor Location Register) structure. Depending on the algorithm employed, the PCS may be in a degraded state in maintaining the location of a mobile user. We classify existing location management algorithms based on how well the location information is maintained in terms of the costs associated with location updates and develop a two-level hierarchical modeling framework to analyze the performance characteristics of these algorithms. Specifically, the high-level model calculates the total cost incurred to the PCS network as a result of location-update and call-delivery operations during the period between two consecutive calls. The low-level model is a stochastic model that estimates the values of high-level model parameters. We show that by utilizing simple Markov models at the low level, we can assess and compare the performance characteristics of degradable location management algorithms easily. The basic scheme used in the standard IS-41 and GSM protocols, the paging and location updating algorithm (PLA), the forwarding and resetting algorithm (FRA) and the local anchoring algorithm (LAA) are used as examples to demonstrate the applicability of our approach. We also show how the modeling approach developed can be extended to the analysis of algorithms for handling service handoffs in the two-tier HLR-VLR architecture.

show abstract

Section: Degradable Location Managementmentioning

confidence: 99%

Section: Framentioning

confidence: 99%

Section: Analysis and Comparisonmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Comparative Cost Analysis of Degradable Location Management Algorithms in Wireless Networks

Chen

Gu²

2002

The Computer Journal

View full text Add to dashboard Cite

show abstract

“…In recent years, various location management strategies based on the concept of forwarding have been proposed and studied in the literature [1,2] with the goal of minimizing the network signaling and database loads. The basic mechanisms involved in implementing these forwarding strategies are 'forwarding' and 'resetting' operations.…”

Section: Introductionmentioning

confidence: 99%

Performance Evaluation of Forwarding Strategies for Location Management in Mobile Networks

Chen¹,

Chen

Lee³

1998

The Computer Journal

View full text Add to dashboard Cite

This paper presents a methodology for evaluating the performance of forwarding strategies for location management in a personal communication services (PCS) mobile network. A forwarding strategy in the PCS network can be implemented by two mechanisms: a forwarding operation which follows a chain of databases to locate a mobile user and a resetting operation which updates the databases in the chain so that the current location of a mobile user can be known directly without having to follow a chain of databases. In this paper, we consider the PCS network as a server whose function is to provide services to the mobile user for 'updating the location of the user as the user moves across a database boundary' and 'locating the mobile user'. We use a Markov chain to describe the behavior of the mobile user and analyze the best time when forwarding and resetting should be performed in order to optimize the service rate of the PCS network. We demonstrate the applicability of our approach with hexagonal and mesh coverage models for the PCS network and provide a physical interpretation of the result.

show abstract

Mobility agent based on activity rate of user and adaptive paging for location management in wireless networks

Nath

Kumar

2012

Trans. Emerging Tel Tech

View full text Add to dashboard Cite

In urban cities, many MUs (mobile users) follow a fixed mobility pattern. Most of the time, these users can be found in a particular registration area (RA) at a certain time period. We say that MUs follow a fixed set of RAs on a daily basis. Therefore, an MU can be located at one of the RA from the set of fixed RAs when a call arrives. In prior schemes, the location update cost is minimized by increasing paging cost. In this paper, we propose a mobility agent (MA) and adaptive paging strategy based on MUs' movement. The MA is a special functional entity in the network, and many RAs are connected to MA as per mobility pattern of an MU. The paging area is selected based on the average speed of MUs. The major features of the proposed scheme are the overall reduced location management cost and less paging time compared with existing scheme. We present analytical modeling and performance evaluation that show that the proposed scheme has less location management cost and less paging time to locate an MU compared with existing scheme.

show abstract

A forwarding strategy to reduce network impacts of PCS

Cited by 54 publications

References 10 publications

A Comparative Cost Analysis of Degradable Location Management Algorithms in Wireless Networks

A Comparative Cost Analysis of Degradable Location Management Algorithms in Wireless Networks

Performance Evaluation of Forwarding Strategies for Location Management in Mobile Networks

Mobility agent based on activity rate of user and adaptive paging for location management in wireless networks

Contact Info

Product

Resources

About