Constrained component deployment in wide-area networks using AI planning techniques

Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2003

Volumn , Issue , 2003, Pages 10-

  Kichkaylo, Tatiana ^a   Ivan, Anca ^a   Karamcheti, Vijay ^a  

^a POLYTECHNIC UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT SATISFACTION PROBLEMS; QUALITY OF SERVICE; SEMANTICS;

COMPONENT DEPLOYMENT; COMPONENT-BASED MODELS; DYNAMIC COMPONENT; NETWORK CHARACTERISTICS; NETWORK ENVIRONMENTS; NUMBER OF COMPONENTS; PLACEMENT PROBLEMS; QOS REQUIREMENTS;

WIDE AREA NETWORKS;

EID: 84947218130     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2003.1213075     Document Type: Conference Paper

References (26)

1. A. Blum and M. Furst. Fast planning through planning graph analysis. Artificial Intelligence, 90(1-2):281-300, 1997.
2. B. Bonet and H. Geffner. Planning as heuristic search: New results. In ECP, 1999.
3. F. Bustamante and K. Schwan. Active Streams: An approach to adaptive distributed systems. In HotOS-8, 2001.
4. K. Calvert, M. Doar, and E. Zegura. Modeling Internet topology. IEEE Communications Magazine, 35(6):160-163, June 1997.
5. M. B. Do and S. Kambhampati. Solving planning-graph by compiling it into CSP. In AIPS, pages 82-91, 2000.
6. I. Foster and C. Kesselman. Globus: A metacomputing infrastructure toolkit. Intl. J. of Supercomputer Applications and High Performance Computing, 11(2):115-128, 1997.
7. I. Foster, A. Roy, and V. Sander. A quality of service architecture that combines resource reservation and application adaptation. In IWQOS, 2000.
8. X. Fu, W. Shi, A. Akkerman, and V. Karamcheti. CANS: Composable, Adaptive Network Services infrastructure. USITS-3, 2001.
9. A. Ivan, J. Harman, M. Allen, and V. Karamcheti. Partitionable Services: A framework for seamlessly adapting distributed applications to heterogenous environments. In HPDC-11, 2002.
10. H. Kautz and B. Selman. Planning as satisfiability. In ECAI, 1992.
11. H. Kautz and B. Selman. BLACKBOX: A new approach to the application of theorem proving to problem solving. In AIPS, 1998.
12. H. Kautz and J. Walser. Integer optimization models of AI planning problems. Knowledge Engineering Review, 15(1):101-117, 2000.
13. T. Kichkaylo and A. Ivan. Network EDitor. http://www. cs. nyu. edu/pdsg/projects/partitionableservices/ ned/ned. htm, 2002.
14. J. Koehler. Planning under resource constraints. In ECAI, 1998.
15. J. Koehler, B. Nebel, J. Hoffmann, and Y. Dimopoulos. Extending planning graphs to an ADL subset. In ECP, 1997.
16. J. Lopez and D. O'Hallaron. Support for interactive heavyweight services. In HPDC-10, 2001.
17. D. McDermott. Using regression-match graphs to control search in planning. Artificial Intelligence, 109(1-2):111-159, 1999.
18. Microsoft Corporation. Microsoft . NET. http://www. microsoft. com/net/default. Asp.
19. Object Management Group. Corba. http://www. corba. org.
20. J. Penberthy and D. Weld. Temporal planning with continous change. In AAAI, 1994.
21. J. S. Penberthy and D. Weld. UCPOP: A sound, complete, partial order planner for ADL. In KR, 1992.
22. P. Reiher, R. Guy, M. Yarvis, and A. Rudenko. Automated planning for open architectures. OPENARCH, 2000.
23. S. Gribble et al. The Ninja architecture for robust Internetscale systems and services. Computer Networks, 35(4):473-497, 2001.
24. Sun Microsystems, Inc. Java(TM) 2 platform, Enterprise Edition.
25. S. Wolfman and D. Weld. Combining linear programming and satisfiability solving for resource planning. Knowledge Engineering Review, 2000.
26. D. Zhou and K. Schwan. Eager Handlers-communication optimization in Java-based distributed applications with reconfigurable fine-grained code migration. In 3rd Intl. Workshop on Java for Parallel and Distributed Computing, 2001.