Article

DNS performance and the effectiveness of caching

Authors:

Hari Balakrishnan,

Robert MorrisAuthors Info & Claims

IMW '01: Proceedings of the 1st ACM SIGCOMM Workshop on Internet measurement

Pages 153 - 167

https://doi.org/10.1145/505202.505223

Published: 01 November 2001 Publication History

Abstract

This paper presents a detailed analysis of traces of DNS and associated TCP traffic collected on the Internet links of the MIT Laboratory for Computer Science and the Korea Advanced Institute of Science and Technology (KAIST). The first part of the analysis details how clients at these institutions interact with the wide-area DNS system, focusing on performance and prevalence of failures. The second part evaluates the effectiveness of DNS caching.In the most recent MIT trace, 23% of lookups receive no answer; these lookups account for more than half of all traced DNS packets since they are retransmitted multiple times. About 13% of all lookups result in an answer that indicates a failure. Many of these failures appear to be caused by missing inverse (IP-to-name) mappings or NS records that point to non-existent or inappropriate hosts. 27% of the queries sent to the root name servers result in such failures.The paper presents trace-driven simulations that explore the effect of varying TTLs and varying degrees of cache sharing on DNS cache hit rates. The results show that reducing the TTLs of address (A) records to as low as a few hundred seconds has little adverse effect on hit rates, and that little benefit is obtained from sharing a forwarding DNS cache among more than 10 or 20 clients. These results suggest that the performance of DNS is not as dependent on aggressive caching as is commonly believed, and that the widespread use of dynamic, low-TTL A-record bindings should not degrade DNS performance.

References

[1]

P. Danzig, K. Obraczka, and A. Kumar, "An Analysis of Wide- Are Name Server Traffic: A Study of the Internet Domain Name System," in Proc ACM SIGCOMM, Baltimore, MD, Aug. 1992, pp. 281-292.]]

Digital Library

[2]

K. Frazer, "NSFNET: A Partnership for High-Speed Networking," http://www.merit.edu/merit/archive/ nsfnet/final.report/, 1995.]]

[3]

K. Thompson, G. Miller, and R. Wilder, "Wide-area Traffic Pattterns and Characteristics," IEEE Network, vol. 11, no. 6, pp. 10- 23, November/December 1997.]]

[4]

H. Balakrishnan, V. Padmanabhan, S. Seshan, M. Stemm, and R. Katz, 'TCP Behavior of a Busy Web Server: Analysis and Improvements," in Proc. IEEE INFOCOM, San Francisco, CA, Mar. 1998, vol. 1, pp. 252-262.]]

[5]

A. Snoeren and H. Balakrishnan, "An End-to-End Approach to Host Mobility," in Proc. 6th ACM MOBICOM, Boston, MA, Aug. 2000, pp. 1555166.]]

Digital Library

[6]

J. Loughney and J. Yu, Roaming Support with DNS, July 2000, Internet-Draft draft-loughney-enum-roaming-00.txt; expires January 2001. Available from http : / /www . iet f . org/internet-drafts/draft-loughney-enumroaming-00 .txt.]]

[7]

P. Mockapetris, Domain Names-Concepts and Facilities, Nov. 1987, RFC 1034.]]

Digital Library

[8]

P. Mockapetris, Domain names-Implementation and Specification, Nov. 1987, RFC 1035.]]

Digital Library

[9]

P. Mockapetris and K. Dunlap, "Development of the Domain Name System," in Proc. ACM SIGCOMM, Stanford, CA, 1988, pp. 123-133.]]

Digital Library

[10]

A. Kumar, J. Postel, C. Neuman, P. Danzig, and S. Miller, Comreducing mon DNS Implementation Errors and Suggested Fixes, Oct. 1993, RFC 1536.]]

Digital Library

[11]

L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker, "On the implications of Zipf's law for web caching," Technical Reing port CS-TR-1998-1371, University of Wisconsin, Madison, Apr. 1998.]]

[12]

M. Crovella and A. Bestavros, "Self-similarity in World Wide Web Traffic: Evidence and Possible Causes," IEEE/ACM Transactions on Networking, vol. 5, no. 6, pp. 835-846, Dec. 1997.]]

Digital Library

[13]

A. Wolman, G. Voelker, N. Sharma, N. Cardwell, A. Karlin, and H. Levy, "On the scale and performance of cooperative web proxy caching," in 17th ACM SOSP, Kiawah Island, SC, Dec. 1999, pp. 16-31.]]

Digital Library

[14]

S. Glassman, "A Caching Relay for the World-Wide Web," Computer Networks and ISDN Systems, vol. 27, pp. 165- 173, 1994, http://www.research.compaq.com/SRC/ personal/steveg/CachingTheWeb/paper.html.]]

Digital Library

[15]

A. Shaikh, R. Tewari, and M. Agrawal, "On the Effectiveness of DNS-based Server Selection," in Proc. IEEE INFOCOM, April 2001.]]

[16]

C. Wills and H. Shang, 'The Contribution of DNS Lookup Costs to Web Object Retrieval," Tech. Rep. TR-00-12, Worcester Polytechnic Institute, July 2000, http://www.cs.wpi.edu/ cew/papers/tr00-12.ps.gz.]]

[17]

E. Cohen and H. Kaplan, "Proactive Caching of DNS Records: Addressing a Performance Bottleneck," in Proc. Symp. on Applications and the Internet (SAINT), San Diego, CA, January 2001.]]

Digital Library

[18]

R. Rivest, The MD5 Message-Digest Algorithm, April 1992, RFC 1321.]]

Digital Library

[19]

G. Minshall, "Tcpdpriv," http://ita.ee.lbl.gov/ html/contrib/tcpdpriv.html,Aug.l997.]]

[20]

V. Jacobson, C. Leres, and S. McCanne, "tcpdump," http: // www.tcpdump.org/.]]

[21]

V. Paxson, 'End-to-End Internet Packet Dynamics," in Proc. ACM SIGCOMM, Cannes, France, Sept. 1997, pp. 139-152.]]

Digital Library

Cited By

Zhang QBai XLi XDuan HLi QLi ZBalzarotti DXu W(2024)RESOLVERFUZZProceedings of the 33rd USENIX Conference on Security Symposium10.5555/3698900.3699165(4729-4746)Online publication date: 14-Aug-2024
https://dl.acm.org/doi/10.5555/3698900.3699165
Zhang XZhang CLi XDu ZMao BLi YZheng YLi YPan LLiu YDeng R(2024)A Survey of Protocol FuzzingACM Computing Surveys10.1145/369678857:2(1-36)Online publication date: 10-Oct-2024
https://dl.acm.org/doi/10.1145/3696788
Bardinelli JZhang YSu JHuang LParilla AJarvi RKulkarni SZhang W(2024)hyDNS: Acceleration of DNS Through Kernel Space ResolutionProceedings of the ACM SIGCOMM 2024 Workshop on eBPF and Kernel Extensions10.1145/3672197.3673439(58-64)Online publication date: 4-Aug-2024
https://dl.acm.org/doi/10.1145/3672197.3673439
Show More Cited By

Index Terms

DNS performance and the effectiveness of caching
1. General and reference
  1. Cross-computing tools and techniques
    1. Performance
2. Networks
  1. Network architectures
  2. Network services
    1. Network monitoring

Recommendations

DNS performance and the effectiveness of caching

This paper presents a detailed analysis of traces of domain name system (DNS) and associated TCP traffic collected on the Internet links of the MIT Laboratory for Computer Science and the Korea Advanced Institute of Science and Technology (KAIST). The ...
DNS performance and the effectiveness of caching

The Domain Name System (DNS) is an essential part of the Internet infrastructure and most Internet applications depend on the correct operation of DNS prior to establishing a connection to a remote host. We seek to understand the client-perceived ...
SELECTIVE VICTIM CACHING: A METHOD TO IMPROVE THE PERFORMANCE OF DIRECT-MAPPED CACHES

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

IMW '01: Proceedings of the 1st ACM SIGCOMM Workshop on Internet measurement

November 2001

319 pages

ISBN:1581134355

DOI:10.1145/505202

Conference Chair:
Vern Paxson
ACIRI

Copyright © 2001 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: 01 November 2001

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGCOMM WS'01

Sponsor:

SIGCOMM

SIGCOMM WS'01: ACM SIGCOMM Internet Measurement Workshop 2001

November 1 - 2, 2001

California, San Francisco, USA

Acceptance Rates

IMW '01 Paper Acceptance Rate 29 of 80 submissions, 36%;

Overall Acceptance Rate 29 of 80 submissions, 36%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

100
Total Citations
View Citations
936
Total Downloads

Downloads (Last 12 months)148
Downloads (Last 6 weeks)5

Reflects downloads up to 10 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Zhang QBai XLi XDuan HLi QLi ZBalzarotti DXu W(2024)RESOLVERFUZZProceedings of the 33rd USENIX Conference on Security Symposium10.5555/3698900.3699165(4729-4746)Online publication date: 14-Aug-2024
https://dl.acm.org/doi/10.5555/3698900.3699165
Zhang XZhang CLi XDu ZMao BLi YZheng YLi YPan LLiu YDeng R(2024)A Survey of Protocol FuzzingACM Computing Surveys10.1145/369678857:2(1-36)Online publication date: 10-Oct-2024
https://dl.acm.org/doi/10.1145/3696788
Bardinelli JZhang YSu JHuang LParilla AJarvi RKulkarni SZhang W(2024)hyDNS: Acceleration of DNS Through Kernel Space ResolutionProceedings of the ACM SIGCOMM 2024 Workshop on eBPF and Kernel Extensions10.1145/3672197.3673439(58-64)Online publication date: 4-Aug-2024
https://dl.acm.org/doi/10.1145/3672197.3673439
Zhu JVermeulen KCunha IKatz-Bassett ECalder MBarakat CPelsser CBenson TChoffnes D(2022)The best of both worldsProceedings of the 22nd ACM Internet Measurement Conference10.1145/3517745.3561421(655-663)Online publication date: 25-Oct-2022
https://dl.acm.org/doi/10.1145/3517745.3561421
Yang JYue YRashmi K(2021)A Large-scale Analysis of Hundreds of In-memory Key-value Cache Clusters at TwitterACM Transactions on Storage10.1145/346852117:3(1-35)Online publication date: 16-Aug-2021
https://dl.acm.org/doi/10.1145/3468521
Yang JYue YRashmi KLu SHowell J(2020)A large scale analysis of hundreds of in-memory cache clusters at TwitterProceedings of the 14th USENIX Conference on Operating Systems Design and Implementation10.5555/3488766.3488777(191-208)Online publication date: 4-Nov-2020
https://dl.acm.org/doi/10.5555/3488766.3488777
Carra DMichiardi P(2019)Memory Partitioning and Management in MemcachedIEEE Transactions on Services Computing10.1109/TSC.2016.261304812:4(564-576)Online publication date: 1-Jul-2019
https://doi.org/10.1109/TSC.2016.2613048
Malay SKuncha S(2018)Q-DNS: Optimized Network Lookup for Dual Stack Devices2018 IEEE 20th International Conference on High Performance Computing and Communications; IEEE 16th International Conference on Smart City; IEEE 4th International Conference on Data Science and Systems (HPCC/SmartCity/DSS)10.1109/HPCC/SmartCity/DSS.2018.00164(992-997)Online publication date: Jun-2018
https://doi.org/10.1109/HPCC/SmartCity/DSS.2018.00164
Alouf SChoungmo Fofack NNedkov N(2016)Performance models for hierarchy of cachesPerformance Evaluation10.1016/j.peva.2016.01.00197:C(57-82)Online publication date: 1-Mar-2016
https://dl.acm.org/doi/10.1016/j.peva.2016.01.001
Carra DMichiardi P(2015)Cost-based Memory Partitioning and Management in MemcachedProceedings of the 3rd VLDB Workshop on In-Memory Data Mangement and Analytics10.1145/2803140.2803146(1-8)Online publication date: 31-Aug-2015
https://dl.acm.org/doi/10.1145/2803140.2803146
Show More Cited By

View Options

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

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten