Fluid Models of Parallel Service Systems under FCFS

2016/04/15 by Yuval Nov, Nov, Yuval, Gideon Weiss +3
Business, Management and Accounting · Computer Science · Decision Sciences · #Advanced Queuing Theory Analysis #Distributed systems and fault tolerance #FOS: Mathematics #Probability (math.PR) #Simulation Techniques and Applications

paper · pdf · doi:10.48550/arxiv.1604.04497

openalex publication_date 2016/04/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We study deterministic fluid approximations of parallel service systems operating under first come first served policy (FCFS). The condition for complete resource pooling is identified in terms of the system structure and the customer service times. The static planning linear programming approach (Harrison and Lopez \citeharrison-lopez:99) is used to obtain a maximum throughput compatibility tree and to show that FCFS using this compatibility tree is throughput optimal. We investigate matching rates and show by Hotelling's T²-test and simulation that they are dependent on the service time distribution.

Cited by

• Design Heuristic for Parallel Many Server Systems under FCFS-ALIS

Related

• Design Heuristic for Parallel Many Server Systems under FCFS-ALIS
• FCFS Parallel Service Systems and Matching Models
• Many Server Scaling of the N-System Under FCFS-ALIS
• Comparison of the FCFS and PS discipline in Redundancy Systems
• A Fluid Limit for Processor-Sharing Queues Weighted by Functions of Remaining Amounts of Service