Decentralized optimal routing for packets flow on data networks

Abstract

This paper concerns optimization of data traffic flows on a telecommunication network, modelled using a fluid - dynamic approach. Flows can be controlled adjusting traffic distribution and priority parameters. Two cost functionals are considered, which measure average velocity and average travelling time of packets. \ud First we address general optimal control problems, showing that existence of solutions is related to properties of packet loss probability functions. \ud A direct solution of the general optimal control problem corresponds to a centralized policy and is hard to achieve, thus we focus on a decentralized policy and provide solutions for a single node with two entering and two exiting lines and asymptotic costs. Such solutions permit to simulate the behaviour of decentralized algorithms for complex networks. Local optimization ensures very good results also for large networks. The latter is shown by case study of a test telecommunication network

Analysis of Structure-Preserving Discrete Models for Predator-Prey Systems with Anomalous Diffusion

“…Additionally, define the matrices B m,i , C k m , F m,i , and G k m as in Section 3.1, but using now the constants (44)- (49). Next, define the matrices A k u and A k v through the expressions of A k u and A k v in (39), using the new constants (44)- (49). On the other hand, we will agree that I is the identity matrix of dimension (N + 1) × (N + 1), and set H k…”

“…The present section will be devoted to providing some computer simulations to illustrate the applicability of the finite difference schemes proposed in this work. In the first stage, we must point out that the explicit scheme (20) is obviously more suitable than the implicit model (42) when investigating two-and three-dimensional regimes [48,49]. To implement it efficiently, we notice firstly that the first equation of (20) can be rewritten as:…”

“…k m,n ) ≥ 0, for each m ∈Ī M and n ∈Ī N , then the matrices A k u and A k v in (39) with the constants (44)-(49) are Minkowski matrices.Proof. Clearly, the nonzero off-diagonal elements of A k u are equal to b m,i (for some m ∈Ī M and i = m) or c n,i (for some n ∈Ī N and i = n).…”

SD-IoV: SDN enabled routing for internet of vehicles in road-aware approach

“…In IoV, routing protocols plays a key role in the finding of best available paths in highly unstable vehicular environment (Cascone et al 2010;Cutolo et al 2012;Manzo et al 2012). A suitable protocol for data transmission in wireless networks can have a good data quality with less or no delay.…”

On the Optimization of Conservation Law Models at a Junction with Inflow and Flow Distribution Controls

“…Optimization and control issues for network models based on conservation laws have raised an increasing interest in the last decade, motivated by a wide range of applications in various research fields. In fact, beside vehicular traffic (see [12,17,28,37,46,47,56,57,72] and references therein), such kind of problems have been addressed in: air traffic [13,68], supply chains [35,36,49,59], irrigation channels [48], gas pipelines [29], telecommunication and data [23], bio-medical [15,26], blood circulation [20], socio-economical and other areas. In these contexts, a crucial role is played by the design, analysis and numerical implementation of controls acting at the nodes of the network.…”