The Effective Bandwidth Problem Revisited

DOI10.1080/15326340802427430zbMATH Open1153.60390arXivmath/0604182OpenAlexW3099011620MaRDI QIDQ3548747FDOQ3548747

Authors: Vyacheslav Abramov 

Publication date: 17 December 2008

Published in: Stochastic Models (Search for Journal in Brave)

Abstract: The paper studies a single-server queueing system with autonomous service and $ell$ priority classes. Arrival and departure processes are governed by marked point processes. There are $ell$ buffers corresponding to priority classes, and upon arrival a unit of the $k$th priority class occupies a place in the $k$th buffer. Let $N^{(k)}$, $k=1,2,\mathrm{...},ell$ denote the quota for the total $k$th buffer content. The values $N^{(k)}$ are assumed to be large, and queueing systems both with finite and infinite buffers are studied. In the case of a system with finite buffers, the values $N^{(k)}$ characterize buffer capacities. The paper discusses a circle of problems related to optimization of performance measures associated with overflowing the quota of buffer contents in particular buffers models. Our approach to this problem is new, and the presentation of our results is simple and clear for real applications.

Full work available at URL: https://arxiv.org/abs/math/0604182

Recommendations

• scientific article; zbMATH DE number 932427
• scientific article; zbMATH DE number 4121293
• Maximal effective bandwidth of constrained traffic
• Effective bandwidths and performance bounds in high-speed communication systems
• Lower bounds for the bandwidth problem
• scientific article; zbMATH DE number 2079803
• Finding exact solutions to the bandwidth minimization problem
• scientific article; zbMATH DE number 1895637
• On Some Variants of the Bandwidth Minimization Problem

zbMATH Keywords

mathematical programmingstochastic differential equationpoint processesasymptotic analysisloss probabilitypriority queuesloss systemsautonomous queuebatch arrivals and servicesmartingales and semi-martingales

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Asymptotic approximations, asymptotic expansions (steepest descent, etc.) (41A60) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Tauberian theorems (40E05) Series expansions (e.g., Taylor, Lidstone series, but not Fourier series) (41A58) Applications of stochastic analysis (to PDEs, etc.) (60H30) Communication networks in operations research (90B18)

Cites Work

• Parallel and tandem fluid networks with dependent Lévy inputs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Heavy-Traffic Limits for the G/H₂*/n/mQueue
• Title not available (Why is that?)
• On the Stationary Distribution of theGI^X/M^Y/1 Queueing System
• Asymptotic analysis of the \(GI/M/1/n\) loss system as \(n\) increases to infinity
• Asymptotic Behavior of the Number of Lost Messages
• Complementary generating functions for theM^X/GI/1/kandGI/M^y/1/Kqueues and their application to the comparison of loss probabilities
• Reflected diffusions defined via the extended Skorokhod map
• Networks of queues with batch services and customer coalescence
• Sample path large deviations for queues with many inputs
• Large deviations, the shape of the loss curve, and economies of scale in large multiplexers
• Heavy-traffic limits for loss proportions in single-server queues
• Asymptotic buffer overflow probabilities in multiclass multiplexers: an optimal control approach
• Limit non-stationary behavior of large closed queueing networks with bottlenecks
• A large closed queueing network containing two types of node and multiple customer classes: one bottleneck station
• Asymptotic behavior of loss probability in GI/M/1/\(K\) queue as \(K\) tends to infinity
• The output of a switch, or, effective bandwidths for networks
• Sharp results on convergence rates for the distribution of \(\text{GI}/ \text{M}/1/K\) queues as \(K\) tends to infinity
• Etude d'une file GI/G/1 à service autonome (avec vacances du serveur)
• A large closed queueing network with autonomous service and bottleneck
• Large closed queueing networks in semi-Markov environment and their application
• Note sur un modele de file GI/G/1 a service autonome (avec vacances du serveur)
• Title not available (Why is that?)
• Search for an extremum of unimodal function of one variable in an unbounded set

Cited In (12)

• Bandwidth and distortion revisited
• The buffer-bandwidth trade-off curve is convex
• Title not available (Why is that?)
• Workload bounds in fluid models with priorities
• Buffer's size optimization in a queue system with multiple classes of clients and different requirements of retards and losses
• Large closed queueing networks in semi-Markov environment and their application
• Takács' asymptotic theorem and its applications: a survey
• Resource allocation in a multiple-priority buffered link
• New results on edge-bandwidth
• Effective bandwidths at multi-class queues
• Influence of real-time queue capacity on system contents in DiffServ's expedited forwarding per-hop-behavior
• Two models of two-dimensional bandwidth problems

This page was built for publication: The Effective Bandwidth Problem Revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548747)