The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The present research aims to recover network failure in networks with a complicated topology by focusing on tie-sets. A tie-set implies a set of links constituting a loop. The entire network is divided into smaller local units of tie-sets which encompass all network vertices and links. These units realize network management for quick and flexible failure recovery. This paper first introduces the concept...
Due to the harsh surroundings and violent nature of wireless sensor network (WSN) applications, the network sometimes suffers a large-scale damage that involves several nodes and would thus create multiple disjoint partitions. This paper investigates a strategy for recovering from such damage through the placement of relay nodes (RNs) and promotes a novel approach. The proposed approach opts to reestablish...
An Iterative Clustering Steiner Tree (ICST) algorithm is proposed to connect hose based VPN endpoints using a shared tree for resource optimization. Simulation results show the ICST algorithm can achieve better performance on resource utilization.
We investigate the problem of maintaining a topology with small degree as well as small diameter in a dynamic distributed system such that the system always stays connected and processes that wish to leave the system can do so quickly. Perpetual system connectivity is necessary to solve many important problems in dynamic distributed systems, including atomic broadcast and stable property detection,...
The paper investigates an impact of direct and combining collective communications models that may be critical for performance of parallel applications. Analysis provided for any given start-up time and message transfer time reveals the fastest collective communication mode in relation to the number of processing elements in 2D meshes and fat tree networks on a chip.
In recent years, due to efficient topological properties, e.g., logarithmic diameter, simple routing etc, the multi mesh of trees (MMT) topology is center of attraction for researches. The multi-mesh of trees is a hybrid network of the multi-mesh (MM) and the mesh of trees (MoT) with n ?? n mesh of trees consists of n2 processors. Prefix-computation on multi-mesh (MM) topology have been proposed with...
A new physical layer network discovery approach is proposed based on tree-model which manages to solve the multi-subnet problem. According to the theory of maximum set and a set of formula, the method transforms the multi-subnet problem to single-subnet and simplifies the difficulty of the problem. The paper also figures out the critical value of the lost ratio which presents the completeness of the...
This paper presents a novel two-dimensional DGW structure (2D_PPCT). Then a new encoding scheme is proposed, which combines permutation encoding and 2D_PPCT. Experiment shows that the new scheme not only makes full use of the structural advantages of PPCT but has high coding efficiency of permutation encoding.
In this paper we consider several problems regarding the optimal placement of storage servers in content delivery networks with tree-like topologies (paths, trees and cacti). We present several novel algorithmic solutions for locating (k+p)-centers and connected k-centers (and k-medians) in these networks, both in the continuous and the discrete cases. We comment both on the theoretical and the practical...
A novel two-dimensional IPPCT (2D_IPPCT) and a multi-dimensional IPPCT (MD_IPPCT) are presented in this paper. 2D_IPPCT structure has greater data rate. It is proved that under the circumstances of the same number of leaf nodes, the data rate of MD_IPPCT will increase to a limit with dimension number n increasing and this limit is also computed. Moreover, we prove that there exists a two dimensional...
The fat-tree is one of the most widely-used topologies by interconnection network manufacturers. Recently, a deterministic routing algorithm that optimally balances the network traffic in fat--trees was proposed. It can not only achieve almost the same performance than adaptive routing, but also outperforms it for some traffic patterns. Nevertheless, fat-trees require a high number of switches with...
As the amount of transferred data increases world-wide, network data transfers may exhibit poor performance due to resource usage conflicts, even when enough resources are available (at a different place or at another time). Thus, efficient resource management and intelligent scheduling of the data transfers are required. These problems are, however, quite difficult to solve, both from a theoretical...
With emergence of group-oriented applications needing content confidentiality, secure group communications have drawn more attention. To provide this service in large groups with highly dynamic memberships, a secure group key management efficient in key establishment and update is the foundation. In this paper, we present a join-tree-based contributory group key management (JDH) to achieve better...
We address the problem of minimizing the worst-case broadcast delay in ldquomulti-radio multi-channel multi-rate wireless mesh networksrdquo (MR2-MC WMN) in a distributed and localized fashion. Efficient broadcasting in such networks is especially challenging due to the desirability of exploiting the ldquowireless broadcast advantagerdquo (WBA), the interface-diversity, the channel-diversity and the...
The fault tolerance of the communication topology of a distributed system is a very important feature which needs to be analyzed carefully. In this paper we propose a new reliability metric for tree topologies, based on the unrestricted vertex multicut problem on trees, for which we present the first optimal linear time algorithm. We present evaluation results of the reliability metric on tree networks...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.