Author ORCID Identifier

http://orcid.org/0000-0001-5658-4752

Degree Year

2015

Document Type

Thesis

Degree Name

Bachelor of Arts

Department

Computer Science

Advisor(s)

Alexa Sharp

Keywords

Selfish routing, Dynamic flows, Deterministic queuing model

Abstract

Selfish routing on dynamic flows over time is used to model scenarios that vary with time in which individual agents act in their best interest. In this paper we provide a survey of a particular dynamic model, the deterministic queuing model, and discuss how the model can be adjusted and applied to different real-life scenarios. We then examine how these adjustments affect the computability, optimality, and existence of selfish routings.

Share

COinS