Fluid Simulation of Large Scale Networks: Issues and Tradeoffs

Abstract

Traditional discrete-event packet-level approaches to simulating computer networks become computationally infeasible as the number of network nodes or their complexity increases. An alternative approach, in which packet-level traffic sources are replaced by fluid sources, has been proposed to address this challenge. In this paper we compare the amount of computational effort needed to simulate a network using a packet-level approach versus a fluid-based approach. We quantitatively characterize the amount of computational effort needed by each approach using the notion of a simulation’s event rate, and derive expressions for the event rate of a packet and fluid flow at both the input and output sides of a queue. We show that fluid simulation can require less computational effort for simple networks. However, as the network size and complexity grow, the so-called ”ripple effect” can result in fluid simulations becoming more expensive than their packet-level counterparts. This suggests that time-driven (approximate) fluid simulation techniques may be needed to efficiently simulate large scale networks.

Extracted Key Phrases

6 Figures and Tables

Statistics

01020'00'02'04'06'08'10'12'14'16
Citations per Year

125 Citations

Semantic Scholar estimates that this publication has 125 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Liu1999FluidSO, title={Fluid Simulation of Large Scale Networks: Issues and Tradeoffs}, author={Benyuan Liu and Yang Guo and James F. Kurose and Donald F. Towsley and Weibo Gong}, booktitle={PDPTA}, year={1999} }