Approximating fluid schedules in packet-switched networks
Name
60351807-MIT.pdf
Description
Full printable version
Size
701.38 KB
Format
Adobe PDF
Checksum (MD5)
1e033f3be1f3719de38e42e4a30ff476
Author(s)
Rosenblum, Michael Aaron, 1976-
Advisor(s)
Michael X. Goemans and Vahid Tarokh.
Date Issued
2004
Publisher
Massachusetts Institute of Technology
Abstract
We consider a problem motivated by the desire to provide exible, rate-based, quality of service guarantees for packets sent over switches and switch networks. Our focus is solving a type of on-line, traffic scheduling problem, whose input at each time step is a set of desired traffic rates through the switch network. These traffic rates in general cannot be exactly achieved since they treat the incoming data as fluid, that is, they assume arbitrarily small fractions of packets can be transmitted at each time step. The goal of the traffic scheduling problem is to closely approximate the given sequence of traffic rates by a sequence of switch uses throughout the network in which only whole packets are sent. We prove worst-case bounds on the additional delay and buffer use that result from using such an approximation. These bounds depend on the network topology, the resources available to the scheduler, and the types of fluid policy allowed.
Description
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2004.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Includes bibliographical references (p. 145-151).
Subjects
Mathematics.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
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.
Persistent DSpace Link
