The dynamics of collective sorting robot-like ants and ant-like robots
Proceedings of the first international conference on simulation of adaptive behavior on From animals to animats
Diversity and adaptation in populations of clustering ants
SAB94 Proceedings of the third international conference on Simulation of adaptive behavior : from animals to animats 3: from animals to animats 3
OPTICS: ordering points to identify the clustering structure
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Routing Algorithms for DHTs: Some Open Questions
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
PENS: an algorithm for density-based clustering in peer-to-peer systems
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
Hi-index | 0.00 |
Massively Multiuser Virtual Environment (MMVE) applications have the challenge of update message exchange among a large number of users. Real-time collaboration in the virtual environments requires the updates to be exchanged with the minimum end-to-end latency and overhead. This article proposes a new clustering technique to improve the update message exchange efficiency in MMVE applications. The proposed solution is based on the use of ant clustering technique in order to cluster the users based on their geographical proximity. These clusters can be used as localized routing regions in the hierarchical routing architecture and prevent local messages to be routed through long distance hops. Therefore, clustering can help to reduce both update exchange latency and underlay network traffic.