%0 Journal Article %1 noauthororeditor %A Chou, Shih-Chien %A Chiang, Chih-Yang %D 2012 %J International Journal on Web Service Computing (IJWSC) %K (SLA) Meta Re-planning Service Web agreement level service %N 4 %P 15-38 %R 10.5121/ijwsc.2012.3402 %T A TWO-LEVELED WEB SERVICE PATH RE-PLANNING TECHNIQUE %U http://airccse.org/journal/jwsc/papers/3412ijwsc02.pdf %V 3 %X Web service paths can accomplish customer requirements. During the execution of a web service path, violations of service level agreements (SLAs) will cause the path to be re-planed (healed). Existing re-planning techniques generally suffer from shortcomings of ignoring the effect of requirement change. This paper proposes a two-leveled path re-planning technique (TLPRP), which offers the following features: (a) TLPRP is composed of both meta and physical levels. The meta level re-planning senses environment parameters (e.g., requirement change and analysis/design errors) and re-plan the affected component paths produced by system design. (b) The physical level re-planning algorithm possesses the ability of web service path composition. (c) The re-planning algorithm embeds an access control policy that computes a successful possibility for every path to facilitate avoiding execution failure caused by web service access failure.

@article{noauthororeditor, abstract = {Web service paths can accomplish customer requirements. During the execution of a web service path, violations of service level agreements (SLAs) will cause the path to be re-planed (healed). Existing re-planning techniques generally suffer from shortcomings of ignoring the effect of requirement change. This paper proposes a two-leveled path re-planning technique (TLPRP), which offers the following features: (a) TLPRP is composed of both meta and physical levels. The meta level re-planning senses environment parameters (e.g., requirement change and analysis/design errors) and re-plan the affected component paths produced by system design. (b) The physical level re-planning algorithm possesses the ability of web service path composition. (c) The re-planning algorithm embeds an access control policy that computes a successful possibility for every path to facilitate avoiding execution failure caused by web service access failure.}, added-at = {2019-12-03T07:40:28.000+0100}, author = {Chou, Shih-Chien and Chiang, Chih-Yang}, biburl = {https://www.bibsonomy.org/bibtex/2be3f6fc1e8027bcb3cbbb113e9e8d4ee/ijwsc}, doi = {10.5121/ijwsc.2012.3402}, interhash = {5231bd6094a37f5e66a7d65b9c1ad0fa}, intrahash = {be3f6fc1e8027bcb3cbbb113e9e8d4ee}, issn = {0976 - 9811 (Online) ; 2230 - 7702 (print)}, journal = {International Journal on Web Service Computing (IJWSC)}, keywords = {(SLA) Meta Re-planning Service Web agreement level service}, language = {English}, month = {December}, number = 4, pages = {15-38}, timestamp = {2019-12-03T07:40:28.000+0100}, title = {A TWO-LEVELED WEB SERVICE PATH RE-PLANNING TECHNIQUE}, url = {http://airccse.org/journal/jwsc/papers/3412ijwsc02.pdf}, volume = 3, year = 2012 }