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. © 2008 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Szalay, M., & Imre, S. (2008). Analysis of hierarchical paging. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5200 LNCS, pp. 103–112). Springer Verlag. https://doi.org/10.1007/978-3-540-89524-4_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
