Site Moderators Only | Page 17 | Institute for Systems Research

Abstract

A method for locating and selecting concentrators and local access links in a distributed data network in the most cost-efficient way is disclosed. The method first identifies a median concentrator from among a set of candidate concentrators to which all of the data terminals are initially assigned. The method then iteratively evaluates and adds to the network those concentrators which produce savings in the network's cost.

Abstract

A method for selecting the most cost-efficient locations for backbone nodes in a distributed data network is disclosed. The method iteratively evaluates candidate backbone node locations, adding in each iteration the candidate whose addition to the network would create the greatest savings in total network cost. After all candidates which produce savings are added to the network, the method iteratively evaluates the backbone node locations and removes those whose removal would create cost savings. Data terminals are reassigned among the backbone nodes in the least cost manner.

Abstract

A method to produce near-optimal routes for the flow of data between clusters in a distributed data communications network. A backbone traffic matrix and a backbone topology at the cluster level are used to produce minimum hop routes, minimum delay routes, or routes which maximize throughput. The inputs of the system are the number of requirements, the number of backbone links, and the number of backbone nodes.

Improving Public Health Preparedness

Simulation Driven Computational Synthesis

SecondWrite: Better than first

Improving Air Transportation Performance through Collaborative Decision Making

Curing the Chip Fever: Thermal Sensing and Actuation in Nano-scale Systems

Postdoctoral Research Opportunities

Give to the ISR Graduate Student Travel Fund

Method for efficient distributed data communications network access network configuration

Abstract

Method for efficient distributed data communications network backbone node location

Abstract

Method for routing data in a near-optimal manner in a distributed data communications network

Abstract

Pages