Please use this identifier to cite or link to this item:
http://arks.princeton.edu/ark:/88435/dsp019z903260h
Title: | Detecting Violations of Service-Level Agreements in Programmable Switches |
Authors: | Lee, Mack |
Advisors: | Rexford, Jennifer |
Department: | Computer Science |
Class Year: | 2018 |
Abstract: | Service level agreements (SLA) are an integral part in the delivery of services between internet service providers and their customers. They define the quality of service (QoS) that a provider promises to the customer. The implications of monitoring SLA compliance benefits both providers and customers: customers can verify whether providers uphold their QoS guarantees and providers can take corrective action if a SLA violation is detected. However, current active network measurement techniques used to monitor SLA are not accurate and are not representative of the traffic between customers and providers. In this paper, we design an algorithm and data structure to passively measure latency/RTT such that it can be applied to monitoring SLA. Our algorithm uses constant time processing per packet and our data structure uses bounded memory, making our design hardware-friendly. We evaluate the performance of our methods using trace-driven simulations on a Python prototype. |
URI: | http://arks.princeton.edu/ark:/88435/dsp019z903260h |
Type of Material: | Princeton University Senior Theses |
Language: | en |
Appears in Collections: | Computer Science, 1988-2020 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
LEE-MACK-THESIS.pdf | 652.12 kB | Adobe PDF | Request a copy |
Items in Dataspace are protected by copyright, with all rights reserved, unless otherwise indicated.