The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Dummynet: a simple approach to the evaluation of network protocols
Abstract
Network protocols are usually tested in operational networks or in simulated environments. With the former approach it is not easy to set and control the various operational parameters such as bandwidth, delays, queue sizes. Simulators are easier to control, but they are often only an approximate model of the desired setting, especially for what regards the various traffic generators (both producers and consumers) and their interaction with the protocol itself.In this paper we show how a simple, yet flexible and accurate network simulator - dummynet - can be built with minimal modifications to an existing protocol stack, allowing experiments to be run on a standalone system. dummynet works by intercepting communications of the protocol layer under test and simulating the effects of finite queues, bandwidth limitations and communication delays. It runs in a fully operational system, hence allowing the use of real traffic generators and protocol implementations, while solving the problem of simulating unusual environments. With our tool, doing experiments with network protocols is as simple as running the desired set of applications on a workstation.A FreeBSD implementation of dummynet , targeted to TCP, is available from the author. This implementation is highly portable and compatible with other BSD-derived systems, and takes less than 300 lines of kernel code.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Random early detection gateways for congestion avoidance
Floyd, S., & Jacobson, V. (1993) · IEEE/ACM Transactions on Networking · doi:10.1109/90.251892 · Cited by 6,290
Congestion avoidance and control
Jacobson, V. (1995) · ACM SIGCOMM Computer Communication Review · doi:10.1145/205447.205462 · Cited by 5,301
Congestion avoidance and control
Jacobson, V. (1988) · Symposium proceedings on Communications architectures and protocols · doi:10.1145/52324.52356 · Cited by 2,479
TCP Vegas: new techniques for congestion detection and avoidance
Brakmo, L. S., O'Malley, S. W., & Peterson, L. L. (1994) · ACM SIGCOMM Computer Communication Review · doi:10.1145/190809.190317 · Cited by 1,198
Improving TCI/IP performance over wireless networks
Balakrishnan, H., Seshan, S., Amir, E., & Katz, R. H. (1995) · Proceedings of the 1st annual international conference on Mobile computing and networking - MobiCom '95 · doi:10.1145/215530.215544 · Cited by 757
TCP Vegas: new techniques for congestion detection and avoidance
Brakmo, L. S., O'Malley, S. W., & Peterson, L. L. (1994) · Proceedings of the conference on Communications architectures, protocols and applications - SIGCOMM '94 · doi:10.1145/190314.190317 · Cited by 698
Keshav, S. (1988) · UC Berkeley · Cited by 182
Eliminating periodic packet losses in the 4.3-Tahoe BSD TCP congestion control algorithm
Wang, Z., & Crowcroft, J. (1992) · ACM SIGCOMM Computer Communication Review · doi:10.1145/141800.141801 · Cited by 133
Start-up dynamics of TCP's congestion control and avoidance schemes
Hoe, J. C. (1995) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 84
Cited by
Rethinking virtual network embedding: substrate support for path splitting and migration
Yu, M., Yi, Y., Rexford, J., & Chiang, M. (2008) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1355734.1355737 · Cited by 1,244
FAST TCP: Motivation, Architecture, Algorithms, Performance
Wei, D. X., Jin, C., Low, S. H., & Hegde, S. (2006) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2006.886335 · Cited by 955
Improving fairness, efficiency, and stability in HTTP-based adaptive video streaming with FESTIVE
Jiang, J., Sekar, V., & Zhang, H. (2012) · Proceedings of the 8th international conference on Emerging networking experiments and technologies · doi:10.1145/2413176.2413189 · Cited by 688
FAST TCP: motivation, architecture, algorithms, performance
Jin, C., Wei, D. X., & Low, S. H. (2005) · IEEE INFOCOM 2004 · doi:10.1109/infcom.2004.1354670 · Cited by 625
An experimental evaluation of rate-adaptation algorithms in adaptive streaming over HTTP
Akhshabi, S., Begen, A. C., & Dovrolis, C. (2011) · Proceedings of the second annual ACM conference on Multimedia systems · doi:10.1145/1943552.1943574 · Cited by 608
A Compound TCP Approach for High-Speed and Long Distance Networks
Tan, K., Song, J., Zhang, Q., & Sridharan, M. (2006) · Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications · doi:10.1109/infocom.2006.188 · Cited by 584
TCP Veno: TCP enhancement for transmission over wireless access networks
Fu, C. P., & Liew, S. C. (2003) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2002.807336 · Cited by 536
NIST Net: a Linux-based network emulation tool
Carson, M., & Santay, D. (2003) · ACM SIGCOMM Computer Communication Review · doi:10.1145/956993.957007 · Cited by 488
Optimizing the migration of virtual computers
Sapuntzakis, C. P., Chandra, R., Pfaff, B., Chow, J., Lam, M. S., & Rosenblum, M. (2002) · ACM SIGOPS Operating Systems Review · doi:10.1145/844128.844163 · Cited by 408
Full TCP/IP for 8-bit architectures
Dunkels, A. (2003) · Proceedings of the 1st international conference on Mobile systems, applications and services · doi:10.1145/1066116.1066118 · Cited by 396
Improving Fairness, Efficiency, and Stability in HTTP-Based Adaptive Video Streaming With Festive
Jiang, J., Sekar, V., & Zhang, H. (2014) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2013.2291681 · Cited by 384
What happens when HTTP adaptive streaming players compete for bandwidth?
Akhshabi, S., Anantakrishnan, L., Begen, A. C., & Dovrolis, C. (2012) · Proceedings of the 22nd international workshop on Network and Operating System Support for Digital Audio and Video · doi:10.1145/2229087.2229092 · Cited by 342
On the characteristics and origins of internet flow rates
Zhang, Y., Breslau, L., Paxson, V., & Shenker, S. (2002) · Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/633025.633055 · Cited by 325
Analysis of SRPT scheduling: investigating unfairness
Bansal, N., & Harchol-Balter, M. (2001) · Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems · doi:10.1145/378420.378792 · Cited by 312
Carbone, M., & Rizzo, L. (2010) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1764873.1764876 · Cited by 296
Self-citationPerformance evaluation and comparison of Westwood+, New Reno, and Vegas TCP congestion control
Grieco, L. A., & Mascolo, S. (2004) · ACM SIGCOMM Computer Communication Review · doi:10.1145/997150.997155 · Cited by 293
Request adaptation for adaptive streaming over HTTP/2
Nguyen, D. V., Le, H. T., Nam, P. N., Pham, A. T., & Thang, T. C. (2016) · 2016 IEEE International Conference on Consumer Electronics (ICCE) · doi:10.1109/icce.2016.7430575 · Cited by 9
Metadata
- Authors
- Rizzo, L.
- Venue
- ACM SIGCOMM Computer Communication Review
- Published
- 1997-01
- Volume
- 27
- Issue
- 1
- Pages
- 31-41
- ISSN
- 0146-4833 (ISSN-L)
- OpenAlex
- W2129994716
- Cited by
- 888
- References
- 9
- FWCI
- 10.15
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.