On the Capacity Requirement for Arbitrary End-to-End Deadline and Reliability Guarantees in Multi-hop Networks

Abstract

It has been shown that it is impossible to achieve both stringent end-to-end deadline and reliability guarantees in a large network without having complete information of all future packet arrivals. In order to maintain desirable performance in the presence of uncertainty of future packet arrivals, common practice is to add redundancy by increasing link capacities. This paper studies the amount of capacity needed to provide stringent performance guarantees and propose a low-complexity online algorithm. Without adding redundancy, we further propose a low-complexity order-optimal online policy for the network.

Document Details

Document Type
Pub Defense Publication
Publication Date
Jun 05, 2017
Source ID
10.1145/3143314.3078540

Entities

People

  • Han Deng
  • I-Hong Hou

Organizations

  • Army Research Office
  • United States Army Research Laboratory

Tags

Fields of Study

  • Computer science

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Computer Networking