Simplify Stochastic QoS Admission Test for Composite Services through Lower Bound Approximation.
Kaibo WangXingshe ZhouShandan ZhouNing FuPublished in: IEEE SCC (2009)
Keyphrases
- lower bound
- composite services
- service composition
- upper bound
- quality of service
- admission control
- web services
- web service composition
- polynomial approximation
- linear programming relaxation
- objective function
- service oriented
- worst case
- approximation algorithms
- branch and bound
- np hard
- optimal solution
- database
- service oriented architecture
- business applications
- real time
- end to end
- service delivery
- regret bounds