Komwut WIPUSITWARAKUN Sanon CHIMMANEE
Overlay networks which are dynamically created over underlying IP networks are becoming widely used for delivering multimedia contents since they can provide several additional user-definable services. Multiple overlay paths between a source-destination overlay node pair are designed to improve service robustness against failures and bandwidth fluctuation of the underlying networks. Multimedia traffic can be distributed over those multiple paths in order to maximize paths' utilization and to increase application throughputs. Most of flow-based routing algorithms consider only common metrics such as paths' bandwidth or delay, which may be effective for data applications but not for real-time applications such as Voice over IP (VoIP), in which different levels of such performance metrics may give the same level of the performance experienced by end users. This paper focuses on such VoIP overlay networks and proposes a novel alternative path based flow routing algorithm using an application-specific traffic metric, i.e. "VoIP Path Capacity (VPCap)," to calculate the maximum number of QoS satisfied VoIP flows which may be distributed over each available overlay path at a moment. The simulation results proved that more QoS-satisfied VoIP sessions can be established over the same multiple overlay paths, comparing to traditional approaches.
M.M. Hafizur RAHMAN Yasushi INOGUCHI Yukinori SATO Susumu HORIGUCHI
Interconnection networks play a crucial role in the performance of massively parallel computers. Hierarchical interconnection networks provide high performance at low cost by exploring the locality that exists in the communication patterns of massively parallel computers. A Tori connected Torus Network (TTN) is a 2D-torus network of multiple basic modules, in which the basic modules are 2D-torus networks that are hierarchically interconnected for higher-level networks. This paper addresses the architectural details of the TTN and explores aspects such as node degree, network diameter, cost, average distance, arc connectivity, bisection width, and wiring complexity. We also present a deadlock-free routing algorithm for the TTN using four virtual channels and evaluate the network's dynamic communication performance using the proposed routing algorithm under uniform and various non-uniform traffic patterns. We evaluate the dynamic communication performance of TTN, TESH, MH3DT, mesh, and torus networks by computer simulation. It is shown that the TTN possesses several attractive features, including constant node degree, small diameter, low cost, small average distance, moderate (neither too low, nor too high) bisection width, and high throughput and very low zero load latency, which provide better dynamic communication performance than that of other conventional and hierarchical networks.
Zhenjie FENG Taiyi ZHANG Runping YUAN
In this paper, we consider an amplify-and-forward (AF) relay network where a source node transmits information to a destination node through the cooperation of multiple relay nodes. It is shown in prior works that the outage behavior and average throughput of the selection AF (S-AF) scheme where only the best relay node is chosen to assist can outperform the conventional all-participate AF (AP-AF) scheme. Assuming multiple antennas at the destination node and single antennas at other nodes in this paper, we propose a relay selection scheme according to the criterion of maximizing receive signal to noise ratio (SNR), where a group of relays is chosen to assist in the transmission simultaneously in a manner similar to cyclic delay diversity (CDD). Compared with S-AF, the proposed scheme achieves better outage behavior and average throughput. It can be seen from simulation results that the performance improvement of symbol error rate (SER) is significant compared with S-AF.
Jianming WU Shunji MIYAZAKI Kazuhisa OHBUCHI Tomohiko TANIGUCHI
In this paper, we investigate the system performance of decode and forward based bi-directional relaying based on symbol-wise XOR operation. This technique gives more freedom in selecting the modulation and coding scheme at relay stations, and significantly relaxes the transmission bottleneck. However, the performance degradation occurs when the modulation orders of both links differ from each other. To mitigate such an impact, we exploit a repetition coding scheme in conjunction with a redundant modulation code scheme by overlapping MCS levels. To this end, a system level simulation proves that the proposed scheme achieves about 43% capacity gain over bit-wise XOR based bi-directional relaying and gives additional 10% gain over symbol-wise XOR based bi-directional relaying.
Hidekazu TAOKA Fumiaki ITO Keiji TAKAKUSAKI Mamoru SAWAHASHI
This paper experimentally investigates the effect of frequency error compensation provided by demodulation automatic frequency control (AFC) using the Synchronization Channel (SCH) in downlink OFDM radio access. The implemented OFDM receiver compensates for the frequency error caused by the difference in frequency between a base station (BS) and a user equipment (UE) using a time-division multiplexed SCH signal and that caused by the Doppler shift generated by the mobility of a user using reference signals with staggered multiplexing. Experimental results show that even when the standard oscillator frequency of the UE cannot be made to track the more accurate frequency of a BS, demodulation AFC can suppress the residual frequency error to a sufficiently low level, i.e., within 0.3 ppm, using the SCH so that the degradation in the block error rate of the physical broadcast channel control signals is slight, i.e., within approximately 0.1 dB, with respect to the case without frequency error for speeds greater than 350 km/h.
Shuhui HOU Tetsutaro UEHARA Takashi SATOH Yoshitaka MORIMURA Michihiko MINOH
In recent years, with the rapid growth of the Internet as well as the increasing demand for broadband services, live pay-television broadcasting via the Internet has become a promising business. To get this implemented, it is necessary to protect distributed contents from illegal copying and redistributing after they are accessed. Fingerprinting system is a useful tool for it. This paper shows that the anti-collusion code has advantages over other existing fingerprinting codes in terms of efficiency and effectivity for live pay-television broadcasting. Next, this paper presents how to achieve efficient and effective anti-collusion codes based on unital and affine plane, which are two known examples of balanced incomplete block design (BIBD). Meanwhile, performance evaluations of anti-collusion codes generated from unital and affine plane are conducted. Their practical explicit constructions are given last.
Masaki NAKAMURA Takahiro SEINO
In the OTS/CafeOBJ method, software specifications are described in CafeOBJ executable formal specification language, and verification is done by giving scripts to the CafeOBJ system. The script is called a proof score. In this study, we propose a test case generator from an OTS/CafeOBJ specification together with a proof score. Our test case generator gives test cases by analyzing the proof score. The test cases are used to test whether an implementation satisfies the specification and the property verified by the proof score. Since a proof score involves important information for verifying a property, the generated test cases are also expected to be suitable to test the property.
This primary objective of this study is to demonstrate simulation and ground-based experiment for the attitude control of flexible spacecraft. A typical spacecraft structure consists of the rigid body and flexible appendages which are large flexible solar panels, parabolic antennas built from light materials in order to reduce their weight. Therefore the attitude control has a big problem because these appendages induce structural vibration under the excitation of external forces. A single-axis rotational simulator with a flexible arm is constructed with on-off air thrusters and reaction wheel as actuation. The simulator is also equipped with payload pointing capability by simultaneous thruster and DC servo motor actuation. The experiment of flexible spacecraft attitude control is performed using only the reaction wheel. Using the reaction wheel the performance of the fuzzy-PID controller is illustrated by simulation and experimental results for a single-axis rotational simulator.
Nonnegative matrix factorization (NMF) and its extensions such as Nonnegative Tensor Factorization (NTF) have become prominent techniques for blind sources separation (BSS), analysis of image databases, data mining and other information retrieval and clustering applications. In this paper we propose a family of efficient algorithms for NMF/NTF, as well as sparse nonnegative coding and representation, that has many potential applications in computational neuroscience, multi-sensory processing, compressed sensing and multidimensional data analysis. We have developed a class of optimized local algorithms which are referred to as Hierarchical Alternating Least Squares (HALS) algorithms. For these purposes, we have performed sequential constrained minimization on a set of squared Euclidean distances. We then extend this approach to robust cost functions using the alpha and beta divergences and derive flexible update rules. Our algorithms are locally stable and work well for NMF-based blind source separation (BSS) not only for the over-determined case but also for an under-determined (over-complete) case (i.e., for a system which has less sensors than sources) if data are sufficiently sparse. The NMF learning rules are extended and generalized for N-th order nonnegative tensor factorization (NTF). Moreover, these algorithms can be tuned to different noise statistics by adjusting a single parameter. Extensive experimental results confirm the accuracy and computational performance of the developed algorithms, especially, with usage of multi-layer hierarchical NMF approach [3].
Hideyuki KOTO Hiroki FURUYA Hajime NAKAMURA
This paper proposes an adaptive transmission control method for massive and intensive telecommunication traffic generated by communication-broadcasting integrated services. The proposed method adaptively controls data transmissions from viewers depending on the congestion states, so that severe congestion can be effectively avoided. Furthermore, it utilizes the broadcasting channel which is not only scalable, but also reliable for controlling the responses from vast numbers of viewers. The performance of the proposed method is evaluated through experiments on a test bed where approximately one million viewers are emulated. The obtained results quantitatively demonstrate the performance of the proposed method and its effectiveness under massive and intensive traffic conditions.
Yoko UWATE Yoshifumi NISHIO Ruedi STOOP
Durability describes the ability of a device to operate properly in imperfect conditions. We have recently proposed a novel neural network structure called an "Affordable Neural Network" (AfNN), in which affordable neurons of the hidden layer are considered as the elements responsible for the robustness property as is observed in human brain function. Whereas earlier we have shown that AfNNs can still generalize and learn, here we show that these networks are robust against damages occurring after the learning process has terminated. The results support the view that AfNNs embody the important feature of durability. In our contribution, we investigate the durability of the AfNN when some of the neurons in the hidden layer are damaged after the learning process.
Yuichi OHSITA Takashi MIYAMURA Shin'ichi ARAKAWA Eiji OKI Kohei SHIOMOTO Masayuki MURATA
Obtaining current traffic matrices is essential to traffic engineering (TE) methods. Because it is difficult to monitor traffic matrices, several methods for estimating them from link loads have been proposed. The models used in these methods, however, are incorrect for some real networks. Thus, methods improving the accuracy of estimation by changing routes also have been proposed. However, existing methods for estimating the traffic matrix by changing routes can only capture long-term variations and cannot obtain current traffic matrices accurately. In this paper, we propose a method for estimating current traffic matrices that uses route changes introduced by a TE method. In this method, we first estimate the long-term variations of traffic by using the link loads monitored at previous times. Then, we adjust the estimated long-term variations so as to fit the current link loads. In addition, when the traffic variation trends change and the estimated long-term variations fail to match the current traffic, our method detects mismatch. Then, so as to capture the current traffic variations, the method re-estimates the long-term variations after removing monitored data corresponding to the end-to-end traffic causing the mismatches. We evaluate our method through simulation. The results show that our method can estimate current traffic matrices accurately even when some end-to-end traffic changes suddenly.
In this letter we provide a steering law for redundant single-gimbal control moment gyros. The proposed steering law is an extended version of the singular direction avoidance (SDA) steering law based on the singular value decomposition (SVD). All internal singularities are escapable for any non-zero constant torque command using the proposed steering law.
Marat ZHANIKEEV Yoshiaki TANAKA
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.
Makoto MISUMI Shin-ichi NAKAGAWA Ken-ichi CHINEN Yoichi SHINODA Katsunori YAMAOKA
When an IP Multicast network is constructed on a switch-based network, many IP Multicast packet broadcasts are generated, and these broadcasts cause trouble for all of the other kinds of communication. To solve this problem, implementing IGMP Snooping on various switches has been proposed. However, some switches have insufficient IP Multicast packet-handling capability. This problem is also mentioned in RFC4541. In this paper, we propose the IGMP Snooping Activator (ISA) mechanism as a way to solve the IP Multicast packet-handling problem. The ISA transmits dummy IGMP Queries to maintain the IP Multicast network, and it joins the flooding IP Multicast group to activate IGMP Snooping in switches that are unable to handle IP Multicast packets. The experimental evaluation shows the effectiveness of our proposed method: the network load decreases because of the method's effective restraint of IP Multicast packet flooding.
Hitomi TAMURA Kenji KAWAHARA Yuji OIE
Traffic Engineering (TE) is important for improving QoS in forwarding paths by efficient use of network resources. In fact, MPLS allows several detour paths to be (pre-)established for some source-destination pair as well as its primary path of minimum hops. Thus, we focus on a two-phase path management scheme using these two kinds of paths. In the first phase, each primary path is allocated to a flow on a specific source-destination pair if the path is not congested, i.e., if its utilization is less than some predetermined threshold; otherwise, as the second phase, one of the detour paths is allocated randomly if the path is available. Therefore, in this paper, we analytically evaluate this path management scheme by extending the M/M/c/c queueing system, and through some numerical results we investigate the impact of a threshold on the flow-blocking probability. Through some numerical results, we discuss the adequacy of the path management scheme for MPLS-TE.
Takehito SUZUKI Jiro HIROKAWA Makoto ANDO
This paper presents the formulation for the evaluation of external coupling in the alternating-phase feed single-layer slotted waveguide array antenna with baffles by using the Spectrum of Two-Dimensional Solutions (S2DS) method. A one-dimensional slot array is extracted from the array by assuming the periodicity in transversal direction and introducing the perfect electric conductors in the external region. The uniform excitation over the finite array is synthesized iteratively to demonstrate the fast and accurate results by S2DS. A unit design model with the baffles is introduced to determine the initial parameters of the slot pair which accelerate the iteration. Experiment at 25.3 GHz demonstrates good uniformity of the aperture field distribution as well as the effects of the baffles. The directivity is 32.7 dB which corresponds to the aperture efficiency 90.5% and the reflection is below -15.0 dB over 1.3 GHz.
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.
Kazuhiro OGATA Kokichi FUTATSUGI
Proofs written in algebraic specification languages are called proof scores. The proof score approach to design verification is attractive because it provides a flexible way to prove that designs for systems satisfy properties. Thus far, however, the approach has focused on safety properties. In this paper, we describe a way to verify that designs for systems satisfy liveness properties with the approach. A mutual exclusion protocol using a queue is used as an example. We describe the design verification and explain how it is verified that the protocol satisfies the lockout freedom property.
A function F:F2n F2n is almost perfect nonlinear (APN) if, for every a 0, b in F2n, the equation F(x)+F(x+a)=b has at most two solutions in F2n. When used as an S-box in a block cipher, it contributes optimally to the resistance to differential cryptanalysis. The function F is almost bent (AB) if the minimum Hamming distance between all its component functions v F, v∈F2n