«expected queue size»
۳۴۳ نتیجهSignaling for Decentralized Routing in a Queueing Network
A discrete-time decentralized routing problem in a service system consisting of two service stations and two controllers is investigated. Each controller is affiliated with one station. Each station has an infinite size buffer. Exogenous customer arrivals at each station occur wi
Single-Queue Decoding for Neural Machine Translation
Neural machine translation models rely on the beam search algorithm for decoding. In practice, we found that the quality of hypotheses in the search space is negatively affected owing to the fixed beam size. To mitigate this problem, we store all hypotheses in a single priority q
Simulating flow level bandwidth sharing with pareto distributed file sizes
Our goal is to achieve deeper understanding of the limitation of queueing models, on one hand, and of common simulation practice, on the other hand, as tools for predicting performance of bandwidth sharing between competing TCP flows. In particular, we (i) present an overview of
The Impact of Buffer Finiteness on the Loss Rate in a Priority Queueing System
Abstract. This paper discusses five different ways to approximate the loss rate in a fundamental two class priority system, where each class has its own finite capacity buffer, as well as an exact approach. We identify the type of error one can expect by assuming that one, or bot
Analysis of Shared Memory Priority Queues with two levels of traffic
Two rate SLAs become incrisingly popular in todays Internet, allowing a customer to save money by paying one price for commited traffic and a much lower price for additional traffic which is not guaranteed. These type of SLAs are suggested for all types of traffic from best effor
Performance Analysis of Clock-Regulated Queues with Output Multiplexing in Three Different 2 x 2 Crossbar Switch Architectures
Switches in interconnection networks for highly parallel shared memory computer systems may be implemented with different internal buffer structures. For a 2×2 synchronous switch, previous studies have often assumed a switch composed of two queues, one at each output, each of whi
Simple Algorithms for Routing on Butter y Networks with Bounded Queues
This paper examines several simple algorithms for routing packets on butterry networks with bounded queues. We show that for any greedy queuing protocol, a routing problem in which each of the N inputs sends a packet to a randomly chosen output requires O(log N) steps, with high
Simple Algorithms for Routing on Butterfly Networks with Bounded Queues
This paper examines several simple algorithms for routing packets on butterfly networks with bounded queues. We show that for any greedy queuing protocol, a routing problem in which each of the N inputs sends a packet to a randomly chosen output requires O(logN) steps, with high
A Communication Multiplexer Problem: Two Alternating Queues with Dependent Randomly-Timed Gated Regime
Two random traffic streams are competing for the service time of a single server (multiplexer). The streams form two queues, primary (queue 1) and secondary (queue 0). The primary queue is served exhaustively, after which the server switches over to queue 0. The duration of time
Stability and Probability 1 Convergence for Queueing Networks via Lyapunov Optimization
Lyapunov drift is a powerful tool for optimizing stochastic queueing networks subject to stability. However, the most convenient drift conditions often provide results in terms of a time average expectation, rather than a pure time average. This paper provides an extended drift-p