Displaying similar documents to “Torus-connected cycles: A simple and scalable topology for interconnection networks”

Topology design for group consensus in directed multi-agent systems

Onur Cihan (2020)

Kybernetika

Similarity:

In this paper, we investigate the grouping behavior of multi-agent systems by exploiting the graph structure. We propose a novel algorithm for designing a network from scratch which yields the desired grouping in a network of agents utilizing a consensus-based algorithm. The proposed algorithm is shown to be optimal in the sense that it consists of the minimum number of links. Furthermore, we examine the effect of adding new vertices and edges to the network on the number of groups formed...

Generalized synchronization-based partial topology identification of complex networks

Xueqin Zhang, Yunru Zhu, Yuanshi Zheng (2023)

Kybernetika

Similarity:

In this paper, partial topology identification of complex networks is investigated based on synchronization method. We construct the response networks consisting of nodes with sim-pler dynamics than that in the drive networks. By constructing Lyapunov function, sufficient conditions are derived to guarantee partial topology identification by designing suitable controllers and parameters update laws. Several numerical examples are provided to illustrate the effectiveness of the theoretical...

Solving maximum independent set by asynchronous distributed hopfield-type neural networks

Giuliano Grossi, Massimo Marchi, Roberto Posenato (2006)

RAIRO - Theoretical Informatics and Applications

Similarity:

We propose a heuristic for solving the maximum independent set problem for a set of processors in a network with arbitrary topology. We assume an asynchronous model of computation and we use modified Hopfield neural networks to find high quality solutions. We analyze the algorithm in terms of the number of rounds necessary to find admissible solutions both in the worst case (theoretical analysis) and in the average case (experimental Analysis). We show that our heuristic is better...

Ant algorithm for flow assignment in connection-oriented networks

Krzysztof Walkowiak (2005)

International Journal of Applied Mathematics and Computer Science

Similarity:

This work introduces ANB (bf Ant Algorithm for bf Non-bf Bifurcated Flows), a novel approach to capacitated static optimization of flows in connection-oriented computer networks. The problem considered arises naturally from several optimization problems that have recently received significant attention. The proposed ANB is an ant algorithm motivated by recent works on the application of the ant algorithm to solving various problems related to computer networks. However, few works concern...

Quasi-hierarchical evolution algorithm for flow assignment in survivable connection-oriented networks

Michal Przewozniczek, Krzysztof Walkowiak (2006)

International Journal of Applied Mathematics and Computer Science

Similarity:

The main objective of this paper is to develop an effective evolutionary algorithm (EA) for the path-assignment problem in survivable connection-oriented networks. We assume a single-link failure scenario, which is the most common and frequently reported failure event. Since the network flow is modeled as a non-bifurcated multicommodity flow, the discussed optimization problem is NP-complete. Thus, we develop an effective heuristic algorithm based on an evolutionary algorithm. The main...

Anycasting in connection-oriented computer networks: Models, algorithms and results

Krzysztof Walkowiak (2010)

International Journal of Applied Mathematics and Computer Science

Similarity:

Our discussion in this article centers around various issues related to the use of anycasting in connection-oriented computer networks. Anycast is defined as a one-to-one-of-many transmission to deliver a packet to one of many hosts. Anycasting can be applied if the same content is replicated over many locations in the network. Examples of network techniques that apply anycasting are Content Delivery Networks (CDNs), Domain Name Service (DNS), Peer-to-Peer (P2P) systems. The role of...

An effective way to generate neural network structures for function approximation.

Andreas Bastian (1994)

Mathware and Soft Computing

Similarity:

One still open question in the area of research of multi-layer feedforward neural networks is concerning the number of neurons in its hidden layer(s). Especially in real life applications, this problem is often solved by heuristic methods. In this work an effective way to dynamically determine the number of hidden units in a three-layer feedforward neural network for function approximation is proposed.

An Adaptation of the Hoshen-Kopelman Cluster Counting Algorithm for Honeycomb Networks

Popova, Hristina (2014)

Serdica Journal of Computing

Similarity:

We develop a simplified implementation of the Hoshen-Kopelman cluster counting algorithm adapted for honeycomb networks. In our implementation of the algorithm we assume that all nodes in the network are occupied and links between nodes can be intact or broken. The algorithm counts how many clusters there are in the network and determines which nodes belong to each cluster. The network information is stored into two sets of data. The first one is related to the connectivity of the...