Takasuke TSUJI Akihiro SHIMIZU
Software applications for the transfer of money or personal information are increasingly common on the Internet. These applications require user authentication for confirming legitimate users. One-time password authentication methods risk a stolen-verifier problem or other steal attacks because the authentication on the Internet server stores the user's verifiers and secret keys. The SAS-2 (Simple And Secure password authentication protocol, ver.2) and the ROSI (RObust and SImple password authentication protocol) are secure password authentication protocols. However, we have found attacks on SAS-2 and ROSI. Here, we propose a new method which eliminates such problems without increasing the processing load and can perform high security level same as S/Key systems without resetting the verifier.
Younchan JUNG J. William ATWOOD
The main issue in real time voice applications over Internet is to investigate a lossless playout without jitter while maintaining playout delay as small as possible. Existing playout algorithms estimate network delay by using timestamps and determine the playout schedule only at the beginning of each talkspurt. Also their scheduled playout time is determined based on a fixed upper playout delay bound over a talkspurt. The sliding adaptive playout algorithm we propose can estimate jitter without using timestamps and its playout time is allowed to slide to a certain extent. The aim of sliding playout schedule is to determine the scheduled playout time at the beginning of each talkspurt based on the playout delay expected under the normal condition where the degree of actual jitter is below the magnitude which is not quite large in relation to variations in the "baseline" delays. Then the proposed algorithm can be effectively applied to minimize the scheduled playout delay while improving the voice quality against a spike which may occur at the beginning of a talkspurt as well as a spike which occurs in the middle of a talkspurt. We develop an analytical model of the general adaptive playout algorithms and analyze the playout buffer performance for different degrees of jitter, different values of the scheduled playout delay, different maximum lengths of delay spikes, and arbitrary tolerable ranges of sliding. Based on the analytical results, we suggest the specific values of parameters used in the sliding algorithm.
Ryuji WAKIKAWA Susumu KOSHIBA Thierry ERNST Julien CHARBON Keisuke UEHARA Jun MURAI
In this paper, we discuss the performance of a basic scheme to support network mobility. Network mobility arises when an entire network segment, such as a network inside a vehicle, changes its topological location and thus its access point to the fixed backbone network. Mechanisms to support network mobility are necessary to maintain sessions. The approach followed by the IETF (NEMO Basic Support) and us (B-ORC) is to establish a bi-directional tunnel between the mobile network and the Internet. As we show, this bi-directional tunnel is a performance bottleneck and leads to single points of failure. In order to address the issues of the existing mobile network architecture, we propose enhanced operations of the basic mobile network protocol to achieve reliability and efficiency: (1) multiple bi-directional tunnels between the mobile network and the Internet, and (2) policy-based routing. The proposed operations could be realized by extending the existing architecture and protocol. The performance of various multihoming configurations is evaluated based on the implementation of our own basic scheme. The evaluation criteria are delay, throughput and latency. The results are encouraging and show we can achieve a better throughput.
This letter handles symbolic simulation for high-level hardware design descriptions including uninterpreted functions. Two new heuristics are introduced, which are named "symbolic function table" and "synchronization". In the experiment, the equivalence of a hardware/software codesign was checked up to a given finite number of cycles, which is composed of a behavioral design, that is, a small DSP program written in C, and its register-transfer-level implementation, a VLIW architecture with an assembly program. Our symbolic simulator succeeded in checking the equivalence of the two descriptions which were not tractable without the heuristics.
Yasushi TAKAGI Hiroyuki OHNISHI Keisuke SAKITANI Ken-ichi BABA Shinji SHIMOJO
A new mobility management architecture is proposed to optimize end-to-end routes for mobile nodes (MNs) and mobile routers (MRs) within a nested mobile network environment. By applying local network mobility management mechanisms based on Hierarchical Mobile IPv6 (HMIPv6) to a mobile network, the proposed approach can optimize the route to the mobile network effectively. Combining the proposed route optimization methods and HMIPv6 functionality can enable it to provide more effective route optimization, reducing the burden of location registration for handovers. A route optimization method for local fixed nodes in a mobile network has also been developed by adding proxy mobile node and correspondent node functions to the MRs. Numerical evaluations on mean route length and traffic routed through network nodes demonstrate the effectiveness and applicability of the proposed methods especially in large-scale networks.
Shigeru TERUHI Yoshihiko UEMATSU
Streaming services and visual communication services delivered over the Internet have become popular in recent years. In the future, broadband services using MPEG2/4 will become the dominant type. These services will require transport protocols that provide high quality and high throughput from end to end of the system. We propose a new transfer method that allows the network load to be adaptively balanced according to the network's state. We built a prototype of an actual MPEG2 streaming system and used it to estimate the effectiveness of this method.
Koichi ITO Hiroshi NAKAJIMA Koji KOBAYASHI Takafumi AOKI Tatsuo HIGUCHI
This paper presents an algorithm for fingerprint matching using the Phase-Only Correlation (POC) function. One of the most difficult problems in human identification by fingerprints has been that the matching performance is significantly influenced by fingertip surface condition, which may vary depending on environmental or personal causes. This paper proposes a new fingerprint matching algorithm using phase spectra of fingerprint images. The proposed algorithm is highly robust against fingerprint image degradation due to inadequate fingertip conditions. A set of experiments is carried out using fingerprint images captured by a pressure sensitive fingerprint sensor. The proposed algorithm exhibits efficient identification performance even for difficult fingerprint images that could not be identified by the conventional matching algorithms.
Feng LIU Taiyi ZHANG Jiancheng SUN
In this paper a new adaptive multi-input multi-output (MIMO) channel estimation and multiuser detection algorithm based kernel space iterative inversion is proposed. The functions of output signals are mapped from a low dimensional space to a high dimensional reproducing kernel Hilbert space. The function of the output signals is represented as a linear combination of a set of basis functions, and a Mercer kernel function is constructed by the distribution function. In order to avoid finding the function f(.) and g(.), the correlation among the output signals is calculated in the low dimension space by the kernel. Moreover, considering the practical application, the algorithm is extended to online iteration of mixture system. The computer simulation results illustrated that the new algorithm increase the performance of channel estimation, the global convergence, and the system stability.
Tetsuya TOMINAGA Nobuo KUWABARA Jun KATO Annuer RAMLI A. Halim SAMAD Hussein Bin AHMAD
Lightning surges induced on subscriber lines in Kuala Lumpur, Malaysia, which is located in a tropical region, were observed at telecommunication centers. More than 100 surges per line were observed during a three-month period. Peak values, observed using a lightning surge counter, show that lightning surge current occurrences normalized by the number of thunderstorm days and number of subscriber lines closely agreed with data observed in temperate areas, e.g., Japan. Surge waveforms appearing at several points ranging from underground cable ducts to exchange equipment were observed using a wave memory system. The results show that lightning surge currents on the cables were larger than those on a wire, but the correlation between them was weak. Common and differential mode surge waveforms observed using the wave memory system were almost the same. These results will be useful in designing protection circuits for equipment used in tropical areas.
Miguel FRANKLIN DE CASTRO Lela MERGHEM Dominique GAITI Abdallah M'HAMED
The new Internet has to provide the Quality of Services to converged multimedia services, in which each one may choose its own requirements. Managing such a dynamic network is not an easy task. A more intelligent and adaptive behavior is required from network management. We argue that agents are able to realize this task by dynamically adapting management mechanisms to the current network conditions. This article presents a Behavioral Multi-Agent-based model for QoS-enabled Internet. Based on this behavioral approach, we analyze network management mechanisms (or "elementary behaviors") in terms of performance and applicability profile. We use simulation to observe services performances when submitted to diverse QoS management elementary behaviors.
By means of the three-dimensional (3D) finite-difference time domain (FDTD) method, we have investigated in detail the optical properties of a two-dimensional photonic crystal (PC) surface-emitting laser having a square-lattice structure. The 3D-FDTD calculation is carried out for the finite size PC slab structure. The device is based on band-edge resonance, and plural band edges are present at the corresponding band edge point. For these band edges, we calculate the mode profile in the PC slab, far field pattern (FFP) and polarization mode of the surface-emitted component, and photon lifetime. FFPs are shown to be influenced by the finiteness of the structure. Quality (Q) factor, which is a dimensionless quantity representing photon lifetime, is introduced. The out-plane radiation loss in the direction normal to the PC plane greatly influences the total Q factor of resonant mode and is closely related with the band structure. As a result, Q factors clearly differ among these band edges. These results suggest that these band edges include resonant modes that are easy to lase and resonant modes that are difficult to lase.
Ann-Chen CHANG Chiao-Chan HUANG Zhi-Feng HUANG
Two simple frequency offset estimators based on projection approaches for multicarrier code-division multiple access systems are proposed, without using specific training sequences. It is not only can estimate and correct frequency offset, but also has less computational load. Several computer simulations are provided for illustrating the effectiveness of the blind estimate approaches.
This paper proposes a new decision feedback decoding scheme for Alamouti-based space-time block coding (STBC) transmission over time-selective fading channels. In wireless channels, time-selective fading effects arise mainly due to Doppler shift and carrier frequency offset. Modelling the time-selective fading channels as the first-order Gauss-Markov processes, we use recursive algorithms such as Kalman filtering, LMS and RLS algorithms for channel tracking. The proposed scheme consists of the symbol decoding stage and channel tracking algorithms. Computer simulations confirm that the proposed scheme shows the better performance and robustness to time-selectivity.
Xiaodong REN Shidong ZHOU Zucheng ZHOU
This letter introduces a novel multi-user detection method, successive interference cancellation based on the order of log-likelihood-ratio(LLR-SIC), for code division multiple access (CDMA) systems. Unlike the conventional successive interference cancellation (SIC) based on the order of correlation, LLR-SIC operates on the fact that the user with the largest absolute value of log-likelihood ratio (LLR) should be first detected and cancelled from received signal. Simulation results show that LLR-SIC significantly outperforms the conventional SIC and partial parallel interference cancellation (P-PIC) over Rayleigh fading channels, and that LLR-SIC performance is not sensitive to channel estimation error at medium Eb/N0.
Pi-Chung WANG Chia-Tai CHAN Shuo-Cheng HU Chun-Liang LEE
Rectangle search is a well-known packet classification scheme which is based on multiple hash accesses for different filter length. It shows good scalability with respect to the number of filters; however, the performance is not fast enough to fulfill the high-speed requirement of packet classification. In this paper, we propose a lookahead caching which can significantly improve the performance of hash-based algorithm. The basic idea is to filter out the un-matched probing case by using dual-hash architecture. The experimental results indicate that the proposed scheme can improve the performance by the factor of two for the 2-dimension (source prefix, destination prefix) filter database.
Bon-Jin KU Jong-Moon CHUNG Changeon KANG
In this letter, we investigate serially concatenated space-time codes (SC-STs) applying iterative decoding topologies in wideband code division multiple access (WCDMA) communication systems. In the decoding algorithm, an iterative (turbo) process is used, where a priori probability (APP) is exchanged between the symbol-by-symbol space-time (ST) decoder and the bit-by-bit convolutional decoder. The experimental results show that in a Rayleigh fading channel environment the serially concatenated interleaved space-time coding systems show significant error correction capability, and based on the applied system configurations, the nonrecursive ST code outperforms the recursive ST code.
Yankang WANG Makoto ANDO Tomohiro TANIKAWA Kazuhiro YOSHIDA Jun YAMASHITA Hideaki KUZUOKA Michitaka HIROSE
This paper presents a block-based motion vector search algorithm for video coding based on an interpolation scheme of search blocks. The basic idea of motion vector estimation between frames is to select a block in the previous frame that best matches a block in the current frame by minimizing the difference between them. In most of the search algorithms, however, the best-match block can only be on a pre-defined grid pattern. Although using a pre-defined pattern increases the search efficiency, it may also reduce the search accuracy. To balance the two aspects and to fully utilize the block information, we propose a strategy, which, instead of selecting from pre-defined blocks, searches for a best match interpolated from the pre-defined blocks. Experiment results demonstrate a better accuracy and efficiency of this search method than some commonly-used methods for different kinds of motion.
Zhihui WANG Tohru KIRYU Keisuke SHIBAI Shinkichi SAKAHASHI
In this paper, we present a flexible distributed computing system in which it is very easy to add required computing components at any time. The system is an Internet-based solution, and mainly developed by Java and XML. Moreover, by implementing a new configuration of computing information that is setting up Public Information and Private Information, the system can accommodate various computing requests, and facilitate a flexible design. Additionally, to show the practical merit, as an example of signal processing, we presented how to apply our proposed system to selection of a suitable artificial neural network.
Tomonari MASADA Atsuhiro TAKASU Jun ADACHI
We propose a novel method for Web page grouping based only on hyperlink information. Because of the explosive growth of the World Wide Web, page grouping is expected to provide a general grasp of the Web for effective information search and netsurfing. The Web can be regarded as a gigantic digraph where pages are vertices and links are arcs. Our grouping method is a generalization of decomposition into strongly connected components, in which each group is constructed as a subset of a strongly connected component. Moreover, group sizes can be controlled by adjusting a parameter, called the threshold parameter. We call the resulting groups parameterized connected components (PCCs). The algorithm is simple and admits parallelization. Notably, we apply Dijkstra's shortest path algorithm in our grouping method. This paper also includes experimental results for 15 million Web pages, which show the contribution of our method to efficient Web surfer navigation.
This paper describes a novel method of shape matching by means of unification and expansion of local correspondences on the feature points. The method has the ability to simultaneously locate plural similar parts of two-dimensional objects under affine transformation. Furthermore, the method is applicable to the objects partially occluded. Experimental results show that the method yields results that are satisfactory, even for the cases with additions, deletions and local deviations of some feature points.