Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Managing update conflicts in Bayou, a weakly connected replicated storage system
SOSP '95 Proceedings of the fifteenth ACM symposium on Operating systems principles
Optimal Placement of Replicas in Trees with Read, Write, and Storage Costs
IEEE Transactions on Parallel and Distributed Systems
On the Optimal Placement of Web Proxies in the Internet: The Linear Topology
HPN '98 Proceedings of the IFIP TC-6 Eigth International Conference on High Performance Networking
Computer Networks: The International Journal of Computer and Telecommunications Networking - Mobile and ad hoc local networks
Dynamic Replica Management in the Service Grid
HPDC '01 Proceedings of the 10th IEEE International Symposium on High Performance Distributed Computing
Placement of Read-Write Web Proxies in the Internet
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Choosing Replica Placement Heuristics for Wide-Area Systems
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Optimal Placement of Web Proxies for Tree Networks
EEE '04 Proceedings of the 2004 IEEE International Conference on e-Technology, e-Commerce and e-Service (EEE'04)
Distributed server replication in large scale networks
NOSSDAV '04 Proceedings of the 14th international workshop on Network and operating systems support for digital audio and video
Optimizing the Placement of Internet TAPs in Wireless Neighborhood Networks
ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
Latency-Driven Replica Placement
SAINT '05 Proceedings of the The 2005 Symposium on Applications and the Internet
A Self-Organizing Lookup Service for Dynamic Ambient Services
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Optimal Replica Placement under TTL-Based Consistency
IEEE Transactions on Parallel and Distributed Systems
Self-organizing Replica Placement - A Case Study on Emergence
SASO '07 Proceedings of the First International Conference on Self-Adaptive and Self-Organizing Systems
Group Anti-Entropy - Achieving Eventual Consistency in Mobile Service Environments
MDM '07 Proceedings of the 2007 International Conference on Mobile Data Management
Object replication strategies in content distribution networks
Computer Communications
Constrained mirror placement on the Internet
IEEE Journal on Selected Areas in Communications
A node placement heuristic to encourage resource sharing in mobile computing
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part III
Journal of Systems and Software
LOCCAM - loosely coupled context acquisition middleware
Proceedings of the 28th Annual ACM Symposium on Applied Computing
| Hi-index | 0.00 |
Ambient Intelligence (AmI) is an IT concept by which mobile users shall be seamlessly supported in their everyday activities. This includes interactions with remote resources as well as with their current physical environment. We have developed the so-called Ad hoc Service Grid (ASG) infrastructure that supports the latter form of interactions. It allows operators to cover arbitrary locations with ambient services in a drop-and-deploy fashion. An ambient service may autonomously distribute (replicate and migrate) within an ASG network to optimize its availability, response times, and network usage. In this article, we propose a fully decentralized, dynamic, and adaptive service placement algorithm for AmI environments like the ASG. This algorithm achieves a coordinated global placement pattern that minimizes the communication costs without any central controller. It does not even require additional communication among the replicas. Moreover, placement patterns stabilize if no changes occur in the environment while replicas still retain their ability to adapt. Mechanisms for self-organized placement of services are very important for AmI environments in general since they allow for autonomous adaptations to dynamic changes and, thus, remove the need for manual (re)configuration of a running system. We present a detailed evaluation of the algorithm's performance and compare it with three other algorithms to show its competitiveness. Furthermore, we discuss how the desired self-organizing behavior emerges from the interactions of a few simple, local rules that govern the individual placement decisions. In order to do so, we give an in-depth analysis of a series of emergent effects that are not directly encoded into the placement algorithm but stem from its collective dynamics.