scholarly journals Bayesian dynamic modeling and monitoring of network flows

2019 ◽  
Vol 7 (3) ◽  
pp. 292-318 ◽  
Author(s):  
Xi Chen ◽  
David Banks ◽  
Mike West

AbstractIn the context of a motivating study of dynamic network flow data on a large-scale e-commerce website, we develop Bayesian models for online/sequential analysis for monitoring and adapting to changes reflected in node–node traffic. For large-scale networks, we customize core Bayesian time series analysis methods using dynamic generalized linear models (DGLMs). These are integrated into the context of multivariate networks using the concept of decouple/recouple that was recently introduced in multivariate time series. This method enables flexible dynamic modeling of flows on large-scale networks and exploitation of partial parallelization of analysis while maintaining coherence with an over-arching multivariate dynamic flow model. This approach is anchored in a case study on Internet data, with flows of visitors to a commercial news website defining a long time series of node–node counts on over 56,000 node pairs. Central questions include characterizing inherent stochasticity in traffic patterns, understanding node–node interactions, adapting to dynamic changes in flows and allowing for sensitive monitoring to flag anomalies. The methodology of dynamic network DGLMs applies to many dynamic network flow studies.

The theory of flows is one of the most important parts of Combinatorial Optimization and it has various applications. In this paper we study optimum (maximum or minimum) flows in directed bipartite dynamic network and is an extension of article [9]. In practical situations, it is easy to see many time-varying optimum problems. In these instances, to account properly for the evolution of the underlying system overtime, we need to use dynamic network flow models. When the time is considered as a variable discrete values, these problems can be solved by constructing an equivalent, static time expanded network. This is a static approach.


2014 ◽  
Vol 13 (2s) ◽  
pp. 1-21 ◽  
Author(s):  
Xiaohang Wang ◽  
Mei Yang ◽  
Yingtao Jiang ◽  
Peng Liu ◽  
Masoud Daneshtalab ◽  
...  

Electronics ◽  
2020 ◽  
Vol 9 (10) ◽  
pp. 1747
Author(s):  
Hansaka Angel Dias Edirisinghe Kodituwakku ◽  
Alex Keller ◽  
Jens Gregor

The complexity and throughput of computer networks are rapidly increasing as a result of the proliferation of interconnected devices, data-driven applications, and remote working. Providing situational awareness for computer networks requires monitoring and analysis of network data to understand normal activity and identify abnormal activity. A scalable platform to process and visualize data in real time for large-scale networks enables security analysts and researchers to not only monitor and study network flow data but also experiment and develop novel analytics. In this paper, we introduce InSight2, an open-source platform for manipulating both streaming and archived network flow data in real time that aims to address the issues of existing solutions such as scalability, extendability, and flexibility. Case-studies are provided that demonstrate applications in monitoring network activity, identifying network attacks and compromised hosts and anomaly detection.


2018 ◽  
Vol 113 (522) ◽  
pp. 519-533 ◽  
Author(s):  
Xi Chen ◽  
Kaoru Irie ◽  
David Banks ◽  
Robert Haslinger ◽  
Jewell Thomas ◽  
...  

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Abdelouahid Derhab ◽  
Mohamed Guerroumi ◽  
Mohamed Belaoued ◽  
Omar Cheikhrouhou

Multicontroller software-defined networks have been widely adopted to enable management of large-scale networks. However, they are vulnerable to several attacks including false data injection, which creates topology inconsistency among controllers. To deal with this issue, we propose BMC-SDN, a security architecture that integrates blockchain and multicontroller SDN and divides the network into several domains. Each SDN domain is managed by one master controller that communicates through blockchain with the masters of the other domains. The master controller creates blocks of network flow updates, and its redundant controllers validate the new block based on a proposed reputation mechanism. The reputation mechanism rates the controllers, i.e., block creator and voters, after each voting operation using constant and combined adaptive fading reputation strategies. The evaluation results demonstrate a fast and optimal detection of fraudulent flow rule injection.


1974 ◽  
Vol 11 (01) ◽  
pp. 94-101 ◽  
Author(s):  
Masao Nakamura

This paper is concerned with a class of dynamic network flow problems in which the amount of flow leaving node i in one time period for node j is the fraction pij of the total amount of flow which arrived at node i during the previous time period. The fraction pij whose sum over j equals unity may be interpreted as the transition probability of a finite Markov chain in that the unit flow in state i will move to state j with probability pij during the next period of time. The conservation equations for this class of flows are derived, and the limiting behavior of the flows in the network as related to the properties of the fractions Pij are discussed.


Sign in / Sign up

Export Citation Format

Share Document