Performance modeling of fault-tolerant circuit-switched communication networks

Circuit switching (CS) has been suggested as an efficient switching method for supporting simultaneous communications (such as data, voice, and images) across parallel systems due to its ability to preserve both communication performance and fault-tolerant demands in such systems. In this paper we present an efficient scheme to capture the mean message latency in 2D torus with CS in the presence of faulty components. We have also conducted extensive simulation experiments, the results of which are used to validate the analytical mode

Software-based fault-tolerant routing algorithm in multidimensional networks

Massively parallel computing systems are being built with hundreds or thousands of components such as nodes, links, memories, and connectors. The failure of a component in such systems will not only reduce the computational power but also alter the network's topology. The software-based fault-tolerant routing algorithm is a popular routing to achieve fault-tolerance capability in networks. This algorithm is initially proposed only for two dimensional networks (Suh et al., 2000). Since, higher dimensional networks have been widely employed in many contemporary massively parallel systems; this paper proposes an approach to extend this routing scheme to these indispensable higher dimensional networks. Deadlock and livelock freedom and the performance of presented algorithm, have been investigated for networks with different dimensionality and various fault regions. Furthermore, performance results have been presented through simulation experiments

On quantifying fault patterns of the mesh interconnect networks

One of the key issues in the design of Multiprocessors System-on-Chip (MP-SoCs), multicomputers, and peerto- peer networks is the development of an efficient communication network to provide high throughput and low latency and its ability to survive beyond the failure of individual components. Generally, the faulty components may be coalesced into fault regions, which are classified into convex and concave shapes. In this paper, we propose a mathematical solution for counting the number of common fault patterns in a 2-D mesh interconnect network including both convex (|-shape, | |-shape, ý-shape) and concave (L-shape, Ushape, T-shape, +-shape, H-shape) regions. The results presented in this paper which have been validated through simulation experiments can play a key role when studying, particularly, the performance analysis of fault-tolerant routing algorithms and measure of a network fault-tolerance expressed as the probability of a disconnection

Low complexity interference aware distributed resource allocation for multi-cell OFDMA cooperative relay networks

In this paper we focus on the subcarrier allocation for the uplink OFDMA based cooperative relay networks. Multiple cells were considered, each composed of a single base station (destination), multiple amplify and forward (AF) relay stations and multiple subscriber stations (sources). The effects of inter-cell interference (ICI) have been considered to optimize the subcarrier allocation with low complexity. The optimization problem aims to maximize the sum rate of all sources and at the same time maintain the fairness among them. Full channel state information (CSI) is assumed to be available at the base station. In the proposed algorithm the subcarrier allocation is performed in three steps; firstly the subcarriers are allocated to the Relay Stations (RSs) by which the received ICI on each RS is minimized. Then, the pre-allocated subcarriers are allocated to subscribers to achieve their individual rate requirements. Finally the remaining subcarriers are allocated to subscribers with the best channel condition to maximize the total sum of their data rates. The results show that the proposed algorithm significantly reduces the complexity with almost the same achievable rate of the optimal allocation in a single cell case. In case of multi-cell, the proposed algorithm outperforms the conventional algorithm in terms of total network achievable data rate and overall network complexity. ©2010 IEEE

Error exponent of amplify and forward relay networks in presence of I.I.D. interferers

© 2014 IEEE. In this paper, we derive the random coding error exponent of amplify-and-forward (AF) relay networks in presence of arbitrary number of independent and identically distributed (i.i.d.) interferers both at the relay and the destination. Multiuser networks are common examples of interference limited networks. We derive the ergodic capacity of the network and present simulation results on the performance of the network where we compare the capacity and error exponent performance of interference limited networks with noise limited networks. Numerical results show that noise limited networks outperform interference limited networks even when only a very few interferers exist in the network

Investigation and modelling of traffic issues in immersive audio environments

Copyright © 2004 IEEEA growing area of technical importance is that of distributed virtual environments for work and play. For the audio component of such environments to be useful, great emphasis must be placed on the delivery of high quality audio scenes in which participants may change their relative positions. In this paper we describe and analyze an algorithm focused on maintaining relative synchronization between multiple users of such an environment and examine the subjective quality of service achieved

An Efficient Opportunistic Cooperative Diversity Protocol for IEEE 802.11 Networks

Opportunistic cooperation promises to enhance the user experience when streaming media over wireless devices by improving wireless network reliability at the link level. This paper presents DAFMAC, an efficient cooperative diversity partner selection algorithm for IEEE 802.11 devices. Simulation results show DAFMAC provides a significantly higher transmission reliability in poor channel conditions than traditional ARQ techniques without modifying the device hardware. Further analysis shows the low overhead of DAFMAC makes it highly competitive with other proposed cooperative retransmission mechanisms in an ad-hoc network

An analytical model of pipelined circuit switching in hypercubes in the presence of hot spot traffic

Several recent studies have revealed that PCS can provide superior performance characteristics over wormhole switching under uniform traffic. Analytical model of PCS for common networks (e.g., hypercube) under uniform traffic pattern have recently been reported in the literature. In this paper we propose an analytical model of PCS in the hypercube network augmented with virtual channel in the presence of hot spot traffic. The model has a good agreement with simulation experiments

Nonlinear Vibrational Analysis of Nanobeams Embedded in an Elastic Medium including Surface Stress Effects

Due to size-dependent behavior of nanostructures, the classical continuum models are not applicable for the analyses at this submicron size. Surface stress effect is one of the most important matters which make the nanoscale structures have different properties compared to the conventional structures due to high surface to volume ratio. In the present study, nonlinear free vibrational characteristics of embedded nanobeams are investigated including surface stress effects. To this end, a thin surface layer is assumed on the upper and lower surfaces of the cross section to separate the surface and bulk of nanobeams with their own different material properties. Based on harmonic balance method, closed-form analytical solution is conducted for nonlinear vibrations to obtain natural frequencies of embedded nanobeams with and without considerations of surface elasticity and residual surface tension effects corresponding to the various values of nondimensional amplitude, elastic foundation modulus, and geometrical variables of the system. Selected numerical results are given to indicate the influence of each one in detail