TY - GEN
T1 - Deployment of accountability monitoring agents in service-oriented architectures
AU - Zhang, Yue
AU - Panahi, Mark
AU - Lin, Kwei Jay
PY - 2007
Y1 - 2007
N2 - Service-oriented architecture (SOA) provides a flexible paradigm to compose dynamic service processes using individual services. However, service processes can be vastly complex, involving many service partners, thereby giving rise to difficulties in terms of pinpointing the service(s) responsible for problematic outcomes. In this research, we study efficient and effective mechanisms to deploy agents to monitor and detect undesirable services in a service process. We model the agent deployment problem as the classic Weighted Set Covering (WSC) problem and present agent selection solutions at different stages of service process deployment. We propose the MASS (Merit based Agent and Service Selection) algorithm that considers agent cost during QoS-based service composition by using a Meritagent cost heuristic metric. We also propose the IGA (Incremental Greedy Algorithm) to achieve fast agent selection when a service process is reconfigured after service failures. The performance study shows that our proposed algorithms are effective on saving agent cost and efficient on execution time.
AB - Service-oriented architecture (SOA) provides a flexible paradigm to compose dynamic service processes using individual services. However, service processes can be vastly complex, involving many service partners, thereby giving rise to difficulties in terms of pinpointing the service(s) responsible for problematic outcomes. In this research, we study efficient and effective mechanisms to deploy agents to monitor and detect undesirable services in a service process. We model the agent deployment problem as the classic Weighted Set Covering (WSC) problem and present agent selection solutions at different stages of service process deployment. We propose the MASS (Merit based Agent and Service Selection) algorithm that considers agent cost during QoS-based service composition by using a Meritagent cost heuristic metric. We also propose the IGA (Incremental Greedy Algorithm) to achieve fast agent selection when a service process is reconfigured after service failures. The performance study shows that our proposed algorithms are effective on saving agent cost and efficient on execution time.
UR - https://www.scopus.com/pages/publications/49949115278
U2 - 10.1109/CEC-EEE.2007.39
DO - 10.1109/CEC-EEE.2007.39
M3 - 会议稿件
AN - SCOPUS:49949115278
SN - 0769529135
SN - 9780769529134
T3 - Proceedings - The 9th IEEE International Conference on E-Commerce Technology; The 4th IEEE International Conference on Enterprise Computing, E-Commerce and E-Services, CEC/EEE 2007
SP - 305
EP - 312
BT - Proceedings - The 9th IEEE International Conference on E-Commerce Technology; The 4th IEEE International Conference on Enterprise Computing, E-Commerce and E-Services, CEC/EEE 2007
T2 - 9th IEEE International Conference on E-Commerce Technology; The 4th IEEE International Conference on Enterprise Computing, E-Commerce and E-Services, CEC/EEE 2007
Y2 - 23 July 2007 through 26 July 2007
ER -