This paper proposes a macroscopic fluid dynamic model dealing with the flows of information on a telecommunication network with sources and destinations. The model consists of a conservation law for the packets density and a semilinear equation for traffic distributions functions, i.e. functions describing packets paths. We describe methods to solve Riemann Problems at junctions assigning diffe...

A strongly polynomial algorithm is developed for finding an integer-valued feasible st-flow of a given flow amount, which decreasingly minimal on specified subset F edges in the sense that largest value as small possible; within this, second third possible, and so on. characterization set these st-flows gives rise to compute cheapest F-decreasingly amount. Decreasing minimality possible formal ...

Micro CHP, installed in individual homes, will in time remove a substantial electricity demand on a dynamic basis at the low voltage level, and may, in some instances, neutralise or even reverse the power flows in distribution transformers. This will clearly have economic consequences for the Distribution Network Operator (DNO) in terms of lost revenue, but will also have profound consequences ...

This paper presents two problems concerning dynamic flow in node and arc capacitated networks: (1) maximal dynamic flow; (2) feasible dynamic flows. 1 Maximal dynamic flows in arc capacitated networks Let G = (N, A) be a connected digraph with N = {s, . . . , x, . . . , s′}, |N | = n the node set and A = {(x, y)/x, y ∈ N}, |A| = m ≤ n(n − 1) the arc set. Let N be the natural number set and P{0,...

Real-time traffic flow data across entire networks can be used in a traffic management system to monitor current traffic flows so that traffic can be directed and managed efficiently. Reliable short-term forecasting models of traffic flows are crucial for the success of any traffic management system. The model proposed in this paper for forecasting traffic flows is a multivariate Bayesian dynam...

We study dynamic network flows with uncertain input data under a robust optimization perspective. In the dynamic maximum flow problem, the goal is to maximize the flow reaching the sink within a given time horizon T , while flow requires a certain travel time to traverse an edge. In our setting, we account for uncertain travel times of flow. We investigate maximum flows over time under the assu...

To adapt to continuously changing workloads in networks, components of the running network services may need to be replicated (scaling the network service) and allocated to physical resources (placement) dynamically, also necessitating dynamic re-routing of flows between service components. In this paper, we propose JASPER, a fully automated approach to jointly optimizing scaling, placement, an...

Network flows are the basic components of Internet. Considering serious consequences abnormal flows, it is crucial to provide timely anomaly detection in dynamic communication networks. To obtain accurate results networks, supervision from experts highly demanded. However, high-quality ground truth we suffer two major problems: (1) <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xl...

Occurrences of traffic congestions within the urban traffic network are increasing in a rapid rate due to the rising traffic demands of the outnumbered vehicles on road. The effectiveness of management from traffic signal timing planner is the key solution to solve the traffic congestions, but unfortunately the current traffic light signal system is not fully optimized based on the dynamic traf...

As traditional topic detection under the online social network is lack of mining the topic semantic features and dynamic evolution characteristics, this paper studies the semantic features and dynamic evolution trend based on topic temporal chain under the online social network. According to the temporal relations, text flows are divided into the text set in continuous time slice, then combinat...