This paper analytically studies performance improvement achieved by packet dispersion. Contrary to the previous work on packet dispersion, we consider the tail distribution of queue length and that of packet delay as performance measures, and we model a packet network as multiple parallel queues where the arrival processes from sources are not renewal but highly bursty. To appropriately evaluate the performance improvement achieved by packet dispersion, we develop approximate formulas to estimate the tail distributions. Our approximate formulas yield more accurate estimations than the standard approximate formulas. In the numerical results, we observe that packet dispersion can greatly improve the delay performance of packets. We also see that packet-level load balancing is superior to flow-level load balancing for any distribution ratio.

A novel dual band transmitter module for 2.4 GHz and 5.8 GHz wireless LAN applications with adaptive digital predistortion linearization is presented. The module operates either as a power amplifier for 2.4 GHz or frequency doubler for 5.8 GHz band. Amplification gain is 12.9 dB at 2.4 GHz and multiplication gain is 3.3 dB at 5.8 GHz. At 2.4 GHz band, the second harmonic is about 36.5 dB lower than the fundamental, and the 2.9 GHz fundamental signal is 20.3 dB lower than the second harmonic output at 5.8 GHz operation. An adaptive digital predistortion scheme is proposed to linearize the 2.4 GHz amplifier, and to get the proper 5.8 GHz band wireless LAN signal. The 2.4 GHz amplifier with predistortion satisfies the ACPR mask requirement for the input 1 dB compression power of 5 dBm and the linearized frequency doubler shows 26 dB ACPR improvement at 11 MHz offset from center frequency by using the proposed predistortion linearization. The frequency doubler output spectrum with predistortion does meet the IEEE standard Tx mask.

Wavelength division multiplexing (WDM) technology offers the capability of building wide-area networks with high speed. Reconfigurability is a key feature of a WDM network that enables the network logical topology to change dynamically in response to the changing traffic patterns. There are two important issues involved in the reconfiguration of a network logical topology. One is how to determine the new logical topology corresponding to the current topology. It needs to consider a trade-off between the performance of the new target topology and the cost of the topology transition from the current topology to the new one. The other is how to determine the transition sequence from the current topology to the new one. It needs to control the disruption to the network as less as possible during the reconfiguration process. In this paper, we focus on the latter problem and propose several heuristic algorithms that reconfigure logical topologies in wide-area wavelength-routed optical networks. Our reconfiguration algorithms attempt to control the disruption to the network as less as possible during the reconfiguration process. For this purpose, a lightpath is taken as the minimum reconfiguration unit. The proposed algorithms are evaluated by using an NFSNET-like network model with 16 nodes and 25 links. The results show that very simple algorithms provide very small computational complexity but poor performance, i.e., large network disruption, and that an efficient algorithm provides reasonable computational complexity and very good performance. More complex algorithms may improve performance somewhat further but have unrealistically large computational complexity.

Micromobility management is a key issue for the deployment of broadband mobile communication services. The packet loss during handover and the handover latency need to be minimized to maintain the high quality of these services. We have previously proposed a mobility management scheme that addresses this issue in wide-area mobile networks that employed hierarchical multiple mobility management routers (Mobility Anchor Points or MAPs). Our scheme directs a Mobile Terminal (MT) to a suitable MAP to fully minimize packet loss during handover, and handover latency of the MTs. In our previous work, we confirmed the effectiveness of our scheme using a simple tree network. Actual networks however, always have densely meshed topologies to provide some redundancy for the elimination of single points of failure. In such networks, it is difficult to deduce the relationships between the MAPs, and this makes it difficult for our scheme to select a suitable MAP for an MT, because the selection is performed using both the MT's smoothed speed and the relationships existing between the MAPs located above the Access Router (AR), to which the MT is connected. In this paper, we propose a method to overcome this problem, by autonomously adjusting the selection criteria that are individually configured for use at a particular AR, and we evaluate this method using simulation experiments. The results show that our mobility management scheme works well in densely meshed networks using the proposed additional method.

The EDD connection admission control scheme has been proposed for supporting real-time communication in packet-switched networks. In the scheme, when a connection establishment request occurs, the worst-case link delay in each link along the connection is calculated to determine whether the request can be accepted or not. In order to calculate the worst-case link delay, we must perform a check called the point schedulability check for each of some discrete time instants (checkpoints). Therefore when there are many checkpoints, the worst-case link delay calculation is time-consuming. We have proposed a high-speed calculation method. The method finds some checkpoints for which the point schedulability check need not be performed and removes such unnecessary checkpoints in advance before a connection establishment request occurs, and the check is performed for each of the remaining checkpoints after the request occurs. However, the method is not so effective under the situation that the maximum packet length in networks is large, because the method can find few unnecessary checkpoints under the situation. This paper proposes a new high-speed calculation method. We relax the condition which determines whether or not the point schedulability check need not be performed for each checkpoint in our previous method and derive a new condition for finding unnecessary checkpoints. Using the proposed method based on the new condition, we can increase the number of unnecessary checkpoints compared to our previous method. Numerical examples which are obtained by extensive simulation show that the proposed method can attain as much as about 50 times speedup.

The crucial issue for mobile Internet services is to provide the guaranteed mobile QoS for multicalls. In mobile networks, we should not only guarantee handoff dropping probability but also maximize resource utilization. In this paper, we propose a QoS admission control mechanism for macro Mobile QoS based on a dynamic resource reservation. We introduce the requirements for macro Mobile QoS as mobility features and predict required resources in each routing paths thorough the combined analysis of average movement pattern and pre-defined handoff dropping probability. Our simulation results show that the proposed scheme can guarantee the pre-defined handoff dropping probability and maintain lower call blocking probability and higher resource utilization than other schemes. The propose scheme gives a practical solution for mobile networks providing mobile Internet services.

A distributed denial-of-service (DDoS) attack presents a very serious threat to the stability of the Internet. In a typical DDoS attack, a large number of compromised hosts are amassed to send useless packets to jam a victim or its Internet connection, or both. Defense against DDoS attacks as well as identification of their sources comprise demanding challenges in the realm of Internet security studies. In this paper, effective measures are proposed for detecting attacks in routers through the use of queuing models, which help detect attacks closer to the attack sources. Utilizing these measures, an effective DDoS attack detection and packet-filtering scheme is proposed. The suggested approach is a cooperative technique among routers intended to protect the network from persistent and severe congestion arising from a rapid increase in attack traffic. Through computer simulations, it is shown that the proposed scheme can trace attacks near to the attack sources, and can effectively filter attack packets.

Intercarrier interference will cause the loss of subchannel orthogonality and increase the error floor in proportion to the Doppler frequency. In this paper, we firstly analyze the generation mechanism of intercarrier interference in OFDM. Then we propose an O(N log₂N) complexity ICI equalizer for OFDM systems in the presence of double selective fading which is mainly bases on FFT operation. Simulation result shows that with only 6 iterations LCD-FFT can achieve better performance than the LS-equalizer. After 10 iterations LCD-FFT performs almost the same as MMSE equalizer.

This paper discusses a cyclic prefixed single carrier frequency-domain equalization (SC-FDE) scheme with two types of transmit diversity. Firstly, we propose a SC-FDE system with space-frequency block coding (SFBC). The transmit sequence of the proposed system is designed to have spatial and frequency diversities, which is equivalent to the SFBC. The corresponding combining receiver is derived under a minimum mean square error (MMSE) criterion. It is shown that the proposed system significantly outperforms the SC-FDE system with space-time block coding (STBC) over fast fading channels, while providing lower computational complexity than orthogonal frequency division multiplexing (OFDM) combined with SFBC. We verify the performance of two-branch transmit diversity systems including the proposed one through bit error rate (BER) analysis. Secondly, as a scheme that combines STBC and SFBC, a space-time-frequency block code (STFBC) SC-FDE system is presented. Computer simulation results show that the proposed STFBC SC-FDE system has better immunity to the distortion caused by both fast fading and severe frequency selective fading, compared to the SC-FDE system with the STBC or the SFBC scheme. Complexity analysis is also conducted to compare their computational loads of the transceiver. It is shown that the proposed STFBC SC-FDE system has lower computational complexity than the STFBC OFDM system.

In order to efficiently mitigate emissions radiated from electrical equipment, emission source visualization methods need to be studied. In this paper, we propose a new macroscopic visualization method based on an optimization process which uses only cylindrically-scanned electric field amplitude data from an EMI test facility as specified by CISPR, and so does not need a special measurement system. The presented method divides the visualization space into three-dimensional rectangular cells, and estimated current values through the optimization process are sorted into each corresponding cell. By displaying the summed value of every cell, the emission source can be visualized. For this study, the spatial resolution was evaluated by computer simulation, with a result of around 0.2 m using a cell size of 0.1 m. With subsequent experimental verification using a comb generator in a semi-anechoic chamber, the visualization deviation was found to be less than 0.1 m in a frequency range of 100 MHz to 800 MHz. When two spherical dipole antennas were used, the deviation was less than 0.15 m. Finally, visualization results from a facsimile unit and a PC as real EUTs were shown and basic applicability of this method demonstrated.

In this letter, we study the problem of designing an efficient power and bit allocation scheme in the context of a hierarchical image transmission system based on an embedded multi-carrier modulation (EMCM) scheme over digital subscriber line. Authors describe a novel algorithm that performs power minimization under bit rate constraint and QoS requirement. It is based on the Hughes-Hartogs algorithm, and successively allocates the bits of the high, then low priority data streams. Simulations that assess the performance of the proposed algorithm are also provided and discussed; they demonstrate the interest of the proposed scheme.

In an effort to reduce switch cost, we present the optimum numbers of tunable wavelength converters (TWCs) and internal wavelengths required for contention resolution of asynchronous and variable length packets, in the optical packet switch (OPS) with the shared fiber delay line (FDL) buffer. To optimize TWCs and internal wavelengths related to OPS design cost, we proposed a scheduling algorithm for the limited TWCs and internal wavelengths. For three TWC alternatives (not shared, partially shared, and fully shared cases), the optimum numbers of TWCs and internal wavelengths to guarantee minimum packet loss are evaluated to prevent resource waste. Under a given load, TWCs and internal wavelengths could be significantly reduced, guaranteeing the same packet loss as the performance of an OPS with full TWCs and internal wavelengths.

AOC-SS (Advanced Orthogonal Code Spread Spectrum) modulation [1] is a flexible scheme that offers multi-rate transmission but causes a PAPR (Peak-to-Average Power Ratio) increase in proportion to the number of AOCs. Our solution to this problem is a new mapping technique. In addition, by combining with STC (Space-Time Coding), AOC-SS can resist multi-path fading. Computer simulations validate the proposed scheme.

This paper proposes two complexity reduced Maximum Likelihood Detection (MLD) methods for Space Division Multiplexing--OFDM (SDM-OFDM) system to exploit the spatial diversity so as to achieve the improved transmission quality. The proposed methods enable to outperform the other suboptimal detection methods and achieve near MLD performance with a significant reduction in calculation complexity. The various computer simulation results confirm that the proposed methods could realize the above targets and might be promising solution in practical systems.

In this letter, a method estimating the intercell carrier frequency-offset (CFO) in orthogonal frequency division multiplexing (OFDM)-based cellular systems is proposed for the user's equipment (UE), especially at the cell boundary, in downlink channels. After describing a new method of deriving the intercell CFO from the signals received by adjacent base stations (BSs), we propose a cell-searching method using the estimated CFOs. It is shown by computer simulation that the proposed methods can uniquely estimate the intercell CFOs and identify the target BS with a high detection probability at the UE.

This letter proposes a peak power reduction method that optimizes sub-carrier phases of an OFDM signal. The proposed method doesn't require side information transmission and original signal regeneration, which are required in conventional peak power reduction methods with phase optimization, since the optimized phases are distributed as jitter around the original phases before optimization. The iterative PTS (partial transmit sequences) algorithm with a restricted phase control range is used for the jitter injection: the phase optimization process is repeated with widening the control range. A computer simulation is carried out to estimate the proposed method performance. The results show that the proposed method can reduce the peak power by 4 dB when the power penalty caused by phase jitter is only 0.2 dB.

This letter proposes a low-complexity single frequency estimator for flat fading channels. The simplified estimator decreases the number of computations in the calculation of the autocorrelation function (AF) when compared to AF-based conventional estimators. The simplified estimator yields a comparable estimation performance to the existing estimators, while retaining the same frequency range.

In this letter, we present a simple way of estimating the integer frequency offset of orthogonal frequency division multiplexing (OFDM) system over a rapidly time-varying channel. By utilizing the channel responses of neighboring subcarriers within one pilot symbol, the frequency offset estimator is derived. We show by simulation that the proposed estimator can accurately estimate the integer frequency offset with reduced computational burden.

In this letter, we propose the transmit power controlled adaptive downlink frequency symbol spreading OFDM (TPC-AMS/FSS-OFDM) system. In the TPC-AMS/FSS-OFDM, each S/P transformed signal is spread by orthogonal spreading codes and combined in the transmitter, so the detected signals obtain the same SINR for each frequency symbol spreading block in the receiver. In this case, we can assign the same modulation level and transmit power for each frequency symbol spreading block for next transmission. Thus, the proposed system not only increases throughput performance but also reduces the total transmit power, FBI and MLI.

Expressions are presented for the probability of target detection and the measurement accuracy of the detection, taking into account the effects of antenna beam-pointing error. Evaluation of these expressions requires numerical integration, which is computationally expensive. Approximate but analytic and efficient expressions are also presented. Numerical examples are given to present the relative accuracy of our analytic approximations.

The H.264 standard allows each macroblock to have up to sixteen motion vectors, four reference frames, and a macroblock mode. Exploiting this feature, we present an efficient temporal error concealment algorithm for H.264-coded video. The proposed method turns out to show good performance compared with conventional approaches.

For hybrid Multimedia-on-Demand (MoD) systems which support broadcast, batch and interactive services, the charging scheme employed plays an important role in the delivery of good service quality to users, while also determining the revenue generated for the service provider. In this letter a new charging scheme is proposed. This scheme provides the same quality of service to the users as previous charging schemes while providing higher revenue. Numerical results are presented to evaluate the performance of the new charging scheme in comparison with previous schemes.