Performance of terahertz channel with multiple input multiple output techniques

Terahertz (THz) communication is being considered as a potential solution to mitigate the demand for high bandwidth. The characteristic of THz band is relatively different from present wireless channel and imposes technical challenges in the design and development of communication systems. Due to the high path loss in THz band, wireless THz communication can be used for relatively short distances. Even, for a distance of few meters (>5m), the absorption coefficient is very high and hence the performance of the system is poor. The use of multiple antennas for wireless communication systems has gained overwhelming interest during the last two decades. Multiple Input Multiple Output (MIMO) Spatial diversity technique has been exploited in this paper to improve the performance in terahertz band. The results show that the Bit Error Rate (BER) is considerably improved for short distance (<5m) with MIMO. However, as the distance increases, the improvement in the error performance is not significant even with increase in the order of diversity. This is because, as distance increases, in some frequency bands the signal gets absorbed by water vapor and results in poor transmission. Adaptive modulation scheme is implemented to avoid these error prone frequencies. Adaptive modulation with receiver diversity is proposed in this work and has improved the BER performance of the channel for distance greater than 5m.     

Analysis of input and output queueing for nonblocking ATM switches

A switch model for ATM networks is analyzed. Its interconnection network is internally nonblocking and is provided with dedicated input and output queues, one per switch inlet and one per switch outlet. The switch operates with an internal speed-up: more than one packet per slot can be transferred from the head-of-line positions of the input queues to each output queue by the interconnection network. Two different operation modes are considered for the interaction between input and output queues: backpressure mode and queue loss mode. The analytical model developed for the evaluation of the switch performance under random traffic assumes an infinite size for the switch, arbitrary values for input and output queue size, as well as for the speed-up factor. Switch throughput, packet delay and loss performance are evaluated and the analytical model accuracy is assessed using computer simulation results     

Matching output queueing with a combined input/output-queued switch

The Internet is facing two problems simultaneously: there is a need for a faster switching/routing infrastructure and a need to introduce guaranteed qualities-of-service (QoS). Each problem can be solved independently: switches and routers can be made faster by using input-queued crossbars instead of shared memory systems; QoS can be provided using weighted-fair queueing (WFQ)-based packet scheduling. Until now, however, the two solutions have been mutually exclusive-all of the work on WFQ-based scheduling algorithms has required that switches/routers use output-queueing or centralized shared memory. This paper demonstrates that a combined input/output-queueing (CIOQ) switch running twice as fast as an input-queued switch can provide precise emulation of a broad class of packet-scheduling algorithms, including WFQ and strict priorities. More precisely, we show that for an N×N switch, a “speedup” of 2-1/N is necessary, and a speedup of two is sufficient for this exact emulation. Perhaps most interestingly, this result holds for all traffic arrival patterns. On its own, the result is primarily a theoretical observation; it shows that it is possible to emulate purely OQ switches with CIOQ switches running at approximately twice the line rate. To make the result more practical, we introduce several scheduling algorithms that with a speedup of two can emulate an OQ switch. We focus our attention on the simplest of these algorithms, critical cells first (CCF), and consider its running time and implementation complexity. We conclude that additional techniques are required to make the scheduling algorithms implementable at a high speed and propose two specific strategies     

Matching output queueing with a multiple input/output-queued switch

We have previously proposed an efficient switch architecture called multiple input/output-queued (MIOQ) switch and showed that the MIOQ switch can match the performance of an output-queued switch statistically. In this paper, we prove theoretically that the MIOQ switch can match the output queueing exactly , not statistically, with no speedup of any component. More specifically, we show that the MIOQ switch with two parallel switches (which we call a parallel MIOQ (PMIOQ) switch in this paper) can provide exact emulation of an output-queued switch with a broad class of service scheduling algorithms including FIFO, weighted fair queueing (WFQ) and strict priority queueing regardless of incoming traffic pattern and switch size. To do that, we first propose the stable strategic alliance (SSA) algorithm that can produce a stable many-to-many assignment, and prove its finite, stable and deterministic properties. Next, we apply the SSA algorithm to the scheduling of a PMIOQ switch with two parallel switches, and show that the stability condition of the SSA algorithm guarantees for the PMIOQ switch to emulate an output-queued switch exactly. To avoid possible conflicts in a parallel switch, each input-output pair matched by the SSA algorithm must be mapped to one of two crossbar switches. For this mapping, we also propose a simple algorithm that requires at most 2N steps for all matched input-output pairs. In addition, to relieve the implementation burden of N input buffers being accessed simultaneously, we propose a buffering scheme called redundant buffering which requires two memory devices instead of N physically-separate memories. In conclusion, we demonstrate that the MIOQ switch requires two crossbar switches in parallel and two physical memories at each input and output to emulate an output-queued switch with no speedup of any component.     

Performance study of an input and output queueing ATM switch with a window scheme and a speed constraint

In this paper, we study the performance of an input and output queueing switch with a window scheme and a speed constraint. The performance of a non-blocking ATM switch can usually be improved by increasing the switching speed. Also, the performance of a switch can be improved using a window scheme by relaxing the first-in-firstout (FIFO) queueing discipline in the input queue. Thus, one can expect that a combined scheme of windowing and a speed constraint can improve further the performance of the packet switch. Here, we analyze the maximum throughput of the input and output queueing switch with a speed constraint combined with windowing, and show that it is possible to obtain high throughput with a small increment of speed-up and window size. For analysis, we model the HOL queueing system as a virtual queueing system. By analyzing the dynamics of HOL packets in this virtual queueing model, we obtain the service probability of the HOL server as a function of output contention capabilities. Using the result, we apply the flow conservation relation to this model and obtain the maximum throughput. The analytical results are verified by simulation.     

New directions in the evaluation of voice input/output systems

A review of new directions in the evaluation of voice input/output systems is presented. Furthermore, recent studies on human factor aspects involved in speech communication are examined, with the idea that human factors research can improve current voice input/output devices and help to experimentally determine implementation guidelines for developing voice interface design     

Head of the line arbitration of packet switches with combined input and output queueing

A single-stage non-blocking N × N packet switch is considered. Data units may be stored before switching at the inputs as well as after switching at the outputs. Some output buffering capacity is intended to achieve high throughput, whereas an additional input buffering capacity keeps losses due to input-buffer overflow reasonably low. The paper studies the impact on performance of the head of the line arbitration policy, i.e. the sequence which is used to transfer data units from the heads of input queues to each output queue. The investigation is based on two performance measures: the average delay and the maximum throughput of the switch. Closed-form expressions for the FCFS, LCFS and the ROS policies are obtained. The result of the average delay with the FCFS policy leads to a lower bound, and that with the LCFS policy to an upper bound for the average delay, corresponding to an arbitrary symmetric policy which does not use information related to the state of the input queues. It is shown that the maximum throughput does not depend on the head of the line arbitration policy. It depends only on the output-buffer size and the packet-size distribution. The cases of fixed and exponentially distributed packet sizes are studied. The effects of asymmetric policies which result in different behaviours of some of the input queues is also considered.     

Analysis of non-uniform cell destination distribution in virtual output queueing systems

We develop a discrete-time analytical queueing model for studying the performance of input-queued switches with non-uniform cell destination distribution. Virtual output queues are assumed at the ingress ports where cell arrivals are geometrically distributed and the service process is based on a work conserving random selection scheme. We consider the conditions for stability as basis for deriving closed-form expressions for the stationary queue size distributions from which the mean queue sizes and mean cell latencies are derived. We show that a very good agreement is obtained between simulation and analytical results.     

Fast scheduling algorithm for input and output buffered ATM switchwith multiple switching planes

A new scheduling method is presented, two-dimensional round-robin scheduling with multiple selections (2DRRMS), for an input and output buffered ATM switch. In the switch, both input and output ports are divided into several groups and multiple switching planes are used. In the 2DRRMS method the multiple cells for transfer to an input buffer module are selected and the switching planes which the selected cells are to use in the transmission are concurrently determined     

A three-dimensional MEMS optical switching module having 100 input and 100 output ports

This paper describes an optical switching module based on microelectromechanical systems (MEMS) two-axis tilt mirror arrays and low-cost highly accurate free-space optics. The MEMS mirror arrays are integrated on single-crystal silicon wafers and provide reliable switching operation at a low driving voltage. The free-space optics consists of two-dimensional optical fiber and microlens arrays based on low-cost and highly accurate polymer-based components. They provide a compact switching module (approximately 80/spl times/60/spl times/35 mm [170 cc]) and are assembled passively by using dowel pins. A prototype switch module with 100-ch optical fiber I/O has a low coupling loss of 4.0 dB, a low crosstalk within -60 dB, and switching time of 3 ms.     

Optimal input for stochastic linear discrete systems as a function of input and output variables

An asymptotically optimal input for a plant disturbed by coloured noise is obtained directly in terms of input and output variables.     

Partial input/output decoupling in time-delay control systems

The decoupling problem is considered for a class of multi-input multi-output time-delay systems, the parameters of which do not satisfy the conditions for total decoupling, i.e. the conditions for decouplin all input/output pairs. It is shown that in this case it is possible to decouple number of input/output pairs equal to the rank of the decoupling matrix. The partial decoupling procedure is illustrated by means of an example.     

Performance study of ATM multicast switching systems

We evaluate the performance of an N × N ATM discrete time multicast switch model with input queueing operating under two input access disciplines. First we present the analysis for the case of a purely random access discipline and subsequently we concentrate on a cyclic priority access based on a circulating token ring. In both cases, we focus on two HOL (head-of-line) packet service disciplines. Under the first (one-shot transmission discipline), all the copies generated by each HOL packet seek simultaneous transmission during the same time slot. Under the second service discipline (call-splitting), all HOL copies that can be transmitted in the same time slot are released while blocked copies compete for transmission in subsequent slots. In our analysis the performance measures introduced are the average packet delay in the input buffers as well as the maximum throughput of the switch. A significant part of the analysis is based on matrix geometric techniques. Finally, numerical results are presented and compared with computer simulations.     

Analysis of a composite performance reliability evaluation for Markovian queueing systems

This paper considers analytical techniques for the evaluation of reliability, availability and combined performance and reliability measures. Markov models are common tools for system reliability evaluation. In this paper, we first compute the state probabilities of Markov model behaviour. We then investigate expected values of interval availability measures. The method is simple and easy to implement, yet very effective in dealing with the problem of computer systems.     

Performance evaluation of hierarchical cellular CDMA networks with soft handoff queueing

We consider hierarchical cellular code-division multiple-access networks supporting soft handoff, where users with different mobility are assigned to different layers, i.e., microcells in the lower layer are used to carry slow users, whereas macrocells in the upper layer are for fast users, and handoff queues are provided for handoff calls that cannot obtain the required channel immediately, so that forced termination probability can be reduced. According to whether handoff queues are provided in microcells and/or macrocells, four different call admission control schemes are proposed and studied. We derive the mathematical model of the considered system with multidimensional birth-death process and utilize Gauss-Seidel iterative method to find the steady-state probability distribution and thus the performance measures of interest: new call blocking probability, handoff failure probability, and forced termination probability. Analytical results show that providing handoff queues in both microcells and macrocells can achieve largest performance improvement. Furthermore, handoff queue size greater than a threshold is shown to have little effect on performance measures of interest. Last but not least, the studied two-tier system is compared with a one-tier counterpart. It is shown that the two-tier system performs better in terms of average number of handoffs per fast call.     

Performance evaluation of throughput in optical burst switching

Optical burst switching (OBS) provides a promising solution to utilize the huge terahertz bandwidth of optical wavelength division multiplexing (WDM) transmission technology. To exploit this bandwidth, several reservation schemes have been proposed that include just‐in‐time (JIT) signaling, just‐enough‐time (JET) signaling and burst segmentation (BS). It is necessary to investigate the performance of these schemes under the same constraints for a prescribed OBS application. Accordingly, in this paper, we analyzed and compared the performance of JIT, JET and BS techniques under various scenarios such as network size, delay variation and load variation in an OBS network using various performance metrics, such as the offset time and switch configuration time. Also, the performance of the network under various switching delays was also investigated. The modified BS reservation scheme has been found to yield significantly better performance and better throughput compared with the JIT and JET reservation schemes. Test results show that the effect of varying loads as well as delays significantly impacts the performance of the OBS network. The results presented in this paper are expected to lead further performance improvements in OBS networks using the BS reservation scheme. Copyright © 2010 John Wiley & Sons, Ltd.     

Improved queueing analysis of shared buffer switching networks

The authors describe several methods for analyzing the queueing behavior of switching networks with flow control and shared buffer switches. They compare the various methods on the basis of accuracy and computation speed, where the performance metric of most concern is the maximum throughput. The best of the methods accurately predicts throughput for multistage networks constructed from large switches (⩾8 ports)     

Performance comparisons of restoration techniques in optical burst switching networks

This paper describes restoration techniques for OBS networks. First, we introduce the design issues to be essentially considered, when restoration techniques will be built into OBS networks. Second, considering the design issues, we propose a novel restoration model named “Recover-Then-Reserve,” which can enhance the restoration performance. Third, we develop a simulator using the NS-2 platform to verify the performance of the restoration techniques (path, link, and sub-path) designed by each restoration model (GMPLS-based OBS restoration and our proposal). Performance is evaluated on the following metrics: restoration success rate, restoration time, connection availability, and burst loss probability. The effects of the failure frequency and the number of the restoration attempts on the restoration performance are also investigated. Our experiments show that the proposal can reduce the restoration time by about 25 ms compared to the GMPLS-based OBS restoration model. Also, path restoration technique has better performance than link and sub-path restoration techniques because it has the highest restoration success rate, allowing similar restoration time. Our experiments also show that the more the restoration attempts made and the less the failure frequency becomes, the better the restoration performance obtained.

Observer-based digital control of sampled-data systems with input/output time delays

Using asynchronous initial sampling with different sampling rates in the input and output terminals, a novel observer-based digital control law for sampled-data systems is proposed, which can cope with the presence of time delays in input acquisition and output sampling.This work was supported by the National Science Council of the Republic of China under grant NSC 89-2213-E-269-002 and by the Far East College.     

Performance analysis of multi‐input multi‐output systems with maximum likelihood detection over shadowed fading channels

Multiple‐input multiple‐output (MIMO) transmission techniques constitute an important technology in modern wireless communication. Hence, performance analysis methods for such systems are of considerable interest. This paper considers first the average pairwise error probability for uncoded MIMO systems employing maximum likelihood detection over a composite Rayleigh‐Lognormal fading channel with spatial correlation. It provides general results, applicable also to a wider class of shadowing models, concerning asymptotical diversity gains and shows that they are not changed by such shadowing. Then, analytical evaluation techniques for bit‐error‐rate (BER) over composite Rayleigh‐Lognormal fading channels, based on the truncated union bound and the transfer function, are considered. Furthermore, these techniques are modified for applications over spatially correlated channels. This paper shows that such performance evaluation techniques provide good approximations to BER of spatially uncorrelated MIMO systems and also in the presence of moderate spatial correlation, over Rayleigh‐Lognormal fading channels. Copyright © 2013 John Wiley & Sons, Ltd.