arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2007.07721cs.DS
收藏

规模经济下的在线广义网络设计

Online Generalized Network Design Under (Dis)Economies of Scale

Viswanath Nagarajan, Lily Wang

摘要:

我们考虑一个一般的在线网络设计问题,其中N个请求的序列随着时间的推移到达,每个请求都需要使用可用资源E的某个子集。任何资源e产生的成本都是该资源上总负载$L_e$的某个函数$f_e$。目标是最小化总成本$\sum_{e\in E} f_e(L_e)$。我们专注于成本函数,表现出(非)规模经济,这是$f_e(x) = σ_e + ξ_e\cdot x^{α_e}$的形式,如果$x>0$(和零,如果$x=0$),其中指数$α_e\ge 1$。这些功能下的优化问题已经收到显着最近的关注,由于在节能计算中的应用。我们的主要结果是一个确定性的在线算法与紧竞争比$Θ\left(\max_{e\in E} \left(\frac{σ_e}{ξ_e}\right)^{1/α_e}\right)$时,$α_e$是常数的所有$e\in E$。这个框架适用于各种网络设计问题的无向和有向图,包括多商品路由,斯坦纳树/森林连接和集连接。事实上,我们的在线竞争比甚至与广义网络设计的先前最佳(离线)近似比相匹配。

英文摘要:

We consider a general online network design problem where a sequence of N requests arrive over time, each of which needs to use some subset of the available resources E. The cost incurred by any resource e is some function $f_e$ of the total load $L_e$ on that resource. The objective is to minimize the total cost $\sum_{e\in E} f_e(L_e)$. We focus on cost functions that exhibit (dis)economies of scale, that are of the form $f_e(x) = σ_e + ξ_e\cdot x^{α_e}$ if $x>0$ (and zero if $x=0$), where the exponent $α_e\ge 1$. Optimization problems under these functions have received significant recent attention due to applications in energy-efficient computing. Our main result is a deterministic online algorithm with tight competitive ratio $Θ\left(\max_{e\in E} \left(\frac{σ_e}{ξ_e}\right)^{1/α_e}\right)$ when $α_e$ is constant for all $e\in E$. This framework is applicable to a variety of network design problems in undirected and directed graphs, including multicommodity routing, Steiner tree/forest connectivity and set-connectivity. In fact, our online competitive ratio even matches the previous-best (offline) approximation ratio for generalized network design.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑