The following pages link to Adversarial queuing theory (Q2947002):
Displaying 42 items.
- Tight performance bounds in the worst-case analysis of feed-forward networks (Q312640) (← links)
- Competitive buffer management with packet dependencies (Q388119) (← links)
- An excursion-theoretic approach to stability of discrete-time stochastic hybrid systems (Q535335) (← links)
- The robustness of stability under link and node failures (Q650924) (← links)
- The chilean highway problem (Q703556) (← links)
- Maria Serna's contributions to adversarial queuing theory (Q826320) (← links)
- Stability of adversarial Markov chains, with an application to adaptive MCMC algorithms (Q894817) (← links)
- On the power of lookahead in on-line server routing problems (Q959800) (← links)
- Stability bounds in networks with dynamic link capacities (Q975554) (← links)
- On deciding stability of multiclass queueing networks under buffer priority scheduling policies (Q983890) (← links)
- The increase of the instability of networks due to quasi-static link capacities (Q995558) (← links)
- An adversarial queueing model for online server routing (Q995586) (← links)
- Adversarial queuing theory with setups (Q1006038) (← links)
- Packet latency of deterministic broadcasting in adversarial multiple access channels (Q1628784) (← links)
- Two queues with non-stochastic arrivals (Q1667172) (← links)
- Self-stabilizing repeated balls-into-bins (Q1733393) (← links)
- A note on models for non-probabilistic analysis of packet switching networks. (Q1853146) (← links)
- Online stochastic optimization under time constraints (Q1958625) (← links)
- Stable routing scheduling algorithms in multi-hop wireless networks (Q2140563) (← links)
- Universal stability in multi-hop radio networks (Q2194858) (← links)
- Broadcasting in ad hoc multiple access channels (Q2345466) (← links)
- Learning lexicographic orders (Q2371364) (← links)
- Maximum throughput of multiple access channels in adversarial environments (Q2377132) (← links)
- The complexity of deciding stability under FFS in the adversarial queueing model (Q2390263) (← links)
- The network as a storage device: dynamic routing with bounded buffers (Q2391188) (← links)
- Adaptive packet scheduling over a wireless channel under constrained jamming (Q2401762) (← links)
- Adversarial multiple access channels with individual injection rates (Q2408561) (← links)
- Performance of scheduling policies in adversarial networks with non-synchronized clocks (Q2429719) (← links)
- Instability behaviour of heterogeneous multimedia networks under dynamic adversarial attacks (Q2450503) (← links)
- A mathematical model for the TCP tragedy of the commons (Q2570124) (← links)
- Broadcasting in Ad Hoc Multiple Access Channels (Q2868648) (← links)
- Robust Queueing Theory (Q3450468) (← links)
- Stability in Heterogeneous Dynamic Multimedia Networks (Q3464475) (← links)
- The Distributed Wireless Gathering Problem (Q3511417) (← links)
- The Effects of Local Randomness in the Adversarial Queueing Model (Q3541127) (← links)
- On Scheduling Policies for Streams of Structured Jobs (Q3543294) (← links)
- UNIVERSAL ROUTING AND PERFORMANCE ASSURANCE FOR DISTRIBUTED NETWORKS (Q3636561) (← links)
- Adversarial models for priority‐based networks (Q4651937) (← links)
- Local queuing under contention (Q5090920) (← links)
- Optimal Packet-Oblivious Stable Routing in Multi-hop Wireless Networks (Q5100957) (← links)
- Coordination Problems in Ad Hoc Radio Networks (Q5391120) (← links)
- Optimal Algorithms for Detecting Network Stability (Q5452165) (← links)
