首页期刊导航|IEICE transactions on information and systems
期刊信息/Journal information
IEICE transactions on information and systems
Information and Systems Society
IEICE transactions on information and systems

Information and Systems Society

月刊

0916-8532

IEICE transactions on information and systems/Journal IEICE transactions on information and systemsISTPAHCISCI
正式出版
收录年代

    Special Section on Parallel and Distributed Computing and Networking FOREWORD

    Nakashima, Yasuhiko
    2047-2047页
      原文链接:
    • NETL
    • NSTL
    • Ieice-Inst Electronics Information Communications Eng

    A Proposal of Access Point Selection Method Based on Cooperative Movement of Both Access Points and Users

    Hamamoto, RyoMurase, TutomuTakano, ChisaObata, Hiroyasu...
    2048-2059页
    查看更多>>摘要：In recent times, wireless Local Area Networks (wireless LANs) based on the IEEE 802.11 standard have been spreading rapidly, and connecting to the Internet using wireless LANs has become more common. In addition, public wireless LAN service areas, such as train stations, hotels, and airports, are increasing and tethering technology has enabled smartphones to act as access points (APs). Consequently, there can be multiple APs in the same area. In this situation, users must select one of many APs. Various studies have proposed and evaluated many AP selection methods; however, existing methods do not consider AP mobility. In this paper, we propose an AP selection method based on cooperation among APs and user movement. Moreover, we demonstrate that the proposed method dramatically improves throughput compared to an existing method.
      原文链接:
    • NETL
    • NSTL
    • Ieice-Inst Electronics Information Communications Eng

    SP-MAC: A Media Access Control Method Based on the Synchronization Phenomena of Coupled Oscillators over WLAN

    Obata, HiroyasuHamamoto, RyoTakano, ChisaIshida, Kenji...
    2060-2070页
    查看更多>>摘要：Wireless local area networks (LANs) based on the IEEE802.11 standard usually use carrier sense multiple access with collision avoidance (CSMA/CA) for media access control. However, in CSMA/CA, if the number of wireless terminals increases, the back-off time derived by the initial contention window (CW) tends to conflict among wireless terminals. Consequently, a data frame collision often occurs, which sometimes causes the degradation of the total throughput in the transport layer protocols. In this study, to improve the total throughput, we propose a new media access control method, SP-MAC, which is based on the synchronization phenomena of coupled oscillators. Moreover, this study shows that SP-MAC drastically decreases the data frame collision probability and improves the total throughput when compared with the original CSMA/CA method.
      原文链接:
    • NETL
    • NSTL
    • Ieice-Inst Electronics Information Communications Eng

    GA-MAP: An Error Tolerant Address Mapping Method in Data Center Networks Based on Improved Genetic Algorithm

    Deng, GangWang, HongGong, ZhenghuChen, Lin...
    2071-2081页
    查看更多>>摘要：Address configuration is a key problem in data center networks. The core issue of automatic address configuration is assigning logical addresses to the physical network according to a blueprint, namely logical-to-device ID mapping, which can be formulated as a graph isomorphic problem and is hard. Recently years, some work has been proposed for this problem, such as DAC and ETAC. DAC adopts a sub-graph isomorphic algorithm. By leveraging the structure characteristic of data center network, DAC can finish the mapping process quickly when there is no malfunction. However, in the presence of any malfunctions, DAC need human effort to correct these malfunctions and thus is time-consuming. ETAC improves on DAC and can finish mapping even in the presence of malfunctions. However, ETAC also suffers from some robustness and efficiency problems. In this paper, we present GA-MAP, a data center networks address mapping algorithm based on genetic algorithm. By intelligently leveraging the structure characteristic of data center networks and the global search characteristic of genetic algorithm, GA-MAP can solve the address mapping problem quickly. Moreover, GA-MAP can even finish address mapping when physical network involved in malfunctions, making it more robust than ETAC. We evaluate GA-MAP via extensive simulation in several of aspects, including computation time, error-tolerance, convergence characteristic and the influence of population size. The simulation results demonstrate that GA-MAP is effective for data center addresses mapping.
      原文链接:
    • NETL
    • NSTL

    Survivability Analysis of VM-Based Intrusion Tolerant Systems

    Zheng, JunjunOkamura, HiroyukiDohi, Tadashi
    2082-2090页
    查看更多>>摘要：Survivability is the capability of a system to provide its services in a timely manner even after intrusion and compromise occur. In this paper, we focus on the quantitative analysis of survivability of virtual machine (VM) based intrusion tolerant system in the presence of Byzantine failures due to malicious attacks. Intrusion tolerant system has the ability of a system to continuously provide correct services even if the system is intruded. This paper introduces a scheme of the intrusion tolerant system with virtualization, and derives the success probability for one request by a Markov chain under the environment where VMs have been intruded due to a security hole by malicious attacks. Finally, in numerical experiments, we evaluate the performance of VM-based intrusion tolerant system from the viewpoint of survivability.
      原文链接:
    • NETL
    • NSTL
    • Ieice-Inst Electronics Information Communications Eng

    Modeling and Testing of Network Protocols with Parallel State Machines

    Yin, XiaYao, JiangyuanWang, ZhiliangShi, Xingang...
    2091-2104页
    查看更多>>摘要：The researches on model-based testing mainly focus on the models with single component, such as FSM and EFSM. For the network protocols which have multiple components communicating with messages, CFSM is a widely accepted solution. But in some network protocols, parallel and data-shared components maybe exist in the same network entity. It is infeasible to precisely specify such protocol by existing models. In this paper we present a new model, Parallel Parameterized Extended Finite State Machine (PaP-EFSM). A protocol system can be modeled with a group of PaP-EFSMs. The PaP-EFSMs work in parallel and they can read external variables form each other. We present a 2-stage test generation approach for our new models. Firstly, we generate test sequences for internal variables of each machine. They may be non-executable due to external variables. Secondly, we process the external variables. We make the sequences for internal variables executable and generate more test sequences for external variables. For validation, we apply this method to the conformance testing of real-life protocols. The devices from different vendors are tested and implementation faults are exposed.
      原文链接:
    • NETL
    • NSTL
    • Ieice-Inst Electronics Information Communications Eng

    Novel High Performance Scheduling Algorithms for Crosspoint Buffered Crossbar Switches

    Wang, XiaotingWang, YiwenLi, ShichaoLi, Ping...
    2105-2115页
    查看更多>>摘要：The crossbar-based switch fabric is widely used in today's high performance switches, due to its internally nonblocking and simply implementation properties. Usually there are two main switching architectures for crossbar-based switch fabric: internally bufferless crossbar switch and crosspoint buffered crossbar switch. As internally bufferless crossbar switch requires a complex centralized scheduler which limits its scalability to high speeds, crosspoint buffered crossbar switch has gained more attention because of its simpler distributed scheduling algorithm and better switching performance. However, almost all the scheduling algorithms proposed previously for crosspoint buffered crossbar switch either have unsatisfactory scheduling performance under non-uniform traffic patterns or show poor service fairness between input traffic flows. In order to overcome the disadvantages of existing algorithms, in this paper we propose two novel high performance scheduling algorithms named MCQF_RR and IMCQF_RR for crosspoint buffered crossbar switches. Both algorithms have a time complexity of O(log N), where N is the number of input/output ports of the switch. MCQF_RR takes advantage of the combined weight information about queue length and service waiting time of input queues to perform scheduling. In order to further reduce the scheduling complexity and make it feasible for high speed switches, IMCQF_RR uses the compressed queue length information instead of original queue length information to schedule cells in input VOQs. Simulation results show that our novel scheduling algorithms MCQF_RR and IMCQF_RR can demonstrate excellent delay performance comparable to existing high performance scheduling algorithms under both uniform and non-uniform traffic patterns, while maintain good service fairness performance under severe non-uniform traffic patterns.
      原文链接:
    • NETL
    • NSTL
    • Ieice-Inst Electronics Information Communications Eng

    The Fault-Tolerant Hamiltonian Problems of Crossed Cubes with Path Faults

    Chen, Hon-ChanKung, Tzu-LiangZou, Yun-HaoMao, Hsin-Wei...
    2116-2122页
    查看更多>>摘要：In this paper, we investigate the fault-tolerant Hamiltonian problems of crossed cubes with a faulty path. More precisely, let P denote any path in an n-dimensional crossed cube CQ(n) for n >= 5, and let V(P) be the vertex set of P. We show that CQ(n) - V(P) is Hamiltonian if vertical bar V(P)vertical bar <= n and is Hamiltonian connected if vertical bar V(P)vertical bar <= n-1. Compared with the previous results showing that the crossed cube is (n - 2)-fault-tolerant Hamiltonian and (n - 3)-fault-tolerant Hamiltonian connected for arbitrary faults, the contribution of this paper indicates that the crossed cube can tolerate more faulty vertices if these vertices happen to form some specific types of structures.
      原文链接:
    • NETL
    • NSTL
    • Ieice-Inst Electronics Information Communications Eng

    Failure Detection in P2P-Grid System

    Wang, HuanNakazato, Hideroni
    2123-2131页
    查看更多>>摘要：Peer-to-peer (P2P)-Grid systems are being investigated as a platform for converging the Grid and P2P network in the construction of large-scale distributed applications. The highly dynamic nature of P2P-Grid systems greatly affects the execution of the distributed program. Uncertainty caused by arbitrary node failure and departure significantly affects the availability of computing resources and system performance. Checkpoint-and-restart is the most common scheme for fault tolerance because it periodically saves the execution progress onto stable storage. In this paper, we suggest a checkpoint-and-restart mechanism as a fault-tolerant method for applications on P2P-Grid systems. Failure detection mechanism is a necessary prerequisite to fault tolerance and fault recovery in general. Given the highly dynamic nature of nodes within P2P-Grid systems, any failure should be detected to ensure effective task execution. Therefore, failure detection mechanism as an integral part of P2P-Grid systems was studied. We discussed how the design of various failure detection algorithms affects their performance in average failure detection time of nodes. Numerical analysis results and implementation evaluation are also provided to show different average failure detection times in real systems for various failure detection algorithms. The comparison shows the shortest average failure detection time by 8.8s on basis of the WP failure detector. Our lowest mean time to recovery (MTTR) is also proven to have a distinct advantage with a time consumption reduction of about 5.5s over its counterparts.
      原文链接:
    • NETL
    • NSTL
    • Ieice-Inst Electronics Information Communications Eng

    Dynamic Job Scheduling Method Based on Expected Probability of Completion of Voting in Volunteer Computing

    Miyakoshi, YutoYasuda, ShinyaWatanabe, KanFukushi, Masaru...
    2132-2140页
    查看更多>>摘要：This paper addresses the problem of job scheduling in volunteer computing (VC) systems where each computation job is replicated and allocated to multiple participants (workers) to remove incorrect results by a votingmechanism. In the job scheduling of VC, the number of workers to complete a job is an important factor for the system performance; however, it cannot be fixed because some of the workers may secede in real VC. This is the problem that existing methods have not considered in the job scheduling. We propose a dynamic job scheduling method which considers the expected probability of completion (EPC) for each job based on the probability of worker's secession. The key idea of the proposed method is to allocate jobs so that EPC is always greater than a specified value (SPC). By setting SPC as a reasonable value, the proposed method enables to complete jobs without excess allocation, which leads to the higher performance of VC systems. We assume in this paper that worker's secession probability follows Weibull-distribution which is known to reflect more practical situation. We derive parameters for the distribution using actual trace data and compare the performance of the proposed and the previous method under the Weibull-distribution model, as well as the previous constant probability model. Simulation results show that the performance of the proposed method is up to 5 times higher than that of the existing method especially when the time for completing jobs is restricted, while keeping the error rate lower than a required value.
      原文链接:
    • NETL
    • NSTL
    • Ieice-Inst Electronics Information Communications Eng