Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 37 records · Page 2

Wireless Avionics Packet to Support Fault Tolerance for Flight Applications

In this protocol and packet format, data traffic is monitored by all network interfaces to determine the health of transmitter and subsystems. When failures are detected, the network inter face applies its recover y policies to provide continued service despite the presence of faults. The protocol, packet format, and inter face are independent of the data link technology used. The current demonstration system supports both commercial off-the-shelf wireless connections and wired Ethernet connections. Other technologies such as 1553 or serial data links can be used for the network backbone. The Wireless Avionics packet is divided into three parts: a header, a data payload, and a checksum. The header has the following components: magic number, version, quality of service, time to live, sending transceiver, function code, payload length, source Application Data Interface (ADI) address, destination ADI address, sending node address, target node address, and a sequence number. The magic number is used to identify WAV packets, and allows the packet format to be updated in the future. The quality of service field allows routing decisions to be made based on this value and can be used to route critical management data over a dedicated channel. The time to live value is used to discard misrouted packets while the source transceiver is updated at each hop. This information is used to monitor the health of each transceiver in the network. To identify the packet type, the function code is used. Besides having a regular data packet, the system supports diagnostic packets for fault detection and isolation. The payload length specifies the number of data bytes in the payload, and this supports variable-length packets in the network. The source ADI is the address of the originating interface. This can be used by the destination application to identify the originating source of the packet where the address consists of a subnet, subsystem class within the subnet, a subsystem unit, and the local ADI number. The destination ADI is used to route the packet to its ultimate destination. At each hop, the sending interface uses the destination address to determine the next node for the data. The sending node is the node address of the interface that is broadcasting the packet. This field is used to determine the health of the subsystem that is sending the packet. In the case of a packet that traverses several intermediate nodes, it may be the node address of the intermediate node. The target node is the node address of the next hop for the packet. It may be an intermediate node, or the final destination for the packet. The sequence number is used to identify duplicate packets. Because each interface has multiple transceivers, the same packet will appear at both receivers. The sequence number allows the interface to correlate the reception and forward a single, unique packet for additional processing. The subnet field allows data traffic to be partitioned into segregated local networks to support large networks while keeping each subnet at a manageable size. This also keeps the routing table small enough so routing can be done by a simple table lookup in an FPGA device. The subsystem class identifies members of a set of redundant subsystems, and, in a hot standby configuration, all members of the subsystem class will receive the data packets. Only the active subsystem will generate data traffic. Specific units in a class of redundant units can be identified and, if the hot standby configuration is not used, packets will be directed to a specific subsystem unit.

Block, Gary L.↗

Wave packet dynamics in a monolayer graphene

The dynamics of charge particles described by Gaussian wave packet in monolayer graphene is studied analytically and numerically. We demonstrate that the shape of wave packet at arbitrary time depends on correlation between the initial electron amplitudes {psi}{sub 1}(r-vector,0) and {psi}{sub 2}(r-vector,0) on the sublattices A and B correspondingly (i.e., pseudospin polarization). For the transverse pseudospin polarization the motion of the center of wave packet occurs in the direction perpendicular to the average momentum p-vector{sub 0}=({Dirac_h}/2{pi})k-vector{sub 0}. Moreover, in this case the initial wave packet splits into two parts moving with opposite velocities along p-vector{sub 0}. If the initial direction of pseudospin coincides with average momentum the splitting is absent and the center of wave packet is displaced at t>0 along the same direction. The results of our calculations show that all types of motion experience Zitterbewegung. Besides, depending on initial polarization the velocity of the packet center may have the constant component v{sub c}=uf(a), where u{approx_equal}10{sup 8} cm/s is the Fermi velocity and f(a) is a function of the parameter a=k{sub 0}d (d is the initial width of wave packet). As a result, the direction of the packet motion is determined not only by the orientation of the average momentum, but mainly by the phase difference between the up and low components of the wave functions. Similar peculiarities of the dynamics of two-dimensional electron wave packet connected with initial spin polarization should take place in the semiconductor quantum well under the influence of the Rashba spin-orbit coupling.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Networked-based Cyber Analysis using Deep Packet Inspection (DPI) for High-Speed Networks

Today’s networked systems utilize advanced security components such as Next Generation Firewall (NGFW), Intrusion Detection Systems (IDS), Intrusion Prevention Systems (IPS), and methods for network traffic classification. A fundamental aspect of these security components and methods is network packet visibility and packet inspection. To achieve packet visibility, a compute mechanism used by these security components and methods is Deep Packet Inspection (DPI). DPI is used to obtain visibility into packet fields by looking deeper inside packets, beyond just IP address, port, and protocol. However, DPI is considered extremely expensive in terms of compute processing costs and very challenging to implement on high speed network systems. The fundamental scientific paradigm addressed in this research project is the application of greater network packet visibility and packet inspection at data rates greater than 40Gbps to secure computer network systems. The greater visibility and inspection will enable detection of advanced content-based threats that exploit application vulnerabilities and are designed to bypass traditional security approaches such as firewalls and antivirus scanners. Greater visibility and inspection are achieved through identification of the application protocol (e.g., HTTP, SMTP, Skype) and, in some cases, extraction and processing of the information contained in the packet payload. Analysis is then performed on the resulting DPI data to identify potentially malicious behavior. In order to obtain visibility and inspect the application protocol and contents at high speed data rates, advanced DPI technologies and implementations are developed.

97 MATHEMATICS AND COMPUTING↗

Apparatus and methods for managing packet transfer across a memory fabric physical layer interface

An apparatus and method for managing packet transfer between a memory fabric having a physical layer interface higher data rate than a data rate of a physical layer interface of another device, receives incoming packets from the memory fabric physical layer interface wherein at least some of the packets include different instruction types. The apparatus and method determine a packet type of the incoming packet received from the memory fabric physical layer interface and when the determined incoming packet type is of a type containing an atomic request, the method and apparatus prioritizes transfer of the incoming packet with the atomic request over other packet types of incoming packets, to memory access logic that accesses local memory within an apparatus.

Blagodurov, Sergey↗

Extensible packet processing architecture

A technique for distributed packet processing includes sequentially passing packets associated with packet flows between a plurality of processing engines along a flow through data bus linking the plurality of processing engines in series. At least one packet within a given packet flow is marked by a given processing engine to signify by the given processing engine to the other processing engines that the given processing engine has claimed the given packet flow for processing. A processing function is applied to each of the packet flows within the processing engines and the processed packets are output on a time-shared, arbitered data bus coupled to the plurality of processing engines.

97 MATHEMATICS AND COMPUTING↗

GoldenEye: stream-based network packet inspection using GPUs

High-performance packet analysis systems have attracted great interest as tools to deal with security concerns in high-speed networks. Recently, researchers have utilized GPUs to improve packet processing performance. However, most existing work has been targeted at per-packet analysis level. Flow-centric operations have been challenging for GPUs because they require sequential operations and large buffers for flow reassembly. In this work, we present the GoldenEye GPU Packet Processing System (GoldenEye), a deep packet inspection (DPI) system that tracks out-of-order TCP packets and provides streambased signature matching. When a batch of packets arrives, GoldenEye sorts packets into flow-reassembled streams and normalizes retransmission through a GPU-implemented reordering module. For signatures that straddle batch boundaries, GoldenEye couples a small set of metadata with a functionallyequivalent minimal regular expression retrieval algorithm to connect the partial matches. Results show that GoldenEye can reassemble tens of millions of packets/sec and conduct stateful DPI operations on TCP streams at multi-ten Gbit/sec rates.

97 MATHEMATICS AND COMPUTING↗

Minimal position-velocity uncertainty wave packets in relativistic and non-relativistic quantum mechanics

We consider wave packets of free particles with a general energy-momentum dispersion relation E(p). The spreading of the wave packet is determined by the velocity v={partial_derivative}{sub p}E. The position-velocity uncertainty relation {delta}x{delta}v{>=}1/2 |<{partial_derivative}{sub p}{sup 2}E>| is saturated by minimal uncertainty wave packets {phi}(p)=Aexp(-{alpha}E(p)+{beta}p). In addition to the standard minimal Gaussian wave packets corresponding to the non-relativistic dispersion relation E(p)=p{sup 2}/2m, analytic calculations are presented for the spreading of wave packets with minimal position-velocity uncertainty product for the lattice dispersion relation E(p)=-cos(pa)/ma{sup 2} as well as for the relativistic dispersion relation E(p)={radical}(p{sup 2}+m{sup 2}). The boost properties of moving relativistic wave packets as well as the propagation of wave packets in an expanding Universe are also discussed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Sorting reordered packets with interrupt coalescing

TCP performs poorly in networks with serious packet reordering. Processing reordered packets in the TCP layer is costly and inefficient, involving interaction of the sender and receiver. Motivated by the interrupt coalescing mechanism that delivers packets upward for protocol processing in blocks, we propose a new strategy, Sorting Reordered Packets with Interrupt Coalescing (SRPIC), to reduce packet reordering in the receiver. SRPIC works in the network device driver/ it makes use of the interrupt coalescing mechanism to sort the reordered packets belonging to the same TCP stream in a block of packets before delivering them upward/ each sorted block is internally ordered. Experiments have proven the effectiveness of SRPIC against forward-path reordering.

Wu, Wenji↗

Experimental evaluation of the impact of packet capturing tools for web services.

Network measurement is a discipline that provides the techniques to collect data that are fundamental to many branches of computer science. While many capturing tools and comparisons have made available in the literature and elsewhere, the impact of these packet capturing tools on existing processes have not been thoroughly studied. While not a concern for collection methods in which dedicated servers are used, many usage scenarios of packet capturing now requires the packet capturing tool to run concurrently with operational processes. In this work we perform experimental evaluations of the performance impact that packet capturing process have on web-based services; in particular, we observe the impact on web servers. We find that packet capturing processes indeed impact the performance of web servers, but on a multi-core system the impact varies depending on whether the packet capturing and web hosting processes are co-located or not. In addition, the architecture and behavior of the web server and process scheduling is coupled with the behavior of the packet capturing process, which in turn also affect the web server's performance.

99 GENERAL AND MISCELLANEOUS↗

Scattering wave packets of hadrons in gauge theories: Preparation on a quantum computer

Quantum simulation holds promise of enabling a complete description of high-energy scattering processes rooted in gauge theories of the Standard Model. A first step in such simulations is preparation of interacting hadronic wave packets. To create the wave packets, one typically resorts to adiabatic evolution to bridge between wave packets in the free theory and those in the interacting theory, rendering the simulation resource intensive. In this work, we construct a wave-packet creation operator directly in the interacting theory to circumvent adiabatic evolution, taking advantage of resource-efficient schemes for ground-state preparation, such as variational quantum eigensolvers. By means of an ansatz for bound mesonic excitations in confining gauge theories, which is subsequently optimized using classical or quantum methods, we show that interacting mesonic wave packets can be created efficiently and accurately using digital quantum algorithms that we develop. Specifically, we obtain high-fidelity mesonic wave packets in the Z 2 and U(1) lattice gauge theories coupled to fermionic matter in 1+1 dimensions. Our method is applicable to both perturbative and non-perturbative regimes of couplings. The wave-packet creation circuit for the case of the Z 2 lattice gauge theory is built and implemented on the Quantinuum H1-1 trapped-ion quantum computer using 13 qubits and up to 308 entangling gates. The fidelities agree well with classical benchmark calculations after employing a simple symmetry-based noise-mitigation technique. This work serves as a step toward quantum computing scattering processes in quantum chromodynamics.

97 MATHEMATICS AND COMPUTING↗

On-board closed-loop congestion control for satellite based packet switching networks

NASA LeRC is currently investigating a satellite architecture that incorporates on-board packet switching capability. Because of the statistical nature of packet switching, arrival traffic may fluctuate and thus it is necessary to integrate congestion control mechanism as part of the on-board processing unit. This study focuses on the closed-loop reactive control. We investigate the impact of the long propagation delay on the performance and propose a scheme to overcome the problem. The scheme uses a global feedback signal to regulate the packet arrival rate of ground stations. In this scheme, the satellite continuously broadcasts the status of its output buffer and the ground stations respond by selectively discarding packets or by tagging the excessive packets as low-priority. The two schemes are evaluated by theoretical queuing analysis and simulation. The former is used to analyze the simplified model and to determine the basic trends and bounds, and the later is used to assess the performance of a more realistic system and to evaluate the effectiveness of more sophisticated control schemes. The results show that the long propagation delay makes the closed-loop congestion control less responsive. The broadcasted information can only be used to extract statistical information. The discarding scheme needs carefully-chosen status information and reduction function, and normally requires a significant amount of ground discarding to reduce the on-board packet loss probability. The tagging scheme is more effective since it tolerates more uncertainties and allows a larger margin of error in status information. It can protect the high-priority packets from excessive loss and fully utilize the downlink bandwidth at the same time.

Chu, Pong P.↗

Packet flow monitoring tool and method

A system and method for converting packet streams into session summaries. Session summaries are a group of packets each having a common source and destination internet protocol (IP) address, and, if present in the packets, common ports. The system first captures packets from a transport layer of a network of computer systems, then decodes the packets captured to determine the destination IP address and the source IP address. The system then identifies packets having common destination IP addresses and source IP addresses, then writes the decoded packets to an allocated memory structure as session summaries in a queue.

97 MATHEMATICS AND COMPUTING↗

Packet sniffer node and system including the same to assess wireless communication performance

A wireless system includes a plurality of wireless nodes structured to participate in a system test of the wireless nodes. The system test includes a plurality of test packets. A packet sniffer node includes a wireless receiver, a memory storing a schedule defining transmission and reception of the test packets by the wireless nodes, and a processor cooperating with the wireless receiver and the memory to receive at least some of the test packets responsive to the schedule, and to output data corresponding to the received test packets of the system test. A monitoring computer receives the output data from the processor of the packet sniffer node. Operation of the packet sniffer node, which does not transmit, does interfere with or alter execution of the system test.

Armstrong, Brian S. R.↗

Network packet templating for GPU-initiated communication

Systems, apparatuses, and methods for performing network packet templating for graphics processing unit (GPU)-initiated communication are disclosed. A central processing unit (CPU) creates a network packet according to a template and populates a first subset of fields of the network packet with static data. Next, the CPU stores the network packet in a memory. A GPU initiates execution of a kernel and detects a network communication request within the kernel and prior to the kernel completing execution. Responsive to this determination, the GPU populates a second subset of fields of the network packet with runtime data. Then, the GPU generates a notification that the network packet is ready to be processed. A network interface controller (NIC) processes the network packet using data retrieved from the first subset of fields and from the second subset of fields responsive to detecting the notification.

97 MATHEMATICS AND COMPUTING↗

Bohmian trajectories of Airy packets

The discovery of Berry and Balazs in 1979 that the free-particle Schrödinger equation allows a non-dispersive and accelerating Airy-packet solution has taken the folklore of quantum mechanics by surprise. Over the years, this intriguing class of wave packets has sparked enormous theoretical and experimental activities in related areas of optics and atom physics. Within the Bohmian mechanics framework, we present new features of Airy wave packet solutions to Schrödinger equation with time-dependent quadratic potentials. In particular, we provide some insights to the problem by calculating the corresponding Bohmian trajectories. It is shown that by using general space–time transformations, these trajectories can display a unique variety of cases depending upon the initial position of the individual particle in the Airy wave packet. Further, we report here a myriad of nontrivial Bohmian trajectories associated to the Airy wave packet. These new features are worth introducing to the subject’s theoretical folklore in light of the fact that the evolution of a quantum mechanical Airy wave packet governed by the Schrödinger equation is analogous to the propagation of a finite energy Airy beam satisfying the paraxial equation. Numerous experimental configurations of optics and atom physics have shown that the dynamics of Airy beams depends significantly on initial parameters and configurations of the experimental set-up.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Trajectory description of the quantum–classical transition for wave packet interference

The quantum–classical transition for wave packet interference is investigated using a hydrodynamic description. A nonlinear quantum–classical transition equation is obtained by introducing a degree of quantumness ranging from zero to one into the classical time-dependent Schrödinger equation. This equation provides a continuous description for the transition process of physical systems from purely quantum to purely classical regimes. In this study, the transition trajectory formalism is developed to provide a hydrodynamic description for the quantum–classical transition. The flow momentum of transition trajectories is defined by the gradient of the action function in the transition wave function and these trajectories follow the main features of the evolving probability density. Then, the transition trajectory formalism is employed to analyze the quantum–classical transition of wave packet interference. For the collision-like wave packet interference where the propagation velocity is faster than the spreading speed of the wave packet, the interference process remains collision-like for all the degree of quantumness. However, the interference features demonstrated by transition trajectories gradually disappear when the degree of quantumness approaches zero. For the diffraction-like wave packet interference, the interference process changes continuously from a diffraction-like to collision-like case when the degree of quantumness gradually decreases. This study provides an insightful trajectory interpretation for the quantum–classical transition of wave packet interference.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Numerical approximation of the Schrödinger equation with the electromagnetic field by the Hagedorn wave packets

In this paper, we approximate the semi-classical Schrödinger equation in the presence of electromagnetic field by the Hagedorn wave packets approach. By operator splitting, the Hamiltonian is divided into the modified part and the residual part. The modified Hamiltonian, which is the main new idea of this paper, is chosen by the fact that Hagedorn wave packets are localized both in space and momentum so that a crucial correction term is added to the truncated Hamiltonian, and is treated by evolving the parameters associated with the Hagedorn wave packets. The residual part is treated by a Galerkin approximation. We prove that, with the modified Hamiltonian only, the Hagedorn wave packets dynamics give the asymptotic solution with error O(ε{sup 1/2}), where ε is the scaled Planck constant. We also prove that, the Galerkin approximation for the residual Hamiltonian can reduce the approximation error to O(ε{sup k/2}), where k depends on the number of Hagedorn wave packets added to the dynamics. This approach is easy to implement, and can be naturally extended to the multidimensional cases. Unlike the high order Gaussian beam method, in which the non-constant cut-off function is necessary and some extra error is introduced, the Hagedorn wave packets approach gives a practical way to improve accuracy even when ε is not very small.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A signal packet router for the upgrade of the Muon spectrometer at the ATLAS experiment

Here, we present the design, characterization, and production of a signal packet router for the upgrade of the ATLAS forward muon detector. The router serves as a packet switch in one of the primary trigger paths. It handles up to 12 serial inputs at 4.8 Gbps/input from on-detector electronics and outputs four 4.8 Gbps to the trigger processing circuits. In the 12-to-4 packet switching process, the input streams are decoded and synchronized to a common clock domain for data packets forwarding and NULL packets suppression. Challenges in the design include operations of multi-giga hertz serial links with low and constant latency (<100 ns) for packet routing, as well as mitigation of radiation-induced effects in the harsh radiation environment over 10 years of detector operation. The Router design has been fully characterized and demonstrated to meet all specifications. In total 256 Routers were installed in the detector. Its design concept can be used in other similar applications, particularly in a radiation environment.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗