DHTTP: An efficient and cache-friendly transfer protocol for Web traffic

被引:0
|
作者
Rabinovich, M
Wang, H
机构
来源
IEEE INFOCOM 2001: THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-3, PROCEEDINGS: TWENTY YEARS INTO THE COMMUNICATIONS ODYSSEY | 2001年
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Today's Web interactions are frequently short, with an increasing number of responses carrying only control information and no data. While HTTP uses client-initiated TCP for all Web interactions, TCP is not always well-suited for short interactions. Furthermore, client-initiated TCP handicaps the deployment of interception caches in the network because of the possibility of disrupted connections when some client packets bypass the cache on their way to the server. We propose a new transfer protocol for Web traffic, called Dual-transport HTTP (DHTTP), which splits the traffic between UDP and TCP channels. When choosing the TCP channel, it is the server who opens the connection back to the client. Among important aspects of DHTTP are adapting to bottleneck shifts between a server and the network and coping with the unreliable nature of UDP The comparative performance study of DHTTP and HTTP using trace-driven simulation as well as testing real HTTP and DHTTP servers showed a significant performance advantage of DHTTP when the bottleneck is at the server and comparable performance when the bottleneck is in the network. By using server-initiated TCP, DHTTP also eliminates the possibility of disrupted TCP connections in the presence of interception caches thereby allowing unrestricted caching within backbones.
引用
收藏
页码:1597 / 1606
页数:10
相关论文
共 50 条
  • [1] DHTTP: An efficient and cache-friendly transfer protocol for the web
    Rabinovich, M
    Wang, H
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2004, 12 (06) : 1007 - 1020
  • [2] SINE: Cache-Friendly Integrity for the Web
    Gaspard, Camille
    Goldberg, Sharon
    Itani, Wassim
    Bertino, Elisa
    Nita-Rotaru, Cristina
    2009 5TH IEEE WORKSHOP ON SECURE NETWORK PROTOCOLS, 2009, : 7 - +
  • [3] A cache-friendly truncated FFT
    Harvey, David
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (27-29) : 2649 - 2658
  • [4] The design of a cache-friendly BDD library
    Long, DE
    1998 IEEE/ACM INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN: DIGEST OF TECHNICAL PAPERS, 1998, : 639 - 645
  • [5] Cache-friendly implementations of transitive closure
    Penner, M
    Prasanna, VK
    2001 INTERNATIONAL CONFERENCE ON PARALLEL ARCHITECTURES AND COMPILATION TECHNIQUES, PROCEEDINGS, 2001, : 185 - 196
  • [6] Split the cash from cache-friendly recommendations
    Tsigkari, Dimitra
    Iosifidis, George
    Spyropoulos, Thrasyvoulos
    2021 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2021,
  • [7] Cache-friendly Data Layout for Massive Graph
    Shan, Yuxiang
    Shi, Zhan
    Feng, Dan
    Ouyang Mengyun
    Wang, Fang
    2018 IEEE INTERNATIONAL CONFERENCE ON NETWORKING, ARCHITECTURE AND STORAGE (NAS), 2018,
  • [8] Cache-Friendly Bitmap Compression on Symmetric Multiprocessors
    Ingerson, Alexia
    Chiu, David
    Sawin, Jason
    2017 IEEE INTERNATIONAL CONFERENCE ON AUTOMATIC COMPUTING (ICAC), 2017, : 71 - 72
  • [9] Web service decomposition: Edge computing architecture for cache-friendly e-commerce applications
    Tatemura, J
    DEEC 2005: INTERNATIONAL WORKSHOP ON DATA ENGINEERING ISSUES IN E-COMMERCE, PROCEEDINGS, 2005, : 81 - 87
  • [10] Wavefront cache-friendly algorithm for compact numerical schemes
    Povitsky, A
    APPLIED MATHEMATICS LETTERS, 2001, 14 (04) : 449 - 454