University of Notre Dame
Browse
LiX072006T.pdf (1.46 MB)

Improving Packet Caching Scalability Through the Concept of an Explicit End of Data Marker

Download (1.46 MB)
thesis
posted on 2006-07-19, 00:00 authored by Xiaolong Li
The web has witnessed an explosion of dynamic content generation to provide web users with an interactive and personalized experience. While traditional web caching techniques work well when redundancy occurs on an object-level basis (page, image, etc.), the use of dynamic content presents unique challenges. Although past work has addressed mechanisms for detecting redundancy despite dynamic content, the scalability of such techniques is limited. In this thesis, an effective and highly scalable approach, Explicit End of Data (EEOD) is presented, which allows the content designer to easily signal boundaries between cacheable and non-cacheable content. EEOD provides application-to-stack mechanisms to guarantee separation of packets with the end goal of simplifying packet-level caching mechanisms. Most importantly, EEOD does not require client-side modifications and can function in a variety of server-sideetwork deployment modes. Additionally, experimental studies are presented, showing EEOD offers 25% and 30% relative improvements in terms of bandwidth efficiency and retrieval time over current approaches in the literature.

History

Date Modified

2017-06-05

Defense Date

2006-07-14

Research Director(s)

Aaron Striegel

Committee Members

Surendar Chandra Christian Poellabauer

Degree

  • Master of Science in Computer Science and Engineering

Degree Level

  • Master's Thesis

Language

  • English

Alternate Identifier

etd-07192006-115006

Publisher

University of Notre Dame

Program Name

  • Computer Science and Engineering

Usage metrics

    Masters Theses

    Categories

    No categories selected

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC