CServ : an Internetwork architecture supporting mission-critical messaging with probabilistic performance guarantees

We present the fundamental framework for a multi-service, heterogeneous internetworking architecture that provides probabilistic, end-to-end quality of service guarantees to the data application for short critical messages prior to transmission. The class of critical network messages spans many applications in the civilian and defense network realms, including command and control of crucial public infrastructure, early warning alerts, and military command dissemination. These network applications share a need for a high probability of successful delivery with stringent delay requirements. The IP Internet is not well-suited to bear mission-critical messages across administrative domain boundaries with these demands because IP is a purely best effort network service and Border Gateway Protocol intentionally obscures the detailed administrative domain state information needed to describe the performance of internetwork paths. Current solutions to critical messaging involve the quasi-static provisioning of circuit connections, an approach that is not scalable for general mission requirements. The Critical Service architecture presented in this work directly addresses the need to generate a priori probabilistic guarantees without explicit path reservation overhead in an on-demand and dynamic fashion. The Critical Service architecture leverages a logically-centralized control plane, divorced from the network data plane, which aggregates a compact set of performance state information from participating networks. While these networks retain autonomy and routing control, we introduce the State Measurement Service necessary to characterize the intranetwork services offered by these networks to critical message datagrams. The learned performance measurements are aggregated and pruned by a local controller such that only the minimal required internal state is revealed to the centralized arbiter. Internetwork routing decisions for critical messages are made on a transaction-specific basis using this global state information and the specified service demands of the network application. An algorithmic method is developed that discovers internetwork paths and composes diversity-routed solutions that satisfy the requested minimum reliability and maximum tolerable delay bound performance requirements. A form of source routing using the computed internetwork service enforces the network-granularity routing solution.

Department dc:contributor.department

Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2016

Author dc:creator

• Carey, Matthew F. (Matthew Francis)

Advisor dc:contributor.advisor

• Vincent W. S. Chan.

• Electrical Engineering and Computer Science.

Statement dc:rights

• 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.

Licence dc:rights.uri

• http://dspace.mit.edu/handle/1721.1/7582

Language dc:language.iso

eng

Handle dc:identifier.uri

http://hdl.handle.net/1721.1/103719

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/103719