本頁只刊出中文翻譯與中文說明；英文原文請見下方原文連結。
原文連結
論文資訊
- 類型：已發表論文
- 日期：2012-04-02
摘要
This paper investigates the effect of 網絡 topology on the fair allocation of 網絡 resources among a set of 智能體s, an all-important issue for the efficiency of transportation 網絡s all around us. We analyze a generic mechanism that distributes 網絡 capacity fairly among existing flow demands. The problem can be solved by semianalytical methods on a nearest-neighbor graph with one source and sink pair, when transport occurs over shortest paths. For this setup, we uncover a broad range of patterns of intersecting shortest paths as a function of the distance between the source and the sink. When the number of intersections is the maximum and the distance between the source and the sink is large, we find that a fair allocation implies a decrease of at least 50% from the maximum throughput. We also find
※ 此為已發表論文，全文需透過期刊付費取得