Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

Accurate and Efficient Per-Flow Latency Measurement Without Probing and Time Stamping

Published: 01 December 2016 Publication History

Abstract

With the growth in number and significance of the emerging applications that require extremely low latencies, network operators are facing increasing need to perform latency measurement on per-flow basis for network monitoring and troubleshooting. In this paper, we propose COLATE, the first per-flow latency measurement scheme that requires no probe packets and time stamping. Given a set of observation points, COLATE records packet timing information at each point so that later, for any two points, it can accurately estimate the average and the standard deviation of the latencies experienced by the packets of any flow in passing the two points. The key idea is that when recording packet timing information, COLATE purposely allows noise to be introduced for minimizing storage space, and when querying the latency of a target flow, COLATE uses statistical techniques to denoise and obtain an accurate latency estimate. COLATE is designed to be efficiently implementable on network middleboxes. In terms of processing overhead, COLATE performs only one hash and one memory update per packet. In terms of storage space, COLATE uses less than 0.1-b/packet, which means that, on a backbone link with half a million packets per second, using a 256-GB drive, COLATE can accumulate time stamps of packets traversing the link for over 1.5 years. We evaluated COLATE using three real traffic traces, namely, a backbone traffic trace, an enterprise network traffic trace, and a data center traffic trace. Results show that COLATE always achieves the required reliability for any given confidence interval.

References

[1]
CAIDA Network Monitors, accessed on Jul. 1, 2013. [Online]. Available: http://www.caida.org/data/realtime/passive/.
[2]
The CAIDA UCSD Anonymized 2011 Internet Traces, accessed on Jul. 1, 2013. [Online]. Available: http://www.caida.org/data/passive/passive_2011_dataset.xml.
[3]
Corvil Claims to Minimize Network Latency, 2007. [Online]. Available: http://www.pcworld.idg.com.au/article/196828/corvil_claims_minimize_network_latency/.
[4]
N. Alon, Y. Matias, and M. Szegedy, "The space complexity of approximating the frequency moments," in Proc. ACM STOC, 1996, pp. 20-29.
[5]
S. K. Barker and P. Shenoy, "Empirical evaluation of latency-sensitive application performance in the cloud," in Proc. ACM SIGMM Conf. Multimedia Syst., 2010, pp. 35-46.
[6]
T. Benson, A. Akella, and D. A. Maltz, "Network traffic characteristics of data centers in the wild," in Proc. IMC, 2010, pp. 267-280.
[7]
Y. Cai, F. Yu, C. Liang, B. Sun, and Q. Yan, "Software defined device-to-device (D2D) communications in virtual wireless networks with imperfect network state information (NSI)," IEEE Trans. Veh. Technol., still not published.
[8]
Y. Chen, D. Bindel, H. Song, and R. H. Katz, "An algebraic approach to practical and scalable overlay network monitoring," in Proc. ACM SIGCOMM, 2004, pp. 55-66.
[9]
G. Cormode and S. Muthukrishnan, "An improved data stream summary: The count-min sketch and its applications," J. Algorithms, vol. 55, no. 1, pp. 58-75, Apr. 2005.
[10]
N. Duffield, "Simple network performance tomography," in Proc. ACM IMC, 2003, pp. 210-215.
[11]
S. Floyd and V. Jacobson, "Random early detection gateways for congestion avoidance," IEEE/ACM Trans. Netw., vol. 1, no. 4, pp. 397-413, Aug. 1993.
[12]
P. Guo, J. Wang, X. H. Geng, C. S. Kim, and J.-U. Kim, "A variable threshold-value authentication architecture for wireless mesh networks," J. Internet Technol., vol. 15, no. 6, pp. 929-936, 2014.
[13]
N. Hua, E. Norige, S. Kumar, and B. Lynch, "Non-crypto hardware hash functions for high performance networking ASICs," in Proc. ACM/IEEE ANCS, Oct. 2011, pp. 156-166.
[14]
R. R. Kompella, K. Levchenko, A. C. Snoeren, and G. Varghese, "Every microsecond counts: Tracking fine-grain latencies with a lossy difference aggregator," in Proc. ACM SIGCOMM, 2009, pp. 255-266.
[15]
A. Kumar, J. Xu, J. Wang, O. Spatschek, and L. Li, "Space-code bloom filter for efficient per-flow traffic measurement," in Proc. IEEE INFOCOM, Mar. 2004, pp. 1762-1773.
[16]
M. Lee, N. Duffield, and R. R. Kompella, "Not all microseconds are equal: Fine-grained per-flow measurements with reference latency interpolation," in Proc. ACM SIGCOMM, 2010, pp. 27-38.
[17]
M. Lee, N. Duffield, and R. R. Kompella, "MAPLE: A scalable architecture for maintaining packet latency measurements," in Proc. IMC, 2012, pp. 101-114.
[18]
M. Lee, S. Goldberg, R. R. Kompella, and G. Varghese, "Fine-grained latency and loss measurements in the presence of reordering," in Proc. ACM SIGMETRICS, 2011, pp. 289-300.
[19]
H. Li, K. Wu, Q. Zhang, and L. M. Ni, "CUTS: Improving channel utilization in both time and spatial domain in WLANs," IEEE Trans. Parallel Distrib. Syst., vol. 25, no. 6, pp. 1413-1423, Jun. 2014.
[20]
Y. Lu, A. Montanari, B. Prabhakar, S. Dharmapurikar, and A. Kabbani, "Counter braids: A novel counter architecture for per-flow measurement," in Proc. ACM SIGMETRICS, 2008, pp. 121-132.
[21]
B. Lynch and S. Kumar, "Smart memory for high performance network packet forwarding," in Proc. Hot Chips Symp., 2010.
[22]
R. Martin, "Wall Street's quest to process data at the speed of light," Inf. Week, vol. 4, no. 21, 2007. [Online]: http://www.informationweek.com/wall-streets-quest-to-process-data-at-the-speed-of-light/d/d-id/1054287?
[23]
M. J. Miller, "Bandwidth engine serial memory chip breaks 2 billion accesses/sec," in Proc. Hot Chips Symp., 2011, pp. 1-23.
[24]
Z. Pan, Y. Zhang, and S. Kwong, "Efficient motion and disparity estimation optimization for low complexity multiview video coding," IEEE Trans. Broadcast., vol. 61, no. 2, pp. 166-176, Jun. 2015.
[25]
R. Pang et al., "A first look at modern enterprise traffic," in Proc. IMC, 2005, pp. 15-28.
[26]
M. V. Ramakrishna, E. Fu, and E. Bahcekapili, "Efficient hardware hashing functions for high performance computers," IEEE Trans. Comput., vol. 46, no. 12, pp. 1378-1381, Dec. 1997.
[27]
Z. Xia, X. Wang, X. Sun, and Q. Wang, "A secure and dynamic multikeyword ranked search scheme over encrypted cloud data," IEEE Trans. Parallel Distrib. Syst., vol. 27, no. 2, pp. 340-352, Feb. 2016.
[28]
S. Xie and Y. Wang, "Construction of tree network with limited delivery latency in homogeneous wireless sensor networks," Wireless Pers. Commun., vol. 78, no. 1, pp. 231-246, 2014.
[29]
Q. Yan and F. Yu, "Distributed denial of service attacks in software-defined networking with cloud computing," IEEE Commun. Mag., vol. 53, no. 4, pp. 52-59, Apr. 2015.
[30]
Y. Zhao, Y. Chen, and D. Bindel, "Towards unbiased end-to-end network diagnosis," in Proc. ACM SIGCOMM, 2006, pp. 219-230.
[31]
Y. Zhou, T. Z. J. Fu, and D. M. Chiu, "A unifying model and analysis of P2P VoD replication and scheduling," IEEE/ACM Trans. Netw., vol. 23, no. 4, pp. 1163-1175, Aug. 2015.

Cited By

View all
  • (2023)SketchPolymer: Estimate Per-item Tail Quantile Using One SketchProceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3580305.3599505(590-601)Online publication date: 6-Aug-2023

Recommendations

Comments

Information & Contributors

Information

Published In

cover image IEEE/ACM Transactions on Networking
IEEE/ACM Transactions on Networking  Volume 24, Issue 6
December 2016
635 pages

Publisher

IEEE Press

Publication History

Published: 01 December 2016
Published in TON Volume 24, Issue 6

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)5
  • Downloads (Last 6 weeks)0
Reflects downloads up to 06 Oct 2024

Other Metrics

Citations

Cited By

View all
  • (2023)SketchPolymer: Estimate Per-item Tail Quantile Using One SketchProceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3580305.3599505(590-601)Online publication date: 6-Aug-2023

View Options

Get Access

Login options

Full Access

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media