A Node-Oriented Discrete Event Scheduling Algorithm Based on Finite Resource Model

Abstract

Discrete event simulation is the most important and essential part in network simulation. The node-oriented model of discrete event scheduling is a model that allocates computing resources as nodes and makes the discrete event simulation as a simulation task on nodes. In this article the reason of low performance in large-scale network simulation is analyzed, and an ideal node-oriented model of discrete event scheduling is presented and a resource-limited node-oriented model of discrete event scheduling by adding some restrictions on network resources is proposed. Then, the authors complete contrast experiments of the resource-limited node-oriented model of discrete event scheduling and NS2. Finally, packet loss in resource-limited node-oriented model of discrete event scheduling is examined. Also, NS2 is discussed in this article and the authors have proposed an improved method for the packet loss algorithm in a resource-limited node-oriented model of discrete event scheduling.