Research on scheduling algorithm based on distributed dynamic bandwidth allocation

The thesis is based on the shared networks and relative message model. First it analyzes the attributes of the network control system scheduling algorithms, and then proposes a scheduling algorithm based on distributed dynamic bandwidth allocation. At last it describes the algorithm from the bandwidth allocation and the realization of distributed dynamic scheduling. The proposed scheduling can satisfy different time precision demands, and with efficient bandwidth utilization, much more flexibility and greater fault tolerance.