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.
In this paper, we focus on the design of the fault-tolerant routing algorithm for the (n,k)-star graph. We apply the idea of collecting the limited global information used for routing on the n-star graph to the (n,k)-star graph. First, we build the probabilistic safety vector (PSV) with modified cycle patterns. Then, our routing algorithm decides the fault-free routing path with the help of PSV. The...
In order to provide the fault-tolerant capability of multicast communications, several multicast recovery schemes have been proposed at present. These schemes can be divided into two classes: reactive and pro-active. Reactive scheme can take longer recovery time. In result, it does not fit some real applications. In this paper, we focus on pro-active multicast recovery scheme, for example, the "dual-tree"...
The recursive dual-net is a newly proposed interconnection network for of massive parallel computers. The recursive dual-net is based on a recursive dual-construction of a base network. A k-level dual-construction for k > 0 creates a network containing (2n0)2k nodes with node-degree d0 + k, where no and do are the number of nodes and the node-degree of the base network, respectively. The recursive...
DHT-based peer-to-peer systems have been proposed in the past few years. Scalability, fault tolerance and searching speed of the DHT based P2P systems have been greatly improved in contrast to the unstructured P2P systems. These DHT-base systems have the problem of load imbalance. We present a load balancing method taking into account Zipf-like requests distribution and the impact of physical networks...
The soaring number of available online services calls for distributed architectures to promote scalability, fault- tolerance and semantics; to provide meaningful descriptions of services; and to support their efficient retrieval. Current approaches exploit either Semantic Overlay Networks (SONs) or Distributed Hash Tables (DHTs) sweetened with some ??semantic sugar.?? SONs enable semantic driven query...
A new paradigm full-connect dynamic networks on chip (FC-DYNOC), which supports the communication among modules dynamically placed on a reconfigurable device at runtime is presented in this paper. Based on the cluster theory, this structure increased the number of connections between router and process element, and the PE has the ability to select the source and the destination router for transmitting...
Fault tolerance is one of the most dominant issues facing the design of interconnection networks for large-scale multiprocessor architectures. This paper proposes a new fault tolerant routing approach for wormhole torus network. The proposed algorithm provides enough adaptability so that it is always connected as long as fault regions do not disconnect the network. In spite of the variety of fault...
A mobile ad hoc network (MANET) operates much depending on node's willingness to cooperate in the network. A node's misbehavior can have severe impact in overall network performance. One of the different kinds of misbehavior a node may exhibit is malicious packet dropping. In this paper, we focus on detecting and excluding nodes that misbehave by dropping some or all packets forwarded through them...
Nowadays 3D chips are fabricated by stacking 2D layers and manufacturing vertical links between them. In this paper we present a routing scheme suited for 3D networks-on-chip (NoCs). It is based on the reuse of existing routing schemes for 2D NoCs. Our 3D scheme is scalable and can be used with any 2D topology. The effectiveness of the scheme for intra-layer communication is given by the respective...
The Network-on-Chip (NoC) meshes are limited by the reliability constraint, which impels us to exploit the fault tolerant routing. Particularly, one of the main design issues is minimizing the loss of non-faulty routers at the presence of faults. To address that problem, we propose a new fault tolerant routing, which has the following two distinct advantages: First, it keeps a network deadlock-free...
Constructing 2D mesh topology network on chips (NoCs) without using virtual channels becomes attractive approach to building future massive multi-core computer systems because of its large amount of bandwidths, less design complexity, and less space consumption of routers. Dead lock problem on NoC is critical because it makes data transmission between nodes unreachable, and inevitable failures in...
Large-scale P2P systems typically have hundreds of thousands of peers that involve frequent dynamic activities. Empirical studies have shown that participating nodes in P2P systems are not equivalent. Such heterogeneity has been taken into account in the design of P2P systems. In this paper, to achieve better scalability and improve the routing performance of REIK, we design a novel hierarchical REIK...
In this paper we introduce a new interconnection network, the extended hypercube with cross connection denoted by EVHC(n,k).This network has hierarchical structure and it overcomes the poor fault tolerant properties of extended varietal hypercube. This network has better reliability and low time cost effective factor.
In this paper, we study the problem of constructing minimum cost multicast trees and computing multiple multicast paths. Due to the lack of redundancy in multi-path and multicast structures, the multicast routing protocols are vulnerable to the failure in ad-hoc networks. So it is the dire need to come across the fault tolerant solution. This paper proposes edge disjoint spanning tree based multicasting...
In the network of tori with faults, many fault-tolerant routing schemes have been proposed based on the fault models. Although these schemes enable the packets to bypass the fault regions without causing any deadlock in the network, they have the common shortcoming. Since all blocked packets would be misrouted on the fault ring, the fault ring would undertake heavier traffic load, which makes it be...
This paper shows packet delivery rate can be improved by adopting learning-based hybrid routing strategies when a wired network suffers from severe link disruption. The dynamics of the link disruptions complicate the routing problem; successful and stable routing operations of conventional routing approaches are hindered as the level of disruption increases. The target is to develop a robust and efficient...
Recent work has revealed a new, relatively simple and possibly cost-effective, approach to achieve combined protection of optical networks against both node and span failures. The resulting network designs use only a single set of p-cycle structures that have the same or only slightly more capacity than a corresponding optimal set of p-cycles for span protection. The new principle is based on a generalization...
Reliable storage of large amounts of data is always a delicate issue. Availability, efficiency, data integrity, and confidentiality are some features a data backup system should provide. At the same time, corporate computers offer spare disk space and unused networking resources. In this paper, we propose an intrusion-tolerant cooperative backup system that provides a reliable collaborative backup...
We study multi-robot routing problems (MR-LDR) where a team of robots has to visit a set of given targets with linear decreasing rewards over time, such as required for the delivery of goods to rescue sites after disasters. The objective of MR-LDR is to find an assignment of targets to robots and a path for each robot that maximizes the surplus, which is defined to be the total reward collected by...
In this paper, a new fault-tolerant Clos network is presented by adding extra switches and redirecting boxes in ordinary Clos network. The extra switches and redirecting boxes can improve the run time of the routing algorithm significantly when the Clos network displays few or no faults. The paper also presents a fault-tolerant routing algorithm for fault-tolerant Clos network. This algorithm employs...
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.