A Rapid Algorithm to Find Replacement Services for K-Shortest Path Problem with QoS Constraints
暂无分享,去创建一个
[1] Klara Nahrstedt,et al. SpiderNet: an integrated peer-to-peer service composition framework , 2004, Proceedings. 13th IEEE International Symposium on High performance Distributed Computing, 2004..
[2] Vladimir Tosic,et al. On the Dynamic Manipulation of Classes of Service for XML Web Services , 2003 .
[3] Damien Magoni,et al. Internet topology modeler based on map sampling , 2002, Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications.
[4] Tao Yu,et al. QCWS: an implementation of QoS-capable multimedia web services , 2003, Fifth International Symposium on Multimedia Software Engineering, 2003. Proceedings..
[5] Subhash Suri,et al. Vickrey prices and shortest paths: what is an edge worth? , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[6] Subhash Suri,et al. Finding the k shortest simple paths , 2007, ALENEX.
[7] Spyros Tragoudas,et al. An efficient algorithm for finding a path subject to two additive constraints , 2002, Comput. Commun..
[8] Klara Nahrstedt,et al. QoS-assured service composition in managed service overlay networks , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..
[9] Vladimir Tosic,et al. Software Configuration Management Related to Management of Distributed Systems and Services and Advanced Service Creation , 2001 .
[10] David Eppstein,et al. Finding the k shortest paths , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[11] Tao Yu,et al. Efficient algorithms for Web services selection with end-to-end QoS constraints , 2007, TWEB.
[12] Tao Yu,et al. Service Selection Algorithms for Web Services with End-to-End QoS Constraints , 2004, CEC.
[13] Tao Yu,et al. Adaptive algorithms for finding replacement services in autonomic distributed business processes , 2005, Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005..