Updated on 2025/06/06

写真a

 
FUKUSHIMA Yukinobu
 
Organization
Faculty of Environmental, Life, Natural Science and Technology Associate Professor
Position
Associate Professor
Homepage
https://soran.cc.okayama-u.ac.jp/html/6025ed15318681a074506e4da22f6611_ja.html
External link

Degree

  • 博士（情報科学） ( 大阪大学 )

Research Interests

  • Information networks

  • Edge computing

  • Network virtualization

  • Optical networking

Research Areas

  • Informatics / Information network

Education

  • Osaka University   大学院情報科学研究科   情報ネットワーク学専攻

    2003.4 - 2006.3

    　 More details

    Country： Japan

    researchmap

  • Osaka University   大学院基礎工学研究科   情報数理系専攻

    2001.4 - 2003.3

    　 More details

    Country： Japan

    researchmap

  • Osaka University   基礎工学部   情報科学科

    1997.4 - 2001.3

    　 More details

    Country： Japan

    researchmap

Research History

  • Okayama University   大学院自然科学研究科産業創成工学専攻   Associate Professor

    2018.2

    　 More details

  • Okayama University   大学院自然科学研究科生命医用工学専攻   Assistant Professor

    2015.4 - 2018.1

    　 More details

  • Okayama University   The Graduate School of Natural Science and Technology   Assistant Professor

    2007.4 - 2015.3

    　 More details

  • Okayama University   大学院自然科学研究科産業創成工学専攻   Research Assistant

    2006.4 - 2007.3

    　 More details

 

Papers

▼display all

MISC

  • VM Migration Control considering Terminal Location in Multi-stage Information Processing System

    梅木勇杜, 中根和俊, 福島行信, WU Celimuge, JI Yusheng, 村瀬勉

    電子情報通信学会技術研究報告(Web)   123 ( 398(IN2023 65-113) )   2024

    　More details

  • Application of a Deep Reinforcement Learning Algorithm to Virtual Machine Migration Control in Multi-Stage Information Processing Systems

    糀谷友貴, 中根和俊, 樽谷優弥, WU Celimuge, JI Yusheng, 横平徳美, 村瀬勉, 福島行信

    電子情報通信学会技術研究報告(Web)   123 ( 398(IN2023 65-113) )   2024

    　More details

  • Audio Adersarial Example identification method using multiple features

    鈴木大補, 樽谷優弥, 福島行信, 横平徳美

    電子情報通信学会大会講演論文集(CD-ROM)   2024   2024

    　More details

  • A juvenile leaf growth prediction method using machine learning and image processing

    GAO Sen, 樽谷優弥, 福島行信, 横平徳美

    電子情報通信学会大会講演論文集(CD-ROM)   2024   2024

    　More details

  • Model Parameter Aggregation Method for Reducing Network Load in Hierarchical Federated Learning

    中村昂平, 福島行信, 樽谷優弥, 横平徳美

    電子情報通信学会技術研究報告(Web)   124 ( 139(IN2024 10-32) )   2024

    　More details

  • Prospective Preparation of VM Migration for Accuracy Improvement at server nodes in Multi-Stage Information Processing System

    中根和俊, 福島行信, WU Celimuge, JI Yusheng, 村瀬勉

    電子情報通信学会技術研究報告(Web)   122 ( 407(IN2022 65-125) )   2023

    　More details

  • Task offloading and scheduling with edge-peer computing in multi-stage Information processing system to improve progress of computing process

    浅尾英寿, 福島行信, WU Celimuge, JI Yusheng, 村瀬勉

    電子情報通信学会技術研究報告(Web)   122 ( 407(IN2022 65-125) )   2023

    　More details

  • VM Migration Control that Assures and Maximizes Quality in Multi-stage Information Processing Systems

    中根和俊, 福島行信, WU Celimuge, JI Yusheng, 村瀬勉

    電子情報通信学会技術研究報告(Web)   123 ( 148(IN2023 17-27) )   1 - 5   2023

    　More details

  • Investigation of Throughput Fairness of Multi-path TCP

    出口悠, 樽谷優弥, 福島行信, 横平徳美

    電子情報通信学会大会講演論文集(CD-ROM)   2022   2022

    　More details

  • A SECRET SHARING METHOD FOR TOTAL DATA REDUCTION

    辻晋明, 樽谷優弥, 福島行信, 横平徳美

    電子情報通信学会大会講演論文集(CD-ROM)   2022   2022

    　More details

  • Evaluation of an IP Fast Reroute Method for Multiple Failures

    河野貴謙, 樽谷優弥, 福島行信, 横平徳美

    電子情報通信学会大会講演論文集(CD-ROM)   2022   2022

    　More details

  • Performance Comparison of TCP Incast Avoidance Methods

    濱田泰誠, 樽谷優弥, 福島行信, 横平徳美

    電子情報通信学会大会講演論文集(CD-ROM)   2022   2022

    　More details

  • Proposal of equipment control by consensus building considering unknown users

    小形晃平, 樽谷優弥, 福島行信, 横平徳美

    電子情報通信学会大会講演論文集(CD-ROM)   2022   2022

    　More details

  • Protection method with audio processing against Audio Adversarial Example

    山本泰成, 樽谷優弥, 福島行信, 横平徳美

    電子情報通信学会技術研究報告(Web)   121 ( 66(SP2021 1-23) )   2021

    　More details

  • Performance Improvement of a Virtual Network Embedding Algorithm Based on Temporal-Difference Learning

    佐川勇太, 福島行信, 樽谷優弥

    電子情報通信学会大会講演論文集(CD-ROM)   2021   2021

    　More details

  • A Server Migration Method Using Q learning in Server Migration Service

    瓜本稜, 福島行信, 樽谷優弥, 村瀬勉, 横平徳美

    電気・情報関連学会中国支部連合大会講演論文集(CD-ROM)   71st   2020

    　More details

  • サーバ移動サービスにおける最小支配集合を用いたワークプレース容量設計法の性能改善

    伊藤嵩真, 福島行信, 村瀬勉, 横平徳美

    電子情報通信学会大会講演論文集(CD-ROM)   2019   2019

    　More details

  • サーバ移動サービスシステムのプロトタイプ開発

    高橋謙太, 福島行信, 村瀬勉, 樽谷優弥, 横平徳美

    情報科学技術フォーラム講演論文集   18th   2019

    　More details

  • 深層学習を用いたネットワークトラフィック予測

    徳山雄丈, 福島行信, 樽谷優弥, 横平徳美

    情報科学技術フォーラム講演論文集   18th   2019

    　More details

  • 多重ルーティング形態法における対象外故障の迂回可能性の検討

    石外将史, 樽谷優弥, 福島行信, 横平徳美

    情報科学技術フォーラム講演論文集   18th   2019

    　More details

  • クライアントからの再送要求に基づくTCPインキャスト回避法

    岸本紫電, 長田繁幸, 長田繁幸, 樽谷優弥, 福島行信, 横平徳美

    情報科学技術フォーラム講演論文集   18th   2019

    　More details

  • 複数ノード故障に対するIP高速迂回法の検討

    沼田直人, 樽谷優弥, 福島行信, 横平徳美

    情報科学技術フォーラム講演論文集   18th   2019

    　More details

  • 深層強化学習を用いた経路制御における行動価値関数の変更による性能改善

    大石勲斗, 佐川勇太, 瓜本稜, 福島行信, 樽谷優弥

    情報科学技術フォーラム講演論文集   18th   2019

    　More details

  • マルチパスTCPのスループット公平性の改善

    泉大地, 樽谷優弥, 福島行信, 横平徳美

    情報科学技術フォーラム講演論文集   18th   2019

    　More details

  • Link Capacity Provisioning and Server Location Decision in Server Migration Service

    Yukinobu Fukushima, Tokumi Yokohira, Tutomu Murase

    Proceedings of the 2018 IEEE 7th International Conference on Cloud Networking, CloudNet 2018   ???-??? - 3   2018.11

    　More details

  • マルチパスTCPのスループット公平性の検討

    廣山航洋, 福島行信, 横平徳美

    電子情報通信学会大会講演論文集(CD-ROM)   2018   ROMBUNNO.B‐6‐71   2018.3

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • 多重ルーティング形態法における予備テーブルのエントリ数の低減

    豊福成聖, 福島行信, 横平徳美

    電子情報通信学会大会講演論文集(CD-ROM)   2017   ROMBUNNO.B‐6‐79   2017.3

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • データセンターネットワークにおけるTCPインキャスト回避法の性能改善

    長田繁幸, 若井翔吾, 福島行信, 横平徳美

    電子情報通信学会大会講演論文集(CD-ROM)   2017   ROMBUNNO.B‐6‐64   2017.3

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • A Design Method of Work Place Capacity Using Minimum Dominating Set in Server Migration Service

    合田一歩, 福島行信, 村瀬勉, 横平徳美

    電子情報通信学会技術研究報告   116 ( 484(NS2016 157-253) )   77‐82   2017.2

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • Energy-Aware On-line Server Location Decision Algorithm in Server Migration Service

    杉山弘道, 福島行信, 村瀬勉, 横平徳美

    電子情報通信学会技術研究報告   116 ( 484(NS2016 157-253) )   71‐76   2017.2

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • Energy-Aware Optimal Server Location Decision in Server Migration Service

    福島行信, 村瀬勉, 横平徳美

    電子情報通信学会技術研究報告   116 ( 428(NS2016 141-156) )   53‐58   2017.1

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • A Prototype Virtual Network Embedding System Using OpenStack,

    Yukinobu Fukushima, Kohei Sato, Itsuo Goda, Heung-Gyoon Ryu, Tokumi Yokohira

    IEIE Transactions on Smart Processing & Computing   6 ( 1 )   60 - 65   2017

    　More details

  • サーバ移動サービスにおけるサーバ配置決定アルゴリズムの性能改善

    杉山弘道, 福島行信, 本吉彦, 村瀬勉, 横平徳美

    電子情報通信学会大会講演論文集(CD-ROM)   2016 ( 2 )   ROMBUNNO.B‐6‐63 - 63   2016.3

    　More details

    Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

    CiNii Article

    CiNii Books

    J-GLOBAL

    researchmap

  • Performance Improvement of an On-line Server Location Decision Algorithm in Server Migration Service

    杉山弘道, 福島行信, 本吉彦, 村瀬勉, 横平徳美

    電子情報通信学会技術研究報告   115 ( 483(NS2015 168-258) )   493‐498   2016.2

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • Nonlinearity Sensitivity of FBMC and UFMC Modulation System for the 5G Mobile System

    Changyoung An, Heung-Gyoon Ryu, Yukinobu Fukushima, Tokumi Yokohira

    The 31st International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC 2016)   1 - 4   2016

    　More details

  • Prototype Development of a Virtual Network Embedding System Using OpenStack

    Itsuho Goda, Kohei Sato, Yukinobu Fukushima, Heung-Gyoon Ryu, Tokumi Yokohira

    The 31st International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC 2016)   21 - 24   2016

    　More details

  • Modification of an Energy-Efficient Virtual Network Mapping Method for a Load-Dependent Power Consumption Model

    Shigeyuki Osada, Ryo Miyayama, Yukinobu Fukushima, Tokumi Yokohira

    WSEAS Transactions on Communications   15   240 - 250   2016

    　More details

  • Candidate Path Selection Method for TCP Performance Improvement in Fixed Robust Routing

    Yukinobu Fukushima, Takashi Matsumura, Kazutaka Urushibara, Tokumi Yokohira

    IEIE Transactions on Smart Processing & Computing   5 ( 6 )   445 - 453   2016

    　More details

  • TCP Incast avoidance based on connection serialization in data center networks

    Shigeyuki Osada, Ryo Miyayama, Yukinobu Fukushima, Tokumi Yokohira

    International Journal of Computer Networks and Communications   8 ( 4 )   83 - 102   2016

    　More details

    Language：English   Publisher：Academy and Industry Research Collaboration Center (AIRCC)  

    DOI： 10.5121/ijcnc.2016.8406

    Scopus

    researchmap

  • サーバ移動トラヒックの背景トラヒックへの影響に関する実験的評価

    合田一歩, 福島行信, 横平徳美

    電気・情報関連学会中国支部連合大会講演論文集(CD-ROM)   66th   ROMBUNNO.20-2   2015.10

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • 複数アプリケーション存在下におけるマルチパスTCPのスループット評価

    CHEN Chen, 福山諒, 福島行信, 横平徳美

    電気・情報関連学会中国支部連合大会講演論文集(CD-ROM)   66th   ROMBUNNO.20-1   2015.10

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • Performance Evaluation of an Energy Efficient Virtual Network Mapping Method-In the case of load-dependent power consumption model-

    Yuta Hoshino, Yukinobu Fukushima, Tutomu Murase, Tokumi Yokohira, Tatsuya Suda

    The International Conference on Electronics and Software Science 2015 (ICESS 2015)   134 - 144   2015

    　More details

  • An On-line Server Location Decision Algorithm in Server Migration Service

    HOSHINO Yuta, FUKUSHIMA Yukinobu, MURASE Tutomu, YOKOHIRA Tokumi, SUDA Tatsuya

    IEICE technical report   114 ( 297 )   59 - 64   2014.11

    　More details

    Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

    Server migration service (SMS) is proposed as an optional service that can improve QoS of communications by network applications (NW-Apps) in IaaS cloud service. In SMS, computers called work places (WPs) are deployed at various locations in a network, and servers of NW-Apps can migrate to WPs where the servers attain better QoS. When a server migrates, it generates huge traffic, and consequently it causes QoS degradation (NW impact) of the background traffic on the server's migrating route. This paper tackles the server location decision problem where a server's location is decided so that the NW-App's QoS is kept as good as possible under the constraint that the degree of NW impact is suppressed below an acceptable level. For the problem, we propose a server location decision algorithm. The algorithm tries to improve the NW-App's QoS in the present and in the future by restricting the server's migration range within a neighborhood of the WP where the server is assumed to attain good QoS in many situations.

    CiNii Article

    CiNii Books

    researchmap

  • An On-line Server Location Decision Algorithm in Server Migration Service

    星野佑太, 福島行信, 村瀬勉, 横平徳美, 須田達也

    電子情報通信学会技術研究報告   114 ( 297(NS2014 128-146) )   59 - 64   2014.11

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • メッシュプル型P2Pライブストリーミングにおけるオーバーレイネットワーク構築方式の性能評価

    高塚泰明, 福島行信, 横平徳美

    電気・情報関連学会中国支部連合大会講演論文集(CD-ROM)   65th   ROMBUNNO.21-13   2014.10

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • クラウドコンピューティングにおけるデータセンターネットワークでのTCPインキャストの回避に関する研究

    福島行信

    山陽放送学術文化財団リポート   ( 58 )   24 - 28   2014.9

    　More details

  • Power efficient traffic engineering in light trail networks

    FUKUSHIMA Yukinobu, YOKOHIRA Tokumi

    IEICE technical report   113 ( 472 )   337 - 342   2014.3

    　More details

    Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

    According to rapid increase of the Internet traffic, its total power consumption also increases. Therefore, it is necessary to decrease the total power consumption. Lightpath networks attract attention because they can relief the increase of the total power consumption by bypassing IP routers. Light trail networks have been proposed as an extended network architecture of lightpath networks. Light trail networks can achieve higher throughput than lightpath networks, and it is expected that light trail networks also show higher power efficiency than lightpath networks. In this research, we evaluate the power efficiency of light trail networks. In the evaluation, we reduce a power-efficient routing and wavelength assignment problem to a shortest path problem on an auxiliary graph, and solve it. In order to achieve this, we modify the conventional auxiliary graph for lightpath networks so that it can reflect the communication method of light trail networks. In addition, we calculate link costs of the auxiliary graph so that they corresponds to the increase of the total power consumption caused by the accommodation of traffic demands. Simulation results show that 1) light trail networks show higher power efficiency only when the network load is low and when the bandwidth granularity of communication channels is coarse, and 2) light trail networks show higher blocking probability than lightpath networks when they aim at minimizing the total power consumption.

    CiNii Article

    CiNii Books

    researchmap

  • A Per-burst Traffic Distribution Method in Fixed Robust Routing

    NABETA Takahiro, FUKUSHIMA Yukinobu, YOKOHIRA Tokumi

    IEICE technical report   113 ( 472 )   367 - 372   2014.3

    　More details

    Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

    Robust routing schemes are attracting attention as a routing scheme to achieve high robustness against changes in traffic patterns without performing both traffic measurement and dynamic change of traffic routes. This scheme, however, causes the performance degradation of TCP because it performs multipath routing and the out-of-order packet arrivals occur frequently. In this paper, we try to improve the performance by modifying a method (traffic distribution method) that determines how traffic should be distributed among the multiple routes for each source-destination (s-d) router pair that performs multipath routing. In the conventional traffic distribution method, the traffic distribution is determined on a per-packet basis. In this case, the number of packet delivery route changing is proportional to the number of the transferred packets, and consequently the out-of-order packet arrivals occur frequently. In this paper, we propose a per-burst distribution method. In this method, the traffic distribution is determined on a per-burst basis, where a burst is defined as a predetermined number of consecutive transferred packets for each s-d router pair. Numerical examples show that the per-burst distribution method can attain much higher throughput than the per-packet distribution method regardless of the burst length and can keep throughput high even when traffic patterns change if we use an appropriate burst length.

    CiNii Article

    CiNii Books

    researchmap

  • 多重ルーティングテーブル法における迂回経路導出法の改良

    今濱宇紀, 原田康弘, 福島行信, 横平徳美

    電子情報通信学会大会講演論文集(CD-ROM)   2014 ( 2 )   ROMBUNNO.B-6-41 - 41   2014.3

    　More details

    Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

    CiNii Article

    CiNii Books

    J-GLOBAL

    researchmap

  • Power efficient traffic engineering in light trail networks

    福島行信, 横平徳美

    電子情報通信学会技術研究報告   113 ( 472(NS2013 177-279) )   337 - 342   2014.2

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • A Per-burst Traffic Distribution Method in Fixed Robust Routing

    鍋田敬寛, 福島行信, 横平徳美

    電子情報通信学会技術研究報告   113 ( 472(NS2013 177-279) )   367 - 372   2014.2

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • Power Efficiency Evaluation of Medium Access Control Methods in Light Trail Networks

    Ryo Fukuyama, Yukinobu Fukushima, Tokumi Yokohira

    The 29th International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC 2014)   338 - 341   2014

    　More details

  • AS-friendly Peer Selection Algorithm for P2P Live Streaming

    Yukinobu Fukushima, Tokumi Yokohira

    International Journal of Multimedia Technology   4 ( 2 )   63 - 73   2014

    　More details

  • Power Consumption Evaluation of Light-trail Networks

    Yukinobu Fukushima, Tokumi Yokohira

    The 29th International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC 2014)   289 - 292   2014

    　More details

  • Performance Evaluation of Overlay Construction Algorithms in Mesh-pull P2P Live Streaming

    Yukinobu Fukushima, Tokumi Yokohira

    The 29th International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC 2014)   334 - 337   2014

    　More details

  • ロバストルーティング方式におけるバースト分配方式

    鍋田敬寛, 瀬崎裕, 福島行信, 横平徳美

    電気・情報関連学会中国支部連合大会講演論文集(CD-ROM)   64th   234 - 235   2013.10

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • TCP Incast Avoidance Based on Connection Serialization

    Osada Shigeyuki, Kajita Kazutoshi, Fukushima Yukinobu, Yokohira Tokumi

    IEICE technical report   112 ( 463 )   249 - 254   2013.3

    　More details

    Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

    In distributed file systems used in data center, a well-known congestion collapse called TCP Incast occurs because many servers send data to the same client simultaneously and then many packets overflow the port buffer of the client link. It leads to throughput degradation in the network. In this paper, we propose two methods to avoid Incast which called complete serialization and nearly complete serialization. The first method is a method which completely serializes connection establishments. By the serialization, the number of packets in the port buffer becomes very small, which leads to Incast avoidance. The second method is a method which overlaps the next connection to the current established connection to improve throughput in the first method. Numerical results from simulation with NS2 show the effectiveness of our two proposed methods.

    CiNii Article

    CiNii Books

    researchmap

  • Destination Selection Algorithms in Server Migration Service : A Case for Multiple Servers Migration

    YAMANAKA Asato, FUKUSHIMA Yukinobu, MURASE Tutomu, YOKOHIRA Tokumi, SUDA Tatsuya

    IEICE technical report   112 ( 463 )   391 - 396   2013.3

    　More details

    Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

    Server migration service (SMS)is proposed to improve communication QoS of network applications (NW-Apps)operated in Infrastructure as a Service (IaaS). In SMS, work places (WPs), which refer to computers that run virtual servers of NW-Apps, are deployed at various locations in a network, and the virtual servers may migrate between WPs to achieve better communication QoS. In SMS, it is important to decrease the degree (impact) of negative effect on background traffic caused by migrating servers while keeping NW-Apps' communication QoS good. In this paper, under the assumption that multiple server can migrate at the same time, we propose two destination selection algorithms: EMIA (Extended MIA)and EMCA (Extended MCA)that take account of both NW-Apps' communication QoS and impact. In order to decrease accumulative impact, EMIA migrates servers to WPs with the minimum impact and EMCA migrates servers to WPs with the maximum coverage, which is defined as the range where NW-App can attain good communication QoS so that the number of server migrations needed in the future is decreased. Numerical examples show that the two algorithms can keep NW-Apps' communication QoS the same level and EMCA achieves smaller impact than EMIA.

    CiNii Article

    CiNii Books

    researchmap

  • Optimal Locations of Servers in Server Migration Service

    FUKUSHIMA Yukinobu, MURASE Tutomu, YOKOHIRA Tokumi, SUDA Tatsuya

    IEICE technical report   112 ( 463 )   385 - 390   2013.3

    　More details

    Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

    In server migration service (SMS), computers called work places (WPs)are deployed at various locations in a network, and virtual servers for network applications (NW-Apps)may migrate between WPs to achieve better QoS. An SMS provider tries to provide an NW-App provider with a certain level of QoS that they agree upon, and if the SMS provider fails, it has to pay penalty (e.g., reimbursement of a part of service charges to users). Thus, the SMS provider is incentivized to migrate servers to satisfy the agreed-upon QoS level. 0n the other hand, an SMS provider also needs to be moderate in performing server migrations to avoid degradation of network QoS (i.e.,QoS of background traffic)caused by server migrations. This paper formulates an integer-programming model for the off-line server location decision (i.e., when and to which WP servers should migrate)where the penalty associated with NW-App's QoS violations is minimized, keeping the number and distance of server migrations below a given level. This paper also compares the minimum penalty obtained through solving the integer-programming model against the penalty obtained with a greedy on-line server locations decision algorithm, which migrates a server to a WP that minimizes the current penalty with no consideration of the penalty that will arise in the future. Numerical examples show that the integer-programming model achieves 36% to 49% lower penalty than the greedy algorithm when the degradation of network QoS is little acceptable.

    CiNii Article

    CiNii Books

    researchmap

  • 多重ルーティングテーブル法における予備テーブル数の低減

    今濱宇紀, 森田健悟, 大谷章太, 福島行信, 横平徳美

    電子情報通信学会大会講演論文集   2013 ( 2 )   82 - 82   2013.3

    　More details

    Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

    CiNii Article

    CiNii Books

    J-GLOBAL

    researchmap

  • Destination Selection Algorithms in Server Migration Service-A Case for Multiple Servers Migration-

    山中麻人, 福島行信, 村瀬勉, 横平徳美, 須田達也

    電子情報通信学会技術研究報告   112 ( 463(NS2012 165-289) )   391 - 396   2013.2

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • TCP Incast Avoidance Based on Connection Serialization

    長田繁幸, 梶田和俊, 福島行信, 横平徳美

    電子情報通信学会技術研究報告   112 ( 463(NS2012 165-289) )   249 - 254   2013.2

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • Optimal Locations of Servers in Server Migration Service

    福島行信, 村瀬勉, 横平徳美, 須田達也

    電子情報通信学会技術研究報告   112 ( 463(NS2012 165-289) )   385 - 390   2013.2

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • Decreasing of the Number of Backup Tables in Multiple Routing Table Method for Fast IP Network Recovery

    Daiki Imahama, Yukinobu Fukushima, Tokumi Yokohira

    The 28th International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC 2013)   823 - 826   2013

    　More details

  • Optimization of Server Locations in Server Migration Service

    Yukinobu Fukushima, Tutomu Murase, Tokumi Yokohira, Tatsuya Suda

    The Ninth International Conference on Networking and Services (ICNS 2013)   200 - 206   2013

    　More details

  • A Wavelength and Converter Assignment Scheme using Converter Usage History in Wavelength-Routed Networks

    Yukinobu Fukushima, Takahiro Ooishi, Tokumi Yokohira

    International Journal of Computer Networks & Communicationsd   5 ( 4 )   63 - 73   2013

    　More details

  • A Multi-splitting Method for Light-trail Networks

    Yukinobu Fukushima, Tokumi Yokohira

    The 28th International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC 2013)   803 - 806   2013

    　More details

  • A Per-burst Traffic Distribution Method for TCP Performance Improvement in Fixed Robust Routing

    Yu Sezaki, Yukinobu Fukushima, Takahiro Nabeta, Tokumi Yokohira

    The 28th International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC 2013)   819 - 822   2013

    　More details

  • 多重ルーティングテーブルを用いたルート迂回法の改良

    森田健悟, 今濱宇紀, 福島行信, 横平徳美

    電気・情報関連学会中国支部連合大会講演論文集(CD-ROM)   63rd   384 - 385   2012.10

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • Hybrid Robust Routing Taking Account of TCP Performance

    鍋田敬寛, 漆原和孝, CHEN Wenjie, 福島行信, 横平徳美

    電子情報通信学会技術研究報告   112 ( 9(CS2012 1-22) )   17 - 22   2012.4

    　More details

    Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

    Robust routing schemes are attracting attention as a routing scheme to achieve high robustness against changes in traffic patterns without performing both traffic measurement and dynamic change of traffic routes. This scheme, however, causes the performance degradation of TCP because it performs multipath routing and the out-of-order packet arrivals occur frequently. As a routing scheme to improve TCP performance while keeping high robustness against changes in traffic patterns, we proposed a robust routing scheme called MDD (Minimum Delay Difference). For every node-pair, the MDD selects the multiple routes with the minimum propagation delay difference between them as the candidate routes, and then derives the traffic distribution ratio of them so as to minimize the worst case link utilization ratio. According to the numerical example of the conventional research, however, TCP throughput of the MDD is about 70% of its ideal value and there is room for further improvement. In this paper, for the purpose of further improvement of TCP throughput, we propose a hybrid robust routing scheme. The scheme only selects a single candidate route for a predetermined ratio of node-pairs in order to avoid TCP performance degradation cause by packet reordering while it selects multiple candidate routes as well as the conventional scheme for the rest of node-pairs. Numerical examples show that, under the condition that the worst case link utilization ratio must be less than 1.0, our proposed scheme achieves at the maximum of 24% higher throughput than the MDD.

    CiNii Article

    CiNii Books

    J-GLOBAL

    researchmap

  • Hybrid Robust Routing Taking Account of TCP Performance

    NABETA Takahiro, URUSHIBARA Kazutaka, CHEN Wenjie, FUKUSHIMA Yukinobu, YOKOHIRA Tokumi

    IEICE technical report. Communication systems   112 ( 9 )   17 - 22   2012.4

    　More details

    Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

    Robust routing schemes are attracting attention as a routing scheme to achieve high robustness against changes in traffic patterns without performing both traffic measurement and dynamic change of traffic routes. This scheme, however, causes the performance degradation of TCP because it performs multipath routing and the out-of-order packet arrivals occur frequently. As a routing scheme to improve TCP performance while keeping high robustness against changes in traffic patterns, we proposed a robust routing scheme called MDD (Minimum Delay Difference). For every node-pair, the MDD selects the multiple routes with the minimum propagation delay difference between them as the candidate routes, and then derives the traffic distribution ratio of them so as to minimize the worst case link utilization ratio. According to the numerical example of the conventional research, however, TCP throughput of the MDD is about 70% of its ideal value and there is room for further improvement. In this paper, for the purpose of further improvement of TCP throughput, we propose a hybrid robust routing scheme. The scheme only selects a single candidate route for a predetermined ratio of node-pairs in order to avoid TCP performance degradation cause by packet reordering while it selects multiple candidate routes as well as the conventional scheme for the rest of node-pairs. Numerical examples show that, under the condition that the worst case link utilization ratio must be less than 1.0, our proposed scheme achieves at the maximum of 24% higher throughput than the MDD.

    CiNii Article

    CiNii Books

    researchmap

  • TCPスループットを考慮した複合型ロバストルーティング方式

    漆原和孝, 福島行信, 横平徳美

    電子情報通信学会大会講演論文集   2012 ( 2 )   138 - 138   2012.3

    　More details

    Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

    CiNii Article

    CiNii Books

    J-GLOBAL

    researchmap

  • B-7-41 Performance Improvement of an AS-friendly Peer Selection Algorithm for P2P Live Streaming

    Kobayashi Kazuki, Fukushima Yukinobu, Henmi Shuhei, Yokohira Tokumi

    Proceedings of the IEICE General Conference   2012 ( 2 )   202 - 202   2012.3

    　More details

    Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

    CiNii Article

    CiNii Books

    researchmap

  • B-6-150 Accuracy Verification and Improvement of Domestic AS Topology Generated Based on CAIDA Dataset

    Henmi Shuhei, Fukushima Yukinobu, Morita Kengo, Yokohira Tokumi

    Proceedings of the IEICE General Conference   2012 ( 2 )   150 - 150   2012.3

    　More details

    Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

    CiNii Article

    CiNii Books

    researchmap

  • B-6-138 Hybrid Robust Routing Taking Account of TCP Throughput

    Urushibara Kazutaka, Fukushima Yukinobu, Yokohira Tokumi

    Proceedings of the IEICE General Conference   2012 ( 2 )   138 - 138   2012.3

    　More details

    Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

    CiNii Article

    CiNii Books

    researchmap

  • P2PライブストリーミングにおけるASフレンドリーなピア選択法の性能改善

    小林和貴, 福島行信, 邉見修平, 横平徳美

    電子情報通信学会大会講演論文集   2012 ( 2 )   202 - 202   2012.3

    　More details

    Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

    CiNii Article

    CiNii Books

    J-GLOBAL

    researchmap

  • CAIDA Datasetに基づく国内ASトポロジーの精度検証と改善

    邉見修平, 福島行信, 森田健悟, 横平徳美

    電子情報通信学会大会講演論文集   2012 ( 2 )   150 - 150   2012.3

    　More details

    Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

    CiNii Article

    CiNii Books

    J-GLOBAL

    researchmap

  • Light-trail Multi-splitting Method in Light-trail Networks

    福島行信, 菊本大志, CHEN Wenjie, 横平徳美

    電子情報通信学会技術研究報告   111 ( 468(NS2011 179-275) )   463 - 468   2012.3

    　More details

    Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

    As a new optical network architecture that can be built with currently available devices and can achieve bandwidth allocation with granularity finer than a wavelength, the light-trail architecture attracts attention. For the light-trail architecture using token passing medium access control, the split trail architecture is proposed for improving the throughput. In the architecture, a trail is split into the upstream trail and the downstream trail at the token holding node and independent data transmissions on the two trails are permitted. However, the split trail architecture leaves the bandwidth of links upstream of the upstream-token holding node idle because the split of the trail is driven by the reception of only the downstream-token. In this paper, we propose the multi-split trail architecture for further improving the throughput. Our architecture utilizes the idle bandwidth by splitting the trail driven by the reception of both upstream- and downstream-tokens. We formulate the decision problem of the traffic accommodation where we optimize the token holding times so that the input traffic is successfully accommodated, as a linear programming problem. Then, we derive the maximum effective throughput of the multi-split trail architecture by solving the problem, and investigate the degree of improvement over the split trail architecture. According to numerical examples, the multi-split trail architecture achieves 1) the same maximum effective throughput as the split trail architecture for an uniform traffic pattern where every node pair has the same sending rate, and 2) about 1.93 times as high maximum effective throughput for its favorite traffic pattern where every transmission node sends data to its adjacent downstream node only and their rates are identical.

    CiNii Article

    CiNii Books

    J-GLOBAL

    researchmap

  • Light-trail Multi-splitting Method in Light-trail Networks

    FUKUSHIMA Yukinobu, KIKUMOTO Taishi, CHEN Wenjie, YOKOHIRA Tokumi

    IEICE technical report   111 ( 468 )   463 - 468   2012.3

    　More details

    Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

    As a new optical network architecture that can be built with currently available devices and can achieve bandwidth allocation with granularity finer than a wavelength, the light-trail architecture attracts attention. For the light-trail architecture using token passing medium access control, the split trail architecture is proposed for improving the throughput. In the architecture, a trail is split into the upstream trail and the downstream trail at the token holding node and independent data transmissions on the two trails are permitted. However, the split trail architecture leaves the bandwidth of links upstream of the upstream-token holding node idle because the split of the trail is driven by the reception of only the downstream-token. In this paper, we propose the multi-split trail architecture for further improving the throughput. Our architecture utilizes the idle bandwidth by splitting the trail driven by the reception of both upstream- and downstream-tokens. We formulate the decision problem of the traffic accommodation where we optimize the token holding times so that the input traffic is successfully accommodated, as a linear programming problem. Then, we derive the maximum effective throughput of the multi-split trail architecture by solving the problem, and investigate the degree of improvement over the split trail architecture. According to numerical examples, the multi-split trail architecture achieves 1) the same maximum effective throughput as the split trail architecture for an uniform traffic pattern where every node pair has the same sending rate, and 2) about 1.93 times as high maximum effective throughput for its favorite traffic pattern where every transmission node sends data to its adjacent downstream node only and their rates are identical.

    CiNii Article

    CiNii Books

    researchmap

  • Improvement of an ACK returning method of TCP proxies in network environment with wireless LANs

    Naohiro Honda, Wang Hui, Yuichi Nishida, Yukinobu Fukushima, Tokumi Yokohira

    1st IEEE Global Conference on Consumer Electronics 2012, GCCE 2012   704 - 708   2012

    　More details

  • Optimal TCP Receive Buffer Size under Packet Loss Environment

    Kazutoshi Kajita, Takumi Shinkai, Naohiro Honda, Yukinobu Fukushima, Tokumi Yokohira

    The 27th International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC 2012), CD-ROM (4 pages)   2012

    　More details

  • Destination Selection Algorithms in Server Migration Service

    中川真里, 山中麻人, 福島行信, 村瀬勉, 横平徳美, 須田達也

    電子情報通信学会技術研究報告   111 ( 232(NS2011 82-103) )   93 - 98   2011.10

    　More details

    Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

    Server migration service provides network applications (NW Apps) with server running environment on a computer (WP) and service of server migration to another WP where the NW App can attain better QoS when it is degraded. Because the file size of a server is large, the traffic for server migration causes QoS degradation of its background traffic. Thus, it is important to decrease the degree (impact) of the QoS degradation. In this paper, we propose three destination selection algorithms MIA, MRA and MCA that try to decrease the impact while increasing the number of NW App's clients whose SLA are satisfied. When a server migration is triggered, MIA, MRA and MCA move the server to the WP with the minimum impact, the WP with the maximum remaining space for servers and the WP with the maximum communication range where the SLA is satisfied, respectively. Numerical examples show that when there is no full-cover WP (on which a server can communicate with an arbitrary client while satisfying the SLA) or its space is small, MIA outperforms the others, otherwise MCA outperforms the others.

    CiNii Article

    CiNii Books

    J-GLOBAL

    researchmap

  • Destination Selection Algorithms in Server Migration Service

    NAKAGAWA Mari, YAMANAKA Asato, FUKUSHIMA Yukinobu, MURASE Tutomu, YOKOHIRA Tokumi, SUDA Tatsuya

    IEICE technical report   111 ( 232 )   93 - 98   2011.10

    　More details

    Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

    Server migration service provides network applications (NW Apps) with server running environment on a computer (WP) and service of server migration to another WP where the NW App can attain better QoS when it is degraded. Because the file size of a server is large, the traffic for server migration causes QoS degradation of its background traffic. Thus, it is important to decrease the degree (impact) of the QoS degradation. In this paper, we propose three destination selection algorithms MIA, MRA and MCA that try to decrease the impact while increasing the number of NW App's clients whose SLA are satisfied. When a server migration is triggered, MIA, MRA and MCA move the server to the WP with the minimum impact, the WP with the maximum remaining space for servers and the WP with the maximum communication range where the SLA is satisfied, respectively. Numerical examples show that when there is no full-cover WP (on which a server can communicate with an arbitrary client while satisfying the SLA) or its space is small, MIA outperforms the others, otherwise MCA outperforms the others.

    CiNii Article

    CiNii Books

    researchmap

  • 無線LAN混在環境におけるTCPプロキシのACK返送法の改良

    UHI Gyu, 西田裕一, 福島行信, 横平徳美

    電気・情報関連学会中国支部連合大会講演論文集(CD-ROM)   62nd   140 - 141   2011.10

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • IaaS型クラウドサービスにおけるQoSを考慮したサーバ移動アルゴリズム

    神崎康治, 中川真里, 福島行信, 村瀬勉, 横平徳美, 須田達也

    電子情報通信学会大会講演論文集   2011 ( 2 )   S.119-S.120 - 119"-"S-120"   2011.2

    　More details

    Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

    CiNii Article

    CiNii Books

    J-GLOBAL

    researchmap

  • BS-5-13 Server Migration Algorithms Taking Account of Qos in IaaS Cloud Service

    Kanzaki K, Nakagawa M, Fukushima Y, Murase T, Yokohira T, Suda T

    Proceedings of the IEICE General Conference   2011 ( 2 )   "S - 119"-"S-120"   2011.2

    　More details

    Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

    CiNii Article

    CiNii Books

    researchmap

  • Server Push-out Algorithms in Server Migration Service

    神崎康治, 福島行信, 村瀬勉, 横平徳美, 須田達也

    電子情報通信学会技術研究報告   110 ( 449(IN2010 144-210) )   163 - 168   2011.2

    　More details

    Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

    Server migration service is considered as one of IaaS-typed cloud services. The target of the service is such a application that consists of servers and their clients, and, each server works on a computer called a working place (WP) and can voluntarily migrate to another WP if necessary. However, if the destination WP is full of servers, a server in the WP may be forced to be pushed out of the current WP and migrate to another WP to accept the voluntary immigration server. In this paper, in order to protect some particular servers from experiencing voluntary migration or forced migration much more than the other servers, in the viewpoint of migration fairness, three methods to determine the candidates to be pushed out based on the numbers of voluntary migrations and forced migrations. Next, we propose two methods to determine such one pushed-out server from the candidates that the impact caused by forced migration against the network becomes as small as possible.

    CiNii Article

    CiNii Books

    J-GLOBAL

    researchmap

  • Server Push-out Algorithms in Server Migration Service

    KANZAKI Koji, FUKUSHIMA Yukinobu, MURASE Tutomu, YOKOHIRA Tokumi, SUDA Tatsuya

    IEICE technical report   110 ( 449 )   163 - 168   2011.2

    　More details

    Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

    Server migration service is considered as one of IaaS-typed cloud services. The target of the service is such a application that consists of servers and their clients, and, each server works on a computer called a working place (WP) and can voluntarily migrate to another WP if necessary. However, if the destination WP is full of servers, a server in the WP may be forced to be pushed out of the current WP and migrate to another WP to accept the voluntary immigration server. In this paper, in order to protect some particular servers from experiencing voluntary migration or forced migration much more than the other servers, in the viewpoint of migration fairness, three methods to determine the candidates to be pushed out based on the numbers of voluntary migrations and forced migrations. Next, we propose two methods to determine such one pushed-out server from the candidates that the impact caused by forced migration against the network becomes as small as possible.

    CiNii Article

    CiNii Books

    researchmap

  • Optimization of token holding times in split light trail networks

    Wenjie Chen, Yukinobu Fukushima, Tokumi Yokohira

    GLOBECOM - IEEE Global Telecommunications Conference   110 ( 339 )   197 - 202   2011

    　More details

    Language：English   Publisher：The Institute of Electronics, Information and Communication Engineers  

    DOI： 10.1109/GLOCOM.2011.6133810

    Scopus

    CiNii Article

    researchmap

  • Performance evaluation of TCP over multiple paths in fixed robust routing

    Wenjie Chen, Yukinobu Fukushima, Takashi Matsumura, Yuichi Nishida, Tokumi Yokohira

    2011 IEEE International Workshop Technical Committee on Communications Quality and Reliability, CQR 2011   2011

    　More details

  • Optimization of Token Holding Times in Split Light-trail Networks

    CHEN Wenjie, 福島行信, 横平徳美

    電子情報通信学会技術研究報告   110 ( 339(NS2010 105-141) )   197 - 202   2010.12

    　More details

    Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

    As a new optical network architecture that can be built with currently available devices and can achieve bandwidth allocation with granularity finer than a wavelength, the light trail architecture attracts attention. For the light trail architecture using token passing medium access control, the split trail architecture is proposed. In the architecture, a trail is split into the upstream trail and the downstream trail at the token holding node and independent data transmissions on the two trails are permitted. As a result, we expect that the architecture achieves higher maximum throughput than the original unsplit trail architecture. The degree of throughput improvement by the split trail one depends on how appropriately we set upstream and downstream token holding times of each transmission node. In this paper, we formulate decision problem of the token holding times as a non-linear programming problem, derive the maximum throughput of the split trail architecture by solving the problem using NUOPT solver, and investigate the degree of improvement compared to the original one. According to numerical examples, the split trail architecture achieves 1) the same maximum throughput as the original one for its unfavorite traffic pattern where every transmission node sends data to the terminating node of the trail only, 2) about 1.6 times as high maximum throughput for an uniform traffic pattern where every node pair has the same sending rate, and 3) about 1.9 time as high maximum throughput for its favorite traffic pattern where every transmission node sends data to its adjacent downstream node only.

    CiNii Article

    CiNii Books

    J-GLOBAL

    researchmap

  • P2Pライブストリーミングにおけるピア選択法の性能評価―部分的なASトポロジーのみが利用可能である場合―

    陶一然, 稲田和也, 辺見修平, 福島行信, 横平徳美

    電気・情報関連学会中国支部連合大会講演論文集(CD-ROM)   61st   324 - 325   2010.10

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • 無線LAN混在環境におけるスプリット型TCPプロキシの性能評価

    何旭明, 西田裕一, 王輝, 福島行信, 横平徳美

    電気・情報関連学会中国支部連合大会講演論文集(CD-ROM)   61st   349 - 350   2010.10

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • AS-friendly peer selection algorithms without AS topology information in P2P live streaming

    Yukinobu Fukushima, Yin Tao, Kazuya Inada, Tokumi Yokohira

    8th Asia-Pacific Symposium on Information and Telecommunication Technologies, APSITT 2010   1 - 6   2010.9

    　More details

  • マルチパスルーチングにおけるTCPの性能評価

    松村隆史, 福島行信, 西田裕一, 横平徳美

    電子情報通信学会大会講演論文集   2010   40   2010.8

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • B-6-40 Performance Evaluation of TCP over Multipath Routing

    Matsumura Takashi, Fukushima Yukinobu, Nishida Yuichi, Yokohira Tokumi

    Proceedings of the Society Conference of IEICE   2010 ( 2 )   40 - 40   2010.8

    　More details

    Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

    CiNii Article

    CiNii Books

    researchmap

  • 分散トラヒック計測に基づく増加トラヒックの早期検出

    二星護, 福島行信, 村瀬勉, 藤巻遼平, 広瀬俊亮, 横平徳美

    電子情報通信学会大会講演論文集   2010 ( 2 )   92 - 92   2010.3

    　More details

    Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

    CiNii Article

    CiNii Books

    J-GLOBAL

    researchmap

  • B-6-92 Early Detection of Increasing Traffic with Distributed Traffic Monitoring

    Niboshi M, Fukushima Y, Murase T, Fujimaki R, Hirose S, Yokohira T

    Proceedings of the IEICE General Conference   2010 ( 2 )   92 - 92   2010.3

    　More details

    Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

    CiNii Article

    CiNii Books

    researchmap

  • Early Detection of Increasing Traffic with Distributed Traffic Measuring

    二星護, 福島行信, 村瀬勉, 藤巻遼平, 広瀬俊亮, 横平徳美

    電子情報通信学会技術研究報告   109 ( 449(IN2009 144-215) )   331 - 336   2010.2

    　More details

    Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

    With the spread of broadband access lines, many services making efficient use of them such as video streaming services have appeared. The popularity of these services can cause problems such as the shortage of the Internet backbone capacity, so it is important to detect increasing traffic which cause these problems early. In this paper, we propose an early detection method (partial aggregation method) of increasing traffic under per-subnet based distributed traffic monitoring. The method estimates future overall traffic volume by taking account of estimated traffic volume in all subnets and the estimated number of subnets generating increasing traffic. We compare the proposed method to a previous method (aggregation method) which takes account of estimated traffic volume in all subnets only. The results show that the partial aggregation method can detect increasing traffic earlier than the aggregation method by a maximum of 90 days.

    CiNii Article

    CiNii Books

    J-GLOBAL

    researchmap

  • Early Detection of Increasing Traffic with Distributed Traffic Measuring

    NIBOSHI Mamoru, FUKUSHIMA Yukinobu, MURASE Tutomu, FUJIMAKI Ryohei, HIROSE Shunsuke, YOKOHIRA Tokumi

    IEICE technical report   109 ( 449 )   331 - 336   2010.2

    　More details

    Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

    With the spread of broadband access lines, many services making efficient use of them such as video streaming services have appeared. The popularity of these services can cause problems such as the shortage of the Internet backbone capacity, so it is important to detect increasing traffic which cause these problems early. In this paper, we propose an early detection method (partial aggregation method) of increasing traffic under per-subnet based distributed traffic monitoring. The method estimates future overall traffic volume by taking account of estimated traffic volume in all subnets and the estimated number of subnets generating increasing traffic. We compare the proposed method to a previous method (aggregation method) which takes account of estimated traffic volume in all subnets only. The results show that the partial aggregation method can detect increasing traffic earlier than the aggregation method by a maximum of 90 days.

    CiNii Article

    CiNii Books

    researchmap

  • Throughput Improvement based on Dynamic Trail Partitioning in Light-Trail Networks

    TANAKA Kota, CHEN Wenjie, FUKUSHIMA Yukinobu, YOKOHIRA Tokumi

    IEICE technical report   109 ( 448 )   479 - 484   2010.2

    　More details

    Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

    As a new optical network architecture that can be built with currently available devices, light trail networks attract attention. A trail is an unidirectional communication channel which is set up by reserving a specific wavelength along a route between a source node and a destination node, and packet communication from an arbitrary node to its downstream nodes is possible. Because a trail is a shared medium, we need medium access control (MAC) to avoid collisions of packets. Token passing type MAC methods such as light-trail fair access MAC (LT-FA MAC) and adaptive round time MAC (ART MAC) have been proposed. In those methods, however, downstream bandwidth of the token holding node is only used, and upstream bandwidth becomes idle. In this paper, we try to improve throughput of a trail by using those idle bandwidth effectively in a token passing type MAC method. In order to achieve this, we propose a dynamic trail partitioning method that dynamically partitions a trail into upstream trail and downstream one at the token holding node, and permits parallel transfer of data using two trails. Numerical calculations and simulations show that the dynamic trail partitioning method can improve throughput by a maximum of more than 80%.

    CiNii Article

    CiNii Books

    researchmap

  • Throughput Improvement based on Dynamic Trail Partitioning in Light-Trail Networks

    田中康太, CHEN Wenjie, 福島行信, 横平徳美

    電子情報通信学会技術研究報告   109 ( 448(NS2009 162-260) )   479 - 484   2010.2

    　More details

    Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

    As a new optical network architecture that can be built with currently available devices, light trail networks attract attention. A trail is an unidirectional communication channel which is set up by reserving a specific wavelength along a route between a source node and a destination node, and packet communication from an arbitrary node to its downstream nodes is possible. Because a trail is a shared medium, we need medium access control (MAC) to avoid collisions of packets. Token passing type MAC methods such as light-trail fair access MAC (LT-FA MAC) and adaptive round time MAC (ART MAC) have been proposed. In those methods, however, downstream bandwidth of the token holding node is only used, and upstream bandwidth becomes idle. In this paper, we try to improve throughput of a trail by using those idle bandwidth effectively in a token passing type MAC method. In order to achieve this, we propose a dynamic trail partitioning method that dynamically partitions a trail into upstream trail and downstream one at the token holding node, and permits parallel transfer of data using two trails. Numerical calculations and simulations show that the dynamic trail partitioning method can improve throughput by a maximum of more than 80%.

    CiNii Article

    CiNii Books

    J-GLOBAL

    researchmap

  • TCP-fox: A New Flow Control Method for Improving TCP Throughput in Large Bandwidth-Delay Product Networks

    Yuichi Nishida, Hiroyuki Ishihara, Wang Hui, Yukinobu Fukushima, Tokumi Yokohira

    International Symposium on Broadband Communication (ISBC) 2010   2010

    　More details

  • Performance Evaluation of TCP Proxies in Network Environment Including Wireless LANs

    Yuichi Nishida, Wang Hui, Yukinobu Fukushima, Tokumi Yokohira

    The 25th International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC 2010)   1231 - 1234   2010

    　More details

  • A burst assembly method to reduce end-to-end delay in optical burst switching networks

    Fukushima Yukinobu, Wenjie Chen, Fujiwara Yasuyuki, Tokumi Yokohira

    WSEAS Transactions on Communications   8   894 - 903   2009.11

    　More details

  • P2PライブストリーミングにおけるAS間トラヒックの低減を目指したピア選択法

    銀桃, 福島行信, 稲田和也, 横平徳美

    電気・情報関連学会中国支部連合大会講演論文集(CD-ROM)   60th   ROMBUNNO.21-17   2009.10

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • 光トレイル網におけるメディアアクセス制御方式の性能評価

    田中康太, 福島行信, 横平徳美

    電子情報通信学会大会講演論文集   2009 ( 2 )   174 - 174   2009.3

    　More details

    Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

    CiNii Article

    CiNii Books

    J-GLOBAL

    researchmap

  • B-6-13 Accuracy Improvement of Multi-Stage Change-Point Detection Scheme Based on Alert Weighting

    Wang En, Fukushima Yukinobu, Murase Tutomu, Fujimaki Ryohei, Hirose Syunsuke, Yokohira Tokumi

    Proceedings of the IEICE General Conference   2009 ( 2 )   13 - 13   2009.3

    　More details

    Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

    CiNii Article

    CiNii Books

    researchmap

  • B-7-32 Performance Evaluation of Light-Trail Networks with Cut-Through Function

    Chen Wenjie, Fukushima Yukinobu, Yokohira Tokumi

    Proceedings of the IEICE General Conference   2009 ( 2 )   176 - 176   2009.3

    　More details

    Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

    CiNii Article

    CiNii Books

    researchmap

  • カットスルー機能を備えた光トレイル網の性能評価

    CHEN Wenjie, 福島行信, 横平徳美

    電子情報通信学会大会講演論文集   2009 ( 2 )   176 - 176   2009.3

    　More details

    Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

    CiNii Article

    CiNii Books

    J-GLOBAL

    researchmap

  • アラートの重み付けによる階層型変化点検出方式の精度改善

    WANG En, 福島行信, 村瀬勉, 藤巻遼平, 広瀬俊亮, 横平徳美

    電子情報通信学会大会講演論文集   2009 ( 2 )   13 - 13   2009.3

    　More details

    Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

    CiNii Article

    CiNii Books

    J-GLOBAL

    researchmap

  • Performance Evaluation of Peer Selection Algorithms for P2P Live Streaming

    FUJIWARA Yasuyuki, FUKUSHIMA Yukinobu, YIN Tao, INADA Kazuya, YOKOHIRA Tokumi

    IEICE technical report   108 ( 458 )   423 - 428   2009.2

    　More details

    Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

    In this paper, we propose two peer selection algorithms to increase the number of joining peers and decrease the traffic amount between ASs in P2P live streaming, where we assume that the number (logical hop count) of relaying peers is limited by a predetermined value in order to keep real-time property of live streaming. In the first method, a newly joining peer selects such providing peers that the logical hop count is minimum to increase the number of joining peers. And then if there are several such providing peers, the newly joining peer selects such providing peers that the number (physical hop count) of ASs between the newly joining peer and each of the providing peers is minimum to decrease the traffic amount between ASs. In the second peer selection method, a newly joining peer selects providing peers in the reverse order of the first selection method. Simulation results show that the former increases the number of joining peers compared to the latter. Moreover, when the number of joining peers is small (large), the traffic amount between ASs in the latter (the former) is smaller.

    CiNii Article

    CiNii Books

    researchmap

  • Performance evaluation of AS-friendly peer selection algorithms for P2P live streaming

    Yukinobu Fukushima, Kazuya Inada, Yin Tao, Yasuyuki Fujiwara, Tokumi Yokohira

    2009 15th Asia-Pacific Conference on Communications, APCC 2009   866 - 870   2009

    　More details

  • Throughput Improvement of TCP using Split-Connection Type Proxies in Network Environment including Wireless LANs

    Yuichi Nishida, Wang Hui, Hiroaki Matsumoto, Hiroyuki Ishihara, Tokumi Yokohira, Yukinobu Fukushima

    The 24th International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC 2009   1360 - 1363   2009

    　More details

  • Dynamic splitting of light trails for increasing throughput in light trail networks

    FUKUSHIMA Y.

    Proceedings of ITC-CSCC, July 2009   1370 - 1373   2009

    　More details

  • Performance Evaluation of Medium Access Control Methods in Light Trail Networks

    Yukinobu Fukushima, Kota Tanaka, Tokumi Yokohira

    11TH INTERNATIONAL CONFERENCE ON ADVANCED COMMUNICATION TECHNOLOGY, VOLS I-III, PROCEEDINGS,   2009 ( 2 )   1421 - 1425   2009

    　More details

  • Performance evaluation of AS-friendly peer selection algorithms for P2P live streaming

    Yukinobu Fukushima, Kazuya Inada, Yin Tao, Yasuyuki Fujiwara, Tokumi Yokohira

    2009 15th Asia-Pacific Conference on Communications, APCC 2009   108 ( 458(IN2008 132-221) )   866 - 870   2009

    　More details

  • 光バースト交換網におけるオフセット期間中の到着パケットもバースト化するバースト生成法の性能比較

    野稲泰寛, 福島行信, 横平徳美

    電子情報通信学会大会講演論文集   2008 ( 2 )   150 - 150   2008.3

    　More details

    Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

    CiNii Article

    CiNii Books

    J-GLOBAL

    researchmap

  • BS-5-2 Detection of Worm Epidemics Based on a Change in the Number of Destination IP Addresses in Multi-Stage Change-Point Detection Scheme

    Niboshi Mamoru, Murase Tutomu, Kobayashi Masayoshi, Fujimaki Ryohei, Fukushima Yukinobu, Yokohira Tokumi

    Proceedings of the IEICE General Conference   2008 ( 2 )   "S - 60"-"S-61"   2008.3

    　More details

    Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

    CiNii Article

    CiNii Books

    researchmap

  • B-7-73 Performance Comparison of Burst Assembly Methods Assembling Packets Arriving during an Offset Period into a Burst in Optical Burst Switching Networks

    Noine Yasuhiro, Fukushima Yukinobu, Yokohira Tokumi

    Proceedings of the IEICE General Conference   2008 ( 2 )   150 - 150   2008.3

    　More details

    Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

    CiNii Article

    CiNii Books

    researchmap

  • 階層型変化点検出機構における宛先IPアドレス数の変化に基づくワーム拡散の検出

    二星護, 村瀬勉, 小林正好, 藤巻遼平, 福島行信, 横平徳美

    電子情報通信学会大会講演論文集   2008 ( 2 )   S.60-S.61 - 60"-"S-61"   2008.3

    　More details

    Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

    CiNii Article

    CiNii Books

    J-GLOBAL

    researchmap

  • Performance Evaluation of Multi-Stage Change-Point Detection Scheme against DDoS Attacks by Random Scan Worms

    Tutomu Murase, Yukinobu Fukushima, Masayoshi Kobayashi, Sakiko Nishimoto, Ryohei Fujimaki, Tokumi Yokohira

    IEEE Communications Society Communications Quality and Reliability Workshop 2008 (CQR 2008)   2008

    　More details

  • A throughput optimization algorithm for TCP connections with different routes in long-delay satellite environments

    Wang Hui, Nobuto Watanabe, Shigeyuki Osada, Tokumi Yokohira, Yukinobu Fukushima

    25th AIAA International Communications Satellite Systems Conference   2007.12

    　More details

  • 同時多発イベント検出を目的とした階層型変化点検出機構の性能評価

    王遠, 村瀬勉, 小林正好, 藤巻遼平, 福島行信, 横平徳美

    電気・情報関連学会中国支部連合大会講演論文集(CD-ROM)   58th   ROMBUNNO.21-11   2007.10

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • Retransmission Control in TCP with a Performance Enhancing Proxy

    西田裕一, 横平徳美, 福島行信

    電子情報通信学会技術研究報告   107 ( 221(NS2007 53-79) )   77 - 82   2007.9

    　More details

    Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

    In order to improve TCP performance in networks with large round trip time, a method using a PEP (Performance Enhancing Proxy) is a proposed. In the method, the PEP is located on a intermediate router along a TCP connection, and returns acknowlegdment packets (premture ACKs) to the source host instead of the destination host. In previous researches, although a congestion control in the PEP which keeps the number of prematurely acknowledged packets below a threshold (watermark) value has been proposed, packet losses are not taken into account. In this paper, we incorporate a retransmission control to deal with packet losses into the congestion control. the proposed retransmission control mainly has two functions. One is to return duplicate premature ACKs to solicit the fast retransmission in the source host, and the other is to retransmit packets by timeouts and receive of duplicate acknowledgments from the destination host. In addition, TCP selective acknowledgment (SACK) option is supported in the PEP. If the source host can treat the option, the PEP returns premature ACKs with the option.

    CiNii Article

    CiNii Books

    J-GLOBAL

    researchmap

  • Retransmission Control in TCP with a Performance Enhancing Proxy

    NISHIDA Yuichi, YOKOHIRA Tokumi, FUKUSHIMA Yukinobu

    IEICE technical report   107 ( 221 )   77 - 82   2007.9

    　More details

    Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

    In order to improve TCP performance in networks with large round trip time, a method using a PEP (Performance Enhancing Proxy) is a proposed. In the method, the PEP is located on a intermediate router along a TCP connection, and returns acknowlegdment packets (premture ACKs) to the source host instead of the destination host. In previous researches, although a congestion control in the PEP which keeps the number of prematurely acknowledged packets below a threshold (watermark) value has been proposed, packet losses are not taken into account. In this paper, we incorporate a retransmission control to deal with packet losses into the congestion control. the proposed retransmission control mainly has two functions. One is to return duplicate premature ACKs to solicit the fast retransmission in the source host, and the other is to retransmit packets by timeouts and receive of duplicate acknowledgments from the destination host. In addition, TCP selective acknowledgment (SACK) option is supported in the PEP. If the source host can treat the option, the PEP returns premature ACKs with the option.

    CiNii Article

    CiNii Books

    researchmap

  • A Wavelength and Converter Assignment Scheme for Decreasing Blocking Probability in Wavelength-Routed Networks

    Yukinobu Fukushima, Takahiro Ooishi, Tokumi Yokohira

    The 12th OptoElectronics and Communication Conference and The 16th International Conference on Integrated Optics and Optical Fiber Communication (OECC/IOCC 2007)   454 - 455   2007

    　More details

  • Performance Evaluation of a Multi-Stage Network Anomaly Detection Scheme for Decreasing the False-Positive Rate against a Large Number of Simultaneous, Unknown Events

    村瀬勉, 福島行信, 小林正好, 藤原弘輝, 横平徳美

    電子情報通信学会技術研究報告   106 ( 358(IN2006 89-113) )   25 - 30   2006.11

    　More details

    Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

    Change-point detection schemes are a promising approach for detecting network anomalies such as attacks and infections by unknown viruses and worms. They detect those behaviors as change-points. In general, however, because they also detect false-positive change-points, those caused by other factors such as hardware troubles, we need a scheme that only detects true-positive change-points caused by attacks and infections. True-positive change-points tend to occur simultaneously, and the number of true-positive change-points is very large, while false-positive change-points tend to occur sporadically. We exclude false-positive change-points by neglecting change-points that occur sporadically, based on information gathered from the whole network. In this paper, we propose a multi-stage network anomaly detection scheme that aggregates change-point information from distributed IDSs (Intrusion Detection Systems) and detects the true-positive change-points. Simulation results illustrate that, compared to a scheme using only one IDS, our method always yields a smaller false-positive rate, a reduction of up to 98%, under a constraint that the detection rate of the true-positive change-points must exceed 0.99.

    CiNii Article

    CiNii Books

    J-GLOBAL

    researchmap

  • Performance Evaluation of a Multi-Stage Network Anomaly Detection Scheme for Decreasing the False-Positive Rate against a Large Number of Simultaneous, Unknown Events

    MURASE Tutomu, FUKUSHIMA Yukinobu, KOBAYASHI Masayoshi, FUJIWARA Hiroki, YOKOHIRA Tokumi

    IEICE technical report   106 ( 358 )   25 - 30   2006.11

    　More details

    Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

    Change-point detection schemes are a promising approach for detecting network anomalies such as attacks and infections by unknown viruses and worms. They detect those behaviors as change-points. In general, however, because they also detect false-positive change-points, those caused by other factors such as hardware troubles, we need a scheme that only detects true-positive change-points caused by attacks and infections. True-positive change-points tend to occur simultaneously, and the number of true-positive change-points is very large, while false-positive change-points tend to occur sporadically. We exclude false-positive change-points by neglecting change-points that occur sporadically, based on information gathered from the whole network. In this paper, we propose a multi-stage network anomaly detection scheme that aggregates change-point information from distributed IDSs (Intrusion Detection Systems) and detects the true-positive change-points. Simulation results illustrate that, compared to a scheme using only one IDS, our method always yields a smaller false-positive rate, a reduction of up to 98%, under a constraint that the detection rate of the true-positive change-points must exceed 0.99.

    CiNii Article

    CiNii Books

    researchmap

  • 性能改善プロキシを用いたTCPにおける公平性の検討

    渡辺暢人, 長田繁幸, 福島行信, 横平徳美

    電気・情報関連学会中国支部連合大会講演論文集(CD-ROM)   57th   532 - 533   2006.10

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • 光バースト交換網におけるエンド間遅延の低減を目指したバースト生成法

    福島行信, 永原一輝, 野稲泰寛, 横平徳美

    電気・情報関連学会中国支部連合大会講演論文集(CD-ROM)   57th   530 - 531   2006.10

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • Design of wavelength-convertible edge nodes in wavelength-routed networks

    Yukinobu Fukushima, Hiroaki Harai, Shin'ichi Arakawa, Masayuki Murata

    Journal of Optical Networking   5 ( 3 )   196 - 209   2006

    　More details

  • Throughput Optimization for TCP with an Active Proxy in Long-Delay Satellite Environments

    Wang Hui, Shigeyuki Osada, Tokumi Yokohira, Yukinobu Fukushima, Deng Chaolong, Kiyohiko Okayama, Nariyoshi Yamai

    2006 Joint Conference on Satellite Communications (JC-SAT 2006)   2006

    　More details

  • Throughput optimization in TCP with a performance enhancing proxy

    Shigeyuki Osada, Wang Hui, Tokumi Yokohira, Yukinobu Fukushima, Kiyohiko Okayama, Nariyoshi Yamai

    2006 10TH INTERNATIONAL CONFERENCE ON COMMUNICATION TECHNOLOGY, VOLS 1 AND 2, PROCEEDINGS   106 ( 236(NS2006 70-98) )   392 - +   2006

    　More details

  • Deployment of Wavelength Converters in Wavelength-Routed Overlay Networks

    FUKUSHIMA Yukinobu, HARAI Hiroaki, ARAKAWA Shinichi, MURATA Masayuki

    IEICE technical report. Information networks   105 ( 323 )   13 - 18   2005.10

    　More details

    Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

    Wavelength converters reduce connection blocking probability in wavelength-routed networks by eliminating the wavelength continuity constraint. We develop a method for deployment of wavelength converters in wavelength-routed overlay networks. In these networks, most wavelength converters are deployed on edge nodes to cover the difference in the numbers of wavelengths multiplexed on access and core links. Therefore reduction of wavelength converter cost on edge nodes leads to minimizing the wavelength converter cost in the whole network. We propose an ingress edge node architecture with fixed wavelength converters that are more economical than full wavelength converters. In our architecture, each input access link of ingress edge nodes is equipped with fixed wavelength converters and input wavelengths from the access links are evenly distributed on the output core link. As a result, competition for a free wavelength on an output core link is avoided. Simulation results show that our edge node architecture offers more than 46% cost reduction.

    CiNii Article

    CiNii Books

    J-GLOBAL

    researchmap

  • Deployment of Wavelength Converters in Wavelength-Routed Overlay Networks

    FUKUSHIMA Yukinobu, HARAI Hiroaki, ARAKAWA Shinichi, MURATA Masayuki

    IEICE technical report. Information networks   105 ( 323 )   13 - 18   2005.10

    　More details

    Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

    Wavelength converters reduce connection blocking probability in wavelength-routed networks by eliminating the wavelength continuity constraint. We develop a method for deployment of wavelength converters in wavelength-routed overlay networks. In these networks, most wavelength converters are deployed on edge nodes to cover the difference in the numbers of wavelengths multiplexed on access and core links. Therefore reduction of wavelength converter cost on edge nodes leads to minimizing the wavelength converter cost in the whole network. We propose an ingress edge node architecture with fixed wavelength converters that are more economical than full wavelength converters. In our architecture, each input access link of ingress edge nodes is equipped with fixed wavelength converters and input wavelengths from the access links are evenly distributed on the output core link. As a result, competition for a free wavelength on an output core link is avoided. Simulation results show that our edge node architecture offers more than 46% cost reduction.

    CiNii Article

    researchmap

  • On the robustness of planning methods for traffic changes in WDM networks

    Y Fukushima, H Harai, S Arakawa, M Murata

    JOURNAL OF OPTICAL NETWORKING   4 ( 1 )   11 - 25   2005.1

    　More details

  • Distributed clustering method for large-scaled wavelength routed networks

    Y Fukushima, H Harai, S Arakawa, M Murata

    2005 Workshop on High Performance Switching and Routing   416 - 420   2005

    　More details

  • Distributed Clustering Method for Large-Scaled Wavelength Routed Networks

    FUKUSHIMA Yukinobu, HARAI Hiroaki, ARAKAWA Shin'ichi, MURATA Masayuki

    電子情報通信学会技術研究報告. PN, フォトニックネットワーク   104 ( 518 )   1 - 6   2004.12

    　More details

    Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

    The scalability of routing table length is indispensable for constructing large-scaled WDM network. Hierarchical routing yields enormous reduction in routing table length, but it also yields increase in path length. In wavelength-routed networks, the increase in path length leads to increase in blocking probability because of less probability to find idle wavelengths on the longer paths. However, if the longer paths have more wavelength resources, we expect that the blocking probability does not get worse. In this paper, we propose a new node-clustering method that maximizes the number of lightpaths between nodes. The key idea of our method is to construct the node-clusters that have much wavelength resources from the ingress border nodes to the egress border nodes, which increases the wavelength resources on routes of lightpaths between nodes. We evaluate blocking probability of lightpath requests and table length by simulation experiments. The results show that our proposed method greatly reduces the table length, while the blocking probability is almost the same as the results with no clustering.

    CiNii Article

    CiNii Books

    researchmap

  • Distributed Clustering Method for Large-Scaled Wavelength Routed Networks

    福島行信, 原井洋明, 荒川伸一, 村田正幸

    電子情報通信学会技術研究報告   104 ( 518(PN2004 68-75) )   1 - 6   2004.12

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • Planning and Design Methods for WDM Networks Robust against Traffic Changes

    FUKUSHIMA Yukinobu, HARAI Hiroaki, ARAKAWA Shin'ichi, MURATA Masayuki, MIYAHARA Hideo

    Technical report of IEICE. PS   103 ( 1 )   11 - 16   2003.4

    　More details

    Language：English   Publisher：The Institute of Electronics, Information and Communication Engineers  

    Many researches have been investigated on planning or designing WDM networks assuming that the future traffic demand is known beforehand. Practically, it is difficult to predict the future traffic demand accurately since there are various types of data traffic with different traffic characteristics. In this paper, we propose a scheme to design a WDM network that will accommodate as much traffic as possible against a variety of traffic patterns, that is, robust WDM network. The straightforward way to meet this objective is to design a network to maximize the volume of traffic accommodated in the future. To achieve this simply, we divide the WDM network design problem into two subproblems, the OXC-deployment problem and the fiber-deployment problem. In both problems, we propose schemes to maximize the volume of traffic demand that can be accommodated in the future by taking into account the maximum flow value of each node-pair. We handle those problems by incrementally extending network resources based on the ADD algorithm. By deploying network resources until they reach a condition that a robust WDM network needs to fulfill, we can design a robust WDM network. We compare our proposed scheme with the existing method using various traffic matrices. The results show that the WDM network designed by our method can accommodate more traffic demand than the one, designed by the existing method with the same cost.

    CiNii Article

    CiNii Books

    researchmap

  • A design method for logical topologies with consideration of wavebands

    Yukinobu Fukushima, Shin'ichi Arakawa, Masayuki Murata, Hideo Miyahara

    IFIP Advances in Information and Communication Technology   114   360 - 376   2003

    　More details

  • An Enhanced Minimum Interference Routing Algorithm for Multi-Period Planning of WDM Lightpath Networks without Traffic Prediction

    FUKUSHIMA Y., HARAI H., ARAKAWA S., MURATA M., MIYAHARA H.

    IEICE technical report. Information networks   102 ( 213 )   7 - 12   2002.7

    　More details

    Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

    It is difficult to predict future traffic precisely although it is assumed that the amount of future traffic is predictable in many researches on a multi-period planning for WDM networks. In this paper, we propose a wave-length-routing algorithm that maximizes the number of accommodated lightpaths without precise prediction of future traffic demand. Since our algorithm reduces the number of leased fibers, it can be effectively applied to a multi-period planning for WDM networks. We show that the proposed algorithm reduces the number of leased fibers more than the existing algorithm does while it accommodates lightpaths more.

    CiNii Article

    CiNii Books

    researchmap

  • A minimum interference routing algorithm for multi-period planning of wdm lightpath networks without traffic prediction

    Yukinobu Fukushima, Hiroaki Harai, Shin'iehi Arakawa, Masayuki Murata, Hideo Miyahara

    European Conference on Optical Communication, ECOC   3   2002

    　More details

  • A minimum interference routing algorithm for multi-period planning of wdm lightpath networks without traffic prediction

    Yukinobu Fukushima, Hiroaki Harai, Shin'iehi Arakawa, Masayuki Murata, Hideo Miyahara

    European Conference on Optical Communication, ECOC   3 ( 213(IN2002 33-41) )   7 - 12   2002

    　More details

    Language：Japanese  

    Scopus

    J-GLOBAL

    researchmap

  • A Design Method of Logical Topology with Considering Available Wave-bands on Each Fiber.

    福島行信, 荒川伸一, 村田正幸, 宮原秀夫

    電子情報通信学会技術研究報告   101 ( 196(RCS2001 62-78) )   33 - 38   2001.7

    　More details

    Language：Japanese  

    J-GLOBAL

    researchmap

  • A Design Method of Logical Topology with Considering Available Wave-bands on Each Fiber

    FUKUSHIMA Yukinobu, ARAKAWA Shin'ishi, MURATA Masayuki, MIYAHARA Hideo

    IEICE technical report   101 ( 194 )   33 - 38   2001.7

    　More details

    Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

    Among several architectures for IP(Internet Protocol)over WDM networks, one promising way is to overlay a logical topology consisting of lightpaths over the physical WDM network such that each lightpath carries IP traffic between edge nodes. The conventional design methods of the logical topology consider the case that the constant number of wavelengths are available on each fiber. However, a current optical technology provides several wave-bands and the order of thousands wavelengths, by deploying additional optical fiber amplifiers, and hence the number of available wavelengths depends on the number of optical fiber amplifiers deployed on a fiber. In this paper, we propose a new heuristic algorithm to design a logical topology with a least number of optical fiber amplifiers. We then compare our proposal with conventional methods in terms of the average packet delays, throughput, and show that our algorithm reduces the number of optical fiber amplifiers. We also investigate the effect of increasing the number of wavelengths multiplexed on fiber, by asssuming the product of the number of available wavelengh and the bandwidth of a wavelength to be constant. The results show that the logical topology can accommodate more traffic volume by the large number of wavelengths multiplexed on the fiber, which confirms that the results yield a Cao's Law.

    CiNii Article

    CiNii Books

    researchmap

  • A Design Method of Logical Topology with Considering Available Wave-bands on Each Fiber

    FUKUSHIMA Yukinobu, ARAKAWA Shin'ichi, MURATA Masayuki, MIYAHARA Hideo

    Technical report of IEICE. RCS   101 ( 196 )   33 - 38   2001.7

    　More details

    Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

    Among several architectures for IP(Internet Protocol)over WDM networks, one promising way is to overlay a logical topology consisting of lightpaths over the physical WDM network such that each lightpath carries IP traffic between edge nodes. The conventional design methods of the logical topology consider the case that the constant number of wavelengths are available on each fiber. However, a current optical technology provides several wave-bands and the order of thousands wavelengths, by deploying additional optical fiber amplifiers, and hence the number of available wavelengths depends on the number of optical fiber amplifiers deployed on a fiber. In this paper, we propose a new heuristic algorithm to design a logical topology with a least number of optical fiber amplifiers. We then compare our proposal with conventional methods in terms of the average packet delays, throughput, and show that our algorithm reduces the number of optical fiber amplifiers. We also investigate the effect of increasing the number of wavelengths multiplexed on fiber, by assuming the product of the number of available wavelength and the bandwidth of a wavelength to be constant. The results show that the logical topology can accommodate more traffic volume by the large number of wavelengths multiplexed on the fiber, which confirms that the results yield a Cao's Law.

    CiNii Article

    researchmap

▼display all

Industrial property rights

Awards

  • Best Paper Award

    2024.5   ICN2024   Application of a Deep Reinforcement Learning Algorithm to Virtual Machine Migration Control in Multi-Stage Information Processing Systems

    Yukinobu Fukushima, Yuki Koujitani, Kazutoshi Nakane, Yuya Tarutani, Celimuge Wu, Yusheng Ji, Tokumi Yokohira, Tutomu Murase

    　More details

  • 情報ネットワーク研究会優秀発表賞

    2024.2   電子情報通信学会情報ネットワーク研究会   多段階情報処理システムにおけるVM移動制御への深層強化学習の適用

    糀谷友貴, 中根和俊, 樽谷優弥, 策力木格, 計 宇生(NII, 横平徳美, 村瀬 勉, 福島行信

    　More details

Research Projects

  • 超リアルタイムサービスを指向したネットワーク制御における特徴量エンジニアリン グ

    Grant number：23K11065  2023.04 - 2026.03

    日本学術振興会  科学研究費助成事業  基盤研究(C)

    福島 行信

    　 More details

    Grant amount：\4680000 （ Direct expense: \3600000 、 Indirect expense：\1080000 ）

    researchmap

  • Construction of a medical information secure management system using ICT and encryption technology

    Grant number：20K20484  2019.06 - 2023.03

    Japan Society for the Promotion of Science  Grants-in-Aid for Scientific Research Grant-in-Aid for Challenging Research (Pioneering)  Grant-in-Aid for Challenging Research (Pioneering)

    野上 保之, 日下 卓也, 福島 行信, 横平 徳美, 山内 利宏

    　 More details

    Grant amount：\25350000 （ Direct expense: \19500000 、 Indirect expense：\5850000 ）

    効率のよい秘密鍵暗号実装のための乱数生成法の提案，ブロック暗号ベースの検索可能暗号の実装について研究を進めた．ペアリング暗号を活用した公開鍵暗号ベースの検索可能暗号の実装，個人情報保護のための可変長セキュリティ公開鍵暗号について着手した．データベース・秘密分散について，TCPインキャストの対策研究を行った．メールシステムについて，本研究で開発する拡散暗号法をプロトコルスタック内のどのプロトコルレイヤに対して適用することが望ましいかを検討した．その結果，メールの送信者から受信者までのエンドツーエンドでの暗号化通信を可能とするPGPやS/MIMEに対して拡散暗号法を適用するのが最も望ましいとの結論に至った．このようにエンドツーエンドでの暗号化通信を担うプロトコルレイヤに対して拡散暗号法を適用することにより，拡散暗号法を利用できるユーザは送信者と受信者のみに限定されるものの，その一方で，送信者から受信者までの通信路上のすべての通信区間および中継ホスト（メールサーバ）において，メールが拡散暗号法により暗号化された状態を保つことが可能となる．メールシステムで，メールサーバを運用するサーバ計算機のセキュリティを向上させるために，Linuxにおいて標準で採用されているSELinuxに着目し，SELinuxのセキュリティポリシを細粒度に削減する手法を提案し，その実現方式を示した．この手法によって，SELinuxで標準で配布しているセキュリティポリシから不要なポリシ記述を削減でき，メールサーバで必要となる操作のみを許可するセキュリティポリシを生成できる．これにより，メールサーバプログラムや他のプログラムに脆弱性があったとしても，必要最小限の操作しか許可されず，被害を抑制することが期待できる．また，仮想計算機モニタを利用して，ゲストOSでのプログラム実行の証拠を保
    全するシステムの検討を行った．

    researchmap

  • Construction of a medical information secure management system using ICT and encryption technology

    Grant number：19H05579  2019.06 - 2023.03

    Japan Society for the Promotion of Science  Grants-in-Aid for Scientific Research Challenging Research (Pioneering)  Challenging Research (Pioneering)

    野上 保之, 福島 行信, 横平 徳美, 山内 利宏

    　 More details

    Grant amount：\25350000 （ Direct expense: \19500000 、 Indirect expense：\5850000 ）

    researchmap

  • データセンターネットワークにおけるスループット急落の回避に関する研究

    Grant number：19K11926  2019.04 - 2022.03

    日本学術振興会  科学研究費助成事業 基盤研究(C)  基盤研究(C)

    横平 徳美, 福島 行信

    　 More details

    Grant amount：\4290000 （ Direct expense: \3300000 、 Indirect expense：\990000 ）

    分散ファイルシステムを採用している最近のデータセンターのネットワークにおいては、多数のサーバが、ほぼ同時に(並列に)、1台のコンピュータ(クライアント)に向けてデータを送信しようとすることがしばしば起こる。このとき、イーサネットスイッチのポートにおいてバッファーオーバーフローが起こり、スループットが０に近い値に急落するという最悪の状況(インキャスト)が起こってしまうことがある。本研究の目的は、分散ファイルシステムにおいて、各サーバのデータ送信終了時間の公平性を気にする必要はなく、全サーバがデータ送信を終了するための時間が重要であることに着目して、サーバからのデータ送信を直列化することにより、インキャストを回避しつつスループットを最大にする方法を考案し、実際に実験ネットワークでその有効性を実証することである。
    2019年度は、データセンターネットワークにおける各リンクの伝送速度、イーサネットスイッチのポートバッファサイズ、サーバから送信されるデータ量(ユニットサイズ)等が与えられた時、インキャストを回避し、かつ、スループットを最大化できる同時設定(同時に並列化できる)コネクション数を求めることができるように、従来筆者らが提案しているコネクション直列化法を拡張した方法(拡張コネクション直列化法)を考案した。
    また、高精度のカーネルタイマーを使用して、最小タイムアウト値を従来の200ミリ秒から数100マイクロ秒にすることにより、インキャストを回避しようとする従来の方法において、クライアントからサーバに再送要求を出すことで、インキャスト回避の可能性を高くできる方法を提案した。
    さらに、上述した方法を統合して、実際のデータセンターネット上で動作できるようにするための基礎的検討を行った。

    researchmap

  • Development of energy-efficient virtual network mapping technologies

    Grant number：15K00129  2015.04 - 2018.03

    Japan Society for the Promotion of Science  Grants-in-Aid for Scientific Research Grant-in-Aid for Scientific Research (C)  Grant-in-Aid for Scientific Research (C)

    Fukushima Yukinobu

    　 More details

    Grant amount：\4940000 （ Direct expense: \3800000 、 Indirect expense：\1140000 ）

    It is indispensable to decrease the Internet's power consumption. In this research, we tackle an energy-efficient virtual network mapping problem where we map requested virtual networks on the physical network so that the power consumption associated with the mapping is minimized. We first obtain the theoretical lower bound on the power consumption with mathematical programming. Then, we develop a heuristic that achieves the near-optimal power consumption in polynomial time.

    researchmap

  • Power efficient traffic engineering technologies in all-optical networks

    Grant number：24500081  2012.04 - 2015.03

    Japan Society for the Promotion of Science  Grants-in-Aid for Scientific Research Grant-in-Aid for Scientific Research (C)  Grant-in-Aid for Scientific Research (C)

    FUKUSHIMA Yukinobu

    　 More details

    Grant amount：\4810000 （ Direct expense: \3700000 、 Indirect expense：\1110000 ）

    In this research, I try to develop power-efficient traffic engineering technologies that reduce power consumptions of all-optical networks with spatial and temporal traffic aggregations. Computer simulations clarify that (1) our routing and wavelength assignment method that makes use of spatial traffic aggregation achieves at most 9% lower power consumption than a conventional method, and (2) our medium access control method that makes use of temporal traffic aggregation achieves at most 60% lower power consumption for the network load of 0.1 compared with when the network load is 0.9.

    researchmap

  • Routing and medium access control technologies in new generation all-optical networks

    Grant number：22700073  2010 - 2011

    Japan Society for the Promotion of Science  Grants-in-Aid for Scientific Research Grant-in-Aid for Young Scientists (B)  Grant-in-Aid for Young Scientists (B)

    FUKUSHIMA Yukinobu

    　 More details

    Grant amount：\2600000 （ Direct expense: \2000000 、 Indirect expense：\600000 ）

    In this research, I try to develop(1) a routing technology that is equipped with high robustness against traffic changes and high friendliness with an upper layer protocol, and(2) a medium access control technology that maximizes communication capacity. Numerical calculations and computer simulations clarify that(1) our proposed routing method achieves at a maximum of 27% higher TCP throughput than a conventional method while keeping the robustness against traffic changes, and(2) our proposed medium access control method achieves at a maximum of 1. 94 times higher throughput than a conventional method.

    researchmap

  • Scalable lightpath establishment method for realizing high throughput in next-generation backbone networks

    Grant number：19760257  2007 - 2008

    Japan Society for the Promotion of Science  Grants-in-Aid for Scientific Research Grant-in-Aid for Young Scientists (B)  Grant-in-Aid for Young Scientists (B)

    FUKUSHIMA Yukinobu

    　 More details

    Grant amount：\2500000 （ Direct expense: \2200000 、 Indirect expense：\300000 ）

    本研究の目的は、スケーラブル(拡張性がある)かつ高いスループットを実現する(より多くのトラヒックを収容可能である)次世代基幹網を実現することである。これを達成するために、通信チャネルである光パスを設定する際に経路上の資源利用情報および各ノードペアの過去の波長変換器使用履歴に基づいて適切に波長変換箇所を決定することによりスケーラビリティおよびスループットの向上を実現する光パス設定方式を考案した。シミュレーション評価により、考案方式はスループットを向上させること、および、大規模網へも適用可能であることを明らかにした。

    researchmap

▼display all

 

Class subject in charge

  • UNIX Programming （2024academic year） 1st semester  - 月5～6,木1～2

  • Electrical and Electronic Engineering Experiments B （2024academic year） 3rd and 4th semester  - 火3～7

  • Computer Networks A （2024academic year） Fourth semester  - 月1～2,木5～6

  • Computer Networks A （2024academic year） Fourth semester  - 月1～2,木5～6

  • Computer Networks I （2024academic year） Fourth semester  - 月1～2,木5～6

  • Introduction to Security （2024academic year） 3rd and 4th semester  - 月7～8

  • Introduction to Information Security （2024academic year） 3rd and 4th semester  - 月7～8

  • Seminar in Network Systems （2024academic year） Other  - その他

  • Seminar in Network Systems （2024academic year） Year-round  - その他

  • Network Systems （2024academic year） Late  - その他

  • Communication and Network Engineering Experiments B （2024academic year） 3rd and 4th semester  - 火3～7

  • Network Design （2024academic year） Late  - 月5～6

  • Network Design （2024academic year） Late  - 月5～6

  • Multimedia Engineering （2024academic year） Summer concentration  - その他

  • Multimedia Engineering （2024academic year） Summer concentration  - その他

  • Distributed Date Management Training （2024academic year） Summer concentration  - その他

  • Introduction to Information Technology, Electrical Engineering, and Mathematical and Data Sciences Program （2024academic year） Third semester  - 水1

  • Introduction to Information Technology, Electrical Engineering, and Mathematical and Data Sciences Program （2024academic year） Third semester  - 水2

  • Introduction to Information Technology, Electrical Engineering, and Mathematical and Data Sciences Program （2024academic year） Third semester  - 水1

  • Introduction to Information Technology, Electrical Engineering, and Mathematical and Data Sciences Program （2024academic year） Third semester  - 水2

  • Engineering English （2024academic year） Late  - その他

  • Engineering English（Communication Network Engineering） （2024academic year） Late  - 木3～4

  • Advanced Study （2024academic year） Other  - その他

  • Technical Writing （2024academic year） Prophase  - その他

  • Technical Writing（Communication Network Engineering） （2024academic year） Prophase  - 水6～8

  • Technical Presentation（Communication Network Engineering） （2024academic year） Late  - 水6～8

  • Communication Protocols I （2024academic year） Fourth semester  - 月1～2,木5～6

  • Specific Research of Electronics and Information Systems Engineering （2024academic year） Year-round  - その他

  • Electrical and Communication Engineering Lab B （2024academic year） 3rd and 4th semester  - その他

  • （L17）Network Design （2024academic year） special  - その他

  • UNIX Programming （2024academic year） 1st semester  - 月5～6,木1～2

  • Undergraduate Research Experience 2 （2024academic year） special  - その他

  • Undergraduate Research Experience 3 （2024academic year） special  - その他

  • UNIX Programming （2023academic year） 1st semester  - 月5～6,木1～2

  • Electrical and Electronic Engineering Experiments B （2023academic year） 3rd and 4th semester  - 火3～7

  • Computer Networks A （2023academic year） Fourth semester  - 月1～2,木5～6

  • Computer Networks A （2023academic year） Fourth semester  - 月1～2,木5～6

  • Computer Networks I （2023academic year） Fourth semester  - 月1～2,木5～6

  • Introduction to Security （2023academic year） 3rd and 4th semester  - 月7～8

  • Introduction to Information Security （2023academic year） 3rd and 4th semester  - 月7～8

  • Seminar in Network Systems （2023academic year） Year-round  - その他

  • Seminar in Network Systems （2023academic year） Other  - その他

  • Seminar in Network Systems （2023academic year） Year-round  - その他

  • Network Systems （2023academic year） Late  - その他

  • Network Systems （2023academic year） Late  - その他

  • Communication and Network Engineering Experiments B （2023academic year） 3rd and 4th semester  - 火3～7

  • Network Design （2023academic year） Late  - 月5～6

  • Network Design （2023academic year） Late  - 月5～6

  • Distributed Date Management Training （2023academic year） Summer concentration  - その他

  • Introduction to Information Technology, Electrical Engineering, and Mathematical and Data Sciences Program （2023academic year） Third semester  - 水1～2

  • Introduction to Information Technology, Electrical Engineering, and Mathematical and Data Sciences Program （2023academic year） Third semester  - 水1～2

  • Introduction to Information Technology, Electrical Engineering, and Mathematical and Data Sciences Program （2023academic year） Third semester  - 水1～2

  • Introduction to Information Technology, Electrical Engineering, and Mathematical and Data Sciences Program （2023academic year） Third semester  - 水1～2

  • Engineering English （2023academic year） Late  - その他

  • Engineering English（Communication Network Engineering） （2023academic year） Late  - 木3～4

  • Advanced Study （2023academic year） Other  - その他

  • Technical Writing （2023academic year） Prophase  - その他

  • Technical Writing（Communication Network Engineering） （2023academic year） Prophase  - 水6～8

  • Communication Protocols I （2023academic year） Fourth semester  - 月1～2,木5～6

  • Specific Research of Electronics and Information Systems Engineering （2023academic year） Year-round  - その他

  • Electrical and Communication Engineering Lab B （2023academic year） 3rd and 4th semester  - その他

  • （L17）Network Design （2023academic year） special  - その他

  • UNIX Programming （2023academic year） 1st semester  - 月5～6,木1～2

  • UNIX Programming （2022academic year） 1st semester  - 月5～6,木1～2

  • Computer Networks A （2022academic year） Fourth semester  - 月7～8,木5～6

  • Computer Networks A （2022academic year） Fourth semester  - 月7～8,木5～6

  • Computer Networks I （2022academic year） Fourth semester  - 月7～8,木5～6

  • Introduction to Security （2022academic year） 3rd and 4th semester  - 水7～8

  • Seminar in Network Systems （2022academic year） Year-round  - その他

  • Network Systems （2022academic year） Late  - その他

  • Network Design （2022academic year） Late  - 月3,月4

  • Programming Language Exercise I （2022academic year） 1st semester  - 月5～6,木1～2

  • Distributed Date Management Training （2022academic year） Summer concentration  - その他

  • Special Lectures III （2022academic year） special  - その他

  • Communication Protocols I （2022academic year） Fourth semester  - 月7～8,木5～6

  • Specific Research of Electronics and Information Systems Engineering （2022academic year） Year-round  - その他

  • UNIX Programming （2021academic year） 1st semester  - 月7,月8,木1,木2

  • Introduction to Security （2021academic year） 3rd and 4th semester  - 水7,水8

  • Seminar in Network Systems （2021academic year） Year-round  - その他

  • Network Systems （2021academic year） Late  - その他

  • Network Design （2021academic year） Late  - 月3,月4

  • Programming （2021academic year） 3rd and 4th semester  - 水1,水2

  • Programming （2021academic year） 3rd and 4th semester  - 水1,水2

  • Programming 1 （2021academic year） Third semester  - 水1,水2

  • Programming 2 （2021academic year） Fourth semester  - 水1,水2

  • Programming Language Exercise I （2021academic year） 1st semester  - 月7,月8,木1,木2

  • Distributed Date Management Training （2021academic year） Summer concentration  - その他

  • Special Lectures III （2021academic year） special  - その他

  • Specific Research of Electronics and Information Systems Engineering （2021academic year） Year-round  - その他

  • UNIX Programming （2020academic year） 1st semester  - 月7,月8,木1,木2

  • Exercises on Cross-site Scripting Prevention （2020academic year） Summer concentration  - その他

  • Basic of information security E （2020academic year） 3rd and 4th semester  - 水7,水8

  • Seminar in Network Systems （2020academic year） Year-round  - その他

  • Network Systems （2020academic year） Late  - その他

  • Network Design （2020academic year） Late  - 月3,月4

  • Programming （2020academic year） 3rd and 4th semester  - 水1,水2

  • Programming 1 （2020academic year） Third semester  - 水1,水2

  • Programming 2 （2020academic year） Fourth semester  - 水1,水2

  • Programming Language Exercise I （2020academic year） 1st semester  - 月7,月8,木1,木2

  • Collision-based Attack on Cryptography for Security Evaluation （2020academic year） Summer concentration  - その他

  • Cryptographic Hardware Security （2020academic year） Fourth semester  - その他

  • Special Lectures III （2020academic year） special  - その他

  • Specific Research of Electronics and Information Systems Engineering （2020academic year） Year-round  - その他

  • Topics in Electronic and Information Systems Engineering （2020academic year） Prophase  - 金1,金2

▼display all