Files in this item



application/pdfMinimum User-pe ... in Service Composition.pdf (257kB)
(no description provided)PDF


Title:Minimum User-perceived Interference Routing in Service Composition
Author(s):Xiao, Li; Nahrstedt, Klara
Abstract:Service Composition is a promising technology for providing on-demand composed services in dynamic and loosely coupled peer-to-peer (P2P) networks. Because of system dynamics, such as the peer leaving from the system, end users may perceive interference from service disruptions. How to minimize the userperceived interference and provide Quality of Service guarantees to the composite services thus becomes important and challenging. In this paper, we take a novel approach to study the problem of minimum interference service composition with QoS guarantees. First, we propose a general analytic framework to model the interference and its intensity to the end users due to system dynamics. Based on this framework, the minimum interference routing problem is formulated. Then, we present an optimal solution to the problem through dynamic programming and investigate some optimization simplifications in special cases. We further propose a heuristic measure for fast interference calculation and design efficient routing algorithms by exploiting the local path recovery and reliable service paths. Our analysis and extensive simulations demonstrate that our model and algorithms can achieve much better performance than the traditional methods in finding service paths, with respect to decreasing the interference to end users, especially in the scenarios of stringent QoS requirement, highly dynamic networks, or the type of impatient users.
Issue Date:2005-07
Genre:Technical Report
Other Identifier(s):UIUCDCS-R-2005-2609
Rights Information:You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format, BUT this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the University of Illinois at Urbana-Champaign Computer Science Department under terms that include this permission. All other rights are reserved by the author(s).
Date Available in IDEALS:2009-04-20

This item appears in the following Collection(s)

Item Statistics