ScholarLens Back to search
2008•International Conference on Advanced Communication TechnologyRequires access

Paging Algorithm For Cost-Effective Location Management In Multiple Access Network Environment

Ae Hyang Park, Juyoung Park, Shin‐Gak Kang, Jun Kyun Choi

Open publisher page 1 citations

Abstract

This paper proposes paging algorithm to manage location management in multiple access network environments. We investigate the existing paging algorithm and propose cost-effective paging algorithm to reduce the number of cells in paging area.

About this research paper

What this paper is about

This paper proposes paging algorithm to manage location management in multiple access network environments. We investigate the existing paging algorithm and propose cost-effective paging algorithm to reduce the number of cells in paging area.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This paper proposes paging algorithm to manage location management in multiple access network environments. We investigate the existing paging algorithm and propose cost-effective paging algorithm to reduce the number of cells in paging area.

Key concepts: Paging, Computer science, Computer network, Demand paging, Algorithm, Memory management, Virtual memory, Operating system

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Paging Algorithm For Cost-Effective Location Management In Multiple Access Network Environment — Research Paper | ScholarLens