论文标题
具有分配限制的冗余系统的繁重流量普遍性
Heavy-Traffic Universality of Redundancy Systems with Assignment Constraints
论文作者
论文摘要
由于基于技能的路由或地理条件，服务系统通常会面临任务服务器分配约束。冗余计划通过将任务复制到与这些任务约束的特定服务器相一致的特定服务器来响应这种有限的灵活性。我们从产品形式的固定分布和较弱的当地稳定条件中获得洞察力，以在繁忙的交通中建立状态崩溃。在这个有限的策略中，具有冗余调度的并行服务器系统可作为一个多级单人服务器系统运行，实现了完整的资源池，并对基本分配约束表现出强烈的不敏感性。特别是，即使具有相当严格的分配约束，完全灵活（无约束）系统的性能也可以匹配。
Service systems often face task-server assignment-constraints due to skill-based routing or geographical conditions. Redundancy scheduling responds to this limited flexibility by replicating tasks to specific servers in agreement with these assignment constraints. We gain insight from product-form stationary distributions and weak local stability conditions to establish a state space collapse in heavy traffic. In this limiting regime, the parallel-server system with redundancy scheduling operates as a multi-class single-server system, achieving full resource pooling and exhibiting strong insensitivity to the underlying assignment constraints. In particular, the performance of a fully flexible (unconstrained) system can be matched even with rather strict assignment constraints.
