Search NASA⌕ Search

SEARCH · Search NASA

Results for “network traffic analysis”

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 109 records · Page 6

A communications model for an ISAS to NASA span link

The authors propose that an initial computer-to-computer communication link use the public packet switched networks (PPSN) Venus-P in Japan and TELENET in the U.S. When the traffic warrants it, this link would then be upgraded to a dedicated leased line that directly connects into the Space Physics Analysis Network (SPAN). The proposed system of hardware and software will easily support migration to such a dedicated link. It therefore provides a cost effective approach to the network problem. Once a dedicated line becomes operation it is suggested that the public networks link and continue to coexist, providing a backup capability.

Green, James L.↗

An Architectural Concept for Intrusion Tolerance in Air Traffic Networks

The goal of an intrusion tolerant network is to continue to provide predictable and reliable communication in the presence of a limited num ber of compromised network components. The behavior of a compromised network component ranges from a node that no longer responds to a nod e that is under the control of a malicious entity that is actively tr ying to cause other nodes to fail. Most current data communication ne tworks do not include support for tolerating unconstrained misbehavio r of components in the network. However, the fault tolerance communit y has developed protocols that provide both predictable and reliable communication in the presence of the worst possible behavior of a limited number of nodes in the system. One may view a malicious entity in a communication network as a node that has failed and is behaving in an arbitrary manner. NASA/Langley Research Center has developed one such fault-tolerant computing platform called SPIDER (Scalable Proces sor-Independent Design for Electromagnetic Resilience). The protocols and interconnection mechanisms of SPIDER may be adapted to large-sca le, distributed communication networks such as would be required for future Air Traffic Management systems. The predictability and reliabi lity guarantees provided by the SPIDER protocols have been formally v erified. This analysis can be readily adapted to similar network stru ctures.

Maddalon, Jeffrey M.↗

Criteria development for upgrading computer networks

Being an infrastructure system, the computer network has a fundamental role in the day to day activities of personnel working at KSC. It is easily appreciated that the lack of 'satisfactory' network performance can have a high 'cost' for KSC. Yet, this seemingly obvious concept is quite difficult to demonstrate. At what point do we say that performance is below the lowest tolerable level? How do we know when the 'cost' of using the system at the current level of degraded performance exceeds the cost of upgrading it? In this research, we consider the cost and performance factors that may have an effect in decision making in regards to upgrading computer networks. Cost factors are detailed in terms of 'direct costs' and 'subjective costs'. Performance factors are examined in terms of 'required performance' and 'offered performance.' Required performance is further examined by presenting a methodology for trend analysis based on applying interpolation methods to observed traffic levels. Offered performance levels are analyzed by deriving simple equations to evaluate network performance. The results are evaluated in the light of recommended upgrade policies currently in use for telephone exchange systems, similarities and differences between the two types of services are discussed.

Efe, Kemal↗

Graph Analytics and Optimization Methods for Insights from the Uber Movement Data

In this work we leverage the Uber movement dataset for the Los Angeles (LA) area where partial TAZ to TAZ (Traffic Analysis Zone) trip time data is available. We first create a TAZ-TAZ network based on nearest neighbors and propose a model that allows us to complete the $(O-D)$ (Origin-Destination) travel time matrix, using optimization methods such as non-negative least squares. We apply these algorithms for several communities in the TAZ-TAZ network and present insights in the form of completed $(O-D)$ matrices and associated temporal trends. We qualify the error performance and scalability of our flows. We conclude by pointing out the directions in our ongoing work to improve the quality and scale of travel time estimation.

Visweswara Sathanur, Arun↗

A Software Defined Network Design for Analyzing Streaming Data in Transit

Year after year, network traffic keeps reaching newhighs as unprecedented volumes of data flow between an ever-increasing number of sources and destinations. As part of the Analysis on the Wire project, we aim to develop a network-centric approach for streaming data processing to facilitate scientific data analysis and reduce the overhead in sending big data to a data center. This work discusses our design for programmable network devices to augment network capabilities for streaming data processing, including efforts in progress at Brookhaven National Laboratory and the challenges faced to date.

97 MATHEMATICS AND COMPUTING↗

Data communication network at the ASRM facility

This three-year project (February 1991 to February 1994) has involved analyzing and helping to design the communication network for the Advanced Solid Rocket Motor (ASRM) facility at Yellow Creek, near Iuka, MS. The principal concerns in the analysis were the bandwidth (both on average and in the worst case) and the expandability of the network. As the communication network was designed and modified, a careful evaluation of the bandwidth of the network, the capabilities of the protocol, and the requirements of the controllers and computers on the network was required. The overall network, which was heterogeneous in protocol and bandwidth, needed to be modeled, analyzed, and simulated to obtain some degree of confidence in its performance capabilities and in its performance under nominal and heavy loads. The results of our analysis did have an impact on the design and operation of the ASRM facility. During 1993 we analyzed many configurations of this basic network structure. The analyses are described in detail in Section 2 and 3 herein. Section 2 reports on an analysis of the whole network. The preliminary results of that research indicated that the most likely bottleneck as the network traffic increased would be the hubs. Thus a study of Cabletron hubs was initiated. The results of that study are in Section 3. Section 4 herein reports on the final network configuration analyzed. When the ASRM facility was mothballed in December of 1993, this was basically the planned and partially installed network. A briefing was held at NASA/MSFC on December 7, 1993, at which time our final analysis and conclusions were disseminated. This report contains a written record of most of the information disseminated at that briefing.

Moorhead, Robert J., III↗

Pattern Discovery in Internet Background Radiation

Internet Background Radiation (IBR) is observed in empty network address spaces. No traffic should arrive there, but it does in overwhelming quantities, gathering evidences of attacks, malwares and misconfigurations. The study of IBR helps to detect spreading network problems, common vulnerabilities and attack trends. However, network traffic data evolves quickly and is of high volume and diversity, i.e., an outstanding big data challenge. When used to assist network security, it also requires the online classification of dynamic streaming data. In this paper, we introduce an AGgregation & Mode (AGM) vector to represent network traffic. The AGM format characterizes IP hosts by extracting aggregated and mode values of IP header fields, and without inspecting payloads. We performed clustering and statistical analysis to explore six months of IBR from 2012 with the AGM mapping. The discovered patterns allow building a classification of IBR, which identifies phenomena that have been actively polluting the Internet for years. The AGM representation is light and tailored for monitoring and pattern discovery. We show that AGM vectors are suitable to analyze large volumes of network traffic: they capture permanent operations, such as long term scanning, as well as bursty events from targeted attacks and short term incidents.

Iglesias, Felix↗

City-Wide Eco-Routing Navigation Considering Vehicular Communication Impacts

Intelligent Transportation Systems (ITSs) utilize Vehicular Ad-hoc Networks (VANETs) to collect, disseminate, and share data with the Traffic Management Center (TMC) and different actuators. Consequently, packet drop and delay in VANETs can significantly impact ITS performance. Feedback-based eco-routing (FB-ECO) is a promising ITS technology, which is expected to reduce vehicle fuel/energy consumption and pollutant emissions by routing drivers through the most environmentally friendly routes. To compute these routes, the FB-ECO utilizes VANET communication to update link costs in real-time, based on the experiences of other vehicles in the system. In this paper, we study the impact of vehicular communication on FB-ECO navigation performance in a large-scale real network with realistic calibrated traffic demand data. We conduct this study at different market penetration rates and different congestion levels. We start by conducting a sensitivity analysis of the market penetration rate on the FB-ECO system performance, and its network-wide impacts considering ideal communication. Subsequently, we study the impact of the communication network on system performance for different market penetration levels, considering the communication system. The results demonstrate that, for market penetration levels less than 30%, the eco-routing system performs adequately in both the ideal and realistic communication scenarios. It also shows that, for realistic communication, increasing the market penetration rate results in a network-wide degradation of the system performance.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

ThunderSecure: deploying real-time intrusion detection for 100G research networks by leveraging stream-based features and one-class classification network

Nowadays, data generated by large-scale scientific experiments are on the scale of petabytes per month. These data are transferred through dedicated high-bandwidth networks (40/100G) across distributed sites for processing, storage, and analysis. Like general purpose networks, research networks experience intrusions. However, monitoring anomalies in such high-speed network traffics is challenging given current cyber-infrastructure. Moreover, traditional network intrusion detection systems (NIDS) are signature based. However, anomaly patterns are difficult to define and that rulesets are often not updated frequently enough to reflect the changes of attack behaviors. We present ThunderSecure, a high-throughput, unsupervised learning-based intrusions detection system for 100G research networks. ThunderSecure implements an efficient packet processing and detection pipeline using multi-cores and GPUs. It extracts statistical and temporal features from real-time network data streams and feeds them to a one-class anomaly detection network. A baseline of normal distribution will be created based on the training observation. Testing traffic deviated from the learned profile will be marked as anomalies. We trained ThunderSecure on hundreds of billions of science data packets mirrored from two 100G network connections at Fermi National Accelerator Laboratory. The detection performance was evaluated on traffic captured from the same research network days and weeks after the training with different types of attack flows injected. Results show that ThunderSecure can recognize science data traffic captured long after the training and made nearly certain detection on the segment of the streams where anomalous flows were injected.

100G research network↗

Moving Large Data Sets Over High-Performance Long Distance Networks

In this project we look at the performance characteristics of three tools used to move large data sets over dedicated long distance networking infrastructure. Although performance studies of wide area networks have been a frequent topic of interest, performance analyses have tended to focus on network latency characteristics and peak throughput using network traffic generators. In this study we instead perform an end-to-end long distance networking analysis that includes reading large data sets from a source file system and committing large data sets to a destination file system. An evaluation of end-to-end data movement is also an evaluation of the system configurations employed and the tools used to move the data. For this paper, we have built several storage platforms and connected them with a high performance long distance network configuration. We use these systems to analyze the capabilities of three data movement tools: BBcp, GridFTP, and XDD. Our studies demonstrate that existing data movement tools do not provide efficient performance levels or exercise the storage devices in their highest performance modes. We describe the device information required to achieve high levels of I/O performance and discuss how this data is applicable in use cases beyond data movement performance.

99 GENERAL AND MISCELLANEOUS↗

A Technique for Moving Large Data Sets over High-Performance Long Distance Networks

In this paper we look at the performance characteristics of three tools used to move large data sets over dedicated long distance networking infrastructure. Although performance studies of wide area networks have been a frequent topic of interest, performance analyses have tended to focus on network latency characteristics and peak throughput using network traffic generators. In this study we instead perform an end-to-end long distance networking analysis that includes reading large data sets from a source file system and committing the data to a remote destination file system. An evaluation of end-to-end data movement is also an evaluation of the system configurations employed and the tools used to move the data. For this paper, we have built several storage platforms and connected them with a high performance long distance network configuration. We use these systems to analyze the capabilities of three data movement tools: BBcp, GridFTP, and XDD. Our studies demonstrate that existing data movement tools do not provide efficient performance levels or exercise the storage devices in their highest performance modes.

99 GENERAL AND MISCELLANEOUS↗

Advanced Solid Rocket Motor (ASRM) communications network analysis

This paper describes the simulation of a proposed campus-wide network for a new manufacturing facility. The proposed network consists of five carrier sense multiple access with collision detection (CSMA/CD) networks connected to five ports of a VAX cluster. In Section 1 the system configuration, the projected traffic pattern, and the proposed protocols are presented. Section 2 describes the models used in constructing the network simulation, while Section 3 contains the results and an analysis of the simulations. The simulations are compared to a mathematical model in Section 4. Some conclusions are drawn in Section 5.

Thompson, Dale R.↗

Compact Graph Representations and Parallel Connectivity Algorithms for Massive Dynamic Network Analysis

Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socioeconomic interactions, social networking web sites, communication traffic, and scientific computing can be intuitively modeled as graphs. We present the first study of novel high-performance combinatorial techniques for analyzing large-scale information networks, encapsulating dynamic interaction data in the order of billions of entities. We present new data structures to represent dynamic interaction networks, and discuss algorithms for processing parallel insertions and deletions of edges in small-world networks. With these new approaches, we achieve an average performance rate of 25 million structural updates per second and a parallel speedup of nearly28 on a 64-way Sun UltraSPARC T2 multicore processor, for insertions and deletions to a small-world network of 33.5 million vertices and 268 million edges. We also design parallel implementations of fundamental dynamic graph kernels related to connectivity and centrality queries. Our implementations are freely distributed as part of the open-source SNAP (Small-world Network Analysis and Partitioning) complex network analysis framework.

97 MATHEMATICS AND COMPUTING↗

Communications network design and costing model technical manual

This computer model provides the capability for analyzing long-haul trunking networks comprising a set of user-defined cities, traffic conditions, and tariff rates. Networks may consist of all terrestrial connectivity, all satellite connectivity, or a combination of terrestrial and satellite connectivity. Network solutions provide the least-cost routes between all cities, the least-cost network routing configuration, and terrestrial and satellite service cost totals. The CNDC model allows analyses involving three specific FCC-approved tariffs, which are uniquely structured and representative of most existing service connectivity and pricing philosophies. User-defined tariffs that can be variations of these three tariffs are accepted as input to the model and allow considerable flexibility in network problem specification. The resulting model extends the domain of network analysis from traditional fixed link cost (distance-sensitive) problems to more complex problems involving combinations of distance and traffic-sensitive tariffs.

Logan, K. P.↗

Companion Assisted Software Based Remote Attestation in SCADA Networks

Critical infrastructure such as power generation and water distribution systems have become a priority target in cyber warfare because of their recent computerization and introduction to the internet. As a result, Supervisory Control and Data Acquisition (SCADA) system security has become a hot topic in academic and industrial research. Among these topics, Remote Attestation is a security method intended to detect the presence of fileless malware in remote devices as they continue to operate. This allows for the detection of malware in the absence of long-term storage artifacts before symptoms of compromise begin to appear. In general, a trusted device (the verifier) makes a request for evidence of innocence from the untrusted device (the prover). In software-based schemes, the verifier can then measure the delay between its request and the prover’s response. If this delay is greater than the known computational time of the evidence gathering algorithm performed by the prover, then evidence may have been forged. Multi-hop networks often introduce too much network jitter to allow accurate measurement of prover response time, which limits the effectiveness of software based Remote Attestation in a real-world setting. In this work, we introduce a companion device that the verifier can trust to perform a subset of attestation, thereby removing any network jitter. This device is a Field Programmable Gate Array (FPGA) that is physically connected to the prover. We provide a communication protocol between the verifier, prover, and companion. To evaluate our scheme, we simulate it in a common SCADA network environment under normal and heavy traffic loads. Our simulations are performed in the discrete event network simulator NS-3, and we perform statistical analysis over our results to show that our scheme allows for tight timing constraints to be placed on the prover such that the verifier can more easily determine the validity of the evidence that it receives.

Johnson, William A.↗

Behavior-dependent Routing: Responding to Anomalies with Automated Low-cost Measures

This is a conference paper submission describing research and software implementation of a cybersecurity concept that uses behavior models to trigger changes in routing of network traffic. As user behavior deviates more and more from baseline models, traffic is routed through more elevated layers of analysis and control.

information flow controls↗