Algorithms and Routing Schemes for Scalable Networks

可扩展网络的算法和路由方案

• 批准号: 9877139
• 负责人: Kenneth Berman
• 金额: $ 28.38万
• 依托单位: University of Cincinnati Main Campus
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 1999
• 资助国家: 美国
• 起止时间: 1999-07-01 至 2003-06-30
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9877139&HistoricalAwards=false
• 关键词: Algorithms; Routing; Schemes; Scalable; Networks

CCR-9877139BermanThis project conducts research on the design, implementation, and analysis of algorithms for the support of scalable and reliable communication services in distributed networks. The focus centers around important challenges that affect the national network-communication infrastructure and the needs of increasing numbers of network users and services. These challenges included mitigating the stress on network backbone caused by the diminishing locality of network traffic, easing the addition of large numbers of geographically distributed network hosts, implementing fault-tolerant and congestion-tolerant communication methods, and integrating diverse technologies such as fast-switching and mobile communication devices into the national networking infrastructure. A significant obstacle in meeting these challenges is the difficulty of routing, switching, addressing, and guaranteeing delivery of messages in such a large and growing global network. This is a program of fundamental and applied research attacking these scalability and reliability problems using techniques of network algorithms, computational combinatorics and graph theory. The analysis of the topological structure of networks and the algorithmic properties associated with network routing schemes will be the primary focus. Extensive implementations and empirical studies building on the experience using the network platform provided by the Ohio Supercomputer Center and the OCARNet dedicated ATM research network will be performed.

CCR-9877139 Berman本项目研究分布式网络中支持可扩展和可靠通信服务的算法的设计、实现和分析。重点是影响国家网络通信基础设施的重大挑战，以及越来越多的网络用户和服务的需求。这些挑战包括缓解网络流量局部性减弱对网络主干造成的压力，缓解大量地理分布的网络主机的增加，实施容错和容塞通信方法，以及将快速交换和移动通信设备等多种技术整合到国家网络基础设施中。应对这些挑战的一个重大障碍是难以在如此庞大且不断增长的全球网络中进行路由、交换、寻址和保证消息的传递。这是一个利用网络算法、计算组合学和图论技术来解决这些可伸缩性和可靠性问题的基础和应用研究计划。分析网络的拓扑结构和与网络路由方案相关的算法特性将是主要的焦点。将在使用俄亥俄州超级计算机中心和OCARNet专用ATM研究网络提供的网络平台的经验基础上进行广泛的实施和实证研究。