Capturing TCP Burstiness in Light-weight Simulations. Huang, P. & Heidemann, J. In Proceedings of the SCS Conference on Communication Networks and Distributed Systems Modeling and Simulation, pages 90–96, Phoenix, Arizona, USA, January, 2001. Society for Computer Simulation. ![Capturing TCP Burstiness in Light-weight Simulations [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper abstract bibtex Burstiness in data traffic is emerging as a critical property that protocol analysis nowadays can no longer ignore. To preserve the kind of burstiness or scaling phenomena observed in aggregated TCP traffic, we develop a behavior model that captures TCP's window-based and closed-loop control. Through a novel modeling technique—\emphexhaustive state exploration, we systematically examine each TCP states over a restricted range of connection length and packet loss. This restricted rane covers the TCP behavior most common to web exchanges. When connections step outside this range (becoming too long or taking more than one loss) we preserve simulation accuracy by taking an \emphabstraction fault and changing to a more detailed model. By counting packets with interarrival times falling into certain critical intervals—round trip time (RTT) or retransmission timeout (RTO), we are abale to create finite state automaton (FSA) with states and transitions indicating rounds of back-to-back packet tranmissions. We demonstrate that an FSA approximation of TCP can produce \emphlight-weight simulation models of TCP suitable for background traffic, and that these models accurately reproduce multifractal scaling behavior in IP network traffic.
@InProceedings{Huang01a,
author = "Polly Huang and John Heidemann",
title = "Capturing {TCP} Burstiness in Light-weight Simulations",
booktitle = "Proceedings of the " # " {SCS} Conference on Communication Networks and Distributed Systems Modeling and Simulation",
year = 2001,
sortdate = "2001-01-01",
project = "ant, nocredit, vint",
jsubject = "network_simulation",
publisher = "Society for Computer Simulation",
address = "Phoenix, Arizona, USA",
month = jan,
pages = "90--96",
jlocation = "johnh: pafile",
jlocation = "johnh: folder: xxx",
url = "https://ant.isi.edu/%7ejohnh/PAPERS/Huang01a.html",
psurl = "https://ant.isi.edu/%7ejohnh/PAPERS/Huang01a.ps.gz",
pdfurl = "https://ant.isi.edu/%7ejohnh/PAPERS/Huang01a.pdf",
otherpsurl = "http://www.tik.ee.ethz.ch/%7ehuang/publication/fsa-sim-cnds01.ps.gz",
otherpdfurl = "http://www.tik.ee.ethz.ch/%7ehuang/publication/fsa-sim-cnds01.pdf.gz",
myorganization = "USC/Information Sciences Institute",
abstract = "
Burstiness in data traffic is emerging as a critical property that
protocol analysis nowadays can no longer ignore. To preserve the
kind of burstiness or scaling phenomena observed in aggregated TCP
traffic, we develop a behavior model that captures TCP's window-based
and closed-loop control. Through a novel modeling
technique---\emph{exhaustive state exploration}, we systematically
examine each TCP states over a restricted range of connection length
and packet loss. This restricted rane covers the TCP behavior most
common to web exchanges. When connections step outside this range
(becoming too long or taking more than one loss) we preserve
simulation accuracy by taking an \emph{abstraction fault} and changing
to a more detailed model. By counting packets with interarrival
times falling into certain critical intervals---round trip time (RTT)
or retransmission timeout (RTO), we are abale to create finite state
automaton (FSA) with states and transitions indicating rounds of
back-to-back packet tranmissions. We demonstrate that an FSA approximation
of TCP can produce \emph{light-weight simulation models} of TCP
suitable for background traffic, and that these models accurately reproduce
multifractal scaling behavior in IP network traffic.
",
}
Downloads: 0
{"_id":"qZ7w3HsrY3TDj8y7w","bibbaseid":"huang-heidemann-capturingtcpburstinessinlightweightsimulations-2001","author_short":["Huang, P.","Heidemann, J."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Polly"],"propositions":[],"lastnames":["Huang"],"suffixes":[]},{"firstnames":["John"],"propositions":[],"lastnames":["Heidemann"],"suffixes":[]}],"title":"Capturing TCP Burstiness in Light-weight Simulations","booktitle":"Proceedings of the SCS Conference on Communication Networks and Distributed Systems Modeling and Simulation","year":"2001","sortdate":"2001-01-01","project":"ant, nocredit, vint","jsubject":"network_simulation","publisher":"Society for Computer Simulation","address":"Phoenix, Arizona, USA","month":"January","pages":"90–96","jlocation":"johnh: folder: xxx","url":"https://ant.isi.edu/%7ejohnh/PAPERS/Huang01a.html","psurl":"https://ant.isi.edu/%7ejohnh/PAPERS/Huang01a.ps.gz","pdfurl":"https://ant.isi.edu/%7ejohnh/PAPERS/Huang01a.pdf","otherpsurl":"http://www.tik.ee.ethz.ch/%7ehuang/publication/fsa-sim-cnds01.ps.gz","otherpdfurl":"http://www.tik.ee.ethz.ch/%7ehuang/publication/fsa-sim-cnds01.pdf.gz","myorganization":"USC/Information Sciences Institute","abstract":"Burstiness in data traffic is emerging as a critical property that protocol analysis nowadays can no longer ignore. To preserve the kind of burstiness or scaling phenomena observed in aggregated TCP traffic, we develop a behavior model that captures TCP's window-based and closed-loop control. Through a novel modeling technique—\\emphexhaustive state exploration, we systematically examine each TCP states over a restricted range of connection length and packet loss. This restricted rane covers the TCP behavior most common to web exchanges. When connections step outside this range (becoming too long or taking more than one loss) we preserve simulation accuracy by taking an \\emphabstraction fault and changing to a more detailed model. By counting packets with interarrival times falling into certain critical intervals—round trip time (RTT) or retransmission timeout (RTO), we are abale to create finite state automaton (FSA) with states and transitions indicating rounds of back-to-back packet tranmissions. We demonstrate that an FSA approximation of TCP can produce \\emphlight-weight simulation models of TCP suitable for background traffic, and that these models accurately reproduce multifractal scaling behavior in IP network traffic. ","bibtex":"@InProceedings{Huang01a,\n\tauthor = \t\"Polly Huang and John Heidemann\",\n\ttitle = \t\"Capturing {TCP} Burstiness in Light-weight Simulations\",\n\tbooktitle = \t\"Proceedings of the \" # \" {SCS} Conference on Communication Networks and Distributed Systems Modeling and Simulation\",\n\tyear = \t\t2001,\n\tsortdate = \t\t\"2001-01-01\", \n\tproject = \"ant, nocredit, vint\",\n\tjsubject = \"network_simulation\",\n\tpublisher =\t\"Society for Computer Simulation\",\n\taddress =\t\"Phoenix, Arizona, USA\",\n\tmonth =\t\tjan,\n\tpages =\t\t\"90--96\",\n\tjlocation =\t\"johnh: pafile\",\n\tjlocation =\t\"johnh: folder: xxx\",\n\turl =\t\t\"https://ant.isi.edu/%7ejohnh/PAPERS/Huang01a.html\",\n\tpsurl =\t\t\"https://ant.isi.edu/%7ejohnh/PAPERS/Huang01a.ps.gz\",\n\tpdfurl =\t\"https://ant.isi.edu/%7ejohnh/PAPERS/Huang01a.pdf\",\n\totherpsurl =\t\"http://www.tik.ee.ethz.ch/%7ehuang/publication/fsa-sim-cnds01.ps.gz\",\n\totherpdfurl =\t\"http://www.tik.ee.ethz.ch/%7ehuang/publication/fsa-sim-cnds01.pdf.gz\",\n\tmyorganization =\t\"USC/Information Sciences Institute\",\n\tabstract = \"\nBurstiness in data traffic is emerging as a critical property that \nprotocol analysis nowadays can no longer ignore. To preserve the\nkind of burstiness or scaling phenomena observed in aggregated TCP\ntraffic, we develop a behavior model that captures TCP's window-based\nand closed-loop control. Through a novel modeling\ntechnique---\\emph{exhaustive state exploration}, we systematically\nexamine each TCP states over a restricted range of connection length\nand packet loss. This restricted rane covers the TCP behavior most\ncommon to web exchanges. When connections step outside this range\n(becoming too long or taking more than one loss) we preserve\nsimulation accuracy by taking an \\emph{abstraction fault} and changing\nto a more detailed model. By counting packets with interarrival\ntimes falling into certain critical intervals---round trip time (RTT)\nor retransmission timeout (RTO), we are abale to create finite state\nautomaton (FSA) with states and transitions indicating rounds of\nback-to-back packet tranmissions. We demonstrate that an FSA approximation\nof TCP can produce \\emph{light-weight simulation models} of TCP\nsuitable for background traffic, and that these models accurately reproduce\nmultifractal scaling behavior in IP network traffic.\n\",\n}\n\n\n","author_short":["Huang, P.","Heidemann, J."],"bibbaseid":"huang-heidemann-capturingtcpburstinessinlightweightsimulations-2001","role":"author","urls":{"Paper":"https://ant.isi.edu/%7ejohnh/PAPERS/Huang01a.html"},"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://bibbase.org/f/dHevizJoWEhWowz8q/johnh-2023-2.bib","dataSources":["YLyu3mj3xsBeoqiHK","fLZcDgNSoSuatv6aX","fxEParwu2ZfurScPY","7nuQvtHTqKrLmgu99"],"keywords":[],"search_terms":["capturing","tcp","burstiness","light","weight","simulations","huang","heidemann"],"title":"Capturing TCP Burstiness in Light-weight Simulations","year":2001}