MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Graduate Theses
  • View Item
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Graduate Theses
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

A fundamental approach for providing service-level guarantees for wide-area networks

Author(s)
Bogle, Jeremy(Jeremy P.)
Thumbnail
Download1127386876-MIT.pdf (2.096Mb)
Other Contributors
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.
Advisor
Manya Ghobadi.
Terms of use
MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission. http://dspace.mit.edu/handle/1721.1/7582
Metadata
Show full item record
Abstract
To keep up with the continuous growth in demand, cloud providers spend millions of dollars augmenting the capacity of their wide-area backbones and devote significant effort to efficiently utilizing WAN capacity. A key challenge is striking a good balance between network utilization and availability, as these are inherently at odds; a highly utilized network might not be able to withstand unexpected traffic shifts resulting from link/node failures. I motivate this problem using real data from a large service provider and propose a solution called TeaVaR (Traffic Engineering Applying Value at Risk), which draws on financial risk theory to realize a risk management approach to traffic engineering (TE). I leverage empirical data to generate a probabilistic model of network failures, and formulate a Linear Program (LP) that maximizes bandwidth allocation to network users subject to a service level agreement (SLA). I prove TeaVaR's correctness, and then compare it to state-of-the-art TE solutions with extensive simulations across many network topologies, failure scenarios, and real-world traffic patterns. The results show that with TeaVaR, operators can support up to twice as much throughput as other TE schemes, at the same level of availability. I also construct a simulation tool that builds on my implementation of TeaVaR and simulates its usage in the data plane. This tool can be useful not only for testing TE schemes but also for capacity planning, as it allows network operators to see how their network is performing, where the bottlenecks are, and what kind of demand loads it can handle.
Description
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
 
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2019
 
Cataloged from student-submitted PDF version of thesis.
 
Includes bibliographical references (pages 55-58).
 
Date issued
2019
URI
https://hdl.handle.net/1721.1/122998
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Publisher
Massachusetts Institute of Technology
Keywords
Electrical Engineering and Computer Science.

Collections
  • Graduate Theses

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.