CAREER: Algorithms for Services - Oriented Communications Networks

职业：服务算法 - 面向通信网络

• 批准号: 0339262
• 负责人: Ashish Goel
• 金额: $ 27.96万
• 依托单位: Stanford University
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 2003
• 资助国家: 美国
• 起止时间: 2003-06-01 至 2008-04-30
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=0339262&HistoricalAwards=false
• 关键词: CAREER; Algorithms; Services; Oriented; Communications

The focus in modern computer networks has started to shift towardsservices and functionality rather than efficiency andoptimization. This calls for algorithms that combine user-centricperformance metrics such as fairness, availability, and latency withmore traditional objectives such as the total bandwidth cost or totalthroughput; it is desirable for these algorithms to provide formalguarantees in abstract models, as well as general rules of thumb forsystem developers. This research involves the study of severalproblems within the above framework.The first problem is to design efficient distributed algorithms forachieving approximate fairness in computer networks, and to studysimple mechanisms that induce convergence of selfish users toapproximately fair solutions. The second problem is to study routingissues in peer-to-peer systems; peer-to-peer systems are groups ofend-nodes that collaborate to implement new network services at theapplication level. Another problem is to study the packet-injectionrate at which common packet scheduling protocols such as FIFO becomeunstable.In an attempt to overcome the gap between theoreticians andpractitioners in this field, a new course titled "Algorithms forcomputer networks" will be developed, and the course material will bemade publicly available. Another course titled "Modern algorithmictechniques" will also be developed.

现代计算机网络的焦点已经开始转向服务和功能，而不是效率和优化。这就要求算法将以用户为中心的性能指标（如公平性、可用性和延迟）与更传统的目标（如总带宽成本或总吞吐量）相结合;这些算法需要在抽象模型中提供形式上的保证，以及系统开发人员的一般经验规则。本研究在上述框架下研究了几个问题：第一个问题是设计有效的分布式算法来实现计算机网络中的近似公平性，并研究简单的机制来诱导自私用户收敛到近似公平解。第二个问题是研究对等系统中的路由问题;对等系统是一组端节点，它们协作在应用层实现新的网络服务。另一个问题是研究数据包注入速率，在该速率下，诸如FIFO之类的普通数据包调度协议变得不稳定。为了克服这一领域理论家和实践者之间的差距，将开发一门新的课程，名为“计算机网络算法”，并将公开提供该课程的教材。还将开发另一个题为“现代算法技术”的课程。