It is well known that competitive analysis yields results that do not reflect the observed performance of online paging algorithms. Many deterministic paging algorithms achieve the same competitive ratio, ranging from inefficient strategies as flush-when-full to the well-performing leastrecently-used (LRU). In this paper, we study this fundamental online problem from the viewpoint of stochastic...

We investigate the performance ofon-line demand paging algorithms (in comparison with the optimal off-line demand paging algorithms) for generalized two level memo­ ries, which are two level memories whose second level is composed of different speed memories. We consider and model variants of this problem which are of practical inter­ est. We especially investigate LRU and FIFO, which are both ...

To calculate the capacity of a paging system two different models can be applied: a theoretical and a simulation model. This paper presents factors that affect the capacity of a paging system, shows how the capacity can be calculated by use of mentioned models and compares obtained results. The simulation process is described and impact of different queuing algorithms on system capacity is pres...

Two network-virtualization architectures, namely, network segmentation and network paging, were investigated. They are analogical to two memory-virtualization architectures: segmentation and paging. Network paging, which is relatively new and is based on a type of network-address translation (NAT), is focused on. This architecture requires smaller packet size and has several more advantages ove...

In this paper, we define a new “location area” for location management in wireless networks. Location management schemes comprise of location update and terminal paging. Efforts to introduce efficient location update schemes results in increased paging costs and vice-versa. Dynamic Location Area (LA) schemes, which are per-user and mobility pattern based were proposed to overcome the problems o...

For a mobile unit moving according to some ergodic stochastic process, we show how to minimize the expected average cost of paging and registration based on system state information. Specifically, we assume that both the system and mobile unit (user) have access to or can derive the following: • the user location probability distribution as a function of time given the last location known to th...

This paper introduces a mobility tracking mechanism that combines a movement-based location update policy with a selective paging scheme. Movement-based location update is selected for its simplicity. It does not require ea& mobile terminal to store information about the arrangement and the distance relationship of all cells. In fact, each mobile terminal only keeps a counter of the number of c...

For a wireless network to effectively deliver services to the mobile users, it must have an efficient way to track them. The location management fulfills this task through location registration and paging. Many location management strategies, such as profile-based scheme (PBS), have been proposed to reduce the signaling traffic caused by the location update and paging. In the PBS scheme, the sy...

Mobility tracking is concerned with finding a mobile subscriber (MS) within the area serviced by the wireless network. The two basic operations for tracking an MS, location updating and paging, constitute additional load on the wireless network. The total cost of updating and paging can be minimized by optimally dividing the cellular area into location registration (LR) areas. In current system...