Design issues and performance improvements in routing strategy on the Internet workflow

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.

Dynamic update of shortest path tree in OSPF

“…Thus, it is crucial that algorithms for dynamically updating SPT are introduced to handle link state changes in a network efficiently. The problem to derive the shortest path is a subject of continual research interest [7,8,9]. In order to achieve less computation time, the updating process to separate weightincrease operations and weight-decrease operations is proposed for the dynamic SPT updates [10].…”

Dynamic shortest path tree update for multiple link state decrements

“…Dynamic SPT update approaches are proposed in recent years on network routing for path determination, with the central problem being to reduce costs, particularly computation times [1], [2], [3], [4]. The case of multiple link state changes deserves more attention for dynamic SPT update.…”