Article

Free access

A measurement-friendly network (MFN) architecture

Authors:

Sridhar Machiraju,

Darryl VeitchAuthors Info & Claims

INM '06: Proceedings of the 2006 SIGCOMM workshop on Internet network management

Pages 53 - 58

https://doi.org/10.1145/1162638.1162647

Published: 11 September 2006 Publication History

Abstract

Using active Techniques to measure networks, that is by injecting probe packets, has proved to be quite challenging for properties beyond simple end-to-end delay and loss. Some of the greatest difficulties have resulted from our inability to design techniques robust to multi-hop queueing effects. This difficulty is only compounded by the need to keep measurements non-intrusive, that is to minimally affect ongoing data flows. In this paper, we show that novel network primitives based on hop-dependent priority queueing are very effective in addressing these challenges. By enabling these primitives, network operators can perform a variety of active measurements accurately. Such measurement-friendliness results from many factors including ease of applying fundamentally single-hop methods, better measurement capabilities, and easier clock synchronization. Other advantages of our architecture include ease of deployment, simplicity, low overhead and generality, i.e., no constraints on scheduling policies for data packets. We also discuss the challenges faced, for example, in coping with small but unavoidable inaccuracies and with exposing the primitives to end-users.

References

[1]

NS-2(Network Simulator). http://www.isi.edu/nsnam/ns/.

[2]

F. Baccelli, S. Machiraju, D. Veitch, and J. Bolot. The Role of PASTA in Network Measurements. In Proc. of ACM SIGCOMM, 2006.

Digital Library

[3]

S. Blake, D. L. Black, M. A. Carlson, E. Davies, Z. Wang, and W. Weiss. RFC 2475 - An Architecture for Differentiated Services, December 1998.

Digital Library

[4]

L. S. Brakmo, S. W. O'Malley, and L. L. Peterson. TCP Vegas: New Techniques for Congestion Detection and Avoidance. In Proc. of ACM SIGCOMM, 1994.

Digital Library

[5]

A. B. Downey. Using Pathchar to Estimate Internet Link Characteristics. In Proc. of ACM SIGCOMM, 1999.

Digital Library

[6]

S. Floyd, M. Handley, J. Padhye, and J. Widmer. Equation-Based Congestion Control for Unicast Applications. In Proc. of ACM SIGCOMM, 2000.

Digital Library

[7]

N. Hohn, D. Veitch, K. Papagiannaki, and C. Diot. Bridging Router Performance and Queuing Theory. In Proc. of ACM SIGMETRICS, 2004.

Digital Library

[8]

N. Hu, L. E. Li, Z. M. Mao, P. Steenkiste, and J. Wang. Locating Internet Bottlenecks: Algorithms Measurements and Implications. In Proc. of ACM SIGCOMM, 2004.

Digital Library

[9]

M. Jain and C. Dovrolis. End-to-end Available Bandwidth: Measurement Methodology Dynamics and Relation with TCP Throughput. IEEE/ACM TON, 11(4):537--549, 2003.

Digital Library

[10]

R. Kapoor, L.-J. Chen, L. Lao, M. Gerla, and M. Y. Sanadidi. CapProbe: A Simple and Accurate Capacity Estimation Technique. In Proc. of ACM SIGCOMM, 2004.

Digital Library

[11]

K. Lai and M. Baker. Measuring Link Bandwidths Using a Deterministic Model of Packet Delay. In Proc. of ACM SIGCOMM, 2000.

Digital Library

[12]

X. Liu, K. Ravindran, and D. Loguinov. Multi-Hop Probing Asymptotics in Available Bandwidth Estimation: Stochastic Analysis. In Proc. of IMC, October 2005.

Digital Library

[13]

M. J. Luckie, A. J. Mcgregor, and H.-W. Braun. Towards Improbing Packet Probing Techniques. In Proc. of IMW, November 2001.

Digital Library

[14]

S. Machiraju. Theory and Practice of Non-intrusive Active Network Measurements. PhD thesis, University of California at Berkeley, 2006.

Digital Library

[15]

S. Machiraju, D. Veitch, F. Baccelli, A. Nucci, and J. Bolot. Theory and Practice of Cross-Traffic Estimation Poster. In Proc. of ACM SIGMETRICS, June 2005.

Digital Library

[16]

R. Mahajan, N. Spring, D. Wetherall, and T. Anderson. User-level Internet Path Diagnosis. In Proc. of ACM SOSP, 2003.

Digital Library

[17]

A. Pásztor and D. Veitch. Active Probing using Packet Quartets. In Proc. of IMW, 2002.

Digital Library

[18]

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

Digital Library

[19]

M. Singh, S. Guha, and P. Francis. Utilizing Spare Network Bandwidth to Improve TCP Performance. In Poster in Proc. of ACM SIGCOMM, 2005.

[20]

J. Sommers, P. Barford, N. Duffield, and A. Ron. Improving Accuracy in End-to-End Loss Measurement. In Proc. of ACM SIGCOMM, 2005.

Digital Library

[21]

J. Strauss, D. Katabi, and F. Kaashoek. A Measurement Study of Available Bandwidth Estimation Tools. In Proc. of IMC, 2003.

Digital Library

[22]

G. Varghese and C. Estan. The Measurement Manifesto. In Proc. of HotNets, 2003.

[23]

D. Veitch, S. Babu, and A. Pásztor. Robust Synchronization of Software Clocks Across the Internet. In Proc. of IMC, 2004.

Digital Library

Cited By

Chakor AMonir AAbdellah A(2022)Proposing a Layer to Integrate the Sub-classification of Monitoring Operations Based on AI and Big Data to Improve Efficiency of Information Technology SupervisionApplied Computer Systems10.2478/acss-2022-000527:1(43-54)Online publication date: 23-Aug-2022
https://doi.org/10.2478/acss-2022-0005
Wang HLee KLi ELim CTang AWeatherspoon HWilliamson CAkella ATaft N(2014)Timing is EverythingProceedings of the 2014 Conference on Internet Measurement Conference10.1145/2663716.2663746(407-420)Online publication date: 5-Nov-2014
https://dl.acm.org/doi/10.1145/2663716.2663746
Lee SLevanti KKim H(2014)Network monitoring: Present and futureComputer Networks10.1016/j.comnet.2014.03.00765(84-98)Online publication date: Jun-2014
https://doi.org/10.1016/j.comnet.2014.03.007
Show More Cited By

Index Terms

A measurement-friendly network (MFN) architecture

Recommendations

The role of PASTA in network measurement
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications

Poisson Arrivals See Time Averages (PASTA) is a well known property applicable to many stochastic systems. In active probing, PASTA is invoked to justify the sending of probe packets (or trains) at Poisson times in a variety of contexts. However, due to ...
Active/passive combination-type performance measurement method using change-of-measure framework

We propose a new method of performance measurement called the Change-of-Measure Based Passive/Active Monitoring (CoMPACT Monitor), in which estimates of the actual performance seen by users are obtained based on both active and passive measurement data. ...
The role of PASTA in network measurement
SIGCOMM '06: Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications

Poisson Arrivals See Time Averages (PASTA) is a well known property applicable to many stochastic systems. In active probing, PASTA is invoked to justify the sending of probe packets (or trains) at Poisson times in a variety of contexts. However, due to ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

INM '06: Proceedings of the 2006 SIGCOMM workshop on Internet network management

September 2006

94 pages

ISBN:1595935703

DOI:10.1145/1162638

Copyright © 2006 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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 11 September 2006

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

SIGCOMM06

SIGCOMM06: ACM SIGCOMM 2006 Conference

September 11 - 15, 2006

Pisa, Italy

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

17
Total Citations
View Citations
223
Total Downloads

Downloads (Last 12 months)43
Downloads (Last 6 weeks)7

Reflects downloads up to 04 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Chakor AMonir AAbdellah A(2022)Proposing a Layer to Integrate the Sub-classification of Monitoring Operations Based on AI and Big Data to Improve Efficiency of Information Technology SupervisionApplied Computer Systems10.2478/acss-2022-000527:1(43-54)Online publication date: 23-Aug-2022
https://doi.org/10.2478/acss-2022-0005
Wang HLee KLi ELim CTang AWeatherspoon HWilliamson CAkella ATaft N(2014)Timing is EverythingProceedings of the 2014 Conference on Internet Measurement Conference10.1145/2663716.2663746(407-420)Online publication date: 5-Nov-2014
https://dl.acm.org/doi/10.1145/2663716.2663746
Lee SLevanti KKim H(2014)Network monitoring: Present and futureComputer Networks10.1016/j.comnet.2014.03.00765(84-98)Online publication date: Jun-2014
https://doi.org/10.1016/j.comnet.2014.03.007
Liu KMa QLiu HCao ZLiu Y(2013)End-to-End Delay Measurement in Wireless Sensor Networks without SynchronizationProceedings of the 2013 IEEE 10th International Conference on Mobile Ad-Hoc and Sensor Systems10.1109/MASS.2013.71(583-591)Online publication date: 14-Oct-2013
https://dl.acm.org/doi/10.1109/MASS.2013.71
Kompella RLevchenko KSnoeren AVarghese G(2012)Router support for fine-grained latency measurementsIEEE/ACM Transactions on Networking10.1109/TNET.2012.218890520:3(811-824)Online publication date: 1-Jun-2012
https://dl.acm.org/doi/10.1109/TNET.2012.2188905
Lee MDuffield NKompella R(2012)Opportunistic flow-level latency estimation using consistent netflowIEEE/ACM Transactions on Networking10.1109/TNET.2011.215797520:1(139-152)Online publication date: 1-Feb-2012
https://dl.acm.org/doi/10.1109/TNET.2011.2157975
Lee MGoldberg SKompella RVarghese G(2011)Fine-grained latency and loss measurements in the presence of reorderingACM SIGMETRICS Performance Evaluation Review10.1145/2007116.200715039:1(289-300)Online publication date: 7-Jun-2011
https://dl.acm.org/doi/10.1145/2007116.2007150
Lee MGoldberg SKompella RVarghese GMerchant AKeeton KRubenstein D(2011)Fine-grained latency and loss measurements in the presence of reorderingProceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems10.1145/1993744.1993778(329-340)Online publication date: 7-Jun-2011
https://dl.acm.org/doi/10.1145/1993744.1993778
Lee MDuffield NKompella R(2010)Two samples are enoughProceedings of the 29th conference on Information communications10.5555/1833515.1833806(2196-2204)Online publication date: 14-Mar-2010
https://dl.acm.org/doi/10.5555/1833515.1833806
Lee MDuffield NKompella R(2010)Two Samples are Enough: Opportunistic Flow-level Latency Estimation using NetFlow2010 Proceedings IEEE INFOCOM10.1109/INFCOM.2010.5462044(1-9)Online publication date: Mar-2010
https://doi.org/10.1109/INFCOM.2010.5462044
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