Article

Free access

Trajectory sampling for direct traffic observation

Authors:

N. G. Duffield,

M. GrossglauserAuthors Info & Claims

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

Pages 271 - 282

https://doi.org/10.1145/347059.347555

Published: 28 August 2000 Publication History

Abstract

Traffic measurement is a critical component for the control and engineering of communication networks. We argue that traffic measurement should make it possible to obtain the spatial flow of traffic through the domain, i.e., the paths followed by packets between any ingress and egress point of the domain. Most resource allocation and capacity planning tasks can benefit from such information. Also, traffic measurements should be obtained without a routing model and without knowledge of network state. This allows the traffic measurement process to be resilient to network failures and state uncertainty.

We propose a method that allows the direct inference of traffic flows through a domain by observing the trajectories of a subset of all packets traversing the network. The key advantages of the method are that (i) it does not rely on routing state, (ii) its implementation cost is small, and (iii) the measurement reporting traffic is modest and can be controlled precisely. The key idea of the method is to sample packets based on a hash function computed over the packet content. Using the same hash function will yield the same sample set of packets in the entire domain, and enables us to reconstruct packet trajectories.

References

[1]

G. Almes, S. Kalidindi, and M. Zekauskas. A One-Way Delay Metric for IPPM. RFC 2679, available from http://www.ietf.org/rfc, September 1999.

Digital Library

[2]

G. Almes, S. Kalidindi, and M. Zekauskas. A One-Way Packet Loss Metric for IPPM. RFC 2680, available from http://www.ietf.org/rfc, September 1999.

Digital Library

[3]

Daniel O. Awduche. MPLS and Traffic Engineering in IP Networks. IEEE Communications Magazine, December 1999.

Digital Library

[4]

Y. Bernet, J. Binder, S. Blake, M. Carlson, B. E. Carpenter, S. Keshav, E. David, B. Ohlman, D. Verma, Z. Whang, and W. Weiss. A Framework for Differentiated Services. Internet Draft (work in progress), February 1999.

[5]

R. Cffaceres, N. G. Duffield, J. Horowitz, and D. Towsley. Multicast-based inference of network-internal loss characteristics. IEEE Transactions on Information Theory, 45:2462-2480, 1999.

Digital Library

[6]

R. Callon et al. A Framework for MPLS. IETF Internet draft, work in progress, September 1999.

[7]

CERT/CC and FedCIRC. Advisory CA-2000-01 Denial-of-Service Developments. Carnegie Mellon Software Engineering Institute, January 2000.

[8]

Kimberly C. Claffy, George C. Polyzos, and Hans-Werner Braun. Application of Sampling Methodologies to Network Traffic Characterization. Computer Communication Review, 23(4):194-203, October 1993. appeared in Proceedings ACM SIGCOMM'93, San Francisco, CA, September 13-17, 1993.

Digital Library

[9]

Cisco Corp. Net ow Services and Applications (white paper). August 1999.

[10]

I. Cozzani and S. Giordano. Traffic Sampling Methods for end-to-end QoS Evaluation in Large Heterogeneous Networks. Computer Networks and ISDN Systems, 30(16-18), September 1998.

Digital Library

[11]

Anja Feldmann, Albert Greenberg, Carsten Lund, Nick Reingold, and Jennifer Rexford. NetScope: Traffic engineering for IP networks. IEEE Network Magazine, March 2000.

Digital Library

[12]

S. Floyd and V. Jacobson. Random early detection gateways for congestion avoidance. IEEE/ACM Transactions on Networking, 1(4):397-413, August 1993.

Digital Library

[13]

S. Floyd and V. Jacobson. The synchronization of periodic routing messages. IEEE/ACM Transactions on Networking, 2(2):122-136, April 1994.

Digital Library

[14]

Timothy G. Griffin and Gordon Wilfong. An Analysis of BGP Convergence Properties. Computer Communication Review, 29(4):277-288, October 1999. appeared in Proceedings ACM SIGCOMM'99, Cambridge, MA, August 30-September 3, 1999.

Digital Library

[15]

R. Frederick H.Schulzrinne, S. Casner and V. Jacobson. RTP: A Transport Protocol for Real-Time Applications. RFC 1889, available from: ftp://ftp.isi.edu/in-notes/rfc1889.txt, January 1996.

[16]

Van Jacobson, Craig Leres, and Steven McCanne. tcpdump. available at ftp://ftp.ee.lbl.gov, 1989.

[17]

Donald E. Knuth. Sorting and Searching, volume 3 of The Art of Computer Programming. Addison-Wesley, 1998.

Digital Library

[18]

C. Labovitz, G. R. Malan, and F. Jahanian. Internet Routing Instability. IEEE/ACM Transactions on Networking, 6(5):515-528, October 1998.

Digital Library

[19]

Vern Paxson. Empirically-Derived Analytic Models of Wide-Area TCP Conections. ACM/IEEE Transactions on Communications, 2(4):8-17, August 1994.

Digital Library

[20]

K. K. Ramakrishnan and S. Floyd. A Proposal to add Explicit Congestion Notification (ECN) to IP. RFC 2481, available from: ftp://ftp.isi.edu/in-notes/rfc2481.txt, January 1999.

Digital Library

[21]

Lawrence G. Roberts. Beyond Moore's Law: Internet Growth Trends. IEEE Computer, January 2000.

Digital Library

[22]

Lothar Sachs. Applied Statistics. Springer, 1984.

[23]

W. Simpson. RFC 1853, IP in IP Tunneling. available at ftp://ftp.isi.edu/in-notes/rfc1853.txt, 1995.

Digital Library

[24]

William Stallings. SNMP, SNMP v2, SNMP v3, and RMON 1 and 2 (Third Edition). Addison-Wesley, Reading, Mass., 1999.

Digital Library

[25]

Mikkel Thorup. Even strongly universal hashing is pretty fast. In Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 496-497, 2000.

Digital Library

[26]

V. Paxson and S. Floyd. Why We Don't Know How To Simulate The Internet. In Proceedings of the 1997 Winter Simulation Conference, December 1997.

Digital Library

[27]

Jean Walrand. Private communication. February 2000.

Cited By

Aamand ADas DKipouridis EKnudsen JRasmussen PThorup M(2022)No RepetitionProceedings of the VLDB Endowment10.14778/3565838.356585115:13(3989-4001)Online publication date: 1-Sep-2022
https://dl.acm.org/doi/10.14778/3565838.3565851
Ben Basat RRamanathan SLi YAntichi GYu MMitzenmacher M(2020)PINTProceedings of the Annual conference of the ACM Special Interest Group on Data Communication on the applications, technologies, architectures, and protocols for computer communication10.1145/3387514.3405894(662-680)Online publication date: 30-Jul-2020
https://dl.acm.org/doi/10.1145/3387514.3405894
Kučera JBasat RKuka MAntichi GYu MMitzenmacher MHan DFeldmann A(2020)Detecting routing loops in the data planeProceedings of the 16th International Conference on emerging Networking EXperiments and Technologies10.1145/3386367.3431303(466-473)Online publication date: 23-Nov-2020
https://dl.acm.org/doi/10.1145/3386367.3431303
Show More Cited By

Index Terms

Trajectory sampling for direct traffic observation

Recommendations

Trajectory sampling for direct traffic observation

Traffic measurement is a critical component for the control and engineering of communication networks. We argue that traffic measurement should make it possible to obtain the spatial flow of traffic through the domain, i.e., the paths followed by ...
Trajectory sampling for direct traffic observation

Traffic measurement is a critical component for the control and engine ering of communication networks. We argue that traffic measurement should make it possible to obtain the spatial flow of traffic through the domain, i.e., the paths followed by ...
Adaptive random sampling for traffic volume measurement

Traffic measurement and monitoring are an important component of network management and traffic engineering. With high-speed Internet backbone links, efficient and effective packet sampling techniques for traffic measurement and monitoring are not only ...

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

121
Total Citations
View Citations
781
Total Downloads

Downloads (Last 12 months)84
Downloads (Last 6 weeks)20

Reflects downloads up to 16 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Aamand ADas DKipouridis EKnudsen JRasmussen PThorup M(2022)No RepetitionProceedings of the VLDB Endowment10.14778/3565838.356585115:13(3989-4001)Online publication date: 1-Sep-2022
https://dl.acm.org/doi/10.14778/3565838.3565851
Ben Basat RRamanathan SLi YAntichi GYu MMitzenmacher M(2020)PINTProceedings of the Annual conference of the ACM Special Interest Group on Data Communication on the applications, technologies, architectures, and protocols for computer communication10.1145/3387514.3405894(662-680)Online publication date: 30-Jul-2020
https://dl.acm.org/doi/10.1145/3387514.3405894
Kučera JBasat RKuka MAntichi GYu MMitzenmacher MHan DFeldmann A(2020)Detecting routing loops in the data planeProceedings of the 16th International Conference on emerging Networking EXperiments and Technologies10.1145/3386367.3431303(466-473)Online publication date: 23-Nov-2020
https://dl.acm.org/doi/10.1145/3386367.3431303
Kafle SHuenerfauth M(2019)Predicting the Understandability of Imperfect English Captions for People Who Are Deaf or Hard of HearingACM Transactions on Accessible Computing10.1145/332586212:2(1-32)Online publication date: 11-Jun-2019
https://dl.acm.org/doi/10.1145/3325862
Basat REinziger GFeibish SMoraney JRaz DBenson TZilberman N(2018)Network-wide routing-oblivious heavy hittersProceedings of the 2018 Symposium on Architectures for Networking and Communications Systems10.1145/3230718.3230729(66-73)Online publication date: 23-Jul-2018
https://dl.acm.org/doi/10.1145/3230718.3230729
Shaghaghi AKaafar MJha SKarri RSinanoglu OSadeghi AYi X(2017)WedgeTailProceedings of the 2017 ACM on Asia Conference on Computer and Communications Security10.1145/3052973.3053039(849-861)Online publication date: 2-Apr-2017
https://dl.acm.org/doi/10.1145/3052973.3053039
Sharma UMehta N(2017)ESRATE: Extreme state-ranked based traffic estimation of workload factoring for cloud computing2017 International Conference on Inventive Systems and Control (ICISC)10.1109/ICISC.2017.8068656(1-9)Online publication date: Jan-2017
https://doi.org/10.1109/ICISC.2017.8068656
Sharma VSharma S(2017)Low energy consumption based patient health monitoring by LEACH protocol2017 International Conference on Inventive Systems and Control (ICISC)10.1109/ICISC.2017.8068632(1-4)Online publication date: Jan-2017
https://doi.org/10.1109/ICISC.2017.8068632
Garay JKolesnikov VMclellan R(2016)MAC Precomputation with Applications to Secure MemoryACM Transactions on Privacy and Security10.1145/294378019:2(1-21)Online publication date: 17-Sep-2016
https://dl.acm.org/doi/10.1145/2943780
Pappas CArgyraki KBechtold SPerrig Ade Oliveira JSmith JArgyraki KLevis P(2015)Transparency Instead of NeutralityProceedings of the 14th ACM Workshop on Hot Topics in Networks10.1145/2834050.2834082(1-7)Online publication date: 16-Nov-2015
https://dl.acm.org/doi/10.1145/2834050.2834082
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