Alternative Strategies for Managing Virtual Circuit Failure and Recovery in Local Area Computer Networks

A virtual circuit (or path) is a full-duplex logical connection between two processes. Two varieties of idealized virtual circuits that differ in their reliability characteristics can be distinguished: simple virtual circuits and reliable virtual circuits. Simple virtual circuits have the basic characteristic that data are transmitted across the circuit with no errors as long as the circuit is operational; however, the circuit may fail at any time. Reliable virtual circuits transmit data reliably at all times, in spite of link or processor failures: any recovery and/or reconfiguration that takes place to reconstruct a failed circuit is totally invisible to the two endpoints; any recovery and/or reconfiguration of a failed endpoint (process or processor) is invisible to the nonfailed end. A simple uniform mechanism for managing simple and reliable virtual circuits and for coping with failures of virtual circuits in a local area computer network is described. The mechanism supports the movement of Virtual circuit endpoints to different machines (as part of reconfiguration following failure, for example), and is robust with respect to the failure of any of the software components involved in the establishment and management of simple virtual circuits.     

An evaluation of error performance estimation schemes for DS1transmission systems carrying live traffic

Under the memoryless binary symmetric channel assumption, the author evaluates performance estimation schemes for DS1 transmission systems carrying live traffic. Bipolar violations, framing bit errors, and code-detected errors are commonly used to estimate bit error ratios and the respective numbers of errored seconds and severely errored seconds that are fundamental parameters in characterizing the performance of DS1 transmission systems. A basic framework based on the coefficient of variation is proposed to evaluate several estimation schemes. Serious drawbacks of the existing estimation schemes based on the superframe (D4) format are identified. A new method for estimating the number of errored seconds is proposed. A computer simulation shows that this proposed method performs much better than the conventional counting method. The performance of the cyclic redundancy check (CRC) code of the extended superframe (ESF) format is also evaluated through the use of a computer simulation model. The simulation results show that all the errored seconds are detected by the CRC code. This is a welcome feature of the code for real-time performance monitoring. Furthermore, the results suggest a new threshold of 326 CRC errors per second for determining severely errored seconds     

CFR: A cooperative link failure recovery scheme in software‐defined networks

Software‐defined networking that separates the control plane from the data plane is envisioned as a promising technology to enable resilient and flexible network management. Tolerating link failures is a fundamental problem in enhancing such network resilience in software‐defined networking. Reactive and proactive fault tolerant schemes for conventional networks may not well balance the fault recovery time and network performance, since the proactive scheme typically underutilizes resources and the reactive scheme usually incurs a longer recovery time. In this paper, we propose a cooperative link failure recovery scheme to find a fine‐grained trade‐off between resource utilization and recovery time by combining reactive and proactive methods. We formalize the problem of link failure recovery as a multiobjective optimization problem and devise a 2‐stage algorithm for it. The first stage of the algorithm guarantees connectivity restoration in an acceptable recovery interval based on fast failover feature supported in OpenFlow protocol, meanwhile it assigns virtual local area network tags to back up paths for achieving a lower memory consumption. The second stage of the algorithm guarantees the quality of service for different applications by adjusting the backup paths after rapid connectivity restoration. Extensive simulations highlight that cooperative link failure recovery scheme can satisfy both the carrier‐grade recovery requirements and quality of service requirements in terms of delay and network bandwidth.     

The case for SIMO random access in multi-antenna multi-hop wireless networks

In this paper, we demonstrate that multiple concurrent asynchronous and uncoordinated Single-Input Multiple-Output (SIMO) transmissions can successfully take place even though the respective receivers do not explicitly null out interfering signals. Hence, we propose simple modifications to the widely deployed IEEE 802.11 Medium Access Control (MAC) to enable multiple non-spatially-isolated SIMO sender-receiver pairs to share the medium. Namely, we propose to increase the physical carrier sense threshold, disable virtual carrier sensing, and enable message-in-message packet detection. We use experiments to show that while increasing the peak transmission rate, spatial multiplexing schemes such as those employed by the IEEE 802.11n are highly non-robust to asynchronous and uncoordinated interferers. In contrast, we show that the proposed multi-flow SIMO MAC scheme alleviates the severe unfairness resulting from uncoordinated transmissions in 802.11 multi-hop networks. We analytically compute the optimal carrier sense threshold based on different network performance objectives for a given node density and number of receive antennas.     

A T1 ones-density controller based on finite-statemachines

T1 clock recovery equipment requires that transmitted data not contain long sequences of 0 bits. For this reason, equipment that interfaces to T1 networks must meet a ones-density specification that ensures that 1 bit occurs frequently enough. Most schemes for meeting this specification require a substantial amount of overhead that consumes a significant portion of the available bandwidth. In this paper, and approach that meets the ones-density requirement with very little wasted bandwidth is described. Two practical coding schemes based on the approach are presented. The first, a block coding scheme, requires an overhead rate on the order of one bit per T1 frame, along with a delay of several frames. In an error-free channel, it introduces some errors, the rate of which is made acceptably low by using sufficient delay and overhead. In an errored channel, extension of errors is negligible. The second scheme, a sliding code scheme, requires an overhead rate on the order of a fraction of a bit per T1 frame, along with a delay of only several bit times. In an error-free channel, the rate of errors introduced is negligible. In an errored channel, approximately one out of every 2000 channel errors is extended into a burst, the length of which can be made acceptably low by using sufficient overhead     

A resilient star-ring optical broadcast-and-select network with a centralized multi-carrier light source

This article presents a resilient star-ring optical broadcast-and-select network with a centralized multi-carrier light source (C-MCLS). It consists of a star part network and a ring part network. Optical carriers generated by the C-MCLS are broadcast to all network nodes, which select and utilize them for data transmission. Optical carrier distribution as well as data transmission and receiving are performed in the star part network. The ring part network is for fiber failure recovery. The network resilience property enables the design of a fast distributed failure recovery scheme to deal with single and multiple fiber failures. We introduce a fiber connection automatic protection switching (FC-APS) architecture that only consists of optical couplers and 1 × 2 optical switches for each network node. Based on the FC-APS architecture, we design a distributed failure recovery scheme to recover the carriers and data affected by fiber failures. The fiber failure detection and failure recovery operations are performed by each network node independently only using its local information. We evaluate the recovery time of the distributed failure recovery scheme compared with that of the centralized one. Numerical results show that the distributed scheme greatly reduces the recovery time compared to the centralized configuration in the recoveries of both single and multiple fiber failures. Optical power loss analysis and compensation of the recovery routes in the distributed scheme are also presented. We show the required number of optical amplifiers for the longest recovery route in the distributed scheme under different numbers of network nodes and fiber span lengths.     

一种基于Openstack的虚拟机高可用方案

针对Openstack的高可用性问题,目前大部分的研究都集中在控制节点的高可用上,对于虚拟机的高可用研究较少.已有的虚拟机高可用方案存在无法适应多种故障场景、无法针对单个虚拟机粒度进行故障处理等问题.本文提出了一种基于Openstack的虚拟机高可用方案,方案使用控制组件和代理服务组件,配合不同故障的检测逻辑,实现多种...     

An Efficient Rerouting Scheme for MPLS-Based Recovery and Its Performance Evaluation

The path recovery in MPLS is the technique to reroute traffic around a failure or congestion in a LSP. Currently, there are two kinds of model for path recovery: rerouting and protection switching. The existing schemes based on rerouting model have the disadvantage of more difficulty in handling node failures or concurrent node faults. Similarly, the existing schemes based on protection switching model have some difficulty in solving problem such as resource utilization and protection of recovery path. This paper proposes an efficient rerouting scheme to establish a LSP along the least-cost recovery path of all possible alternative paths that can be found on a working path, which is calculated by the upstream LSR that has detected a failure. The proposed scheme can increase resource utilization, establish a recovery path relatively fast, support almost all failure types such as link failures, node failures, failures on both a working path and its recovery path, and concurrent faults. Through simulation, the performance of the proposed scheme is measured and compared with the existing schemes.     

High-performance coherent demodulator LSIC for wireless personalcommunications

This paper presents a high-performance coherent π/4-shift differential quaternary phase shift keying (DQPSK) demodulator (large scale integrated circuit) LSIC for the personal communication system in Japan, which is implemented on a 2-V operation 0.8-μm CMOS standard cell. The developed LSIC achieves a better bit error rate (BER) and frame error rate (FER) performance and a lower power consumption than conventional demodulators by employing new schemes: (1) a reverse-modulation carrier recovery circuit with a -π/4 phase rotator and a bandwidth-changeable carrier filter; (2) a bit timing recovery circuit using an initial bit timing estimation scheme; and (3) a fully digital orthogonal detector suitable for low power consumption. Performance evaluation confirms that the developed demodulator LSIC reduces the irreducible frame error rate by 40% and achieves an Eb/No improvement of 3 dB at an FER of 10^-1 compared with differential detection in the Rayleigh fading typical of personal communication channels     

A new carrier recovery circuit for land mobile satellitecommunication

A DCF (dual carrier filter) reverse-modulation-type carrier recovery circuit is proposed to achieve a low carrier skipping rate and satisfactory phase tracking performance for coherent detection of PSK (phase shift keying) signals in fast Rician fading channels. The proposed scheme employs both narrow and wide bandwidth carrier filters simultaneously for the reverse-modulation-type carrier recovery circuit. It is clarified by computer simulation that the Pe performance of a QPSK (quadriphase shift keying) modem employing the proposed scheme shows an improvement of 1.5 dB in required E_s/N_O at Pe=10⁴ (after Viterbi decoding (R=7/8, K=7), C/M (direct-to-multipath signal power ratio)=10 dB, interleaving size=64×64), compared with conventional coherent detection employing the reverse modulation tank-limiter scheme or the Costas loop scheme     

Determination of transistor infant failure probability in InGaP/GaAs heterojunction bipolar technology

A novel circuit for measuring the infant mortality rate in InGaP/GaAs HBT Technology is presented. The circuit allows reliability stressing to be performed on as many as 100,000 transistors per wafer and is necessary in order to predict the infant circuit failure rate in circuits with >500 transistors without costly burn-in screens. This new circuit allows for the rapid identification of failed transistors and subsequent failure analysis to allow for process improvements. A variation of the same circuit has also been used to estimate the activation energy, E_a, of the infant failure mechanism. Rough estimates of E_a indicate that the infant failure mechanism is 0.5 eV, and that there may be two distinct failure mechanisms responsible for infant failures. Process defects have not been found on the vast majority of failed transistors, and there is good correlation between the substrate dislocation density and the infant failure rate. We have concluded that substrate dislocations are the leading cause of infant mortality in our HBT process.     

Diverse Path Routing with Interference and Reusability Consideration in Wireless Mesh Networks

Multipath routing has been extensively employed in wireless mesh networks (WMNs) for providing network reliability and survivability, therefore, improves energy consumptions. To provide network survivability, each user should be protected against failures, either node or link failures. For each request, a primary path is set up for normal transmission, and an alternate path (protection path) should also be provided to protect the request in case of network failure. In this paper, we study how to provide survivability using multi-path scheme for dynamic network traffic, where users’ requests have random arrival times. Compared with previous work, our scheme considers interference and reusability factors when providing multiple paths for each request. By applying our scheme, the numerical results show that we can accommodate about 17% more requests than previous schemes. Meanwhile, the results show that our scheme not only accommodates more requests, but also takes less running time to find a solution for each request.     

Three-state synchronization of distributed sample scramblers in thepresence of errors

In this paper, we consider the behaviors and performances of the three-state-based synchronization mechanisms of DSS in the errored environment. We establish a mathematical model to describe the synchronization mechanisms by employing the sequence space theory, and discuss the behaviors of the two different three-state synchronization schemes-the ITU-T recommended thresholded-counting scheme and the newly proposed windowed-observation scheme. We consider the design guidelines for the synchronization schemes, and finally compare their performances in the cell-based ATM     

Improved ICMA/CD protocol in packet mobile radio networks

An improved idle-signal casting protocol that exploits a collision reduction scheme and a concept of the virtual time protocol simultaneously is proposed and its performance is analysed. Compared to the existing nonpersistent, 1-persistent and virtual time schemes, the proposed protocol exhibits higher throughput and lower packet failure probability.<>     

Hybrid ARQ schemes for point-to-multipoint communication overnonstationary broadcast channels

Hybrid automatic-repeat-request (ARQ) error control schemes make use of both error detection and error correction in order to achieve high throughput and low undetected error probabilities on two way channels. Two hybrid ARQ schemes, termed hybrid go-back-N (HGB- N) and hybrid selective-repeat (HSR), are proposed for point-to-multipoint communications over broadcast channels. Both schemes incorporate a concatenated code for error correction and error detection. The performance study of the hybrid schemes is based on a two-state Markov model of a burst noise channel. An analytic solution is derived for the throughput efficiency of the HSR scheme, while approximations and computer simulation are used to evaluate the throughput efficiency of the HGB-N scheme. It is shown that the schemes perform considerably better than the corresponding pure ARQ schemes in which a block code is used for error detection only, especially in environments with a large number of receivers and large channel roundtrip delays, such as satellite broadcast links     

An online cost-efficient protection scheme for quick recovery in all-optical WDM mesh networks

Since a single fiber carries a huge amount of data in optical WDM networks, a fiber cut even for a brief period is a very serious event. Designing schemes to prevent disruption of user traffic and recovery techniques from failures is thus an important area of research. Since a single fiber cut is the most common type of fault, in this paper we address the problem of protecting all-optical WDM mesh networks from single link failure. Our proposed online protection scheme is an improvement over an existing approach and is not only cost-efficient in terms of network resource consumption but can also provide quick recovery from a link failure. We first provide an ILP formulation for the problem and then propose a heuristic solution iStreams that can provide near-optimal solution in polynomial time. Performance comparisons with some well-known schemes of protection show that our heuristic algorithm can be a better choice for conserving resource while providing quick recovery from a link failure.     

Fault tolerance mechanisms for virtual data center architectures

A virtual data center (VDC) is a combination of interconnected virtual servers hosted on a physical data center that hosts multiple such VDCs. This enables efficient sharing of the data center’s resources while handling dynamic resource requirements of the clients. The SecondNet architecture (Guo et al. in Proceedings of ACMSIGCOMM conference on data communication, Barcelona, pp 63–74, 2009) realizes this VDC concept and includes a centralized VDC resource-mapping (virtual to physical) algorithm. Fault tolerance is an important requirement in data center-based services, in order to increase reliability and availability. In this paper, we propose a fault tolerance mechanism to handle server failures by efficiently migrating the virtual machines (VMs) hosted on the failed server to a new location. Using our mechanism, it is shown that recovery from all the faults is possible, even for a server utilization of 90 %. In order to reduce the impact of server failures on the VDCs hosted in the data center, we then present a new load balancing scheme based on clustering that efficiently allocates the VDCs on the data center. Using this scheme, we were able to reduce the affected number of VMs per server failure by 63 %, in case of a BCube network of size 625 nodes, and by 86 %, in case of a BCube network of size 1,296 nodes.     

Fast fault-tolerant digital convolution using a polynomial residuenumber system

A fault-tolerant convolution algorithm that is an extension of residue-number-system fault-tolerance schemes applied to polynomial rings is described. The algorithm is suitable for implementation on multiprocessor systems and is able to concurrently mask processor failures. A fast algorithm based on long division for detecting and correcting multiple processor failures is presented. Moduli polynomials that yield an efficient and robust fast-Fourier transform (FFT)-based algorithm are selected. For this implementation, a single fault detection and correction is studied, and a generalized-likelihood-ratio test is applied to optimally detect system failures in the presence of computational noise. The coding scheme is capable of protecting over 90% of the computation involved in convolution. Parts not covered by the scheme are assumed to be protected via triple modular redundancy. This hybrid approach can detect and correct any single system failure with as little as 70% overhead, compared with 200% needed for a system fully protected via modular redundancy     

6.7~7.9GHz UWB室内定位接收机射频端设计

针对超宽带室内定位接收系统,提出了一种新颖的、易实现的非相干检测数模混合结构的接收方案,分析了电路射频端的实现与性能,给出了仿真结果。与其他接收方案相比,该方案采用可控积分检测电路作为系统的A/D转换部分,除了完成信号的检测外,还实现了射频电路与数字基带电路的完美结合,解决了超宽带信号采样率高的难题。同时设计了该积分检测电路的实物,通过实物的测试验证了该电路具备良好的性能。     

A 1 Gbit synchronous dynamic random access memory with anindependent subarray-controlled scheme and a hierarchical decodingscheme

A prototype 1 Gbit synchronous DRAM with independent subarray-controlled isolation and hierarchical decoding schemes is demonstrated to alleviate the difficulties encountered in high-density devices with regard to failure analysis and performance optimization. The scheme to isolate memory arrays from “hard” defects and to overcome the dc leakages of “soft” defects with external sources allows monitoring of the leakage current for the defect analysis and testing of the device without being limited by the capabilities of on-chip voltage sources. A hierarchical decoding scheme with a dynamic CMOS series logic predecoder achieves improvements in circuit speed, power, and complexity. As a result, evaluation of the prototype devices can be facilitated, and the optimized circuit schemes achieve enhanced circuit performance. A fully working 1 Gbit synchronous DRAM with a chip size of 570 mm² was fabricated using a 0.16 μm CMOS process and tested for excellent functionality up to 143 MHz