Mobility management is an important aspect in LEO (low earth orbit) systems. In terrestrial wireless networks, the movement of the user triggers location updating and determines the paging scheme, while in LEO satellite systems, the location updating and paging is mainly based on the movement of satellite. Terrestrial location management techniques must be altered to fit the LEO systems. This p...

Methods of balancing call registration and paging are developed in this paper. Given that the probability distribution on the user location as a function of time is either known or can be calculated, previous work shows the existence of lower bounds on the average cost of paging. Here these bounds are used in conjunction with a Poisson incoming-call arrival model to formulate the paging/registr...

1 The work described in this paper was partially supported by a strategic grant from the City University of Hong Kong [Project No. CityU 7001259]. Abstract. This paper studies the location management problem in PCS network. An adaptive direction-based location update (ADBU) scheme is proposed in which a line-paging method is adopted to minimize the paging cost and an adaptive direction-based sc...

We propose a variation of online paging in two-level memory systems where pages in the fast cache get modified and therefore have to be explicitly written back to the slow memory upon evictions. For increased performance, up to α arbitrary pages can be moved from the cache to the slow memory within a single joint eviction, whereas fetching pages from the slow memory is still performed on a one-...

BACKGROUND Numeric pagers are commonly used communication devices in healthcare, but cannot convey important information such as the reason for or urgency of the page. Alphanumeric pagers can display both numbers and text, and may address some of these communication problems. OBJECTIVE Our primary aim was to implement an alphanumeric paging system. DESIGN Continuous quality improvement stud...

A major problem with time slicing on parallel machines is memory pressure, as the resulting paging activity damages the synchronism among a job's processes. An alternative is to impose admission controls, and only admit jobs that fit into the available memory. Despite suffering from delayed execution, this leads to better overall performance by preventing the harmful effects of paging and thras...

In this paper we give a finer separation of several known paging algorithms using a new technique called relative interval analysis. This technique compares the fault rate of two paging algorithms across the entire range of inputs of a given size rather than in the worst case alone. Using this technique we characterize the relative performance of LRU and LRU-2, as well as LRU and FWF, among oth...