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 language | English |
---|---|
Title of host publication | Proceedings 26th IEEE International Computer Software and Applications Conference |
Place of Publication | Piscataway, NJ |
Publisher | IEEE |
Pages | 899-904 |
Number of pages | 6 |
ISBN (Print) | 0-7695-1727-7 |
DOIs | |
Publication status | Published - 16 Oct 2002 |
Externally published | Yes |
Event | 26th Annual International Computer Software and Applications Conference, COMPSAC 2002 - Oxford, United Kingdom Duration: 26 Aug 2002 → 29 Aug 2002 Conference number: 26 |
Publication series
Name | Annual IEEE International Computer Software and Applications Conference (COMPSAC) |
---|---|
Publisher | IEEE |
Volume | 2002 |
ISSN (Print) | 0730-3157 |
Conference
Conference | 26th Annual International Computer Software and Applications Conference, COMPSAC 2002 |
---|---|
Abbreviated title | COMPSAC |
Country/Territory | United Kingdom |
City | Oxford |
Period | 26/08/02 → 29/08/02 |