Snapshot simulation of internet traffic: fast and accurate for heavy-tailed flows

Simulations involving processes at very different time scales can be so slow to converge that starting in one state and waiting for a representative sample of the state space to be explored is not feasible. Under these circumstances we need to find a different way to explore a representative range of states in order to obtain valid results in a reasonable time. Internet traffic is an example of this situation. This is due to the fact that it is made up of clearly identifiable flows and a significant proportion of overall bytes occur in long-lived flows, whose overall duration will in many cases be longer than can be simulated. In this paper we develop a method which constructs a "randomly selected state" of Internet traffic from scratch

• Type: Conference
• Year: 2008
• Where: SIMUTOOLS
• Authors: R. G. Addie
• Keywords: Communications, Internet Traffic, Reasonable Time, Simulations Involving Processes, SIMUTOOLS 2008