著者
SHOMURA Yusuke WATANABE Yoshinori YOSHIDA Kenichi
出版者
Institute of Electronics, Information and Communication Engineers
雑誌
IEICE transactions on communications (ISSN:09168516)
巻号頁・発行日
vol.E91.B, no.6, pp.1896-1905, 2008
被引用文献数
12 11

Abnormal traffic that causes various problems on the Internet, such as P2P flows, DDoS attacks, and Internet worms, is increasing; therefore, the importance of methods that identify and control abnormal traffic is also increasing. Though the application of frequent-itemset-mining techniques is a promising way to analyze Internet traffic, the huge amount of data on the Internet prevents such techniques from being effective. To overcome this problem, we have developed a simple frequent-itemset-mining method that uses only a small amount of memory but is effective even with the large volumes of data associated with broadband Internet traffic. Using our method also involves analyzing the number of distinct elements in the itemsets found, which helps identify abnormal traffic. We used a cache-based implementation of our method to analyze actual data on the Internet and demonstrated that such an implementation can be used to provide on-line analysis of data while using only a small amount of memory.
著者
SUZUKI Kazuya JIBIKI Masahiro YOSHIDA Kenichi
出版者
電子情報通信学会
雑誌
IEICE transactions on communications (ISSN:09168516)
巻号頁・発行日
vol.E93.B, no.5, pp.1085-1094, 2010-05
被引用文献数
2

The availability of IP networks has increased its importance due to the evolving use of real-time and mission-critical applications on IP networks. Methods for preparing alternate routing tables that can be used for fast restoration from link failures have been investigated. In such methods, each node has to compute a number of alternate routing tables in advance since they have to prepare for each potential failure. The resulting huge number of alternate routing tables has prevented these methods from being deployed. In this paper, we propose a method for reducing the number of alternate routing tables for link failure. It analyzes three types of shortest path trees on the basis of link-state information. We show that the number of alternate routing tables can be reduced to 1/100, on average, from that with the conventional method, and that they are small enough to be stored in the memory of IP routers.
著者
ROMANOV Anton OKAMOTO Eiji
出版者
電子情報通信学会
雑誌
IEICE transactions on communications (ISSN:09168516)
巻号頁・発行日
vol.E93.B, no.6, pp.1411-1421, 2010-06

With the increasing demand for services provided by communication networks, quality and reliability of such services as well as confidentiality of data transfer are becoming ones of the highest concerns. At the same time, because of growing hacker's activities, quality of provided content and reliability of its continuous delivery strongly depend on integrity of data transmission and availability of communication infrastructure, thus on information security of a given IT landscape. But, the amount of resources allocated to provide information security (like security staff, technical countermeasures and etc.) must be reasonable from the economic point of view. This fact, in turn, leads to the need to employ a forecasting technique in order to make planning of IT budget and short-term planning of potential bottlenecks. In this paper we present an approach to make such a forecasting for a wide class of information security related incidents (ISRI) — unambiguously detectable ISRI. This approach is based on different auto regression models which are widely used in financial time series analysis but can not be directly applied to ISRI time series due to specifics related to information security. We investigate and address this specifics by proposing rules (special conditions) of collection and storage of ISRI time series, adherence to which improves forecasting in this subject field. We present an application of our approach to one type of unambiguously detectable ISRI — amount of spam messages which, if not mitigated properly, could create additional load on communication infrastructure and consume significant amounts of network capacity. Finally we evaluate our approach by simulation and actual measurement.
著者
YAMADA Takeshi KASUYA Yuki SHINOHARA Yuki KITAWAKI Nobuhiko
出版者
電子情報通信学会
雑誌
IEICE transactions on communications (ISSN:09168516)
巻号頁・発行日
vol.E93.B, no.6, pp.1367-1372, 2010-06
被引用文献数
1 4

This paper describes non-reference objective quality evaluation for noise-reduced speech. First, a subjective test is conducted in accordance with ITU-T Rec. P.835 to obtain the speech quality, the noise quality, and the overall quality of noise-reduced speech. Based on the results, we then propose an overall quality estimation model. The unique point of the proposed model is that the estimation of the overall quality is done only using the previously estimated speech quality and noise quality, in contrast to conventional models, which utilize the acoustical features extracted. Finally, we propose a non-reference objective quality evaluation method using the proposed model. The results of an experiment with different noise reduction algorithms and noise types confirmed that the proposed method gives more accurate estimates of the overall quality compared with the method described in ITU-T Rec. P.563.
著者
VIXIE Paul
出版者
一般社団法人電子情報通信学会
雑誌
IEICE transactions on communications (ISSN:09168516)
巻号頁・発行日
vol.89, no.4, pp.1144-1149, 2006-04-01

Authority zones in the Domain Name System must be declared to have one or more authoritative name servers, usually consisting of one primary name server and several secondary name servers. These name servers are expected to synchronize zone data using DNS's zone transfer protocols, but the configuration of these synchronization relationships depends upon out of band information and manual processes. This paper describes a way to create name service federations such that a varying set of zones offered by a primary name server can be automatically configured for synchronization by secondary name servers. A sample implementation based on ISC BIND and Perl is described.
著者
Kotaro KATAOKA Keisuke UEHARA Masafumi OE Jun MURAI
出版者
The Institute of Electronics, Information and Communication Engineers
雑誌
IEICE TRANSACTIONS on Communications (ISSN:09168516)
巻号頁・発行日
vol.E95-B, no.7, pp.2200-2209, 2012-07-01

In disaster sites of 2011 Tohoku Earthquake, digital communication was virtually unavailable due to the serious damage to the existing Internet and ICT resources. Thus there were urgent demands for recovering the Internet connectivity and first aid communication tools. This paper describes the design and deployment of networking systems that provide Internet connectivity using 3G mobile links or VSAT satellite links. In this paper we examine two approaches for post-disaster networking: quickly deployable package and on-demand networking. Based on a comparison of their characteristics and deployment experiences, this paper tries to extract lessons that contribute to improving the preparedness to another disaster. This paper also shares our significant operational experience acquired through supporting a maximum of 54 sites in Tohoku area including evacuation shelters, temporary hospitals and local government offices.
著者
Gaolei FEI Guangmin HU
出版者
The Institute of Electronics, Information and Communication Engineers
雑誌
IEICE TRANSACTIONS on Communications (ISSN:09168516)
巻号頁・発行日
vol.E95-B, no.6, pp.1974-1977, 2012-06-01

In this letter, we address the issue of estimating the temporal dependence characteristic of link loss by using network tomography. We use a k-th order Markov chain (k > 1) to model the packet loss process, and estimate the state transition probabilities of the link loss model using a constrained optimization-based method. Analytical and simulation results indicate that our method yields more accurate packet loss probability estimates than existing loss inference methods.
著者
Hitoshi YOSHINO
出版者
The Institute of Electronics, Information and Communication Engineers
雑誌
IEICE TRANSACTIONS on Communications (ISSN:09168516)
巻号頁・発行日
vol.E95-B, no.4, pp.1036-1043, 2012-04-01

Cognitive radio is an emerging technology to further improve the efficiency of spectrum use. Due to the nature of the technology, it has many facets, including its enabling technologies, its implementation issues and its regulatory implications. In ITU-R (International Telecommunications Union – Radiocommunication sector), cognitive radio systems are currently being studied so that ITU-R can have a clear picture on this new technology and its potential regulatory implications, from a viewpoint of global spectrum management. This paper introduces the recent results of the ITU-R studies on cognitive radio on both regulatory and technical aspects. This paper represents a personal opinion of the author, but not an official view of the ITU-R.
著者
Xiaodong DENG Mengtian RONG Tao LIU
出版者
The Institute of Electronics, Information and Communication Engineers
雑誌
IEICE TRANSACTIONS on Communications (ISSN:09168516)
巻号頁・発行日
vol.E95-B, no.1, pp.152-159, 2012-01-01

Large capacity tags are becoming available to meet the demands of industry, but the UHF RFID protocol is unable to reliably and efficiently read large data sets from tags. First of all, large data sets are not well protected. The tag merely relies on 16-bit CRC for ensuring the validity of up to 4,096-bit user-specific data in EPCglobal C1G2 protocol. Furthermore, the reliability will be even worse if large capacity tags are implemented using semi-active technology which is likely to prevail among sensor-integrated RFID tags. Since semi-active tags greatly alleviate the performance limitation imposed by the turn-on power of the tag chip, backscattering signal of semi-active tags could be a serious challenge for most readers because it is much weaker than signals emitted by passive tags due to longer reading distance. In this paper, Interim CRC is presented to enhance transmission reliability and efficiency when the tag is backscattering a large data set. By taking advantage of Interim CRC, the large data set can be divided into several blocks, and 16-bit checksum is calculated over each block. The tag backscatters all blocks at the first time and only retransmits certain blocks if CRC error occurs in those blocks. The result of simulation shows that the reading error rate can be confined to a preset threshold and the accumulative total of transmitted data are greatly reduced if optimal block size and transmission times are complied with. The simulation also conclusively proves that semi-active tags derive even longer reading range from Interim CRC. In addition, Interim CRC is totally compliant with the EPCglobal C1G2 protocol. It fully makes use of CRC-16 encoder and does not involve any other data encoding schematics and hardware modifications.
著者
Maciej SOBIERAJ Maciej STASIAK Joanna WEISSENBERG Piotr ZWIERZYKOWSKI
出版者
The Institute of Electronics, Information and Communication Engineers
雑誌
IEICE TRANSACTIONS on Communications (ISSN:09168516)
巻号頁・発行日
vol.E95-B, no.1, pp.120-132, 2012-01-01

This paper presents a new generalized single threshold model that can be used in communications and cellular networks. In the proposed model, called Single Hysteresis Model (SHM), it is assumed that the amount of resources accessible for a new call of a given class can depend on two load areas of the system. The switching between areas is modulated by the two-state Markov chain which determines the average time the system spends in a particular load area, i.e. the area in which calls of selected classes with a reduced amount of resources (high load area) and with the initial amount of resources (low load area) are serviced. The results obtained for the discussed analytical model are compared with the results of the simulation of an exemplary WCDMA radio interface carrying a mixture of different multi-rate traffic streams. The research study confirms high accuracy of the proposed model.
著者
Kentaro ISODA Teruyuki HARA
出版者
The Institute of Electronics, Information and Communication Engineers
雑誌
IEICE TRANSACTIONS on Communications (ISSN:09168516)
巻号頁・発行日
vol.E94-B, no.11, pp.2969-2977, 2011-11-01

A monopulse angle measurement method is often utilized to measure a target angle. However, this method cannot measure correct angles for multiple targets which cannot be distinguished by range, Doppler frequency and beamwidth. When the number of targets which cannot be distinguished by these parameters is restricted to two, a method which can measure two targets angles has been proposed. However, an approximation is utilized with this method, so that measured angles have errors even though the signal-to-noise ratio is infinite. Another method which can simultaneously measure azimuths and elevations for only two targets has also been proposed. However, this conventional method requires four receivers, and is therefore difficult to apply when there is a hard ware limitation. In this paper, we propose a method to measure azimuths and elevations of two targets by using two receivers and a time division system. A pairing problem has occurred due to the time division angle measurement with this method, so we also propose an algorithm to solve this pairing problem. We finally verify the proposed method by a numerical simulation and experimentation. The results show that the angles of two targets can be measured by our proposed method by using two receivers.
著者
TSUMURA Shigehiko VEHKAPERA Mikko LI Zexian TUJKOVIC Djordje JUNTTI Markku HARA Shinsuke
出版者
一般社団法人電子情報通信学会
雑誌
IEICE transactions on communications (ISSN:09168516)
巻号頁・発行日
vol.87, no.10, pp.3011-3020, 2004-10-01
被引用文献数
5

In this paper, we evaluate the performance of single- and multi-antenna multi-carrier code division multiple access (MC-CDMA) downlink (base station to mobile terminal) systems in single- and multi-cell environments. We first propose a minimum mean square error (MMSE) filter with a Gaussian approximation for a single input single output (SISO) MC-CDMA downlink system. Then, we apply it to a SIMO (single input multiple output) system with a conventional turbo coding. Furthermore, we compare the performance of SISO (1×1) and SIMO (1×2) MC-CDMA systems with that of a multiple input multiple output (MIMO) (2×2) system employing space-time turbo coded modulation (STTuCM) in a multi-cell environment with 7 cells by computer simulation. Based on the computer simulation results, it is found that the considered MIMO system can achieve twofold capacity with the same transmission power in the multi-cell environment.
著者
Kentaro ISHIZU Homare MURAKAMI Stanislav FILIN Hiroshi HARADA
出版者
The Institute of Electronics, Information and Communication Engineers
雑誌
IEICE TRANSACTIONS on Communications (ISSN:09168516)
巻号頁・発行日
vol.E93-B, no.12, pp.3311-3322, 2010-12-01
被引用文献数
4

Selections of radio access networks by terminals are currently not coordinated and utilizations of the radio resources are not balanced. As a result, radio resources on some radio systems are occupied even though others can afford. In this paper, in order to provide a framework to resolve this issue, Cognitive Wireless Router (CWR) system is proposed for distributed management and independent reconfiguration of heterogeneous wireless networks. The proposed system selects appropriate operational frequency bands and radio systems to connect to the Internet in corporation between the CWRs and a server and therefore can provide optimized wireless Internet access easily even in environments without wired networks. The developed prototype system reconfigures the radio devices to connect to the Internet in 27 seconds at most. It is revealed that this reconfiguration time can be shortened to less than 100 ms by elaborating its procedure. It is also clarified that network data speed required at the server to deal with 10,000 CWRs is only 4.1 Mbps.
著者
LEE H.C. KYUNG C.M
出版者
一般社団法人電子情報通信学会
雑誌
IEICE transactions on communications (ISSN:09168516)
巻号頁・発行日
vol.80, no.1, pp.192-195, 1997-01-25

A network with input and output buffer is proposed. It consists of several switching stages composed of 3×3 basic switching elements which are connected with perfect shuffle and horizontal connections. The proposed network reduces the required number of stages, and increases the fault tolerance due to its highly regular connection scheme. Its performance was evaluated with computer simulation under bursty traffic environment. For a 128×128 switch with 11 switching stages, a packet loss ratio of 10^lt-6gt was obtained when the input load is 0.8 and the burstiness is 10.
著者
Hajime TAZAKI Rodney Van METER Ryuji WAKIKAWA Thirapon WONGSAARDSAKUL Kanchana KANCHANASUT Marcelo DIAS DE AMORIM Jun MURAI
出版者
The Institute of Electronics, Information and Communication Engineers
雑誌
IEICE TRANSACTIONS on Communications (ISSN:09168516)
巻号頁・発行日
vol.E93-B, no.8, pp.2004-2011, 2010-08-01

Motivated by the deployment of post-disaster MANEMO (MANET for NEMO) composed of mobile routers and stations, we evaluate two candidate routing protocols through network simulation, theoretical performance analysis, and field experiments. The first protocol is the widely adopted Optimized Link State Routing protocol (OLSR) and the second is the combination of the Tree Discovery Protocol (TDP) with Network In Node Advertisement (NINA). To the best of our knowledge, this is the first time that these two protocols are compared in both theoretical and practical terms. We focus on the control overhead generated when mobile routers perform a handover. Our results confirm the correctness and operational robustness of both protocols. More interestingly, although in the general case OLSR leads to better results, TDP/NINA outperforms OLSR both in the case of sparse networks and in highly mobile networks, which correspond to the operation point of a large set of post-disaster scenarios.
著者
Hideharu AMANO Akiya JOURAKU Kenichiro ANJO
出版者
The Institute of Electronics, Information and Communication Engineers
雑誌
IEICE TRANSACTIONS on Communications (ISSN:09168516)
巻号頁・発行日
vol.E86-B, no.12, pp.3385-3391, 2003-12-01

A framework of dynamically adaptive hardware mechanism on multicontext reconfigurable devices is proposed, and as an example, an adaptive switching fabric is implemented on NEC's novel reconfigurable device DRP (Dynamically Reconfigurable Processor). In this switch, contexts for the full crossbar and alternative hadware modules, which provide larger bandwidth but can treat only a limited pattern of packet inputs, are prepared. Using the quick context switching functionality, a context for the full crossbar is replaced by alternative contexts according to the packet inputs pattern. If the context corresponding to requested alternative hadware modules is not inside the chip, it is loaded from outside chip to currently unused context memory, then replaced with the full size crossbar. If the traffic includes a lot of packets for specific destinations, a set of contexts frequently used in the traffic is gathered inside the chip like a working set stored in a cache. 4 4 mesh network connected with the proposed adaptive switches is simulated, and it appears that the latency between nodes is improved three times when the traffic between neighboring four nodes is dominant.
著者
CHANG Yeim-Kuan
出版者
一般社団法人電子情報通信学会
雑誌
IEICE transactions on communications (ISSN:09168516)
巻号頁・発行日
vol.88, no.1, pp.239-246, 2005-01-01

Building next generation routers with the capability of forwarding multiple millions of packets per second is required for the increasing demand for high bandwidth on the Internet. Reducing the required memory size of the forwarding table is a possible solution since small forwarding table can be integrated into the application specific integrated circuit (ASIC). In this paper a hash technique is developed to reduce the size of the IP forwarding table. The proposed data structure is a compressed 8-8-8-8 multibit trie that is based on hash tables of 4-bit addresses. Two optimization techniques are also proposed to further improve the performance of the proposed schemes. Our experimental results show that the proposed hashing-based schemes are better than the Small Forwarding Table scheme [6] both in memory size and lookup latency.
著者
YASUDA Kinuko HAGINO Tatsuya
出版者
一般社団法人電子情報通信学会
雑誌
IEICE transactions on communications (ISSN:09168516)
巻号頁・発行日
vol.84, no.4, pp.920-929, 2001-04-01
被引用文献数
3

In this paper, we propose a new filesystem named Ad-hoc Filesystem which targets ad-hoc wireless networks. Ad-hoc Filesystem is a serverless filesystem which automatically generates temporary shared space among multiple mobile machines when they gather in a communicable range. The generated space is freely available for participating machines and can be used for any temporary work there. The design of Ad-hoc Filesystem is strongly motivated by the recent wireless network technologies and advances of ad-hoc network techniques. However, targeting such an unstable network forces us a completely different design from existing filesystems. We have designed an initial prototype of Ad-hoc Filesystem and have evaluated the simulation results. Our design is strongly based on an assumption such that people who wish to work together would form a stable group in a range, and replicating data on two different machines would be enough to provide a proper level of availability. Hence, Ad-hoc Filesystem distributes files among multiple machines and duplicates them, in order to keep the files available even if some of participating machines arbitrarily leave the communication range. The directory entries are kept as a soft-state mechanism maintained by exchanging broadcast packets. The simulation results show that using broadcast to maintain system state hardly affects the overall system performance, and optimizations such that delaying replies with broadcast and sensing other packets promiscuously during the delay reduce the overhead significantly. Also the result indicates that our strategy that keeps two replicas for each data is promising to provide availability. Although further investigation based on real implementation remains important work, we believe that the prototype has a contribution to realize the possibility of ad-hoc filesystem by synthesizing number of previous works in areas such as network filesystems, server replication and ad-hoc wireless networks.