A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
A Characterization of Universal Stability in the Adversarial Queuing Model
2004
SIAM journal on computing (Print)
Preserved Fulltext
We study universal stability of directed and undirected graphs in the adversarial queuing model for static packet routing. ...
In each case we obtain a different characterization of the universal stability property in terms of a set of forbidden subgraphs. ...
We thank two anonymous referees for their useful comments that improved the readability of the paper. ...
doi:10.1137/s0097539703435522
fatcat:iploi3mszjgzpcb2tbrdjfp27a
Universal-stability results and performance bounds for greedy contention-resolution protocols
2001
Journal of the ACM
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We study the universal stability of networks (i.e., stability under all greedy protocols) and universal stability of protocols (i.e., stability in all networks). ...
A preliminary version of this work appeared in focus on a basic adversarial model of packet arrival and path determination for which the time-averaged arrival rate of packets requiring the use of any edge ...
However, the undirected version of the graph in Section 2.2 is not universally stable. ...
doi:10.1145/363647.363677
fatcat:beybx5pl2zh55fdlofbr3emdiu
The complexity of deciding stability under FFS in the Adversarial Queueing model
2004
Information Processing Letters
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
We address the problem of deciding whether a given network is stable in the Adversarial Queueing Model when considering farthest-from-source (FFS) as the queueing policy to schedule the packets through ...
Since universal stability of networks can be checked in polynomial time, we obtain that stability under FFS can also be decided in polynomial time. 2004 Elsevier B.V. All rights reserved. ...
We study the complexity of deciding stability under FFS in the adversarial queueing model. ...
doi:10.1016/j.ipl.2004.02.016
fatcat:cgknh6vpkzgv3k7fujffq7fc4e
Stability of heterogeneous multimedia networks against adversarial attacks
2008
2008 Third International Conference on Communications and Networking in China
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We focus on a basic adversarial model for packet arrival and path determination for which the time-averaged arrival rate of packets requiring a single edge is no more than 1. ...
A network is stable under a greedy protocol (or a composition of protocols) if, for any adversary of injection rate less than 1, the number of packets in the network remains bounded at all times. ...
undirected graphs such that a graph is stable, if and only if it does not contain any of the graphs of that set as a minor. ...
doi:10.1109/chinacom.2008.4685256
fatcat:sqor6xgqpffibpkavfycuqmgke
Adversarial Models for Priority-Based Networks
[chapter]
2003
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
In this article, we propose several variations of the adversarial queueing model and address stability issues of networks and protocols in those proposed models. ...
Concerning stability of networks in the proposed adversarial models, we show that the set of universally stable networks in the adversarial model remains the same in the priority, variable priority, failure ...
UNIVERSAL STABILITY OF PROTOCOLS In this section we address the universal stability property in the failure and priority models, from the point of view of the queueing policy. ...
doi:10.1007/978-3-540-45138-9_8
fatcat:kdwo5osnznbxlf454jwjp6rewm
Adversarial models for priority-based networks
2004
Networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
In this article, we propose several variations of the adversarial queueing model and address stability issues of networks and protocols in those proposed models. ...
Concerning stability of networks in the proposed adversarial models, we show that the set of universally stable networks in the adversarial model remains the same in the priority, variable priority, failure ...
UNIVERSAL STABILITY OF PROTOCOLS In this section we address the universal stability property in the failure and priority models, from the point of view of the queueing policy. ...
doi:10.1002/net.20044
fatcat:s2il56azvnendmg3zeq2bftpbq
Using fluid models to prove stability of adversarial queueing networks
2000
IEEE Transactions on Automatic Control
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
One direction of stability research has been conducted within the framework of adversarial queueing networks. In such networks an adversary injects packets for processing. ...
Abstract| A digital communication network can be modeled as an adversarial queueing network. An adversarial queueing network is de ned to be stable if the number of packets stays bounded over time. ...
An adversarial queueing network consists of an undirected graph (V; E), where V is the set of vertices and E is the set of edges. ...
doi:10.1109/9.847114
fatcat:5ryvszojmnbsplp52cau5eb6gi
Deciding the FIFO Stability of Networks in Polynomial Time
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
We offer the first polynomial time algorithm for deciding FIFO stability and simple-path FIFO stability of a directed network, answering an open question posed in [1, 4] . ...
Our characterization of FIFO stability is constructive and disproves an open characterization in [4] . ...
We work with the leaky bucket adversarial model of [5, 2] and consider two types of adversaries: the (r, b)-adversary and the (r, b)-simple-path-adversary. ...
doi:10.1007/11758471_11
fatcat:acgf5fz2trfzhmwobqihcspm5q
An adversarial queueing model for online server routing
2007
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We propose a new model for online server routing, based on adversarial queueing theory. ...
In this framework, we consider a number of natural algorithms and we analyze their stability and performance. ...
Acknowledgement This work was partially supported by the Future and Emerging Technologies Unit of EC (IST priority -6th FP), under contract no. FP6-021235-2 (project ARRIVAL). ...
doi:10.1016/j.tcs.2007.05.034
fatcat:vsg7niqlrnhtvlwk5333tsejce
Stability of FIFO networks under adversarial models: State of the art
2007
Computer Networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Network stability is an important issue that has attracted the attention of many researchers in recent years. ...
Over the last few years, much research has been carried out to gain an understanding of the factors that affect the stability of packet-switched networks. ...
Acknowledgement The authors wish to thank the anonymous referees for several constructive suggestions and corrections. ...
doi:10.1016/j.comnet.2007.07.001
fatcat:lbchmumygngnrpcum3slmgzsnq
Page 2230 of Mathematical Reviews Vol. , Issue 2002C
[page]
2002
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
adversarial queueing model for packet routing. ...
Stability of networks in the adversarial queuing model for packet routing is examined. Packets are injected into the network by an adversary. ...
Adversarial queuing theory
2001
Journal of the ACM
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
We examine the stability of queuing networks and policies when the arrival process is adversarial, and provide some preliminary results in this direction. ...
We develop an adversarial theory of queuing aimed at addressing some of the restrictions inherent in probabilistic analysis and queuing theory based on time-invariant stochastic generation. ...
We are also indebted to the referees for their very constructive suggestions. ...
doi:10.1145/363647.363659
fatcat:wq6t2ocbvncytbprh6kmmpfjvm
Stability of the Max-Weight protocol in adversarial wireless networks
2012
2012 Proceedings IEEE INFOCOM
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We also prove the same stability of -approximate MAX-WEIGHT under the adversarial model. ...
We conclude the paper with a discussion of queue sizes in the adversarial model as well as a set of simulation results. ...
In this paper, we also prove the same stability of any -approximate Max-Weight under the adversarial model, when is small enough. ...
doi:10.1109/infcom.2012.6195486
dblp:conf/infocom/LimJA12
fatcat:ctkx5777hrdvzhy6iq3eqebyaq
Stability of the Max-Weight Protocol in Adversarial Wireless Networks
2014
IEEE/ACM Transactions on Networking
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We also prove the same stability of -approximate MAX-WEIGHT under the adversarial model. ...
We conclude the paper with a discussion of queue sizes in the adversarial model as well as a set of simulation results. ...
In this paper, we also prove the same stability of any -approximate Max-Weight under the adversarial model, when is small enough. ...
doi:10.1109/tnet.2013.2288372
fatcat:wm3mr3gurjg6rdlaclb4yeocxu
The increase of the instability of networks due to Quasi-Static link capacities
2007
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this work, we study the impact of the dynamic changing of the network link capacities on the stability properties of packetswitched networks. ...
Especially, we consider the Adversarial, Quasi-Static Queuing Theory model, where each link capacity may take on only two possible (integer) values, namely 1 and C > 1 under a (w, ρ)-adversary. ...
It has been shown in [2, 9] that these graphs are forbidden subgraphs for stability: a network containing any of them as a subgraph is not universally stable. ...
doi:10.1016/j.tcs.2007.04.008
fatcat:ifcgnls4abgz5gnteyx4eu3g7i
« Previous
Showing results 1 — 15 out of 155 results