Shin-Jer Yang
Abstract
This paper addresses some performance issues for routing design, and influencing parameters for workflow routing. In particular, we propose an adaptive routing control algorithm of workflow systems. First, we finalize some main factors that affect the workflow's performance. Then, we design a new routing control algorithm, called ARC (Adaptive Routing Control), which is based on Dijkstra's algorithm to find the efficient and flexible path of workflow. Hence, we develop a simulation program to evaluate the performance of the ARC algorithm and other two routing methods. Consequently, our results indicate that the performance of ARC is much better than other two conventional routing approaches.
- 1. Van Der Aalst WMP. Process oriented architectures for electronic commerce and interorganizational workflow. Information Systems December 1999; 24(8), 639-671. Google Scholar
Digital Library
- 2. Casati F, Ceri S, Pernici B, Pozzi G. Workflow evolution. Data and Knowledge Engineering January 1998; 24(3), 211-238. Google ScholarDigital Library
- 3. Cherkassky BV, Goldberg AV, Radzik T. Shortest paths algorithm: theory and experimental evaluation. Mathematical Programming May 1996; 73(2), 129-174. Google ScholarDigital Library
- 4. Edmond D, Ter Hofsted AHM. A reflective infrastructure for workflow adaptability. Data and Knowledge Engineering September 2000; 34(3), 271-304. Google ScholarDigital Library
- 5. Ellis S, Keddara K, Rozenberg H. Dynamic change within workflow systems. In Proceedings of ACM Conference on Organizational Computing Systems (COOCS 95), 1995. Google ScholarDigital Library
- 6. Goldberg AV. Scaling algorithms for the shortest paths problem. SIAM Journal on Computing June 1995; 24(3), 494-504. Google ScholarDigital Library
- 7. Grafen P, Aberer K, Hoffner Y, Ludwig H. Cross-Flow: Cross-organizational workflow management in dynamic virtual enterprises. International Journal of Computer Systems Science & Engineering September 2000; 15(5), 277-290.Google Scholar
- 8. Hunt R. SNMP, SNMPv2 and CMIP--The technologies for multi-vendor network management. Computer Communications March 1997; 20(2), 73-88. Google ScholarDigital Library
- 9. Kappel G, Lang P, Rausch-Schott S, Retschitzegger W. Workflow management based on object, rules, and roles. IEEE Bulletin of the Technical Committee on Data Engineering March 1995; 18(1), 11-18.Google Scholar
- 10. Kumar A, Zhao JL. Dynamic routing and operational controls in workflow management systems. Management Science February 1999; 45(2), 253-272. Google ScholarDigital Library
- 11. Metz C. On the wire-at the core of IP networks: link-state routing protocols. IEEE Internet Computing September 1999; 3(5), 72-77. Google ScholarDigital Library
- 12. Moon S-W, Rexford J, Shin KG. Scalable hardware priority queue architectures for high-speed packet switches. IEEE Transactions on Computers November 2000; 49(11), 1215-1227. Google ScholarDigital Library
- 13. Muth P, Wodtke D, Weissenfels J, Kotz Dittrich A, Weikum G. From centralized workflow specification to distributed workflow execution. Journal of Intelligent Information Systems March/April 1998; 10(2), 159-184. Google ScholarDigital Library
- 14. Parris C. Ferrari D. The implementation of a dynamic management scheme for guaranteed-performance connections. Computer Communications February 1998; 21(1), 1-23. Google ScholarDigital Library
- 15. Paxon V. End-to-end routing behavior in the Internet. SIGCOMM '96, August 1996, 25-38. Google ScholarDigital Library
- 16. Peterson LL, Davie BS. Computer Networks, Morgan Kaufmann, 2nd edition, New York, 2000, 292-301.Google Scholar
- 17. Qiao W, Ni LM, Rokicki T. Adaptive-trail routing and performance evaluation in irregular networks using cut-through switches. IEEE Transactions on Parallel and Distributed Systems November 1999; 10(11), 1138-1158. Google ScholarDigital Library
- 18. Silla F, Duato J. High performance routing in networks of workstations with irregular topology. IEEE Transactions on Parallel and Distributed Systems July 2000; 11(7), 699-719. Google ScholarDigital Library
- 19. Thorup M. Undirected single-source shortest paths with positive integer weights in linear time. Journal of the ACM 1999; 46(3), 362-394. Google ScholarDigital Library
- 20. Yang S-J, Yen C-K, Chou Y-C. Adaptive Routing Control of Workflow System on the Internet. 17th International Conference on Computers and Their Applications (CATA-2002) April 2002, 354-359.Google Scholar
- 21. Workflow Management Coalition, The Workflow Reference Model, WfMC-TC-1003, Version 1.1, available online at http://www.aiim.org/wfmc/ standards/docs/tc003v11.pdf, January 1995.Google Scholar
Index Terms
- Design issues and performance improvements in routing strategy on the internet workflow
Recommendations
A measurement study on the impact of routing events on end-to-end internet path performance
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communicationsExtensive measurement studies have shown that end-to-end Internet path performance degradation is correlated with routing dynamics. However, the root cause of the correlation between routing dynamics and such performance degradation is poorly ...
Performance modeling of DTN routing with heterogeneous and selfish nodes
The performance modeling study of Delay-Tolerant Network routing, in general, assumes the nodes to be homogeneous (in terms of features such as the coverage range) and uncompromised (in terms of forwarding messages). However, in realistic settings this ...
Comments