Relevant bibliographies by topics / Interconnection network topology / Journal articles

To see the other types of publications on this topic, follow the link: Interconnection network topology.

Journal articles on the topic 'Interconnection network topology'

Author: Grafiati

Published: 4 June 2021

Last updated: 11 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Interconnection network topology.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

Wu, Jie, and Haifeng Qian. "Multitriangle: A Constant Node Degree Interconnection Network." International Journal of Foundations of Computer Science 08, no. 02 (1997): 187–209. http://dx.doi.org/10.1142/s0129054197000148.

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

Punhani, Akash, Pardeep Kumar, and Nitin Nitin. "A Modified Diagonal Mesh Shuffle Exchange Interconnection Network." International Journal of Electrical and Computer Engineering (IJECE) 7, no. 2 (2017): 1042. http://dx.doi.org/10.11591/ijece.v7i2.pp1042-1050.

Full text

Abstract:

Interconnection network is an important part of the digital system. The interconnection mainly describes the topology of the network along with the routing algorithm and flow control mechanism. The topology of the network plays an important role on the performance of the system. Mesh interconnection network was the simplest topology, but has the limited bisection bandwidth on the other hand torus and diagonal mesh was having long links. The Modified diagonal mesh network tried to replace the torodial links but was having more average path length so in proposed topology we have tried to improve the average distance using shuffle exchange network over the boundary node. In this paper, we propose the architecture of Modified Diagonal Mesh Shuffle Exchange Interconnection Network. This Modified Diagonal Mesh Shuffle Exchange Interconnection network have been compared with four popular topologies that are simple 2D Mesh, 2D Torus, Diagonal Mesh and Modified Diagonal Mesh Interconnection Network on the four traffic patterns such as Bit Complement traffic, Neighbor traffic, Tornado traffic and Uniform traffic are used for comparisonand performance analysis. We have performed the analysis with a 5% and 10% of hotspot on the Uniform Traffic. The simulation results shows that the proposed topology is performed better on bit complement traffic and can also handle the other traffic up to certain level.

APA, Harvard, Vancouver, ISO, and other styles

WANG, XINYANG, DEYU QI, and NAQIN ZHOU. "Embedding Strategies of Mesh Network into the Exchanged Crossed Cube." Journal of Interconnection Networks 18, no. 02n03 (2018): 1850011. http://dx.doi.org/10.1142/s0219265918500111.

Full text

Abstract:

The topology of interconnection networks plays an important role in the performance of parallel and distributed computing systems, and the embeddings of interconnection networks can help adapt their topology features into new interconnection network structures. Being a basic and popular structure, the mesh network has wide application range as the result of some of its topology features. Meanwhile, as an important variant of hypercube, the Exchanged Crossed Cube(ECQ) combines advantages of crossed cube and exchanged hypercube, i.e. the promotion of network performance and the reduce of communication cost. To enlarge the application range of the ECQ, this paper discusses the embedding strategies of Mesh network into ECQ and proposes 4 methods to embed meshes into ECQ. We distinguish these methods by comparing their dilation, expansion, loading and congestion. The comparison result shows that compromise among four of the above parameters has to be made to achieve the improvement of some parameters.

APA, Harvard, Vancouver, ISO, and other styles

Tripathy, Laxminath, and Chitta Ranjan Tripathy. "New Interconnection Topology for Network on Chip." International journal of Computer Networks & Communications 10, no. 4 (2018): 37–50. http://dx.doi.org/10.5121/ijcnc.2018.10403.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Yunus, Nur Arzilawati Md, Mohamed Othman, Zurina Mohd Hanapi, and Kweh Yeah Lun. "Enhancement Replicated Network: A Reliable Multistage Interconnection Network Topology." IEEE Systems Journal 13, no. 3 (2019): 2653–63. http://dx.doi.org/10.1109/jsyst.2018.2853714.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Ren, Zhimin. "Data Processing Platform of Cloud Computing and Its Performance Analysis Based on Photoelectric Hybrid Interconnection Architecture." Journal of Nanoelectronics and Optoelectronics 15, no. 6 (2020): 743–52. http://dx.doi.org/10.1166/jno.2020.2805.

Full text

Abstract:

Data processing platform is the core support platform of cloud computing. The use of electric interconnection architecture will increase the complexity of network topology, while optical interconnection architecture is ideal, so cloud computing platform based on optical interconnection has become a research hotspot. The distributed optical interconnection architecture of cloud computing data processing platform is focused on. Combining the hybrid mechanism of optical circuit switching and electric packet switching, it can meet a variety of traffic requirements. Meanwhile, it improves the switching mechanism, communication strategy, and router structure. Moreover, considering that the hybrid optoelectronic interconnection architecture can improve the network delay and throughput, but there is still a problem of network consumption. Combined with the network characteristics of the data processing platform (wireless mesh structure) of cloud computing, the network topology algorithm is studied, and the relationship between the topology and the maximum number of allocable channels is analyzed. Furthermore, the equation of topological reliability calculation is defined, and the optimization model of topological design is proposed, according to which the data processing platform of cloud computing is further optimized under the photoelectric hybrid interconnection architecture. During the experiment, before topology optimization, by changing the message length, it is found that adding optical circuit switching can help achieving large capacity and new type of transmission, and can effectively reduce the time delay. After topology optimization structure is adopted, the photoelectric hybrid-data processing platform of cloud computing without topology optimization is compared. It is found that under different reliability constraints, the throughput and end-to-end delay of the network are significantly improved, which proves that the data processing platform of cloud computing based on the photoelectric hybrid interconnection architecture is a feasible cloud computing platform.

APA, Harvard, Vancouver, ISO, and other styles

Tripathy, Laxminath, and Chita Ranjan Tripathy. "Hierarchical Hexagon: A New Fault-Tolerant Interconnection Network for Parallel Systems." Cybernetics and Information Technologies 21, no. 1 (2021): 32–49. http://dx.doi.org/10.2478/cait-2021-0003.

Full text

Abstract:

Abstract A new interconnection network topology called Hierarchical Hexagon HH(n) is proposed for massively parallel systems. The new network uses a hexagon as the primary building block and grows hierarchically. Our proposed network is shown to be superior to the star based and the hypercube networks, with respect to node degree, diameter, network cost, and fault tolerance. We thoroughly analyze different topological parameters of the proposed topology including fault tolerance routing and embedding Hamiltonian cycle.

APA, Harvard, Vancouver, ISO, and other styles

WANG Peng, Wang XueFei, and Wu YaMing. "Genetic Algorithm Based Interconnection Network Topology Optimization Analysis." Journal of Convergence Information Technology 8, no. 9 (2013): 356–63. http://dx.doi.org/10.4156/jcit.vol8.issue9.45.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Bossard, Antoine, and Keiichi Kaneko. "Torus–Connected Cycles: A Simple and Scalable Topology for Interconnection Networks." International Journal of Applied Mathematics and Computer Science 25, no. 4 (2015): 723–35. http://dx.doi.org/10.1515/amcs-2015-0052.

Full text

Abstract:

Abstract Supercomputers are today made up of hundreds of thousands of nodes. The interconnection network is responsible for connecting all these nodes to each other. Different interconnection networks have been proposed; high performance topologies have been introduced as a replacement for the conventional topologies of recent decades. A high order, a low degree and a small diameter are the usual properties aimed for by such topologies. However, this is not sufficient to lead to actual hardware implementations. Network scalability and topology simplicity are two critical parameters, and they are two of the reasons why modern supercomputers are often based on torus interconnection networks (e.g., Fujitsu K, IBM Sequoia). In this paper we first describe a new topology, torus-connected cycles (TCCs), realizing a combination of a torus and a ring, thus retaining interesting properties of torus networks in addition to those of hierarchical interconnection networks (HINs). Then, we formally establish the diameter of a TCC, and deduce a point-to-point routing algorithm. Next, we propose routing algorithms solving the Hamiltonian cycle problem, and, in a two dimensional TCC, the Hamiltonian path one. Correctness and complexities are formally proved. The proposed algorithms are time-optimal.

APA, Harvard, Vancouver, ISO, and other styles

Gupta, Raj Kumar, and K. L. Jaiswal. "STUDY AND ANALYSIS OF GRAPHS AND MODELS BASED INTERCONNECTION NETWORK SYSTEM." International Journal of Engineering Technologies and Management Research 8, no. 1 (2021): 53–56. http://dx.doi.org/10.29121/ijetmr.v8.i1.2021.872.

Full text

Abstract:

The topology of network connections has become a vital step in the implementation of all conventional network networks. Cube architecture is one of the key aspects of network integration that explore and create networks of cubes. They praise and work together to complete all network management tasks. However, in this article, we will focus on the error handling function.

APA, Harvard, Vancouver, ISO, and other styles

ZHAO, JUTAO, and SHIYING WANG. "Connectivity and Nature Diagnosability of Leaf-Sort Graphs." Journal of Interconnection Networks 20, no. 03 (2020): 2050011. http://dx.doi.org/10.1142/s0219265920500115.

Full text

Abstract:

The connectivity and diagnosability of a multiprocessor system or an interconnection network is an important research topic. The system and interconnection network has a underlying topology, which usually presented by a graph. As a famous topology structure of interconnection networks, the n-dimensional leaf-sort graph CFn has many good properties. In this paper, we prove that (a) the restricted edge connectivity of CFn (n ≥ 3) is 3n − 5 for odd n and 3n − 6 for even n; (b) CFn (n ≥ 5) is super restricted edge-connected; (c) the nature diagnosability of CFn (n ≥ 4) under the PMC model is 3n − 4 for odd n and 3n − 5 for even n; (d) the nature diagnosability of CFn (n ≥ 5) under the MM* model is 3n − 4 for odd n and 3n − 5 for even n.

APA, Harvard, Vancouver, ISO, and other styles

Yu, Xin, Gao Cai Wang, and Yan Yu. "Internally Vertex-Disjoint Paths in Crossed Cube-Connected Ring Networks." Applied Mechanics and Materials 321-324 (June 2013): 2715–20. http://dx.doi.org/10.4028/www.scientific.net/amm.321-324.2715.

Full text

Abstract:

Crossed cube is a variation of hypercube, but some properties of the former are superior to those of the latter. However, it is difficult to extend the scale of crossed cube networks. As a kind of hierarchical ring interconnection networks, crossed cube-connected ring interconnection network CRN can effectively overcome the disadvantage. Hence, it is a good topology for interconnection networks. In this paper, we prove that there exist n internally vertex-disjoint paths between any two vertexes in CRN, and analyze the lengths of the paths.

APA, Harvard, Vancouver, ISO, and other styles

Waterson, Clare, and B. Keith Jenkins. "Passive optical interconnection network employing a shuffle–exchange topology." Applied Optics 33, no. 8 (1994): 1575. http://dx.doi.org/10.1364/ao.33.001575.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Raghunath, M. T., and Abhiram Ranade. "Designing Interconnection Networks for Multi-level Packaging." VLSI Design 2, no. 4 (1995): 375–88. http://dx.doi.org/10.1155/1995/57617.

Full text

Abstract:

A central problem in building large scale parallel machines is the design of the interconnection network. Interconnection network design is largely constrained by packaging technology. We start with a generic set of packaging restrictions and evaluate different network organizations under a random traffic model. Our results indicate that customizing the network topology to the packaging constraints is useful. Some of the general principles that arise out of this study are: 1) Making the networks denser at the lower levels of the packaging hierarchy has a significant positive impact on global communication performance, 2) It is better to organize a fixed amount of communication bandwidth as a smaller number of high bandwidth channels, 3) Providing the processors with the ability to tolerate latencies (by using multithreading) is very useful in improving performance.

APA, Harvard, Vancouver, ISO, and other styles

FARD, NASSER S., and INDRA GUNAWAN. "TERMINAL RELIABILITY IMPROVEMENT OF SHUFFLE-EXCHANGE NETWORK SYSTEMS." International Journal of Reliability, Quality and Safety Engineering 12, no. 01 (2005): 51–60. http://dx.doi.org/10.1142/s0218539305001677.

Full text

Abstract:

Multistage Interconnection Networks (MINs) are communication network systems that provide fast and efficient information transitions among N processors and N memory modules of systems. A typical MIN consists of layers of switching elements that are connected together in a predefined topology. The routing capability of a network depends on its specific topology. A shuffle-exchange network (SEN), a specific type of MIN that consists of 2 × 2 switching elements, has been widely considered a practical interconnection system. In this paper, a modified shuffle-exchange network with 1 × 2 switching elements at the input (source) stage, 2 × 2 switching elements at the intermediate stages, and 2 × 1 switching elements at the output (terminal) stage is proposed. The proposed network shows an improvement in the terminal reliability of SEN. The terminal reliability evaluation of the SEN and the modified SEN are demonstrated through numerical examples for different sizes of networks. The reliability evaluation of MINs is important, as it determines the usability and efficiency of the network to provide services. It is shown that the proposed modified SEN provides higher terminal reliability for network sizes larger than 4 inputs and 4 outputs (4 × 4).

APA, Harvard, Vancouver, ISO, and other styles

Baig, Abdul Qudair, Muhammad Imran, and Haidar Ali. "On topological indices of poly oxide, poly silicate, DOX, and DSL networks." Canadian Journal of Chemistry 93, no. 7 (2015): 730–39. http://dx.doi.org/10.1139/cjc-2014-0490.

Full text

Abstract:

Topological indices are numerical parameters of a graph that characterize its topology and are usually graph invariant. In a QSAR/QSPR study, physicochemical properties and topological indices such as Randić, atom–bond connectivity (ABC), and geometric–arithmetic (GA) indices are used to predict the bioactivity of chemical compounds. Graph theory has found a considerable use in this area of research. In this paper, we study different interconnection networks and derive analytical closed results of the general Randić index (Rα(G)) for α = 1, [Formula: see text], –1, [Formula: see text] only, for dominating oxide network (DOX), dominating silicate network (DSL), and regular triangulene oxide network (RTOX). All of the studied interconnection networks in this paper are motivated by the molecular structure of a chemical compound, SiO4. We also compute the general first Zagreb, ABC, GA, ABC4, and GA5 indices and give closed formulae of these indices for these interconnection networks.

APA, Harvard, Vancouver, ISO, and other styles

Devaux, Ludovic, Sana Ben Sassi, Sebastien Pillement, Daniel Chillet, and Didier Demigny. "Flexible Interconnection Network for Dynamically and Partially Reconfigurable Architectures." International Journal of Reconfigurable Computing 2010 (2010): 1–15. http://dx.doi.org/10.1155/2010/390545.

Full text

Abstract:

The dynamic and partial reconfiguration of FPGAs enables the dynamic placement in reconfigurable zones of the tasks that describe an application. However, the dynamic management of the tasks impacts the communications since tasks are not present in the FPGA during all computation time. So, the task manager should ensure the allocation of each new task and their interconnection which is performed by a flexible interconnection network. In this article, various communication architectures, in particular interconnection networks, are studied. Each architecture is evaluated with respect to its suitability for the paradigm of the dynamic and partial reconfiguration in FPGA implementations. This study leads us to propose the DRAFT network that supports the communication constraints into the context of dynamic reconfiguration. We also present DRAGOON, the automatic generator of networks, which allows to implement and to simulate the DRAFT topology. Finally, DRAFT and the two most popular Networks-on-Chip are implemented in several configurations using DRAGOON, and compared considering real implementation results.

APA, Harvard, Vancouver, ISO, and other styles

Wang, Mujiangshan, Dong Xiang, and Shiying Wang. "Connectivity and Diagnosability of Leaf-Sort Graphs." Parallel Processing Letters 30, no. 03 (2020): 2040004. http://dx.doi.org/10.1142/s0129626420400046.

Full text

Abstract:

The connectivity and diagnosability of a multiprocessor system and an interconnection network are two important research topics. The system and the network have an underlying topology, which is usually presented by a graph. As a topology structure of interconnection networks, the [Formula: see text]-dimensional leaf-sort graph [Formula: see text] has many good properties. In this paper, we prove that (a) [Formula: see text] is tightly [Formula: see text] super connected for odd [Formula: see text] and [Formula: see text], and tightly [Formula: see text] super connected for even [Formula: see text] and [Formula: see text]; (b) under the PMC model and MM[Formula: see text] model, the diagnosability [Formula: see text] for odd [Formula: see text] and [Formula: see text], and [Formula: see text] for even [Formula: see text] and [Formula: see text].

APA, Harvard, Vancouver, ISO, and other styles

Le Nhat, T. X., T. Truong Nguyen, and Khanh-Van Nguyen. "Robust and Efficient Custom Routing for Interconnection Networks with Distributed Shortcuts." International Journal of Distributed Systems and Technologies 5, no. 4 (2014): 51–74. http://dx.doi.org/10.4018/ijdst.2014100104.

Full text

Abstract:

We aim at creating a robust and efficient custom routing mechanism for Distributed Shortcut Networks (Nguyen et al., 2013), which address new challenging issues posed by recently advanced studies in the areas of massively parallel computing and large-scale data centers. We follow the design principles of Distributed Shortcut Networks (DSN), which construct non-random topologies with the creation of long-range shortcuts inspired by observations in small-world networks. However, we focus on designing a powerful custom routing mechanism which smartly exploits some precious properties of the topology. As a result, our new DSN-a network with a carefully refined routing logic performs significantly better than the basic DSN in term of communication latency while provides strengths in fault-tolerance as well as load-balance. These help the network become robust against link failures or burst of traffic demand while topology-agnostic deadlock-free routing (e.g. the famous up*/down* algorithm) suffers a lot.

APA, Harvard, Vancouver, ISO, and other styles

Zhu, Qishuang, Hongxiang Guo, Ceng Wang, and Yong Zhu. "Research on Topoloty Reconstruction Mechanism Based on Traffic Identification." Journal of Networking and Telecommunications 2, no. 1 (2020): 18. http://dx.doi.org/10.18282/jnt.v2i1.836.

Full text

Abstract:

<p align="justify">Due to the growing variety of data center services, the bursty and variability of data traffic is increasing. In order to make the network better meet the needs of upper-layer services, it is necessary to design a more flexible optical internet topology reconstruction mechanisms to adapt the changing traffic demands. In the past research on optical internet, all topology reconstruction mechanisms are designed based on global data traffic. Although these mechanisms can fully utilize the flexibility of the data center optical interconnection network topology and adjust topology in real time according to the traffic demands, but when the traffic is presented at the regional level, this mechanism does not give optimal results. This paper proposes a topology reconstruction mechanism for data center optical interconnection network based on traffic identification for the previously proposed data center optical switching architecture—OpenScale. The simulation results show that it utilizes the flexibility of the network to save bandwidth resources and increase the wavelength connection bandwidth utilization with a little sacrifice of throughput.</p>

APA, Harvard, Vancouver, ISO, and other styles

Yuanjun, Wu. "Topology of Wireless Sensor Network Based on the Perception Needs of the Internet of Things." International Journal of Online Engineering (iJOE) 14, no. 02 (2018): 24. http://dx.doi.org/10.3991/ijoe.v14i02.8200.

Full text

Abstract:

In order to adapt to the characteristics of multi network convergence of IOT, this paper sorts out and summarizes the development status and existing problems of Internet of things (IOT) and wireless sensor network (WSN) as well as the key points for future research. Based on the existing research, the wireless sensor topology SORCA protocol is improved, and an energy saving intrusion tolerant network topology SORCA-W generation method is proposed, which realizes the interconnection of multiple sensor networks. Firstly, according to the location of nodes, the network is divided into topology network composed of hexagonal units. Through adding different network nodes collection summary, the neighbor table is judged and modified, and the name of the network is added. As a result, it is concluded that a plurality of wireless sensor networks can be connected for communication, which realizes the multi network integration of perception layer of Internet of things

APA, Harvard, Vancouver, ISO, and other styles

Bhardwaj, Manish. "C2 Torus New Interconnection Network Topology Based on 2D Torus." American Journal of Networks and Communications 4, no. 3 (2015): 1. http://dx.doi.org/10.11648/j.ajnc.s.2015040301.11.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Chauhan, Prachi, and Manish Bhardwaj. "Analysis the Performance of Interconnection Network Topology C2 Torus Based on Two Dimensional Torus." International Journal of Emerging Research in Management and Technology 6, no. 6 (2018): 169. http://dx.doi.org/10.23956/ijermt.v6i6.264.

Full text

Abstract:

Mesh and Torus are most popular interconnection topologies based on 2D-mesh.Comparison between Mesh and Torus will be considered and new interconnection topology will be proposed to provide better performance. The C2Mesh, is an enhanced mesh interconnected network. This paper enhances the torus network based on the theme of C2Mesh. Topological Properties of new network will be analyzed and implemented by simulation. The new routing Algorithm will be designed for new proposed network (C2Torus). This manuscript performs Comparison between C2Torus and C2Mesh.

APA, Harvard, Vancouver, ISO, and other styles

Das, Sajal K., Sabine Öhring, and Amit K. Banerjee. "Embeddings into Hyper Petersen Networks: Yet Another Hypercube-Like Interconnection Topology." VLSI Design 2, no. 4 (1995): 335–51. http://dx.doi.org/10.1155/1995/95759.

Full text

Abstract:

A new hypercube-like topology, called the hyper Petersen (HP) network, is proposed and analyzed, which is constructed from the well-known cartesian product of the binary hypercube and the Petersen graph of ten nodes.This topology is an attractive candidate for multiprocessor interconnection having such desirable properties as regularity, high symmetry and connectivity, and logarithmic diameter. For example, an n-dimensional hyper Petersen network, HPn, with N=1.25 * 2n nodes is a regular graph of degree and node-connectivity n and diameter n–1 , whereas an (n–1)-dimensional binary hypercube, Qn−1 , with the same diameter covers only 2n−1 nodes, each of degree (n–1). Thus the HP topology accommodates 2.5 times extra nodes than Qn−1 at the cost of increasing the node-degree by one. With the same degree and connectivity of n, the diameter of the HPn network is one less than that of Qn, yet having 1.25 times larger number of nodes.Efficient routing and broadcasting schemes are presented, and node-disjoint paths in HPn, are computed even under faulty conditions. The versatility of the hyper Petersen networks is emphasized by embedding rings, meshes, hypercubes and several tree-related topologies into it. Contrary to the hypercubes, rings of odd lengths, and a complete binary tree of height n–1 permit subgraph embeddings in HPn.

APA, Harvard, Vancouver, ISO, and other styles

Aytaç, Aysun, and Tufan Turaci. "Vulnerability Measures of Transformation Graph Gxy+." International Journal of Foundations of Computer Science 26, no. 06 (2015): 667–75. http://dx.doi.org/10.1142/s0129054115500379.

Full text

Abstract:

Several factors have to be taken into account in the design of large interconnection networks. Optimal design is important both to achieve good performance and to reduce the cost of construction and maintenance. Practical communication networks are exposed to failures of network components. Failures between nodes and connections happen and it is desirable that a network is robust in the sense that a limited number of failures does not break down the whole system. Robustness of the network topology is a key aspect in the design of computer networks. A variety of measures have been proposed in the literature to quantify the robustness of networks and a number of graph-theoretic parameters have been used to derive formulas for calculating network reliability. In this paper, we study the vulnerability of interconnection networks to the failure of individual nodes, using a graph-theoretic concept of domination and strong-weak domination numbers of the transformation graph Gxy+ as a measure of network robustness.

APA, Harvard, Vancouver, ISO, and other styles

DANOY, GREGOIRE, ENRIQUE ALBA, and PASCAL BOUVRY. "OPTIMAL INTERCONNECTION OF AD HOC INJECTION NETWORKS." Journal of Interconnection Networks 09, no. 03 (2008): 277–97. http://dx.doi.org/10.1142/s0219265908002278.

Full text

Abstract:

Multi-hop ad hoc networks allow establishing local groups of communicating devices in a self-organizing way. However, when considering realistic mobility patterns, such networks most often get divided in a set of disjoint partitions. This presence of partitions is an obstacle to communication within these networks. Ad hoc networks are generally composed of devices capable of communicating in a geographical neighborhood for free (e.g. using Wi-Fi or Bluetooth). In most cases a communication infrastructure is available. It can be a set of access point as well as a GSM/UMTS network. The use of such an infrastructure is billed, but it permits to interconnect distant nodes, through what we call “bypass links”. The objective of our work is to optimize the placement of these long-range links. To this end we rely on small-world network properties, which consist in a high clustering coefficient and a low characteristic path length. In this article we investigate the use of three genetic algorithms (generational, steady-state, and cooperative coevolutionary) to optimize three instances of this topology control problem and present initial evidence of their capacity to solve it.

APA, Harvard, Vancouver, ISO, and other styles

Afzal, Muhammad, Manuel S. Alvarez-Alvarado, Zafar A. Khan, and Mohammed Alghassab. "Composition Assessment of a Power Distribution System with Optimal Dispatching of Distributed Generation." International Journal of Renewable Energy Development 9, no. 3 (2020): 455–66. http://dx.doi.org/10.14710/ijred.2020.31428.

Full text

Abstract:

Increasing penetration of distributed generation (DG) is imminent in the new age of power distribution networks, which are smarter than the conventional grids. They enable the integration of DG into the power distribution network. This paper presents an assessment methodology for determining the optimal capacity and location of DG to ensure high reliability in a radial distribution network. The approach considers cost and the impact of aging on the DG and network topology for interconnection using genetic algorithm, which is a robust technique with wide solution space searchability and can potentially find global optima with fewer chances of getting trapped into local optima. A case study is simulated using three different scenarios to evaluate the impact of DG interconnection on the 13.8 kV power distribution network. The scenarios comprise of situations without any DG, with DG interconnection and optimization of DG interconnection. The case study shows that the penetration of DG increases the reliability of the distribution network while reducing the expected energy not supplied (EENS). Although, the difference between EENS in the optimized DG integration and non-optimized DG integration is not very significant in a small network, however, it becomes apparent with the aging curve that optimized allocation of DG possesses significant benefits.

APA, Harvard, Vancouver, ISO, and other styles

Chaintoutis, Charidimos, Behnam Shariati, Adonis Bogris, et al. "Free Space Intra-Datacenter Interconnects Based on 2D Optical Beam Steering Enabled by Photonic Integrated Circuits." Photonics 5, no. 3 (2018): 21. http://dx.doi.org/10.3390/photonics5030021.

Full text

Abstract:

Data centers are continuously growing in scale and can contain more than one million servers spreading across thousands of racks; requiring a large-scale switching network to provide broadband and reconfigurable interconnections of low latency. Traditional data center network architectures, through the use of electrical packet switches in a multi-tier topology, has fundamental weaknesses such as oversubscription and cabling complexity. Wireless intra-data center interconnection solutions have been proposed to deal with the cabling problem and can simultaneously address the over-provisioning problem by offering efficient topology re-configurability. In this work we introduce a novel free space optical interconnect solution for intra-data center networks that utilizes 2D optical beam steering for the transmitter, and high bandwidth wide-area photodiode arrays for the receiver. This new breed of free space optical interconnects can be developed on a photonic integrated circuit; offering ns switching at sub-μW consumption. The proposed interconnects together with a networking architecture that is suitable for utilizing those devices could support next generation intra-data center networks, fulfilling the requirements of seamless operation, high connectivity, and agility in terms of the reconfiguration time.

APA, Harvard, Vancouver, ISO, and other styles

Ouali, Saad, and Abdeljebbar Cherkaoui. "Optimal Allocation of Combined Renewable Distributed Generation and Capacitor Units for Interconnection Cost Reduction." Journal of Electrical and Computer Engineering 2020 (July 23, 2020): 1–11. http://dx.doi.org/10.1155/2020/5101387.

Full text

Abstract:

In this paper, a new methodology for the optimal investment in distributed generation is presented, based on an optimal allocation of combined DG and capacitor units to alleviate network voltage constraints and reduce the interconnection cost of renewable generation integration in public medium voltage distribution networks. An analytical optimization method is developed, with the inclusion of practical considerations that are typically neglected in developed works: network topology reconfiguration and the geographical data of the generation land-use and network infrastructure. Powerful results concluded from a sensitivity analysis study of the most impacted parts of the network by the variation of active and reactive power injection under network topology reconfiguration are used as a basis for capacitor units placement. A case study, with two meshed IEEE 15-bus feeders and a new DG to connect, geographical dispersed, are used to simulate the performance of the proposed approach. A cost evaluation of the obtained results proves the effectiveness of the proposed approach to reduce the required charges for connecting new renewable generation units in medium voltage distribution system.

APA, Harvard, Vancouver, ISO, and other styles

Liu, Youyao, Lidong Xing, and Xin Zhou. "Topology Architecture and Routing Algorithms of Octagon-Connected Torus Interconnection Network." TELKOMNIKA (Telecommunication Computing Electronics and Control) 13, no. 1 (2015): 305. http://dx.doi.org/10.12928/telkomnika.v13i1.1262.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Cancan, Murat. "On Ev-Degree and Ve-Degree Topological Properties of Tickysim Spiking Neural Network." Computational Intelligence and Neuroscience 2019 (June 2, 2019): 1–7. http://dx.doi.org/10.1155/2019/8429120.

Full text

Abstract:

Topological indices are indispensable tools for analyzing networks to understand the underlying topology of these networks. Spiking neural network architecture (SpiNNaker or TSNN) is a million-core calculating engine which aims at simulating the behavior of aggregates of up to a billion neurons in real time. Tickysim is a timing-based simulator of the interchip interconnection network of the SpiNNaker architecture. Tickysim spiking neural network is considered to be highly symmetrical network classes. Classical degree-based topological properties of Tickysim spiking neural network have been recently determined. Ev-degree and ve-degree concepts are two novel degrees recently defined in graph theory. Ev-degree and ve-degree topological indices have been defined as parallel to their corresponding counterparts. In this study, we investigate the ev-degree and ve-degree topological properties of Tickysim spiking neural network. These calculations give the information about the underlying topology of Tickysim spiking neural network.

APA, Harvard, Vancouver, ISO, and other styles

YANG, XIAO-SONG, QUAN YUAN, and LIN WANG. "WHAT CONNECTION TOPOLOGY PROHIBIT CHAOS IN CONTINUOUS TIME NETWORKS?" Advances in Complex Systems 10, no. 04 (2007): 449–61. http://dx.doi.org/10.1142/s021952590700129x.

Full text

Abstract:

In this paper, we are concerned with two interesting problems in the dynamics of neural networks. What connection topology will prohibit chaotic behavior in a continuous time neural network (NN). To what extent is a continuous time neural network (NN) described by continuous ordinary differential equations simple enough yet still able to exhibit chaos? We study these problems in the context of the classical neural networks with three neurons, which can be described by three-dimensional autonomous ordinary differential equations. We first consider the case where there is no direct interconnection between the first neuron and the third neuron. We then discuss the case where each pair of neurons has a direct connection. We show that the existence of the directed loop in connection topology is necessary for chaos to occur.

APA, Harvard, Vancouver, ISO, and other styles

Han, Yuejuan, Lantao You, Cheng-Kuan Lin, and Jianxi Fan. "Communication Performance Evaluation of the Locally Twisted Cube." International Journal of Foundations of Computer Science 31, no. 02 (2020): 233–52. http://dx.doi.org/10.1142/s0129054120500057.

Full text

Abstract:

The topology properties of multi-processors interconnection networks are important to the performance of high performance computers. The hypercube network [Formula: see text] has been proved to be one of the most popular interconnection networks. The [Formula: see text]-dimensional locally twisted cube [Formula: see text] is an important variant of [Formula: see text]. Fault diameter and wide diameter are two communication performance evaluation parameters of a network. Let [Formula: see text]), [Formula: see text] and [Formula: see text] denote the diameter, the [Formula: see text] fault diameter and the wide diameter of [Formula: see text], respectively. In this paper, we prove that [Formula: see text] if [Formula: see text] is an odd integer with [Formula: see text], [Formula: see text] if [Formula: see text] is an even integer with [Formula: see text].

APA, Harvard, Vancouver, ISO, and other styles

HARWOOD, AARON, and HONG SHEN. "A NEW FAMILY OF EXTREMAL INTERCONNECTION NETWORKS." Journal of Interconnection Networks 02, no. 04 (2001): 421–44. http://dx.doi.org/10.1142/s0219265901000476.

Full text

Abstract:

We extensively discuss a new interconnection network topology, denoted by ϒ(n,r). Firstly, the ϒ(n,2) network is shown to provide average cost 3 log 2 n while providing superior fault tolerance characteristics. It is defined over any natural number of nodes n using 2n-3 edges for an average degree of 4 and has diameter no greater than k=⌈ log 2n⌉ with average diameter as small as [Formula: see text]. The network is planar and has cyclomatic number n-2. For n=2t the unbounded maximum degree is 2 log 2 n-1 believed indicative of generally a maximum unbounded degree O( log 2n). The bisection width ranges from 3 when n=2t to t+1 when n=2t+1. Secondly, we provide the ϒ*(n,r) network of bounded degree 2r. For n=rt the ϒ*(n,r) network has asymptotically better average cost than the general deBruijn(r,t) network while also maintaining planarity and cyclomatic property of ϒ(n,2). The ϒ family exhibits unique extremal properties of both theoretical interest and practical importance.

APA, Harvard, Vancouver, ISO, and other styles

WANG, SHIYING, and LINGQI ZHAO. "A Note on the Nature Diagnosability of Alternating Group Graphs Under the PMC Model and MM* Model." Journal of Interconnection Networks 18, no. 01 (2018): 1850005. http://dx.doi.org/10.1142/s0219265918500056.

Full text

Abstract:

Many multiprocessor systems have interconnection networks as underlying topologies and an interconnection network is usually represented by a graph where nodes represent processors and links represent communication links between processors. No faulty set can contain all the neighbors of any fault-free node in the system, which is called the nature diagnosability of the system. Diagnosability of a multiprocessor system is one important study topic. As a favorable topology structure of interconnection networks, the n-dimensional alternating group graph AGn has many good properties. In this paper, we prove the following. (1) The nature diagnosability of AGn is 4n − 10 for n − 5 under the PMC model and MM* model. (2) The nature diagnosability of the 4-dimensional alternating group graph AG4 under the PMC model is 5. (3) The nature diagnosability of AG4 under the MM* model is 4.

APA, Harvard, Vancouver, ISO, and other styles

Wang, Shiying, and Mujiangshan Wang. "The Edge Connectivity of Expanded k-Ary n-Cubes." Discrete Dynamics in Nature and Society 2018 (October 2, 2018): 1–7. http://dx.doi.org/10.1155/2018/7867342.

Full text

Abstract:

Mass data processing and complex problem solving have higher and higher demands for performance of multiprocessor systems. Many multiprocessor systems have interconnection networks as underlying topologies. The interconnection network determines the performance of a multiprocessor system. The network is usually represented by a graph where nodes (vertices) represent processors and links (edges) represent communication links between processors. For the network G, two vertices u and v of G are said to be connected if there is a (u,v)-path in G. If G has exactly one component, then G is connected; otherwise G is disconnected. In the system where the processors and their communication links to each other are likely to fail, it is important to consider the fault tolerance of the network. For a connected network G=(V,E), its inverse problem is that G-F is disconnected, where F⊆V or F⊆E. The connectivity or edge connectivity is the minimum number of F. Connectivity plays an important role in measuring the fault tolerance of the network. As a topology structure of interconnection networks, the expanded k-ary n-cube XQnk has many good properties. In this paper, we prove that (1) XQnk is super edge-connected (n≥3); (2) the restricted edge connectivity of XQnk is 8n-2 (n≥3); (3) XQnk is super restricted edge-connected (n≥3).

APA, Harvard, Vancouver, ISO, and other styles

Gao, Siyu, and Xin Wang. "Neural-Network-Based Collaborative Control for Continuous Unknown Nonlinear Systems." Discrete Dynamics in Nature and Society 2021 (March 24, 2021): 1–10. http://dx.doi.org/10.1155/2021/5535971.

Full text

Abstract:

This paper proposes an NN-based cooperative control scheme for a type of continuous nonlinear system. The model studied in this paper is designed as an interconnection topology, and the main consideration is the connection mode of the undirected graph. In order to ensure the online sharing of learning knowledge, this paper proposes a novel weight update scheme. In the proposed update scheme, the weights of the neural network are discrete, and these discrete weights can gradually approach the optimal value through cooperative learning, thereby realizing the control of the unknown nonlinear system. Through the trained neural network, it is proved if the interconnection topology is undirected and connected, the state of the unknown nonlinear system can converge to the target trajectory after a finite time, and the error of the system can converge to a small neighbourhood around the origin. It is also guaranteed that all closed-loop signals in the system are bounded. A simulation example is provided to more intuitively prove the effectiveness of the proposed distributed cooperative learning control scheme at the end of the article.

APA, Harvard, Vancouver, ISO, and other styles

FERREIRA, A., A. GOLDMAN, and S. W. SONG. "BROADCASTING IN BUS INTERCONNECTION NETWORKS." Journal of Interconnection Networks 01, no. 02 (2000): 73–94. http://dx.doi.org/10.1142/s0219265900000068.

Full text

Abstract:

In most distributed memory MIMD multiprocessors, processors are connected by a point-to-point interconnection network, usually modeled by a graph where processors are nodes and communication links are edges. Since interprocessor communication frequently constitutes serious bottlenecks, several architectures were proposed that enhance point-to-point topologies with the help of multiple bus systems so as to improve the communication efficiency. In this paper we study parallel architectures where the communication means are constituted solely by buses. These architectures can use the power of bus technologies, providing a way to interconnect much more processors in a simple and efficient manner. We present the hyperpath, hypergrid, hyperring, and hypertorus architectures, which are the bus-based versions of the well used point-to-point interconnection networks. Using (hyper) graph theoretic concepts to model inter-processor communication in such networks, we give optimal algorithms for broadcasting a message from one processor to all the others. For deriving high performance communication patterns we developed a new tool called simplification. The idea is to construct a graph, to be called representative graph, from the original hyper-topology, in such a way that it will become easy to describe and perform communication schemes to the former that will fit to the latter, because the simplification concept also allows us to partially use some already known communication algorithms for usual networks.

APA, Harvard, Vancouver, ISO, and other styles

Huang, Xin, Yu Xing Peng, and Peng Fei You. "Data Placement and Query for Cloud Computing Based on MyHeawood Network." Applied Mechanics and Materials 543-547 (March 2014): 3100–3104. http://dx.doi.org/10.4028/www.scientific.net/amm.543-547.3100.

Full text

Abstract:

The massive data in Data centers network will be frequently accessed massive datasets for cloud services, which will lead to some new requirements and becomes an important issue for interconnection topology and data management in cloud computing. According to the cost-effective, the paper proposes a new interconnection network MyHeawood for cloud computing. MyHeawood is constructed by small switches and servers with dual-port NIC according to recursive method. The data placement strategy in MyHeawood is a hashing algorithm based on the family of hash functions. MyHeawood uses three replicas strategy base on master copy, which is allocated in different sub layer to improve the reliability of data.

APA, Harvard, Vancouver, ISO, and other styles

Okorafor, Ekpe, and Mi Lu. "Percolation routing in a three-dimensional multicomputer network topology using optical interconnection." Journal of Optical Networking 4, no. 3 (2005): 157. http://dx.doi.org/10.1364/jon.4.000157.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Fan, Jing, Jun Feng Hao, Jie Li, and Jian Bin Xie. "Neighbor-Based Adaptive Listening and Sleeping Scheme for Wireless Mesh Sensor Networks." Applied Mechanics and Materials 128-129 (October 2011): 642–47. http://dx.doi.org/10.4028/www.scientific.net/amm.128-129.642.

Full text

Abstract:

According to the topology of Wireless Mesh Sensor Networks (abbreviate to WMSN), and the channel access strategy of alternately listening/sleeping scheme, this paper study a neighbor-based adaptive listening/sleeping mechanism for WMSN. Based on the theory of queuing, the paper designed an algorithm named neighbor-based listening and sleeping algorithm (abbreviate to NLS) which can adaptively arrange the duty cycle of transmission frame. On the account of three typical topology for WMSN and consider the neighbor number of Mesh routers and sensor nodes, the performance of proposed scheme are simulated and studied under NS-2. The study results show that the combination of the WSN and WMN can be constructed to achieve full interconnection of heterogeneous mesh topology network. Application of queuing theory to establish the WMSN network multi-hop data transmission model can dynamically adjust listening time of different nodes. Using NLS algorithm, the throughput, delay and energy-efficiency of WMSN network are all improved to some extent.

APA, Harvard, Vancouver, ISO, and other styles

Ryu, Junghun, Eric Noel, and K. Wendy Tang. "Distributed and Fault-Tolerant Routing for Borel Cayley Graphs." International Journal of Distributed Sensor Networks 8, no. 10 (2012): 124245. http://dx.doi.org/10.1155/2012/124245.

Full text

Abstract:

We explore the use of a pseudorandom graph family, Borel Cayley graph family, as the network topology with thousands of nodes operating in a packet switching environment. BCGs are known to be an efficient topology in interconnection networks because of their small diameters, short average path lengths, and low-degree connections. However, the application of BCGs is hindered by a lack of size flexibility and fault-tolerant routing. We propose a fault-tolerant routing algorithm for BCGs. Our algorithm exploits the vertex-transitivity property of Borel Cayley graphs and relies on extra information to reflect topology change. Our results show that the proposed method supports good reachability and a small End-to-End delay under various link failures scenarios.

APA, Harvard, Vancouver, ISO, and other styles

Punhani, Akash, Pardeep Kumar, and Nitin Nitin. "Level Based Routing Using Dynamic Programming for 2D Mesh." Cybernetics and Information Technologies 17, no. 2 (2017): 73–82. http://dx.doi.org/10.1515/cait-2017-0017.

Full text

Abstract:

Abstract The performance of the interconnection network doesn’t only depend on the topology, but it also depends on the Routing algorithm used. The simplest Routing algorithm for the mesh topology in networks on chip is the XY Routing algorithm. The level based Routing algorithm has been proved to be more efficient than the XY Routing algorithm. In this paper, level based Routing algorithm using the dynamic programming has been proposed. The proposed Routing algorithm proves to be more efficient in the terms of the computation. The proposed Routing algorithm has achieved up to two times bigger speed.

APA, Harvard, Vancouver, ISO, and other styles

Al-Sadi, Jehad Ahmed. "A New Unicast Routing Algorithm for Hyper Hexa-Cell Interconnection Networks." International Journal of Information Systems and Social Change 8, no. 3 (2017): 45–57. http://dx.doi.org/10.4018/ijissc.2017070104.

Full text

Abstract:

The Hyper Hexa-Cell topology; HHC for short; is a new interconnection network topology that has many attractive topological properties compared to other traditional topologies. There have been a number of studies in the literature on the HHC to explore the promising topological properties of this topology. Furthermore, other studies extend this topology by combining it with OTIS technology to produce a new version called OHHC. We have found that there is a lake of presenting any point to point routing algorithm for the HHC, although there were some efforts on building routing algorithms for the OHHC. To cover this shortage, this paper introduces a new unicast routing algorithm for the HHC. The new routing algorithm for the HHC uses store-and-forward technique which allows a message to be transmitted through a path from the source node to the destination node. In addition to presenting the routing algorithm, we present an example to explore the algorithm steps and also an enhancement on the routing algorithm to apply adaptively on the routing based on parameterized criteria. Finally, we present a theoretical theorem to prove that the algorithm routes any message from any source to any destination via an optimal path.

APA, Harvard, Vancouver, ISO, and other styles

GARCIA, ROMAN, and JOSE DUATO. "SUBOPTIMAL-OPTIMAL ROUTING FOR LAN INTERNETWORKING USING TRANSPARENT BRIDGES." International Journal of Foundations of Computer Science 09, no. 02 (1998): 139–56. http://dx.doi.org/10.1142/s0129054198000118.

Full text

Abstract:

The current standard transparent bridge protocol IEEE-802.1D is based on the Spanning Tree (ST) algorithm. It has a very important restriction: it cannot work when the topology has active loops. Therefore, a tree is the only possible interconnection topology that can be used. The ST algorithm guarantees that the active topology is a tree discarding lines that form loops. However, because of this, network bandwidth cannot be fully utilized. Moreover, trees have a very serious bottleneck near the root. This paper proposes a new transparent bridge protocol for LAN interconnection that allows active loops. Therefore, strongly connected regular topologies like tori, hypercubes, meshes, etc., as well as irregular topologies can be used without wasting bandwidth. As loops provide alternative paths, the new protocol (named OSR for Optimal-Suboptimal Routing) uses optimal routing or, in the worst case, suboptimal routing.

APA, Harvard, Vancouver, ISO, and other styles

Vipin, Kizheppatt. "AsyncBTree: Revisiting Binary Tree Topology for Efficient FPGA-Based NoC Implementation." International Journal of Reconfigurable Computing 2019 (February 20, 2019): 1–9. http://dx.doi.org/10.1155/2019/7239858.

Full text

Abstract:

Binary tree topology generally fails to attract network on chip (NoC) implementations due to its low bisection bandwidth. Fat trees are proposed to alleviate this issue by using increasingly thicker links to connect switches towards the root node. This scheme is very efficient in interconnected networks such as computer networks, which use generic switches for interconnection. In an NoC context, especially for field programmable gate arrays (FPGAs), fat trees require more complex switches as we move higher in the hierarchy. This restricts the maximum clock frequency at which the network operates and offsets the higher bandwidth achieved through using fatter links. In this paper, we discuss the implementation of a binary tree-based NoC, which achieves better bandwidth by varying the clock frequency between the switches as we move higher in the hierarchy. This scheme enables using simpler switch architecture, thus supporting higher maximum frequency of operation. The effect on bandwidth and resource requirement of this architecture is compared with other FPGA-based NoCs for different network sizes and traffic patterns.

APA, Harvard, Vancouver, ISO, and other styles

LEMEIRE, JAN, ERIK DIRKX, and WALTER COLITTI. "MODELING THE PERFORMANCE OF COMMUNICATION SCHEMES ON NETWORK TOPOLOGIES." Parallel Processing Letters 18, no. 02 (2008): 205–20. http://dx.doi.org/10.1142/s012962640800334x.

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

A. Khan, Zaki, Jamshed Siddiqui, and Abdus Samad. "Linear Crossed Cube (LCQ): A New Interconnection Network Topology for Massively Parallel System." International Journal of Computer Network and Information Security 7, no. 3 (2015): 18–25. http://dx.doi.org/10.5815/ijcnis.2015.03.03.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Xilouris, G., A. Kourtis, and G. Stefanou. "A mesh topology DVB-S network architecture for node interconnection, featuring QoS capabilities." Computer Networks 48, no. 1 (2005): 45–56. http://dx.doi.org/10.1016/j.comnet.2004.10.005.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Liu, Cheng-Lin, and Fei Liu. "Adjacent-Compensation Consensus Algorithm in Asynchronously Coupled Form for Second-Order Multiagent Network under Communication Delay." Abstract and Applied Analysis 2014 (2014): 1–7. http://dx.doi.org/10.1155/2014/974129.

Full text

Abstract:

General asynchronously coupled consensus algorithm associated with adjacent compensations, is proposed to solve the dynamical consensus problem of second-order multiagent network with communication delay under leader-following coordination control framework. Based on frequency-domain analysis, firstly, delay-independent consensus convergence is proved for the second-order multiagent systems with a spanning tree topology that has the leader root and then delay-dependent consensus condition is obtained for the multiagent systems with communication delay under a general leader-following interconnection topology. Simulation illustrates the correctness of the results.

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!