Competitive admission control and routing for multi-service general topology networks

A. Dasylva, Rayadurgam Srikant

Research output: Contribution to journalArticle

Abstract

We consider the problem of routing permanent virtual circuits over general-topology networks under some shortest-path rule. We derive bounds on the competitiveness ratio of any on-line algorithm as a function of the cost function used to describe the congestion on each network element, link or node.

Original languageEnglish (US)
Pages (from-to)4032-4037
Number of pages6
JournalProceedings of the IEEE Conference on Decision and Control
Volume4
StatePublished - 1999
Externally publishedYes

ASJC Scopus subject areas

  • Chemical Health and Safety
  • Control and Systems Engineering
  • Safety, Risk, Reliability and Quality

Fingerprint Dive into the research topics of 'Competitive admission control and routing for multi-service general topology networks'. Together they form a unique fingerprint.

  • Cite this