Robust service composition
by Fischer, Jeffrey M., Ph.D., UNIVERSITY OF CALIFORNIA, LOS ANGELES, 2008, 261 pages; 3354394

Abstract:

The development of the HTTP protocol and web services have made it convenient to build large-scale systems out of loosely-coupled services. Key advantages of this approach include the ability to leverage existing applications in new contexts, the incremental evolution of systems, and better scalability/availability through replication of services.

Unfortunately, service-oriented architectures have a number of drawbacks. Implementations must account for differing data representations or protocols, remote system failures, and asynchronous processing. New failure modes are introduced, such as hangs, deadlocks, and data inconsistencies. Securing a service-oriented architecture is frequently more difficult than for a monolithic architecture due to the larger attack “surface area” and differing security frameworks across the individual services. Finally, testing and debugging service-oriented architectures is difficult due to the lack of a global perspective, non-determinism, and the challenge of building tools which work across heterogeneous systems.

This dissertation investigates new approaches to address these issues. I show that service-oriented architectures can be made more robust through better abstractions together with lightweight, compositional tools to automatically enforce the abstractions. Four specific problems are addressed: lost messages in asynchronous programs, the consistency of long running transactions, reconciliation of access control policies, and the trust by end users of composed applications. For each issue, I develop a operational model which captures the salient aspects of service-oriented systems. From the models, I define new abstractions, which accomplish the goals of the original system while avoiding the issues under consideration. Practical tools to enforce the abstractions are then derived from the models, either by construction or through the lightweight verification of developer artifacts. Finally, each tool is evaluated using performance tests and case studies.

 
AdviserRupak Majumdar
SchoolUNIVERSITY OF CALIFORNIA, LOS ANGELES
SourceDAI/B 70-04, p. , Aug 2009
Source TypeDissertation
SubjectsComputer science
Publication Number3354394
Adobe PDF Access the complete dissertation:
 

» Find an electronic copy at your library.
  Use the link below to access a full citation record of this graduate work:
  http://gateway.proquest.com/openurl%3furl_ver=Z39.88-2004%26res_dat=xri:pqdiss%26rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation%26rft_dat=xri:pqdiss:3354394
  If your library subscribes to the ProQuest Dissertations & Theses (PQDT) database, you may be entitled to a free electronic version of this graduate work. If not, you will have the option to purchase one, and access a 24 page preview for free (if available).

About ProQuest Dissertations & Theses
With over 2.3 million records, the ProQuest Dissertations & Theses (PQDT) database is the most comprehensive collection of dissertations and theses in the world. It is the database of record for graduate research.

The database includes citations of graduate works ranging from the first U.S. dissertation, accepted in 1861, to those accepted as recently as last semester. Of the 2.3 million graduate works included in the database, ProQuest offers more than 1.9 million in full text formats. Of those, over 860,000 are available in PDF format. More than 60,000 dissertations and theses are added to the database each year.

If you have questions, please feel free to visit the ProQuest Web site - http://www.proquest.com - or call ProQuest Hotline Customer Support at 1-800-521-3042.