Equity-effectiveness tradeoff in the allocation of flows in closed queueing networks

Tradeoffs between multiple dimensions of performance are inherent in the allocation resources in many systems, particularly those with multiple stakeholders. This paper presents numerical results for the case of allocating flows in central-server closed queueing networks considering several inequity measures over many network configurations. These results show the conflict between server and customer perspectives of equity using multiple measures (server utilization, flow, wait time, and queue length). This paper first compares the effectiveness of the most equitable allocation for each measure relative to the most effective allocation for many network configurations. The complete efficient frontier is then generated using an optimization methodology. The results indicate that for low levels of server rate heterogeneity, all equity measures provide zero inequity allocations with high levels of effectiveness. However, as server rate heterogeneity increases, the total system effectiveness decreases and significant differences between the inequity measures are evident. In particular, the flow equity measure shows marked decreases in effectiveness relative to the other three measures. Further, inequity with respect to wait time, server utilization, and queue length can be eliminated with relatively small impact on total system throughput (i.e., system effectiveness). In contrast, reductions in inequity with respect to customer flow incur large decreases in total system throughput.

[1]  Carl M. Harris,et al.  Fundamentals of Queueing Theory: Gross/Fundamentals of Queueing Theory , 2008 .

[2]  Maria E. Mayorga,et al.  A Dispatching Model for Server-to-Customer Systems That Balances Efficiency and Equity , 2013, Manuf. Serv. Oper. Manag..

[3]  Michael T. Marsh,et al.  Equity measurement in facility location analysis: A review and framework , 1994 .

[4]  Koushik Kar,et al.  Dynamic allocation of entities in closed queueing networks: An application to debris removal , 2013, 2013 IEEE International Conference on Technologies for Homeland Security (HST).

[5]  Jayashankar M. Swaminathan Decision Support for Allocating Scarce Drugs , 2003, Interfaces.

[6]  Benjamin Avi-Itzhak,et al.  QUANTIFYING FAIRNESS IN QUEUING SYSTEMS , 2008, Probability in the Engineering and Informational Sciences.

[7]  W. Whitt,et al.  Open and closed models for networks of queues , 1984, AT&T Bell Laboratories Technical Journal.

[8]  Adam Wierman,et al.  Fairness and scheduling in single server queues , 2011 .

[9]  Mario Gerla,et al.  Optimal routing in closed queuing networks , 1983, TOCS.

[10]  Theodore T. Allen,et al.  Mitigating Voter Waiting Times , 2006 .

[11]  William F. Piepmeier Optimal balancing of I/O requests to disks , 1975, CACM.

[12]  Ann Melissa Campbell,et al.  Routing for Relief Efforts , 2008, Transp. Sci..

[13]  Armann Ingolfsson,et al.  Maximizing throughput in finite-source parallel queue systems , 2012, Eur. J. Oper. Res..

[14]  M. Mandell Modelling effectiveness-equity trade-offs in public service delivery systems , 1991 .

[15]  Philip B. Coulter,et al.  MEASURING THE INEQUITY OF URBAN PUBLIC SERVICES METHODOLOGICAL DISCUSSION WITH APPLICATIONS , 1980 .

[16]  L. McLay,et al.  Modeling Equity for Allocating Public Resources , 2012 .

[17]  Michael J. Fry,et al.  Are all voting queues created equal? , 2009, Proceedings of the 2009 Winter Simulation Conference (WSC).

[18]  E. Savas On Equity in Providing Public Services , 1978 .

[19]  Amy R. Ward,et al.  Fair Dynamic Routing in Large-Scale Heterogeneous-Server Systems , 2010, Oper. Res..

[20]  Mor Armony,et al.  Dynamic Routing in Large-Scale Service Systems with Heterogeneous Servers , 2005, Queueing Syst. Theory Appl..

[21]  Laura A McLay,et al.  Evaluating emergency medical service performance measures , 2010, Health care management science.

[22]  Mario Gerla,et al.  Optimal routing in closed queueing networks , 1983, SIGCOMM 1983.