In this paper, authors present new schemes of our proposed Global Open Ethernet (GOE) technology from a viewpoint of improving reliability in metro-area Ethernet environment and show the numerical evidence on their performance results. Although several standardized or vendor proprietary technologies are proposed to improve Ethernet reliability, they still have reliability problems in terms of long failure recovery time (due to forwarding database (FDB) flush and recovery from a root bridge failure on spanning tree protocol), broadcast storm, and packet loss in network reconfiguration. To solve these problems, we introduce three schemes, a Per Destination - Multiple Rapid Spanning Tree Protocol (PD-MRSTP), a GOE Virtual Switch Redundancy Protocol (GVSRP), and an In-Service Reconfiguration (ISR) schemes. PD-MRSTP scheme reduces the failure recovery time by eliminating the need to flush the FDB and to recover from root bridge failures. GVSRP scheme ensures the reliability of connections between a GOE domain and a legacy Ethernet domain. Combined with PD-MRSTP, GVSRP prevents broadcast storm problems due to loops in the inter-domain area. ISR scheme enables in-service bridge replacement and upgrade without packet loss. Evaluating our prototype system, we obtained the following remarkable performance results. The GOE network using PD-MRSTP scheme delivered a fast failure recovery performance (4 ms) independent of the number of MAC address entries, whereas the legacy Ethernet network took 522 ms when a bridge had 6000 MAC address entries. Since we found that the failure recovery time increased in proportion to the number of MAC address entries, the one in large carrier network having one million of MAC address entries would take several tens of seconds. Thus using PD-MRSTP can reduce failure recovery time one ten-thousandth comparing with that of legacy Ethernet. In addition, evaluation of the ISR scheme demonstrated that a network can be upgraded with zero packet loss. Therefore, a GOE-based VPN is a promising alternative to other Ethernet VPNs for its reliability and stability.

This paper studies the optimization of the effective channel capacity of wideband code division multiple access (WCDMA) systems under Rayleigh fading environments. Firstly, the results for Shannon capacity of fading channels with channel side information are reviewed, where the capacity is achieved by using an optimal power control scheme. Secondly, an optimal interference threshold is set for a given system outage probability Pout to minimize total interference. Finally, the effective channel capacity of WCDMA is defined and a target SIR level γ* is derived with the Lagrangian multiplier method to maximize the effective channel capacity. It is shown that is dependent on the power control interference ratio (PCIR) ρ, the number of diversity paths identified by the receiver M, and the outage probability of the system. Simulation results are provided to validate the theoretical deductions. We conclude that the total effective channel capacity will be maximized as long as M4, and ρ0.5 for a proper value of .

Employing noise masking threshold (NMT) to adapt a speech enhancement system has become popular due to the advantage of rendering the residual noise to perceptually white. Most methods employ the NMT to empirically adjust the parameters of a speech enhancement system according to the various properties of noise. In this article, without any predefined empirical factor, an explicit-form gain factor for a frequency bin is derived by perceptually constraining the residual noise below the NMT in spectral domain. This perceptual constraint preserves the spectrum of noisy speech when the level of residual noise is less than the NMT. If the level of residual noise exceeds the NMT, then the spectrum of noisy speech is suppressed to reduce the corrupting noise. Experimental results show that the proposed approach can efficiently remove the added noise in cases of various noise corruptions, and almost free from musical residual noise.

In this paper, we propose and analyze a scheme for wireless channels, which is the combination of an automatic repeat request (ARQ) scheme and power ramping. The power ramping is used for more reliable downlink data transmission. This technique gradually increases the transmission power at each retransmission attempt. Simulation results demonstrate that when the power step size is 0.5 dB, the average throughput gain may be as high as 2.3% to 5.4% with properly selected parameters.

A system was developed to measure the microwave power dependence of the surface resistance superconductor films. The system uses a dielectric resonator method combined with a circle fit technique and a two-mode technique to measure the microwave surface resistance of superconductor films. For validation, this system was used to measure such surface resistance for superconductor films with different surface morphologies. Significant difference in microwave power dependence of surface resistance was observed. This measurement system proved suitable for evaluating superconducting films for passive microwave devices, including high power devices such as transmitting filters.

This work proposes a distributed fault protection mechanism called the Dynamic-Shared Segment Protection (DSSP) algorithm for WDM (Wavelength Division Multiplexing) mesh networks. The objects are to assure high probability of path protection and efficient use of network resources. The proposed approach exploits the segment protection mode, which accommodates the characteristics of both path-based and link-based protections, for providing finer service granularities, to satisfy the versatile requirements of critical applications in the foreseeable future. To show that DSSP can improve performance efficiency, simulations are conducted using four networks (NSFNET, USANET, Mesh 66, Mesh 99) for a comparative study of the proposed DSSP versus ordinary shared protection schemes and SLSP (Short Leap Shared Protection). Simulation results reveal that the proposed DSSP method results in much lower blocking probability and has higher network utilization. Consequently, it is very useful for applications to a real-time WDM network, which changes status dynamically.

We consider the problem of computing the optimal swap edges of a shortest-path tree. This problem arises in designing systems that offer point-of-failure shortest-path rerouting service in presence of a single link failure: if the shortest path is not affected by the failed link, then the message will be delivered through that path; otherwise, the system will guarantee that, when the message reaches the node where the failure has occurred, the message will then be re-routed through the shortest detour to its destination. There exist highly efficient serial solutions for the problem, but unfortunately because of the structures they use, there is no known (nor foreseeable) efficient distributed implementation for them. A distributed protocol exists only for finding swap edges, not necessarily optimal ones. We present two simple and efficient distributed algorithms for computing the optimal swap edges of a shortest-path tree. One algorithm uses messages containing a constant amount of information, while the other is tailored for systems that allow long messages. The amount of data transferred by the protocols is the same and depends on the structure of the shortest-path spanning-tree; it is no more, and sometimes significantly less, than the cost of constructing the shortest-path tree.

Because fault-based attacks on cryptosystems have been proven effective, fault diagnosis and tolerance in cryptography have started a new surge of research and development activity in the field of applied cryptography. Without magnitude comparisons, the Montgomery multiplication algorithm is very attractive and popular for Elliptic Curve Cryptosystems. This paper will design a Montgomery multiplier array with a bit-parallel architecture in GF(2m) with concurrent error detection capability to protect it against fault-based attacks. The robust Montgomery multiplier array with concurrent error detection requires only about 0.2% extra space overhead (if m=512 is as an example) and requires four extra clock cycles compared to the original Montgomery multiplier array without concurrent error detection.

This paper presents a new generative approach for generating two-dimensional signals having both a low peak factor (crest factor) and a flat power spectrum. The flat power spectrum provides zero auto-correlation, except at the zero shift. The proposed method is a generative scheme, not a search method, and produces a two-dimensional signal of size 2(2n1+1)2(2n2+1)2 for an arbitrary pair of positive integers n1 and n2 without any computer search. The peak factor of the proposed signal is equal to the peak factor of a single trigonometric function.

A dielectric resonator with a gap between the top plate and the rest has been useful for measuring the penetration depth (λ) of superconductor films, a parameter essential for obtaining the intrinsic microwave surface resistance (Rs) of thin superconductor films. We investigated effects of a gap on the microwave properties of TE0ml-mode sapphire resonators with a gap between the top plate and the rest of the resonator. Regardless of a 10 µm-gap in TE0ml-mode sapphire resonators, variations of the TE0ml-mode resonant frequency on temperature (Δf0) as well as TE0ml-mode unloaded Q remained almost the same due to lack of axial currents inside the resonator and negligible radiation effects. The λ of YBa2Cu3O7-δ (YBCO) films obtained from a fit to the temperature-dependent Δf0 appeared to be 195 nm at 0 K and 19.3 GHz, which was well compared with the corresponding value of 193 nm at 10 kHz measured by the mutual inductance method. The intrinsic Rs of YBCO films on the order of 1 mΩ, and the tan δ of sapphire on the order of 10-8 at 15 K and 40 GHz could be measured simultaneously using sapphire resonators with a 10 µm-gap.

We propose the concept of an opinion model for interactive multimodal services and apply it to an audiovisual communication service. First, psychological factors of an audiovisual communication service were extracted by using the semantic differential (SD) technique and factor analysis. Forty subjects participated in subjective tests and performed point-to-point conversational tasks on a PC-based video phone that exhibited various network qualities. The subjects assessed those qualities on the basis of 25 pairs of adjectives. Two psychological factors, i.e., an aesthetic feeling and a feeling of activity, were extracted from the results. Then, quality impairment factors affecting these two psychological factors were analyzed. We found that the aesthetic feeling was affected by IP packet loss and video coding bit rate, and the feeling of activity depended on delay time, video packet loss, video coding bit rate, and video frame rate. Using this result, we formulated an opinion model derived from the relationships among quality impairment factors, psychological factors, and overall quality. The validation test results indicated that the estimation error of our model was almost equivalent to the statistical reliability of the subjective score.

Given the availability of high-speed Ethernet and HW based protocol offload, clustered systems using a commodity network fabric (e.g., TCP/IP over Ethernet) are expected to become more attractive for a range of e-business and data center applications. In this paper, we describe a comprehensive simulation to study the performance of clustered database systems using such a fabric. The simulation model currently supports both TCP and SCTP as the transport protocol and models an Oracle 9i like clustered DBMS running a TPC-C like workload. The model can be used to study a wide variety of issues regarding the performance of clustered DBMS systems including the impact of enhancements to network layers (transport, IP, MAC), QoS mechanisms or latency improvements, and cluster-wide power control issues.

Because of the development of recent broadband access technologies, fair service among users is becoming more important goal. The most promising router mechanisms for providing fair service is per-flow traffic management. However, it is difficult to implement in high-speed core routers because per-flow state management is prohibitively expensive; thus, a large number of flows are aggregated into a small number of queues. This is not an acceptable situation because fairness degrades as the number of flows so aggregated increases. In this paper, we propose a new traffic management scheme called Hierarchically Aggregated Fair Queueing (HAFQ) to provide per-flow fair service. Our scheme can adjust flow aggregation levels according to the queue handling capability of various routers. This means the proposed scheme scales well in high-speed networks. HAFQ improves the fairness among aggregated flows by estimating the number of flows aggregated in a queue and allocating bandwidth to the queue proportionally. In addition, since HAFQ can identify flows having higher arrival rates simultaneously while estimating the number of flows, it enhances the fairness by preferentially dropping their packets. We show that our scheme can provide per-flow fair service through extensive simulation and experiments using a network processor. Since the currently available network processors (Intel IXP1200 in our case) are not high capacity, we also give extensive discussions on the applicability of our scheme to the high-speed core routers.

Grid computing presents a new trend to distributed and Internet computing to coordinate large scale resources sharing and problem solving in dynamic, multi-institutional virtual organizations. Due to the diverse failures and error conditions in the grid environments, developing, deploying, and executing applications over the grid is a challenge, thus dependability is a key factor for grid computing. This paper presents a dependable grid computing framework, called DRIC, to provide an adaptive failure detection service and a policy-based failure handling mechanism. The failure detection service in DRIC is adaptive to users' QoS requirements and system conditions, and the failure-handling mechanism can be set optimized based on decision-making method by a policy engine. The performance evaluation results show that this framework is scalable, high efficiency and low overhead.

A false lock free delay-locked loop(DLL) achieving a wide frequency operation and a fine timing resolution is presented. A novel false lock detection technique is proposed to solve the trade-off between a wide frequency range and false locks. This technique enables a fine timing resolution even at a high frequency. In addition, the duty cycle of the input clock is not required to be 50%. This technique is applied to the DLLs in analog front-end LSIs of digital camera systems, with a range of 465 MHz (16) and a timing resolution of 9(40 stages).

In this letter, we study the capacity of fading channels with perfect channel side information (CSI) at the receiver and quantized CSI at the transmitter. We present a general algorithm for the joint design of optimal quantization and power control for maximizing the forward link capacity over flat fading channels. Numerical results for Rayleigh fading are given.

In this letter, a novel channel estimation method is proposed for frequency-domain equalization of OFDM systems in fast fading multipath channels. It is shown by computer simulations that the proposed method can not only estimate the channel impulse response (CIR) accurately but also achieve lower BER than conventional method at low signal-to-noise ratio (SNR).

The paper presents HiPeer, a robust resource distribution and discovery algorithm that can be used for fast and fault-tolerant location of resources in P2P network environments. HiPeer defines a concentric multi-ring overlay networking topology, whereon dynamic network management methods are deployed. In terms of performance, HiPeer delivers of number of lowest bounds. We demonstrate that for any De Bruijn digraph of degree d 2 and diameter DDB HiPeer constructs a highly reliable network, where each node maintains a routing table with at most 2d+2 entries independent of the number N of nodes in the system. Further, we show that any existing resource in the network with at most d nodes can be found within at most DHiPeer = log d(N(d-1)+d)-1 overlay hops. This result is as close to the Moore bound [1] as the query path length in other outstanding P2P proposals based on the De Bruijn digraphs. Thus, we argue that HiPeer defines a highly connected network with connectivity d and the lowest yet known lookup bound DHiPeer. Moreover, we show that any node's "join or leave" operation in HiPeer implies a constant expected reorganization cost of the magnitude order of O(d) control messages.

For alleviating the high peak-to-average power ratio (PAPR) problem of orthogonal frequency division multiplexing (OFDM), the OFDM combined with time division multiplexing (TDM) using frequency-domain equalization (FDE) was proposed. In this paper, the theoretical bit error rate (BER) analysis of the OFDM/TDM in a frequency-selective fading channel is presented. The conditional BER expression is derived, based on a Gaussian approximation of the inter-symbol interference (ISI) arising from channel frequency-selectivity, for the given set of channel gains. Various FDE techniques as in multi-carrier code division multiple access (MC-CDMA), i.e., zero forcing (ZF), maximum ratio combining (MRC) and minimum mean square error (MMSE) criteria are considered. The average BER performance is evaluated by Monte-Carlo numerical computation method using the derived conditional BER expression.

This paper presents CPPC (Controller/Precompiler for Portable Checkpointing), a checkpointing tool designed for heterogeneous clusters and Grid infrastructures through the use of portable protocols, portable checkpoint files and portable code. It works at variable level being user-directed, thus generating small checkpoint files. It allows parallel processes to checkpoint independently, without runtime coordination or message-logging. Consistency is achieved at restart time by negotiating the restart point. A directive-based checkpointing precompiler has also been implemented to ease up user's effort. CPPC was designed to work with parallel MPI programs, though it can be used with sequential ones, and easily extended to parallel programs written using different message-passing libraries, due to its highly modular design. Experimental results are shown using CPPC with different test applications.