Stability of adversarial routing with feedback

DOI10.1002/NET.21607MaRDI QIDQ4642441zbMATH OpenOpenAlexFDO

Authors Bogdan S. Chlebus, Dariusz R. Kowalski, Vicent Cholvi

Publication date 23 May 2018

Published in Networks (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1812.11113

zbMATH Keywords

adversarial queueingadversary with feedbacklink faultpacket routingscheduling policystabilitytransient faultuniversal stability

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Deterministic scheduling theory in operations research (90B35)

Abstract: We consider the impact of scheduling disciplines on performance of routing in the framework of adversarial queuing. We propose an adversarial model which reflects stalling of packets due to transient failures and explicitly incorporates feedback produced by a network when packets are stalled. This adversarial model provides a methodology to study stability of routing protocols when flow-control and congestion-control mechanisms affect the volume of traffic. We show that any scheduling policy that is universally stable, in the regular model of routing that additionally allows packets to have two priorities, remains stable in the proposed adversarial model.

Recommendations

• Stability of networks and protocols in the adversarial queueing model for packet routing
• scientific article; zbMATH DE number 1256755
• New Stability Results for Adversarial Queuing
• Stability of Adaptive and Nonadaptive Packet Routing Policies in Adversarial Queueing Networks
• Adversarial queuing theory

Cited in

(2)

• Stability of adaptive and non-adaptive packet routing policies in adversarial queueing networks
• Research on stability of large-scale adversarial service networks under priority

This page was built for publication: Stability of adversarial routing with feedback

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4642441)