Results 41 to 50 of about 120 (93)
An Adversarial Construction of Instability Bounds in LIS Networks
, 2005 In this work, we study the impact of dynamically changing link slowdowns on the stability properties of packetswitched networks under the Adversarial Queueing Theory framework.
Dimitrios Koukopoulos
core
One-counter Markov decision processes [PDF]
, 2010 We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs.OC-MDPs extend finite-state MDPs with an unbounded counter.
A. Kučera +14 more
core +1 more source
The impact of network structure on the stability of greedy protocols
, 2003 A packet-switching network is stable if the number of packets in the network remains bounded at all times. A very natural question that arises in the context of stability and instability properties of such networks is how network structure precisely ...
Dimitrios Koukopoulos +3 more
core +1 more source
Network optimization in adversarial environments
, 2018 Thesis: Ph. D., Massachusetts Institute of Technology, Department of Aeronautics and Astronautics, 2018.Cataloged from PDF version of thesis. "There are no tables included in this thesis.
Liang, Qingkai
core
The robustness of stability under link and node failures
, 2011 In the area of communication systems, stability refers to the property of keeping the amount of traffic in the system always bounded over time. Different communication system models have been proposed in order to capture the unpredictable behavior of ...
Blesa, Maria +5 more
core +1 more source
A Note on the use of topology extensions for provoking instability in communication networks
, 2004 We study some aspects of the instability of the last-in-first-out (LIFO) scheduling protocol in under-loaded packet-switched networks under the Adversarial Queueing Theory model [Borodin et al., Journal of the ACM, 48(1):13--38,2001] which allows to ...
Blesa Aguilera, Maria Josep
core +1 more source
Stochastic Network Optimization (SNO) concerns scheduling in stochastic queueing systems and has been widely studied in network theory. Classical SNO algorithms require network conditions to be stationary w.r.t.
Dai, Yan, Huang, Longbo
core +1 more source
Adaptive Scheduling over a Wireless Channel under Constrained Jamming [PDF]
, 2015 We consider a wireless channel between a single pair of stations (sender and receiver) that is being “watched” and disrupted by a malicious, adversarial jammer.
Georgiou, Chryssis +2 more
core
Deciding the FIFO Stability of Networks in Polynomial Time (full version
, 2006 . FIFO is the most prominent queueing strategy due to its simplicity and the fact that it only works with local information. Its analysis within the adversarial queueing theory however has shown, that there are networks that are not stable under the FIFO
Maik Weinard
core
Systems Analysis and Management: Structure, Strategy, and Design
, 1981 — Although instability in packet networks has been traditionally associated with overload conditions (because queueing network models show that, in simple configurations, only overload generates instability), some results showing instability in ...
A. Tarello +5 more
core