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

Authors:
Shin-Jer Yang
Affiliations:
Department of Computer and Information Science, Soochow University, Taipei, Taiwan
Venue:
International Journal of Network Management
Year:
2003

Citing 16
Cited 0

Scaling Algorithms for the Shortest Paths Problem

SIAM Journal on Computing
Dynamic change within workflow systems

COCS '95 Proceedings of conference on Organizational computing systems
Shortest paths algorithms: theory and experimental evaluation

Mathematical Programming: Series A and B
End-to-end routing behavior in the Internet

Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
From Centralized Workflow Specification to Distributed WorkflowExecution

Journal of Intelligent Information Systems - Special issue on workflow management systems
Workflow evolution

Data & Knowledge Engineering - Special issue on ER '96
Dynamic Routing and Operational Controls in Workflow Management Systems

Management Science
Undirected single-source shortest paths with positive integer weights in linear time

Journal of the ACM (JACM)
Adaptive-Trail Routing and Performance Evaluation in Irregular Networks Using Cut-Through Switches

IEEE Transactions on Parallel and Distributed Systems
Process-oriented architectures for electronic commerce and interorganizational workflow

Information Systems
High-Performance Routing in Networks of Workstations with Irregular Topology

IEEE Transactions on Parallel and Distributed Systems
A reflective infrastructure for workflow adaptability

Data & Knowledge Engineering
Scalable Hardware Priority Queue Architectures for High-Speed Packet Switches

IEEE Transactions on Computers
At the Core of IP Networks: Link-State Routing Protocols

IEEE Internet Computing
Tutorial: SNMP, SNMPv2 and CMIP - the technologies for multivendor network management

Computer Communications
Research: The implementation of a dynamic management scheme for guaranteed-performance connections

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

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.