Worcester Polytechnic Institute Electronic Theses and Dissertations Collection

Title page for ETD etd-0305103-092907


Document Typedissertation
Author NameMikhailov, Mikhail
URNetd-0305103-092907
TitleDeterministic Object Management in Large Distributed Systems
DegreePhD
DepartmentComputer Science
Advisors
  • Prof. Craig E. Wills, Advisor
  • Prof. David Finkel, Committee Member
  • Prof. Robert E. Kinicki, Committee Member
  • Dr. Balachander Krishnamurthy, Committee Member
  • Keywords
  • Change Characteristics
  • Web Caching
  • Object Relationships
  • Distributed Object Management
  • Server Invalidation
  • Object Composition
  • Cache Consistency
  • Date of Presentation/Defense2003-02-03
    Availability unrestricted

    Abstract

    Caching is a widely used technique to improve the scalability of distributed systems. A central issue with caching is maintaining object replicas consistent with their master copies. Large distributed systems, such as the Web, typically deploy heuristic-based consistency mechanisms, which increase delay and place extra load on the servers, while not providing guarantees that cached copies served to clients are up-to-date. Server-driven invalidation has been proposed as an approach to strong cache consistency, but it requires servers to keep track of which objects are cached by which clients.

    We propose an alternative approach to strong cache consistency, called MONARCH, which does not require servers to maintain per-client state. Our approach builds on a few key observations. Large and popular sites, which attract the majority of the traffic, construct their pages from distinct components with various characteristics. Components may have different content types, change characteristics, and semantics. These components are merged together to produce a monolithic page, and the information about their uniqueness is lost. In our view, pages should serve as containers holding distinct objects with heterogeneous type and change characteristics while preserving the boundaries between these objects. Servers compile object characteristics and information about relationships between containers and embedded objects into explicit object management commands. Servers piggyback these commands onto existing request/response traffic so that client caches can use these commands to make object management decisions.

    The use of explicit content control commands is a deterministic, rather than heuristic, object management mechanism that gives content providers more control over their content. The deterministic object management with strong cache consistency offered by MONARCH allows content providers to make more of their content cacheable. Furthermore, MONARCH enables content providers to expose internal structure of their pages to clients.

    We evaluated MONARCH using simulations with content collected from real Web sites. The results show that MONARCH provides strong cache consistency for all objects, even for unpredictably changing ones, and incurs smaller byte and message overhead than heuristic policies. The results also show that as the request arrival rate or the number of clients increases, the amount of server state maintained by MONARCH remains the same while the amount of server state incurred by server invalidation mechanisms grows.

    Files
  • mikhailov.pdf

  • Browse by Author | Browse by Department | Search all available ETDs

    [WPI] [Library] [Home] [Top]

    Questions? Email etd-questions@wpi.edu
    Maintained by webmaster@wpi.edu