Conditional Sojourn times and the volatility of payment schemes for bandwidth sharing in packet networks

DOI10.1239/jap/1450802746zbMath1334.60196OpenAlexW2198430235MaRDI QIDQ2794718

Ravi R. Mazumdar, Fabrice M. Guillemin

Publication date: 11 March 2016

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.jap/1450802746

zbMATH Keywords

orthogonal polynomialsvolatilitypacket networkspayment schemes\(\mathrm{M}/\mathrm{M}/1\) processor sharingconditional sojourn times

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Auctions, bargaining, bidding and selling, and other market models (91B26)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bandwidth sharing and admission control for elastic traffic
• Conditional response times in the M/G/1 processor-sharing system
• Recurrence relations, continued fractions, and orthogonal polynomials
• On Sieved Orthogonal Polynomials. V: Sieved Pollaczek Polynomials
• Analysis of the M/M/1 queue with processor sharing via spectral theory

This page was built for publication: Conditional Sojourn times and the volatility of payment schemes for bandwidth sharing in packet networks