We propose a fluid simulation algorithm for generalized processor sharing (GPS) servers. We analyze the complexity of the proposed algorithm and show the advantage of fluid simulation, compared to packet-level simulation. Numerical results show that the simulation time can be much reduced by admitting some performance errors as the load is heavier and the self-similarity is higher.
['Ju Yong Lee', 'Sunggon Kim', 'Dan Keun Sung']
Fluid simulation for self-similar traffic in generalized processor sharing servers