Premium
Design issues and performance improvements in routing strategy on the Internet workflow
Author(s) -
Yang ShinJer
Publication year - 2003
Publication title -
international journal of network management
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.373
H-Index - 28
eISSN - 1099-1190
pISSN - 1055-7148
DOI - 10.1002/nem.492
Subject(s) - computer science , workflow , static routing , policy based routing , distributed computing , link state routing protocol , computer network , routing (electronic design automation) , dynamic source routing , destination sequenced distance vector routing , equal cost multi path routing , multipath routing , dijkstra's algorithm , routing protocol , shortest path problem , database , theoretical computer science , graph
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. Copyright © 2003 John Wiley & Sons, Ltd.