Manuscript received August 10, 2012. Toni Stojanovski, Faculty of Informatics, European University, bld. Kliment Ohridski 68, 1000 Skopje, Macedonia. (phone: +389 78 396 693, e-mail: [email protected]) Ivan Velinov, Faculty of Informatics, European University, bld Kliment Ohridski 68, 1000 Skopje, Macedonia. (e-mail: [email protected]) Marko Vučković, Faculty of Informati...

Recently, a flash memory has become a major database storage in building portable information devices because of its non-volatile, shock-resistant, power-economic nature, and fast access time for read operations. We propose a new scheme called flash memory shadow paging (FMSP) for efficient page management in a flash memory database environment. We improved traditional shadow paging schemes by ...

Location management is one of the fundamental issues in cellular networks. It includes two operations: location update and paging. The goal of location management is to minimize the combined cost of these two operations. Recently a distance-based scheme using a pre-defined look-up table for location updates has been proposed. The table describes the relationship between the distance and the tim...

in cellular networks because of the trade-off caused by paging and registration signaling. The upper bound on the size of an LA is the service area of a mobile switching center (MSC). In that extreme case, the cost of paging is at its maximum, but no registration is needed. On the other hand, if each cell is an LA, the paging cost is minimal, but the registration cost is the largest. In general...

In forthcoming personal communication systems (PCSs), small cells are deployed to achieve high spectral efficiency. This has significant impacts on location tracking of mobile users. The increase in location update (LU) load leads to more contention on the reverse control channel. Thus, many algorithms are designed to distribute the LU load to a larger number of cells. This avoids the inefficie...

In this article we study the amortized efficiency of the “move-to-front” and similar rules for dynamically maintaining a linear list. Under the assumption that accessing the i th element from the front of the list takes e(i) time, we show that move-to-front is within a constant factor of optimum among a wide class of list maintenance rules. Other natural heuristics, such as the transpose and fr...

A linear programming formulation of the page replacement problem is used for proving the opti-mality of the MIN algorithm in a novel way. We describe an algorithm for constructing a solution for the dual problem such that the cost of this solution equals the cost of the MIN solution for the primal problem, thus proving the optimality of the MIN solution for paging, and the optimality of our alg...

This article presents a survey on location management algorithms for the next generation personal communication networks (PCNs). We first describe different static and dynamic location update algorithms. Then we discuss various selective paging strategies. We also present various modeling techniques that have been used for the performance analysis of location update and terminal paging. We conc...

Application startup latency has become a performance problem for both desktop applications and web applications. In this paper, we show that much of the latency experienced during application startup can be avoided by more e ciently packing application code pages. To take advantage of more e cient packing, we describe the implementation of demand paging for web applications. Finally, we show th...

We propose a novel paging strategy based on the theory of optimal search with discrete efforts. When compared to conventional paging methods, the proposed scheme increases the mobile station discovery rate while decreasing the average number of times that a mobile station has to be paged in a location area. The proposal is fully compatible with existing cellular structures, and requires minimal...