Network topology

About: Network topology is a research topic. Over the lifetime, 52259 publications have been published within this topic receiving 1006627 citations.

Multiple instance spanning tree protocol

Abstract: A multiple instance spanning tree protocol (MI-STP) creates a plurality of active topologies (i.e., loop-free paths) within a computer network. These active topologies may be established through the exchange and processing of multiple instance spanning tree bridge protocol data unit messages (MI-STP BPDUs) by the intermediate network devices within the network. The active topologies are preferably created independently of any virtual local area network (VLAN) designations defined within the network. Once the active topologies are defined, each VLAN designation is then mapped to a single active topology, although multiple VLAN designations are preferably mapped to the same active topology to provide load balancing.

Optimal Coordination of Directional Overcurrent Relays Considering Different Network Topologies Using Interval Linear Programming

Abstract: In real power systems, the network topology is subjected to uncertainty due to single-line outage contingencies, maintenance activities, and network reconfigurations. These changes in the network topology may lead to miscoordination of directional overcurrent relays (DOCRs). To overcome this drawback, corresponding to each primary/backup relay pair, a set of inequality coordination constraints which is related to different network topologies should be satisfied. In this paper, a new approach based on the interval analysis is introduced to solve the DOCRs coordination problem considering uncertainty in the network topology. The basic idea is to convert the set of inequality constraints corresponding to each relay pair to an interval constraint. In this situation, the DOCR coordination problem is formulated as an interval linear programming (ILP) problem. Using well-known mathematical theorems, the obtained ILP problem, which has no equality constraints, can be converted to standard linear programming (LP). As a result, the number of coordination constraints is significantly reduced in the proposed methods. The application of the proposed method to the IEEE 14- and 30-bus test systems proves the ability of the interval method in modeling topology uncertainty in the large-scale coordination problem.

Data Transmission Over Networks for Estimation and Control

Abstract: We consider the problem of controlling a linear time invariant process when the controller is located at a location remote from where the sensor measurements are being generated. The communication from the sensor to the controller is supported by a communication network with arbitrary topology composed of analog erasure channels. Using a separation principle, we prove that the optimal linear-quadratic-Gaussian (LQG) controller consists of an LQ optimal regulator along with an estimator that estimates the state of the process across the communication network. We then determine the optimal information processing strategy that should be followed by each node in the network so that the estimator is able to compute the best possible estimate in the minimum mean squared error sense. The algorithm is optimal for any packet-dropping process and at every time step, even though it is recursive and hence requires a constant amount of memory, processing and transmission at every node in the network per time step. For the case when the packet drop processes are memoryless and independent across links, we analyze the stability properties and the performance of the closed loop system. The algorithm is an attempt to escape the viewpoint of treating a network of communication links as a single end-to-end link with the probability of successful transmission determined by some measure of the reliability of the network.

A Stable Network-Aware VM Placement for Cloud Systems

Abstract: Virtual Machine (VM) placement has to carefully consider the aggregated resource consumption of co-located VMs in order to obey service level agreements at lower possible cost. In this paper, we focus on satisfying the traffic demands of the VMs in addition to CPU and memory requirements. This is a much more complex problem both due to its quadratic nature (being the communication between a pair of VMs) and since it involves many factors beyond the physical host, like the network topologies and the routing scheme. Moreover, traffic patterns may vary over time and predicting the resulting effect on the actual available bandwidth between hosts within the data center is extremely difficult. We address this problem by trying to allocate a placement that not only satisfies the predicted communication demand but is also resilient to demand time-variations. This gives rise to a new optimization problem that we call the Min Cut Ratio-aware VM Placement (MCRVMP). The general MCRVMP problem is NP-Hard, hence, we introduce several heuristics to solve it in reasonable time. We present extensive experimental results, associated with both placement computation and run-time performance under time-varying traffic demands, to show that our heuristics provide good results (compared to the optimal solution) for medium size data centers.