On Providing Fair Circuit/Virtual-Circuit Networking Services
On Providing Fair Circuit/Virtual-Circuit Networking Services A Dissertation Presented to the faculty of the School of Engineering and Applied Science University of Virginia In Partial Fulfillment of the requirements for the Degree Doctor of Philosophy Computer Engineering by Mark E. McGinley May 2012 ⃝c Copyright by Mark E. McGinley All rights reserved May 2012 Abstract It has become clear that widespread collaboration in the scientific community, which can increas- ingly be characterized by geographically distributed and large-scale projects, requires predictable network service [1]. Predictable network service needed by applications such as large file trans- fers, remote visualization, and remote instrumentation can only be offered on connection-oriented networks. Circuit-switched and virtual-circuit networks offer such connection-oriented services. This dissertation addresses four issues that inhibit wider adoption of connection-oriented ser- vice. From a theoretical perspective, we address reservation systems and queueing systems. An important consideration for a reservation system with multiple classes, as are necessary to provide a level of service matched with a specific use, is fairness. First, we present a novel three-step scheduling algorithm that finds the optimal solution to a multi-class, fairness-considering bin pack- ing problem, and demonstrate how it can be used to ensure fairness in a reservation system. Sec- ond, with many types of reservation systems across different disciplines, we recognize a need for a uniform way to describe reservation systems, and so present a novel general reservation system model (GRSM), and analyze several examples of commonly encountered reservation and queue- ing systems to understand why certain systems belonging to the same category of examples use reservation systems while others use queueing systems.
[Show full text]