MODELING THE PERFORMANCE OF COMMUNICATION SCHEMES ON NETWORK TOPOLOGIES

2008 ◽  
Vol 18 (02) ◽  
pp. 205-220
Author(s):  
JAN LEMEIRE ◽  
ERIK DIRKX ◽  
WALTER COLITTI

This paper investigates the influence of the interconnection network topology of a parallel system on the delivery time of an ensemble of messages, called the communication scheme. More specifically, we focus on the impact on the performance of structure in network topology and communication scheme. We introduce causal structure learning algorithms for the modeling of the communication time. The experimental data, from which the models are learned automatically, is retrieved from simulations. The qualitative models provide insight about which and how variables influence the communication performance. Next, a generic property is defined which characterizes the performance of individual communication schemes and network topologies. The property allows the accurate quantitative prediction of the runtime of random communication on random topologies. However, when either communication scheme or network topology exhibit regularities the prediction can become very inaccurate. The causal models can also differ qualitatively and quantitatively. Each combination of communication scheme regularity type, e.g. a one-to-all broadcast, and network topology regularity type, e.g. torus, possibly results in a different model which is based on different characteristics.

2021 ◽  
Vol 7 ◽  
pp. e397
Author(s):  
Shirin Tavara ◽  
Alexander Schliep

The Alternating Direction Method of Multipliers (ADMM) is a popular and promising distributed framework for solving large-scale machine learning problems. We consider decentralized consensus-based ADMM in which nodes may only communicate with one-hop neighbors. This may cause slow convergence. We investigate the impact of network topology on the performance of an ADMM-based learning of Support Vector Machine using expander, and mean-degree graphs, and additionally some of the common modern network topologies. In particular, we investigate to which degree the expansion property of the network influences the convergence in terms of iterations, training and communication time. We furthermore suggest which topology is preferable. Additionally, we provide an implementation that makes these theoretical advances easily available. The results show that the performance of decentralized ADMM-based learning of SVMs in terms of convergence is improved using graphs with large spectral gaps, higher and homogeneous degrees.


1997 ◽  
Vol 08 (02) ◽  
pp. 187-209 ◽  
Author(s):  
Jie Wu ◽  
Haifeng Qian

We propose a constant node degree network topology, multitriangle, which is hierarchical, recursive, and expansive. First we introduce a corner cutting approach that generates a set of new network topologies (including multitriangles), followed by a formal definition of the multitriangle network and discussion of its properties. The salient features of this network are that it is a constant node degree network and it can be viewed as a hierarchical ring, a popular topology which has been adopted in several commercial systems. Algorithms for node-to-node routing, hierarchical ring routing, optimal ring routing, and broadcasting are presented. The multitriangle network is analyzed in terms of diameter, degree, average distance, and message density, and results are compared with other relevant networks.


2012 ◽  
Vol 65 (3) ◽  
pp. 381-413 ◽  
Author(s):  
Eric G. Taylor ◽  
Woo-kyoung Ahn

2021 ◽  
Vol 11 (3) ◽  
pp. 1241
Author(s):  
Sergio D. Saldarriaga-Zuluaga ◽  
Jesús M. López-Lezama ◽  
Nicolás Muñoz-Galeano

Microgrids constitute complex systems that integrate distributed generation (DG) and feature different operational modes. The optimal coordination of directional over-current relays (DOCRs) in microgrids is a challenging task, especially if topology changes are taken into account. This paper proposes an adaptive protection approach that takes advantage of multiple setting groups that are available in commercial DOCRs to account for network topology changes in microgrids. Because the number of possible topologies is greater than the available setting groups, unsupervised learning techniques are explored to classify network topologies into a number of clusters that is equal to the number of setting groups. Subsequently, optimal settings are calculated for every topology cluster. Every setting is saved in the DOCRs as a different setting group that would be activated when a corresponding topology takes place. Several tests are performed on a benchmark IEC (International Electrotechnical Commission) microgrid, evidencing the applicability of the proposed approach.


2015 ◽  
Vol 25 (12) ◽  
pp. 1550167
Author(s):  
Lei Wang ◽  
Hsiao-Dong Chiang

This paper presents online methods for controlling local bifurcations of power grids with the goal of increasing bifurcation values (i.e. increasing load margins) via network topology optimization, a low-cost control. In other words, this paper presents online methods for increasing power transfer capability subject to static stability limit via switching transmission line out/in (i.e. disconnecting a transmission line or connecting a transmission line). To illustrate the impact of network topology on local bifurcations, two common local bifurcations, i.e. saddle-node bifurcation and structure-induced bifurcation on small power grids with different network topologies are shown. A three-stage online control methodology of local bifurcations via network topology optimization is presented to delay local bifurcations of power grids. Online methods must meet the challenging requirements of online applications such as the speed requirement (in the order of minutes), accuracy requirement and robustness requirement. The effectiveness of the three-stage methodology for online applications is demonstrated on the IEEE 118-bus and a 1648-bus practical power systems.


2012 ◽  
Vol 64 (1-2) ◽  
pp. 93-125 ◽  
Author(s):  
Benjamin M. Rottman ◽  
Frank C. Keil

2019 ◽  
Author(s):  
Babak Hemmatian ◽  
Steven A. Sloman

Formal or categorical explanation involves the use of a label to explain a property of an object or group of objects. In 4 experiments, we provide evidence that label entrenchment, the degree to which a label is accepted and used by members of the community, influences the judged quality of a categorical explanation whether or not the explanation offers substantive information about the explanandum. Experiment 1 shows that explanations using unentrenched labels are seen as less comprehensive and less natural, independent of the causal information they provide. Experiment 2 shows that these intuitions persist when the community has no additional, relevant featural information, so the label amounts to a mere name for the explanandum. Experiment 3 finds a similar effect when the unentrenched label is not widely used, but is defined by a group of experts and the recipient of the explanation is herself an expert familiar with the topic. The effect also obtains for categories that lack a coherent causal structure. Experiment 4 further demonstrates the domain generality of the entrenchment effect and provides evidence against several interpretations of the results. A majority of participants in Experiments 3 and 4 could not report the impact of entrenchment on their judgments. We argue that this reliance on community cues arose because the community often has useful information to provide about categories. The common use of labels as conduits for this communal knowledge results in reliance on community cues even when they are uninformative.


PLoS ONE ◽  
2015 ◽  
Vol 10 (7) ◽  
pp. e0134507 ◽  
Author(s):  
Lu-Xing Yang ◽  
Moez Draief ◽  
Xiaofan Yang
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document