@techreport{ Melander02,
  author = {B. Melander and M. Bj�rkman},
  title = {Trace-Driven Network Path Emulation},
  year = {2002},
  institution = {Department of Information Technology, Uppsala University, Sweden},
  number = {2002-037},
  adress = {Uppsala University, Uppsala},
  type = {Technical report},
  submitter = {Stefan Alfredsson},
  bibdate = {November 9,  2004,  4:35 pm},
  annote = {This paper reports on on-going work where a trace-driven approach to network path emulation is investigated. Time stamped probe packets are sent along a network path whereby a probe packet trace can be generated. It basically contains the send times and the one-way delays/loss indications of the probe packets. Inside the emulator, the probe packet trace is used by a loss model and a delay model. These determine if a packet should be dropped or what the delay of the packet should be. Three loss models and three delay models are evaluated. For non-responsive UDP-based flows, the trace-driven loss and delay models that determine loss and delay based on loss-rates and delay distribution parameters calculated across the probe packet trace using a small gliding window are found to perform best. For adaptive TCP flows, none of the evaluated trace-driven models performs well. Instead, the Bernoulli loss model and an independent average delay model performs best.}
}

{"_id":"bJxAv45nJDajLDfyS","bibbaseid":"melander-bjrkman-tracedrivennetworkpathemulation-2002","downloads":0,"creationDate":"2015-12-04T23:32:58.929Z","title":"Trace-Driven Network Path Emulation","author_short":["Melander, B.","Bj�rkman, M."],"year":2002,"bibtype":"techreport","biburl":"http://www.cs.kau.se/cs/prtp/prtp.bib","bibdata":{"adress":"Uppsala University, Uppsala","annote":"This paper reports on on-going work where a trace-driven approach to network path emulation is investigated. Time stamped probe packets are sent along a network path whereby a probe packet trace can be generated. It basically contains the send times and the one-way delays/loss indications of the probe packets. Inside the emulator, the probe packet trace is used by a loss model and a delay model. These determine if a packet should be dropped or what the delay of the packet should be. Three loss models and three delay models are evaluated. For non-responsive UDP-based flows, the trace-driven loss and delay models that determine loss and delay based on loss-rates and delay distribution parameters calculated across the probe packet trace using a small gliding window are found to perform best. For adaptive TCP flows, none of the evaluated trace-driven models performs well. Instead, the Bernoulli loss model and an independent average delay model performs best.","author":["Melander, B.","Bj�rkman, M."],"author_short":["Melander, B.","Bj�rkman, M."],"bibdate":"November 9, 2004, 4:35 pm","bibtex":"@techreport{ Melander02,\n author = {B. Melander and M. Bj�rkman},\n title = {Trace-Driven Network Path Emulation},\n year = {2002},\n institution = {Department of Information Technology, Uppsala University, Sweden},\n number = {2002-037},\n adress = {Uppsala University, Uppsala},\n type = {Technical report},\n submitter = {Stefan Alfredsson},\n bibdate = {November 9, 2004, 4:35 pm},\n annote = {This paper reports on on-going work where a trace-driven approach to network path emulation is investigated. Time stamped probe packets are sent along a network path whereby a probe packet trace can be generated. It basically contains the send times and the one-way delays/loss indications of the probe packets. Inside the emulator, the probe packet trace is used by a loss model and a delay model. These determine if a packet should be dropped or what the delay of the packet should be. Three loss models and three delay models are evaluated. For non-responsive UDP-based flows, the trace-driven loss and delay models that determine loss and delay based on loss-rates and delay distribution parameters calculated across the probe packet trace using a small gliding window are found to perform best. For adaptive TCP flows, none of the evaluated trace-driven models performs well. Instead, the Bernoulli loss model and an independent average delay model performs best.}\n}","bibtype":"techreport","id":"Melander02","institution":"Department of Information Technology, Uppsala University, Sweden","key":"Melander02","number":"2002-037","submitter":"Stefan Alfredsson","title":"Trace-Driven Network Path Emulation","type":"Technical report","year":"2002","bibbaseid":"melander-bjrkman-tracedrivennetworkpathemulation-2002","role":"author","urls":{},"downloads":0},"search_terms":["trace","driven","network","path","emulation","melander","bj�rkman"],"keywords":[],"authorIDs":[],"dataSources":["6WGcSu2Ku7pZzqCcg"]}