<?xml version='1.0' encoding='UTF-8'?><?xml-stylesheet href='static/style.xsl' type='text/xsl'?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T08:41:20Z</responseDate><request verb="GetRecord" identifier="oai:ecommons.cornell.edu:1813/3492" metadataPrefix="dim">https://ecommons.cornell.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:ecommons.cornell.edu:1813/3492</identifier><datestamp>2026-05-14T13:52:01Z</datestamp><setSpec>com_1813_35</setSpec><setSpec>col_1813_47</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author">Ramasubramanian, Venugopalan</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2006-08-31T14:12:16Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2006-08-31T14:12:16Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2006-08-31T14:12:16Z</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/1813/3492</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="bibid">6475867</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">Decentralized network services, such as naming systems, content&#xd;
distribution networks, and publish-subscribe systems, play an&#xd;
increasingly critical role and are required to provide high&#xd;
performance, low latency service, achieve high availability in the&#xd;
presence of network and node failures, and handle a large volume&#xd;
of users. Judicious utilization of expensive system resources,&#xd;
such as memory space, network bandwidth, and number of machines,&#xd;
is fundamental to achieving the above properties.  Yet, current&#xd;
network services typically rely on less-informed, heuristic-based&#xd;
techniques to manage scarce resources, and often fall short of&#xd;
expectations.&#xd;
&#xd;
This thesis presents a principled approach for building high&#xd;
performance, robust, and scalable network services.  The key&#xd;
contribution of this thesis is to show that resolving the&#xd;
fundamental cost-benefit tradeoff between resource consumption and&#xd;
performance through mathematical optimization is practical in&#xd;
large-scale distributed systems, and enables decentralized network&#xd;
services to meet efficiently system-wide performance goals. This&#xd;
thesis presents a practical approach for resource management in&#xd;
three stages: analytically model the cost-benefit tradeoff as a&#xd;
constrained optimization problem, determine a near-optimal&#xd;
resource allocation strategy on the fly, and enforce the derived&#xd;
strategy through light-weight, decentralized mechanisms.  It&#xd;
builds on self-organizing structured overlays, which provide&#xd;
failure resilience and scalability, and complements them with&#xd;
stronger performance guarantees and robustness under sudden&#xd;
changes in workload.  This work enables applications to meet&#xd;
system-wide performance targets, such as low average response&#xd;
times, high cache hit rates, and small update dissemination times&#xd;
with low resource consumption. Alternatively, applications can&#xd;
make the maximum use of available resources, such as storage and&#xd;
bandwidth, and derive large gains in performance.&#xd;
&#xd;
I have implemented an extensible framework called Honeycomb to&#xd;
perform cost-aware resource management on structured overlays&#xd;
based on the above approach and built three critical network&#xd;
services using it. These services consist of a new name system for&#xd;
the Internet called CoDoNS that distributes data associated with&#xd;
domain names, an open-access content distribution network called&#xd;
CobWeb that caches web content for faster access by users, and an&#xd;
online information monitoring system called Corona that notifies&#xd;
users about changes to web pages.  Simulations and performance&#xd;
measurements from a planetary-scale deployment show that these&#xd;
services provide unprecedented performance improvement over the&#xd;
current state of the art.</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">1626474 bytes</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US" />
   <dim:field mdschema="dc" element="subject" lang="en_US">Computer Science</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Distributed Systems</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Cost-Aware Resource Management for Decentralized Internet Services</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">dissertation or thesis</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="collection" authority="https://cornell-ecommons.eks.prod.4science.cloud/handle/1813/47" confidence="600">Cornell Theses and Dissertations</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="author">Ramasubramanian, Venugopalan</dim:field>
   <dim:field mdschema="cris" element="virtualsource" qualifier="collection">5893a6ea-7af3-41d7-abc6-04bcd26ab5df</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="bc773525-5699-442a-9df8-c10cd30e9352">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
   	&lt;Title>Cost-Aware Resource Management for Decentralized Internet Services&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2006-08-31T14:12:16Z&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Ramasubramanian, Venugopalan&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;Keyword>Computer Science&lt;/Keyword>
    &lt;Keyword>Distributed Systems&lt;/Keyword>
   	&lt;Abstract>Decentralized network services, such as naming systems, content&#xd;
distribution networks, and publish-subscribe systems, play an&#xd;
increasingly critical role and are required to provide high&#xd;
performance, low latency service, achieve high availability in the&#xd;
presence of network and node failures, and handle a large volume&#xd;
of users. Judicious utilization of expensive system resources,&#xd;
such as memory space, network bandwidth, and number of machines,&#xd;
is fundamental to achieving the above properties.  Yet, current&#xd;
network services typically rely on less-informed, heuristic-based&#xd;
techniques to manage scarce resources, and often fall short of&#xd;
expectations.&#xd;
&#xd;
This thesis presents a principled approach for building high&#xd;
performance, robust, and scalable network services.  The key&#xd;
contribution of this thesis is to show that resolving the&#xd;
fundamental cost-benefit tradeoff between resource consumption and&#xd;
performance through mathematical optimization is practical in&#xd;
large-scale distributed systems, and enables decentralized network&#xd;
services to meet efficiently system-wide performance goals. This&#xd;
thesis presents a practical approach for resource management in&#xd;
three stages: analytically model the cost-benefit tradeoff as a&#xd;
constrained optimization problem, determine a near-optimal&#xd;
resource allocation strategy on the fly, and enforce the derived&#xd;
strategy through light-weight, decentralized mechanisms.  It&#xd;
builds on self-organizing structured overlays, which provide&#xd;
failure resilience and scalability, and complements them with&#xd;
stronger performance guarantees and robustness under sudden&#xd;
changes in workload.  This work enables applications to meet&#xd;
system-wide performance targets, such as low average response&#xd;
times, high cache hit rates, and small update dissemination times&#xd;
with low resource consumption. Alternatively, applications can&#xd;
make the maximum use of available resources, such as storage and&#xd;
bandwidth, and derive large gains in performance.&#xd;
&#xd;
I have implemented an extensible framework called Honeycomb to&#xd;
perform cost-aware resource management on structured overlays&#xd;
based on the above approach and built three critical network&#xd;
services using it. These services consist of a new name system for&#xd;
the Internet called CoDoNS that distributes data associated with&#xd;
domain names, an open-access content distribution network called&#xd;
CobWeb that caches web content for faster access by users, and an&#xd;
online information monitoring system called Corona that notifies&#xd;
users about changes to web pages.  Simulations and performance&#xd;
measurements from a planetary-scale deployment show that these&#xd;
services provide unprecedented performance improvement over the&#xd;
current state of the art.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>