Search NASA⌕ Search

SEARCH · Search NASA

Results for “Packets”

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 703 records · Page 39

Scale-Free Compact Routing Schemes in Networks of Low Doubling Dimension

In this work, we consider compact routing schemes in networks of low doubling dimension, where the doubling dimension is the least value α such that any ball in the network can be covered by at most 2 α balls of half radius. There are two variants of routing-scheme design: (i) labeled (name-dependent) routing, in which the designer is allowed to rename the nodes so that the names (labels) can contain additional routing information, for example, topological information; and (ii) name-independent routing, which works on top of the arbitrary original node names in the network, that is, the node names are independent of the routing scheme. In this article, given any constant ε ϵ (0, 1) and an n-node edge-weighted network of doubling dimension α ϵ O(loglog n), we present —a (1 + ε)-stretch labeled compact routing scheme with Γlog n-bit routing labels, O(log 2 n/loglog n)-bit packet headers, and ((1/ε) O(α) log 3 n)-bit routing information at each node; —a (9 + ε)-stretch name-independent compact routing scheme with O(log 2 n/loglog n)-bit packet headers, and ((1/ε) O(α) log 3 n)-bit routing information at each node. In addition, we prove a lower bound: any name-independent routing scheme with o(n (ε/60)2 ) bits of storage at each node has stretch no less than 9 - ε for any ε ϵ (0, 8). Therefore, our name-independent routing scheme achieves asymptotically optimal stretch with polylogarithmic storage at each node and packet headers. Note that both schemes are scale-free in the sense that their space requirements do not depend on the normalized diameter Δ of the network. Finally, we also present a simpler nonscale-free (9 + ε)-stretch name-independent compact routing scheme with improved space requirements if Δ is polynomial in n.

97 MATHEMATICS AND COMPUTING↗

FLASH: FPGA-Accelerated Smart Switches with GCN Case Study

Some communication switches, e.g., the Mellanox SHArP and those in the IBM BlueGene clusters, are augmented to process packets at the application level with fixed-function collectives. This approach, however, lacks flexibility, which limits their applicability in diverse and dynamic workloads. Recently, a new type of programmable packet processor, which uses high-level languages, e.g., P4, has emerged as possible candidates. P4-based switches, however, fall short in certain applications, including machine learning, where capabilities not currently supported by P4 are needed. These include more complex calculation, such as sparse computation and fused multiply-accumulate, data-intensive floating point operations, data reuse, and significant memory. The problem addressed here is that such a switch augmentation needs to support: a large amount of state, significant flexible compute capability, and ease of programming, all while maintaining full functionality, including ensuring high throughput, and demonstrating utility. In this work, we propose a programmable look-aside-type accelerator that can be embedded into, or attached to, existing communication switch pipelines and that is capable of processing packets at line-rate. The proposed in-switch accelerator is based on mixing an ISA (subset of RISC-V instructions) with dataflow graphs (found in CGRAs). To augment performance, vector instructions are also supported. To facilitate usability, we have developed a complete toolchain to compile user-provided C/C++ codes to appropriate back-end instructions for configuring the accelerator. While this approach is flexible enough to support various workloads, in this paper, we consider Graph Convolutional Networks (GCNs) as a case study. Experimental results show that this approach considerably improves the performance of distributed GCN applications.

Haghi, Pouya↗

Hardware Demonstration of High-Speed Networks for Satellite Applications

This report documents the implementation results of a hardware demonstration utilizing the Serial RapidIO™ and SpaceWire protocols that was funded by Sandia National Laboratories (SNL's) Laboratory Directed Research and Development (LDRD) office. This demonstration was one of the activities in the Modeling and Design of High-Speed Networks for Satellite Applications LDRD. This effort has demonstrated the transport of application layer packets across both RapidIO and SpaceWire networks to a common downlink destination using small topologies comprised of commercial-off-the-shelf and custom devices. The RapidFET and NEX-SRIO debug and verification tools were instrumental in the successful implementation of the RapidIO hardware demonstration. The SpaceWire hardware demonstration successfully demonstrated the transfer and routing of application data packets between multiple nodes and also was able reprogram remote nodes using configuration bitfiles transmitted over the network, a key feature proposed in node-based architectures (NBAs). Although a much larger network (at least 18 to 27 nodes) would be required to fully verify the design for use in a real-world application, this demonstration has shown that both RapidIO and SpaceWire are capable of routing application packets across a network to a common downlink node, illustrating their potential use in real-world NBAs.

99 GENERAL AND MISCELLANEOUS↗

Dynamic Path Scheduling through Extensions to Generalized Multiprotocol Label Switching (GMPLS) (Final Report)

The major accomplishments of the project are the successful software implementation of the Phase I scheduling algorithms for GMPLS Label Switched Paths (LSPs) and the extension of the IETF Path Computation Element (PCE) Protocol to support scheduling extensions. In performing this work, we have demonstrated the theoretical work of Phase I, analyzed key issues, and made relevant extensions. Regarding the software implementation, we developed a proof of concept prototype as part of our Algorithm Evaluation System (AES). This implementation uses the Linux operating system to provide software portability and will be the foundation for our commercial software. To demonstrate proof of concept, we have implemented LSP scheduling algorithms to support two of the key GMPLS switching technologies (Lambda and Packet) and support both Fixed Path (FP) and Switched Path (SP) routing. We chose Lambda and Packet because we felt it was essential to include both circuit and packet switching technologies as well as to address all-optical switching in the study. As conceptualized in Phase I, the FP algorithms use a traditional approach where the LSP uses the same physical path for the entire service duration while the innovative SP algorithms allow the physical path to vary during the service duration. As part of this study, we have used the AES to conduct a performance analysis using metro size networks (up to 32 nodes) that showed that these algorithms are suitable for commercial implementation. Our results showed that the CPU time required to compute an LSP schedule was small compared to expected inter-arrival time between LSP requests. Also, when the network size increased from 7 to 15 to 32 nodes with 10, 26, and 56 TE links, the CPU processing time showed excellent scaling properties. When Fixed Path and Switched Path routing were compared, SP provided only modestly better performance with respect to LSP completion rate, service duration, path length, and start time deviation. In addition, the SP routing required somewhat more CPU time than the FP routing. However, when the allowable range for the start time is increased, the CPU time for SP increased less rapidly than FP such that the CPU processing times became comparable. Therefore, SP routing may scale better than FP routing. The Path Computation Element Working Group is a complementary working group to the GMPLS working group (CCAMP) in the IETF and is developing standards to discover, manage, and access elements that compute routes for GMPLS for LSPs. The algorithms used to compute the routes are not subject to standardization. Since the PCE supports only standard GMPLS LSPs, it does not support scheduled LSPs. Therefore, it is a natural extension of our Phase I work to introduce this enhancement into the PCE. In addition, the PCE adds another dimension to our product line because the PCE by itself may be a product with a standard interface.

97 MATHEMATICS AND COMPUTING↗

Wireless Sensor Node Power Profiling Based on IEEE 802.11 and IEEE 802.15.4 Communication Protocols. Modeling and Simulation

Most wireless sensor network (comprising of thousands of WSNs) applications require operation over extended periods of time beginning with their deployment. Network lifetime is extremely critical for most applications and is one of the limiting factors for energy-constrained networks. Based on applications, there are wide ranges of different energy sources suitable for powering WSNs. A battery is traditionally used to power WSNs. The deployed WSN is required to last for long time. Due to finite amount of energy present in batteries, it is not feasible to replace batteries. Recently there has been a new surge in the area of energy harvesting were ambient energy in the environment can be utilized to prolong the lifetime of WSNs. Some of the sources of ambient energies are solar power, thermal gradient, human motion and body heat, vibrations, and ambient RF energy. The design and development of TEGs to power WSNs that would remain active for a long period of time requires comprehensive understanding of WSN operational. This motivates the research in modeling the lifetime, i.e., power consumption, of a WSN by taking into consideration various node and network level activities. A WSN must perform three essential tasks: sense events, perform quick local information processing of sensed events, and wirelessly exchange locally processed data with the base station or with other WSNs in the network. Each task has a power cost per unit tine and an additional cost when switching between tasks. There are number of other considerations that must also be taken into account when computing the power consumption associated with each task. The considerations includes: number of events occurring in a fixed active time period and the duration of each event, event-information processing time, total communication time, number of retransmission, etc. Additionally, at the network level the communication of information data packets between WSNs involves collisions, latency, and retransmission, which result in unanticipated power losses. This report focuses rigorous stochastic modeling of power demand for a schedule-driven WSN utilizing Institute of Electrical and Electronics Engineers 802.11 and 802.15.4 communication protocols. The model captures the generic operation of a schedule-driven WSN when an external event occurs, i.e., sensing, following by processing, and followed by communication. The report will present development of an expression to compute the expected energy consumption per operational cycle of a schedule-driven WSN by taking into consideration the node level activities, i.e., sensing and processing, and the network level activities, i.e., channel access, packet collision, retransmission attempts, and transmission of a data packet.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Implementation and Demonstration of P4 Software for Improving ICS Protocol Visibility and Control [Slides]

No prior enabling funded work applicable to this proposal. Programming Protocol-independent Packet Processors (P4) is an open source, domain-specific programming language for network switching devices. P4 complements traditional Software Defined Networking (SDN) which is primarily concerned with the management of packets (e.g. routing/dropping decisions) rather than how each packet is processed. The introduction of P4 provided new capabilities (e.g. firewall, load balancing, enhanced security) but has primarily been deployed in data centers. This effort investigates ways to expand P4 into other niches such as ICS networks.

97 MATHEMATICS AND COMPUTING↗

TrojAI Alternate Analysis

In this portion of the TrojAI evaluation, we focus on the cyber-network-c2-mar2024 dataset. Recall that in this round ResNet18 and ResNet34 neural networks (NN) were trained on the USTC-TFC2016 dataset with the aim of distinguishing between benign versus botnet command and control (c2) packets. A range of bytes from each packet was reformatted into a 28x28 pixel image, and the collection of reformatted packets served as the training (and testing) data for the two ResNet models. For some of the data a trigger watermark was strategically placed to affect various inputs to the NNs. This watermarked, or poisoned, data in turn created a poisoned, or trojaned NN. The data were poisoned in different ways ultimately creating different trojaned NNs. This collection of trojaned NNs was combined with various versions of not trojaned NNs and served as the training and testing data for the performers. The performers’ task was to construct a classifier to distinguish between the trojaned and not trojaned models. It was previously noted that the performers struggled with the cyber-network-c2-mar2024 dataset, motivating this investigation of potential reasons the performers experienced challenges.

97 MATHEMATICS AND COMPUTING↗

Waves in Plasmas

Quadratic corrections to the metaplectic formulation of mode conversions. In this work we showed how to systematically deal with quadratic corrections beyond the usual linearization of the dispersion matrix at a conversion. The linearization leads to parabolic cylinder functions as the local approximation to the full-wave behavior, but these do not include the variation in amplitude associated with ray refraction in the neighborhood of the conversion. Hence, the region over which they give a good fit to the incoming and outgoing WKB solutions is small. By including higher order corrections it is possible to provide a much more robust matching. We also showed that it was possible, in principle, to extend these methods to arbitrary order. A new normal form for mode conversion. This is based upon our earlier NSF-DOE-funded work on ray helicity. We have begun efforts to apply these new ideas in practical ray tracing algorithms. Group theoretical foundation of path integrals and phase space representations of wave problems. Using the symbol theory of N. Zobin, we developed a new understanding of path integrals on phase space. The initial goal was to find practical computational tools for dealing with non-standard mode conversions. Along the way we uncovered a new way to represent wave functions directly on phase space without the intermediary of a Wigner function. We are exploring the use of these ideas for numerical studies of conversion, with the goal of eventually incorporating kinetic effects. Wave packet studies of gyroresonance crossing. In earlier work, Huanchun Ye and Allan Kaufman -- building upon ideas due to Lazar Friedland -- had shown that gyroresonance crossings could be treated as a double conversion. This perspective is one we have used for many of our papers since then. We are now performing a detailed numerical comparison between full-wave and ray tracing approaches in the study of minority-ion gyroresonance crossing. In this study, a fast magnetosonic wave -- supported by a majority-ion species such as deuterium -- crosses the resonance layer associated with a minority species, such as hydrogen. By using wave packets instead of harmonic solutions, it becomes easy to see the evolution in k-space of the minority-ion disturbance, and the time delay for emission of the reflected fast-wave packet. Iterated conversion in a cavity. When mode conversion occurs in a cavity where rays are trapped, multiple conversions will occur and the resulting absorption profile will typically have a complicated spatial dependence due to overlapping interference patterns. The goal of this work is to develop fast and efficient ray-based methods for computing the cavity response to external driving, and to compute the spatial absorption profile. We have introduced a new approach that allows us to visualize in great detail the underlying iterated ray geometry, and should lead to simpler methods for identifying parameter values where global changes occur in the qualitative response (e.g. global bifurcations).

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

NDA BATCH 2002-02

QC sample results (daily background checks, 20-gram and 100-gram SGS drum checks) were within acceptable criteria established by WIPP's Quality Assurance Objectives for TRU Waste Characterization. Replicate runs were performed on 5 drums with IDs LL85101099TRU, LL85801147TRU, LL85801109TRU, LL85300999TRU and LL85500979TRU. All replicate measurement results are identical at the 95% confidence level as established by WIPP criteria. Note that the batch covered 5 weeks of SGS measurements from 23-Jan-2002 through 22-Feb-2002. Data packet for SGS Batch 2002-02 generated using gamma spectroscopy with the Pu Facility SGS unit is technically reasonable. All QC samples are in compliance with established control limits. The batch data packet has been reviewed for correctness, completeness, consistency and compliance with WIPP's Quality Assurance Objectives and determined to be acceptable. An Expert Review was performed on the data packet between 28-Feb-02 and 09-Jul-02 to check for potential U-235, Np-237 and Am-241 interferences and address drum cases where specific scan segments showed Se gamma ray transmissions for the 136-keV gamma to be below 0.1 %. Two drums in the batch showed Pu-238 at a relative mass ratio more than 2% of all the Pu isotopes.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Self-Sustainable IoT-Based Remote Sensing Powered by Energy Harvesting Using Stacked Piezoelectric Transducer and Thermoelectric Generator

We propose a self-powered remote multi-sensing system for traffic sensing which is powered by the collective energy harvested from the mechanical vibration of the road caused by the passing vehicles and from the temperature gradient between the asphalt of the road and the soil underneath. A stacked piezoelectric transducer converts mechanical vibrations into electrical energy and a thermoelectric generator harvests the thermal energy from the thermal gradient. Electrical energy signals from the stacked piezoelectric transducer and the thermoelectric generators are converted into usable DC power to recharge the battery using AC-DC and DC-DC converters working simultaneously. The multi-sensing system comprises an embedded system with a microcontroller that acquires data from the sensors and sends the sensory data to an IoT transceiver which transmits the data as RF packets to an ethernet gateway. The gateway converts the RF packets into Internet Protocol (IP) packets and sends them to a remote server. Laboratory and road-testing results showed over 98% sensory data accuracy with the system functioning solely powered by the energy harvested from the alternative energy sources. The successful maximum transmission distance obtained between the IoT, and the gateway was approximately 1 mile, which is a considerable transmission distance achieved in an urban environment. Successful operation of the self-powered multi-sensing system under both laboratory and road conditions contributes considerably to the fields of energy harvesting and self-powered remote sensing systems. The energy flow chart and efficiency for the steps in the system were found to be mechanical power from vehicles to the energy harvester of 0.25%, stacked PZT transducer efficiency was found to be 37%, and for the TEGs the efficiency is 11%. AC-to-DC and DC-to-DC converters’ efficiencies were found to be 90% and 11%. The wireless communication RF transceiver efficiency was found to be 62.5%.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

The application of large numbers of pleasure boats to collect synoptic sea-truth for ERTS-1 overpasses

The author has identified the following significant results. In order to interpret and annotate current circulation and suspended sediment concentration maps derived from ERTS-1 digital tapes, the University of Delaware has been collecting water samples and other data from boats and helicopters. In order to increase the number of samples at the exact time of the ERTS-1 pass over Delaware Bay, pleasure craft were organized to obtain samples of the entire test site. On the ERTS-1 pass of July second, scientists were stationed at three public boat launches along the Bay to hand out sampling packets to interested boaters. The packets contained two litre sampling bottles, a map, data card, and a pen. The boaters were asked to fill the two bottles between 11 and 11:15 a.m., mark their location on the map, and fill out the data card. Forty-nine packets were handed out of which 40 were returned (82%). Only four of the 40 were not in the alloted time range. This gave 36 real time data points covering approximately 30 nautical miles. The samples are being analyzed for sediment concentration, particle size, and salinity. Participating boaters will receive a copy of an ERTS image of the Delaware Bay and a summary report of the project. Because of the success of the project, future use of pleasure boaters is being planned.

Klemas, V.↗

Skylab neutron environment experiment (Science Demonstration SD-34 (TV108)). Description and preliminary results

Neutron and proton induced radioactivity at various locations within Skylab were measured. Samples of five metals were formed into activation packets and deployed at the following locations on the Skylab 4 mission: orbital workshop film vault, water storage tank, and two opposing orbital workshop internal locations. Radioactive nuclides were produced in the packets by nuclear interactions of high-energy protons and secondary neutrons within Skylab. Low-level gamma ray spectroscopy measurements were made on the returned packets to determine the incident neutron and proton fluxes and spectra and their variations with mass distribution.

Fishman, G. J.↗

A new approach to data management and its impact on frequency control requirements

A new approach to data management consisting of spacecraft and data/information autonomy and its impact on frequency control requirements is presented. An autonomous spacecraft is capable of functioning without external intervention for up to 72 hr by enabling the sensors to make observations, maintaining its health and safety, and by using logical safety modes when anomalies occur. Data/information are made autonomous by associating all relevant ancillary data such as time, position, attitude, and sensor identification with the data/information record of an event onboard the spacecraft. This record is so constructed that the record of the event can be physically identified in a complete and self-contained record that is independent of all other data. All data within a packet will be time tagged to the needed accuracy, and the time markings from packet to packet will be coherent to a UTC time scale.

Blanchard, D. L.↗

Comparison of methods for prediction of transition by stability analysis

The paper compares several methods of transition prediction of linear stability analysis. The spectral stability analysis code SALLY is used to analyze flows over laminar flow control wings. It is shown that transition prediction by the envelope method and a new modified wave packet method are comparable in reliability, but that the envelope method is more efficient computationally. This is based on the results which show that the wave packet method provides N factors which are at best as consistent as those of the envelope method; since the wave packet method is at least 3 times as expensive as the envelope method, the latter is recommended for engineering design calculations.

Malik, M. R.↗

Next generation communications satellites: Multiple access and network studies

Following an overview of issues involved in the choice of promising system architectures for efficient communication with multiple small inexpensive Earth stations serving hetergeneous user populations, performance evaluation via analysis and simulation for six SS/TDMA (satellite-switched/time-division multiple access) system architectures is discussed. These configurations are chosen to exemplify the essential alternatives available in system design. Although the performance evaluation analyses are of fairly general applicability, whenever possible they are considered in the context of NASA's 30/20 GHz studies. Packet switched systems are considered, with the assumption that only a part of transponder capacit is devoted to packets, the integration of circuit and packet switched traffic being reserved for further study. Three types of station access are distinguished: fixed (FA), demand (DA), and random access (RA). Similarly, switching in the satellite can be assigned on a fixed (FS) or demand (DS) basis, or replaced by a buffered store-and-forward system (SF) onboard the satellite. Since not all access/switching combinations are practical, six systems are analyzed in detail: three FS SYSTEMS, FA/FS, DA/ES, RA/FS; one DS system, DA/DS; and two SF systems, FA/SF, DA/SF. Results are presented primarily in terms of delay-throughput characteristics.

Stern, T. E.↗

Data transport concepts for future NASA spacecraft

The anticipated increase in data quantity from NASA spacecraft over the next decade is expected to far exceed the capability of the present NASA data/information system to effectively manage and process that data. Conceptual designs aimed at providing more responsive and cost-effective methods for transporting and interpreting space-generated data are presented. Details of the Modular Data Transport System (MDTS) and Ancillary Data and Support Computing (ADSC) efforts done under the NASA End-to-End Data System (NEEDS) program are discussed. The common 'thread' throughout the data transport process involves the use of packet telemetry. Characteristics and benefits of packet telemetry are presented along with a discussion of techniques for generating and advantages of including ancillary data in each packet.

Lord, D. D.↗

Distributed reservation control protocols for random access broadcasting channels

Attention is given to a communication network consisting of an arbitrary number of nodes which can communicate with each other via a time-division multiple access (TDMA) broadcast channel. The reported investigation is concerned with the development of efficient distributed multiple access protocols for traffic consisting primarily of single packet messages in a datagram mode of operation. The motivation for the design of the protocols came from the consideration of efficient multiple access utilization of moderate to high bandwidth (4-40 Mbit/s capacity) communication satellite channels used for the transmission of short (1000-10,000 bits) fixed length packets. Under these circumstances, the ratio of roundtrip propagation time to packet transmission time is between 100 to 10,000. It is shown how a TDMA channel can be adaptively shared by datagram traffic and constant bandwidth users such as in digital voice applications. The distributed reservation control protocols described are a hybrid between contention and reservation protocols.

Greene, E. P.↗

Queueing analysis of synchronous time division multiplexing with individual source buffering

Synchronous time division multiplexing is analyzed. Packets of information arrive at the system as a compound Poisson process, and are transmitted only during individual periodic intervals. Packet arrivals are blocked (lost) if the system has a finite capacity and is congested. Using the theory of semiregenerative processes, the distribution of the number of packets in the system (system size) is found. This nonstationary distribution is used to determine the complete system behavior, including the delay distributions, the blocking probability, and the density of the system size at arrival instants. Numerical examples illustrate applications of the results given.

Clare, L.↗