The code length of Tardos's collusion-secure fingerprint code is of theoretically minimal order with respect to the number of adversarial users (pirates). However, the constant factor should be further reduced for practical implementation. In this article, we improve the tracing algorithm of Tardos's code and propose a 2-secure and short random fingerprint code, which is secure against collusion attacks by two pirates. Our code length is significantly shorter than that of Tardos's code and its tracing error probability is practically small.

In this paper, we suggest a method of analyzing the post-wall waveguide (PWW) or the substrate integrated waveguide (SIW) by applying the analytical technique of the H-plane waveguide discontinuities based on the planar circuit approach. The analytical procedure consists of the derivation of the mode impedance matrices for regular-shaped circuits and the short-circuiting operation on fictitious ports arranged at the peripheries of the metallic posts. First, a straight section of the PWW is treated as an example and the analytical method for the calculation of the S-parameters is described in detail. Then the attenuation and phase constants of the PWW are computed with the aid of the Thru-Reflect Line (TRL) calibration technique. Next, the analytical method is applied to the design of two types of right-angled corners. The analysis and the design results are verified using an em-simulator (HFSS).

A novel timing synchronizing scheme is proposed for use in inter-vehicle communication (IVC) with an autonomous distributed intelligent transport system (ITS). The scheme determines the timing of packet signal transmission in the IVC network and employs the guard interval (GI) timing in the orthogonal frequency divisional multiplexing (OFDM) signal currently used for terrestrial broadcasts in the Japanese digital television system (ISDB-T). This signal is used because it is expected that the automotive market will demand the capability for cars to receive terrestrial digital TV broadcasts in the near future. The use of broadcasts by automobiles presupposes that the on-board receivers are capable of accurately detecting the GI timing data in an extremely low carrier-to-noise ratio (CNR) condition regardless of a severe multipath environment which will introduce broad scatter in signal arrival times. Therefore, we analyzed actual broadcast signals received in a moving vehicle in a field experiment and showed that the GI timing signal is detected with the desired accuracy even in the case of extremely low-CNR environments. Some considerations were also given about how to use these findings.

Orthogonal Frequency Division Multiple Access (OFDMA) is the technique for the next generation wireless networks, whose enhanced capacity is to serve a combination of traffic with diverse QoS requirements. To realize this, the resource allocation scheme has to be carefully designed so that the instantaneous channel condition, QoS provision, and the network utilization are integrated. In this paper, we propose the resource allocation scheme for downlink traffic of 2 classes; guaranteed and non-guaranteed, having different traffic contracts. We provide guaranteed throughput for the guaranteed class by considering the cost incurred from serving this class. Then, we formulate the assignment problem with the objective of minimizing this cost. For the non-guaranteed class, we aim to maximize network utilization and to maintain throughput fairness, by employing Proportional Fairness (PF) utility function and emphasizing on the portion of network resource that the user received and the individual user's queue length. We use a heuristic approach to schedule users' data into the downlink subframe by exploiting multi-user multi-channel diversity to utilize system's bandwidth efficiently. Intensive simulation shows that our scheme differentiates classes of traffic and provides satisfied throughput, lower packet drop rate, and lower queuing delay to the guaranteed class, comparing with those of the non-guaranteed class. Furthermore, the results also show that the scheme is fair to users in the same class in both throughput and service time.

Bolstering survivable backbone networks against multiple failures is becoming a common concern among telecom companies that need to continue services even when disasters occur. This paper presents a multiple-failure recovery scheme that considers the operation and management of optical paths. The presented scheme employs scheme escalation from pre-planned restoration to full rerouting. First, the survivability of this scheme against multiple failures is evaluated considering operational constraints such as route selection, resource allocation, and the recovery order of failed paths. The evaluation results show that scheme escalation provides a high level of survivability even under operational constraints, and this paper quantitatively clarifies the impact of these various operational constraints. In addition, the fundamental functions of the scheme escalation are implemented in the Generalized Multi-Protocol Label Switching control plane and verified in an optical-cross-connect-based network.

In this paper, we propose and analyze a multi-level acknowledgement scheme for hybrid ARQ (H-ARQ) systems, which modifies the general ACK/NAK signals to represent multilevel information. For instance, the other signals except the ACK/NAK signals may be used for scheduling of retransmission in the H-ARQ scheme, which results in increasing the resolution of the uplink channel estimation signals. Simulation results demonstrate that when the retransmission interval is set to the optimal length, the proposed H-ARQ scheme shows a 0.5-2 dB gain with properly selected parameters.

Traditional traffic analysis is can be performed online only when detection targets are well specified and are fairly primitive. Local processing at measurement point is discouraged as it would considerably affect major functionality of a network device. When traffic is analyzed at flow level, the notion of flow timeout generates differences in flow lifespan and impedes unbiased monitoring, where only n-top flows ordered by a certain metric are considered. This paper proposes an alternative manner of traffic analysis based on source IP aggregation. The method uses flows as basic building blocks but ignores timeouts, using short monitoring intervals instead. Multidimensional space of metrics obtained through IP aggregation, however, enhances capabilities of traffic analysis by facilitating detection of various anomalous conditions in traffic simultaneously.

In this paper, we study the end-to-end TCP performance over a path deploying a High-Availability cluster, whose characteristics are highlighted by the failover procedure to remove single-point failure. This paper proposes an approach, called High-Availability Local Recovery (HALR), to enhance TCP performance in the face of a cluster failover. To minimize the latency of retransmission, HALR saves TCP packets selectively and resends them locally after the failover is finished. For better understanding, we further develop simple analytic models to predict the TCP performance in the aspect of flow latency under a range of failover times and the effects of HALR. Using simulation results, we validate our models and show that HALR improves the TCP performance significantly over a failover event as compared with the original TCP. Typically, HALR reduces the flow latency from 4.1 sec to less than 1.9 sec when the failover time equals to 500 ms. The simulation by real packet trace further demonstrates that the memory requirement of the proposed solution is not a concern for modern network equipments.

A numerical scheme for the analytic continuation of radiation patterns of the azimuthal coordinate θ into the whole space over the complex plane is given. The scattering data given over the real space [0, 2π] are extended into the complex plane by using the recurrence formulas. An example shows the validity of mathematically exact evaluation for the scattering from polygonal cylinders.

In this paper, we propose an effective key recovery attack on stream ciphers Py and Pypy with chosen IVs. Our method uses an internal-state correlation based on the vulnerability that the randomization of the internal state in the KSA is inadequate, and it improves two previous attacks proposed by Wu and Preneel (a WP-1 attack and a WP-2 attack). For a 128-bit key and a 128-bit IV, the WP-1 attack can recover a key with 223 chosen IVs and time complexity 272. First, we improve the WP-1 attack by using the internal-state correlation (called a P-1 attack). For a 128-bit key and a 128-bit IV, the P-1 attack can recover a key with 223 chosen IVs and time complexity 248, which is 1/224 of that of the WP-1 attack. The WP-2 attack is another improvement on the WP-1 attack, and it has been known as the best previous attack against Py and Pypy. For a 128-bit key and a 128-bit IV, the WP-2 attack can recover a key with 223 chosen IVs and time complexity 224. Second, we improve the WP-2 attack by using the internal-state correlation as well as the P-1 attack (called a P-2 attack). For a 128-bit key and a 128-bit IV, the P-2 attack can recover a key with 223 chosen IVs and time complexity 224, which is the same capability as that of the WP-2 attack. However, when the IV size is from 64 bits to 120 bits, the P-2 attack is more effective than the WP-2 attack. Thus, the P-2 attack is the known best attack against Py and Pypy.

Orthogonal frequency division multiplexing (OFDM), which uses a number of narrowband orthogonal sub-carriers, is a promising transmission technique. Also multi-carrier code division multi-access (MC-CDMA), which combines OFDM and frequency-domain spreading, has been attracting much attention as a future broadband wireless access. It was shown that MC-CDMA has lower channel capacity than OFDM, due to inter-code interference (ICI) resulting from orthogonality distortion caused by frequency-selective fading. Recently, many ICI cancellers have been proposed to mitigate the effect of ICI. In this paper, we derive a channel capacity expression for MC-CDMA assuming perfect ICI cancellation taking into account both frequency diversity gain and space diversity gain and compare it to that of OFDM. Furthermore, we derive a channel capacity expression for the case of imperfect ICI cancellation to discuss the impact of the residual ICI.

The design of multi-branch optical waveguides having 3 or more output ports is not so easy as that of 2-output branches because some innovative geometry is required to realize equal power splitting. All previous studies take the same approach in which they first introduce innovative geometries and then adjust the structural parameters for equal splitting. On the other hand, we propose quite a different method where distribution of refractive index is calculated from an ideal field distribution which is synthesized artificially. The method is extended to design 3-D 4-branch waveguides. It is exemplified that 4-branch waveguides with low-loss and equal splitting can be realized by the proposed method.

This paper develops a methodology for resizing image resolutions in an arbitrary orthogonal block transform domain. To accomplish this, we represent the procedures resizing images in an orthogonal transform domain in the form of matrix multiplications from which the matrix scaling the image resolutions is produce. The experiments showed that the proposed method produces reliable performance without increasing the computational complexity, compared to conventional methods when applied to various transforms.

A trihedral corner reflector is often used for SAR polarimetric calibration. However, the scattering property of the reflector used for the calibration may not be correct if the high frequency approximation is not satisfied or if an incident angle deviates from the symmetric axis of the reflector. In order to know the conditions for precise SAR polarimetric calibration, we evaluated the polarimetric response of the reflector by a numerical simulation using the method of moment (MoM). It is found that allowable incident angle deviation is 5 degree to azimuth direction and 4 degree to elevation direction for precise SAR polarimetric calibration when the size of the reflector is 7.5 times larger than the wavelength of an incident wave.

We have proposed a unique and simple modification to the definition of surface-normal vectors in Physical optics (PO). The modified surface-normal vectors are so defined as that the reflection law is satisfied at every point on the surface. The PO with currents defined by this new surface-normal vector has the enhanced accuracy for the edged scatterers to the level of Geometrical Theory of Diffraction (GTD), though it dispenses with the knowledge of high frequency asymptotic techniques. In this paper, firstly, the remarkable simplicity and the high accuracy of the modified PO as applied to the analysis of Radar Cross Section (RCS) is demonstrated for 2 dimensional problems. Noteworthy is that the scattering not only from edge but also from wedge is accurately predicted. This fringe advantage is confirmed asymptotically by comparing the edge and wedge diffraction coefficients of GTD. Finally, the applicability for three dimensional cube is also demonstrated by comparison with experimental data.

This letter proposes a novel method of large-scale IP traffic matrix (TM) estimation, called algebraic reconstruction technique inference (ARTI), which is based on the partial flow measurement and Fratar model. In contrast to previous methods, ARTI can accurately capture the spatio-temporal correlations of TM. Moreover, ARTI is computationally simple since it uses the algebraic reconstruction technique. We use the real data from the Abilene network to validate ARTI. Simulation results show that ARTI can accurately estimate large-scale IP TM and track its dynamics.

Cluster systems are prevalent infrastructures for offering e-services because of their cost-effectiveness. The objective of our research is to enhance their cost-effectiveness by reducing the minimum number of nodes to meet a given target performance. To achieve the objective, we propose a load balancing algorithm, the Nearest Underloaded algorithm (N algorithm). The N algorithm aims at quick solution of load imbalance caused by request departures while also preventing herd effect. The performance index in our evaluation is the xth percentile capacity which we define based on throughputs and the xth percentile response times. We measured the capacity of 8- to 16-node cluster systems under the N algorithm and existing Least-Loaded (LL) algorithms, which dispatch or transfer requests to the least-loaded node. We found that the N algorithm could achieve larger capacity or could achieve the target capacity with fewer nodes than LL algorithms could.

A microwave resonator is fabricated by a lump of spherical metal particles for the first time. It is the evidence that those particles constitute artificial dielectrics. The effective permittivity is calculated numerically together with the permeability. Resonant mode frequencies in the experiment are compared with the theoretical result obtained by the effective material constants above. Their reasonable agreement indicates the validity of material constant extraction. The unique diamagnetism of spherical particles could be utilized for improvement of spurious property of a resonator.

IPv4 private addresses are commonly used in local area networks (LANs). With the increasing popularity of virtual private networks (VPNs), it has become common that a user connects to multiple LANs at the same time. However, private address ranges for LANs frequently overlap. In such cases, existing systems do not allow the user to access the resources on all LANs at the same time. In this paper, we propose name-based address mapping for VPNs, a novel method that allows connecting to hosts through multiple VPNs at the same time, even when the address ranges of the VPNs overlap. In name-based address mapping, rather than using the IP addresses used on the LANs (the real addresses), we assign a unique virtual address to each remote host based on its domain name. The local host uses the virtual addresses to communicate with remote hosts. We have implemented name-based address mapping for layer 3 OpenVPN connections on Linux and measured its performance. The communication overhead of our system is less than 1.5% for throughput and less than 0.2 ms for each name resolution.

To address the low performance for channel scanning in the DVB-T system, we propose an enhanced front-end algorithm in this paper. The proposed algorithm consists of Auto Scan and Normal Scan, which is a part of the tuning algorithm for front-end (tuner) drivers in the DVB-T receiver. The key idea is that the frequency offset is saved when performing Auto Scan in order to reduce the channel change time for Normal Scan. In addition, the results of a performance evaluation demonstrate that our enhanced front-end algorithm improves the performance of channel scanning significantly, as compared to the generic front-end algorithm.