Proceedings. Tenth International Conference on Parallel and Distributed Systems, 2004. ICPADS 2004.
DOI: 10.1109/icpads.2004.1316091
|View full text |Cite
|
Sign up to set email alerts
|

The impact of failure management on the stability of communication networks

Abstract: In this work we deal with communication networks in which links may fail. We propose an adversarial model for describing the traffic pattern occurring in this type of faulty systems and study properties concerning their stability, specially under (non-trivial) underloaded worse-case scenarios. We show that, depending on how the system is organized and prepared to deal with failures, the dynamics of the system change and thus the conditions for stability. We propose three different ways of failure management an… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
14
0

Publication Types

Select...
3
3

Relationship

2
4

Authors

Journals

citations
Cited by 8 publications
(14 citation statements)
references
References 21 publications
0
14
0
Order By: Relevance
“…The adversarial approach to modeling communication proved to be inspirational and versatile. Á lvarez et al [4] applied adversarial models to capture phenomena related to routing of packets with varying priorities and failures in networks.Álvarez et al [5] addressed the impact of link failures on stability of communication algorithms by way of modeling them in adversarial terms. Andrews and Zhang [12] considered adversarial networks in which nodes operate as switches connecting inputs with outputs, so that routed packets encounter additional congestion constrains at nodes when they compete with other packets for input and output ports and need to be queued when delayed.…”
Section: Of-rrwmentioning
confidence: 99%
“…The adversarial approach to modeling communication proved to be inspirational and versatile. Á lvarez et al [4] applied adversarial models to capture phenomena related to routing of packets with varying priorities and failures in networks.Álvarez et al [5] addressed the impact of link failures on stability of communication algorithms by way of modeling them in adversarial terms. Andrews and Zhang [12] considered adversarial networks in which nodes operate as switches connecting inputs with outputs, so that routed packets encounter additional congestion constrains at nodes when they compete with other packets for input and output ports and need to be queued when delayed.…”
Section: Of-rrwmentioning
confidence: 99%
“…Therefore, the interesting cases are those in which the adversary follows restriction (7) but cannot make an edge fail forever. A restricted version modeling only short-lived failures was considered in [3]. The Ᏸ 1 model in [3] is obtained when considering restriction (7) and the existence of a w bounding the number of consecutive steps that any edge can be failed.…”
Section: Conclusion and Open Problemsmentioning
confidence: 99%
“…A restricted version modeling only short-lived failures was considered in [3]. The Ᏸ 1 model in [3] is obtained when considering restriction (7) and the existence of a w bounding the number of consecutive steps that any edge can be failed. In [3], it is shown that the Ᏸ 1 model is equivalent to the failure model.…”
Section: Conclusion and Open Problemsmentioning
confidence: 99%
See 1 more Smart Citation
“…Implicitly, this assumption means that all the packets have the same size and all the links induce the same delay in each packet transmission. There have been generalizations of the aqt model to dynamic networks, like networks with failures [3,4,5,6] and networks with links with different and possibly variable capacities or delays [7,8,9]. These works still assume a synchronous network evolution, to the point that, for instance in [7] all capacities and slow-downs must have an integral value.…”
Section: Introductionmentioning
confidence: 99%