Dynamic Scheduling of Multi-Agent in Agent-Based Distributed Network Management

Abstract

Agent technology has played an important role in distributed network management, and agent scheduling is an inevitable problem in a multi-agent system. This chapter introduces a network management scenario to support dynamic scheduling decisions. Some algorithms are proposed to decompose the whole network management task into several groups of sub-tasks. During the course of decomposition, different priorities are assigned to sub-tasks. Then, based on the priorities of these sub-tasks, a dynamic multi-agent scheduling algorithm based on dependences of sub-tasks is proposed. An experiment has been done with the decomposition algorithms, the results of which demonstrate the advantage of the algorithms. The performance test demonstrates that the competitive ratio of the dynamic scheduling algorithm is always smaller than that of the existing online scheduling algorithm, which indicates that the performance of the dynamic scheduling algorithm is better than the existing online scheduling algorithm. Finally, as an application example, the process of network stream management is presented. The authors hope that this scheduling method can give a new approach or suggestion for studying dynamic agents scheduling technology.