Article

Free access

Measuring link bandwidths using a deterministic model of packet delay

Authors:

Mary BakerAuthors Info & Claims

SIGCOMM '00: Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication

Pages 283 - 294

https://doi.org/10.1145/347059.347557

Published: 28 August 2000 Publication History

Abstract

We describe a deterministic model of packet delay and use it to derive both the packet pair [2] property of FIFO-queueing networks and a new technique packet tailgating) for actively measuring link bandwidths. Compared to previously known techniques, packet tailgating usually consumes less network bandwidth, does not rely on consistent behavior of routers handling ICMP packets, and does not rely on timely delivery of acknowledgments.

References

[1]

S. M. Bellovin. A Best-Case Network Performance Model. http://www.research.att.com/ smb/papers/netmeas.ps, 1992.]]

[2]

J.-C. Bolot. End-to-End Packet Delay and Loss Behavior in the Internet. In Proceedings of ACM SIGCOMM, 1993.]]

Digital Library

[3]

R. L. Carter and M. E. Crovella. Measuring Bottleneck Link Speed in Packet-Switched Networks. Technical Report BU-CS-96-006, Boston University, 1996.]]

Digital Library

[4]

A. B. Downey. Using pathchar to Estimate Internet Link Characteristics. In Proceedings of ACM SIGCOMM, 1999.]]

Digital Library

[5]

B. Efron and R. J. Tibshirani. An Introductin to the Bootstrap. Chapman and Hall, 1993.]]

[6]

V. Jacobson. Congestion Avoidance and Control. In Proceedings of ACM SIGCOMM, 1988.]]

Digital Library

[7]

V. Jacobson. pathchar. ftp://ftp.ee.lbl.gov/pathchar/, 1997.]]

[8]

V. Jacobson. pathchar a tool to infer characteristics of Internet paths. Presented at the Mathmatical Sciences Research Institute, 1997.]]

[9]

S. Keshav. A Control-Theoretic Approach toFlow Control. In Proceedings of ACM SIGCOMM, 1991.]]

Digital Library

[10]

K. Lai and M. Baker. Measuring Bandwidth. In Proceedings of IEEE INFOCOM, 1999.]]

[11]

B. A. Mah. pchar. http://www.ca.sandia.gov/ bmah/Software/pchar/, 2000.]]

[12]

S. McCanne and V. Jacobson. The BSD Packet Filter: A New Architecture for User-level Packet Capture. In Proceedings of the 1993 Winter USENIX Technical Conference, 1993.]]

Digital Library

[13]

V. Paxson. End-to-End Routing Behavior in the Internet. In Proceedings of ACM SIGCOMM, 1996.]]

Digital Library

[14]

V. Paxson. End-to-End Internet Packet Dynamics. In Proceedings of ACM SIGCOMM, 1997.]]

Digital Library

[15]

V. Paxson. Measurements and Analysis of End-to-End Internet Dynamics. PhD thesis, University of California, Berkeley, April 1997.]]

Digital Library

[16]

S. Savage. Sting: a TCP-based Network Measurement Tool. In Proceedings of the USENIX Symposium on Internet Technologies and Systems, 1999.]]

Digital Library

[17]

S. Seshan, M. Stemm, and R. Katz. SPAND: Shared Passive Network Performance Discovery. In Proceedings of the USENIX Symposium on Internet Technologies and Systems, 1997.]]

Digital Library

[18]

I. Stoica and H. Zhang. Providing guaranteed services without per ow management. In Proceedings of ACM SIGCOMM, 1999.]]

Digital Library

Cited By

Li HYang CWang LAnsari NTang DHuang XXu ZHu D(2023)A Cooperative Defense Framework Against Application-Level DDoS Attacks on Mobile Edge Computing ServicesIEEE Transactions on Mobile Computing10.1109/TMC.2021.308621922:1(1-18)Online publication date: 1-Jan-2023
https://doi.org/10.1109/TMC.2021.3086219
Goyal PNarayan ACangialosi FNarayana SAlizadeh MBalakrishnan HKuipers FOrda A(2022)Elasticity detectionProceedings of the ACM SIGCOMM 2022 Conference10.1145/3544216.3544221(158-176)Online publication date: 22-Aug-2022
https://dl.acm.org/doi/10.1145/3544216.3544221
Feng CAn JWu KWang J(2022)Bound Inference and Reinforcement Learning-Based Path Construction in Bandwidth TomographyIEEE/ACM Transactions on Networking10.1109/TNET.2021.311800630:2(501-514)Online publication date: Apr-2022
https://doi.org/10.1109/TNET.2021.3118006
Show More Cited By

Index Terms

Measuring link bandwidths using a deterministic model of packet delay

Recommendations

Measuring link bandwidths using a deterministic model of packet delay

We describe a deterministic model of packet delay and use it to derive both the packet pair [2] property of FIFO-queueing networks and a new technique packet tailgating) for actively measuring link bandwidths. Compared to previously known techniques, ...
The inherent queuing delay of parallel packet switches
SPAA '04: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures

The parallel packet switch (PPS) is extensively used as the core of contemporary commercial switches. This paper investigates the inherent queuing delay and delay jitter introduced by the PPS's demultiplexing algorithm, relative to an optimal work-...
Performance of fiber delay-line buffers in asynchronous packet-based optical switching networks with wavelength conversion

A major challenge in asynchronous packet-based optical networks is packet contention, which occurs when two or more packets head to the same output at the same time. To resolve contention in the optical domain, two primary approaches are wavelength ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGCOMM '00: Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication

August 2000

348 pages

ISBN:1581132239

DOI:10.1145/347059

Chairman:
Craig Partridge
BBN Technologies, Cambridge, MA

ACM SIGCOMM Computer Communication Review Volume 30, Issue 4
October 2000
319 pages
ISSN:0146-4833
DOI:10.1145/347057
Editor:
Roch Guerin
Univ. of Pennsylvania, Philadelphia
Issue’s Table of Contents

Copyright © 2000 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGCOMM: ACM Special Interest Group on Data Communication

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 28 August 2000

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGCOMM00

Sponsor:

SIGCOMM

SIGCOMM00: ACM SIGCOMM 2000

August 28 - September 1, 2000

Stockholm, Sweden

Acceptance Rates

SIGCOMM '00 Paper Acceptance Rate 26 of 238 submissions, 11%;

Overall Acceptance Rate 462 of 3,389 submissions, 14%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

283
Total Citations
View Citations
1,898
Total Downloads

Downloads (Last 12 months)133
Downloads (Last 6 weeks)24

Reflects downloads up to 16 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Li HYang CWang LAnsari NTang DHuang XXu ZHu D(2023)A Cooperative Defense Framework Against Application-Level DDoS Attacks on Mobile Edge Computing ServicesIEEE Transactions on Mobile Computing10.1109/TMC.2021.308621922:1(1-18)Online publication date: 1-Jan-2023
https://doi.org/10.1109/TMC.2021.3086219
Goyal PNarayan ACangialosi FNarayana SAlizadeh MBalakrishnan HKuipers FOrda A(2022)Elasticity detectionProceedings of the ACM SIGCOMM 2022 Conference10.1145/3544216.3544221(158-176)Online publication date: 22-Aug-2022
https://dl.acm.org/doi/10.1145/3544216.3544221
Feng CAn JWu KWang J(2022)Bound Inference and Reinforcement Learning-Based Path Construction in Bandwidth TomographyIEEE/ACM Transactions on Networking10.1109/TNET.2021.311800630:2(501-514)Online publication date: Apr-2022
https://doi.org/10.1109/TNET.2021.3118006
Shi SLi JHan BWu HMa YDong QSchotten H(2021)Multi-Path Forwarding Strategy for Named Data Networking Based on Pending Interests and Available Bandwidth2021 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking (ISPA/BDCloud/SocialCom/SustainCom)10.1109/ISPA-BDCloud-SocialCom-SustainCom52081.2021.00105(731-737)Online publication date: Sep-2021
https://doi.org/10.1109/ISPA-BDCloud-SocialCom-SustainCom52081.2021.00105
Feng CAn JWu KWang J(2021)Bound Inference and Reinforcement Learning-based Path Construction in Bandwidth TomographyIEEE INFOCOM 2021 - IEEE Conference on Computer Communications10.1109/INFOCOM42981.2021.9488691(1-10)Online publication date: 10-May-2021
https://doi.org/10.1109/INFOCOM42981.2021.9488691
Salehin KKwon KRojas-Cessa R(2020)A Simulation Study of the Measurement of Queueing Delay Over End-to-End PathsIEEE Open Journal of the Computer Society10.1109/OJCS.2020.29782311(1-11)Online publication date: 2020
https://doi.org/10.1109/OJCS.2020.2978231
Yue MWang MWu Z(2019)Low-High Burst: A Double Potency Varying-RTT Based Full-Buffer Shrew Attack ModelIEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2019.2948167(1-1)Online publication date: 2019
https://doi.org/10.1109/TDSC.2019.2948167
Hanada MKanemitsu H(2018)Available Bandwidth Estimation Method Using End-to-End Delay Increase RateJournal of Signal Processing10.2299/jsp.22.6322:2(63-76)Online publication date: 2018
https://doi.org/10.2299/jsp.22.63
Li HWang L(2018)Online orchestration of cooperative defense against DDoS attacks for 5G MEC2018 IEEE Wireless Communications and Networking Conference (WCNC)10.1109/WCNC.2018.8377309(1-6)Online publication date: Apr-2018
https://doi.org/10.1109/WCNC.2018.8377309
Rabie RDrissi M(2018)Applying sigmoid filter for detecting the low-rate denial of service attacks2018 IEEE 8th Annual Computing and Communication Workshop and Conference (CCWC)10.1109/CCWC.2018.8301654(450-456)Online publication date: Jan-2018
https://doi.org/10.1109/CCWC.2018.8301654
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents