Large-scale TCP models using optimistic parallel simulation
Garrett Yaun,Christopher D. Carothers,Shivkumar Kalyanaraman +2 more
- 10 Jun 2003
- pp 153-162
TL;DR: It is demonstrated that optimistic protocols are able to efficiently simulate large scale TCP scenarios for realistic, network topologies using a single Hyper-Threaded computing system costing less than $7,000 USD.
read more
Abstract: Internet data traffic is doubling each year, yet bandwidth does not appear to be growing as fast as expected and thus short falls in available bandwidth, particularly at the "last mile" may result. To address these bandwidth allocation and congestion problems, researchers are proposing new overlay networks that provide a high quality of service and a near lossless guarantee. However, the central question raised by these new services is what impact will they have in the large? To address these and other network engineering research questions, high performance simulation tools are required. However, to date, optimistic techniques have been viewed as operating outside of the performance envelope for Internet protocols, such as TCP, OSPF and BGP. We dispel those views and demonstrate that optimistic protocols are able to efficiently simulate large scale TCP scenarios for realistic, network topologies using a single Hyper-Threaded computing system costing less than $7000 USD. For our real world topology, we use the core AT&T US network. Our optimistic simulator yields extremely high efficiency and many of our performance runs produce zero rollbacks. Our compact modelling framework reduces the amount of memory required per TCP connection and thus our memory overhead per connection for one of our largest experimental network topologies was 2.6 KB. That value was comprised of all events used to model TCP packets, TCP connection state and routing information.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Scaling time warp-based discrete event execution to 104 processors on a Blue Gene supercomputer
Kalyan S. Perumalla
- 07 May 2007
TL;DR: An overview is given of a unique PDES engine that has been designed to support Time Warp-style optimistic parallel execution as well as a more generalized mixed, optimistic-conservative synchronization, designed to run on massively parallel architectures with minimal overheads.
66
Modeling a Million-Node Dragonfly Network Using Massively Parallel Discrete-Event Simulation
Misbah Mubarak,Christopher D. Carothers,Robert Ross,Philip Carns +3 more
- 10 Nov 2012
TL;DR: This paper focuses on the modeling and simulation of large-scale dragonfly networks using the Rensselaer Optimistic Simulation System (ROSS), and validates the results of the model against the cycle-accurate simulator “booksim” and compares the performance of booksim and ROSS for the dragonfly network model at modest scales.
60
Seven-O'Clock: A New Distributed GVT Algorithm Using Network Atomic Operations
David W. Bauer,Garrett Yaun,Christopher D. Carothers,Murat Yuksel,Shivkumar Kalyanaraman +4 more
- 01 Jun 2005
TL;DR: Good optimistic parallel performance on a cluster of state-of-the-art Itanium-II quad processor systems for both benchmark applications such as PHOLD and real-world applicationssuch as a large-scale TCP/Internet model is observed.
Optimistic Parallel Discrete Event Simulations of Physical Systems Using Reverse Computation
Yarong Tang,Kalyan S. Perumalla,Richard M. Fujimoto,Homa Karimabadi,Jonathan Driscoll,Yuri Omelchenko +5 more
- 01 Jun 2005
TL;DR: It is shown that reverse computation-based optimistic parallel execution can significantly reduce the execution time of a plasma simulation without requiring a significant amount of additional memory compared to conservative execution techniques.
Modeling Billion-Node Torus Networks Using Massively Parallel Discrete-Event Simulation
Ning Liu,Christopher D. Carothers +1 more
- 14 Jun 2011
TL;DR: The torus network model for a 16-million-node configuration shows a high degree of strong scaling when going from 1,024 cores to 32,768 cores on Blue Gene/L with a peak event-rate of nearly 5 billion events per second.
33
References
Congestion avoidance and control
Van Jacobson
- 01 Aug 1988
TL;DR: The measurements and the reports of beta testers suggest that the final product is fairly good at dealing with congested conditions on the Internet, and an algorithm recently developed by Phil Karn of Bell Communications Research is described in a soon-to-be-published RFC.
Virtual time
TL;DR: Virtual time is a new paradigm for organizing and synchronizing distributed systems which can be applied to such problems as distributed discrete event simulation and distributed database concurrency control.
2.3K
Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
Dah Ming Chiu,Raj Jain +1 more
TL;DR: It is shown that a simple additive increase and multiplicative decrease algorithm satisfies the sufficient conditions for con- vergence to an efficient and fair state regardless of the starting state of the network.
2K
Moore's law: past, present and future
TL;DR: Moore's Law has become the central driving force of one of the most dynamic of the world's industries as discussed by the authors, and it is viewed as a reliable method of calculating future trends as well, setting the pace of innovation, and defining the rules and the very nature of competition.
1.9K
•Journal Article
Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks.
Dah Ming Chiu,Raj Jain +1 more
TL;DR: In this article, it is shown that a simple additive increase and multiplicative decrease algorithm satisfies the sufficient conditions for con- vergence to an efficient and fair state regardless of the starting state of the network.
1.7K
Related Papers (5)
Richard M. Fujimoto
- 01 Jan 2000
David W. Bauer,Christopher D. Carothers,Akintayo Holder +2 more
- 22 Jun 2009