Addie, Ron (2008) Snapshot simulation of internet traffic: fast and accurate for heavy-tailed flows. In: 1st International Workshop on the Evaluation of Quality of Service through Simulation in the Future Internet (QoSim 2008) , 3-8 March 2008, Marseille, France.
Text (Accepted Version)
[Abstract]: 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 -- snapshot simulation. The technique is applied to a realistic model of Internet traffic and is used to confirm theoretical results for the number of active flows in a router which adopts either Fair Queueing or Shortest Job First as its queueing discipline. Snapshot simulations are also compared to conventional simulations of the same systems and it is shown that although convergence to the same results appears to be occurring, satisfactory accuracy cannot be obtained in a reasonable time by the conventional simulations. Simulation of a practical high-performance queue discipline, SJF-n, in which only the largest n flows at any time are de-prioritized, is also simulated and shown to give good performance for quite low n.
Statistics for this ePrint Item
|Item Type:||Conference or Workshop Item (Commonwealth Reporting Category E) (Paper)|
|Item Status:||Live Archive|
|Additional Information:||Deposited in accordance with the copyright policy of the publisher. © 2008 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purpose or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
|Faculty / Department / School:||Historic - Faculty of Sciences - Department of Maths and Computing|
|Date Deposited:||01 Feb 2008 05:51|
|Last Modified:||12 Jan 2015 05:01|
|Uncontrolled Keywords:||quality of service, importance sampling, long-lived flows, flow-completion-time|
|Fields of Research :||10 Technology > 1005 Communications Technologies > 100503 Computer Communications Networks
01 Mathematical Sciences > 0199 Other Mathematical Sciences > 019999 Mathematical Sciences not elsewhere classified
Actions (login required)
|Archive Repository Staff Only|