Search Results 1-20 of 264

  • Load-Balancing Routing with Hybrid Network Considering Bandwidth Ratio

    NISHIMURA Kakushin , Kakushin Nishimura , Habibullah Babakarkhail , Kenya Sato

    スマートフォンの普及による高品質のビデオアプリケーション(データの送受信)などの大容量サービスの成長により、セルラーおよびWiFi通信に基づくモバイルネットワークを使用したトラフィック量が増加している。そこで、トラフィック量の増加に伴い、モバイルネットワークでの通信負荷の増加による通信障害が懸念されている。そこで、トラフィック量が多い状況下でもアプリケーションを使用できるように、ネットワークの輻輳 …

    同志社大学ハリス理化学研究報告 = The Harris science review of Doshisha University 61(1), 14-21, 2020-04

    IR  DOI 

  • An Efficient Routing Method for Range Queries in Skip Graph

    BANNO Ryohei , SHUDO Kazuyuki

    … <p>Skip Graph is a promising distributed data structure for large scale systems and known for its capability of range queries. … Although several methods of routing range queries in Skip Graph have been proposed, they have inefficiencies such as a long path length or a large number of messages. … In this paper, we propose a novel routing method for range queries named Split-Forward Broadcasting (SFB). …

    IEICE Transactions on Information and Systems E103.D(3), 516-525, 2020

    J-STAGE 

  • Flow Diffusion Algorithms for Folded Clos Networks

    Ohta Satoru

    … Thus, this paper investigates two distributed algorithms that nearly uniformly spread flows in FCNs. … This method is further divided into two versions. … These algorithms are executable in a distributed manner without relying on global information. … This paper also evaluates the presented algorithms and conventional random routing for different traffic and network models through computer simulation. …

    IEEJ Transactions on Electronics, Information and Systems 139(11), 1224-1233, 2019

    J-STAGE 

  • A Dynamic-Clustering Backup Scheme for High-Availability Distributed File Sharing Systems

    NGUYEN Hoai Son , NGUYEN Dinh Nghia , SUGAWARA Shinji

    … <p>DHT routing algorithms can provide efficient mechanisms for resource placement and lookup for distributed file sharing systems. … The main idea of our method is to dynamically divide the DHT network into a number of clusters, each of which locally stores and maintains data chunks of data files to guarantee the data availability of user data files even when node churn occurs. …

    IEICE Transactions on Communications E102.B(3), 545-556, 2019

    J-STAGE 

  • Query Routing Method and its Performance Evaluation in Distributed Key-Value Stores using OpenFlow Switches  [in Japanese]

    島尻 洋裕 , 見越 大樹 , 大山 勝徳 , 西園 敏弘

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 117(459), 301-304, 2018-03-01

  • Autonomous Distributed Calculation and Storage of Tie Strengths between Contents in Graph System  [in Japanese]

    北村 太知 , 金子 晋丈

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 117(397), 37-42, 2018-01-22

  • Cross-Layer Design for Exposed Node Reduction in Ad Hoc WLANs

    WEYULU Emilia , HANADA Masaki , KANEMITSU Hidehiro , PARK Eun-Chan , KIM Moo Wan

    … In this paper, we present an evaluation of a method for reducing exposed nodes in 802.11 ad hoc WLANs. … Information obtained by the AODV routing protocol is utilized in adjusting the RTS transmission range at the MAC Layer. … The proposed method is evaluated with the NS-2 simulator and we observe significant throughput improvement, and confirm the effectiveness of the proposed method. …

    IEICE Transactions on Communications E101.B(7), 1575-1588, 2018

    J-STAGE 

  • Path Establishment Method with Distributed Control Scheme in Multi-Domain Elastic Optical Networks  [in Japanese]

    平岩 侑也 , 馬場 健一

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 117(298), PN2017-33, 2017-11-15

  • Design of an SDN based network control method for Multipath Distributed Storage Systems (情報ネットワーク)

    GUILLEN Luis , IZUMI Satoru , ABE Toru , SUGANUMA Takuo , MURAOKA Hiroaki

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 117(205), 19-24, 2017-09-07

  • A Layout-Oriented Routing Method for Low-Latency HPC Networks

    KAWANO Ryuta , NAKAHARA Hiroshi , FUJIWARA Ikki , MATSUTANI Hiroki , KOIBUCHI Michihiro , AMANO Hideharu

    … This latency reduction is established in exchange for a large amount of routing information. … That is, minimal routing on irregular networks is achieved by using routing tables for all destinations in the networks. …

    IEICE Transactions on Information and Systems E100.D(12), 2796-2807, 2017

    J-STAGE 

  • A New Energy Efficient Clustering Algorithm Based on Routing Spanning Tree for Wireless Sensor Network

    GAO Yating , KANG Guixia , CHENG Jianming , ZHANG Ningbo

    … In order to balance the energy dissipation and prolong the network lifetime, this paper proposes a routing spanning tree-based clustering algorithm (RSTCA) which uses routing spanning tree to analyze clustering. … In the setup phase, several clusters are formed by adopting the K-means algorithm to balance network load on the basis of geographic location, which solves the randomness problem in traditional distributed clustering algorithm. …

    IEICE Transactions on Communications E100.B(12), 2110-2120, 2017

    J-STAGE 

  • A Study on Path Establishment Method based on Distributed Control Plane in Elastic Optical Networks  [in Japanese]

    平岩 侑也 , 馬場 健一

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 116(205), 29-34, 2016-09-01

  • Load Reduction method for Distributed Key-Value Stores Using Query Information Based Routing  [in Japanese]

    佐久間 崇 , 大山 勝徳 , 西園 敏弘

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 115(483), 429-434, 2016-03-03

  • A Countermeasure to Eavesdropping on Data Packets by Utilizing Control Packet Overhearing for Radio overlapping Reduced Multipath Routing in Ad Hoc Networks

    Murakami Tetsuya , Kohno Eitaro , Kakuda Yoshiaki

    … <p>Ad hoc networks are autonomously distributed wireless networks which consist of wireless terminals (hereinafter, referred to as nodes). … Previously, we had proposed the secure dispersed data transfer method for encryption, decryption, and transfer of the original data packets. … To use the secure dispersed data transfer method securely, we had proposed using the node-disjoint multipath routing method. …

    International Journal of Networking and Computing 6(2), 345-367, 2016

    J-STAGE 

  • Distributed Optimization in Transportation and Logistics Networks

    WONG K. Y. Michael , SAAD David , YEUNG Chi Ho

    … Compared with centralized algorithms, distributed algorithms have the advantages of lower computational complexity, and lower communication overhead. … This review will cover message-passing algorithms in applications such as resource allocation, transportation networks, facility location, traffic routing, and stability of power grids.</p> …

    IEICE Transactions on Communications E99.B(11), 2237-2246, 2016

    J-STAGE 

  • EVALUATION OF BIAS CORRECTION METHODS FOR FUTURE RIVER DISCHARGE PROJECTION  [in Japanese]

    MANEE Donpapob , TACHIKAWA Yasuto , ICHIKAWA Yutaka , YOROZU Kazuaki

    … A distributed flow routing model (1K-FRM) is used to obtain the dry and wet years in the present climate experiment by inputting the runoff generation data output from MRI-AGCM3.2S, a 20 km spatial resolution general circulation model (GCMs) developed by the Meteorological Research Institute, Japan. … An effective bias correction method is proposed with suitable statistical performance considering a non-stationary condition for applying the bias correction methods to future discharge estimation. …

    Journal of Japan Society of Civil Engineers, Ser. G (Environmental Research) 72(5), I_7-I_12, 2016

    J-STAGE 

  • Cooperative Distributed STBC Transmission Scheme for Multi-Hop V2V Communications

    DIEM Cong-Hoang , SATO Koya , FUJII Takeo

    … This paper proposes a novel cooperative scheme combining distributed space-time block code (STBC) at physical layer, multiple access protocol at medium access control (MAC) layer and opportunistic routing without complicated routing algorithm for achieving high reliability for vehicle-to-vehicle (V2V) communications. …

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E99.A(1), 252-262, 2016

    J-STAGE 

  • A Low Latency Distributed Routing Method for Random Topologies in HPC Networks  [in Japanese]

    河野 隆太 , 中原 浩 , 藤原 一毅 [他]

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 115(374), 105-110, 2015-12-17

  • A Low Latency Distributed Routing Method for Random Topologies in HPC Networks  [in Japanese]

    河野 隆太 , 中原 浩 , 藤原 一毅 [他]

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 115(373), 105-110, 2015-12-17

  • Recoverable DTN Routing based on a Relay of Cyclic Message-Ferries on a MSQ Network

    Hayashi Yukio

    … In this paper, we propose a design principle for a reliable routing in a store-carry-forward manner based on autonomously moving message-ferries on a special structure of fractal-like network, which consists of a self-similar tiling of equilateral triangles. … As a collective adaptive mechanism, the routing is realized by a relay of cyclic message-ferries corresponded to a concatenation of the triangle cycles and using some good properties of the network structure. …

    2015 IEEE International Conference on Self-Adaptive and Self-Organizing Systems Workshops (SASOW), 37-42, 2015-09

    IR 

Page Top