Compositionality of handlers on intermediate servers in a web service architecture
department or school: Science, Faculty of
department or school: Computer Science, Department of
data provider: DSpace
degree campus: UBCV
creator: Forghanizadeh, Sara
issued: 2010-01-09T00:23:51Z
issued: 2006
related degree: Master of Science - MSc
degree grantor: University of British Columbia
description: This research addresses the problem of inter-operability among different components in a Web service architecture on the Internet. "Message Handlers" are pieces of code that intercept the message between clients and services in order to create/modify different pieces of the message, or to perform a processing task. For several reasons, such as management, reusability, optimization, routing, providing value-added services and transformations, it might be desirable to have chains of handlers on intermediate servers on the path between the client and the server; however, automatic selection of the set of handlers to be executed and their order of execution is still a problem. We try to solve this problem based on the type of the messages that are sent by the clients and the expected server input type. We leverage two algorithms based on formal language theory in order to solve the handler composition problem. Our case studies show how our approach could help in solving the problem of schema migration and version incompatibility in a large system such as eBay.
aggregated CHO: https://circle.library.ubc.ca/rest/handle/2429/17959
note: Compositionality of Handlers on Intermediate Servers in a Web Service Architecture by Sara Forghanizadeh M.Sc, The University of British Columbia, 2006 A THESIS SUBMITTED IN PARTIAL FULFILMENT OF THE REQUIREMENTS FOR THE DEGREE OF Master of Science in The Faculty of Graduate Studies • - (Computer Science) The University Of British Columbia August, 2006 © Sara Forghanizadeh, 2006 A b s t r a c t This research addresses the problem of inter-operability among different com-ponents in a Web service architecture on the Internet. "Message Handlers" are pieces of code that intercept the message between clients and services in order to create/modify different pieces of the message, or to perform a processing task. For several reasons, such as management, reusability, optimization, routing, pro-viding value-added services and transformations, it might be desirable to have chains of handlers on intermediate servers on the path between the client and the server; however, automatic selection of the set of handlers to be executed and their order of execution is still a problem. We try to solve this problem based on the type of the messages that are sent by the clients and the expected server input type. We leverage two algorithms based on formal language theory in order to solve the handler composition problem. Our case studies show how our approach could help in solving the problem of schema migration and version incompatibility in a large system such as eBay. ii Table of Contents Abstract ii Table of Contents iii List of Tables v List of Figures vi Acknowledgements vii 1 Introduction 1 2 Background Material 4 2.1 Service Oriented Architecture and Web services 4 2.2 X M L (Extensible Markup Language) 4 2.3 SOAP ' 6 2.4 Message Handlers and Intermediaries 6 3 System Overview 10 4 Handler Composition Algorithms for Atomic and Sequential Types 12 4.1 Atomic Types and Atomic Rules 12 4.2 Sequential Types and Parametric Rules 13 4.2.1 Context Free Grammar Solution 14 4.2.2 Subtracti…
has type: Thesis/Dissertation
date issued: 2006-11
is shown at: 10.14288/1.0051723
language: eng
degree discipline: Computer Science
provider: Vancouver : University of British Columbia Library
publisher: University of British Columbia
rights: For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use.
scholar level: Graduate
type: Text
identifier URI: http://hdl.handle.net/2429/17959