Search NASASearch

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

Distributed optimization for multi-commodity urban traffic control

A distributed method for concurrent traffic signal and routing control of traffic networks is proposed. The method is based on the multi-commodity store-and-forward model, in which the destinations are the commodities. The system benefits from the communication between vehicles and infrastructure, providing optimal signal timings to intersections and routes to vehicles on a link-by-link basis. Using the augmented Lagrangian to model the constraints into the objective, the baseline centralized problem is decomposed into a set of objective-coupled subproblems, one for each intersection, enabling the solution to be computed by a distributed- gradient projection algorithm. Further, the intersection agents only need to communicate and coordinate with neighboring intersections to ensure convergence to the optimal solution while tolerating suboptimal iterations that offer more flexibility, unlike other distributed approaches. Through microsimulation, we demonstrate the effectiveness of the proposed algorithm in traffic networks with time-varying demand. Computational analysis shows that the distributed problem is suitable for real-time applications. A robustness analysis show that the distributed formulation enables a graceful degradation of the system in case of failure.

Augmented Lagrangian

Distributed Spacecraft Mission (DSM) Plume Design Reference Mission (DRM) Inter-Satellite Link Modeling, Analysis and Simulation

NASA Goddard Space Flight Center (GSFC) Radical Innovation Initiative (RI2) plans to focus intently on DSM capability advancements in FY22-24. A DSM mission involves multiple spacecraft, arranged in a constellation, to achieve one or more common goals via the use of inter-satellite links (ISL) between the satellites. Recently, the GSFC Internal Research & Development (IRAD) program established Enceladus as a design reference mission (DRM) for the current DSM effort to foster the conceptual development of communication architecture, requirements, and solutions for future DSM ISL, as well as being able to push other research areas of interest. Enceladus is an icy moon of the planet Saturn. The DRM Enceladus mission concept involves a constellation of 24 small satellites, orbiting Enceladus around 100 km altitude in 3 planes, as observing nodes for science measurement. The mission science data will be sent back to Earth through a relay orbiting Saturn, using the constellation’s inter-satellite links. A QualNet/STK simulation model of the Relay and constellation ISL optical and RF links is developed for the design and optimization of the link and orbital parameters, as well as the inter-networking protocols. Delay Tolerant Networking (DTN) is utilized in the application layer modeling. This paper describes the plume DRM mission concept of an Enceladus constellation to relay science data to Earth and includes the proposed communication architecture and operation concepts. We present details of the QualNet/STK engineering model for this communication scenario to simulate the end-to-end data traffic through multiple layers (physical, data link, networking, transport and application). A link analysis for the constellation’s ISL, constellation to Relay and Direct to Earth (DTE) optical link is provided and discussed. The results of end-to-end traffic simulation for the data throughout/latency evaluation and assessment of the communication architecture are presented. The investigation of the concept of optical multiple access (OMA) for the Plume DRM is discussed. The modeling and simulation methodology developed in this paper is applicable to other DSMs in near Earth and deep space such as Earth-Moon L1/L2 and Lunar regions.

Distributed Spacecraft Mission (DSM) Inter-satelli

Reducing Communication Overhead in Federated Learning for Network Anomaly Detection with Adaptive Client Selection

Communication overhead in federated learning (FL) poses a significant challenge for network anomaly detection systems, where the myriad of client configurations and network conditions can severely impact system efficiency and detection accuracy. While existing approaches attempt to address this through individual optimization techniques, they often fail to maintain the delicate balance between reduced overhead and detection performance. This paper presents an adaptive FL framework that dynamically combines batch size optimization, client selection, and asynchronous updates to achieve efficient anomaly detection. Through extensive profiling and experimental analysis on two distinct datasets-UNSW-NBIS for general network traffic and ROAD for automotive networks-our framework reduces communication overhead by 97.6%; (from 700.0s to 16.8s) compared to synchronous baseline approaches while maintaining comparable detection accuracy (95.10%; vs. 95.12%;). Statistical validation using Mann-Whitney U test confirms significant improvements (p < 0.05) over existing FL approaches across both datasets, demonstrating the framework's adaptability to different network security contexts. Detailed profiling analysis reveals the efficiency gains through dramatic reductions in GPU operations and memory transfers while maintaining robust detection performance under varying client conditions.

Marfo, William [University of Texas at El Paso]

Analysis of a Dynamic Multi-Track Airway Concept for Air Traffic Management

The Dynamic Multi-track Airways (DMA) Concept for Air Traffic Management (ATM) proposes a network of high-altitude airways constructed of multiple, closely spaced, parallel tracks designed to increase en-route capacity in high-demand airspace corridors. Segregated from non-airway operations, these multi-track airways establish high-priority traffic flow corridors along optimal routes between major terminal areas throughout the National Airspace System (NAS). Air traffic controllers transition aircraft equipped for DMA operations to DMA entry points, the aircraft use autonomous control of airspeed to fly the continuous-airspace airway and achieve an economic benefit, and controllers then transition the aircraft from the DMA exit to the terminal area. Aircraft authority within the DMA includes responsibility for spacing and/or separation from other DMA aircraft. The DMA controller is responsible for coordinating the entry and exit of traffic to and from the DMA and for traffic flow management (TFM), including adjusting DMA routing on a daily basis to account for predicted weather and wind patterns and re-routing DMAs in real time to accommodate unpredicted weather changes. However, the DMA controller is not responsible for monitoring the DMA for traffic separation. This report defines the mature state concept, explores its feasibility and performance, and identifies potential benefits. The report also discusses (a) an analysis of a single DMA, which was modeled within the NAS to assess capacity and determine the impact of a single DMA on regional sector loads and conflict potential; (b) a demand analysis, which was conducted to determine likely city-pair candidates for a nationwide DMA network and to determine the expected demand fraction; (c) two track configurations, which were modeled and analyzed for their operational characteristic; (d) software-prototype airborne capabilities developed for DMA operations research; (e) a feasibility analysis of key attributes in the concept design; (f) a near-term, transitional application of the DMA concept as a proving ground for new airborne technologies; and (g) conclusions. The analysis indicates that the operational feasibility of a national DMA network faces significant challenges, especially for interactions between DMAs and between DMA and non-DMA traffic. Provided these issues are resolved, sectors near DMAs could experience significant local capacity benefits.

Wing, David J.

Delay Tolerant Network Routing as a Machine Learning Classification Problem

This paper discusses a machine learning-based approach to routing for delay tolerant networks (DTNs) [1]. DTNs are networks which experience frequent disconnections between nodes, uncertainty of an end-to-end path, long one-way trip times, and may have high error rates and asymmetric links. Such networks exist in deep space satellite networks, very rural environments, disaster areas and underwater environments. In this work, we use machine learning classifiers to predict a set of neighboring nodes which are the most likely to deliver a message to a desired location based on message history delivery information.We use the Common Open Research Emulator (CORE) [2] to emulate the DTN environment based on real-world location traces and collect network traffic statistics from the Bundle Protocol implementation IBR-DTN [3]. The software architecture for classification-based routing, analysis and preparation of the network history data and prediction results are discussed.

Delay Tolerant Networks

National Airspace System Delay Estimation Using Weather Weighted Traffic Counts

Assessment of National Airspace System performance, which is usually measured in terms of delays resulting from the application of traffic flow management initiatives in response to weather conditions, volume, equipment outages and runway conditions, is needed both for guiding flow control decisions during the day of operations and for post operations analysis. Comparison of the actual delay, resulting from the traffic flow management initiatives, with the expected delay, based on traffic demand and other conditions, provides the assessment of the National Airspace System performance. This paper provides a method for estimating delay using the expected traffic demand and weather. In order to identify the cause of delays, 517 days of National Airspace System delay data reported by the Federal Aviation Administration s Operations Network were analyzed. This analysis shows that weather is the most important causal factor for delays followed by equipment and runway delays. Guided by these results, the concept of weather weighted traffic counts as a measure of system delay is described. Examples are given to show the variation of these counts as a function of time of the day. The various datasets, consisting of aircraft position data, enroute severe weather data, surface wind speed and visibility data, reported delay data and number of aircraft handled by the Centers data, and their sources are described. The procedure for selecting reference days on which traffic was minimally impacted by weather is described. Different traffic demand on each reference day of the week, determined by analysis of 42 days of traffic and delay data, was used as the expected traffic demand for each day of the week. Next, the method for computing the weather weighted traffic counts using the expected traffic demand, derived from reference days, and the expanded regions around severe weather cells is discussed. It is shown via a numerical example that this approach improves the dynamic range of the weather weighted traffic counts considerably. Time histories of these new weather weighted traffic counts are used for synthesizing two statistical features, six histogram features and six time domain features. In addition to these enroute weather features, two surface weather features of number of major airports in the United States with high mean winds and low mean visibility are also described. A least squares procedure for establishing a functional relation between the features, using combinations of these features, and system delays is explored using 36 days of data. Best correlations between the estimated delays using the functional relation and the actual delays provided by the Operations Network are obtained with two different combinations of features: 1) six time domain features of weather weighted traffic counts plus two surface weather features, and 2) six histogram features and mean of weather weighted traffic counts along with the two surface weather features. Correlation coefficient values of 0.73 and 0.83 were found in these two instances.

Chatterji, Gano B.

Defining Dynamic Route Structure

This poster describes a method for defining route structure from flight tracks. Dynamically generated route structures could be useful in guiding dynamic airspace configuration and helping controllers retain situational awareness under dynamically changing traffic conditions. Individual merge and diverge intersections between pairs of flights are identified, clustered, and grouped into nodes of a route structure network. Links are placed between nodes to represent major traffic flows. A parametric analysis determined the algorithm input parameters producing route structures of current day flight plans that are closest to todays airway structure. These parameters are then used to define and analyze the dynamic route structure over the course of a day for current day flight paths. Route structures are also compared between current day flight paths and more user preferred paths such as great circle and weather avoidance routing.

Zelinski, Shannon

Macroscopic Traffic Modeling Using Probe Vehicle Data: A Machine Learning Approach

Abstract The macroscopic fundamental diagram (MFD) captures an orderly relationship among traffic flow, density, and speed at the network level. It is a simple yet powerful tool for modeling traffic dynamics in large urban networks with broad application in traffic control and management. However, empirically derived MFDs in urban regions require high-resolution traffic data from the network. Having the network flow and vehicular density estimated at the (granular) census tract level using vehicle probe data, we apply machine learning methods to predict the MFDs across U.S. urban areas and capture the impacts of location-specific input features on the network flow–density relationships at a large scale. The results show that, among the four tested machine learning approaches (Random Forest, XGBoost, Support Vector Machine, and Neural Network), XGBoost delivers the best performance in predicting network traffic flow based on vehicular density and location attributes. Using interaction Shapley Additive explanation (SHAP) values and partial correlation analysis, we examine the factors influencing MFD shapes across different locations. Our empirical findings reveal that across U.S. urban areas, network topology, transportation infrastructure, and land use are primary factors shaping MFD curves, while demand and trip-related factors play a lesser role. Specifically, higher ranking roads, centrality, and development levels correlate positively with network capacity and critical density, whereas negative associations are observed for network connectivity, mixed-use development, and road roughness levels.

Jin, Ling

Satellite B-ISDN traffic analysis

The impact of asynchronous transfer mode (ATM) traffic on the advanced satellite broadband integrated services digital network (B-ISDN) with onboard processing is reported. Simulation models were built to analyze the cell transfer performance through the statistical multiplexer at the earth station and the fast packet switch at the satellite. The effectiveness of ground ATM cell preprocessing was established, as well as the performance of several schemes for improving the down-link beam utilization when the space segment employs a fast packet switch.

Shyy, Dong-Jye

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

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

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.

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.