<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.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-09-19T12:53:34Z</responseDate><request verb="GetRecord" identifier="oai:dspace.mit.edu:1721.1/33338" metadataPrefix="dim">https://dspace.mit.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:dspace.mit.edu:1721.1/33338</identifier><datestamp>2022-01-13T07:54:29Z</datestamp><setSpec>com_1721.1_7582</setSpec><setSpec>com_1721.1_7581</setSpec><setSpec>col_1721.1_131023</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="advisor" lang="en_US">John V. Guttag.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en_US">Qureshi, Asfandyar</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="other" lang="en_US">Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department">Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2006-07-13T15:16:28Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2006-07-13T15:16:28Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="copyright" lang="en_US">2005</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en_US">2005</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/1721.1/33338</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="oclc" lang="en_US">62391934</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2005.</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Includes bibliographical references (p. 157-161).</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">Inverse multiplexing, or network striping, allows the construction of a high-bandwidth virtual channel from a collection of multiple low-bandwidth network channels. Striping systems usually employ a packet scheduling policy that allows applications to be oblivious of the way in which packets are routed to specific network channels. Though this is appropriate for many applications, many other applications can benefit from an approach that explicitly involves the application in the determination of the striping policy. Horde is middleware that facilitates flexible striping over Wireless Wide Area Network (WWAN) channels. Horde is unusual in that it separates the striping policy from the striping mechanism. It allows applications to describe network Quality-of-Service (QoS) objectives that the striping mechanism attempts to satisfy. Horde can be used by a set of data streams, each with its own QoS policy, to stripe data over a set of WWAN channels. The WWAN QoS variations observed across different channels and in time, provide opportunities to modulate stream QoS through scheduling. The key technical challenge in Horde is giving applications control over certain aspects of the data striping operation while at the same time shielding the application from low-level details. Horde exports a set of flexible abstractions replacing the application's network stack. Horde allows applications to express their policy goals as succinct network-QoS objectives. Each objective says something, relatively simple, about the sort of network QoS an application would like for some data stream(s). We present the Horde architecture, describe an early implementation, and examine how different policies can be used to modulate the quality-of-service observed across different independent data streams. Through experiments conducted on real and simulated network channels, we confirm our belief that the kind of QoS modulation Horde aims to achieve is realistic for actual applications.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="statementofresponsibility" lang="en_US">by Asfandyar Qureshi.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">M.Eng.</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent" lang="en_US">161 p.</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">10306058 bytes</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">10313618 bytes</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</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">eng</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en_US">Massachusetts Institute of Technology</dim:field>
   <dim:field mdschema="dc" element="rights" lang="en_US">M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.</dim:field>
   <dim:field mdschema="dc" element="rights" qualifier="uri">http://dspace.mit.edu/handle/1721.1/7582</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Electrical Engineering and Computer Science.</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Flexible application driven network striping over Wireless Wide Area Networks</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dspace" element="authorsordered">false</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="others" element="access-status">unknown</dim:field>
   <dim:field mdschema="others" element="access-status">unknown</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="40df162e-3fb9-4616-8c03-0d6d9b013435">
	&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>eng&lt;/Language>
   	&lt;Title>Flexible application driven network striping over Wireless Wide Area Networks&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2005&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Qureshi, Asfandyar&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;DisplayName>Massachusetts Institute of Technology&lt;/DisplayName>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;License>http://dspace.mit.edu/handle/1721.1/7582&lt;/License>
    &lt;Keyword>Electrical Engineering and Computer Science.&lt;/Keyword>
   	&lt;Abstract>Inverse multiplexing, or network striping, allows the construction of a high-bandwidth virtual channel from a collection of multiple low-bandwidth network channels. Striping systems usually employ a packet scheduling policy that allows applications to be oblivious of the way in which packets are routed to specific network channels. Though this is appropriate for many applications, many other applications can benefit from an approach that explicitly involves the application in the determination of the striping policy. Horde is middleware that facilitates flexible striping over Wireless Wide Area Network (WWAN) channels. Horde is unusual in that it separates the striping policy from the striping mechanism. It allows applications to describe network Quality-of-Service (QoS) objectives that the striping mechanism attempts to satisfy. Horde can be used by a set of data streams, each with its own QoS policy, to stripe data over a set of WWAN channels. The WWAN QoS variations observed across different channels and in time, provide opportunities to modulate stream QoS through scheduling. The key technical challenge in Horde is giving applications control over certain aspects of the data striping operation while at the same time shielding the application from low-level details. Horde exports a set of flexible abstractions replacing the application&amp;apos;s network stack. Horde allows applications to express their policy goals as succinct network-QoS objectives. Each objective says something, relatively simple, about the sort of network QoS an application would like for some data stream(s). We present the Horde architecture, describe an early implementation, and examine how different policies can be used to modulate the quality-of-service observed across different independent data streams. Through experiments conducted on real and simulated network channels, we confirm our belief that the kind of QoS modulation Horde aims to achieve is realistic for actual applications.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>