Download:
|
by Polly Huang, Deborah Estrin, John Heidemann
In Proceedings of the International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems
http://www.cs.utah.edu/~kwright/paper_summs/network_papers/../../papers/ns-abstractions.ps
Add To MetaCart
Abstract:
Due to the complexity and scale of the current Internet, large-scale simulation is an increasingly important tool to evaluate network protocol design. Parallel and distributed simulation is one appropriate approach to the simulation scalability problem, but it can require expensive hardware and have high overhead. We investigate a complimentary solution--simulation abstraction. Just as a custom simulator includes only details necessary for the task at hand, a general simulator can support configurable levels of detail for different simulations. We demonstrate two abstraction techniques in multicast simulations and show that they each help to gain one order of magnitude in performance. Although abstraction simulations are not identical to more detailed simulations, in many cases these differences are small and result in minimal changes in the conclusions drawn from simulations. 1.
Citations
|
924
|
A Reliable Multicast Framework for Light-weight Sessions and Application Level Framing
– Floyd, Jacobsen, et al.
- 1997
|
|
693
|
Virtual time
– Jefferson
- 1985
|
|
573
|
Receiver-driven layered multicast
– McCanne, Jacobson, et al.
- 1996
|
|
461
|
The PIM architecture for wide-area multicast routing
– Deering
- 1996
|
|
371
|
Distance Vector Multicast Routing Protocol
– Waitzman, Deering
- 1988
|
|
231
|
A reliable dissemination protocol for interactive collaborative applications
– Yavatkar, Griffioen, et al.
- 1995
|
|
192
|
Distributed Discrete-Event Simulation
– Misra
- 1985
|
|
191
|
Asynchronous Distributed Simulation via a Sequence of Parallel Computations
– Chandy, Misra
- 1981
|
|
184
|
Multicast Extensions to OSPF
– Moy
- 1994
|
|
163
|
A Quantitative Comparison of Graph-based Models for Internet Topology
– Zegura, Donahoo
- 1997
|
|
111
|
Core based trees
– Ballardie, Francis, et al.
- 1993
|
|
99
|
Maisie: A language for the design of efficient discrete-event simulations
– Bagrodia, Liao
- 1994
|
|
33
|
A dynamic bootstrap mechanism for rendezvous-based multicast routing
– Estrin, Helmy, et al.
- 1997
|
|
33
|
RMTP: A Reliable Multicast Transport
– Paul
- 1996
|
|
27
|
MOSPF: Analysis and experience
– Moy
- 1994
|
|
26
|
UCB/LBNL/VINT Network Simulator - NS (version 2)," http://wwwmash.cs.berkeley.edu/ns
– McCanne, Floyd
|
|
18
|
On the trade-off" between time and space in optimistic parallel discrete-event simulation
– Preiss, MaeIntyre, et al.
- 1992
|
|
17
|
Impact of Network Dynamics on End-to-End Protocols: Case Studies in TCP and Reliable Multicast
– Varadhan, Estrin, et al.
- 1998
|
|
16
|
Speedup vs. Simulation Granularity
– Ahn, Danzig
- 1996
|
|
15
|
Hybrid Simulation Models of Computer Systems
– Schwetman
- 1978
|
|
13
|
Computer Simulation A Practical Perspective
– McHaney
- 1991
|
|
7
|
Local Error Recovery
– Liu, Estrin, et al.
- 1997
|
|
4
|
Chandy and Jayadev Misra, Asynchronous Distributed Simulation via a Sequence of Parallel Computations
– M
- 1981
|
|
3
|
Parallel Instance Discrete-Event Simulation Using a Vector Uniprocessor
– Ohi, Preiss
- 1991
|
|
3
|
Network Time Protocol (v3), RFC 1305
– Mills
- 1992
|
|
3
|
A Scalable Reliable Multicast
– Liu
- 1996
|
