Analysis of hierarchical paging

Mate Szalay, Sandor Imre

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

In this paper a new location management algorithm called Hierarchical Paging is introduced. A mathematical model for the proposed scheme is also presented, which makes it possible to compare it to other solutions and to examine how various parameters affect its performance. It is shown that our solution can be more efficient than traditional paging.

Original languageEnglish
Title of host publicationInformation Networking
Subtitle of host publicationTowards Ubiquitous Networking and Services - International Conference, ICOIN 2007, Revised Selected Papers
Pages103-112
Number of pages10
DOIs
Publication statusPublished - 2008
Event21st International Conference on Information Networking, ICOIN 2007 - Estoril, Portugal
Duration: Jan 23 2007Jan 25 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5200 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other21st International Conference on Information Networking, ICOIN 2007
CountryPortugal
CityEstoril
Period1/23/071/25/07

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Analysis of hierarchical paging'. Together they form a unique fingerprint.

  • Cite this

    Szalay, M., & Imre, S. (2008). Analysis of hierarchical paging. In Information Networking: Towards Ubiquitous Networking and Services - International Conference, ICOIN 2007, Revised Selected Papers (pp. 103-112). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5200 LNCS). https://doi.org/10.1007/978-3-540-89524-4-11