Bandwidth allocation for fluid input generalized processor sharing servers

Generalized processor sharing (GPS) service policy is a scheduling algorithm to allocate the bandwidth of a queueing system with multi-class input traffic. Simulating the GPS system in realistic traffic environments requires a large amount of time. Thus, fluid simulation is useful because it requires much less time. We analyze the bandwidth allocation for fluid simulation in GPS servers, in which the traffic into the server is treated as fluid. Three properties which characterize GPS servers with fluid input are discussed. We show that there exists a unique bandwidth allocation with the properties. It is shown that our previously proposed algorithm gives the unique bandwidth allocation and it is equivalent to the well-known Newton-Rapson method. In numerical study, the performance of finding the unique bandwidth allocation based on other known root finding methods is compared with that of our previous algorithm. We also investigate the impact of the length of the unit time on the accuracy of the performance measures.

[1]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[2]  Sally Floyd,et al.  Wide area traffic: the failure of Poisson modeling , 1995, TNET.

[3]  Guanhua Yan,et al.  Simulation of large scale networks using SSF , 2003, Proceedings of the 2003 Winter Simulation Conference, 2003..

[4]  Vern Paxson,et al.  Fast, approximate synthesis of fractional Gaussian noise for generating self-similar network traffic , 1997, CCRV.

[5]  Dan Keun Sung,et al.  Fluid simulation for self-similar traffic in generalized processor sharing servers , 2003, IEEE Communications Letters.

[6]  Dan Keun Sung,et al.  Bandwidth Optimization for Internet Traffic in Generalized Processor Sharing Servers , 2005, IEEE Trans. Parallel Distributed Syst..

[7]  Walter Willinger,et al.  Proof of a fundamental result in self-similar traffic modeling , 1997, CCRV.

[8]  Walter Willinger,et al.  Self-similarity through high-variability: statistical analysis of Ethernet LAN traffic at the source level , 1997, TNET.

[9]  Azer Bestavros,et al.  Self-similarity in World Wide Web traffic: evidence and possible causes , 1996, SIGMETRICS '96.

[10]  Raymond A. Marie,et al.  Loss characterization in high-speed networks through simulation of fluid models , 2001, Telecommun. Syst..

[11]  William H. Press,et al.  Numerical recipes in C , 2002 .

[12]  George Kesidis,et al.  Feasibility of fluid event-driven simulation for ATM networks , 1996, Proceedings of GLOBECOM'96. 1996 IEEE Global Telecommunications Conference.

[13]  Yorai Wardi,et al.  Variational Bounds and Sensitivity Analysis of Traffic Processes in Continuous Flow Models , 2001, Discret. Event Dyn. Syst..

[14]  Wei-Bo Gong,et al.  Time-driven fluid simulation for high-speed networks , 1999, IEEE Trans. Inf. Theory.

[15]  David M. Nicol,et al.  Fluid-based Simulation of Communication Networks using SSF , 1999 .

[16]  Donald F. Towsley,et al.  A study of networks simulation efficiency: fluid simulation vs. packet-level simulation , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[17]  Walter Willinger,et al.  Long-range dependence in variable-bit-rate video traffic , 1995, IEEE Trans. Commun..

[18]  Hui Zhang,et al.  Service disciplines for guaranteed performance service in packet-switching networks , 1995, Proc. IEEE.