Bandwidth sharing and admission control for elastic traffic
From MaRDI portal
Publication:1859077
DOI10.1023/A:1019138827659zbMath1030.68774OpenAlexW1529132671MaRDI QIDQ1859077
Publication date: 17 February 2003
Published in: Telecommunication Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1019138827659
Network design and communication in computer systems (68M10) Computing methodologies and applications (68U99) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (54)
Fluid model for a network operating under a fair bandwidth-sharing policy. ⋮ Evaluation and prediction of an optimal control in a processor sharing queueing system with heterogeneous servers ⋮ SRPT applied to bandwidth-sharing networks ⋮ Stability conditions for a discrete-time decentralised medium access algorithm ⋮ Congestion in large balanced multirate networks ⋮ Max-min fairness in multi-commodity flows ⋮ Impact of fairness and heterogeneity on delays in large-scale centralized content delivery systems ⋮ \(M/G/1/\mathrm{MLPS}\) compared with \(M/G/1/\mathrm{PS}\) within service time distribution class IMRL ⋮ Minimality of EDF networks with resource sharing ⋮ Asymptotic behavior of a critical fluid model for bandwidth sharing with general file size distributions ⋮ A stability conjecture on bandwidth sharing networks ⋮ On the flow-level stability of data networks without congestion control: the case of linear networks and upstream trees ⋮ Performance of CSMA in multi-channel wireless networks ⋮ Monotonicity properties for multi-class queueing systems ⋮ Integrating streaming and file-transfer internet traffic: fluid and diffusion approximations ⋮ Edge minimality of EDF resource sharing networks ⋮ Sojourn time asymptotics in a parking lot network ⋮ Simple form control policies for resource sharing networks with HGI performance ⋮ Poly-symmetry in processor-sharing systems ⋮ Comparison of stability regions for a line distribution network with stochastic load demands ⋮ Stability of linear EDF networks with resource sharing ⋮ Stability of a Subcritical Fluid Model for Fair Bandwidth Sharing with General File Size Distributions ⋮ Qualitative properties of \(\alpha\)-fair policies in bandwidth-sharing networks ⋮ Resource sharing networks: Overview and an open problem ⋮ Fluid models of congestion collapse in overloaded switched networks ⋮ Transform Methods for Heavy-Traffic Analysis ⋮ Asymptotic Fluid Optimality and Efficiency of the Tracking Policy for Bandwidth-Sharing Networks ⋮ Information and Memory in Dynamic Resource Allocation ⋮ Insensitive traffic models for communication networks ⋮ Insensitive, maximum stable allocations converge to proportional fairness ⋮ A survey on discriminatory processor sharing ⋮ A queueing analysis of max-min fairness, proportional fairness and balanced fairness ⋮ Fluid models of integrated traffic and multipath routing ⋮ Resource pooling in congested networks: Proportional fairness and product form ⋮ State space collapse and diffusion approximation for a network operating under a fair bandwidth sharing policy ⋮ Stability of Processor Sharing Networks with Simultaneous Resource Requirements ⋮ Network stability under max-min fair bandwidth sharing ⋮ Conditional Sojourn times and the volatility of payment schemes for bandwidth sharing in packet networks ⋮ Fluid limits for networks with bandwidth sharing and general document size distributions ⋮ Queueing models for the analysis of communication systems ⋮ Open problems in queueing theory inspired by datacenter computing ⋮ Stability conditions for a decentralised medium access algorithm: single- and multi-hop networks ⋮ Control Policies Approaching Hierarchical Greedy Ideal Performance in Heavy Traffic for Resource Sharing Networks ⋮ Waiting times for \(M/M\) systems under state-dependent processor sharing ⋮ Flow level convergence and insensitivity for multi-class queueing networks ⋮ Fluid Limits for Bandwidth-Sharing Networks with Rate Constraints ⋮ Proportional fairness and its relationship with multi-class queueing networks ⋮ Stability and moment bounds under utility-maximising service allocations: Finite and infinite networks ⋮ Sojourn times in the \(M/ PH/1\) processor sharing queue ⋮ Batch arrival processor-sharing with application to multi-level processor-sharing scheduling ⋮ Fair optimization and networks: a survey ⋮ Local edge minimality of SRPT networks with shared resources ⋮ Heavy-Traffic Insensitive Bounds for Weighted Proportionally Fair Bandwidth Sharing Policies ⋮ Minimal and Locally Edge Minimal Fluid Models for Resource-Sharing Networks
This page was built for publication: Bandwidth sharing and admission control for elastic traffic
