New matching algorithm for managing location information in mobile computing

Akhil Kumar, Tracy Camp

Research output: Contribution to journalConference article

1 Citation (Scopus)

Abstract

We describe a fully distributed algorithm for location management. It is based on organizing mobile switching stations into a hierarchical network of grids. The interesting properties of this algorithm are symmetric availability for reads and writes, low quorum size, scalability and flexibility. The algorithm is based on a novel solution for the well-known matching problem that is especially suitable in a mobile environment. We compare the performance of our technique against the standard grid protocol and also the more recent Crumbling Walls protocol in terms of read and write availability, quorum size and load. The results and analysis highlight the tradeoffs involved in these various protocols, and show that the proposed algorithm is promising.

Original languageEnglish (US)
Pages (from-to)231-239
Number of pages9
JournalIEEE International Performance, Computing and Communications Conference, Proceedings
StatePublished - Jan 1 2000
EventIEEE International Performance, Computing, and Communications Conference (IPCCC 2000) - Phoenix, AZ, USA
Duration: Feb 20 2000Feb 22 2000

Fingerprint

Mobile computing
Network protocols
Availability
Parallel algorithms
Scalability

All Science Journal Classification (ASJC) codes

  • Media Technology

Cite this

@article{724a8c4825e04baea11bbe932776f8c4,
title = "New matching algorithm for managing location information in mobile computing",
abstract = "We describe a fully distributed algorithm for location management. It is based on organizing mobile switching stations into a hierarchical network of grids. The interesting properties of this algorithm are symmetric availability for reads and writes, low quorum size, scalability and flexibility. The algorithm is based on a novel solution for the well-known matching problem that is especially suitable in a mobile environment. We compare the performance of our technique against the standard grid protocol and also the more recent Crumbling Walls protocol in terms of read and write availability, quorum size and load. The results and analysis highlight the tradeoffs involved in these various protocols, and show that the proposed algorithm is promising.",
author = "Akhil Kumar and Tracy Camp",
year = "2000",
month = "1",
day = "1",
language = "English (US)",
pages = "231--239",
journal = "IEEE International Performance, Computing and Communications Conference, Proceedings",
issn = "1097-2641",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - New matching algorithm for managing location information in mobile computing

AU - Kumar, Akhil

AU - Camp, Tracy

PY - 2000/1/1

Y1 - 2000/1/1

N2 - We describe a fully distributed algorithm for location management. It is based on organizing mobile switching stations into a hierarchical network of grids. The interesting properties of this algorithm are symmetric availability for reads and writes, low quorum size, scalability and flexibility. The algorithm is based on a novel solution for the well-known matching problem that is especially suitable in a mobile environment. We compare the performance of our technique against the standard grid protocol and also the more recent Crumbling Walls protocol in terms of read and write availability, quorum size and load. The results and analysis highlight the tradeoffs involved in these various protocols, and show that the proposed algorithm is promising.

AB - We describe a fully distributed algorithm for location management. It is based on organizing mobile switching stations into a hierarchical network of grids. The interesting properties of this algorithm are symmetric availability for reads and writes, low quorum size, scalability and flexibility. The algorithm is based on a novel solution for the well-known matching problem that is especially suitable in a mobile environment. We compare the performance of our technique against the standard grid protocol and also the more recent Crumbling Walls protocol in terms of read and write availability, quorum size and load. The results and analysis highlight the tradeoffs involved in these various protocols, and show that the proposed algorithm is promising.

UR - http://www.scopus.com/inward/record.url?scp=0033733816&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033733816&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:0033733816

SP - 231

EP - 239

JO - IEEE International Performance, Computing and Communications Conference, Proceedings

JF - IEEE International Performance, Computing and Communications Conference, Proceedings

SN - 1097-2641

ER -