Peer-based automatic configuration of pervasive applications

International Journal of Pervasive Computing and Communications

Volumn 1, Issue 4, 2005, Pages 251-264

  Handte, Marcu ^a   Becker, Christian ^a   Rothermel, Kurt ^a  

^a UNIVERSITY OF STUTTGART   (Germany)

Author keywords

Components; Configuration; Constraint Satisfaction; Pervasive Computing; Resources

Indexed keywords

EID: 52449123380     PISSN: 17427371     EISSN: 1742738X     Source Type: Journal    
DOI: 10.1108/17427370580000129     Document Type: Article

References (23)

1. Naveed Arshad, Dennis Heimbigner and Alexander L. Wolf. Deployment and dynamic reconfiguration planning for distributed software systems. ICTAI '03:15th IEEE International Conference on Tools with Artificial Intelligence, pp. 39–46, 2003.
2. A. R. Baker. Intelligent Backtracking on Constraint Satisfaction Problems: Experimental and Theoretical Results. PhD thesis, University of Oregon, 1995.
3. Christian Becker, Marcus Handte, Gregor Schiele and Kurt Rothermel. Pcom - a component system for pervasive computing. PERCOM '04: Proceedings of the Second IEEE International Conference on Pervasive Computing and Communications, pp. 67–76, 2004.
4. Christian Becker, Gregor Schiele, Holger Gubbels and Kurt Rothermel. Base - a micro-broker-based middleware for pervasive computing. PERCOM '03: Proceedings of the First IEEE International Conference on Pervasive Computing and Communications, pp. 443–451, 2003.
5. Antoine Beugnard, Jean-Marc Jezequel, Noel Plouzeau and Damien Watkins. Making components contract aware. IEEE Computer, 32(7):38–45, 1999.
6. Stephen A. Cook. The complexityof theorem-provingprocedures. STOC '71: Proceedings of the third annual ACM symposium on Theory of computing, pp. 151–158, New York, NY, 1971. ACM Press.
7. K. Decker and J. Li. Coordinated hospital patient scheduling. In ICMAS '98: Proceedings of the 3rd International Conference on Multi Agent Systems, p. 104, Washington, DC, 1998. IEEE Computer Society.
8. Edsger W. Dijkstra and C. S. Scholten. Termination detection for diffusing computations. Information Processing Letters, 11(1):1–4, 1980.
9. David Garlan, Daniel P. Siewiorek, Asim Smailagic and Peter Steenkiste. Project aura: Towards distraction-free pervasive computing. IEEE Pervasive Computing, 1(2):22—31, 2002.
10. Robert Grimm. One. world: Experiences with a pervasive computing architecture. IEEE Pervasive Computing, 3(3):22–30, 2004.
11. Xiaohui Gu, Klara Nahrstedt, Rong N. Chang and Christopher Ward. Qos-assured service composition in managed service overlay networks. ICDCS '03: Proceedings of the 23rd International Conference on Distributed Computing Systems, pp. 194, Washington, DC, 2003. IEEE Computer Society.
12. Ten-Hwang Lai and Li-Fen Wu. An (n -1)-resilient algorithm for distributed termination detection. IEEE Transactions Parallel Distributed Systems, 6(1):63–78, 1995.
13. F. Mattern. Global quiescence detection based on credit distribution and recovery. Information Processing Letters, 30(4):195–200, 1989.
14. P. J. Modi, H. Jung, M. Tambe, W.-M. Shen and S. Kulkarni. A dynamic distributed constraint satisfaction approach to resource allocation. CP '01: Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming, pp. 685–700. Springer-Verlag, 2001.
15. S. R. Ponnekanti, B. Johanson, E. Kiciman and A. Fox. Portability, extensibility and robustness in iros. PERCOM '03: Proceedings of the First IEEE International Conference on Pervasive Computing and Communications, pages 11–20. IEEE Computer Society, 2003.
16. B. Raman and R. Katz. An architecture for highly available wide-area service composition. Computer Communication Journal, 26(15):1727–1740, 2003.
17. M. Roman, C. Hess, R. Cerqueira, A. Ranganathan, R. H. Campbell and K. Nahrstedt. A middleware infrastructure for active spaces. IEEE Pervasive Computing, 1(4):74–83, 2002.
18. U. Saif, H. Pham, J. M. Paluska, J. Waterman, C. Terman and S. Ward. A case for goal-oriented programming semantics. UBISYS ‘03: Workshop on System Support for Ubiquitous Computing at UBICOMP ’03, pp. 1–8, 2003.
19. G. Schiele, C. Becker and K. Rothermel. Energy-efficient cluster-based service discovery. 11th ACM SIGOPS European Workshop, pp. 20–22, 2004.
20. K. Sycara and J. S. Liu. Multiagent coordination in tightly coupled task scheduling. 1996International Conference on Multi-Agent Systems, 1996.
21. D. Xu, K. Nahrstedt and D. Wichadakul. Qos and contention-aware multi-resource reservation. Cluster Computing, 4(2):95–107, 2001.
22. M. Yokoo, E. H. Durfee, T. Ishida and K. Kuwabara. The distributed constraint satisfaction problem: Formalization and algorithms. IEEE Transactions on Knowledge and Data Engineering, 10(5):673–685, 1998.
23. M. Yokoo and K. Hirayama. Algorithms for distributed constraint satisfaction: A review. Autonomous Agents and Multi-Agent Systems, 3(2):185–207, 2000.