|
Published Articles >> Table of Contents >> Abstract
International Parallel and Distributed Processing Symposium (IPDPS'03)
p. 3a
Constrained Component Deployment in Wide-Area Networks Using AI Planning Techniques
Tatiana Kichkaylo, New York University
Anca Ivan, New York University
Vijay Karamcheti, New York University
Full Article Text:
  
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/IPDPS.2003.1213075
Send link to a friend
| Abstract |
|
Wide-area network applications are increasingly being built using component-based models, which enable integration of diverse functionality in modules distributed across the network. In such models, dynamic component selection and deployment enables an application to flexibly adapt to changing client and network characteristics, achieve load-balancing, and satisfy QoS requirements. Unfortunately, the problem of finding a valid component deployment is hard because one needs to decide on the set of components while satisfying various constraints resulting from application semantic requirements, network resource limitations, and interactions between the two. In this paper, we propose a general model for the component placement problem and present an algorithm for it, which is based on AI planning algorithms. We validate the effectiveness of our algorithm by demonstrating its scalability with respect to network size and number of components in the context of deployments generated for two example applications — a security-sensitive mail service, and a webcast service — in a variety of network environments.
|
 Additional Information
|
Citation:
Tatiana Kichkaylo, Anca Ivan, Vijay Karamcheti,
"Constrained Component Deployment in Wide-Area Networks Using AI Planning Techniques,"
ipdps,
p. 3a,
International Parallel and Distributed Processing Symposium (IPDPS'03),
2003
|
|
