Show simple item record

dc.contributor.authorHe, Qi
dc.contributor.authorAmmar, Mostafa H. (Mostafa Hamed)
dc.contributor.authorRiley, George F.
dc.contributor.authorFujimoto, Richard M.
dc.date.accessioned2007-01-11T20:08:49Z
dc.date.available2007-01-11T20:08:49Z
dc.date.issued2002-10
dc.identifier.urihttp://hdl.handle.net/1853/13147
dc.description©2002 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or distribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.en
dc.descriptionPresented at the 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems (MASCOTS 2002), October 11-16, 2002
dc.description.abstractIn discrete-event network simulation, a significant portion of resources and computation are dedicated to the creation and processing of packet transmission events. For large-scale network simulations with a large number of high-speed data flows, the processing of packet events is the most time consuming aspect of the simulation. In this work we develop a technique that saves on the processing of packet events for TCP flows using the well established results showing that the average behavior of a TCP flow is predictable given a steady-state path condition. We exploit this to predict the average behavior of a TCP flow over a future period of time where steady-state conditions hold, thus allowing for a reduction (or elimination) of the processing required for packet events during this period. We consider two approaches to predicting TCP’s steady-state behavior: using throughput formulas or by direct monitoring of a flow’s throughput in a simulation. We design a simulation framework that provides the flexibility to incorporate this method of simulating TCP packet flows. Our goal is 1) to accommodate different network configurations, on/off flow behaviors and interaction between predicted flows and packet-based flows; and 2) to preserve the statistical behavior of every entity in the system, from hosts to routers to links, so as to maintain the accuracy of the network simulation as a whole. In order to illustrate the promise of this idea we implement it in the context of the ns2 simulation system. A set of experiments illustrate the speedup and approximation of the simulation framework under different scenarios and for different network performance metrics.en
dc.format.extent969358 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_USen
dc.publisherGeorgia Institute of Technologyen
dc.subjectDiscrete-event simulationen
dc.subjectPacket switchingen
dc.subjectStatistical analysisen
dc.subjectTransport protocolsen
dc.titleExploiting the Predictability of TCP’s Steady-state Behavior to Speed Up Network Simulationen
dc.typeProceedingsen
dc.contributor.corporatenameGeorgia Institute of Technology. College of Computing
dc.publisher.originalInstitute of Electrical and Electronics Engineers, Inc., New York


Files in this item

Thumbnail

This item appears in the following Collection(s)

  • MANIACS Publications [35]
    Papers, Pre/Post-Prints, and Presentations by Faculty and Students in the MANIACS program.

Show simple item record