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

Han Deng, I. Hong Hou

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)15-16
Number of pages2
JournalPerformance Evaluation Review
Volume45
Issue number1
DOIs
StatePublished - Jun 5 2017

Keywords

  • capacity performance trade-off
  • competitiveratio
  • multi-hop network
  • online scheduling

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'On the Capacity Requirement for Arbitrary End-to-End Deadline and Reliability Guarantees in Multi-hop Networks'. Together they form a unique fingerprint.

Cite this