Approximating Bicriteria Network-Design Problems

近似双标准网络设计问题

• 批准号: 0728787
• 负责人: Guy Kortsarz
• 金额: $ 5.79万
• 依托单位: Rutgers University Camden
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2008
• 资助国家: 美国
• 起止时间: 2008-02-15 至 2009-01-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=0728787&HistoricalAwards=false
• 关键词: Approximating; Bicriteria; Network; Design; Problems

This project involves designing approximation algorithms forfundamental problems arising in computer networks in which nodes needto communicate with each other under some constraints.Building a direct link between any two nodes has a cost associatedwith it. This cost is different for different pairs of nodes. Thereare several constraints, for example, a typical requirement would bethat every node would be able to reach every other node by a sequenceof links. Examples of some other constraints are making the networkrobust in case of node failures, communication paths between nodesbeing short on average, and buying enough bandwidth for links tosupport the expected traffic (more bandwidth costs more but allowslarger quantity of data to be delivered on the link per time unit).Given the link costs, and the network constraints, the goal is todesign a network satisfying the constraints, such that the networkcost is not too large.The proposed problems have applications in VLSI, manufacturing, buyinglarge set of items at bulk and more. Theoretical insight into theseproblems is likely to lead to better understanding of the problems.

该项目涉及为计算机网络中出现的基本问题设计近似算法，其中节点需要在某些约束下相互通信。在任何两个节点之间建立直接链接都会产生相关成本。 对于不同的节点对，此成本是不同的。 有几个限制，例如，一个典型的要求是每个节点都能够通过一系列链路到达每个其他节点。 其他一些约束的示例包括在节点发生故障时使网络具有鲁棒性、节点之间的通信路径平均较短以及为链路购买足够的带宽以支持预期的流量（带宽越大成本越高，但允许在链路上传输更大数量的数据）给定链路成本和网络约束，目标是设计一个满足约束的网络，使网络成本不会太大。所提出的问题在超大规模集成电路、制造、批量购买大量物品和更多的。 对这些问题的理论洞察可能会导致更好地理解这些问题。