This paper proposes cooperative coding using cyclic delay diversity (CDD) for OFDM systems. The cooperative diversity is combined with channel coding while CDD is applied to the cooperative transmission of the multiple relays to improve the beneficial effects of the cooperating relays. Analyses of frame error probability (FEP) and the average channel power of the proposed scheme are shown. Simulation results show the frame error rate (FER) of the proposed scheme. The proposed scheme provides not only a simple code design and low system complexity compared to conventional space-time processing, but better FER and diversity gain compared to direct transmission and conventional cooperative coding without CDD.

Resource performance prediction is known to be useful in resource scheduling in the Grid. The disk I/O workload is another important factor that influences the performance of the CPU and the network which are commonly used in resource scheduling. In the case of disk I/O workload time-series, the adaptation of a prediction algorithm to new time-series should be rapid. Further, the prediction should ensure that the prediction error is minimum in the heterogeneous environment. The storage workload (i.e., the disk I/O load) is a dynamic variable. A prediction parameter based on the characteristics of the current workload must be prepared for prediction purposes. In this paper, we propose and implement the OPHB (On-Line Parameter History Bank). This is a method that stabilizes the incoming disk I/O workload time-series fairly quickly with the help of accurately determined ESM (Exponential Smoothing Method) parameters. The parameters are drawn from a history database. In the case of forecasting with ESM, a smoothing parameter must be specified in advance. If the parameter is statically estimated from observed data found in previous executions, the forecasts would be inaccurate because they do not capture the actual I/O behavior. The smoothing parameter has to be adjusted in accordance with the shape of the new disk I/O workload. The ESM algorithms utilise one of the accumulated parameter histories chronicled by OPHB's Deposit operation. When a new time-series is started, an appropriate parameter value is looked up in the Bank by OPHB's Lookup operation. This is used for the time-series. This process is fully adaptive. We evaluate the proposed method with SES (Single Exponential Smoothing) and ARRSES (Auto-Responsive SES) methods.

In this paper, we propose a new subcarrier allocation algorithm for a downlink OFDMA relay network with multicells. In the proposed algorithm, subcarriers are allocated to users and relays to maximize the overall sum of the achievable rate under fairness constraints. Simulation results show that the proposed algorithm achieves higher data rate than the static algorithm and reduces the outage probability compared to the static and greedy algorithms.

Virtualization is no longer an emerging research area since the virtual processor and memory operate as efficiently as the physical ones. However, I/O performance is still restricted by the virtualization overhead caused by the costly and complex I/O virtualization mechanism, in particular by massive exits occurring on the guest-host switch and redundant processing of the I/O stacks at both guest and host. A para-virtual device driver may reduce the number of exits to the hypervisor, whereas the network stacks in the guest OS are still duplicated. Previous work proposed a socket-outsourcing technique that bypasses the redundant guest network stack by delivering the network request directly to the host. However, even by bypassing the redundant network paths in the guest OS, the obtained performance was still below 60% of the native device, since notifications of completion still depended on the hypervisor. In this paper, we propose vCanal, a novel network virtualization framework, to improve the performance of network access in the virtual machine toward that of the native machine. Implementation of vCanal reached 96% of the native TCP throughput, increasing the UDP latency by only 4% compared to the native latency.

In this letter, we propose a new resource allocation scheme for a two-way OFDM relay network with fairness constraints. To maximize sum capacity, subcarriers and their power are successively allocated to the relays based on channel conditions. Also, the power constraint is imposed on each relay to achieve fairness for the relays. Simulation results show that the proposed scheme improves sum capacity and fairness significantly.