TY - GEN
T1 - Minimum user-perceived interference routing in service composition
AU - Xiaot, Li
AU - Nahrstedt, Klara
PY - 2006
Y1 - 2006
N2 - Service Composition is a promising technology for providing on-demand services in dynamic and loosely coupled peerto-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 user-perceived interference and provide Quality of Service (QoS) 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 service 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 requirements, highly dynamic networks, or the type of impatient users.
AB - Service Composition is a promising technology for providing on-demand services in dynamic and loosely coupled peerto-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 user-perceived interference and provide Quality of Service (QoS) 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 service 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 requirements, highly dynamic networks, or the type of impatient users.
UR - http://www.scopus.com/inward/record.url?scp=39049144218&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=39049144218&partnerID=8YFLogxK
U2 - 10.1109/INFOCOM.2006.206
DO - 10.1109/INFOCOM.2006.206
M3 - Conference contribution
AN - SCOPUS:39049144218
SN - 1424402212
SN - 9781424402212
T3 - Proceedings - IEEE INFOCOM
BT - Proceedings - INFOCOM 2006
T2 - INFOCOM 2006: 25th IEEE International Conference on Computer Communications
Y2 - 23 April 2006 through 29 April 2006
ER -