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 propose an adaptive routing algorithm for vertically partially connected 3D NoCs to (1) overcome failures in vertical links, and (2) find the nearest available vertical link for rerouting of packets. To track the position of each vertical link and distance to the other nodes, the proposed routing algorithm, named Advertiser Elevator, indexes each vertical link and implements a mechanism...
An opportunistic contact between two mobile devices takes place when they are within communication range of each other. Typically, cyber-physical environments comprise a number of mobile devices that are likely to make opportunistic contacts in time and space. In the recent past, researchers have exploited opportunistic links mostly for routing and content sharing. However, less attention has been...
High demands in data delivery latency and communication reliability encourage the use of fault-tolerance-enhanced all-optical WDM networks. Low latency is satisfied by setting up a direct lightpath between any communication pair to enable one-shot transmission. High reliability is met by establishing multiple disjoint lightpaths from the source to the destination. In this paper, we explore the fault-tolerance...
To improve the fault tolerance of the distributed spanning tree (DST) structure, we present an improved DST structure through orderly storing the elements in groups. Further, we give a representative selection rule, and based on which the node arrival and departure algorithms are proposed to balance the distribution of representatives in the structure. The maximal difference of the probabilities of...
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...
The design flow of network-on-chip (NoCs) include several key issues. Among other parameters, the decision of where cores have to be topologically mapped and also the routing algorithm represent two highly correlated design problems that must be carefully solved for any given application in order to optimize several different performance metrics. The strong correlation between the different parameters...
Light trails, a fairly recent optical networking architecture for LAN and MAN, and possibly WAN applications, can support both optical unicast and multicast. In this paper we consider routing both types of traffic in a survivable light trail network with multiple wavelengths. The algorithm supports multi-hop routing where traffic may use up to two light trails to reach its destination. An ILP is developed...
Efficiently discovering services in terms of diversified service constraints in a dense MANET is a challenging issue. This paper proposes to build a distributed suffix tree on backbone nodes as XML-based services?? index to provide a concise profile for service descriptions. Moreover, a content-addressable P2P overlay and corresponding fault-tolerance mechanisms are introduced to support the distributed...
Mobile nodes in some challenging network scenarios suffer from intermittent connectivity and frequent partitions e.g. battlefield and disaster recovery scenarios. Disruption tolerant network (DTN) technologies are designed to enable nodes in such environments to communicate with one another. In an earlier work, we studied information retrieval schemes for single-attribute queries in DTNs. Our schemes...
The structured P2P overlay networks with the constant degree have the efficient data location mechanism. They reduce the maintenance cost caused by nodes joining/leaving the overlay network and make the items in routing table as less as possible. An enhanced structure based on the cycloid system is proposed in this paper. It combines cycloid and folded hypercube and employs the concept of complementary...
In this paper a BISR architecture for embedded memories is presented. The proposed scheme utilises a multiple bank cache-like memory for repairs. Statistical analysis is used for minimisation of the total resources required to achieve a very high fault coverage. Simulation results show that the proposed BISR scheme is characterised by high efficiency and low area overhead, even for high defect densities...
The downsizing of transistor dimensions enabled in the future nanotechnologies will inevitably increase the number of faults in the complex ULSI chips. To maintain the production yield at acceptable level, several levels of protection mechanisms will have to be implemented to tolerate the permanent and transient faults occurring in the physical layers. In this paper, we study fault tolerance at the...
In this paper we propose a set of different configurations of failure recovery schemes, developed for network-on-chip (NoC) based systems. These configurations exploit the fact that communication in NoCs tends to be partitioned and eventually localized. The failure recovery approach is based on checkpoint and rollback and is aimed towards fast recovery from system or application level failures. The...
In this paper, we present the construction of location-based schema caching for query routing at the client-peer in super-peer networks. This cached information is used for directly routing subsequent repeated queries towards their actual resource locations without going via the super peer. Instead of storing the previous query with its result, our proposed approach caches the query with the routing...
The branch and bound (B&B) algorithm is one of the most used methods to solve in an exact way combinatorial optimization problems. In a previous article, we proposed a new approach of the parallel B&B algorithm for distributed systems using the farmer-worker paradigm. However, the new farmer-worker approach has a disadvantage: some nodes of the B&B tree can be explored by several B&B...
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.