Location management is crucial for mobile systems. A mobile must be located whenever a connection is established. Thus, mobile systems must cope with frequent location updates and queries. In addition to the HLR/VLR scheme in IS-41 and GSM, the feasibility of reducing the network load caused by locating mobile users has received considerable attention. One user location algorithm called "Pointer Forwarding with Single HLR," was proposed to reduce location update cost. Thereafter, the distributed HLR scheme was proposed to prevent HLR from becoming a signal bottleneck in the signaling network. This approach eliminates the cost of updating multiple HLRs, vastly reducing the database access delay, but also introduces long pointer chain traverse that may cause large location tracking costs and long call delivery times/costs. This study proposes a efficient location tracking strategy, named, "Fast Pointer Forwarding Strategy with Distributed HLR. " This strategy ensures that the pointer chain length never exceeds one. In fact, this strategy provides an upper bound on location tracking time. Its performance is numerically analyzed. Results in this study demonstrate that our strategy can considerably reduce the complexity of implementation and the call delivery time/cost.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Cheng-Ming WENG, Chen-Hung CHU, "A Fast Pointer Forwarding Strategy for Location Tracking in Distributed HLR Environment" in IEICE TRANSACTIONS on Communications,
vol. E85-B, no. 9, pp. 1706-1713, September 2002, doi: .
Abstract: Location management is crucial for mobile systems. A mobile must be located whenever a connection is established. Thus, mobile systems must cope with frequent location updates and queries. In addition to the HLR/VLR scheme in IS-41 and GSM, the feasibility of reducing the network load caused by locating mobile users has received considerable attention. One user location algorithm called "Pointer Forwarding with Single HLR," was proposed to reduce location update cost. Thereafter, the distributed HLR scheme was proposed to prevent HLR from becoming a signal bottleneck in the signaling network. This approach eliminates the cost of updating multiple HLRs, vastly reducing the database access delay, but also introduces long pointer chain traverse that may cause large location tracking costs and long call delivery times/costs. This study proposes a efficient location tracking strategy, named, "Fast Pointer Forwarding Strategy with Distributed HLR. " This strategy ensures that the pointer chain length never exceeds one. In fact, this strategy provides an upper bound on location tracking time. Its performance is numerically analyzed. Results in this study demonstrate that our strategy can considerably reduce the complexity of implementation and the call delivery time/cost.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e85-b_9_1706/_p
Copy
@ARTICLE{e85-b_9_1706,
author={Cheng-Ming WENG, Chen-Hung CHU, },
journal={IEICE TRANSACTIONS on Communications},
title={A Fast Pointer Forwarding Strategy for Location Tracking in Distributed HLR Environment},
year={2002},
volume={E85-B},
number={9},
pages={1706-1713},
abstract={Location management is crucial for mobile systems. A mobile must be located whenever a connection is established. Thus, mobile systems must cope with frequent location updates and queries. In addition to the HLR/VLR scheme in IS-41 and GSM, the feasibility of reducing the network load caused by locating mobile users has received considerable attention. One user location algorithm called "Pointer Forwarding with Single HLR," was proposed to reduce location update cost. Thereafter, the distributed HLR scheme was proposed to prevent HLR from becoming a signal bottleneck in the signaling network. This approach eliminates the cost of updating multiple HLRs, vastly reducing the database access delay, but also introduces long pointer chain traverse that may cause large location tracking costs and long call delivery times/costs. This study proposes a efficient location tracking strategy, named, "Fast Pointer Forwarding Strategy with Distributed HLR. " This strategy ensures that the pointer chain length never exceeds one. In fact, this strategy provides an upper bound on location tracking time. Its performance is numerically analyzed. Results in this study demonstrate that our strategy can considerably reduce the complexity of implementation and the call delivery time/cost.},
keywords={},
doi={},
ISSN={},
month={September},}
Copy
TY - JOUR
TI - A Fast Pointer Forwarding Strategy for Location Tracking in Distributed HLR Environment
T2 - IEICE TRANSACTIONS on Communications
SP - 1706
EP - 1713
AU - Cheng-Ming WENG
AU - Chen-Hung CHU
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E85-B
IS - 9
JA - IEICE TRANSACTIONS on Communications
Y1 - September 2002
AB - Location management is crucial for mobile systems. A mobile must be located whenever a connection is established. Thus, mobile systems must cope with frequent location updates and queries. In addition to the HLR/VLR scheme in IS-41 and GSM, the feasibility of reducing the network load caused by locating mobile users has received considerable attention. One user location algorithm called "Pointer Forwarding with Single HLR," was proposed to reduce location update cost. Thereafter, the distributed HLR scheme was proposed to prevent HLR from becoming a signal bottleneck in the signaling network. This approach eliminates the cost of updating multiple HLRs, vastly reducing the database access delay, but also introduces long pointer chain traverse that may cause large location tracking costs and long call delivery times/costs. This study proposes a efficient location tracking strategy, named, "Fast Pointer Forwarding Strategy with Distributed HLR. " This strategy ensures that the pointer chain length never exceeds one. In fact, this strategy provides an upper bound on location tracking time. Its performance is numerically analyzed. Results in this study demonstrate that our strategy can considerably reduce the complexity of implementation and the call delivery time/cost.
ER -