<?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-23T23:32:48Z</responseDate><request verb="GetRecord" identifier="oai:dspace.mit.edu:1721.1/9456" metadataPrefix="dim">https://dspace.mit.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:dspace.mit.edu:1721.1/9456</identifier><datestamp>2026-06-05T20:26:53Z</datestamp><setSpec>com_1721.1_7582</setSpec><setSpec>com_1721.1_7581</setSpec><setSpec>col_1721.1_131024</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 N. Tsitsiklis.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en_US">Bharti, Piyush, 1976-</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department" lang="en_US">Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2005-08-22T18:30:17Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2005-08-22T18:30:17Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="copyright" lang="en_US">1999</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en_US">1999</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/1721.1/9456</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="oclc" lang="en_US">43443061</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Thesis (S.B. and M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1999.</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Includes bibliographical references (leaf 102).</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">A service provider who provides users access· to a communication network is constrained in the system by the limited amount of bandwidth that can be offered to users. We will discuss congestion-dependent pricing, a method of pricing connection access to the network that accounts for this bandwidth constraint. Different models for the system are analyzed and simulated. The case of multiple classes of users as well as the case of a probabilistic demand function are analyzed in detail. The dynamic congestion-dependent pricing policy that maximizes performance will be determined using dynamic programming. The steady state revenue generated for the service provider will be used as the measure of system performance. Additionally, approximation and estimation techniques to simplify analysis and implementation of different systems are analyzed.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="statementofresponsibility" lang="en_US">by Piyush Bharti.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">S.B.</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">102 leaves</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">4490730 bytes</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">4490488 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">Congestion-dependent pricing for a service provider</dim:field>
   <dim:field mdschema="dc" element="title" qualifier="alternative" lang="en_US">Congestion-dependent network pricing for a service provider</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="0057f9ae-669b-4fb9-af85-f10a20331c43">
	&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>Congestion-dependent pricing for a service provider&lt;/Title>
   	&lt;Subtitle>Congestion-dependent network pricing for a service provider&lt;/Subtitle>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>1999&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Bharti, Piyush, 1976-&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>A service provider who provides users access· to a communication network is constrained in the system by the limited amount of bandwidth that can be offered to users. We will discuss congestion-dependent pricing, a method of pricing connection access to the network that accounts for this bandwidth constraint. Different models for the system are analyzed and simulated. The case of multiple classes of users as well as the case of a probabilistic demand function are analyzed in detail. The dynamic congestion-dependent pricing policy that maximizes performance will be determined using dynamic programming. The steady state revenue generated for the service provider will be used as the measure of system performance. Additionally, approximation and estimation techniques to simplify analysis and implementation of different systems are analyzed.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>