Distributed algorithms for dynamic replication of data
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Host migration transparency in IP networks: the VIP approach
ACM SIGCOMM Computer Communication Review
Data replication for mobile computers
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
An adaptive location management strategy for mobile IP
MobiCom '95 Proceedings of the 1st annual international conference on Mobile computing and networking
Minimizing the average cost of paging under delay constraints
Wireless Networks
The working set model for program behavior
Communications of the ACM
Querying in Highly Mobile Distributed Environments
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
MobiCom '97 Proceedings of the 3rd annual ACM/IEEE international conference on Mobile computing and networking
A selective location update strategy for PCS users
Wireless Networks
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
Adaptive Route Optimization in Hierarchical Mobile IPv6 Networks
IEEE Transactions on Mobile Computing
Hi-index | 0.00 |
Source messages intended for a mobile host can be routed in one of two ways. Either the source knows the direct route to the mobile host, and is informed of all location changes by the mobile host (informed routing), or the source directs messages to a home agent that forwards messages to the mobile host (triangle routing). When the rate at which the mobile host changes location and the rate at which messages are directed to the mobile host are known and fixed, we show that the optimal routing policy is described by a threshold rule that depends on the normalized differential cost of the routing techniques and the ratio of the source messaging to location update rates. Since this call to mobility ratio may not be known a priori or may change slowly with time,we also derive anadaptive policy selection algorithm.The policy is derivedfroma maximum likelihood estimate of the call tomobility ratio based on observations of message arrivals and location changes. The algorithm is found to work well when there is a clear advantage to either triangle or informed routing. However,when the two routing schemes are relatively close in average cost, the algorithmperformance is degraded by repeatedpolicy reversals. For this reason,algorithms which use hysteresis and/or a preset preference (preference threshold) for one routing scheme or another were explored. It was found that neither hysteresis, nor preference threshold techniques alone performed well, but rather a combination of the tworesulteding reatly improved performance for a wide range of values of the call to mobility ratio.