Applications in distributed quantum computing networks
Explore the source record for details and available documents.
qubits quantum networks disassociated header↗
SEARCH · Search NASA
Results for “COMPUTER NETWORKS”
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Random vs. Combinatorial Methods for Discrete Event Simulation of a Grid Computer Network
This study compared random and t-way combinatorial inputs of a network simulator, to determine if these two approaches produce significantly different deadlock detection for varying network configurations. Modeling deadlock detection is important for analyzing configuration changes that could inadvertently degrade network operations, or to determine modifications that could be made by attackers to deliberately induce deadlock. Discrete event simulation of a network may be conducted using random generation, of inputs. In this study, we compare random with combinatorial generation of inputs. Combinatorial (or t-way) testing requires every combination of any t parameter values to be covered by at least one test. Combinatorial methods can be highly effective because empirical data suggest that nearly all failures involve the interaction of a small number of parameters (1 to 6). Thus, for example, if all deadlocks involve at most 5-way interactions between n parameters, then exhaustive testing of all n-way interactions adds no additional information that would not be obtained by testing all 5-way interactions. While the maximum degree of interaction between parameters involved in the deadlocks clearly cannot be known in advance, covering all t-way interactions may be more efficient than using random generation of inputs. In this study we tested this hypothesis for t = 2, 3, and 4 for deadlock detection in a network simulation. Achieving the same degree of coverage provided by 4-way tests would have required approximately 3.2 times as many random tests; thus combinatorial methods were more efficient for detecting deadlocks involving a higher degree of interactions. The paper reviews explanations for these results and implications for modeling and simulation.
Kuhn, D. Richard↗
Framework and Method for Controlling a Robotic System Using a Distributed Computer Network
A robotic system for performing an autonomous task includes a humanoid robot having a plurality of compliant robotic joints, actuators, and other integrated system devices that are controllable in response to control data from various control points, and having sensors for measuring feedback data at the control points. The system includes a multi-level distributed control framework (DCF) for controlling the integrated system components over multiple high-speed communication networks. The DCF has a plurality of first controllers each embedded in a respective one of the integrated system components, e.g., the robotic joints, a second controller coordinating the components via the first controllers, and a third controller for transmitting a signal commanding performance of the autonomous task to the second controller. The DCF virtually centralizes all of the control data and the feedback data in a single location to facilitate control of the robot across the multiple communication networks.
Sanders, Adam M.↗
Gathering Threat Intelligence through Computer Network Deception (Presentation).
Abstract not provided.
Stout, William M.S.↗
LIMS - The Link Inter-Task Message System for teh PEP Modcomp Computer Network
Explore the source record for details and available documents.
Gromme, A.↗
A knowledge-based system with learning for computer communication network design
Computer communication network design is well-known as complex and hard. For that reason, the most effective methods used to solve it are heuristic. Weaknesses of these techniques are listed and a new approach based on artificial intelligence for solving this problem is presented. This approach is particularly recommended for large packet switched communication networks, in the sense that it permits a high degree of reliability and offers a very flexible environment dealing with many relevant design parameters such as link cost, link capacity, and message delay.
Pierre, Samuel↗
Satellite networks for education
Satellite based educational networking is discussed with particular attention given to the potential uses of communications satellites to help meet educational needs in the United states. Four major subject areas were covered; (1) characteristics and structure of networks, (2) definition of pressures within educational establishment that provide motivation for various types of networks, (3) examination of current educational networking status for educational radio and television, instructional television fixed services, inter- and intra-state educational communication networks, computer networks, and cable television for education, and (4) identification of possible satellite based educational telecommunication services and three alternatives for implementing educational satellite systems.
Singh, J. P.↗
Satellite networks for education.
Consideration of satellite-based educational networking. The characteristics and structure of networks are reviewed, and pressures within the educational establishment that are providing motivation for various types of networks are discussed. A number of studies are cited in which networking needs for educational sectors and services are defined. The current status of educational networking for educational radio and television, instructional television fixed services, inter- and intrastate educational communication networks, computer networks, cable television for education, and continuing and proposed educational experiments using NASA's Applications Technology Satellites is reviewed. Possible satellite-based educational telecommunication services and three alternatives for implementing educational satellite systems are described. Some remarks are made concerning public policy aspects of future educational satellite system development.
Singh, J. P.↗
A new taxonomy for distributed computer systems based upon operating system structure
Characteristics of the resource structure found in the operating system are considered as a mechanism for classifying distributed computer systems. Since the operating system resources, themselves, are too diversified to provide a consistent classification, the structure upon which resources are built and shared are examined. The location and control character of this indivisibility provides the taxonomy for separating uniprocessors, computer networks, network computers (fully distributed processing systems or decentralized computers) and algorithm and/or data control multiprocessors. The taxonomy is important because it divides machines into a classification that is relevant or important to the client and not the hardware architect. It also defines the character of the kernel O/S structure needed for future computer systems. What constitutes an operating system for a fully distributed processor is discussed in detail.
Foudriat, E. C.↗
Local area networking: Ames centerwide network
A computer network can benefit the user by making his/her work quicker and easier. A computer network is made up of seven different layers with the lowest being the hardware, the top being the user, and the middle being the software. These layers are discussed.
Price, Edwin↗
Report on Computing and Networking in the Space Science Laboratory by the SSL Computer Committee
The Space Science Laboratory (SSL) at Marshall Space Flight Center is a multiprogram facility. Scientific research is conducted in four discipline areas: earth science and applications, solar-terrestrial physics, astrophysics, and microgravity science and applications. Representatives from each of these discipline areas participate in a Laboratory computer requirements committee, which developed this document. The purpose is to establish and discuss Laboratory objectives for computing and networking in support of science. The purpose is also to lay the foundation for a collective, multiprogram approach to providing these services. Special recognition is given to the importance of the national and international efforts of our research communities toward the development of interoperable, network-based computer applications.
Gallagher, D. L.↗
Queueing in networks of computers
The designers of networks of computers must assess the capacity of the network to complete work within reasonable times. The utilization law, Little's law, forced-flow law, and response time formula are simple tools that can be used to calculate throughput and response times of networks. Bottleneck analysis can be used to calculate simple lower bounds on response time in terms of individual server parameters and the load on network as a whole. These simple results are important tools for all users of scientific networks - back of the envelope calculations can quickly reveal the effects of distant servers on local throughput and response time.
Denning, Peter J.↗
Spacelab data analysis using the space plasma computer analysis network (SCAN) system
The Space-plasma Computer Analysis Network (SCAN) currently connects a large number of U.S. Spacelab investigators into a common computer network. Used primarily by plasma physics researchers at present, SCAN provides access to Spacelab investigators in other areas of space science, to Spacelab and non-Spacelab correlative data bases, and to large Class VI computational facilities for modeling. SCAN links computers together at remote institutions used by space researchers, utilizing commercially available software for computer-to-computer communications. Started by the NASA's Office of Space Science in mid 1980, SCAN presently contains ten system nodes located at major universities and space research laboratories, with fourteen new nodes projected for the near future. The Stanford University computer gateways allow SCAN users to connect onto the ARPANET and TELENET overseas networks.
Green, J. L.↗
Deadlock-free class routes for collective communications embedded in a multi-dimensional torus network
A computer implemented method and a system for routing data packets in a multi-dimensional computer network. The method comprises routing a data packet among nodes along one dimension towards a root node, each node having input and output communication links, said root node not having any outgoing uplinks, and determining at each node if the data packet has reached a predefined coordinate for the dimension or an edge of the subrectangle for the dimension, and if the data packet has reached the predefined coordinate for the dimension or the edge of the subrectangle for the dimension, determining if the data packet has reached the root node, and if the data packet has not reached the root node, routing the data packet among nodes along another dimension towards the root node.
97 MATHEMATICS AND COMPUTING↗