Journal of Communications and Networks

  • 제11권4호
  • /
  • Pages.416-427
  • /
  • 2009
  • /
  • 1229-2370(pISSN)
  • /
  • 1976-5541(eISSN)
한국통신학회 (The Korean Institute of Commucations and Information Sciences)
권호 표지

DNS Resolution with Renewal Using Piggyback

  • Jang, Beak-Cheol (Department of Computer Science at North Carolina State University) ;
  • Lee, Dong-Man (Department of Computer Science at Korea Advanced Institute of Science and Technology IT Convergence Campus(KAIST ICC)) ;
  • Chon, Kil-Nam (Department of Computer Science at Korea Advanced Institute of Science and Technology(KAIST)) ;
  • Kim, Hyun-Chul (School of Computer Science and Engineering at Seoul National University)
  • 발행 : 2009.08.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

Domain name system (DNS) is a primary identification mechanism for Internet applications. However, DNS resolutions often take an unbearably long time, and this could seriously impair the consistency of the service quality of Internet applications based on DNS such as World Wide Web. Several approaches reduce DNS resolution time by proactively refreshing expired cached records or prefetching available records beforehand, but these approaches have an inherent problem in that they cause additional DNS traffic. In this paper, we propose a DNS resolution time reduction scheme, named renewal using piggyback (RUP), which refreshes expired cached records by piggybacking them onto solicited DNS queries instead of by issuing additional DNS queries. This method decreases both DNS resolution time and DNS traffic since it reduces the number of queries generated to handle a given DNS resolution without generating additional DNS messages. Simulation results based on two large independent DNS traces show that our proposed approach much reduces not only the DNS resolution time but also the DNS traffic.

키워드

참고문헌

  1. E. Cohen and H. Kaplan, "Prefetching the means for document transfer: A new approach for reducing web latency," Comput. Netw., vol. 39, pp. 437-455, 2002 https://doi.org/10.1016/S1389-1286(02)00184-6
  2. E. Cohen and H. Kaplan, "Proactìve cachìng of DNS records: Addressing a performance bottleneck," Comput. Netw. , vol. 41, pp. 707-726, 2003 https://doi.org/10.1016/S1389-1286(02)00424-3
  3. B. Krishnamurthy, R. Liston, and M. Rabinovich, "DEW: DNS-enhanced web for faster content delivery," in Proc. World Wide Web, May 2003
  4. C. Wìlls and H. Shang, "The contribution of DNS lookup costs to web object retrieval," Norcesler Polytechnic Institute Tech. Rep. TR-00-12, July 2000
  5. J. Jung, H. B. E. Sit, and R. Morris, "DNS performance and the effectivenss of cachíng;' IEEE/ACM Trans. Netw., Oct. 2002
  6. P. Mockapetris, Domain names-concepts and facilities, RFC 1034, Nov. 1987
  7. P. Mockapetris, Domain narnes-implementation and specifiιation， RFC 1035, Nov. 1987
  8. P. Mockapetris and K. Dunlap, "Development of the domain name system," in Proc. ACM SIGCOMM, 1988, pp. 123-133
  9. P. Albitz and C. Liu, DNS and BIND, 4th ed., O'Reilly, 2001
  10. A. Snoeren and H. Balakrishnan, An end-to-end approach to host mobility. in Proc. ACM MOBICOM, Aug. 2000
  11. B. Krishnarnmhy and C. WilIs, "Study of piggyback cacbe validation for proxy caches in the world wide web," in Proc. USENIX Symp. lnternet Technologies and Systems, Dec. 1997
  12. E. Cohen, B. Krishmurthy, and J. Rexford, "Improving end-to-end performance of the web using server volumes and proxy filters," Comput. Commun. Rev., vol. 28, pp. 241-253, 1998 https://doi.org/10.1145/285243.285286
  13. A. Dan and D. Twosley, "An approximate analysis of the LRU and FIFO buffer rcplacement schemes," in Proc. ACM SJGMETRICS. 1990
  14. M. Milcnkovic, Operating systems concepts and design, 2nd ed., McGraw-Hill, 1992
  15. A. Shaikh, R. Tewari, and M. Agrawal, "On the effectiveness of DNSbased server selection," in Proc. IEEE INFOCOM, Aug. 2001
  16. P. Vixie, Extension mechanisms for DNS, RFC 2671, Aug. 1999
  17. V.Jacobson, C.Leres, and S. McCanne. Tcpdump. ver. 3.6.1. [Online] Available: http://www.tcpdump.org/