%0 Journal Article %A MA Liang %A QIAN Xuezhong %T QoS-based Shortest Path Determination Method of Web Service Call %D 2015 %R 10.3969/j.issn.1000-3428.2015.09.018 %J Computer Engineering %P 103-107 %V 41 %N 9 %X Aiming at the problems that Web service selection is non-targeted and Web service call is low-efficiency,this paper proposes a shortest path determination method of Web service call.It puts the system response time,safety and price attributes into service call algorithm to make the Web services which meet user needs most.It abstracts the process of Web service call into Activity on Edge(AOE) network diagram representation by weighted directed acyclic graph.The method combines shortest path selection algorithm to calculate the shortest path which a source point to the rest of the graph vertices and get the AOE network diagram of shortest path of Web service call.Application result on Systems,Applications and Products in Data Processing(SAP) platform shows that the method reduce the response time cycle of service call,and improve the overall efficiency. %U http://www.ecice06.com/EN/10.3969/j.issn.1000-3428.2015.09.018