A scaling analysis of a star network with logarithmic weights

DOI10.1016/J.SPA.2018.06.002MaRDI QIDQ1999923zbMATH OpenOpenAlexWikidataFDO

Authors Philippe Robert, A. Véber

Publication date 27 June 2019

Published in Stochastic Processes and their Applications (Search for Journal in Brave)

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

zbMATH Keywords

communication networksfluid scalingseparation of timescales

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Queueing theory (aspects of probability theory) (60K25) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Queues and service in operations research (90B22)

Abstract: The paper investigates the properties of a class of resource allocation algorithms for communication networks: if a node of this network has $x$ requests to transmit, then it receives a fraction of the capacity proportional to $log(1+L)$, the logarithm of its current load $L$. A stochastic model of such an algorithm is investigated in the case of the star network, in which $J$ nodes can transmit simultaneously, but interfere with a central node $0$ in such a way that node $0$ cannot transmit while one of the other nodes does. One studies the impact of the log policy on these $J+1$ interacting communication nodes. A fluid scaling analysis of the network is derived with the scaling parameter $N$ being the norm of the initial state. It is shown that the asymptotic fluid behaviour of the system is a consequence of the evolution of the state of the network on a specific time scale $(N^t,,tin(0,1))$. The main result is that, on this time scale and under appropriate conditions, the state of a node with index $jgeq1$ is of the order of $N^{a_j(t)}$, with $0leq{a}_j(t)<1$, where $tmapsto{a}_j(t)$ is a piecewise linear function. Convergence results on the fluid time scale and a stability property are derived as a consequence of this study.

Recommendations

• A stochastic analysis of resource sharing with logarithmic weights
• Log-weight scheduling in switched networks
• Fluid model for a network operating under a fair bandwidth-sharing policy.
• Switched networks with maximum weight policies: fluid approximation and multiplicative state space collapse
• Fluid limits for networks with bandwidth sharing and general document size distributions

Cites work

• A limit theorem for perturbed operator semigroups with applications to random evolutions
• A stochastic analysis of resource sharing with logarithmic weights
• scientific article; zbMATH DE number 4215340 (Why is no real title available?)
• scientific article; zbMATH DE number 1947316 (Why is no real title available?)
• scientific article; zbMATH DE number 3316606 (Why is no real title available?)
• Log-weight scheduling in switched networks
• Time-shared Systems

This page was built for publication: A scaling analysis of a star network with logarithmic weights

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