Estimating real-time service process response time using server utilizations

Weiran Nie*, Jing Zhang, Kwei Jay Lin

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

9 Scopus citations

Abstract

In this paper, we study the algorithms to estimate the response times of service executions during real-time service composition. By using reservation schedules to derive server utilization, we can compute a more realistic response time for each service than its static execution time. Reservation schedules are kept in a system data structure called hierarchical TBTree (hTBTree). Using these response time estimates, integer programming or graph search algorithms can be used to compose a service process which is more likely to meet its end-to-end deadline. We conduct performance study to compare compositions with and without using server utilizations.

Original languageEnglish
Title of host publicationProceedings - 2010 IEEE International Conference on Service-Oriented Computing and Applications, SOCA 2010
DOIs
StatePublished - 2010
Externally publishedYes
Event2010 IEEE International Conference on Service-Oriented Computing and Applications, SOCA 2010 - Perth, WA, Australia
Duration: 13 12 201015 12 2010

Publication series

NameProceedings - 2010 IEEE International Conference on Service-Oriented Computing and Applications, SOCA 2010

Conference

Conference2010 IEEE International Conference on Service-Oriented Computing and Applications, SOCA 2010
Country/TerritoryAustralia
CityPerth, WA
Period13/12/1015/12/10

Fingerprint

Dive into the research topics of 'Estimating real-time service process response time using server utilizations'. Together they form a unique fingerprint.

Cite this