Distributed, Self-Stabilizing Tasking for Emerging Network Environments

适用于新兴网络环境的分布式、自稳定任务分配

• 批准号: 0411047
• 负责人: Dan Rubenstein
• 金额: $ 29.99万
• 依托单位: Columbia University
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 2004
• 资助国家: 美国
• 起止时间: 2004-09-01 至 2007-08-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=0411047&HistoricalAwards=false
• 关键词: Distributed; Self; Stabilizing; Tasking; Emerging

National Science FoundationDistributed Systems Research CISE/CNSABSTRACTPROPOSAL NUMBER: 0411047PRINCIPAL INVESTIGATOR: Rubenstein, DanINSTITUTION: Columbia UniversityPROPOSAL TITLE: Distributed, Self-Stabilizing Tasking for Emerging Network EnvironmentsThis proposal explores distributed algorithms and protocols to perform tasking in emerging networking environments. Tasking is easily described informally as assigning to each network node a job, rsource, or configuration drawn from a relatively small set ofpossibilities, where the same task may be assigned to multiple ndes. Tasking examples include channel assignment for 802.11 ad-hoc networks, distributing computations in GRID networks, and placing content replicas in P2P networks.This project contains a significant theoretical component that formalizes the distributed algorithms and protocols, proves self-stability, and formally quantifies bounds on the performance of the tasking result over general network topologies. The distributed protocols are designed for practical implementation, i.e., simplicity of design is preferred over additional optimality. We plan to demonstrate this facet via simulation and prototyping the results from the theoretical work within several emerging network environments including ad-hoc networks and distributed gaming networks. We anticipate dissemination via publication of results in leading conferences and journals, plus public release of software prototypes and simulation packages.Several short-term goals are tackled under this proposal, including the reduction of messaging overhead, performance of the protocols in which underlying nodes join and leave the network, and variants on optimal configuration such as content popularity and nodes whose tasks are hard-wired. The research is also investigating the application of tasking in two novel environments: channel allocation in multi-hop ad-hoc wireless networks to minimize interference among neighboring nodes, and assignment of tasks to gaming servers to minimize latency in distributed gaming infrastructures.Dr. Brett D. FleischProgram Director, CISE/CNSMay 26, 2004..

国家科学基金会分布式系统研究CEISE/CNSABSTRACTPROPOSAL编号：0411047 PRINCIPAL调查员：鲁宾斯坦，丹麦：哥伦比亚大学PROPOSAL标题：新兴网络环境的分布式自我稳定任务本提案探索在新兴网络环境中执行任务的分布式算法和协议。任务分配很容易被非正式地描述为向每个网络节点分配从相对较小的可能性集合中提取的作业、资源或配置，其中相同的任务可能被分配给多个NDE。该项目包含了一个重要的理论组成部分，它形式化地描述了分布式算法和协议，证明了自稳定性，并形式化地量化了任务结果在一般网络拓扑结构下的性能界限。分布式协议是为实际实现而设计的，即设计的简单性优于额外的最优化。我们计划通过模拟和原型在几个新兴网络环境中的理论工作结果来展示这一方面，包括ad-hoc网络和分布式游戏网络。我们预计将通过在领先的会议和期刊上发布结果，以及公开发布软件原型和模拟包来进行传播。在这项提议下，几个短期目标被解决，包括减少消息传递开销，底层节点加入和离开网络的协议的性能，以及最优配置的变体，如内容流行度和任务是硬连线的节点。该研究还研究了任务分配在两种新环境中的应用：多跳自组织无线网络中的信道分配以最小化相邻节点之间的干扰，以及将任务分配给游戏服务器以最小化分布式游戏基础设施中的延迟。布雷特·D·弗莱施项目总监，CEISE/CNS2004年5月26日