Supporting Effective Caching in a Wide-Area Distributed Location Service.

Abstract. Globe is a wide-area distributed system that supports mobile objects. To track and locate objects, we use a worldwide distributed location service, implemented as a search tree. An object registers its current position by storing its address in a nearby leaf node of the tree. This knowledge propagates up to the top of the tree, so every object can be found from the root. Remote objects can cache the location of an object. However, if the object moves, the cache entry is no longer valid. In this paper, we show how caching can be made to work effectively even in the presence of mobile objects. vrije Universitei

Mobile multicast source support in PMIPv6 networks

With the widespread use of multimedia contents via mobile nodes (MNs), IP mobile multicast becomes more important for wireless, mobile, and ubiquitous multimedia applications. Until now, many research efforts have been made to provide IP multicast for the MNs. However, the existing mobile multicast schemes mostly focus on the mobility of receivers based on the host-based mobility solution that requires the MN to participate in the mobility management. Recent work has shown that service connectivity for mobile multicast sources is still a problem and attracts very little concern. With the development of the network-based mobility support protocol, mobile multicast source support schemes in Proxy Mobile IPv6 (PMIPv6) networks are needed urgently. In this paper, we propose a base solution (BS) and also a direct multicast routing scheme (DMRS) for mobile multicast source support in PMIPv6 networks. In the BS, the multicast listener discover (MLD) proxy function is adopted to transmit multicast data through the PMIPv6 tunnel. The DMRS can provide locally optimized traffic flows and avoid inefficient routing present in the BS. We evaluate and compare the performance of the proposed schemes with the Mobile IP bidirectional tunneling (MIP-BT) and Mobile IP remote subscription (MIP-RS) schemes by theoretical analysis and also implement the proposed schemes on the test-bed. The numerical results show that the BS and DMRS outperform the MIP-BT and MIP-RS in terms of signaling cost. Meanwhile, the experimental results verify the feasibility and validity of our proposed schemes. Furthermore, we study the optimal PMIPv6 domain size to reduce the total signaling cost for the proposed schemes

Mobility management in wireless cellular systems.

by Wing Ho Andy Yuen.Thesis (M.Phil.)--Chinese University of Hong Kong, 1997.Includes bibliographical references (leaves 85-[90]).Chapter 1 --- Introduction --- p.1Chapter 1.1 --- Design Issues in Wireless Cellular Systems --- p.1Chapter 1.1.1 --- Channel Assignment --- p.2Chapter 1.1.2 --- Handoff --- p.3Chapter 1.1.3 --- Multiple Accesses --- p.3Chapter 1.1.4 --- Mobility Management --- p.4Chapter 1.2 --- Motivation of the thesis --- p.5Chapter 1.3 --- Outline of the thesis --- p.6Chapter 2 --- Background Studies --- p.9Chapter 2.1 --- Current Standards --- p.9Chapter 2.2 --- Mobility Models --- p.11Chapter 2.2.1 --- Fluid Flow Model --- p.12Chapter 2.2.2 --- Markovian model --- p.13Chapter 2.3 --- Dynamic versus Static Location Strategy --- p.14Chapter 2.4 --- Location Registration Strategies --- p.14Chapter 2.4.1 --- Time Based Strategy --- p.15Chapter 2.4.2 --- Geographic Based Strategy --- p.17Chapter 2.4.3 --- Distance Based Strategy --- p.18Chapter 2.4.4 --- Miscellaneous Strategies --- p.19Chapter 2.5 --- Summary --- p.20Chapter 3 --- Hybrid Bloom Filter Location Update Algorithm --- p.21Chapter 3.1 --- Introduction --- p.21Chapter 3.2 --- System Model --- p.22Chapter 3.3 --- Hybrid Bloom Filter Algorithm --- p.23Chapter 3.3.1 --- Location Update Protocol --- p.23Chapter 3.3.2 --- Paging Protocol --- p.25Chapter 3.4 --- Performance Evaluation --- p.27Chapter 3.4.1 --- Comparison of the hybrid and time based Bloom filter algorithms --- p.32Chapter 3.5 --- Numerical Studies --- p.33Chapter 3.5.1 --- Cost versus mobility --- p.34Chapter 3.5.2 --- Cost versus call arrival rate --- p.37Chapter 3.6 --- Summary --- p.39Chapter 4 --- A Dynamic Location Area Assignment Algorithm --- p.40Chapter 4.1 --- Geographic versus Distance Based Strategies --- p.41Chapter 4.2 --- System Model --- p.42Chapter 4.2.1 --- cell layout --- p.42Chapter 4.2.2 --- mobility model --- p.43Chapter 4.2.3 --- cost function --- p.44Chapter 4.3 --- Dynamic Location Area Assignment Algorithm --- p.45Chapter 4.3.1 --- Measurement --- p.46Chapter 4.3.2 --- "Computation of (iopt, jopt)" --- p.46Chapter 4.3.3 --- Computation of location area size k --- p.51Chapter 4.4 --- Numerical Studies --- p.52Chapter 4.5 --- Summary --- p.57Chapter 5 --- Paging Cost Reduction Using Bloom Filtering As Auxilliary Strategy --- p.64Chapter 5.1 --- Introduction --- p.64Chapter 5.2 --- A Case Study - Joint DLA-HBF Algorithm --- p.65Chapter 5.2.1 --- The Algorithm --- p.65Chapter 5.2.2 --- Performance Evaluation --- p.67Chapter 5.3 --- Summary --- p.68Chapter 6 --- Conclusion --- p.70Chapter 6.1 --- Summary of Results --- p.70Chapter 6.2 --- Future Research Directions --- p.71Appendix --- p.73Chapter A --- Optimality of the Hybrid Bloom Filter Algorithm --- p.73Chapter B --- Derivation of the Expected First Passage Time ExTi and EyTj --- p.77Chapter C --- Optimality of the Dynamic Location Area Algorithm --- p.81Bibliography --- p.8

Cellular radio networks systems engineering.

by Kwan Lawrence Yeung.Thesis (Ph.D.)--Chinese University of Hong Kong, 1995.Includes bibliographical references (leaves 115-[118]).Chapter 1 --- Introduction --- p.1Chapter 1.1 --- Cellular Concept --- p.1Chapter 1.2 --- Fixed Channel Assignment --- p.2Chapter 1.3 --- Dynamic Channel Assignment --- p.2Chapter 1.4 --- Performance Evaluation of DC A --- p.3Chapter 1.5 --- Han doff Analysis --- p.3Chapter 1.6 --- Mobile Location Tracking Strategies --- p.3Chapter 1.7 --- QOS Measure --- p.4Chapter 1.8 --- Organization of Thesis --- p.4Chapter 2 --- Optimization of Channel Assignment I --- p.6Chapter 2.1 --- Introduction --- p.6Chapter 2.2 --- Generating Compact Patterns --- p.7Chapter 2.2.1 --- Regular size cells --- p.7Chapter 2.2.2 --- Irregular size cells --- p.7Chapter 2.3 --- Nominal Channel Allocation Methods --- p.10Chapter 2.3.1 --- Compact pattern allocation --- p.10Chapter 2.3.2 --- Greedy allocation --- p.11Chapter 2.3.3 --- Hybrid allocation --- p.11Chapter 2.3.4 --- The K-Optimal variations --- p.11Chapter 2.3.5 --- Backtracking strategies --- p.12Chapter 2.4 --- Performance Comparison --- p.12Chapter 2.5 --- Conclusions --- p.16Chapter 3 --- Optimization of Channel Assignment II --- p.18Chapter 3.1 --- Introduction --- p.18Chapter 3.2 --- Basic Heuristics --- p.20Chapter 3.2.1 --- Two methods for cell ordering --- p.20Chapter 3.2.2 --- Two channel assignment strategies --- p.20Chapter 3.3 --- Channel Assignments with Cell Re-ordering --- p.21Chapter 3.3.1 --- Four channel assignment algorithms --- p.21Chapter 3.3.2 --- Complexity --- p.22Chapter 3.3.3 --- An example --- p.22Chapter 3.4 --- Channel Assignment at Hotspots --- p.23Chapter 3.4.1 --- Strategy F vs strategy R --- p.23Chapter 3.4.2 --- Strategy FR --- p.24Chapter 3.5 --- Numerical Examples --- p.25Chapter 3.5.1 --- "Performance of algorithms F/CR,F/DR,R/CR and R/DR" --- p.26Chapter 3.5.2 --- Effect of X & Y on performance of algorithms FR/CR & FR/DR --- p.26Chapter 3.5.3 --- Performance of algorithms FR/CR & FR/DR --- p.27Chapter 3.6 --- Conclusions --- p.27Chapter 4 --- Compact Pattern Based DCA --- p.29Chapter 4.1 --- Introduction --- p.29Chapter 4.2 --- Compact Pattern Channel Assignment --- p.30Chapter 4.2.1 --- Data structures --- p.30Chapter 4.2.2 --- Two functions --- p.31Chapter 4.2.3 --- Two phases --- p.32Chapter 4.3 --- Performance Evaluation --- p.33Chapter 4.4 --- Conclusions --- p.36Chapter 5 --- Cell Group Decoupling Analysis --- p.37Chapter 5.1 --- Introduction --- p.37Chapter 5.2 --- One-Dimensional Cell Layout --- p.38Chapter 5.2.1 --- Problem formulation --- p.38Chapter 5.2.2 --- Calculation of blocking probability --- p.39Chapter 5.3 --- Two-Dimensional Cell Layout --- p.41Chapter 5.3.1 --- Problem formulation --- p.41Chapter 5.3.2 --- Calculation of blocking probability --- p.42Chapter 5.4 --- Illustrative Examples --- p.42Chapter 5.4.1 --- One-dimensional case --- p.42Chapter 5.4.2 --- Two-dimensional case --- p.45Chapter 5.5 --- Conclusions --- p.45Chapter 6 --- Phantom Cell Analysis --- p.49Chapter 6.1 --- Introduction --- p.49Chapter 6.2 --- Problem Formulation --- p.49Chapter 6.3 --- Arrival Rates in Phantom Cells --- p.50Chapter 6.4 --- Blocking Probability and Channel Occupancy Distribution --- p.51Chapter 6.4.1 --- Derivation of α --- p.51Chapter 6.4.2 --- Derivation of Bside --- p.52Chapter 6.4.3 --- Derivation of Bopp --- p.53Chapter 6.4.4 --- Channel occupancy distribution --- p.54Chapter 6.5 --- Numerical Results --- p.55Chapter 6.6 --- Conclusions --- p.55Chapter 7 --- Performance Analysis of BDCL Strategy --- p.58Chapter 7.1 --- Introduction --- p.58Chapter 7.2 --- Borrowing with Directional Carrier Locking --- p.58Chapter 7.3 --- Cell Group Decoupling Analysis --- p.59Chapter 7.3.1 --- Linear cellular systems --- p.59Chapter 7.3.2 --- Planar cellular systems --- p.61Chapter 7.4 --- Phantom Cell Analysis --- p.61Chapter 7.4.1 --- Call arrival rates in phantom cells --- p.62Chapter 7.4.2 --- Analytical model --- p.62Chapter 7.5 --- Numerical Examples --- p.63Chapter 7.5.1 --- Linear cellular system with CGD analysis --- p.63Chapter 7.5.2 --- Planar cellular system with CGD analysis --- p.65Chapter 7.5.3 --- Planar cellular system with phantom cell analysis --- p.65Chapter 7.6 --- Conclusions --- p.68Chapter 8 --- Performance Analysis of Directed Retry --- p.69Chapter 8.1 --- Introduction --- p.69Chapter 8.2 --- Directed Retry Strategy --- p.69Chapter 8.3 --- Blocking Performance of Directed Retry --- p.70Chapter 8.3.1 --- Analytical model --- p.70Chapter 8.3.2 --- Numerical examples --- p.71Chapter 8.4 --- HandofF Analysis for Directed Retry --- p.73Chapter 8.4.1 --- Analytical model --- p.73Chapter 8.4.2 --- Numerical examples --- p.75Chapter 8.5 --- Conclusions --- p.77Chapter 9 --- Handoff Analysis in a Linear System --- p.79Chapter 9.1 --- Introduction --- p.79Chapter 9.2 --- Traffic Model --- p.80Chapter 9.2.1 --- Call arrival rates --- p.80Chapter 9.2.2 --- Channel holding time distribution --- p.81Chapter 9.3 --- Analytical Model --- p.81Chapter 9.3.1 --- Handoff probability --- p.81Chapter 9.3.2 --- Handoff call arrival rate --- p.81Chapter 9.3.3 --- Derivation of blocking probability --- p.81Chapter 9.3.4 --- Handoff failure probability --- p.82Chapter 9.3.5 --- Finding the optimal number of guard channels --- p.83Chapter 9.4 --- Numerical Results --- p.83Chapter 9.4.1 --- System parameters --- p.83Chapter 9.4.2 --- Justifying the analysis --- p.84Chapter 9.4.3 --- The effect of the number of guard channels --- p.84Chapter 9.5 --- Conclusions --- p.85Chapter 10 --- Mobile Location Tracking Strategy --- p.88Chapter 10.1 --- Introduction --- p.88Chapter 10.2 --- Review of Location Tracking Strategies --- p.89Chapter 10.2.1 --- Fixed location area strategy --- p.89Chapter 10.2.2 --- Fixed reporting center strategy --- p.89Chapter 10.2.3 --- Intelligent paging strategy --- p.89Chapter 10.2.4 --- Time-based location area strategy --- p.89Chapter 10.2.5 --- Movement-based location area strategy --- p.90Chapter 10.2.6 --- Distance-based location area strategy --- p.90Chapter 10.3 --- Optimization of Location Area Size --- p.90Chapter 10.3.1 --- Location updating rates ´ؤ linear systems --- p.90Chapter 10.3.2 --- Location updating rates ´ؤ planar systems --- p.91Chapter 10.3.3 --- Optimal location area size ´ؤ linear systems --- p.92Chapter 10.3.4 --- Optimal location area size ´ؤ planar systems --- p.92Chapter 10.4 --- Comparison of FLA & DBLA Strategies --- p.93Chapter 10.5 --- Adaptive Location Tracking Strategy --- p.94Chapter 10.5.1 --- Mobility tracking --- p.94Chapter 10.5.2 --- Protocols for ALT strategy --- p.94Chapter 10.6 --- Numerical Examples --- p.95Chapter 10.7 --- Conclusions --- p.97Chapter 11 --- A New Quality of Service Measure --- p.99Chapter 11.1 --- Introduction --- p.99Chapter 11.2 --- QOS Measures --- p.99Chapter 11.3 --- An Example --- p.101Chapter 11.4 --- Case Studies --- p.101Chapter 11.5 --- Conclusions --- p.106Chapter 12 --- Discussions & Conclusions --- p.107Chapter 12.1 --- Summary of Results --- p.107Chapter 12.2 --- Topics for Future Research --- p.108Chapter A --- Borrowing with Directional Channel Locking Strategy --- p.110Chapter B --- Derivation of p2 --- p.112Chapter C --- Publications Derived From This Thesis --- p.114Bibliography --- p.11

Locating Objects in a Wide-area System

Steen, M.R. van [Promotor]Tanenbaum, A.S. [Promotor