Matching queues with reneging: a product form solution
Matching queues with reneging: a product form solution
复制标题
将队列与食言相匹配：产品形式解决方案
作者：
Francisco Castro;Hamid Nazerzadeh;Chiwei Yan
考虑到双边市场中不断增长的应用，我们研究了一个具有违约行为的并行匹配队列。需求和供应单元到达系统，并根据n系统指定的兼容性图以FCFS方式进行匹配。如果他们在到达时无法匹配，他们就会排队，随着时间的推移，他们可能会放弃这个系统。通过确定一个部分平衡条件，导出了该系统稳态分布的显式乘积形式。
Motivated by growing applications in two-sided markets, we study a parallel matching queue with reneging. Demand and supply units arrive to the system and are matched in an FCFS manner according to a compatibility graph specified by an N-system. If they cannot be matched upon arrival, they queue and may abandon the system as time goes by. We derive explicit product forms of the steady-state distributions of this system by identifying a partial balance condition.