Achieving scalability in hierarchical location services

Maarten van Steen*, Gerco Ballintijn

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

14 Citations (Scopus)

Abstract

Services for locating mobile objects are often organized as a distributed search tree. The advantage of this approach is that the service can scale as a system grows in size and number of objects. However, a potential problem is that high-level nodes may become a bottleneck affecting the scalability of the service. A traditional solution is to also distribute the location information managed by a single node across multiple machines. We introduce a method that radically applies distribution of location information such that the load is evenly balanced across all machines that form part of the implementation of the service, while at the same time exploiting locality.

Original languageEnglish
Title of host publicationProceedings 26th IEEE International Computer Software and Applications Conference
Place of PublicationPiscataway, NJ
PublisherIEEE
Pages899-904
Number of pages6
ISBN (Print)0-7695-1727-7
DOIs
Publication statusPublished - 16 Oct 2002
Externally publishedYes
Event26th Annual International Computer Software and Applications Conference, COMPSAC 2002 - Oxford, United Kingdom
Duration: 26 Aug 200229 Aug 2002
Conference number: 26

Publication series

NameAnnual IEEE International Computer Software and Applications Conference (COMPSAC)
PublisherIEEE
Volume2002
ISSN (Print)0730-3157

Conference

Conference26th Annual International Computer Software and Applications Conference, COMPSAC 2002
Abbreviated titleCOMPSAC
Country/TerritoryUnited Kingdom
CityOxford
Period26/08/0229/08/02

Fingerprint

Dive into the research topics of 'Achieving scalability in hierarchical location services'. Together they form a unique fingerprint.

Cite this