Related papers: OSPF Weight Setting Optimization for Single Link F…
This paper studies online shortest path routing over multi-hop networks. Link costs or delays are time-varying and modeled by independent and identically distributed random processes, whose parameters are initially unknown. The parameters,…
Standard congestion control cannot detect link failure losses which occur due to mobility and power scarcity in multi-hop Ad-Hoc network (MANET). Moreover, successive executions of Back-off algorithm deficiently grow Retransmission Timeout…
Fat-tree networks have been widely adopted to High Performance Computing (HPC) clusters and to Data Center Networks (DCN). These parallel systems usually have a large number of servers and hosts, which generate large volumes of…
We consider the traffic assignment problem in nonatomic routing games where the players' cost functions may be subject to random fluctuations (e.g., weather disturbances, perturbations in the underlying network, etc.). We tackle this…
We aim at assessing the states of the nodes in a network by means of end-to-end monitoring paths. The contribution of this paper is twofold. First, we consider a static failure scenario. In this context, we aim at minimizing the number of…
We consider the minimum spanning tree problem with predictions, using the weight-arrival model, i.e., the graph is given, together with predictions for the weights of all edges. Then the actual weights arrive one at a time and an…
In recent years, several applications have been proposed in the context of distribution networks. Many of these can be formulated as an optimal power flow problem, a mathematical optimization program which includes a model of the…
Numerous problems of both theoretical and practical interest are related to finding shortest (or otherwise optimal) paths in networks, frequently in the presence of some obstacles or constraints. A somewhat related class of problems focuses…
The Optimal Power Flow (OPF) problem is integral to the functioning of power systems, aiming to optimize generation dispatch while adhering to technical and operational constraints. These constraints are far from straightforward; they…
Various social, financial, biological and technological systems can be modeled by interdependent networks. It has been assumed that in order to remain functional, nodes in one network must receive the support from nodes belonging to…
We consider the link prediction problem in a partially observed network, where the objective is to make predictions in the unobserved portion of the network. Many existing methods reduce link prediction to binary classification problem.…
When a network is inferred from data, two types of errors can occur: false positive and false negative conclusions about the presence of links. We focus on the influence of local network characteristics on the probability $\alpha$ - of type…
This paper focuses on designing edge-weighted networks, whose robustness is characterized by maximizing algebraic connectivity, or the second smallest eigenvalue of the Laplacian matrix. This problem is motivated by cooperative vehicle…
With the prevalence of cloud computing and contents delivery networking, OpenFlow-based centrally-managed networks with flexible and dynamic traffic engineering are demanded. To maintain a high quality of service of the network, detecting…
The enormous increase in the usage of communication networks has made protection against node and link failures essential in the deployment of reliable networks. To prevent loss of data due to node failures, a network protection strategy is…
Motivated by cloud computing applications, we study the problem of how to optimally deploy new hardware subject to both power and robustness constraints. To model the situation observed in large-scale data centers, we introduce the Online…
We propose a dynamical model for cascading failures in single-commodity network flows. In the proposed model, the network state consists of flows and activation status of the links. Network dynamics is determined by a, possibly…
OPF problems are formulated and solved for power system operations, especially for determining generation dispatch points in real-time. For large and complex power system networks with large numbers of variables and constraints, finding the…
Link adaptation is the terminology used to describe techniques that improve multicarrier communication systems performance by dynamically adapting the transmission parameters, i.e., transmit power and number of bits per subcarrier, to the…
In this paper, we analyze the performance of random load resampling and migration strategies in parallel server systems. Clients initially attach to an arbitrary server, but may switch server independently at random instants of time in an…