Search results for "Network topology"
showing 10 items of 192 documents
An Efficient Distributed Algorithm for Generating Multicast Distribution Trees
2005
Multicast transmission may use network resources more efficiently than multiple point-to-point messages; however, creating optimal multicast trees (Steiner Tree Problem in Networks) is prohibitively expensive. For this reason, heuristic methods are generally employed. Conventional centralized Steiner heuristics provide effective solutions, but they are unpractical for large networks, since they require complete knowledge of the network topology. This paper proposes a distributed algorithm for the heuristic solution of the Steiner Tree Problem. The algorithm allows the construction of effective distribution trees using a coordination protocol among the network nodes. The algorithm has been i…
Evaluation and improvement of collective flooding in WSNs with various link correlations
2015
One of the main challenges confronted by wireless sensor networks (WSNs) is to reduce energy consumption of nodes for the purpose of network lifetime extension. In the literature, many backbone based protocols such as connected dominating set (CDS) and broadcast or multicast based protocols are employed in order to improve network performance in terms of metrics like energy consumption, number of transmissions and dissemination delay. In this paper, we evaluate the performance of a recently proposed transmission protocol known as collective flooding (CF), which is based on link correlation, under various link correlation conditions. Through simulations and analyses we demonstrate that altho…
High power analysis and design of dual-mode channel filters
2009
In this paper, we present two dual-mode channel filter topologies which are able to withstand more than 600 W in Ku-Band. The two different designs (one with elliptical cavities and the other one with rectangular cavities) implement the same transfer function: four order, elliptical response centered in 12 GHz, with 40 MHz bandwidth and two transmission zeros. It is shown that the critical dimensions for the power-handling of these filters are the dimensions of the input-output irises. In fact, in order to rigorously obtain these conclusions and to reach these high-power levels (including margins), it is essential to use the advanced numerical techniques described in the paper to predict th…
Multivariate correlation measures reveal structure and strength of brain–body physiological networks at rest and during mental stress
2021
In this work, we extend to the multivariate case the classical correlation analysis used in the field of network physiology to probe dynamic interactions between organ systems in the human body. To this end, we define different correlation-based measures of the multivariate interaction (MI) within and between the brain and body subnetworks of the human physiological network, represented, respectively, by the time series of delta, theta, alpha, and beta electroencephalographic (EEG) wave amplitudes, and of heart rate, respiration amplitude, and pulse arrival time (PAT) variability. MI is computed: (i) considering all variables in the two subnetworks to evaluate overall brain–body interaction…
LaCoDa: Layered connected topology for massive data centers
2017
One of the fundamental challenges of existing data centers is to design a network that interconnects massive number of servers, and therefore providing an efficient and fault-tolerant routing service to upper-layer applications. Several solutions have been proposed (e.g. FatTree, DCell and BCube), however they either scale too fast (i.e., double exponentially) or too slow. This paper proposes a new data center topology, called LaCoDa, that combines the advantages of previous topologies while avoiding their limitations. LaCoDa uses a small node degree that matches physical restriction for servers, and it also interconnects a large number of servers while reducing the wiring complexity and wi…
Efficient Queuing Schemes for HoL-Blocking Reduction in Dragonfly Topologies with Minimal-Path Routing
2015
HPC systems are growing in number of connected endnodes, making the network a main issue in their design. In order to interconnect large systems, dragonfly topologies have become very popular in the latest years as they achieve high scalability by exploiting high-radix switches. However, dragonfly high performance may drop severely due to the Head-of-Line (HoL) blocking effect derived from congestion situations. Many techniques have been proposed for dealing with this harmful effect, the most effective ones being those especially designed for a specific topology and a specific routing algorithm. In this paper we present a queuing scheme called Hierarchical Two-Levels Queuing, designed speci…
Graph Filtering with Quantization over Random Time-varying Graphs
2019
Distributed graph filters can be implemented over wireless sensor networks by means of cooperation and exchanges among nodes. However, in practice, the performance of such graph filters is deeply affected by the quantization errors that are accumulated when the messages are transmitted. The latter is paramount to overcome the limitations in terms of bandwidth and computation capabilities in sensor nodes. In addition to quantization errors, distributed graph filters are also affected by random packet losses due to interferences and background noise, leading to the degradation of the performance in terms of the filtering accuracy. In this work, we consider the problem of designing graph filte…
Active snubber network design and implementation on the primary side of an isolated Ćuk converter realizing soft-switching for efficiency …
2008
This paper describes the process of improving the efficiency of an existing isolated DC/DC converter based on CUK topology with secondary side synchronous rectification, by means of the introduction of an active snubber network on the primary side. The snubber circuit reduces to zero the switching losses during the off-time interval of secondary SR. In particular, the efficiency improvement is due to the elimination of the primary MOSFET Coss output capacitance losses, and mainly of the reverse recovery losses on the secondary SR MOSFET. However, the insertion of the active snubber creates itself additional losses in the circuit, and therefore to measure the really introduced benefit it is …
Notice of Violation of IEEE Publication Principles<BR>An adaptive routing mechanism for P2P resource discovery
2005
The key to the usability of large-scale decentralize peer-to-peer (P2P) systems, and one of the most challenge design aspects, is efficient mechanism for distributed resource discovery. Unstructured P2P networks are very attractive because they do not suffer the limitations of centralized systems an the drawbacks of highly structured approaches. However the search algorithms are usually based on simple flooding scheme generating large loads on the network participants. In this paper to address this major limitation, we present the design an evaluation of an innovative searching protocol in unstructured P2P networks. The approach aims at dynamically adapting the network topology to peers' in…
A dynamic load-balancing algorithm for molecular dynamics simulation on multi-processor systems
1991
Abstract A new algorithm for dynamic load-balancing on multi-processor systems and its application to the molecular dynamics simulation of the spinodal phase separation are presented. The load-balancer is distributed among the processors and embedded in the application itself. Tests performed on a transputer network show that the load-balancer behaves almost ideally in this application. The same approach can be easily extended to different multi-processor topologies or applications.