跳至主導覽 跳至搜尋 跳過主要內容

Service selection algorithms for web services with end-to-end QoS constraints

  • University of California at Irvine

研究成果: 圖書/報告稿件的類型 › 會議稿件 › 同行評審

140 引文 斯高帕斯(Scopus)

摘要

Web services are new forms of Internet software that can be universally deployed and invoked using standard protocol. Services from different providers can be integrated to provide composite services. In this paper, we study the end-to-end QoS issues of composite service by utilizing a QoS broker that is responsible for coordinating the individual service component to meet the quality constraint. We design the service selection algorithms used by QoS brokers to meet end-to-end QoS constraints. The objective of the algorithms is to maximize the user-defined utility while meeting the end-to-end delay constraint. We model the problem as the Multiple Choice Knapsack Problem (MCKP) and provide efficient solutions. The algorithms are tested for their performance.

原文英語
主出版物標題Proceedings - IEEE International Conference on E-Commerce Technology, CEC 2004
編輯M. Bichler, J.-Y. Chung
頁面129-136
頁數8
出版狀態已出版 - 2004
對外發佈是
事件Proceedings - IEEE International Conference on E-Commerce Technology, CEC 2004 - San Diego, CA, 美國
持續時間: 06 07 2004 → 09 07 2004

出版系列

名字Proceedings - IEEE International Conference on E-Commerce Technology, CEC 2004

Conference

ConferenceProceedings - IEEE International Conference on E-Commerce Technology, CEC 2004
國家/地區美國
城市San Diego, CA
期間06/07/04 → 09/07/04

指紋

深入研究「Service selection algorithms for web services with end-to-end QoS constraints」主題。共同形成了獨特的指紋。

引用此