论文标题
JSQ在队列中的稳定性具有一般服务器 - 工作类兼容性
Stability of JSQ in queues with general server-job class compatibilities
论文作者
论文摘要
我们考虑到达到队列超图的每个边缘的指数分布的作业的泊松流。到达后，传入的作业植根于相应顶点之间的最短队列。这概括了许多已知的模型，例如D Power load Falancing和JSQ（加入最短的队列）上的通用图。 我们为该模型的稳定性提供了通用条件。我们表明，某些图形拓扑导致容量损失，这意味着与完整图相比，稳定性条件更大。
We consider Poisson streams of exponentially distributed jobs arriving at each edge of a hypergraph of queues. Upon arrival, an incoming job is rooted to the shortest queue among the corresponding vertices. This generalizes many known models such as power-of-d load balancing and JSQ (join the shortest queue) on generic graphs. We provide a generic condition for stability of this model. We show that some graph topologies lead to a loss of capacity, implying more restrictive stability conditions than in, e.g., complete graphs.
