Search NASA⌕ Search

SEARCH · Search NASA

Results for “Destination”

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.

At least 91 records · Page 5

MMIC Amplifiers and Wafer Probes for 350 to 500 GHz

A wireless avionics interface exploits the constrained nature of data networks in flight systems to use a lightweight routing method. This simplified routing means that a processor is not required, and the logic can be implemented as an intellectual property (IP) core in a field-programmable gate array (FPGA). The FPGA can be shared with the flight subsystem application. In addition, the router is aware of redundant subsystems, and can be configured to provide hot standby support as part of the interface. This simplifies implementation of flight applications requiring hot stand - by support. When a valid inbound packet is received from the network, the destination node address is inspected to determine whether the packet is to be processed by this node. Each node has routing tables for the next neighbor node to guide the packet to the destination node. If it is to be processed, the final packet destination is inspected to determine whether the packet is to be forwarded to another node, or routed locally. If the packet is local, it is sent to an Applications Data Interface (ADI), which is attached to a local flight application. Under this scheme, an interface can support many applications in a subsystem supporting a high level of subsystem integration. If the packet is to be forwarded to another node, it is sent to the outbound packet router. The outbound packet router receives packets from an ADI or a packet to be forwarded. It then uses a lookup table to determine the next destination for the packet. Upon detecting a remote subsystem failure, the routing table can be updated to autonomously bypass the failed subsystem.

Samoska, Lorene A.↗

Interface Supports Lightweight Subsystem Routing for Flight Applications

A wireless avionics interface exploits the constrained nature of data networks in flight systems to use a lightweight routing method. This simplified routing means that a processor is not required, and the logic can be implemented as an intellectual property (IP) core in a field-programmable gate array (FPGA). The FPGA can be shared with the flight subsystem application. In addition, the router is aware of redundant subsystems, and can be configured to provide hot standby support as part of the interface. This simplifies implementation of flight applications requiring hot stand - by support. When a valid inbound packet is received from the network, the destination node address is inspected to determine whether the packet is to be processed by this node. Each node has routing tables for the next neighbor node to guide the packet to the destination node. If it is to be processed, the final packet destination is inspected to determine whether the packet is to be forwarded to another node, or routed locally. If the packet is local, it is sent to an Applications Data Interface (ADI), which is attached to a local flight application. Under this scheme, an interface can support many applications in a subsystem supporting a high level of subsystem integration. If the packet is to be forwarded to another node, it is sent to the outbound packet router. The outbound packet router receives packets from an ADI or a packet to be forwarded. It then uses a lookup table to determine the next destination for the packet. Upon detecting a remote subsystem failure, the routing table can be updated to autonomously bypass the failed subsystem.

Lux, James P.↗

Multi-agent autonomous system and method

A method of controlling a plurality of crafts in an operational area includes providing a command system, a first craft in the operational area coupled to the command system, and a second craft in the operational area coupled to the command system. The method further includes determining a first desired destination and a first trajectory to the first desired destination, sending a first command from the command system to the first craft to move a first distance along the first trajectory, and moving the first craft according to the first command. A second desired destination and a second trajectory to the second desired destination are determined and a second command is sent from the command system to the second craft to move a second distance along the second trajectory.

Fink, Wolfgang↗

Why Atens Enjoy Enhanced Accessibility For Human Space Flight

In the context of human space flight (HSF), the concept of near-Earth object (NEO) accessibility is highly subjective. Whether or not a particular NEO is accessible critically depends on mass, performance, and reliability of interplanetary HSF systems yet to be designed. Such systems would certainly include propulsion and crew life support with adequate shielding from both solar flares and galactic cosmic radiation. Equally critical architecture options are relevant to NEO accessibility. These options are also far from being determined and include the number of launches supporting an HSF mission, together with whether or not consumables are to be pre-emplaced at the destination. Until the unknowns of HSF to NEOs come into clearer focus, the notion of relative accessibility is of great utility. Imagine a group of NEOs, each with nearly equal HSF merit determined from their individual characteristics relating to crew safety, scientific return, resource utilization, and planetary defense. The more accessible members of this group are more likely to be explored first. A highly accessible NEO could conceivably be deferred in favor of a less accessible HSF destination because the latter is more accessible during a programmatically desirable launch compliant mission trajectory solutions detected in association with a specific NEO. The known NEO population is then surveyed to illustrate in which regions of heliocentric semi-major axis, eccentricity, and inclination (a, e, i) space NEOs with large n values are mapped. The (a, e, i) mapping is also formatted such that membership in each of four NEO orbit classifications, as defined below, is evident. Amors have orbits everywhere superior to (outside of) Earth's. An Amor is therefore defined to have perihelion between 1.017 astronomical units (AU) and the maximum NEO value of 1.3 AU. As of 0 hrs Universal Time on 1 January 2011 (UT epoch 2011.0), Amors numbered 2855 in the Jet Propulsion Laboratory (JPL) Small-Body Database (SBDB), comprising 37.7% of known NEOs. Apollos have orbits crossing Earth's with periods greater than Earth's. An Apollo is therefore defined to have perihelion less than 1.017 AU and a greater than 1.0 AU. As of 2011.0 UT, Apollos numbered 4080 in the SBDB, comprising 53.9% of known NEOs. Atens have orbits crossing Earth's with periods less than Earth's. An Aten is therefore defined to have aphelion greater than 0.983 AU and a less than 1.0 AU. As of 2011.0 UT, Atens numbered 618 in the SBDB, comprising 8.2% of known NEOs. Atiras have orbits everywhere inferior to (inside of) Earth's. An Atira is therefore defined to have aphelion less than 0.983 AU. As of 2011.0 UT, Atiras numbered 11 in the SBDB, comprising 0.1% of known NEOs. It is no surprise that the largest n values are chiefly associated with Apollos and Atens. Because these orbits cross Earth's, distance to be covered in a given round trip mission time delta-t can be far less than is possible for Amors or Atiras . This delta-t or the sum of mission propulsive impulse magnitudes delta-v can more frequently be minimized to enhance NHATS compliance for Apollos and Atens than is generally the case for Amors and Atiras. A less intuitive trend in NHATS results is that Atens nearly outnumber the more numerous Apollos among the most compliant NEOs as measured by n. This trend is completely out of proportion to the degree Atens are represented among the known NEO population. A theory based on geocentric NEO dynamics is presented by this paper to explain why Atens enjoy inherently greater accessibility than do Apollos. Another trend evident from mapping into (a, e, i) space is the dearth of known NEOs at low e when a < 1 AU. Underrepresentation of Atens and Atiras in the NEO catalog is at least in part attributable to observing exclusively from a perspective near Earth. Generally inferior Aten and Atira orbits are rarely, if ever, in Earth's night sky. Until a comprehensive NEO survey is conducted from an appropriateegion remote from Earth, the theory developed in this paper indicates a substantial fraction of the most accessible NEOs will remain unknown. season. Such a season is really yet another undetermined HSF architecture option. A launch season's duration will likely be measured in weeks, and it will be utilized at an indeterminate point almost certainly more than a decade in the future when HSF programmatic maturity is sufficient. Furthermore, current knowledge of the NEO population relevant to HSF is far from complete. In the 100-m-diameter class of greatest interest, only a few percent of the estimated NEO population is known [2, Figure 2.4]. Therefore, any known, lost, or fictitious NEO in a highly accessible orbit is a potential HSF destination of merit. Even if lost, fictitious, small, or hazardous, such a potential target (or another in a similar orbit) may ultimately prove to be an early HSF destination when the pertinent NEO population is more thoroughly catalogued and NEO orbits are more thoroughly maintained at high accuracy. This paper first reviews methodology and pertinent results from NASA-sponsored research performed in late 2010 and dubbed NEO HSF Accessible Targets Study (NHATS, pronounced as "gnats"). A useful accessibility metric developed during this study is n, the tally of NHATS-

Barbee, Brent↗

HERRO: A Science-Oriented Strategy for Crewed Missions Beyond LEO

This paper presents an exploration strategy for human missions beyond Low Earth Orbit (LEO) and the Moon that combines the best features of human and robotic spaceflight. This "Human Exploration using Real-time Robotic Operations" (HERRO) strategy refrains from placing humans on the surfaces of the Moon and Mars in the near-term. Rather, it focuses on sending piloted spacecraft and crews into orbit around exploration targets of interest, such as Mars, and conducting astronaut exploration of the surfaces using telerobots and remotely controlled systems. By eliminating the significant communications delay with Earth due to the speed of light limit, teleoperation provides scientists real-time control of rovers and other sophisticated instruments, in effect giving them a "virtual presence" on planetary surfaces, and thus expanding the scientific return at these destinations. It also eliminates development of the numerous man-rated landers, ascent vehicles and surface systems that are required to land humans on planetary surfaces. The propulsive requirements to travel from LEO to many destinations with shallow gravity-wells in the inner solar system are quite similar. Thus, a single spacecraft design could perform a variety of missions, including orbit-based surface exploration of the Moon, Mars and Venus, and rendezvous with Near Earth Asteroids (NEAs), as well as Phobos and Deimos. Although HERRO bypasses many of the initial steps that have been historically associated with human space exploration, it opens the door to many new destinations that are candidates for future resource utilization and settlement. HERRO is a first step that takes humans to exciting destinations beyond LEO, while expanding the ability to conduct science within the inner solar system.

Schmidt, George R.↗

Launch and Assembly Reliability Analysis for Human Space Exploration Missions

NASA's future human space exploration strategy includes single and multi-launch missions to various destinations including cis-lunar space, near Earth objects such as asteroids, and ultimately Mars. Each campaign is being defined by Design Reference Missions (DRMs). Many of these missions are complex, requiring multiple launches and assembly of vehicles in orbit. Certain missions also have constrained departure windows to the destination. These factors raise concerns regarding the reliability of launching and assembling all required elements in time to support planned departure. This paper describes an integrated methodology for analyzing launch and assembly reliability in any single DRM or set of DRMs starting with flight hardware manufacturing and ending with final departure to the destination. A discrete event simulation is built for each DRM that includes the pertinent risk factors including, but not limited to: manufacturing completion; ground transportation; ground processing; launch countdown; ascent; rendezvous and docking, assembly, and orbital operations leading up to trans-destination-injection. Each reliability factor can be selectively activated or deactivated so that the most critical risk factors can be identified. This enables NASA to prioritize mitigation actions so as to improve mission success.

Cates, Grant↗

Human Missions to Near-Earth Asteroids: An Update on NASA's Current Status and Proposed Activities for Small Body Exploration

Introduction: Over the past several years, much attention has been focused on the human exploration of near-Earth asteroids (NEAs). Two independent NASA studies examined the feasibility of sending piloted missions to NEAs, and in 2009, the Augustine Commission identified NEAs as high profile destinations for human exploration missions beyond the Earth-Moon system as part of the Flexible Path. More recently the current U.S. presidential administration directed NASA to include NEAs as destinations for future human exploration with the goal of sending astronauts to a NEA in the mid to late 2020s. This directive became part of the official National Space Policy of the United States of America as of June 28, 2010. Dynamical Assessment: The current near-term NASA human spaceflight capability is in the process of being defined while the Multi-Purpose Crew Vehicle (MPCV) and Space Launch System (SLS) are still in development. Hence, those NEAs in more accessible heliocentric orbits relative to a minimal interplanetary exploration capability will be considered for the first missions. If total mission durations for the first voyages to NEAs are to be kept to less than one year, with minimal velocity changes, then NEA rendezvous missions ideally will take place within 0.1 AU of Earth (approx about 5 million km or 37 lunar distances). Human Exploration Considerations: These missions would be the first human expeditions to inter-planetary bodies beyond the Earth-Moon system and would prove useful for testing technologies required for human missions to Mars, Phobos and Deimos, and other Solar System destinations. Missions to NEAs would undoubtedly provide a great deal of technical and engineering data on spacecraft operations for future human space exploration while conducting detailed scientific investigations of these primitive objects. Current analyses of operational concepts suggest that stay times of 15 to 30 days may be possible at these destinations. In addition, the resulting scientific investigations would refine designs for future extraterrestrial In Situ Resource Utilization (ISRU), and assist in the development of hazard mitigation techniques for planetary defense. Conclusions: The scientific and hazard mitigation benefits, along with the programmatic and operational benefits of a human venture beyond the Earth-Moon system, make a piloted mission to a NEA using NASA's proposed human exploration systems a compelling endeavor

Abell, P. A.↗

Optimal Routing and Control of Multiple Agents Moving in a Transportation Network and Subject to an Arrival Schedule and Separation Constraints

We address the problem of navigating a set of moving agents, e.g. automated guided vehicles, through a transportation network so as to bring each agent to its destination at a specified time. Each pair of agents is required to be separated by a minimal distance, generally agent-dependent, at all times. The speed range, initial position, required destination, and required time of arrival at destination for each agent are assumed provided. The movement of each agent is governed by a controlled differential equation (state equation). The problem consists in choosing for each agent a path and a control strategy so as to meet the constraints and reach the destination at the required time. This problem arises in various fields of transportation, including Air Traffic Management and train coordination, and in robotics. The main contribution of the paper is a model that allows to recast this problem as a decoupled collection of problems in classical optimal control and is easily generalized to the case when inertia cannot be neglected. Some qualitative insight into solution behavior is obtained using the Pontryagin Maximum Principle. Sample numerical solutions are computed using a numerical optimal control solver.

Sadovsky, A. V.↗

Design Concepts for a Small Space-Based GEO Relay Satellite for Missions Between Low Earth and near Earth Orbits

The main purpose of the Small Space-Based Geosynchronous Earth orbiting (GEO) satellite is to provide a space link to the user mission spacecraft for relaying data through ground networks to user Mission Control Centers. The Small Space Based Satellite (SSBS) will provide services comparable to those of a NASA Tracking Data Relay Satellite (TDRS) for the same type of links. The SSBS services will keep the user burden the same or lower than for TDRS and will support the same or higher data rates than those currently supported by TDRS. At present, TDRSS provides links and coverage below GEO; however, SSBS links and coverage capability to above GEO missions are being considered for the future, especially for Human Space Flight Missions (HSF). There is also a rising need for the capability to support high data rate links (exceeding 1 Gbps) for imaging applications. The communication payload on the SSBS will provide S/Ka-band single access links to the mission and a Ku-band link to the ground, with an optical communication payload as an option. To design the communication payload, various link budgets were analyzed and many possible operational scenarios examined. To reduce user burden, using a larger-sized antenna than is currently in use by TDRS was considered. Because of the SSBS design size, it was found that a SpaceX Falcon 9 rocket could deliver three SSBSs to GEO. This will greatly reduce the launch costs per satellite. Using electric propulsion was also evaluated versus using chemical propulsion; the power system size and time to orbit for various power systems were also considered. This paper will describe how the SSBS will meet future service requirements, concept of operations, and the design to meet NASA users' needs for below and above GEO missions. These users' needs not only address the observational mission requirements but also possible HSF missions to the year 2030. We will provide the trade-off analysis of the communication payload design in terms of the number of links looking above and below GEO; the detailed design of a GEO SSBS spacecraft bus and its accommodation of the communication payload, and a summary of the trade study that resulted in the selection of the Falcon 9 launch vehicle to deploy the SSBS and its impact on cost reductions per satellite. ======================================================================== Several initiatives have taken place within NASA1 and international space agencies2 to create a human exploration strategy for expanding human presence into the solar system; these initiatives have been driven by multiple factors to benefit Earth. Of the many elements in the strategy one stands out: to send robotic and human missions to destinations beyond Low Earth Orbit (LEO), including cis-lunar space, Near-Earth Asteroids (NEAs), the Moon, and Mars and its moons.3, 4 The time frame for human exploration to various destinations, based on the public information available,1,4 is shown in Figure 1. Advance planning is needed to define how future space communications services will be provided in the new budget environment to meet future space communications needs. The spacecraft for these missions can be dispersed anywhere from below LEO to beyond GEO, and to various destinations within the solar system. NASA's Space Communications and Navigation (SCaN) program office provides communication and tracking services to space missions during launch, in-orbit testing, and operation phases. Currently, SCaN's space networking relay satellites mainly provide services to users below GEO, at Near Earth Orbit (NEO), below LEO, and in deep space. The potential exists for using a space-based relay satellite, located in the vicinity of various solar system destinations, to provide communication space links to missions both below and above its orbit. Such relays can meet the needs of human exploration missions for maximum connectivity to Earth locations and for reduced latency. In the past, several studies assessed the ability of satellite-based relays working above GEO in conjunction with Earth ground stations. Many of these focused on the trade between space relay and direct-to-Earth station links5,6,7. Several others focused on top-level architecture based on relays at various destinations8,9,10,11,12. Much has changed in terms of microwave and optical technology since the publication of the referenced papers; Ka-band communication systems are being deployed, optical communication is being demonstrated, and spacecraft buses are becoming increasingly more functional and operational. A design concept study was undertaken to access the potential for deploying a Small Space-Based Satellite (SSBS) relay capable of serving missions between LEO and NEO. The needs of future human exploration missions were analyzed, and a notional relay-based architecture concept was generated as shown in Fig. 1. Relay satellites in Earth through cis-Lunar orbits are normally located in stable orbits requiring low fuel consumption. Relay satellites for Mars orbit are normally selected based on the mission requirement and projected fuel consumption. Relay satellites have extreme commonalities of functions between them, differing only in the redundancy and frequencies used; therefore, the relay satellite in GEO was selected for further analysis since it will be the first step in achieving a relay-based architecture for human exploration missions (see Fig.Figure 2). The mission design methodology developed by the Collaborative Modeling for Parametric Assessment of Space Systems (COMPASS) team13 was used to produce the satellite relay design and to perform various design trades. At the start of the activity, the team was provided with the detailed concept of the notional architecture and the system and communication payload drivers.

Relay Satellites↗

Separation-Compliant, Optimal Routing and Control of Scheduled Arrivals in a Terminal Airspace

We address the problem of navigating a set (fleet) of aircraft in an aerial route network so as to bring each aircraft to its destination at a specified time and with minimal distance separation assured between all aircraft at all times. The speed range, initial position, required destination, and required time of arrival at destination for each aircraft are assumed provided. Each aircraft's movement is governed by a controlled differential equation (state equation). The problem consists in choosing for each aircraft a path in the route network and a control strategy so as to meet the constraints and reach the destination at the required time. The main contribution of the paper is a model that allows to recast this problem as a decoupled collection of problems in classical optimal control and is easily generalized to the case when inertia cannot be neglected. Some qualitative insight into solution behavior is obtained using the Pontryagin Maximum Principle. Sample numerical solutions are computed using a numerical optimal control solver. The proposed model is first step toward increasing the fidelity of continuous time control models of air traffic in a terminal airspace. The Pontryagin Maximum Principle implies the polygonal shape of those portions of the state trajectories away from those states in which one or more aircraft pair are at minimal separation. The model also confirms the intuition that, the narrower the allowed speed ranges of the aircraft, the smaller the space of optimal solutions, and that an instance of the optimal control problem may not have a solution at all (i.e., no control strategy that meets the separation requirement and other constraints).

transportation network↗

Strategic Implications of Phobos as a Staging Point for Mars Surface Missions

As human exploration endeavors begin to set sights beyond low Earth orbit to the surface of the Moon, exploration of the surface of Mars continues to serve as the “horizon destination” to help focus development and research efforts. One Mars exploration strategy often discussed is the notion of utilizing the moons of Mars, namely Phobos, as an exploration destination prior to Mars surface missions. The premise behind this is that staging missions from Mars’ moons as well as exploring the moons themselves would be less costly and risky. However, understanding potential advantages of Phobos staging and exploration must be done in the context of the overall end-to-end Mars surface exploration needs, goals, objectives, campaign approach, and systems required. This paper examines the strategic implications of utilizing the moons of Mars as a potential location for exploration of Mars. Operational concepts utilizing both Phobos and Mars orbital strategies will be examined to understand the architectural impacts of this staging strategy. The strategic implications of each operational concept are assessed to determine the overall key challenges and strategic links to other exploration destinations. Results from this analysis indicate that, if the objective is to conduct Mars surface missions, utilizing Phobos as an exploration destination adds little benefit toward the goal of exploration of Mars.

Drake, Bret G.↗

A feasibility assessment of nuclear reactor power system concepts for the NASA Growth Space Station

A preliminary feasibility assessment of the integration of reactor power system concepts with a projected growth Space Station architecture was conducted to address a variety of installation, operational, disposition and safety issues. A previous NASA sponsored study, which showed the advantages of Space Station - attached concepts, served as the basis for this study. A study methodology was defined and implemented to assess compatible combinations of reactor power installation concepts, disposal destinations, and propulsion methods. Three installation concepts that met a set of integration criteria were characterized from a configuration and operational viewpoint, with end-of-life disposal mass identified. Disposal destinations that met current aerospace nuclear safety criteria were identified and characterized from an operational and energy requirements viewpoint, with delta-V energy requirement as a key parameter. Chemical propulsion methods that met current and near-term application criteria were identified and payload mass and delta-V capabilities were characterized. These capabilities were matched against concept disposal mass and destination delta-V requirements to provide a feasibility of each combination.

Bloomfield, H. S.↗

Message routing in HARTS with faulty components

It is important to design a distributed system which is capable of delivering messages even in the presence of faulty components between their source and destination nodes. A routing scheme is developed in two steps for a wrapped hexagonal mesh, called HARTS (Hexagonal Architecture for Real-Time Systems), which assures the delivery of every message as long as there is a path between its source and destination. The proposed scheme can also detect the nonexistence of path between a pair of nodes in a finite amount of time. Moreover, the scheme requires each node in HARTS to know only the state (faulty or not) of each of its own links. The performance of the simple routing scheme is simulated for 3- and 5-dimensional H-meshes while varying the physical distribution of faulty components. It is shown that a shortest path between the source and destination of each message is taken with a high probability and a path, if it exists, is usually found very quickly.

Olson, Alan↗

A feasibility assessment of installation, operation and disposal options for nuclear reactor power system concepts for a NASA growth space station

A preliminary feasibility assessment of the integration of reactor power system concepts with a projected growth space station architecture was conducted to address a variety of installation, operational disposition, and safety issues. A previous NASA sponsored study, which showed the advantages of space station - attached concepts, served as the basis for this study. A study methodology was defined and implemented to assess compatible combinations of reactor power installation concepts, disposal destinations, and propulsion methods. Three installation concepts that met a set of integration criteria were characterized from a configuration and operational viewpoint, with end-of-life disposal mass identified. Disposal destinations that met current aerospace nuclear safety criteria were identified and characterized from an operational and energy requirements viewpoint, with delta-V energy requirement as a key parameter. Chemical propulsion methods that met current and near-term application criteria were identified and payload mass and delta-V capabilities were characterized. These capabilities were matched against concept disposal mass and destination delta-V requirements to provide the feasibility of each combination.

Bloomfield, Harvey S.↗

Depth-first search approach for fault-tolerant routing in hypercube multicomputers

Using depth-first search, the authors develop and analyze the performance of a routing scheme for hypercube multicomputers in the presence of an arbitrary number of faulty components. They derive an exact expression for the probability of routing messages by way of optimal paths (of length equal to the Hamming distance between the corresponding pair of nodes) from the source node to an obstructed node. The obstructed node is defined as the first node encountered by the message that finds no optimal path to the destination node. It is noted that the probability of routing messages over an optimal path between any two nodes is a special case of the present results and can be obtained by replacing the obstructed node with the destination node. Numerical examples are given to illustrate the results, and they show that, in the presence of component failures, depth-first search routing can route a message to its destination by means of an optimal path with a very high probability.

Chen, Ming-Syan↗

Cascading a systolic array and a feedforward neural network for navigation and obstacle avoidance using potential fields

A technique is developed for vehicle navigation and control in the presence of obstacles. A potential function was devised that peaks at the surface of obstacles and has its minimum at the proper vehicle destination. This function is computed using a systolic array and is guaranteed not to have local minima. A feedfoward neural network is then used to control the steering of the vehicle using local potential field information. In this case, the vehicle is a trailer truck backing up. Previous work has demonstrated the capability of a neural network to control steering of such a trailer truck backing to a loading platform, but without obstacles. Now, the neural network was able to learn to navigate a trailer truck around obstacles while backing toward its destination. The network is trained in an obstacle free space to follow the negative gradient of the field, after which the network is able to control and navigate the truck to its target destination in a space of obstacles which may be stationary or movable.

Plumer, Edward S.↗

Network of dedicated processors for finding lowest-cost map path

A method and associated apparatus are disclosed for finding the lowest cost path of several variable paths. The paths are comprised of a plurality of linked cost-incurring areas existing between an origin point and a destination point. The method comprises the steps of connecting a purality of nodes together in the manner of the cost-incurring areas; programming each node to have a cost associated therewith corresponding to one of the cost-incurring areas; injecting a signal into one of the nodes representing the origin point; propagating the signal through the plurality of nodes from inputs to outputs; reducing the signal in magnitude at each node as a function of the respective cost of the node; and, starting at one of the nodes representing the destination point and following a path having the least reduction in magnitude of the signal from node to node back to one of the nodes representing the origin point whereby the lowest cost path from the origin point to the destination point is found.

Eberhardt, Silvio P.↗

A high performance totally ordered multicast protocol

This paper presents the Reliable Multicast Protocol (RMP). RMP provides a totally ordered, reliable, atomic multicast service on top of an unreliable multicast datagram service such as IP Multicasting. RMP is fully and symmetrically distributed so that no site bears un undue portion of the communication load. RMP provides a wide range of guarantees, from unreliable delivery to totally ordered delivery, to K-resilient, majority resilient, and totally resilient atomic delivery. These QoS guarantees are selectable on a per packet basis. RMP provides many communication options, including virtual synchrony, a publisher/subscriber model of message delivery, an implicit naming service, mutually exclusive handlers for messages, and mutually exclusive locks. It has commonly been held that a large performance penalty must be paid in order to implement total ordering -- RMP discounts this. On SparcStation 10's on a 1250 KB/sec Ethernet, RMP provides totally ordered packet delivery to one destination at 842 KB/sec throughput and with 3.1 ms packet latency. The performance stays roughly constant independent of the number of destinations. For two or more destinations on a LAN, RMP provides higher throughput than any protocol that does not use multicast or broadcast.

Montgomery, Todd↗