2013/01/18 by Maria Frolkova, Frolkova, Maria, Josh Reed +3
Business, Management and Accounting · Health Professions · Mathematics · Social Sciences · #60F17 #60G57 #60K30 #90B22 #Advanced Queuing Theory Analysis #FOS: Mathematics #Healthcare Operations and Scheduling Optimization #Optimization and Control (math.OC) #Primary 60K25 #Probability (math.PR) #Secondary 90B15 #Transportation Planning and Optimization #math.OC #math.PR #msc:60F17 #msc:60G57 #msc:60K25 #msc:60K30 #msc:90B15 #msc:90B22
paper · pdf · doi:10.48550/arxiv.1301.4360
34 pages, 3 figures
openalex publication_date 2013/01/18 · arxiv created 2013/04/15 · arxiv updated 2013/04/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01
Bandwidth-sharing networks as introduced by Massoulié & Roberts (1998) model the dynamic interaction among an evolving population of elastic flows competing for several links. With policies based on optimization procedures, such models are of interest both from a Queueing Theory and Operations Research perspective. In the present paper, we focus on bandwidth-sharing networks with capacities and arrival rates of a large order of magnitude compared to transfer rates of individual flows. This regime is standard in practice. In particular, we extend previous work by Reed & Zwart (2010) on fluid approximations for such networks: we allow interarrival times, flow sizes and patient times (i.e. abandonment times measured from the arrival epochs) to be generally distributed, rather than exponentially distributed. We also develop polynomial-time computable fixed-point approximations for stationary distributions of bandwidth-sharing networks, and suggest new techniques for deriving these types of results.