<?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-22T09:30:08Z</responseDate><request verb="GetRecord" identifier="oai:ecommons.cornell.edu:1813/47739" metadataPrefix="dim">https://ecommons.cornell.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:ecommons.cornell.edu:1813/47739</identifier><datestamp>2026-05-15T19:48:23Z</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">Nikolaou, Stavros</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="chair">Van Renesse, Robbert</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember">Kozen, Dexter Campbell</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember">Gehrke, Johannes E.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember">Tardos, Eva</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2017-04-04T20:27:06Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2017-04-04T20:27:06Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2017-01-30</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other">ProQuest Submission ID: 10027</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other">ProQuest Publication ID: 10174002</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/1813/47739</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="doi">https://doi.org/10.7298/X4DB7ZTF</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="bibid">9905985</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract">Many systems are designed to handle workloads with characteristics that are 
assumed to be static. Today's distributed systems, however, need to support a 
wide range of applications that incur dynamic workloads. As a result, the 
ability of a distributed system to adapt its operation to changing workloads is 
becoming an increasingly important property. There are two main types of 
approaches for supporting adaptivity: reactive approaches, which enable 
reconfiguration in response to a particular workload change, and proactive 
approaches, which continuously reconfigure the system in order to meet the 
demands of expected workload variations. 
The type of approach a system can use depends highly on the available knowledge 
on the targeted workload. On the one end of the spectrum there are workloads 
whose changes can be accurately predicted, for example in the case of well-
known periodic effects related to the access patterns of a particular service. 
Proactive approaches are a good candidate for such workloads since they can 
exploit prior knowledge of the workload's characteristics and drive the system 
to configurations that better suit the target workload. On the other end, there 
are workload changes that are very difficult to predict, e.g. attacks issued 
against the system in order to degrade some aspect of its operation. For 
unexpected workload changes, reactive approaches can be used to reconfigure the 
system when such changes are detected.
The focus of this dissertation is on designing and implementing distributed 
systems that support adaptivity. We present two main approaches, one proactive 
and one reactive, for dealing with two different kinds of dynamic workloads. 
The first describes proactive cache placement strategies for a cooperative 
cache built from individual client caches in an online social network or web 
service. We evaluate these strategies through simulations and compared with 
other common placement strategies under different workload scenarios. The 
second approach proposes a new asynchronous consensus protocol that we call 
\emph{Turtle Consensus}. Turtle Consensus works by reactively reconfiguring the 
consensus strategy as well as the set of nodes upon which the strategy is 
executed in order to deal with denial-of-service attacks. We use the resulting 
protocol to implement a state machine replication protocol which is evaluated 
against various adversarial scenarios. The results suggest that Turtle 
Consensus can achieve great performance under benign scenarios and comparable 
performance while under attack.
This thesis presents actionable results from two ends of a spectrum of 
approaches to on-the-fly adaptation in distributed systems.  While it is not 
the first to show examples of adaptive systems or argue its importance, our 
contributions significantly advance the state-of-the-art by pushing on 
boundaries at the ends of the spectrum of reactive and proactive approaches.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso">en_US</dim:field>
   <dim:field mdschema="dc" element="subject">Computer science</dim:field>
   <dim:field mdschema="dc" element="title">Proactive and reactive approaches for dynamic workloads</dim:field>
   <dim:field mdschema="dc" element="type">dissertation or thesis</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="discipline">Computer Science</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="grantor">Cornell University</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="level">Doctor of Philosophy</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="name">Ph. D., Computer Science</dim:field>
   <dim:field mdschema="dcterms" element="license">https://hdl.handle.net/1813/59810</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">Nikolaou, Stavros</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="c1da160a-247c-4a80-a802-0c230320f8bd">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
	&lt;Language>en_US&lt;/Language>
   	&lt;Title>Proactive and reactive approaches for dynamic workloads&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2017-01-30&lt;/PublicationDate>
   	&lt;DOI>https://doi.org/10.7298/X4DB7ZTF&lt;/DOI>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Nikolaou, Stavros&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;Abstract>Many systems are designed to handle workloads with characteristics that are 
assumed to be static. Today&amp;apos;s distributed systems, however, need to support a 
wide range of applications that incur dynamic workloads. As a result, the 
ability of a distributed system to adapt its operation to changing workloads is 
becoming an increasingly important property. There are two main types of 
approaches for supporting adaptivity: reactive approaches, which enable 
reconfiguration in response to a particular workload change, and proactive 
approaches, which continuously reconfigure the system in order to meet the 
demands of expected workload variations. 
The type of approach a system can use depends highly on the available knowledge 
on the targeted workload. On the one end of the spectrum there are workloads 
whose changes can be accurately predicted, for example in the case of well-
known periodic effects related to the access patterns of a particular service. 
Proactive approaches are a good candidate for such workloads since they can 
exploit prior knowledge of the workload&amp;apos;s characteristics and drive the system 
to configurations that better suit the target workload. On the other end, there 
are workload changes that are very difficult to predict, e.g. attacks issued 
against the system in order to degrade some aspect of its operation. For 
unexpected workload changes, reactive approaches can be used to reconfigure the 
system when such changes are detected.
The focus of this dissertation is on designing and implementing distributed 
systems that support adaptivity. We present two main approaches, one proactive 
and one reactive, for dealing with two different kinds of dynamic workloads. 
The first describes proactive cache placement strategies for a cooperative 
cache built from individual client caches in an online social network or web 
service. We evaluate these strategies through simulations and compared with 
other common placement strategies under different workload scenarios. The 
second approach proposes a new asynchronous consensus protocol that we call 
\emph{Turtle Consensus}. Turtle Consensus works by reactively reconfiguring the 
consensus strategy as well as the set of nodes upon which the strategy is 
executed in order to deal with denial-of-service attacks. We use the resulting 
protocol to implement a state machine replication protocol which is evaluated 
against various adversarial scenarios. The results suggest that Turtle 
Consensus can achieve great performance under benign scenarios and comparable 
performance while under attack.
This thesis presents actionable results from two ends of a spectrum of 
approaches to on-the-fly adaptation in distributed systems.  While it is not 
the first to show examples of adaptive systems or argue its importance, our 
contributions significantly advance the state-of-the-art by pushing on 
boundaries at the ends of the spectrum of reactive and proactive approaches.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>