Details of the Researcher

PHOTO

Go Hasegawa
Section
Research Institute of Electrical Communication
Job title
Professor
Degree
  • Ph.D (Osaka University)

Profile
Go Hasegawa received the M.E. and D.E. degrees in Information and Computer Sciences from Osaka University, Japan, in 1997 and 2000, respectively. From July 1997 to June 2000, he was Research Assistant of Graduate School of Economics, Osaka University. From 2000 to 2018, he was an Associate Professor of Cybermedia Center, Osaka University. He is now a Professor of Research Institute of Electrical Communication, Tohoku University. His research work is in the area of information network architecture. He is a member of the IEEE and IEICE.

Research History 4

  • 2019/04 - Present
    Tohoku University Research Institute of Electrical Communication Professor

  • 2002/01 - 2019/03
    Osaka University Cybermedia Center Associate Professor

  • 2000/07 - 2001/12
    Osaka University Cybermedia Center Research Assistant

  • 1997/07 - 2000/06
    Osaka University Graduate School of Economics Research Assistant

Education 3

  • Osaka University Graduate School of Engineering Science

    1997/04 - 1997/06

  • Osaka University Master Course, Graduate School of Engineering Science

    1995/04 - 1997/03

  • Osaka University Faculty of Engineering Science

    1992/04 - 1995/03

Committee Memberships 9

  • 電子情報通信学会 通信ソサイエティ英文論文誌編集委員長

    2024/06 - Present

  • 電子情報通信学会 コミュニケーションクオリティ(CQ)研究専門委員会副委員長

    2020 - Present

  • 電子情報通信学会 通信ソサイエティ編集会議副編集長

    2022/06 - 2024/05

  • 電子情報通信学会 コミュニケーションクオリティ(CQ)研究専門委員会委員

    2019 - 2020

  • 電子情報通信学会 通信ソサイエティ英文論文誌編集副委員長

    2017 - 2018

  • 電子情報通信学会 ネットワークシステム(NS)研究専門委員会委員 (2011-2017)

    2011 - 2017

  • 電子情報通信学会 通信ソサイエティ研専運営会議総務幹事 (2012-2014)

    2012 - 2014

  • 電子情報通信学会 コミュニケーションクオリティ(CQ)研究専門委員会委員

    2002 - 2010

  • 電子情報通信学会 通信ソサイエティ英文論文誌編集委員(2002-2008)

    2002 - 2008

Show all ︎Show first 5

Professional Memberships 2

  • IEEE Communication Society

  • 電子情報通信学会

Research Interests 3

  • トランスポートアーキテクチャ

  • インターネット

  • コンピュータネットワーク

Research Areas 1

  • Informatics / Information networks / Network Architecture

Awards 29

  1. IEEE ICOIN 2024 Best Paper Award

    2024/01

  2. 情報ネットワーク研究専門委員会2021年研究賞

    2022 電子情報通信学会

  3. 第29回マルチメディア通信と分散処理ワークショプ優秀論文賞

    2021 情報処理学会

  4. CQR 2020 Best Paper Award

    2020 IEEE

  5. ネットワークシステム研究専門委員会2019年研究賞

    2019 電子情報通信学会

  6. 電子情報通信学会教育功労賞 (2019.3)

    2019

  7. 電子情報通信学会ネットワークシステム研究専門委員会2017年活動功労賞

    2017

  8. 電子情報通信学会ネットワークシステム研究専門委員会2016年研究賞 (2件)

    2016

  9. 平成26年度電子情報通信学会通信ソサイエティ活動功労賞

    2014

  10. 平成25年度大阪大学総長奨励賞(研究部門)

    2013

  11. 平成24年度大阪大学総長奨励賞(研究部門)

    2012

  12. IEEE CQR 2012 Workshop Best Paper Award

    2012

  13. 平成23年度電子情報通信学会通信ソサイエティ活動功労賞

    2011

  14. AICT 2011 Best Paper Award

    2011

  15. 平成22年度電子情報通信学会論文賞

    2010

  16. 平成22年度電子情報通信学会情報通信マネジメント功労賞

    2010

  17. 平成22年度電子情報通信学会通信ソサイエティ活動功労賞

    2010

  18. 電子情報通信学会情報通信マネジメント研究専門委員会2009年度研究賞

    2009

  19. International Academy, Research, and Industry Association (IARIA) Fellow, 2009.

    2009

  20. ICN 2009 Best Paper Award

    2009

  21. UBICOMM 2009 Best Paper Award

    2009

  22. 第3回電子情報通信学会通信ソサイエティ論文賞

    2008

  23. ICN 2008 Best Paper Award

    2008

  24. IEEE CQR 2008 Workshop Best Paper Award

    2008

  25. 平成19年度電子情報通信学会通信ソサイエティ活動功労賞

    2007

  26. ICIMP 2007 Best Paper Award

    2007

  27. 電子情報通信学会情報ネットワーク研究専門委員会2006年度研究賞

    2006

  28. 6th Asia-Pacific Symposium on Information and Telecommunication Technologies (APSITT 2005) Best Paper Award

    2005

  29. 電子情報通信学会テレコミュニケーションマネージメント研究専門委員会2001年度研究賞

    2001

Show all ︎Show 5

Papers 255

  1. Design, discussion, and its potential performance evaluation of in-network congestion control Peer-reviewed

    Mitsuhiro Watanabe, Go Hasegawa

    IEICE Transactions on Information and Systems 2025/11

  2. ネットワーク機器の遠隔管理のためのトラヒック圧縮技術のシステムログ圧縮への応用

    田中道志郎, 長谷川剛, 宮本凌竹, 都司柾貴, 豊田和志

    電子情報通信学会技術研究報告 125 (24) 59-64 2025/05

  3. Compressed Transmission of Remote Network Management Information with Synchronized Context-Aware Dictionary Peer-reviewed

    Go Hasegawa, Ryotaka Miyamoto, Masaki Tsuji, Kazushi Toyoda

    Proceedings of IEEE HSPR 2025 2025/05

  4. 不確かな情報下での自動車クラウドセンシングにおける 観測の即時性を考慮した分散型部分観測マルコフ決定過程の検討

    小川祐紀雄, 長谷川剛, 村田正幸

    電子情報通信学会技術研究報告 124 (420) 1-6 2025/03

  5. 多スタート局所最適法に基づく障害耐性の高いアプリケーションシステムの実装形態と冗長構成の決定手法

    本田渉, 長谷川剛, 中平佳裕, 鹿嶋正幸

    電子情報通信学会技術研究報告 124 (344) 1-6 2025/01

  6. Overcoming Fairness and Latency Challenges in BBR With an Adaptive Delay Detection

    Zewei Han, Go Hasegawa

    IEEE Access 2025

    DOI: 10.1109/ACCESS.2025.3545088  

  7. ネットワーク内輻輳制御ノードにおけるPID制御に基づくバッファリング機構

    田淵友規, 長谷川剛

    電子情報通信学会技術研究報告 124 (312) 86-91 2024/12

  8. 複数フロー競合時においても高スループット・低遅延を実現する輻輳制御アルゴリズムの提案

    狩野佳祐, 内海哲史, Salahuddin Muhammad Salim Zabir, 長谷川剛

    電子情報通信学会技術研究報告 124 (197) 17-19 2024/10

  9. ネットワーク機器の遠隔管理のための情報圧縮技術の実データを用いた性能評価

    長谷川剛, 宮本凌竹, 都司柾貴, 豊田和志

    電子情報通信学会技術研究報告 124 (199) 1-6 2024/10

  10. 線形計画法を用いた複数クラスを有する仮想網の省電力資源割当

    中平佳裕, 鹿嶋正幸, 更科昌弘, 長谷川剛

    電子情報通信学会技術研究報告 124 (181) 9-14 2024/09

  11. BBRのRTT公平性を向上するための動的パラメータ設定手法

    韓澤偉, 長谷川剛

    電子情報通信学会技術研究報告 124 (139) 25-30 2024/07

  12. ローカル観測情報を用いた競合フロー数推定に関する研究

    夏澤佑, 長谷川剛

    電子情報通信学会技術研究報告 124 (139) 37-41 2024/07

  13. Machine learning-based estimation of the number of competing flows at a bottleneck link

    Zeyou Xia, Go Hasegawa

    NOMS 2024-2024 IEEE Network Operations and Management Symposium 1-4 2024/05/06

    Publisher: IEEE

    DOI: 10.1109/noms59830.2024.10574929  

  14. ネットワーク内制御に基づく輻輳制御機構のスループットに関する実験的評価

    田淵友規, 渡邉光裕, 長谷川剛

    電子情報通信学会技術研究報告 124 (14) 47-52 2024/05

  15. サービスの実装形態がアプリケーションシステムの可用性へ与える影響の解析的評価に関する一検討

    本田渉, 長谷川剛

    電子情報通信学会技術研究報告 124 (14) 53-58 2024/05

  16. BBR-R: Improving BBR’s RTT Fairness by Dynamically Adjusting Delay Detection Intervals

    Zewei Han, Go Hasegawa

    Proceedings of IEEE AINA 2024 67-77 2024/04/11

    Publisher: Springer Nature Switzerland

    DOI: 10.1007/978-3-031-57840-3_7  

    ISSN: 2367-4512

    eISSN: 2367-4520

  17. In-network congestion control toward enhanced network resource utilization

    Mitsuhiro Watanabe, Go Hasegawa

    2024 International Conference on Information Networking (ICOIN) 227-232 2024/01/17

    Publisher: IEEE

    DOI: 10.1109/icoin59985.2024.10572066  

  18. ネットワーク内輻輳制御アーキテクチャの大規模ネットワークを想定した性能評価

    渡邉光裕, 長谷川剛

    電子情報通信学会技術研究報告 vol. 123, no. 317 1-6 2023/12

  19. Adaptive compression of operational commands for remote network management over LPWA

    Kodai Tanabe, Go Hasegawa, Gen Kitagata

    2023 33rd International Telecommunication Networks and Applications Conference 51-56 2023/11/29

    Publisher: IEEE

    DOI: 10.1109/itnac59571.2023.10368487  

  20. A New Congestion-Based Congestion Control for Low Latency and Low Packet Drop Rate

    Satoshi Utsumi, Go Hasegawa

    2023 Fourteenth International Conference on Ubiquitous and Future Networks (ICUFN) 248-253 2023/07/04

    Publisher: IEEE

    DOI: 10.1109/icufn57995.2023.10200349  

  21. LPWAを用いた小規模IoT機器向けの移動エージェントフレームワークの提案 Peer-reviewed

    坂本和也, 北形元, 長谷川剛

    情報処理学会論文誌 64 (5) 1031-1040 2023/05

  22. Traffic reduction for out-of-band network management over LPWA

    Kodai Tanabe, Go Hasegawa, Gen Kitagata

    2023 International Conference on Information Networking (ICOIN) 218-223 2023/01/11

    Publisher: IEEE

    DOI: 10.1109/icoin56518.2023.10048968  

  23. Optimal Energy Scheduling for Communities in Smart Microgrids with Multi-Agent Reinforcement Learning.

    Hongyang Yang, Xun Shao, Go Hasegawa, Hiroshi Masui

    IIAI-AAI 381-387 2023

    DOI: 10.1109/IIAI-AAI59060.2023.00081  

  24. Distributed Smart Multihome Energy Management Based on Federated Deep Reinforcement Learning.

    Liwei Peng, Fan He, Go Hasegawa, Yanfen Cheng, Xun Shao

    ICPADS 1173-1180 2023

    DOI: 10.1109/ICPADS60453.2023.00171  

  25. Energy Optimization of Distributed Video Processing System using Genetic Algorithm with Bayesian Attractor Model

    Hideyuki Shimonishi, Masayuki Murata, Go Hasegawa, Nattaon Techasarntikul

    2023 IEEE 9th International Conference on Network Softwarization: Boosting Future Networks through Advanced Softwarization, NetSoft 2023 - Proceedings 35-43 2023

    Publisher:

    DOI: 10.1109/NetSoft57336.2023.10175483  

  26. Performance Analysis of Mobile Cellular Networks Accommodating Cellular-IoT Communications with Immediate Release of Radio Resources

    Shuya Abe, Go Hasegawa, Masayuki Murata

    IEICE Transactions on Communications E105B (12) 1477-1486 2022/12

    DOI: 10.1587/transcom.2022EBP3052  

    ISSN: 0916-8516

    eISSN: 1745-1345

  27. Improving per-flow fairness by ML-based estimation of competing flows’ congestion control algorithm

    Keito Maeta, Gen Kitagata, Go Hasegawa

    2022 Thirteenth International Conference on Ubiquitous and Future Networks (ICUFN) 376-381 2022/07/05

    Publisher: IEEE

    DOI: 10.1109/icufn55119.2022.9829701  

  28. Improving Inter-Protocol Fairness Based on Estimated Behavior of Competing Flows

    Satoshi Utsumi, Go Hasegawa

    2022 IFIP Networking Conference (IFIP Networking) 1-9 2022/06/13

    Publisher: IEEE

    DOI: 10.23919/ifipnetworking55013.2022.9829780   10.1587/bplus.17.68_references_DOI_8noh0gv3aapoULNMgsYCBpWwD3w   10.23919/comex.2024xbl0014_references_DOI_8jTeqEfKhjZ2qXeQ8vajDsUqiZG  

  29. Probabilistic Control of Dynamic Crowds Toward Uniform Spatial-Temporal Coverage

    Yukio Ogawa, Go Hasegawa, Masayuki Murata

    IEEE Transactions on Mobile Computing 1-17 2022

    Publisher:

    DOI: 10.1109/TMC.2022.3231530  

    ISSN: 1536-1233

    eISSN: 1558-0660

  30. An Online Orchestration Mechanism for General-Purpose Edge Computing

    Xun Shao, Go Hasegawa, Mianxiong Dong, Zhi Liu, Hiroshi Masui, Yusheng Ji

    IEEE Transactions on Services Computing 1-1 2022

    Publisher: Institute of Electrical and Electronics Engineers (IEEE)

    DOI: 10.1109/tsc.2022.3164149  

    eISSN: 1939-1374 2372-0204

  31. UONA: User-Oriented Network slicing Architecture for beyond-5G networks

    Go Hasegawa, Satoshi Hasegawa, Shin'ichi Arakawa, Masayuki Murata

    ICC 2021 - IEEE International Conference on Communications 1-6 2021/06

    Publisher: IEEE

    DOI: 10.1109/icc42927.2021.9500653  

  32. Refining Calculation Algorithm for Packet Pacing Rate of BBR

    Go Hasegawa, Satoshi Utsumi

    2021 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR 2021) 1-6 2021/05/13

    Publisher: IEEE

    DOI: 10.1109/cqr39960.2021.9446211  

    More details Close

    BBR developed by Google tunes its packet pacing rate for achieving full bandwidth utilization and no buffering delay at the bottleneck link. However, when multiple BBR flows share the bottleneck link, the sum of pacing rates exceeds the available bandwidth, causing large buffering delay. In this paper, we first describe the reason why BBR flows overload the bottleneck link with mathematical discussions and point out that it is due to the essential characteristics of BBR. We then propose a novel algorithm that calculates appropriate pacing rate. More specifically, the proposed method determines the pacing rate based on moving average of the observed throughput, while the original BBR exploits the maximum observed throughput. Moreover, the proposed method adaptively configures the parameter for searching the unused bandwidth of the bottleneck link. Simulation results show that the proposed algorithm can achieve almost full bandwidth utilization of the bottleneck link as well as small buffering delay.

  33. Optimizing functional split of baseband processing on TWDM-PON based fronthaul network

    Go Hasegawa, Masayuki Murata, Yoshihiro Nakahira, Masayuki Kashima, Shingo Ata

    Proceedings - 2020 16th International Conference on Mobility, Sensing and Networking, MSN 2020 330-336 2020/12/01

    Publisher: Institute of Electrical and Electronics Engineers Inc.

    DOI: 10.1109/MSN50589.2020.00061  

  34. Performance Analysis of Periodic Cellular-IoT Communication with Immediate Release of Radio Resources

    Shuya Abe, Go Hasegawa, Masayuki Murata

    2020 IEEE International Workshop Technical Committee on Communications Quality and Reliability, CQR 2020 1-6 2020/05

    Publisher:

    DOI: 10.1109/CQR47547.2020.9101378  

  35. System and application performance of function placement strategies for virtualized mobile fronthaul/backhaul networks Peer-reviewed

    Go Hasegawa, Rina Yamasaki, Masayuki Murata

    Proceedings of IEEE 23rd Conference on Innovation in Clouds, Internet and Networks 95-101 2020/02

    Publisher:

    DOI: 10.1109/icin48450.2020.9059427  

  36. Joint Optimization of Computing Resources and Data Allocation for Mobile Edge Computing (MEC): An Online Approach Peer-reviewed

    Xun Shao, Go Hasegawa, Noriaki Kamiyama, Zhi Liu, Hiroshi Masui, Yusheng Ji

    in Proceedings of 28th International Conference on Computer Communications and Networks (ICCCN 2019) 2019/08

    DOI: 10.1109/icccn.2019.8847046  

  37. Experimental evaluation of mobile core networks on simultaneous access from m2m/iot terminals Peer-reviewed

    Masaki Ueno, Go Hasegawa, Masayuki Murata

    International Conference on Information Networking 2019-January 13-18 2019/05/17

    Publisher: IEEE

    DOI: 10.1109/ICOIN.2019.8718176  

    ISSN: 1976-7684

  38. Biochemical-Inspired Autonomous Control of Virtualized Network Functions Peer-reviewed

    Ryota Kurokawa, Go Hasegawa, Masayuki Murata

    International Conference on Information Networking 2019-January 387-392 2019/05/17

    Publisher: IEEE

    DOI: 10.1109/ICOIN.2019.8718124  

    ISSN: 1976-7684

  39. Hierarchical and frequency-aware model predictive control for bare-metal cloud applications Peer-reviewed

    Yukio Ogawa, Go Hasegawa, Masayuki Murata

    Proceedings - 11th IEEE/ACM International Conference on Utility and Cloud Computing, UCC 2018 11-20 2019/01/04

    DOI: 10.1109/UCC.2018.00010  

    ISSN: 2373-6860

  40. Effects of C/U Plane Separation and Bearer Aggregation in Mobile Core Network Peer-reviewed

    Shuya Abe, Go Hasegawa, Masayuki Murata

    IEEE Transactions on Network and Service Management 15 (2) 611-624 2018/06

    Publisher:

    DOI: 10.1109/TNSM.2018.2797301  

    ISSN: 1932-4537

  41. Lightweight Boolean Network Tomography Based on Partition of Managed Networks Peer-reviewed

    Nagao Ogino, Takeshi Kitahara, Shinichi Arakawa, Go Hasegawa, Masayuki Murata

    Journal of Network and Systems Management 26 (2) 284-313 2018/04

    DOI: 10.1007/s10922-017-9416-1  

    ISSN: 1064-7570

  42. Prediction-based cloud bursting approach and its impact on total cost for business-critical web systems Peer-reviewed

    Yukio Ogawa, Go Hasegawa, Masayuki Murata

    IEICE Transactions on Communications E100B (11) 2007-2016 2017/11

    DOI: 10.1587/transcom.2016NNP0006  

    ISSN: 0916-8516

    eISSN: 1745-1345

  43. Design and performance evaluation of bearer aggregation method in mobile core network with C/U plane separation Peer-reviewed

    Shuya Abe, Go Hasegawa, Masayuki Murata

    2017 IFIP Networking Conference, IFIP Networking 2017 and Workshops 2018-January 1-8 2017/07/02

    Publisher:

    DOI: 10.23919/IFIPNetworking.2017.8264829  

  44. Tandem Equipment Arranged Architecture with Exhaust Heat Reuse System for Software-Defined Data Center Infrastructure Peer-reviewed

    Yoshiaki Taniguchi, Koji Suganuma, Takaaki Deguchi, Go Hasegawa, Yutaka Nakamura, Norimichi Ukita, Naoki Aizawa, Katsuhiko Shibata, Kazuhiro Matsuda, Morito Matsuoka

    IEEE TRANSACTIONS ON CLOUD COMPUTING 5 (2) 182-192 2017/04

    DOI: 10.1109/TCC.2015.2440245  

    ISSN: 2168-7161

  45. Priority control based on website categories in edge computing Peer-reviewed

    Noriaki Kamiyama, Yuusuke Nakano, Kohei Shiomoto, Go Hasegawa, Masayuki Murata, Hideo Miyahara

    Proceedings - IEEE INFOCOM 2016-September 776-781 2016/09/06

    DOI: 10.1109/INFCOMW.2016.7562182  

    ISSN: 0743-166X

  46. Investigating structure of modern web traffic Peer-reviewed

    Noriaki Kamiyama, Yuusuke Nakano, Kohei Shiomoto, Go Hasegawa, Masayuki Murata, Hideo Miyahara

    IEEE International Conference on High Performance Switching and Routing, HPSR 2016-June 2016/06/01

    DOI: 10.1109/HPSR.2015.7483102  

    ISSN: 2325-5595

    eISSN: 2325-5609

  47. Webパフォーマンス測定プラットフォームの提案と評価 Peer-reviewed

    中野雄介, 上山憲昭, 塩本公平, 長谷川剛, 村田正幸, 宮原秀夫

    電子情報通信学会論文誌 B J99-B (4) 313-322 2016/04

  48. Biochemically-inspired method for constructing service space in virtualized network system Peer-reviewed

    Go Hasegawa, Masayuki Murata

    Proceedings of International Conference on Innovations in Clouds, Internet and Networks (ICIN 2016) 2016/03

  49. A Workload Assignment Policy for Reducing Power Consumption in Software-Defined Data Center Infrastructure Peer-reviewed

    Takaaki Deguchi, Yoshiaki Taniguchi, Go Hasegawa, Yutaka Nakamura, Norimichi Ukita, Kazuhiro Matsuda, Morito Matsuoka

    IEICE TRANSACTIONS ON COMMUNICATIONS E99B (2) 347-355 2016/02

    DOI: 10.1587/transcom.2015EBP3267  

    ISSN: 0916-8516

    eISSN: 1745-1345

  50. 生化学反応モデルに着想を得た仮想ネットワーク機能の配置手法

    長谷川 剛

    電子情報通信学会技術研究報告 vol. 115, no. 507 25-30 2016

  51. 化学反応式モデルに基づく仮想サービス配置手法の安定性評価

    長谷川 剛

    電子情報通信学会技術研究報告 vol. 115, no. 209 23-28 2016

  52. Reducing Power Consumption in Data Center by Predicting Temperature Distribution and Air Conditioner Efficiency with Machine Learning Peer-reviewed

    Yuya Tarutani, Kazuyuki Hashimoto, Go Hasegawa, Yutaka Nakamura, Takumi Tamura, Kazuhiro Matsuda, Morito Matsuoka

    PROCEEDINGS 2016 IEEE INTERNATIONAL CONFERENCE ON CLOUD ENGINEERING (IC2E) 226-227 2016

    DOI: 10.1109/IC2E.2016.39  

    ISSN: 2373-3845

  53. Priority Control Based on Website Categories in Edge Computing Peer-reviewed

    Noriaki Kamiyama, Yuusuke Nakano, Kohei Shiomoto, Go Hasegawa, Masayuki Murata, Hideo Miyahara

    2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) 2016-September 776-781 2016

    DOI: 10.1109/INFCOMW.2016.7562182  

    ISSN: 2159-4228

  54. Cloud Bursting Approach Based on Predicting Requests for Business-Critical Web Systems Peer-reviewed

    Yukio Ogawa, Go Hasegawa, Masayuki Murata

    2017 INTERNATIONAL CONFERENCE ON COMPUTING, NETWORKING AND COMMUNICATIONS (ICNC) 437-441 2016

    DOI: 10.1109/ICCNC.2017.7876168  

    ISSN: 2325-2626

  55. Analyzing Effect of Edge Computing on Reduction of Web Response Time Peer-reviewed

    Noriaki Kamiyama, Yuusuke Nakano, Kohei Shiomoto, Go Hasegawa, Masayuki Murata, Hideo Miyahara

    2016 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM) 2016

    DOI: 10.1109/GLOCOM.2016.7841607  

    ISSN: 2334-0983

  56. Decentralized Boolean Network Tomography Based on Network Partitioning Peer-reviewed

    Nagao Ogino, Takeshi Kitahara, Shin'ichi Arakawa, Go Hasegawa, Masayuki Murata

    NOMS 2016 - 2016 IEEE/IFIP NETWORK OPERATIONS AND MANAGEMENT SYMPOSIUM 162-170 2016

    DOI: 10.1109/NOMS.2016.7502809  

    ISSN: 1542-1201

  57. Counting pedestrians passing through a line in crowded scenes by extracting optical flows Peer-reviewed

    Taniguchi, Y., Mizushima, M., Hasegawa, G., Nakano, H., Matsuoka, M.

    Information (Japan) 19 (1) 303-316 2016

  58. Virtual network allocation for fault tolerance balanced with physical resources consumption in a multi-Tenant data center Peer-reviewed

    Yukio Ogawa, Go Hasegawa, Masayuki Murata

    IEICE Transactions on Communications E98B (11) 2121-2131 2015/11

    DOI: 10.1587/transcom.E98.B.2121  

    ISSN: 0916-8516

    eISSN: 1745-1345

  59. An analysis of energy consumption for TCP data transfer with burst transmission over a wireless LAN Peer-reviewed

    Masafumi Hashimoto, Go Hasegawa, Masayuki Murata

    International Journal of Communication Systems 28 (14) 1965-1986 2015/09/25

    Publisher:

    DOI: 10.1002/dac.2832  

    ISSN: 1074-5351

    eISSN: 1099-1131

  60. Multi-ISP Cooperative Cache Sharing for Saving Inter-ISP Transit Cost in Content Centric Networking Peer-reviewed

    Kazuhito Matsuda, Go Hasegawa, Masayuki Murata

    IEICE TRANSACTIONS ON COMMUNICATIONS E98B (4) 621-629 2015/04

    DOI: 10.1587/transcom.E98.B.621  

    ISSN: 0916-8516

    eISSN: 1745-1345

  61. Virtual network allocation for fault tolerance with bandwidth efficiency in a multi-tenant data center Peer-reviewed

    Yukio Ogawa, Go Hasegawa, Masayuki Murata

    Proceedings of the International Conference on Cloud Computing Technology and Science, CloudCom 2015-February (February) 555-562 2015/02/09

    Publisher:

    DOI: 10.1109/CloudCom.2014.64  

    ISSN: 2330-2194

    eISSN: 2330-2186

  62. Web Performance Acceleration by Caching Rendering Results Peer-reviewed

    Yuusuke Nakano, Noriaki Kamiyama, Kohei Shiomoto, Go Hasegawa, Masayuki Murata, Hideo Miyahara

    2015 17TH ASIA-PACIFIC NETWORK OPERATIONS AND MANAGEMENT SYMPOSIUM APNOMS 244-249 2015

    DOI: 10.1109/APNOMS.2015.7275434  

  63. Temporal Load Balancing of Time-driven Machine Type Communications in Mobile Core Networks Peer-reviewed

    Go Hasegawa, Takanori Iwai, Naoki Wakamiya

    PROCEEDINGS OF THE 2015 IFIP/IEEE INTERNATIONAL SYMPOSIUM ON INTEGRATED NETWORK MANAGEMENT (IM) 531-537 2015

    DOI: 10.1109/INM.2015.7140333  

  64. A Network Model for Prediction of Temperature Distribution in Data Centers Peer-reviewed

    Shinya Tashiro, Yuya Tarutani, Go Hasegawa, Yutaka Nakamura, Kazuhiro Matsuda, Morito Matsuoka

    2015 IEEE 4TH INTERNATIONAL CONFERENCE ON CLOUD NETWORKING (CLOUDNET) 261-266 2015

    DOI: 10.1109/CloudNet.2015.7335319  

    ISSN: 2374-3239

  65. Accuracy improvement for spatial compotision-based end-to-end network measurement Peer-reviewed

    Go Hasegawa, Yusuke Iijima, Masayuki Murata

    2015 12TH INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY - NEW GENERATIONS 27-32 2015

    DOI: 10.1109/ITNG.2015.10  

  66. Energy-efficient Information Dissemination Based on Received Signal Strength in Wireless Sensor Networks Peer-reviewed

    Hiroyuki Hisamatsu, Go Hasegawa, Masayuki Murata

    2015 IEEE INTERNATIONAL WORKSHOP TECHNICAL COMMITTEE ON COMMUNICATIONS QUALITY AND RELIABILITY (CQR) 1-6 2015

    DOI: 10.1109/CQR.2015.7129080  

    ISSN: 2163-5595

  67. Large-scale ASP-based HEMS Utilizing Interactive Web Technologies Peer-reviewed

    Enkhee Temuulen, Go Hasegawa, Yuya Tarutani, Kazuhiro Matsuda, Morito Matsuoka

    2015 IEEE INTERNATIONAL CONFERENCE ON SMART GRID COMMUNICATIONS (SMARTGRIDCOMM) 798-803 2015

    DOI: 10.1109/SmartGridComm.2015.7436399  

    ISSN: 2373-6836

  68. Joint bearer aggregation and control-data plane separation in LTE EPC for increasing M2M communication capacity Peer-reviewed

    Go Hasegawa, Masayuki Murata

    2015 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM) 1-6 2015

    DOI: 10.1109/GLOCOM.2014.7417359  

    ISSN: 2334-0983

  69. Temperature Distribution Prediction in Data Centers for Decreasing Power Consumption by Machine Learning Peer-reviewed

    Yuya Tarutani, Kazuyuki Hashimoto, Go Hasegawa, Yutaka Nakamura, Takumi Tamura, Kazuhiro Matsuda, Morito Matsuoka

    2015 IEEE 7TH INTERNATIONAL CONFERENCE ON CLOUD COMPUTING TECHNOLOGY AND SCIENCE (CLOUDCOM) 635-642 2015

    DOI: 10.1109/CloudCom.2015.49  

    ISSN: 2330-2194

  70. An Interdomain Overlay Network Based on ISP Alliances for Economically Efficient Interdomain Traffic Routing Peer-reviewed

    Xun Shao, Go Hasegawa, Yoshiaki Taniguchi, Hirotaka Nakano

    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS E97D (12) 3163-3170 2014/12

    DOI: 10.1587/transinf.2013EDP7367  

    ISSN: 1745-1361

  71. Design and evaluation of time slot assignment algorithm for IEEE 802.16j relay networks Peer-reviewed

    Go Hasegawa, Shoichi Takagi, Yoshiaki Taniguchi, Hirotaka Nakano, Morito Matsuoka

    International Journal of Computer Networks 6 (3) 50-65 2014/06

  72. Pedestrian counting with grid-based binary sensors based on Monte Carlo method Peer-reviewed

    Shuto Fujii, Yoshiaki Taniguchi, Go Hasegawa, Morito Matsuoka

    SPRINGERPLUS 3 (1) 1-10 2014/06

    DOI: 10.1186/2193-1801-3-299  

    ISSN: 2193-1801

  73. A Distributed Mechanism for Probing Overlay Path Bandwidth Using Local Information Exchange Peer-reviewed

    Tien Hoang Dinh, Go Hasegawa, Masayuki Murata

    IEICE TRANSACTIONS ON COMMUNICATIONS E97B (5) 981-995 2014/05

    DOI: 10.1587/transcom.E97.B.981  

    ISSN: 0916-8516

    eISSN: 1745-1345

  74. An evaluation of the impact of task allocation on power consumption in data centers

    Suganuma, Kouji, Deguchi, Takaaki, Taniguchi, Yoshiaki, Hasegawa, Go, Nakamura, Yutaka, Ukita, Norimichi, Matsuda, Kazuhiro, Matsuoka, Morito

    113 (472) 185-190 2014

    Publisher:

    ISSN: 0913-5685

    More details Close

    In data centers, the power consumption of air conditioners and that of fans in the server are affected by the heat distribution in the data center. Since server task distribution in data centers affects to the heat distribution, the total power consumption in data centers varies according to the task distribution even if the total amount of tasks remains unchanged. In this report, we evaluate the impact of task allocation on power consumption in data centers. We calculate the total power consumption in data centers based on the observation results obtained through real data center experiments. Through numerical evaluations using various data center models, we show that the power consumption in a tandem data center model is decreased by 26 % compared to that in a traditional data center model.

  75. Performance evaluation of task assignment method for reducing air conditioning power consumption at data center

    Deguchi, Takaaki, Taniguchi, Yoshiaki, Hasegawa, Go, Nakamura, Yutaka, Ukita, Norimichi, Matsuda, Kazuhiro, Matsuoka, Morito

    113 (472) 191-196 2014

    Publisher:

    ISSN: 0913-5685

    More details Close

    In this report, we propose a server task assignment method for leveling the temperature distribution of data center servers to reduce air conditioning power consumption. Our method is based on the simulation of data center's airflow to find a server with the highest temperature and that with the lowest temperature and moves the server's task from the former server to the latter server. Evaluation results show that we can decrease the power consumption of air conditioners by 9.6% and 45.6% for the traditional data center model and the novel data center model developed by our research group, respectively. Furthermore, by considering the effect of waste heat utilization, the total power consumption in our novel data center model can be decreased by up to 22.4%.

  76. Counting pedestrians passing through a line in crowded scenes by extracting optical flows

    Fujii, Shuto, Taniguchi, Yoshiaki, Hasegawa, Go, Matsuoka, Morito

    113 (472) 67-72 2014

    Publisher:

    ISSN: 0913-5685

    More details Close

    In this report, we propose a method for estimating the number of pedestrians walking in opposite directions, as in cases of a shopping street or a sidewalk in a downtown area. The proposed method utilizes a compound-eye sensor that is constructed by placing two binary sensors for the pedestrians'movement direction and multiple binary sensors for the vertical direction of the pedestrians'movement direction. A number of Monte Carlo simulations about the movement of pedestrians are conducted, and the output history of the compound-eye sensor is obtained in each simulation. The simulation scenario with a small difference of the output history of the compound-eye sensor is selected to estimate the number of pedestrians. Evaluation results show that in the field whose width is 8 [m] the relative error in the proposed method is the smallest by using 2 x 8 binary sensors.

  77. Foreword

    Atmaca, T., Borcoci, E., Logothetis, M.D., Hasegawa, G., Savola, R., Massoth, M., Glabowski, M., Mynbaev, D.K., Krstic, D., Gad, R., Serpedin, E., Al-Olofi, M., Arjona, A., Atighetchi, M., Tsukamoto, K., Valadon, G., Semenov, S., Saha, A., Vardakas, J., Zoric, S., Feltus, C., Kdouh, H., Iwanami, Y., Shikoska, U.R.

    Advanced International Conference on Telecommunications, AICT 2014-July (July) 2014

  78. Experimental evaluation of SCTP tunneling for energy-efficient TCP data transfer over a WLAN Peer-reviewed

    Masafumi Hashimoto, Go Hasegawa, Masayuki Murata

    2014 INTERNATIONAL WIRELESS COMMUNICATIONS AND MOBILE COMPUTING CONFERENCE (IWCMC) 833-838 2014

    DOI: 10.1109/IWCMC.2014.6906464  

    ISSN: 2376-6492

  79. Impact of workload assignment on power consumption in software-defined data center infrastructure Peer-reviewed

    Takaaki Deguchi, Yoshiaki Taniguchi, Go Hasegawa, Yutaka Nakamura, Norimichi Ukita, Kazuhiro Matsuda, Morito Matsuoka

    2014 IEEE 3RD INTERNATIONAL CONFERENCE ON CLOUD NETWORKING (CLOUDNET) 420-425 2014

    DOI: 10.1109/CloudNet.2014.6969031  

    ISSN: 2374-3239

  80. Multiple Regression Analysis of IEEE 802.16j Relay Network Throughput Peer-reviewed

    Kohei Higo, Go Hasegawa, Yoshiaki Taniguchi, Hirotaka Nakano, Morito Matsuoka

    2014 16TH INTERNATIONAL CONFERENCE ON ADVANCED COMMUNICATION TECHNOLOGY (ICACT) 437-441 2014

    DOI: 10.1109/ICACT.2014.6778998  

    ISSN: 1738-9445

  81. End-to-end measurement of hop-by-hop available bandwidth Peer-reviewed

    Kazumasa Koitani, Go Hasegawa, Masayuki Murata

    2014 IEEE 28TH INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION NETWORKING AND APPLICATIONS (AINA) 17-24 2014

    DOI: 10.1109/AINA.2014.9  

    ISSN: 1550-445X

  82. Comparative Evaluation of Heuristics for Time Slot Assignment in IEEE 802.16j Relay Networks Peer-reviewed

    Shoichi Takagi, Go Hasegawa, Yoshiaki Taniguchi, Hirotaka Nakano, Morito Matsuoka

    2014 SEVENTH INTERNATIONAL CONFERENCE ON MOBILE COMPUTING AND UBIQUITOUS NETWORKING (ICMU) 83-84 2014

    DOI: 10.1109/ICMU.2014.6799068  

  83. Cooperative cache sharing among ISPs for reducing inter-ISP transit cost in content-centric networking Peer-reviewed

    Kazuhito Matsuda, Go Hasegawa, Masayuki Murata

    2014 INTERNATIONAL CONFERENCE ON INFORMATION NETWORKING (ICOIN 2014) 208-213 2014

    DOI: 10.1109/ICOIN.2014.6799693  

  84. Pedestrian counting based on the number of salient points considering non-linear effect of occlusions Peer-reviewed

    Kazuyuki Hashimoto, Yoshiaki Taniguchi, Go Hasegawa, Hirotaka Nakano, Morito Matsuoka

    Proceedings of CSECS 2013 26-33 2013/12

  85. Counting pedestrians passing through a line in video sequences based on optical flow extraction Peer-reviewed

    Miki Mizushima, Yoshiaki Taniguchi, Go Hasegawa, Hirotaka Nakano, Morito Matsuoka

    Proceedings of CSECS 2013 129-136 2013/12

  86. Evaluation of the Effect of Router Caching on Network Energy Consumption Peer-reviewed

    TADA Harumasa, MURATA Masayuki, HASEGAWA Go, BABASAKI Tadatoshi, NAKAMURA Jiro, MATSUOKA Morito, MATSUDA Kazuhiro

    The transactions of the Institute of Electronics, Information and Communication Engineers. B 96 (11) 1260-1271 2013/11

    Publisher: The Institute of Electronics, Information and Communication Engineers

    ISSN: 1344-4697

  87. A distributed measurement method exploiting path overlapping in large scale network systems Peer-reviewed

    Dinh Tien Hoang, Go Hasegawa, Masayuki Murata

    Proceedings of the 1st Workshop on Large Scale Network Measurements (31st NMRG meeting) 2013/10

  88. SCTP tunneling: Flow aggregation and burst transmission to save energy for multiple TCP flows over a WLAN Peer-reviewed

    Masafumi Hashimoto, Go Hasegawa, Masayuki Murata

    IEICE Transactions on Communications E96-B (10) 2615-2624 2013/10

    DOI: 10.1587/transcom.E96.B.2615  

    ISSN: 0916-8516

    eISSN: 1745-1345

  89. Effect of radio wave obstruction by obstacles on performance of IEEE 802.16j wireless multi-hop relay networks Peer-reviewed

    Go Hasegawa, Yuuki Ise, Yoshiaki Taniguchi, Hirotaka Nakano

    International Journal on Advances in Networks and Services 6 (1-2) 17-26 2013/06

  90. Self-organizing transmission scheduling considering collision avoidance for data gathering in wireless sensor networks Peer-reviewed

    Yoshiaki Taniguchi, Go Hasegawa, Hirotaka Nakano

    Journal of Communications 8 (6) 389-397 2013/06

    Publisher:

    DOI: 10.12720/jcm.8.6.389-397  

    ISSN: 1796-2021

  91. An Application-Level Routing Method with Transit Cost Reduction Based on a Distributed Heuristic Algorithm Peer-reviewed

    Kazuhito Matsuda, Go Hasegawa, Masayuki Murata

    IEICE TRANSACTIONS ON COMMUNICATIONS E96B (6) 1481-1491 2013/06

    DOI: 10.1587/transcom.E96.B.1481  

    ISSN: 0916-8516

    eISSN: 1745-1345

  92. Monte Carlo-based bi-directional pedestrian counting method for compound-eye sensor systems Peer-reviewed

    Shuto Fujii, Yoshiaki Taniguchi, Go Hasegawa, Hirotaka Nakano

    Journal of Emerging Trends in Computing and Information Sciences 4 48-57 2013/04

  93. Economically efficient interdomain overlay network based on ISP alliance Peer-reviewed

    Xun Shao, Go Hasegawa, Yoshiaki Taniguchi, Hirotaka Nakano

    Proceedings of ICNS 2013 153-159 2013/03

  94. Pedestrian counting in video sequences based on optical flow clustering Peer-reviewed

    Shizuka Fujisawa, Go Hasegawa, Yoshiaki Taniguchi, Hirotaka Nakano

    International Journal of Image Processing 7 (1) 1-16 2013/02

  95. Proactive recovery from multiple failures utilizing overlay networking technique Peer-reviewed

    Go Hasegawa, Takuro Horie, Masayuki Murata

    TELECOMMUNICATION SYSTEMS 52 (2) 1001-1019 2013/02

    DOI: 10.1007/s11235-011-9608-z  

    ISSN: 1018-4864

    eISSN: 1572-9451

  96. A Routing Strategy for Multihomed ISP to Mitigate the Impact of Overlay Traffic Peer-reviewed

    Xun Shao, Go Hasegawa, Yoshiaki Taniguchi, Hirotaka Nakano

    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS E96D (2) 193-201 2013/02

    DOI: 10.1587/transinf.E96.D.193  

    ISSN: 1745-1361

  97. A method to reduce inter-ISP transit cost caused by overlay routing based on end-to-end network measurement Peer-reviewed

    Kazuhito Matsuda, Go Hasegawa, Satoshi Kamei, Masayuki Murata

    IEICE Transactions on Information and Systems E96-D (2) 289-302 2013/02

    DOI: 10.1587/transinf.E96.D.289  

    ISSN: 0916-8532

    eISSN: 1745-1361

  98. A low-cost, distributed and conflict-aware measurement method for overlay network services utilizing local information exchange Peer-reviewed

    Tien Hoang Dinh, Go Hasegawa, Masayuki Murata

    IEICE Transactions on Communications E96-B (2) 459-469 2013/02

    DOI: 10.1587/transcom.E96.B.459  

    ISSN: 0916-8516

    eISSN: 1745-1345

  99. Monte Carlo-based Bi-directional Pedestrian Counting Method for Compound-Eye Sensor Systems composed of Multiple Binary Sensor

    Fujii, Shuto, Taniguchi, Yoshiaki, Hasegawa, Go, Nakano, Hirotaka, Matsuoka, Morito

    113 (132) 183-188 2013

    Publisher:

    ISSN: 0913-5685

    More details Close

    To count the number of pedestrians under the situation that a number of pedestrians move bidirectionally such as in a corridm, we proposed a compound-eye sensor system so far. The system is composed of compound-eye sensors that is constructed by two binary sensors and a monitoring server that estimates the number of pedestrians. In this report, we extend the compound-eye sensor to be composed of multiple binary sensors. We propose a method for estimating the number of pedestrians using the extended compound-eye sensor. In the proposed method, the compound-eye sensor is divided into a set of local compound-eye sensors, each having two binary sensors. The number of pedestrians is estimated using a Monte Carlo-based method for each local compound-eye sensor in parallel, and one of the estimation results is selected. Through simulation evaluations, it was shown that the estimation accuracy is improved by up to 25 % compared to a conventional method by using six binary sensors.

  100. A GPU Offioading method for improving performance of checksum computation in the TCP /IP stack

    Tsubouchi, Yuuki, Hasegawa, Go, Taniguchi, Yoshiaki, Nakano, Hirotaka, Matsuoka, Morito

    113 (244) 67-72 2013

    Publisher:

    ISSN: 0913-5685

    More details Close

    The size of ethernet frames is becoming larger and larger due to the utilization of Ethernet Jumbo Frame option, especially in closed network environment such as data center networks. Increasing frame size would cause the large overhead for checksum calculation in TCP /IP protocol processing, that increase the CPU load. In this report we propose the scheme for decreasing CPU load and improving data transmission throughput by offloading checksum calculation to Graphics Processing Unit (GPU). Our scheme consists of the following two methods: packet queueing method to improve the packet transmission throughput between CPU and GPU, and the packet processing method exploiting the advantage of GPU's multiprocessor architecture. We evaluate the performance of the proposed scheme by simple experiments using the user-land implementation and confirm that the proposed scheme can improve the TCP data transmission throughput by 13 %, that is almost the same as the case when the checksum calculation is canceled.

  101. Time slot-adding algorithm for improving bottleneck link throughput in IEEE 802.16j relay networks Peer-reviewed

    Tomoya Kitayama, Go Hasegawa, Yoshiaki Taniguchi, Hirotaka Nakano

    International Conference on Information Networking 606-611 2013

    DOI: 10.1109/ICOIN.2013.6496695  

    ISSN: 1976-7684

  102. Performance evaluation of a tunnel sharing method for accommodating M2M communication to mobile cellular networks Peer-reviewed

    Shun Sakurai, Go Hasegawa, Naoki Wakamiya, Takanori Iwai

    2013 IEEE Globecom Workshops, GC Wkshps 2013 157-162 2013

    Publisher: IEEE Computer Society

    DOI: 10.1109/GLOCOMW.2013.6824979  

  103. Exploiting SCTP Multistreaming To Reduce Energy Consumption of Multiple TCP Flows over a WLAN Peer-reviewed

    Masafumi Hashimoto, Go Hasegawa, Masayuki Murata

    Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST 113 102-111 2013

    DOI: 10.1007/978-3-642-37977-2_10  

    ISSN: 1867-8211

  104. End-to-end bandwidth measurement method considering effects on power-saving routers Peer-reviewed

    Daisuke Kobayashi, Go Hasegawa, Masayuki Murata

    2013 AUSTRALASIAN TELECOMMUNICATION NETWORKS AND APPLICATIONS CONFERENCE (ATNAC) 112-117 2013

    DOI: 10.1109/ATNAC.2013.6705366  

  105. Monitoring available bandwidth in overlay networks using local information exchange Peer-reviewed

    Dinh Tien Hoang, Go Hasegawa, Masayuki Murata

    2013 AUSTRALASIAN TELECOMMUNICATION NETWORKS AND APPLICATIONS CONFERENCE (ATNAC) 172-177 2013

    DOI: 10.1109/ATNAC.2013.6705376  

  106. The implications of overlay routing for ISPs' peering strategies Peer-reviewed

    Xun Shao, Go Hasegawa, Yoshiaki Taniguchi, Hirotaka Nakano

    IEICE Transactions on Information and Systems E96-D (5) 1115-1124 2013

    Publisher: Institute of Electronics, Information and Communication, Engineers, IEICE

    DOI: 10.1587/transinf.E96.D.1115  

    ISSN: 1745-1361 0916-8532

  107. Effect of radio interference models on the performance of time slot assignment algorithms in IEEE 802.16j relay networks Peer-reviewed

    Ryosuke Mine, Go Hasegawa, Yoshiaki Taniguchi, Hirotaka Nakano

    2013 IEEE 27TH INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION NETWORKING AND APPLICATIONS WORKSHOPS (WAINA) 107-113 2013

    DOI: 10.1109/WAINA.2013.41  

  108. Power consumption evaluation of distributed computing network considering traffic locality Peer-reviewed

    Yukio Ogawa, Go Hasegawa, Masayuki Murata

    IEICE Transactions on Communications E95-B (8) 2538-2548 2012/08

    DOI: 10.1587/transcom.E95.B.2538  

    ISSN: 0916-8516

    eISSN: 1745-1345

  109. Time Slot Assignment Algorithms to Upstream Links for Decreasing Transmission Latency in IEEE 802.16j Networks Peer-reviewed

    Go Hasegawa, Shinpei Tanaka, Yoshiaki Taniguchi, Hirotaka Nakano

    IEICE TRANSACTIONS ON COMMUNICATIONS E95B (5) 1793-1801 2012/05

    DOI: 10.1587/transcom.E95.B.1793  

    ISSN: 0916-8516

    eISSN: 1745-1345

  110. Pedestrian counting in video sequences using optical flow clustering Peer-reviewed

    Shizuka Fujisawa, Go Hasegawa, Yoshiaki Taniguchi, Hirotaka Nakano

    Proceedings of CSS 2012 51-56 2012/03

  111. Node repositioning method based on topology information in IEEE 802.16j relay networks Peer-reviewed

    Takafumi Shigefuji, Go Hasegawa, Yoshiaki Taniguchi, Hirotaka Nakano

    Proceedings of ICNS 2012 57-62 2012/03

  112. Evaluation of IEEE 802.16j relay network performance considering obstruction of radio wave propagation by obstacles Peer-reviewed

    Yuuki Ise, Go Hasegawa, Yoshiaki Taniguchi, Hirotaka Nakano

    Proceedings of ICNS 2012 63-68 2012/03

  113. Power consumption analysis of data transmission in IEEE 802.11 muti-hop networks Peer-reviewed

    Wataru Toorisaka, Go Hasegawa, Masayuki Murata

    Proceedings of The Eighth International Conference on. Networking and Services (ICNS 2012) 2012/03

  114. Self-organizing transmission scheduling mechanisms using a pulse-coupled oscillator model for wireless sensor networks Peer-reviewed

    Yoshiaki Taniguchi, Go Hasegawa, Hirotaka Nakano

    2012 2nd International Conference on Digital Information Processing and Communications, ICDIPC 2012 84-89 2012

    Publisher:

    DOI: 10.1109/ICDIPC.2012.6257281  

  115. Network friendly transmission control for progressive download over TCP Peer-reviewed

    Hiroyuki Hisamatsu, Go Hasegawa, Masayuki Murata

    Journal of Communications 7 (3) 213-221 2012

    Publisher:

    DOI: 10.4304/jcm.7.3.213-221  

    ISSN: 1796-2021

  116. Monte Carlo-based Bi-directional Pedestrian Counting with Compound-Eye Sensor Peer-reviewed

    Shuto Fujii, Yoshiaki Taniguchi, Go Hasegawa, Hirotaka Nakano

    2012 INTERNATIONAL CONFERENCE ON COMPUTER SYSTEMS AND INDUSTRIAL INFORMATICS (ICCSII) 2012

    DOI: 10.1109/ICCSII.2012.6454380  

  117. Measuring available bandwidth of multiple parts on end-to-end network path Peer-reviewed

    Kazumasa Koitani, Go Hasegawa, Masayuki Murata

    2012 IEEE International Workshop Technical Committee on Communications Quality and Reliability, CQR 2012 1-6 2012

    Publisher:

    DOI: 10.1109/CQR.2012.6267101  

  118. Evaluation and improvement of end-to-end bandwidth measurement method for power-saving routers Peer-reviewed

    Daisuke Kobayashi, Go Hasegawa, Masayuki Murata

    2012 IEEE International Workshop Technical Committee on Communications Quality and Reliability, CQR 2012 1-6 2012

    Publisher:

    DOI: 10.1109/CQR.2012.6267095  

  119. Effect of traffic locality on power consumption of distributed computing network with a data center Peer-reviewed

    Yukio Ogawa, Go Hasegawa, Masayuki Murata

    2012 9th International Conference on Communications, COMM 2012 - Conference Proceedings 233-236 2012

    Publisher:

    DOI: 10.1109/ICComm.2012.6262559  

  120. Determining coverage area using Voronoi diagram based on local information for wireless mesh networks Peer-reviewed

    Go Hasegawa, Shoichi Takemori, Yoshiaki Taniguchi, Hirotaka Nakano

    Proceedings of the 9th International Conference on Information Technology, ITNG 2012 71-76 2012

    DOI: 10.1109/ITNG.2012.19  

  121. Centralized and distributed heuristic algorithms for application-level traffic routing Peer-reviewed

    Kazuhito Matsuda, Go Hasegawa, Satoshi Kamei, Masayuki Murata

    International Conference on Information Networking 193-198 2012

    DOI: 10.1109/ICOIN.2012.6164376  

    ISSN: 1976-7684

  122. A game-theoretic analysis of interaction between overlay routing and multihoming Peer-reviewed

    Xun Shao, Go Hasegawa, Yoshiaki Taniguchi, Hirotaka Nakano

    14th Asia-Pacific Network Operations and Management Symposium: "Management in the Big Data and IoT Era", APNOMS 2012 - Final Program 2012

    DOI: 10.1109/APNOMS.2012.6356073  

  123. A distributed and conflict-aware measurement method based on local information exchange in overlay networks Peer-reviewed

    Dinh Tien Hoang, Go Hasegawa, Masayuki Murata

    Australasian Telecommunication Networks and Applications Conference, ATNAC 2012 1-6 2012

    Publisher:

    DOI: 10.1109/ATNAC.2012.6398051  

  124. Parameter Tuning of the Protocol Interference Model Using SINR for Time Slot Assignment in Wireless Mesh Networks Peer-reviewed

    Gyeongyeon Kang, Yoshiaki Taniguchi, Go Hasegawa, Hirotaka Nakano

    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS E94D (11) 2191-2200 2011/11

    DOI: 10.1587/transinf.E94.D.2191  

    ISSN: 0916-8532

  125. A transport-layer approach for improving thin-client performance in a WAN environment Peer-reviewed

    Yukio Ogawa, Go Hasegawa, Masayuki Murata

    International Journal of Internet Protocol Technology 6 (3) 172-183 2011/11

    Publisher:

    DOI: 10.1504/IJIPT.2011.043652  

    ISSN: 1743-8209

    eISSN: 1743-8217

  126. Power Control Methods for Improving Spatial Reuse in TDMA-Based Wireless Mesh Networks

    Hasegawa, Go, Hidekuma, Toshiaki, Sasabe, Masahiro, Nakano, Hirotaka

    ISRN Communications and Networking 2011 1-12 2011/06

    DOI: 10.5402/2011/970943  

  127. Network recovery method with pre-calculation of routing configurations for large-scale fail-ures Peer-reviewed

    Go Hasegawa, Takuro Horie, Masayuki Murata

    Journal of Communications and Networking 1 (5) 60-73 2011/05

  128. SHOT: Scenario-Type Hypothesis Object Tracking with Indoor Sensor Networks Peer-reviewed

    Masakazu Murata, Yoshiaki Taniguchi, Go Hasegawa, Hirotaka Nakano

    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS E94D (5) 1035-1044 2011/05

    DOI: 10.1587/transinf.E94.D.1035  

    ISSN: 0916-8532

  129. A Transport-Layer Solution for Alleviating TCP Unfairness in a Wireless LAN Environment Peer-reviewed

    Masafumi Hashimoto, Go Hasegawa, Masayuki Murata

    IEICE TRANSACTIONS ON COMMUNICATIONS E94B (3) 765-776 2011/03

    DOI: 10.1587/transcom.E94.B.765  

    ISSN: 0916-8516

    eISSN: 1745-1345

  130. TCPの輻輳制御機構に関す研究動向,

    長谷川剛

    電子情報通信学会和文論文誌-B 94 (5) 663-672 2011

  131. TCP window-size delegation for TXOP exchange in wireless access networks Peer-reviewed

    Takayuki Nishio, Ryoichi Shinkuma, Tatsuro Takahashi, Go Hasegawa

    IEEE International Conference on Communications 2011

    DOI: 10.1109/icc.2011.5963407  

    ISSN: 0536-1486

  132. Research Trends on TCP Congestion Control Mechanisms

    IEICE Transactions on Communications Vol. J94-B (5) 663-672 2011

    Publisher:

    ISSN: 1344-4697

  133. Non bandwidth-intrusive video streaming over TCP Peer-reviewed

    Hiroyuki Hisamatsu, Go Hasegawa, Masayuki Murata

    Proceedings - 2011 8th International Conference on Information Technology: New Generations, ITNG 2011 78-83 2011

    Publisher:

    DOI: 10.1109/ITNG.2011.21  

  134. Time Slot Assignment Algorithms for Reducing Upstream Latency in IEEE 802.16j Networks Peer-reviewed

    Shimpei Tanaka, Go Hasegawa, Yoshiaki Taniguchi, Hirotaka Nakano

    PROCEEDINGS OF THE SEVENTH ADVANCED INTERNATIONAL CONFERENCE ON TELECOMMUNICATIONS (AICT 2011) 6-11 2011

  135. The implication of overlay routing on ISPs' connecting strategies Peer-reviewed

    Shao X, Hasegawa G, Taniguchi Y, Nakano H

    Proceedings of the 2011 23rd International Teletraffic Congress, ITC 2011 111 (43) 286-293 2011

    Publisher: The Institute of Electronics, Information and Communication Engineers

    ISSN: 0913-5685

  136. TCP-based window-size delegation method for TXOP Exchange in wireless local area networks Peer-reviewed

    Takayuki Nishio, Ryoichi Shinkuma, Tatsuro Takahashi, Go Hasegawa

    EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING 2011 (1) 2011

    DOI: 10.1186/1687-1499-2011-58  

    ISSN: 1687-1499

  137. TCP Window-size Delegation for TXOP Exchange in Wireless Access Networks Peer-reviewed

    Takayuki Nishio, Ryoichi Shinkuma, Tatsuro Takahashi, Go Hasegawa

    2011 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC) 2011

    DOI: 10.1109/icc.2011.5963407  

    ISSN: 1550-3607

  138. TCP symbiosis: Bio-inspired congestion control mechanism for TCP Peer-reviewed

    Go Hasegawa, Masayuki Murata

    Biologically Inspired Networking and Sensing: Algorithms and Architectures 104-131 2011

    DOI: 10.4018/978-1-61350-092-7.ch006  

  139. Modeling and analysis of power consumption in TCP data transmission over a wireless LAN environment Peer-reviewed

    Masafumi Hashimoto, Go Hasegawa, Masayuki Murata

    IEEE International Conference on Communications 1-6 2011

    Publisher:

    DOI: 10.1109/iccw.2011.5963561  

    ISSN: 0536-1486

  140. Extending the Protocol Interference Model Considering SINR for Wireless Mesh Networks Peer-reviewed

    Gyeongyeon Kang, Yoshiaki Taniguchi, Go Hasegawa, Hirotaka Nakano

    PROCEEDINGS OF THE SEVENTH ADVANCED INTERNATIONAL CONFERENCE ON TELECOMMUNICATIONS (AICT 2011) 26-31 2011

  141. Energy efficiency analysis of TCP with burst transmission over a wireless LAN Peer-reviewed

    Masafumi Hashimoto, Go Hasegawa, Masayuki Murata

    11th International Symposium on Communications and Information Technologies, ISCIT 2011 292-297 2011

    Publisher:

    DOI: 10.1109/ISCIT.2011.6089751  

  142. A distributed measurement method for reducing measurement conflict frequency in overlay networks Peer-reviewed

    Dinh Tien Hoang, Go Hasegawa, Masayuki Murata

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

    Publisher:

    DOI: 10.1109/CQR.2011.5996091  

  143. Service area deployment of IEEE 802.16j wireless relay networks: service area coverage, energy consumption, and resource utilization efficiency Peer-reviewed

    Shoichi Takemori, Go Hasegawa, Yoshiaki Taniguchi, Hirotaka Nakano

    International Journal on Advances in Internet Technology 3 (1-2) 43-52 2010/09

  144. Decreasing ISP transit cost in overlay routing based on multiple regression analysis Peer-reviewed

    Kazuhito Matsuda, Go Hasegawa, Masayuki Murata

    Proceedings of International Conference on Information Networking (ICOIN) 2010 2010/01

  145. Trade-off evaluation between fairness and throughput for TCP congestion control mechanisms in a wireless LAN environment

    Masafumi Hashimoto, Go Hasegawa, Masayuki Murata

    Proceedings of the 2010 International Symposium on Performance Evaluation of Computer and Telecommunication Systems, SPECTS'2010 22-28 2010

  146. Proactive recovery method against multiple network failures with overlay networking technique

    Takuro Horie, Go Hasegawa, Masayuki Murata

    Proceedings of 2010 14th International Telecommunications Network Strategy and Planning Symposium, Networks 2010 1-6 2010

    Publisher:

    DOI: 10.1109/NETWKS.2010.5624903  

  147. Time slot assignment algorithms in IEEE 802.16 multi-hop relay networks Peer-reviewed

    Rintaro Ishii, Go Hasegawa, Yoshiaki Taniguchi, Hirotaka Nakano

    6th International Conference on Networking and Services, ICNS 2010, Includes LMPCNA 2010; INTENSIVE 2010 265-270 2010

    Publisher:

    DOI: 10.1109/ICNS.2010.43  

  148. Performance evaluation of a method to reduce inter-ISP transit cost caused by overlay routing Peer-reviewed

    Kazuhito Matsuda, Go Hasegawa, Satoshi Kamei, Masayuki Murata

    Proceedings of 2010 14th International Telecommunications Network Strategy and Planning Symposium, Networks 2010 1-6 2010

    Publisher:

    DOI: 10.1109/NETWKS.2010.5624928  

  149. Load-Balanced and Interference-Aware Spanning Tree Construction Algorithm for TDMA-Based Wireless Mesh Networks Peer-reviewed

    Hiroshi Tokito, Masahiro Sasabe, Go Hasegawa, Hirotaka Nakano

    IEICE TRANSACTIONS ON COMMUNICATIONS E93B (1) 99-110 2010/01

    DOI: 10.1587/transcom.E93.B.99  

    ISSN: 0916-8516

    eISSN: 1745-1345

  150. An object tracking method based on scenario-type hypothesis tracking in segmented multiple regions Peer-reviewed

    Masakazu Murata, Yoshiaki Taniguchi, Go Hasegawa, Hirotaka Nakano

    6th International Conference on Networking and Services, ICNS 2010, Includes LMPCNA 2010; INTENSIVE 2010 200-205 2010

    DOI: 10.1109/ICNS.2010.34  

  151. 5th International Conference on Internet Monitoring and Protection, ICIMP 2010: Preface Peer-reviewed

    Dini P, Hasegawa G, Heikkinen S, Mauri J.L, Podebrad I, Zhang C, Valadon G

    5th International Conference on Internet Monitoring and Protection, ICIMP 2010 2010

  152. Evaluation of Free-Riding Traffic Problem in Overlay Routing and Its Mitigation Method

    Go Hasegawa, Yuichiro Hiraoka, Masayuki Murata

    IEICE TRANSACTIONS ON COMMUNICATIONS E92B (12) 3774-3783 2009/12

    DOI: 10.1587/transcom.E92.B.3774  

    ISSN: 0916-8516

    eISSN: 1745-1345

  153. Introduction to Transport-Layer Simulation with ns-2

    Hasegawa Go

    B-Plus 2009 (8) 8_54-8_62 2009

    Publisher: The Institute of Electronics, Information and Communication Engineers

    DOI: 10.1587/bplus.2009.8_54  

    ISSN: 2186-0661

  154. On network traffic concentration and updating interval for proactive recovery method against large-scale network failures

    Takuro Horie, Go Hasegawa, Satoshi Kamei, Masayuki Murata

    2009 Australasian Telecommunication Networks and Applications Conference, ATNAC 2009 - Proceedings 2009

    DOI: 10.1109/ATNAC.2009.5464910  

  155. A transport layer approach for improving interactive user experience on thin clients

    Yukio Ogawa, Go Hasegawa, Masayuki Murata

    2009 Australasian Telecommunication Networks and Applications Conference, ATNAC 2009 - Proceedings 1-6 2009

    Publisher:

    DOI: 10.1109/ATNAC.2009.5464897  

  156. Improvement and evaluation of scenario-type hypothesis object tracking

    Proceedings of the 2nd International Workshop on Sensor Networks and Ambient Intelligence (SeNAmI 2009) 2009

  157. Scalable and density-aware measurement strategies for overlay networks Peer-reviewed

    Go Hasegawa, Masayuki Murata

    Proceedings - 2009 4th International Conference on Internet Monitoring and Protection, ICIMP 2009 21-26 2009

    DOI: 10.1109/ICIMP.2009.11  

  158. Routing method for gateway load balancing in wireless mesh networks Peer-reviewed

    Hiroshi Tokito, Masahiro Sasabe, Go Hasegawa, Hirotaka Nakano

    2009 EIGHTH INTERNATIONAL CONFERENCE ON NETWORKS 127-132 2009

    DOI: 10.1109/ICN.2009.21  

  159. Real-time Estimation Method of the Number of Pedestrians in Video Sequences Peer-reviewed

    Sayaka Kuriyama, Go Hasegawa, Hirotaka Nakano

    ICDT: 2009 FOURTH INTERNATIONAL CONFERENCE ON DIGITAL TELECOMMUNICATIONS 65-+ 2009

    DOI: 10.1109/ICDT.2009.19  

  160. Improving coverage area quality using physical topology information in IEEE 802.16 mesh networks Peer-reviewed

    Shoichi Takemori, Go Hasegawa, Yoshiaki Taniguchi, Hirotaka Nakano

    3rd International Conference on Mobile Ubiquitous Computing, Systems, Services, and Technologies, UBICOMM 2009 163-168 2009

    DOI: 10.1109/UBICOMM.2009.20  

  161. Degree-Based Power Control Method for Increasing Spatial Reuse in TDMA-based Wireless Mesh Networks Peer-reviewed

    Toshiaki Hidekuma, Go Hasegawa, Masahiro Sasabe, Hirotaka Nakano

    2009 EIGHTH INTERNATIONAL CONFERENCE ON NETWORKS 121-126 2009

    DOI: 10.1109/ICN.2009.22  

  162. Bandwidth-based congestion control for TCP: measurement noise-aware parameter settings and self-induced oscillation Peer-reviewed

    Mizuho Kodama, Go Hasegawa, Masayuki Murata

    2009 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATION WORKSHOPS, VOLS 1 AND 2 730-735 2009

    DOI: 10.1109/ICCW.2009.5207973  

  163. A new method of proactive recovery mechanism for large-scale network failures Peer-reviewed

    Takuro Horie, Go Hasegawa, Satoshi Kamei, Masayuki Murata

    2009 INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION NETWORKING AND APPLICATIONS 951-+ 2009

    DOI: 10.1109/AINA.2009.46  

    ISSN: 1550-445X

  164. TCP Congestion Control Mechanisms for Achieving Predictable Throughput Using Inline Network Measurement Peer-reviewed

    Go Hasegawa, Kana Yamanegi, Masayuki Murata

    IEICE TRANSACTIONS ON COMMUNICATIONS E91B (12) 3945-3955 2008/12

    DOI: 10.1093/ietcom/e91-b.12.3945  

    ISSN: 0916-8516

    eISSN: 1745-1345

  165. Simulation studies on router buffer sizing for short-lived and pacing TCP flows Peer-reviewed

    Go Hasegawa, Takeshi Tomioka, Kentarou Tada, Masayuki Murata

    Computer Communications 31 (16) 3789-3798 2008/10/25

    DOI: 10.1016/j.comcom.2008.04.025  

    ISSN: 0140-3664

  166. A Transport-layer Approach for Achieving Predictable Throughput for Internet Applications

    Masayuki Murata, Go Hasegawa, K. Yamanegi

    Seventh International Conference on Networking (icn 2008) 186-191 2008/04/01

    Publisher: IEEE

    DOI: 10.1109/icn.2008.30  

    More details Close

    We propose a transport-layer approach to provide predictable throughput for applications requiring stable bandwidth resource, such as video streaming and VoIP. The proposed mechanism deploys an end-to-end approach: it dynamically sets the increase degree of the congestion window size of a TCP connection according to the measurement results of the available bandwidth of the network path, which is obtained by inline network measurement technique developed in our research group. In the present paper, we briefly introduce the proposed mechanism and show the performance evaluation results in the experimental network and in the commercial Internet environment. We exhibit that the proposed mechanism can achieve the required throughput with high probability without any support from intermediate network nodes.

  167. Campus-wide IT Authentication Infrastructure Development in Osaka University Peer-reviewed

    秋山豊和, 寺西裕一, 岡村真吾, 坂根栄作, 長谷川剛, 馬場健一, 中野博隆, 下條真司, 長岡亨

    情報処理学会論文誌 49 (3) 1249-1264 2008/03/15

    Publisher: Information Processing Society of Japan (IPSJ)

    ISSN: 0387-5806

    More details Close

    In Osaka University, a campus-wide IT authentication infrastructure based on Public Key Infrastructure (PKI), which is regarded as a technology providing high security and standard interface to many applications, has been adopted. In this authentication infrastructure, multiple CAs for the different purposes such as signing and encryption, intra-campus authentication and grid system authentication coexist. To realize security and convenience, we developed an online certificate issuance service for those multiple CAs. We also introduced PKI enabled Single Sign-On (SSO) system to provide unified authentication interface. Since the SSO system supports 'SSO agent', which provides SSO functionality for web applications by installing a web server module, it is possible to migrate from password authentication to PKI authentication without modifying applications. Furthermore, we established secure and flexible identity management by separating changeable, public user ID and static, internal system ID. Internal system ID is used for managing and federating user profiles among the systems. The mapping between those two IDs is done by the SSO system. In this paper, we describe design and implementation of our authentication infrastructure, know-how of system establishment and future works.

  168. New methods for maintaining fairness between well-behaved TCP flows and tampered-TCP flows at edge routers

    Junichi Maruyama, Go Hasegawa, Masayuki Murata

    IEICE Transactions on Communications E91-B (1) 197-206 2008

    DOI: 10.1093/ietcom/e91-b.1.197  

    ISSN: 0916-8516

    eISSN: 1745-1345

  169. Emergency communication services based on overlay networking technologies

    Go Hasegawa, Satoshi Kamei, Masayuki Murata

    FOURTH INTERNATIONAL CONFERENCE ON NETWORKING AND SERVICES (ICNS 2008), PROCEEDINGS 159-+ 2008

    DOI: 10.1109/ICNS.2008.36  

  170. Special section on communication quality Peer-reviewed

    Abe T, Ogishi T, Aoki K, Ishibashi Y, Itakura E, Kato T, Kawahara R, Gyoda K, Kitawaki N, Shimonishi H, Takahashi A, Tsuru M, Hasegawa G, Hasegawa T, Yamamoto H, Yamori K

    IEICE Transactions on Communications E91-B (5) 1259 2008

    DOI: 10.1093/ietcom/e91-b.5.1259  

    ISSN: 0916-8516

    eISSN: 1745-1345

  171. Performance evaluation and improvement of hybrid TCP congestion control mechanisms in wireless LAN environment Peer-reviewed

    Masafumi Hashimoto, Go Hasegawa, Masayuki Murata

    Proceedings of the 2008 Australasian Telecommunication Networks and Applications Conference, ATNAC 2008 367-372 2008

    Publisher:

    DOI: 10.1109/ATNAC.2008.4783352  

  172. Inline bandwidth measurement techniques for gigabit networks Peer-reviewed

    Cao Le Thanh Man, Go Hasegawa, Masayuki Murata

    International Journal of Internet Protocol Technology 3 (2) 81-94 2008

    Publisher:

    DOI: 10.1504/IJIPT.2008.020466  

    ISSN: 1743-8209

    eISSN: 1743-8217

  173. Performance analysis of large-scale IP networks considering TCP traffic Peer-reviewed

    Hiroyuki Hisamatsu, Go Hasegawa, Masayuki Murata

    IEICE TRANSACTIONS ON COMMUNICATIONS E90B (10) 2845-2853 2007/10

    DOI: 10.1093/ietcom/e90-b.10.2845  

    ISSN: 0916-8516

    eISSN: 1745-1345

  174. Modeling TCP throughput over Wired/Wireless heterogeneous networks for receiver-based ACK splitting mechanism

    Go Hasegawa, Masashi Nakata, Hirotaka Nakano

    IEICE TRANSACTIONS ON COMMUNICATIONS E90B (7) 1682-1691 2007/07

    DOI: 10.1093/ietcom/e9O-b.7.1682  

    ISSN: 0916-8516

    eISSN: 1745-1345

  175. Transport-layer optimization forth in-client systems Peer-reviewed

    Yukio Ogawa, Go Hasegawa, Masayuki Murata

    Proceedings of IEEE International Communications Quality & Reliability Workshop (IEEE CQR 2007) 2007/05

  176. Receiver-based ACK splitting mechanism for TCP over wired/wireless heterogeneous networks Peer-reviewed

    Go Hasegawa, Masashi Nakata, Hirotaka Nakano

    IEICE TRANSACTIONS ON COMMUNICATIONS E90B (5) 1132-1141 2007/05

    DOI: 10.1093/ietcom/e90-b.5.1132  

    ISSN: 0916-8516

    eISSN: 1745-1345

  177. Analysis evaluation of parallel TCP: Is it really effective for long fat networks?

    Zongsheng Zhang, Go Hasegawa, Masayuki Murata

    IEICE TRANSACTIONS ON COMMUNICATIONS E90B (3) 559-568 2007/03

    DOI: 10.1093/ietcom/e90-b.3.559  

    ISSN: 0916-8516

    eISSN: 1745-1345

  178. Sizing Router Buffers for Large-Scale TCP/IP Networks

    Masayuki Murata, Hiroyuki Hisamatsu, Go Hasegawa

    21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07) 215-219 2007/01/01

    Publisher: IEEE

    DOI: 10.1109/ainaw.2007.337  

    More details Close

    We investigate the validity of reducing router buffer size in a large-scale network that includes both core networks and edge networks. We first devise a novel mathematical analysis method of estimating the average behavior of TCP connections in a network with 100/1,000/10,000 routers/endhosts/links and 100,000 concurrent TCP connections. By applying our analysis method to the Abilene-inspired network, we demonstrate the influence of small buffer on link utilization, packet loss ratio and the performance of TCP connections passing through the router. One important result is that, especially when the edge network becomes faster, decreasing buffer size at core routers causes unfairness between TCP connections that traverse the core network and those do not traverse the core network.

  179. Protection mechanisms for well-behaved TCP flows from tampered-TCP at edge routers Peer-reviewed

    Junichi Maruyama, Go Hasegawa, Masayuki Murata

    Proceedings - International Conference on Computer Communications and Networks, ICCCN 340-345 2007

    Publisher:

    DOI: 10.1109/ICCCN.2007.4317842  

    ISSN: 1095-2055

  180. Router buffer re-sizing for short-lived TCP flows Peer-reviewed

    Takeshi Tomioka, Go Hasegawa, Masayuki Murata

    International Symposium on Performance Evaluation of Computer and Telecommunication Systems 2007, SPECTS'07, Part of the 2007 Summer Simulation Multiconference, SummerSim'07 109-116 2007

  181. Inline bandwidth measurements: Implementation difficulties and their solutions Peer-reviewed

    Tomoaki Tsugawa, Cao Le Thanh Man, Go Hasegawa, Masayuki Murata

    Fifth IEEE/IFIP Workshop on End-to-End Monitoring Techniques and Services, E2EMON'07 2007

    DOI: 10.1109/E2EMON.2007.375314  

  182. Inferring available bandwidth of overlay network paths based on inline network measurement Peer-reviewed

    Cao Le Thanh Man, Go Hasegawa, Masayuki Murata

    Second International Conference on Internet Monitoring and Protection, ICIMP 2007 14-14 2007

    Publisher:

    DOI: 10.1109/ICIMP.2007.22  

  183. A report of campus-wide IT authentication platform system development in Osaka university Peer-reviewed

    Akiyama T, Teranishi Y, Okamura S, Sakane E, Hasegawa G, Baba K.-I, Nakano H, Shimojo S

    SAINT - 2007 International Symposium on Applications and the Internet - Workshops, SAINT-W 35-35 2007

    Publisher: IEEE Computer Society

    DOI: 10.1109/SAINT-W.2007.16  

  184. Effectiveness of overlay routing based on delay and bandwidth information Peer-reviewed

    Yuichiro Hiraoka, Go Hasegawa, Masayuki Murata

    2007 AUSTRALASIANTELECOMMUNICATION NETWORKS AND APPLICATIONS CONFERENCE 205-210 2007

    DOI: 10.1109/ATNAC.2007.4665257  

  185. A simultaneous Inline measurement mechanism for capacity and available bandwidth of end-to-end network path

    Cao Le Thanh Man, Go Hasegawa, Masayuki Murata

    IEICE TRANSACTIONS ON COMMUNICATIONS E89B (9) 2469-2479 2006/09

    DOI: 10.1093/ietcom/e89-b.9.2469  

    ISSN: 0916-8516

    eISSN: 1745-1345

  186. Experimental results of implementing high-speed and parallel TCP variants for long fat networks

    ZS Zhang, G Hasegawa, M Murata

    IEICE TRANSACTIONS ON COMMUNICATIONS E89B (3) 775-783 2006/03

    DOI: 10.1093/ietcom/e89-b.3.775  

    ISSN: 0916-8516

    eISSN: 1745-1345

  187. An inline measurement method for capacity of end-to-end network path

    Masayuki Murata, Cao Le Thanh Man, Go Hasegawa

    Workshop on End-to-End Monitoring Techniques and Services, 2005. 56-70 2006/01/05

    Publisher: IEEE

    DOI: 10.1109/e2emon.2005.1564469  

    More details Close

    We previously proposed a new version of TCP, called inline measurement TCP (ImTCP), in Cao Le Thanh Man et al. (2004). The ImTCP sender adjusts the transmission intervals of data packets and then utilizes the arrival intervals of ACK packets for available bandwidth estimation. This type of active measurement is preferred because the obtained results are as accurate as those of other conventional types of active measurement, even though no extra probe traffic is injected onto the network. In the present research, we combine a new capacity measurement function with ImTCP in order to enable simultaneous measurement of both capacity and available bandwidth in ImTCP. The capacity measurement algorithm is a new packet-pair-based measurement technique that utilizes the estimated available bandwidth values for capacity calculation. This new algorithm promises faster measurement than current packet-pair-based measurement algorithms for various situations and works well for high-load networks, in which current algorithms do not work properly. Moreover, the new algorithm provides a confidence interval for the measurement result.

  188. A packet burst- based inline network measurement mechanism

    長谷川 剛

    電子情報通信学会2006 総合大会 (掲載予定) 2006

  189. A packet burst-based inline network measurement mechanism

    長谷川 剛

    電子情報通信学会2006総合大会 2006

  190. Implementation and evaluation of an inline network measurement algorithm and its application to TCP-based service

    Tomoaki Tsugawa, Go Hasegawa, Masayuki Murata

    4th IEEE/IFIP Workshop on End-to-End Monitoring Techniques and Services, E2EMON 2006 34-41 2006

    Publisher:

    DOI: 10.1109/e2emon.2006.1651277  

  191. Reasons not to parallelize TCP connections for long fat networks

    Zongsheng Zhang, Go Hasegawa, Masayuki Murata

    International Symposium on Performance Evaluation of Computer and Telecommunication Systems 2006, SPECTS'06, Part of the 2006 Summer Simulation Multiconference, SummerSim'06 354-359 2006

  192. TCP symbiosis: Congestion control mechanisms of TCP based on Lotka-Volterra competition model

    Go Hasegawa, Masayuki Murata

    ACM International Conference Proceeding Series 200 11 2006

    Publisher:

    DOI: 10.1145/1190326.1190338  

  193. Congestion control mechanism of TCP for achieving predictable throughput

    YAMANEGI K.

    Proceedings of the Australian Telecommunication Networks and Applications Conference 2006 (ATNAC 2006) pp. 117-121 117-121 2006

  194. Is tampered-TCP really effective for getting high throughput in the Internet?

    MARUYAMA J.

    Proceedings of the Australian Telecommunication Networks and Applications Conference 2006 (ATNAC 2006) pp. 167-171 167-171 2006

  195. ICIM: An inline network measurement mechanism for highspeed networks

    Le Thanh Man Cao, Go Hasegawa, Masayuki Murata

    4th IEEE/IFIP Workshop on End-to-End Monitoring Techniques and Services, E2EMON 2006 66-73 2006

    Publisher:

    DOI: 10.1109/e2emon.2006.1651281  

  196. Performance analysis and improvement of highspeed TCP with TailDrop/RED routers Peer-reviewed

    Zongsheng Zhang, Go Hasegawa, Masayuki Murata

    IEICE Transactions on Communications E88-B (6) 2495-2507 2005/06

    DOI: 10.1093/ietcom/e88-b.6.2495  

    ISSN: 0916-8516

    eISSN: 1745-1345

  197. インライン計測に基くTCPによるバックグラウンド転送方式

    長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 2005

  198. エンドホスト間のネットワークパスの物理帯域のインライン計測手法

    長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 2005

  199. 高速ネットワークのためのインライン計測手法

    長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 2005

  200. 高速TCPおよび並列TCP方式の実験ネットワークでの評価

    長谷川 剛

    電子情報通信学会技術研究報告 17-22 2005

  201. Performance analysis and improvement of TCP proxy mechanism in TCP overlay networks Peer-reviewed

    Ichinoshin Maki, Go Hasegawa, Masayuki Murata, Tutomu Murase

    IEEE International Conference on Communications 1 184-190 2005

    Publisher:

    DOI: 10.1109/icc.2005.1494344  

    ISSN: 0536-1486

  202. A new congestion control mechanism of TCP with inline network measurement

    T Iguchi, G Hasegawa, M Murata

    INFORMATION NETWORKING: CONVERGENCE IN BROADBAND AND MOBILE NETWORKING 3391 109-121 2005

    ISSN: 0302-9743

  203. Design, implementation and evaluation of resource management system for Internet servers

    K Azuma, T Okamoto, G Hasegawa, M Murata

    JOURNAL OF HIGH SPEED NETWORKS 14 (4) 301-316 2005

    ISSN: 0926-6801

    eISSN: 1875-8940

  204. Background TCP data transfer with Inline network measurement

    T Tsugawa, G Hasegawa, M Murata

    2005 Asia-Pacific Conference on Communications (APCC), Vols 1& 2 pp. 459-463 459-463 2005

    DOI: 10.1109/APCC.2005.1554101  

  205. Experimental evaluations of gentle HighSpeed TCP for Long-Fat Networks

    Zongsheng Zhang, Go Hasegawa, Masayuki Murata

    APSITT 2005: 6th Asia-Pacific Symposium on Information and Telecommunication Technologies, Proceedings pp. 47-52 47-52 2005

    DOI: 10.1109/APSITT.2005.203629  

  206. A merged inline measurement method for capacity and available bandwidth

    CLT Man, G Hasegawa, M Murata

    PASSIVE AND ACTIVE NETWORK MEASUREMENT, PROCEEDINGS 3431 341-344 2005

    DOI: 10.1007/978-3-540-31966-5_30  

    ISSN: 0302-9743

  207. Performance analysis and improvement of TCP proxy mechanism in TCP overlay networks

    Maki, I, G Hasegawa, M Murata, T Murase

    ICC 2005: IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-5 184-190 2005

    ISSN: 1550-3607

  208. Management of multimedia networks and services Peer-reviewed

    Royo, J.D., Hasegawa, G.

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 3754 2005

    Publisher: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  209. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface Peer-reviewed

    Dalmau J, Hasegawa G

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 3754 LNCS 2005

    ISSN: 0302-9743

    eISSN: 1611-3349

  210. Preface Peer-reviewed

    Royo, J.D., Hasegawa, G.

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 3754 2005

    Publisher: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  211. Implementation experiments of the TCP proxy mechanism Peer-reviewed

    Kana Yamanegi, Takayuki Hama, Go Hasegawa, Masayuki Murata, Hideyuki Shimonishi, Tutomu Murase

    6th Asia-Pacific Symposium on Information and Telecommunication Technologies, APSITT 2005 - Proceedings 2005 17-22 2005

    DOI: 10.1109/apsitt.2005.203624  

  212. Scalable resource management for high-performance Web servers

    G Hasegawa, T Terai, T Okamoto, M Murata

    INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS 17 (5) 389-406 2004/06

    DOI: 10.1002/dac.650  

    ISSN: 1074-5351

  213. ImTCP:利用可能帯域の計測を可能とするTCP

    長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 2004

  214. ImTCP :利用可能帯域の計測を可能とするTCP

    長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 Vol.104, No.73 37-42 2004

  215. Inline network measurement : TCP with a built-in measurement technique

    長谷川 剛

    電子情報通信学会2004ソサイエティ大会 2004

  216. Inline network measurement : TCP with a built-in measurement technique

    長谷川 剛

    電子情報通信学会2004ソサイエティ大会 2004

  217. ImTCP: TCP with an inline measurement mechanism for available bandwidth

    Computer Communications Special Issue: Monitoring and Measurements of IP Networks 2004

  218. Realizing a Network Emulator System with Intel IXP1200 Network Processor Peer-reviewed

    Go Hasegawa, Haruki Tojo, Masayuki Murata

    Proceedings of 5th Asia-Pacific Symposium on Information and Telecommunication Technologies (APSITT 2003) 2003/11

  219. Performance analysis of HighSpeed TCP and its improvement for high throughput and fairness against TCP Reno connections Peer-reviewed

    Koichi Tokuda, Go Hasegawa, Masayuki Murata

    Proceedings of IEEE High Speed Network Workshop 2003 (HSN ‘03) 2003/03

  220. TCPコネクションのためのアクセスリンク資源管理方式

    長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 2003

  221. Inline network measurement mechanism for service overlay networks Peer-reviewed

    Cao Le Thanh Man, Go Hasegawa, Masayuki Murata

    Proceedings of IEEE Bandwidth Management Workshop X 2003/01

  222. A new available bandwidth measurement technique for service overlay networks Peer-reviewed

    CLT Man, G Hasegawa, M Murata

    MANAGEMENT OF MULTIMEDIA NETWORKS AND SERVICES, PROCEEDINGS 2839 436-448 2003

    ISSN: 0302-9743

  223. Performance of TCP over ABR service class

    Hideo Miyahara, Masayuki Murata, Hiroyuki Ohsaki, Go Hasegawa

    Proceedings of GLOBECOM'96. 1996 IEEE Global Telecommunications Conference 3 1935-1941 2002/12/24

    Publisher: IEEE

    DOI: 10.1109/glocom.1996.591974  

    More details Close

    The performance of TCP over ATM networks is evaluated using a simulation technique for the model where the multiple ATM switches are interconnected. In multihop networks, the unfairness among connections possibly become a problem due to the difference of the number of hops or the round trip times among connections. We first compare three methods For supporting TCP traffic; available bit rate (ABR), unspecified bit rate (UBR) with EPD (early packet discard), and EPD with per-VC accounting. Results show that the performance of TCP over ABR is degraded once the cell loss takes place due to the inappropriate control parameter setting. We then consider TCP over ABR with an EPD enhancement in which an EPD mechanism is incorporated into ABR.

  224. Postgraduate Coursework Program using Network Processors at Osaka University Peer-reviewed

    Go Hasegawa, Masayuki Murata

    Proceedings of The 1st AEARU Network Education Workshop 2002/11

  225. Analysis and Improvement of Fairness among Many TCP Connections Sharing Tail-Drop and RED Routers Peer-reviewed

    Go Hasegawa, Kouichi Tokuda, Masayuki Murata

    INET 2002 2002/06

  226. Research and Educational Activities using IXP1200 at Osaka University Peer-reviewed

    Go Hasegawa, Masayuki Murata

    Proceedings of IXA University Program Workshop 2002/06

  227. TCP throughput analysis with variable packet loss probability for improving fairness among long/short-lived TCP connections Peer-reviewed

    Koichi Tokuda, Go Hasegawa, Masayuki Murata

    Proceedings of IEEE Workshop on Communications Quality & Reliability 2002/05

  228. Analysis and improvement of the fairness between long-lived and short-lived TCP connections Peer-reviewed

    Koichi Tokuda, Go Hasegawa, Masayuki Murata

    Proceedings of Seventh International Workshop on Protocols for High Speed Networks (PfHSN 2002) 2002/05

  229. A resource/connection management scheme for HTTP proxy servers Peer-reviewed

    Takuya Okamoto, Tatsuhiko Terai, Go Hasegawa, Masayuki Murata

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2345 252-263 2002

    ISSN: 0302-9743

    eISSN: 1611-3349

  230. A study of a high speed packet scheduling method for achieving fairness among TCP connections Peer-reviewed

    G Hasegawa, K Kurata, M Murata

    JOURNAL OF HIGH SPEED NETWORKS 12 (1-2) 29-49 2002

    ISSN: 0926-6801

  231. Comparisons of packet scheduling algorithms for fair service among connections on the Internet Peer-reviewed

    G Hasegawa, T Matsuo, M Murata, H Miyahara

    JOURNAL OF HIGH SPEED NETWORKS 12 (1-2) 1-27 2002

    ISSN: 0926-6801

  232. A Resource/Connection Management Scheme for HTTP Proxy Servers

    OKAMOTO Takuya, TERAI Tatsuhiko, HASEGAWA Go, MURATA Masayuki

    Technical report of IEICE. TM 101 (446) 47-52 2001/11/15

    Publisher: The Institute of Electronics, Information and Communication Engineers

    ISSN: 0913-5685

    More details Close

    Although many research efforts have been devoted to the network congestion against an increase of the Internet traffic. there has been a little concern on improvement of the performance of Internet hosts in spite of the projection that the bottleneck is now being shifted from the network to hosts. We have proposed SSBT (Scalable Socket Buffer Tuning), which is intended to improve the performance of Web servers by maintaining their resources effectively and fairly, and validated its effectiveness through the simulation and implementation experiments. In the current Internet, however, a significant amount of Web document transfer requests are through HTTP proxy servers. Accordingly, in this paper, we propose a new resource management scheme for proxy servers to improve their performance and to reduce Web document transfer time via the proxy servers. Our proposed scheme has the following two components. One is an enhanced E-ATBT, which is an enhancement version of our previous E-ATBT for proxy servers by taking account of different natures among TCP connections. The other is a scheme that manages persistent TCP connections on proxy servers to avoid newly arriving TCP connections from being rejected due to lack of resources. In this paper, we validate an effectiveness of our proposed scheme through simulation experiments, and confirm that it can manage its resources effectively.

  233. Dynamic threshold control of RED for fairness among thousands TCP connections Peer-reviewed

    Go Hasegawa, Masayuki Murata

    Proceedings of 4th Asia-Pacific Symposium on Information and Telecommunication Technologies (APSITT 2001) 2001/11

  234. Design and implementation experiments of scalable socket buffer tuning Peer-reviewed

    Tatsuhiko Terai, Takuya Okamoto, Go Hasegawa, Masayuki Murata

    Proceedings of 4th Asia-Pacific Symposium on Information and Telecommunication Technologies (APSITT 2001) 2001/11

  235. Survey on fairness issues in TCP congestion control mechanisms Peer-reviewed

    G Hasegawa, M Murata

    IEICE TRANSACTIONS ON COMMUNICATIONS E84B (6) 1461-1472 2001/06

    ISSN: 0916-8516

    eISSN: 1745-1345

  236. Analysis of dynamic behaviors of many TCP connections sharing Tail-Drop/RED routers Peer-reviewed

    G Hasegawa, M Murata

    GLOBECOM '01: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-6 3 1811-1815 2001

    DOI: 10.1109/glocom.2001.965888  

    ISSN: 1930-529X

  237. Scalable socket buffer tuning for high-performance Web servers Peer-reviewed

    G Hasegawa, T Terai, T Okamoto, M Murata

    NETWORK PROTOCOLS 281-289 2001

  238. Fairness Comparisons between TCP Reno and TCP Vegas for Future Deployment of TCP Vegas Peer-reviewed

    Kenji Kurata, Go Hasegawa, Masayuki Murata

    Proceedings of INET 2000 2000/07

  239. Scalable Automatic Buffer Tuning to Provide High Performance and Fair Service for TCP Connections Peer-reviewed

    Takahiro Matsuo, Go Hasegawa, Masayuki Murata

    Proceedings of INET 2000 2000/07

  240. Analysis and improvement of fairness between TCP Reno and Vegas for deployment of TCP Vegas to the Internet

    G Hasegawa, K Kurata, M Murata

    2000 INTERNATIONAL CONFERENCE ON NETWORK PROTOCOLS, PROCEEDINGS 177-186 2000

    DOI: 10.1109/icnp.2000.896302  

  241. Fairness and stability of congestion control mechanisms of TCP Peer-reviewed

    G Hasegawa, M Murata, H Miyahara

    TELECOMMUNICATION SYSTEMS 15 (1-2) 167-184 2000

    ISSN: 1018-4864

    eISSN: 1572-9451

  242. Comparisons of packet scheduling algorithms for fair service among connections on the Internet Peer-reviewed

    Go Hasegawa, Takahiro Matsuo, Masayuki Murata, Hideo Miyahara

    Proceedings - IEEE INFOCOM 3 1253-1262 2000

    ISSN: 0743-166X

  243. Improvement of the Congestion Control Mechanism of TCP to Avoid Mis-retransmission Peer-reviewed

    HASEGAWA Go, MURATA Masayuki, MIYAHARA Hideo

    The Transactions of the Institute of Electronics,Information and Communication Engineers B 82 (11) 2074-2084 1999/11/25

    Publisher: The Institute of Electronics, Information and Communication Engineers

    ISSN: 1344-4697

  244. TCPの公平性と安定性に関する一検討

    長谷川 剛, 村田 正幸, 宮原 秀夫

    電子情報通信学会論文誌. B, 通信 = The IEICE transactions on communications. B / 電子情報通信学会 編 82 (9) 1646-1654 1999/09

    Publisher: 東京 : 電子情報通信学会通信ソサイエティ

    ISSN: 1344-4697

  245. Performance evaluation of HTTP/TCP on asymmetric networks

    Go Hasegawa, Masayuki Murata, Hideo Miyahara

    International Journal of Communication Systems 12 (4) 281-296 1999/07

    Publisher:

    DOI: 10.1002/(SICI)1099-1131(199907/08)12:4<281::AID-DAC402>3.0.CO;2-W  

    ISSN: 1074-5351

    eISSN: 1099-1131

  246. Fairness and stability of congestion control mechanisms of TCP Peer-reviewed

    G Hasegawa, M Murata, H Miyahara

    IEEE INFOCOM '99 - THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-3, PROCEEDINGS 3 1329-1336 1999

    DOI: 10.1109/INFCOM.1999.752151  

    ISSN: 0743-166X

  247. Comparisons of packet scheduling algorithms for fair service among connections Peer-reviewed

    Takahiro Matsuo, Go Hasegawa, Masayuki Murata, Hideo Miyahara

    1999 Internet Workshop, IWS 1999 137-144 1999

    DOI: 10.1109/IWS.1999.811005  

  248. Performance evaluation of HTTP/TCP on asymmetric networks Peer-reviewed

    G Hasegawa, M Murata, H Miyahara

    PERFORMANCE AND CONTROL OF NETWORK SYSTEMS III 3841 2-13 1999

    ISSN: 0277-786X

  249. A study on fairness and stability of congestion control mechanisms of TCP

    HASEGAWA Go, MURATA Masayuki, MIYAHARA Hideo

    Technical report of IEICE. SSE 97 (618) 127-132 1998/03/20

    Publisher: The Institute of Electronics, Information and Communication Engineers

    ISSN: 0913-5685

    More details Close

    In this paper, we focus on fairness and stability of the congestion control mechanism of TCP by investigating its behavior through on analytic approach. In addition to TCP Tahoe and TCP Reno, widely used in the current Internet, we also consider TCP Vegas, which adjusts the sending window size by observing the round trip times of the connection. Through the analysis, we find that TCP Vegas cannot provide the fairness among connections, which would be achieved in TCP Tahoe and TCP Reno. Accordingly, we propose an improvement of TCP Vegas to resolve the problem.

  250. Performance improvement of TCP over EFCI-based ABR service class by tuning of congestion control parameters

    G Hasegawa, H Ohsaki, M Murata, H Miyahara

    IEICE TRANSACTIONS ON COMMUNICATIONS E80B (10) 1444-1453 1997/10

    ISSN: 0916-8516

    eISSN: 1745-1345

  251. Improvement of the congestion contral mechanisms of TCP over ER-based ABR Service class in ATM Networks

    Proceedings of 2nd IFIP Workshop on Traffic Management and Synthesis of ATM Networks 1-4 1997

  252. Performance evaluation and parameter tuning of TCP over ABR service in ATM networks Peer-reviewed

    G Hasegawa, H Ohsaki, M Murata, H Miyahara

    IEICE TRANSACTIONS ON COMMUNICATIONS E79B (5) 668-683 1996/05

    ISSN: 0916-8516

    eISSN: 1745-1345

  253. Performance of TCP over ATM Networks

    Proceedings of IEEE GLOBECOM'96 1935-1944 1996

  254. Performance of TCP over ABR service class Peer-reviewed

    G Hasegawa, H Ohsaki, M Murata, H Miyahara

    IEEE GLOBECOM 1996 - CONFERENCE RECORD, VOLS 1-3 3 1935-1941 1996

  255. Parameter Tuning of Rate-Based Congestion Control Algorithms and its Application to TCP over ABR Peer-reviewed

    Hiroyuki Ohsaki, Go Hasegawa, Masayuki Murata, Hideo Miyahara

    Proceedings of IFIP WG6.2 Broadband Communication: First Workshop on ATM Traffic Management 1995/12

Show all ︎Show first 5

Misc. 162

  1. エネルギーストレージを用いたキャンパスビルの電力需要平準化へのモデル予測制御適用に関する一検討—A Study of Applying Model Predictive Control to Peak Shaving Using Energy Storage at Campus Buildings—情報ネットワーク

    小川 祐紀雄, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 117 (460) 147-152 2018/03

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  2. 招待講演 IoT/M2M通信を収容するためのモバイルコアネットワークアーキテクチャ—Invited Talk : Mobile core network architecture for accommodating IoT/M2M communications

    長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 117 (304) 1-6 2017/11

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  3. 仮想化技術に基づくモバイルアクセスネットワークの解析的性能評価

    山崎 里奈, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 117 (131) 57-62 2017/07

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  4. 電力供給ネットワークへの依存性を考慮した構内情報通信ネットワークの脆弱性に関する一検討—A Study of Vulnerability of Campus-wide Information Communication Networks Considering Dependency on Power Distribution Networks—情報ネットワーク

    小川 祐紀雄, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 116 (485) 43-48 2017/03

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  5. C/U分離を適用したモバイルコアネットワークにおける通信集約方式の性能評価

    阿部 修也, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 116 (382) 25-30 2016/12

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  6. モデル予測制御によるハイブリッドクラウド環境でのビジネスクリティカルシステムの計算資源配置の一検討—A Study of Computing Resource Allocation Based on Model Predictive Control for Business-Critical Systems in Hybrid Cloud Environment

    小川 祐紀雄, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 116 (322) 1-6 2016/11

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  7. 機械学習を用いた太陽光発電量の予測に基づくスマートホームの電力制御—Power Control for Smart Home Based on Solar Power Prediction Using Machine Learning

    村岡 駿, 長谷川 剛, 松田 和浩, 松岡 茂登, 牧野 義樹, 丹 康雄

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 116 (230) 67-72 2016/09

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  8. ノード仮想化とプレーン分離を適用した広域モバイルコアネットワークの性能評価

    長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 116 (8) 47-52 2016/04

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  9. データセンタの消費電力削減のための遺伝アルゴリズムに基づくタスク配置・空調機設定手法の性能評価—GA-based task assignment and air conditioner setting for reducing data center power consumption

    出口 孝明, 菅沼 孝二, 樽谷 優弥, 長谷川 剛, 中村 泰, 田村 卓三, 松田 和浩, 松岡 茂登

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

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  10. エッジ配信によるWeb応答時間削減効果の分析—Analyzing Effect of Edge Computing on Reduction of Web Response Time—情報通信マネジメント

    上山 憲昭, 中野 雄介, 塩本 公平, 長谷川 剛, 村田 正幸, 宮原 秀夫

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 115 (507) 1-6 2016/03

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  11. シグナリング処理負荷を考慮したノード仮想化及びプレーン分離を適用したモバイルコアネットワークの性能評価—情報通信マネジメント

    阿部 修也, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 115 (507) 41-46 2016/03

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  12. 生化学反応モデルに着想を得た仮想ネットワーク機能の配置手法の提案と評価—情報通信マネジメント

    坂田 航樹, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 115 (507) 25-30 2016/03

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  13. トラヒック予測に基づくハイブリッドクラウドシステムのコストと性能の評価—Cost and Performance Evaluation of Hybrid Cloud Systems Based on Traffic Prediction—情報ネットワーク

    小川 祐紀雄, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 115 (210) 57-62 2015/09

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  14. 化学反応式モデルに基づく仮想サービス配置手法の安定性評価—Stability evaluation of chemical-inspired placement method of virtualized services

    長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 115 (209) 23-28 2015/09

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  15. B-6-58 Estimation Method for Onload Time of Web Pages

    Nakano Yuusuke, Kamiyama Noriaki, Shiomoto Kohei, Hasegawa Go, Murata Masayuki, Miyahara Hideo

    Proceedings of the Society Conference of IEICE 2015 (2) 58 2015/08/25

    Publisher: The Institute of Electronics, Information and Communication Engineers

  16. 招待講演 トランスポート層プロトコルと無線機器の省電力機構の連携—Invited Talk : Studies on cooperation of transport-layer protocols and power-saving mechanisms in wireless network devices—スマート無線

    長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 115 (62) 53-58 2015/05

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  17. データセンタにおける空調機の消費電力を削減するための遺伝アルゴリズムに基づくタスク配置手法の性能評価—Performance evaluation of GA-based task assignment method for reducing air conditioning power consumption at data centers

    出口 孝明, 樽谷 優弥, 長谷川 剛

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 114 (477) 149-153 2015/03

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  18. 数値流体力学シミュレーションによるデータセンタ内の温度予測のためのサーバモデルの提案—Server model for predicting temperature distribution in data center with CFD simulation

    北田 和将, 樽谷 優弥, 長谷川 剛

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 114 (477) 385-390 2015/03

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  19. CEMSにおける多数端末の同時接続に対するMQTTプロトコルの拡張性の実験評価—Experimental evaluation of the scalability of MQTT protocol for simultaneous connections of a large number of clients in CEMS

    北川 貴大, 樽谷 優弥, 長谷川 剛

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 114 (477) 239-244 2015/03

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  20. データセンタの電力削減のための機械学習法を利用した温度分布予測—Temperature prediction for energy optimization in data centers by machine learning approaches

    橋本 和幸, 樽谷 優弥, 長谷川 剛

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 114 (477) 87-92 2015/03

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  21. Websocketを用いたクラウド型HEMSのスケーラビリティの実験評価—Experimental evaluation of scalability of cloud-based HEMS with WebSocket protocol

    エンヘー テムーレン, 樽谷 優弥, 長谷川 剛

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 114 (477) 167-172 2015/03

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  22. データセンタの温度分布予測のためのネットワークモデルの提案—A network model for prediction of temperature distribution in data center

    田代 晋也, 樽谷 優弥, 長谷川 剛

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 114 (477) 81-86 2015/03

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  23. M2M通信収容のための仮想モバイルコアネットワークアーキテクチャに関する一検討—Virtualized mobile core network architecture for accommodating M2M traffic

    長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 114 (477) 493-498 2015/03

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  24. B-6-110 Acceleration Method for Web Performance by Caching Rendering Result

    Nakano Yuusuke, Kamiyama Noriaki, Shiomoto Kohei, Hasegawa Go, Murata Masayuki, Miyahara Hideo

    Proceedings of the IEICE General Conference 2015 (2) 110 2015/02/24

    Publisher: The Institute of Electronics, Information and Communication Engineers

  25. B-5-101 A Study of VFDM Multi-Antenna Expansion Method for 5G Wireless Communication System

    HASEGAWA Tsuyoshi

    Proceedings of the IEICE General Conference 2015 (1) 456 2015/02/24

    Publisher: The Institute of Electronics, Information and Communication Engineers

  26. モバイルコアネットワークにおけるM2M通信集約手法の解析的評価—Performance analysis of aggregation method for machine type communications in mobile core networks—モバイルネットワークとアプリケーション

    長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 114 (160) 51-56 2014/07

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  27. 生物ネットワークの縮退特性を応用したデータセンタの仮想マシン配置における頑強な冗長化手法—Robust virtual machine deployment method for datacenter inspired by degeneracy in biological networks—情報通信マネジメント

    添 亮太, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 113 (492) 31-36 2014/03

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  28. エンド端末間パスにおける複数区間の利用可能帯域計測手法の実験評価—Experimental Evaluation of Available Bandwidth Measurement Method for Arbitrary Parts of End-to-End Path—情報通信マネジメント

    森本 顕, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 113 (492) 1-6 2014/03

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  29. Websocket技術を用いてASPサービス化したHEMSの性能評価—Performance Evaluation of HEMS over ASP service utilizing Websocket Protocol

    童 チイリン, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 113 (472) 91-96 2014/03

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  30. モバイルコアネットワークへのアクセス負荷を平滑化するためのバックオフ機構の拡張—Extension of a Back-off Feature for Temporal Load Balancing in Mobile Core Networks—モバイルネットワークとアプリケーション

    岩井 孝法, 長谷川 剛, 若宮 直紀

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 113 (398) 67-72 2014/01

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  31. 無線センサネットワークにおける受信電波強度に基づいた省電力情報散布手法の提案と評価—Energy efficient information dissemination scheme based on the received signal strength in wireless sensor networks—情報ネットワーク

    久松 潤之, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 113 (303) 41-46 2013/11

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  32. 無線LANにおける省電力TCPデータ転送方式の実験評価—Experimental Evaluation of Energy-Efficient TCP Data Transfer over a Wireless LAN

    橋本 匡史, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 113 (208) 113-118 2013/09

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  33. モバイルネットワークにおける通信制御コスト削減のための端末集約手法の性能評価—Performance evaluation of tunnel aggregation method for reducing control plane cost in mobile core networks—モバイルネットワークとアプリケーション

    櫻井 駿, 長谷川 剛, 若宮 直紀

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 113 (56) 193-198 2013/05

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  34. 生物ネットワークの縮退特性に基づくシステム冗長化方式における自律的障害回復手法—Autonomous failure recovery scheme for redundancy configuration method inspired by degeneracy in biological networks

    長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 113 (4) 31-36 2013/04

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  35. マルチテナント型データセンタにおける性能と耐障害性を考慮した仮想ネットワーク配置方式—Virtual Network Assignment Considering Performance and Fault Tolerance in a Multi-tenant Data Center—情報ネットワーク

    小川 祐紀雄, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 112 (464) 191-196 2013/03

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  36. 生物ネットワークの縮退特性に基づく頑強性を有する情報ネットワークシステムの冗長化手法—Robust redundant configuration method of information network systems inspired by degeneracy in biological networks

    岡崎 拓郎, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 112 (463) 595-600 2013/03

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  37. トランジットコスト削減のためのISP間協調に基づくCCNキャッシュ共有手法—Cooperative cache sharing among ISPs for reducing inter-ISP transit cost in content-centric networking

    松田 一仁, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 112 (463) 415-420 2013/03

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  38. パレート最適ネットワーク実現のためのユーザ・資源管理アプリケーションデモシステムの開発—Development of a demonstration system for User and Resource Management Technologies towards Pareto-optimal Wired-wireless Networks

    矢守 恭子, 太田 能, 長谷川 剛

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 112 (414) 1-4 2013/01/25

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  39. モバイルコアネットワークにおけるトンネル集約方式—A tunnel aggregation method for a mobile core networks

    岩井 孝法, 長谷川 剛, 若宮 直紀

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 112 (350) 115-120 2012/12

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  40. IEEE 802.16jリレーネットワークにおけるボトルネック解消のためのタイムスロット追加手法の提案と評価—Time slot adding assignment in IEEE 802.16j wireless relay networks

    北山 智也, 長谷川 剛, 谷口 義明

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 112 (231) 47-52 2012/10

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  41. IEEE 802.16jリレーネットワークにおける電波干渉による伝送量変動を考慮したタイムスロット割当手法—Time slot assignment algorithm for IEEE 802.16j relay networks considering wireless link transmission quality

    高木 祥一, 長谷川 剛, 谷口 義明

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 112 (231) 53-58 2012/10

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  42. パレート最適ネットワーク実現のためのユーザ・資源管理アプリケーション—User and Resource Management Technologies towards Pareto-optimal Wired-wireless Networks—情報ネットワーク

    太田 能, 長谷川 剛, 新熊 亮一

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 112 (230) 39-44 2012/10

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  43. IEEE 802.16jリレーネットワークにおける様々な電波干渉モデルに基づくタイムスロット割当手法の性能評価—Performance evaluation of time slot assignment algorithms with various radio interference models in IEEE 802.16j relay networks

    三根 量輔, 長谷川 剛, 谷口 義明

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 112 (218) 37-42 2012/09

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  44. B-6-11 Home Energy Management System utilizing Web of Things (1)

    Masuo Tsuyoshi, Nakamura Jiro, Matsuoka Morito, Hasegawa Go, Murata Masayuki, Matsuda Kazuhiro

    Proceedings of the Society Conference of IEICE 2012 (2) 11 2012/08/28

    Publisher: The Institute of Electronics, Information and Communication Engineers

  45. BS-4-3 Study on Exploiting SCTP to Save Energy of TCP Data Transfer over a Wireless LAN

    Hashimoto Masafumi, Hasegawa Go, Murata Masayuki

    Proceedings of the Society Conference of IEICE 2012 (2) "S-20"-"S-21" 2012/08/28

    Publisher: The Institute of Electronics, Information and Communication Engineers

  46. トラヒック変動に応じた発見的手法に基づく動的アプリケーション層経路制御手法—A dynamic application-level routing method reacting traffic changes based on distributed heuristic algorithm—情報ネットワーク

    松田 一仁, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 112 (134) 19-24 2012/07

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  47. 生物ネットワークの縮重性・冗長性に基づく情報ネットワーク設計に関する一検討—A study on information network design inspired by degeneracy and redundancy in biological networks

    長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 112 (119) 29-34 2012/07

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  48. 複眼センサシステムのためのモンテカルロ法に基づく歩行者数推定手法の提案と評価—Monte Carlo-based bi-directional pedestrian counting with compound-eye binary sensors—言語理解とコミュニケーション

    藤井 崇渡, 谷口 義明, 長谷川 剛

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 112 (110) 13-18 2012/06/29

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  49. 無線LAN環境におけるTCPデータ転送の省電力化のためのSCTPトンネリングの提案—Proposal of SCTP Tunneling for Energy-Efficient TCP Data Transfer over a Wireless LAN Environment—情報ネットワーク

    橋本 匡史, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 112 (88) 13-18 2012/06

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  50. 無線センサネットワークにおける位相ロッキングおよび逆相同期を利用した情報収集手法—A data gathering mechanism using phase-locking and anti-phase synchronization for wireless sensor networks

    谷口 義明, 長谷川 剛, 中野 博隆

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 112 (30) 1-6 2012/05

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  51. BT-4-5 Network Management and Control Technologies for Pareto Optimal Network

    Yamori Kyoko, Ohta Chikara, Shinkuma Ryoichi, Hasegawa Go, Murase Tutomu, Oguchi Masato

    Proceedings of the IEICE General Conference 2012 (2) "SS-91"-"SS-92" 2012/03/06

    Publisher: The Institute of Electronics, Information and Communication Engineers

  52. 障害物を考慮したIEEE 802.16jネットワークにおける重回帰分析に基づく性能推定手法—Performance estimation based on multiple regression analysis for IEEE 802.16j networks with obstacles—情報ネットワーク

    伊勢 悠輝, 長谷川 剛, 谷口 義明

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 111 (469) 157-162 2012/03

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  53. IEEE802.16jリレーネットワークにおけるノード間距離を考慮したノード位置調整手法—Node repositioning method based on distance between nodes in IEEE 802.16j relay networks

    重藤 隆文, 長谷川 剛, 谷口 義明

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 111 (468) 345-350 2012/03

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  54. パネル討論 無線・有線統合環境におけるパレート最適ネットワーク実現のためのユーザおよび資源管理・制御機構—Panel Discussion : Management and Control of User and Resource toward Pareto-optimal Wireless and Wired Networks—ソフトウェア無線

    太田 能, 長谷川 剛, 新熊 亮一

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 111 (417) 37-42 2012/01

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  55. 特別講演 インターネットにおけるトランスポート層アーキテクチャに関する研究—Special Talk : Research histories and trends on transport-layer protocols in the Internet—マルチメディア・仮想環境基礎

    長谷川 剛

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 111 (380) 91-96 2012/01

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  56. エンド端末間パスにおける複数区間の利用可能帯域計測手法—Measuring available bandwidth of multiple parts on end-to-end network path—情報ネットワーク

    鯉谷 和正, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 111 (346) 7-12 2011/12

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  57. ポスター講演 ネットワーク機器の省電力動作を考慮したエンド間帯域計測手法の性能評価—Evaluation of end-to-end bandwidth measurement method with power-saving routers

    小林 大翼, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 111 (232) 45-50 2011/10

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  58. 特別講演 パレート最適ネットワーク制御技術の実現にむけて--無線・有線コグニティブ環境におけるユーザを主体としたネットワーク制御—Network control for Pareto optimality in future internet: user-centric wired-wireless cognitive technology—モバイルマルチメディア通信

    村瀬 勉, 新熊 亮一, 長谷川 剛

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 111 (203) 33-38 2011/09

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  59. エンド間ネットワーク性能向上のための発見的手法に基づくアプリケーション層経路制御手法—An application-level routing method for improving end-to-end network performance based on heuristic algorithm

    松田 一仁, 長谷川 剛, 亀井 聡

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 111 (196) 23-28 2011/09

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  60. IEEE802.16jリレーネットワークにおける適応変調符号化を考慮したタイムスロット割り当て手法の提案と評価—Proposal and evaluation of time slot assignment algorithms considering adaptive modulation and coding in IEEE 802.16j relay networks—情報ネットワーク

    北山 智也, 長谷川 剛, 谷口 義明

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 111 (67) 13-18 2011/05

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  61. 無線メッシュネットワークにおける信号対干渉比を考慮した簡易電波干渉モデルの評価—Parameter tuning of protocol interference model considering SINR for wireless mesh networks

    姜 京延, 谷口 義明, 長谷川 剛

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 110 (448) 145-150 2011/03

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  62. 通信経路を考慮したIEEE802.16j上りリンクへのタイムスロット割り当て手法の拡張—Improvement of time slot assignment algorithm considering upstream transmission path in IEEE 802.16j networks

    田中 慎平, 長谷川 剛, 谷口 義明

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 110 (448) 181-186 2011/03

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  63. オプティカルフローを用いた降水量の短時間予報—Short-term precipitation forecasting using an optical flow algorithm

    今城 健太郎, 長谷川 剛, 谷口 義明

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 110 (455) 93-98 2011/03

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  64. オーバレイネットワークにおける計測数削減手法の性能評価—Performance evaluation of spatial composition method of measurement results in overlay networks—情報ネットワーク

    正原 竜太, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 110 (449) 217-222 2011/03

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  65. BS-5-7 Analysis of Power Consumption of a Single TCP Flow with Burst Transmission in a Wireless LAN Environment

    Hashimoto Masafumi, Hasegawa Go, Murata Masayuki

    Proceedings of the IEICE General Conference 2011 (2) "S-107"-"S-108" 2011/02/28

    Publisher: The Institute of Electronics, Information and Communication Engineers

  66. BS-5-1 Toward Realization of Pareto-optimal Network Control Technologies

    Ohta Chikara, Shinkuma Ryoichi, Hasegawa Go, Yamori Kyoko, Murase Tutomu

    Proceedings of the IEICE General Conference "S-95"-"S-96" 2011

    Publisher: The Institute of Electronics, Information and Communication Engineers

  67. 無線LAN環境におけるTCPの動作を考慮した消費電力モデルの提案—Analysis of power consumption in TCP data transmission over a wireless LAN environment

    橋本 匡史, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 110 (339) 1-6 2010/12

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  68. 計測衝突を軽減するための分散型オーバレイネットワーク計測手法—A distributed measurement method for reducing measurement conflict in overlay networks

    Dinh Tien Hoang, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 110 (287) 49-54 2010/11

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  69. ポスター講演 無線メッシュネットワークにおける信号対干渉比を考慮した簡易電波干渉モデルに関する一検討—Extending protocol interference model for wireless mesh networks considering signal-to-noise ratio

    姜 京延, 谷口 義明, 長谷川 剛

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 110 (240) 55-60 2010/10

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  70. ポスター講演 IEEE802.16j上り通信における伝送遅延時間低減のためのタイムスロット割り当て手法の提案—Time slot assignment algorithms for reducing upstream latency in IEEE 802.16j networks

    田中 慎平, 長谷川 剛, 谷口 義明

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 110 (240) 49-54 2010/10

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  71. 障害物による通信電波の遮断を考慮したIEEE802.16jリレーネットワークの性能評価—Performance evaluation of IEEE 802.16j relay networks with consideration of blocking radio waves by obstacles—情報ネットワーク

    伊勢 悠輝, 長谷川 剛, 谷口 義明

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 110 (191) 61-66 2010/09

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  72. TCPによる動画像ストリーミングのためのデータ転送方式の検討—Design and evaluation of a data transfer mechanism for video streaming over TCP

    久松 潤之, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 110 (198) 31-36 2010/09

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  73. B-6-74 A Transport Control Method for Cooperative Bandwidth Allocation in Wireless Downlinks

    NISHIO Takayuki, SHINKUMA Ryoichi, TAKAHASHI Tatsuro, HASEGAWA Go

    Proceedings of the Society Conference of IEICE 2010 (2) 74 2010/08/31

    Publisher: The Institute of Electronics, Information and Communication Engineers

  74. インラインネットワーク計測技術のビデオ会議アプリケーションへの応用—Application of inline network measurement technique to adaptive quality control in video conferencing system—情報ネットワーク

    長谷川 剛, 尾池 健二, 天野 勝博

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 110 (116) 13-18 2010/07

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  75. オーバレイルーティングに起因するISP間トランジットコスト削減手法の提案および評価—Reducing inter-ISP transit cost caused by overlay routing

    松田 一仁, 長谷川 剛, 亀井 聡

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 110 (39) 7-12 2010/05

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  76. オーバレイネットワークにおける計測結果統合手法の精度評価—Accuracy evaluation of spatial composition of measurement results in overlay networks

    長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 110 (39) 1-6 2010/05

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  77. IEEE 802.16jリレーネットワークにおけるサービス領域展開手法の性能評価—Performance evaluation of service area deployment methods of IEEE 802.16j relay networks—情報ネットワーク

    竹森 翔一, 長谷川 剛, 谷口 義明

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 110 (18) 37-42 2010/04

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  78. シナリオ型仮説方式に基づくオブジェクト追跡手法における仮説処理の改良と情報損失への対応—Improving hypothesis management and considering sensor information loss for scenario-type hypothesis object tracking—情報ネットワーク

    村田 将一, 谷口 義明, 長谷川 剛

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 109 (449) 157-162 2010/03

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  79. 広域分散コンピューティング環境における電力消費を考慮した性能評価手法—Performance evaluation of distributed computing environment considering power consumption—情報ネットワーク

    小川 祐紀雄, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 109 (449) 169-174 2010/03

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  80. オーバレイネットワークのためのプロアクティブ型ネットワーク障害回復手法—Proactive failure recovery method for overlay networks—情報ネットワーク

    堀江 拓郎, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 109 (449) 49-54 2010/03

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  81. IEEE 802.16jリレーネットワークにおけるパケット伝送遅延時間の評価—Evaluation of packet transmission latency in IEEE 802.16j relay networks—情報ネットワーク

    石井 倫太郎, 長谷川 剛, 谷口 義明

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 109 (449) 199-204 2010/03

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  82. 確率的手法に基づくオーバレイネットワーク計測の競合軽減—Decreasing measurement conflict on overlay networks based on randomized algorithms—情報通信マネジメント

    長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 109 (378) 25-30 2010/01

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  83. 無線LAN環境におけるTCPフロー間の公平性改善手法の実験評価と評価指標の提案—Experimental evaluation of TCP congestion control mechanisms in wireless LAN environment with a novel performance metric

    橋本 匡史, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 109 (326) 33-38 2009/12

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  84. 複数のバイナリセンサを組み合わせた複眼センサによるオブジェクトの移動特性検出—Detection of movement characteristics of objects with compound-eye binary sensors—情報ネットワーク

    谷口 義明, 合田 幸裕, 長谷川 剛

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 109 (276) 17-22 2009/11

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  85. ポスター講演 領域分割を用いたシナリオ型仮説方式に基づくオブジェクト追跡手法の提案—Object tracking method based on scenario-type hypothesis tracking in segmented multiple regions

    村田 将一, 谷口 義明, 長谷川 剛

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 109 (228) 59-64 2009/10

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  86. ポスター講演 IEEE 802.16マルチホップリレーネットワークにおけるタイムスロット割り当て手法の性能評価—Performance evaluation of time slot allocation algorithms in IEEE 802.16 multi-hop relay networks

    石井 倫太郎, 長谷川 剛, 谷口 義明

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 109 (228) 65-70 2009/10

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  87. B-11-8 Probabilistic method for avoiding measurement overlaps in overlay networks

    Hasegawa Go, Murata Masayuki

    Proceedings of the Society Conference of IEICE 2009 (2) 273 2009/09/01

    Publisher: The Institute of Electronics, Information and Communication Engineers

  88. 特別講演 無線ネットワーク環境に適したトランスポート層プロトコル—Special talk: Transport-layer optimization methods for wireless network environment—モバイルマルチメディア通信

    長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 109 (122) 35-40 2009/07

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  89. 招待講演 オーバレイネットワークにおける経路制御とISPへの影響—Invited talk: Routing on overlay networks and its impact on ISP—情報ネットワーク

    長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 109 (79) 17-22 2009/06

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  90. IEEE802.16メッシュネットワークにおける物理トポロジ情報を用いた被覆領域の改善手法—Improving coverage area quality using physical topology information in IEEE802.16 mesh networks—情報ネットワーク

    竹森 翔一, 長谷川 剛, 谷口 義明

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 109 (37) 43-48 2009/05

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  91. B-11-5 Reducing measurement conflict on overlay networks

    Hasegawa Go, Murata Masayuki

    Proceedings of the IEICE General Conference 2009 (2) 436 2009/03/04

    Publisher: The Institute of Electronics, Information and Communication Engineers

  92. TDMA型無線メッシュネットワークにおける負荷分散及び電波干渉軽減のためのスパニングツリー構築法—Load-balanced and interference-aware spanning tree construction algorithm for TDMA-based wireless mesh networks—情報通信マネジメント

    時任 宏, 笹部 昌弘, 長谷川 剛

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 108 (481) 1-6 2009/03

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  93. 計測誤差および環境変動を考慮した帯域計測に基づくTCP輻輳制御方式—Bandwidth-based congestion control for TCP with awareness of measurement noise and environmental change—情報ネットワーク

    児玉 瑞穂, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 108 (458) 55-60 2009/03

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  94. 無線メッシュネットワークにおける電波干渉及び経路長を考慮した電力制御手法—Power control methods considering radio interference and path length for wireless mesh networks—情報通信マネジメント

    秀熊 俊昭, 長谷川 剛, 笹部 昌弘

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 108 (481) 7-12 2009/03

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  95. オーバレイルーチングによるキャッシュを考慮したP2Pファイル共有ネットワークの性能評価—Performance evaluation of P2P file-sharing network with relay caching in overlay routing—情報通信マネジメント

    野田 健, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 108 (481) 81-86 2009/03

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  96. オーバレイネットワークにおける経路重複を利用した計測手法—Reducing measurement overhead using path overlapping in overlay networks—情報通信マネジメント

    森 弘樹, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 108 (481) 53-58 2009/03

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  97. オーバレイネットワークの密度にスケーラブルなネットワーク計測手法—Scalable and density-aware measurement strategies for overlay networks—情報ネットワーク

    長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 108 (342) 127-132 2008/12

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  98. シンクライアントトラヒックの性能向上のための遅延解析とTCP層最適化—Delay analysis and transport-layer optimization for improving performance of thin-client traffic—情報ネットワーク

    小川 祐紀雄, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 108 (204) 75-80 2008/09

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  99. 大規模ネットワーク障害に対応可能なオーバレイルーティング手法—A new method of proactive recovery mechanisms for large-scale network failures—情報ネットワーク

    堀江 拓郎, 長谷川 剛, 亀井 聡

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 108 (204) 117-122 2008/09

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  100. 無線メッシュネットワークにおける無線資源の利用効率を向上するための電力制御手法—Power control method for increasing capacity in wireless mesh networks

    秀熊 俊昭, 長谷川 剛, 笹部 昌弘

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 108 (151) 61-66 2008/07

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  101. 無線メッシュネットワークにおけるゲートウェイ負荷を均一化するための経路制御手法—Routing method for gateway load balancing in wireless mesh networks

    時任 宏, 笹部 昌弘, 長谷川 剛

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 108 (151) 73-78 2008/07

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  102. 無線LAN環境における複合型TCP輻輳制御手法の性能評価とその改善手法—Performance evaluation and improvement of hybrid TCP congestion control mechanisms in wireless LAN environment

    橋本 匡史, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 108 (134) 13-18 2008/07

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  103. オーバレイルーティングによるネットワークただ乗り問題の評価とその緩和手法に関する一検討—Evaluation of free-riding traffic problem in routing overlay networks and its mitigation method—情報ネットワーク

    平岡 佑一朗, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 107 (525) 271-276 2008/03

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  104. リンクメトリックの不確実性が経路制御に与える影響の評価—Impact of unreliable link metric on traffic routing performance

    児玉 瑞穂, 亀井 聡, 長谷川 剛

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 107 (312) 25-30 2007/11

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  105. 遅延および帯域情報を用いたオーバレイルーティングの有効性評価—Effectiveness of overlay routing based on delay and bandwidth information

    平岡 佑一朗, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 107 (134) 19-24 2007/07

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  106. オーバレイネットワーク技術の非常時通信への適用に関する一検討—A study on emergency networking services based on overlay network technologies—情報ネットワーク

    長谷川 剛, 亀井 聡, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 107 (98) 73-78 2007/06

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  107. インライン計測に基づくTCP輻輳制御方式の実ネットワークにおける性能評価—Implementation experiments of a congestion control mechanism of TCP with inline network measurement

    児玉 瑞穂, 山根木 果奈, 長谷川 剛

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 107 (19) 13-18 2007/04

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  108. スループット保証を実現するTCPの輻輳制御方式の実装評価—Implementation and evaluation of TCP congestion control mechanism for predictable throughput—情報ネットワーク

    山根木 果奈, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 106 (578) 213-218 2007/03

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  109. エッジルータにおける改造TCPの検出・制御手法の提案—Detection and control mechanism of tampered-TCP at edge routers—情報ネットワーク

    丸山 純一, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 106 (578) 231-236 2007/03

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  110. Paced TCPがルータのバッファサイズ設定に与える影響—Effect of paced TCP on router buffer sizing—情報ネットワーク

    多田 健太郎, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 106 (578) 225-230 2007/03

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  111. 招待講演 高速・高遅延ネットワークのためのトランスポート層プロトコル

    長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 106 (524) 41-46 2007/02

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  112. オーバレイルーティングに起因するネットワークただ乗り問題に関する一検討

    長谷川 剛, 小林 正好, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 106 (420) 133-138 2006/12

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  113. 大規模ネットワークにおけるTCPトラヒックを考慮したルータのバッファサイズの検討

    久松 潤之, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 106 (420) 97-102 2006/12

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  114. インラインネットワーク計測に基づくTCPスループットの保証手法

    山根木 果奈, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 106 (237) 7-12 2006/09

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  115. 高速ネットワークにおけるインラインネットワーク計測手法の実装に関する検討および性能評価

    津川 知朗, Cao Le Thanh Man, 長谷川 剛

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 106 (151) 73-78 2006/07

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  116. 改造TCPがネットワークに与える影響に関する一検討

    丸山 純一, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 106 (151) 31-36 2006/07

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  117. TCPトラヒックを考慮した大規模ネットワーク解析手法の提案

    久松 潤之, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 106 (9) 31-36 2006/04

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  118. BS-10-2 Analytical Evaluation of Receiver-based ACK Splitting Mechanism for TCP over Wired/wireless Heterogeneous Networks

    Nakata Masashi, Hasegawa Go

    Proceedings of the IEICE General Conference 2006 (2) "S-67"-"S-68" 2006/03/08

    Publisher: The Institute of Electronics, Information and Communication Engineers

  119. スループット保証を実現するTCPの輻輳制御方式の提案と評価

    山根木 果奈, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 105 (628) 195-200 2006/03

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  120. ルータのバッファサイズがTCPの性能に与える影響についての一考察

    冨岡 健史, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 105 (628) 431-436 2006/03

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  121. インラインネットワーク計測手法およびその応用手法の実ネットワーク上での性能評価—インターネットの新しいサービスとその基盤技術及び一般

    森 一成, 浜 崇之, 長谷川 剛

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 105 (602) 67-72 2006/02

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  122. 奨励講演 有線・無線混在ネットワークのためのTCP動的ACK分割手法のスループット解析

    仲田 昌史, 長谷川 剛, 中野 博隆

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 105 (562) 9-12 2006/01

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  123. インラインネットワーク計測手法ImTCPおよびその応用手法の実装および性能評価

    津川 知朗, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 105 (472) 61-66 2005/12

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  124. 有線・無線統合ネットワークにおけるTCP性能向上のための動的ACK分割手法

    仲田 昌史, 長谷川 剛, 中野 博隆

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 105 (195) 21-24 2005/07

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  125. エンドホスト間のネットワークパスの物理帯域のインライン計測手法

    Cao Le Thanh Man, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 105 (113) 5-10 2005/06

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  126. 帯域計測に基づくTCPの輻輳制御方式の提案と評価

    井口 智仁, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 104 (692) 97-102 2005/03/04

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  127. インライン計測に基づくTCPによるバックグラウンド転送方式

    津川 知朗, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 104 (658) 1-6 2005/02/17

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  128. TCPプロキシ機構の実ネットワーク上での実装評価

    山根木 果奈, 浜 崇之, 長谷川 剛

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 104 (658) 7-12 2005/02/17

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  129. インライン計測に基づく高速TCP輻輳制御方式の提案

    井口 智仁, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 104 (340) 83-88 2004/10/15

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  130. TCPオーバレイネットワークの性能解析および評価

    牧 一之進, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 104 (340) 77-82 2004/10/15

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  131. ImTCP:利用可能帯域の計測を可能とするTCP

    Cao Le Thanh Man, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 104 (73) 37-42 2004/05/21

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  132. TCPコネクションのためのアクセスリンク資源管理方式

    東 和弘, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 103 (691) 97-102 2004/03/04

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  133. TCPオーバレイネットワークにおけるTCPコネクション分割機構の性能解析

    牧 一之進, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 103 (651) 7-12 2004/02/13

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  134. TCP中継における輻輳伝達制御方法と性能評価

    山崎 康広, 村瀬 勉, 長谷川 剛

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 103 (492) 13-18 2003/12/11

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  135. インターネットサーバにおけるTCPコネクション資源管理手法の実装評価

    東 和弘, 岡本 卓也, 長谷川 剛

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 103 (289) 49-54 2003/09/04

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  136. HighSpeed TCPの性能評価とその性能改善方式の提案

    徳田 航一, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 102 (694) 213-218 2003/03/07

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  137. Inline Network Measurement with Active TCP connections

    Man Cao Le Thanh

    Proceedings of the IEICE General Conference 2003 (2) "S-11"-"S-12" 2003/03/03

    Publisher: The Institute of Electronics, Information and Communication Engineers

  138. サービスオーバーレイネットワークのためのインラインネットワーク計測に関する一検討

    Cao Le Thanh Man, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 102 (563) 53-58 2003/01/17

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  139. WebプロキシサーバにおけるTCP受信バッファの動的割り当て方式—特集テーマ ブロードバンドサービス,CDN(コンテンツ配信ネットワーク)及び一般

    岡本 卓也, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 102 (384) 13-18 2002/10/18

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  140. ネットワークプロセッサを用いた実験用ネットワークエミュレータシステムの構築

    東條 晴基, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 101 (716) 25-32 2002/03/14

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  141. 衛星インターネットにおけるTCPコネクション多重化のための代理応答機構

    幸田 守弘, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 101 (714) 69-76 2002/03/14

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  142. Webプロキシサーバにおける動的資源管理方式の提案と実装—特集テーマ:コンテンツデリバリ技術及び一般

    寺井 達彦, 岡本 卓也, 長谷川 剛

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 101 (639) 25-32 2002/02/14

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  143. 転送データサイズの違いによるTCPコネクション間の不公平性に関する一検討

    徳田 航一, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 101 (561) 7-12 2002/01/18

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  144. 招待論文 インターネットフローの公平性—特集テーマ:インターネットの品質制御技術、及び一般

    長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 101 (374) 37-44 2001/10/19

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  145. バックボーンルータにおけるREDの動的閾値制御方式

    長谷川 剛, 板谷 夏樹, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 101 (9) 1-6 2001/04/20

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  146. TCPの公平性を考慮したパケット処理方式のネットワークプロセッサへの実装に関する検討

    倉田 謙二, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 100 (670) 459-466 2001/03/09

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  147. Webサーバの高速・高機能化のためのソケットバッファ管理方式の実装と評価

    寺井 達彦, 岡本 卓也, 長谷川 剛

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 100 (670) 47-54 2001/03/09

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  148. TCPバージョン間の不公平性を解消するパケット廃棄方式

    倉田 謙二, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 100 (394) 37-42 2000/10/27

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  149. TCPバージョン間の公平性の向上のためのREDの改善方式に関する検討

    倉田 謙二, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 100 (154) 13-18 2000/06/30

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  150. バージョン間の公平性を考慮したTCP Vegasの改善方式

    長谷川 剛, 倉田 謙二, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 100 (79) 1-6 2000/05/26

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  151. TCPによる高速データ転送のための通信処理軽減手法の提案と実装—特集テーマ マルチキャスト技術

    寺井 達彦, 松尾 孝広, 長谷川 剛

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 100 (69) 45-50 2000/05/19

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  152. スケーラビリティおよび公平性を考慮したTCPバッファ制御

    松尾 孝広, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 99 (674) 37-42 2000/03/09

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  153. TCP RenoとTCP Vegasの混在環境における公平性の評価

    倉田 謙二, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 99 (430) 67-72 1999/11/15

    Publisher: 東京 : 電子情報通信学会

    ISSN: 0913-5685

  154. Performance evaluation of packet scheduling algorithms and improvement of RED algorithm for fair service among connections

    HASEGAWA Go, Matsuo Takahiro, MURATA Masayuki, MIYAHARA Hideo

    Technical report of IEICE. SSE 98 (667) 13-18 1999/03/18

    Publisher: The Institute of Electronics, Information and Communication Engineers

    ISSN: 0913-5685

    More details Close

    In this paper, we investigate the performance of TCP under the packet scheduling algorithms of the router, in order to provide fair service among TCP connections sharing the network bandwidth. We consider the following four packet scheduling algorithms; FIFO, RED, and DRR, and DRR+. Based on the our previous results, we first propose derive the appropriate dropping probability of the RED algorithm according to each connection's input link capacity, in order to avoid the unfairness property of the original RED algorithm. We next evaluate the effects of Ill-behaved flow, which does not follow the congestion control algorithm of TCP in order to achieve higher throughput than the other connections.

  155. Performance evaluation of packet scheduling algorithms and improvement of RED algorithm for fair service among connections

    HASEGAWA Go, Matsuo Takahiro, MURATA Masayuki, MIYAHARA Hideo

    IEICE technical report. Information networks 98 (669) 13-18 1999/03/18

    Publisher: The Institute of Electronics, Information and Communication Engineers

    More details Close

    In this paper, we investigate the performance of TCP under the packet scheduling algorithms of the router, in order to provide fair service among TCP connections sharing the network bandwidth. We consider the following four packet scheduling algorithms; FIFO, RED, and DRR, and DRR+. Based on the our previous results, we first propose derive the appropriate dropping probability of the RED algorithm according to each connection's input link capacity, in order to avoid the unfairness property of the original RED algorithm. We next evaluate the effects of Ill-behaved flow, which does not follow the congestion control algorithm of TCP in order to achieve higher throughput than the other connections.

  156. Effects of different propagation delays on congestion control mechanisms of TCP

    HASEGAWA Go, MURATA Masayuki, MIYAHARA Hideo

    Technical report of IEICE. SSE 98 (83) 37-42 1998/05/28

    Publisher: The Institute of Electronics, Information and Communication Engineers

    ISSN: 0913-5685

    More details Close

    In this paper, we will analytically investigate the fairness of the congestion control mechanisms of TCP in the network where each connection has a different propagation delay. We will focus on TCP Tahoe and TCP Reno, which are the popular versions in the current Internet, and TCP Vegas, which is proposed to improve throughput, and enhanced TCP Vegas, which is proposed in our previous work. We will find the results that the window size becomes proportional to the inverse of the propagation delay in TCP Tahoe and TCP Reno, and proportional to the propagation delay in TCP Vegas and enhanced TCP Vegas.

  157. Performance Evaluation of HTTP/TCP on Asymmetric Networks

    HASEGAWA Go, MURATA Masayuki, MIYAHARA Hideo

    IEICE technical report. Information networks 97 (564) 81-88 1998/02/20

    Publisher: The Institute of Electronics, Information and Communication Engineers

    More details Close

    As the Internet users grows, new network services are emerging.Those includes ADSL and CATV Internet, which provide asymmetric bandwidth for uplink and downlink of user's connection.In this paper, we investigate the behavior of HTTP/TCP protocol on such asymmetric networks, and derive the analytic results of the transferring time of Web file by HTTP.In the analysis, we consider HTTP/1.1 and TCP Vegas, which are the new HTTP/TCP protocol, and show some results about the appropriate combination of HTTP and TCP protocols on the asymmetric network.

  158. Performance Evaluation of TCP on Asymmetric Networks

    HASEGAWA Go, MURATA Masayuki, MIYAHARA Hideo

    Technical report of IEICE. CQ 97 (457) 69-76 1997/12/19

    Publisher: The Institute of Electronics, Information and Communication Engineers

    More details Close

    As the Internet users grows, new network services are emerging. Those includes ADSL and CATV Internet, which provide asymmetric bandwidth for uplink and downlink of the user's connection. In this paper, we investigate the TCP behavior on such asymmetric networks, and derive the analytic results of the TCP performance. Through numerical examples, it is shown that as the asymmetry of the network becomes large, the performance of TCP is significantly degraded. We further present how the various network parameters affect the TCP performance, and show the designing policy of TCP on the asymmetric network.

  159. A study on flow control and error recovery mechanism of TCP

    HASEGAWA Go, MURATA Masayuki, MIYAHARA Hideo

    IEICE technical report. Information networks 97 (4) 1-6 1997/04/09

    Publisher: The Institute of Electronics, Information and Communication Engineers

    More details Close

    A recent development of an ATM network technology provides a large bandwidth, and ER(Explicit Rate) mode of the ATM ABR service can offer fixed-bandwidth. When we apply TCP, a most popular transport protocol in the current Internet, to such a service, we encounter several problems since TCP is essentially for the shared-bandwidth environment. In this paper, we focus on TCP's mis-retransmission, which is that TCP unnecessarily retransmits segments. We discuss a cause of such mis-retransmissions in depth and investigate how the performance is degraded. Then, a modification method of TCP is proposed and evaluated to show that performance degradation is avoided to the minimum by adding only fifteen lines in the source code of TCP sender.

  160. A study on flow control and error recovery mechanism of TCP

    HASEGAWA Go, MURATA Masayuki, MIYAHARA Hideo

    Technical report of IEICE. SSE 97 (2) 1-6 1997/04/09

    Publisher: The Institute of Electronics, Information and Communication Engineers

    ISSN: 0913-5685

    More details Close

    A recent development of an ATM network technology provides a large bandwidth, and ER(Explicit Rate) mode of the ATM ABR service can offer fixed-bandwidth. When we apply TCP, a most popular transport protocol in the current Internet, to such a service, we encounter several problems since TCP is essentially for the shared-bandwidth environment. In this paper, we focus on TCP's mis-retransmission, which is that TCP unnecessarily retransmits segments. We discuss a cause of such mis-retransmissions in depth and investigate how the performance is degraded. Then, a modification method of TCP is proposed and evaluated to show that performance degradation is avoided to the minimum by adding only fifteen lines in the source code of TCP sender.

  161. More results on Performance of TCP over ATM Networks

    HASEGAWA Go, OHSAKI Hiroyuki, MURATA Masayuki, MIYAHARA Hideo

    Technical report of IEICE. SSE 95 (576) 53-60 1996/03/14

    Publisher: The Institute of Electronics, Information and Communication Engineers

    ISSN: 0913-5685

    More details Close

    In this paper, the performance of TCP over ATM networks is evaluated using a simulation technique for the network where the multihop ATM switches are interconnected. In multihop networks, the unfairness among connections may become a problem due to the difference of the number of hops on the round trip times among connections. We first compare TCP over ABR, TCP over UBR with EPD (Early Packet Discard) and EPD per-VC accounting. The performance of TCP over ABR is degraded once the cell loss takes place. We then consider TCP over ABR with EPD and TCP over ABR with FEC (Forward Error Correction) for possible performance improvement. Last, the multimedia network environment is also considered by setting the model in which the VBR traffic co-exists in the network in addition to the ABR traffic.

  162. ATM網における TCP over ABR サービスの性能評価とパラメータ調整

    HASEGAWA Go, OHSAKI Hiroyuki, MURATA Masayuki, MIYAHARA Hideo

    Technical report of IEICE. SSE 95 (397) 7-12 1995/12/07

    Publisher: The Institute of Electronics, Information and Communication Engineers

    ISSN: 0913-5685

    More details Close

    ABRサービスクラスをTCPに適用する場合、2つのプロトコルレイヤで異なった輻輳制御を行うために、性能劣化を引き起こす可能性がある。それに対し、EPDの場合はこのような問題はおこらない。本稿では、シミュレーション技法を用いて、ATMネットワークにおけるTCPの性能を、スループットとコネクション間の公平性の面から検討する。まず、UBRサーピスクラスにEPDを適用したものと、ABRサービスクラスのレート可変型輻輳制御とを比較し、多くの場合はレート可変型輻輳制御の方がよい性能を持つことを示す。次に、TCP over ABRの性能が劣化する場合に、ABRのパラメータを調整することによって、性能劣化を防ぐことができることを示す。最後に、さらに性能を向上させるには、TCPを変更する必要があることを指摘する。 In this paper, we exhibit performance of TCP protocol over ATM networks by using a simulation technique. We first compare rate-based control of ABR service and EPD applied to UBR service, and show that rate-control achieves better fairness and higher throughput in most circumstances. However, rate-based control requires careful tuning of control parameters to obtain its effectiveness. Then we show the appropriate parameter set suitable to TCP on ABR service, and point out that some modification of TCP may be necessary for further performance improvement.

Show all ︎Show first 5

Presentations 227

  1. ネットワーク内輻輳制御アーキテクチャの大規模ネットワークを想定した性能評価

    長谷川 剛

    電子情報通信学会技術研究報告 2023

  2. A Study of Applying Model Predictive Control to Peak Shaving Using Energy Storage at Campus Buildings

    2018/03/01

  3. Invited Talk : Mobile core network architecture for accommodating IoT/M2M communications

    2017/11/16

  4. Invited Talk : Mobile core network architecture for accommodating IoT/M2M communications

    2017/11/16

  5. 仮想化技術に基づくモバイルアクセスネットワークの解析的性能評価 (ネットワークシステム)

    山崎 里奈, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 2017/07/19

  6. On the Strategy of Making Reliable Inter-Connected Network for Cooperative Service Networks (情報ネットワーク)

    荒川 伸一, 荻野 長生, 北原 武, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 2017/06/15

  7. On the Strategy of Making Reliable Inter-Connected Network for Cooperative Service Networks (スマートファシリティ研究会・スマートグリッド,スマートシティ/スマートコミュニティに関する技術動向)

    荒川 伸一, 荻野 長生, 北原 武, 長谷川 剛, 村田 正幸

    電気学会研究会資料. SMF = The papers of Technical Meeting on Smart Facilities, IEE Japan 2017/06/15

  8. A Study of Vulnerability of Campus-wide Information Communication Networks Considering Dependency on Power Distribution Networks

    2017/03/02

  9. ユーザとの対話に基づいたChatbot EMSの構築

    樽谷優弥, 長谷川剛, 松田和浩, 松岡茂登

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

  10. C/U分離を適用したモバイルコアネットワークにおける通信集約方式の性能評価 (ネットワークシステム)

    阿部 修也, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 2016/12/21

  11. A Study of Computing Resource Allocation Based on Model Predictive Control for Business-Critical Systems in Hybrid Cloud Environment

    2016/11/24

  12. Power Control for Smart Home Based on Solar Power Prediction Using Machine Learning

    2016/09/29

  13. ノード仮想化とプレーン分離を適用した広域モバイルコアネットワークの性能評価 (ネットワークシステム)

    長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 2016/04/21

  14. Analyzing Effect of Edge Computing on Reduction of Web Response Time

    2016/03/10

  15. 生化学反応モデルに着想を得た仮想ネットワーク機能の配置手法の提案と評価 (情報通信マネジメント)

    坂田 航樹, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 2016/03/10

  16. シグナリング処理負荷を考慮したノード仮想化及びプレーン分離を適用したモバイルコアネットワークの性能評価 (情報通信マネジメント)

    阿部 修也, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 2016/03/10

  17. GA-based task assignment and air conditioner setting for reducing data center power consumption

    2016/03/03

  18. Stability evaluation of chemical-inspired placement method of virtualized services

    2015/09/03

  19. Cost and Performance Evaluation of Hybrid Cloud Systems Based on Traffic Prediction

    2015/09/03

  20. B-6-58 Estimation Method for Onload Time of Web Pages

    Nakano Yuusuke, Kamiyama Noriaki, Shiomoto Kohei, Hasegawa Go, Murata Masayuki, Miyahara Hideo

    Proceedings of the Society Conference of IEICE 2015/08/25

  21. Invited Talk : Studies on cooperation of transport-layer protocols and power-saving mechanisms in wireless network devices

    2015/05/28

  22. Temperature prediction for energy optimization in data centers by machine learning approaches

    HASHIMOTO Kazuyuki, TARUTANI Yuya, HASEGAWA Go, MATSUDA Kazuhiro, TAMURA Takumi, NAKAMURA Yutaka, MATSUOKA Morito

    IEICE technical report 2015/03/02

    More details Close

    In this report, we propose a temperature prediction method for energy optimization in data centers by machine learning approaches. In the proposed method, we acquire operating data of data center such as air conditioners' setting, server powers, and values of temperature sensors. We then construct regression equations for estimating temperature distributions at several minutes future by machine learning approaches. We evaluate the proposed method by using collected data from actual operating data center in terms of precision and accuracy of the regression equations and calculation time required for learning and estimation. Evaluation results show that we can estimate the tempera- ture distribution at 10 minutes future after changing the operational parameters with 0.095 degree C of accuracy and 0.107 degree C of precision.

  23. Server model for predicting temperature distribution in data center with CFD simulation

    KITADA Kazumasa, TARUTANI Yuya, HASEGAWA Go, MATSUDA Kazuhiro, MATSUOKA Morito

    IEICE technical report 2015/03/02

    More details Close

    Computational Fluid Dynamics (CFD) simulation is one of the possible tools for temperature prediction in data center. The precision of server model in data center simulations by CFD has large influence on temperature prediction performance. In the conventional server model, an airflow rate inside a server is a constant parameter and its temporal changes cannot be simulated, although it actually fluctuates dependently on the intake air flow. In this report, we propose a novel server model for data center simulations with CFD, by which an airflow rate inside a server is determined according to the air intake amount. We evaluate the effectiveness of the proposed model by comparing simulation results with single-server experimental results. We also evaluate the simulation accuracy for data center temperature prediction with actual results of our testbed dataceter.

  24. Prediction of Temperature Distribution by Gaussian Process Dynamical Model for Green Data Centers

    SUGANUMA KOji, TARUTANI Yuya, HASEGAWA Go, NAKAMURA Yutaka, UKITA Norimichi, MATSUDA Kazuhiro, MATSUOKA Morito

    IEICE technical report 2015/03/02

    More details Close

    The prediction of temperature distribution is required for reducing the power consumption of the data center. In this paper, we propose a method to predict the temperature distribution in data center by machine learning with the past operation data of the data center. In the proposed method, we use Gaussian process dynamical model (GPDM), which the method applies Gaussian process for dynamical system, as a learning model for reflecting the nonlinearity and dynamics of operation data of the data center. In this paper, we evaluate the performance of proposed method by comparing the prediction of temperature distribution results with the actual data at our experimental data center. As a result, we show that the proposed method can predict temperature distribution within a range of 0.932 +/- 1.51 (root mean square error +/- 1 standard deviation) using Gaussian process dynamical model in this paper.

  25. Performance evaluation of GA-based task assignment method for reducing air conditioning power consumption at data centers

    DEGUCHI Takaaki, TARUTANI Yuya, HASEGAWA Go, NAKAMURA Yutaka, TAMURA Takumi, MATSUDA Kazuhiro, MATSUOKA Morito

    IEICE technical report 2015/03/02

    More details Close

    In this report, we propose a server task assignment method for leveling the distribution of server exhaust temperatures in a data center to reduce air conditioning power consumption. Our method determines the task assignment to servers based on a genetic algorithm. The proposed method is evaluated by experiments with Computational Fluid Dynamics (CFD) simulator. Evaluation results show that the proposed method decreases the deviation of server exhaust temperature by 37.4 % in average as compared with random task assignment.

  26. A network model for prediction of temperature distribution in data center

    TASHIRO Shinya, TARUTANI Yuya, HASEGAWA Go, NAKAMURA Yutaka, MATSUDA Kazuhiro, MATSUOKA Morito

    IEICE technical report 2015/03/02

    More details Close

    In this report, we propose a network model for real-time prediction of temperature distribution in data center required for energy-efficient task assignment and air conditioners' settings. In the proposed model, various physical relationships such as the movement of heat caused by air flow and the locations of server racks and servers. We determine the model parameters by machine learning with actual operation data of the data center. We evaluate the performance of the proposed model by comparing the temperature prediction results by the model with the actual data at our experimental data center. We present that the proposed model can predict 10 minute future temperature distribution of 60 places in 3.6 msec, with a root mean square error of 0.74 degree C.

  27. Experimental evaluation of scalability of cloud-based HEMS with WebSocket protocol

    ENKHEE Temuulen, TARUTANI Yuya, HASEGAWA Go, MATSUDA Kazuhiro, MURATA Shuichiro, MATSUOKA Morito

    IEICE technical report 2015/03/02

    More details Close

    We have proposed a method to provide Home Energy Management System (HEMS) as an ASP service with WebSocket protocol. We have also presented that, by mathematical analysis and small-scale experiment, we can decrease the network traffic and HEMS server load significantly by using WebSocket as a communication protocol. In this report, we show the experimental results of HEMS server performance when large number of client terminals connect to the HEMS server concurrently. The evaluation results show that the CPU utilization of HEMS server increases with complex tendency as the number of concurrent sessions increase. We also present that as the number of physical CPU cores increase, the increase degree of HEMS server capacity degrades slightly.

  28. Experimental evaluation of the scalability of MQTT protocol for simultaneous connections of a large number of clients in CEMS

    KITAGAWA Takahiro, TARUTANI Yuya, HASEGAWA Go, MATSUDA Kazuhiro, MURATA Shuuichirou, MATSUOKA Morito

    IEICE technical report 2015/03/02

    More details Close

    In Community Energy Management System (CEMS), communication control for tens of billions of sensors and actuators are required. Since they have small data size to be transmitted, the conventional protocols is not suitable because of their large protocol overhead. In this report, assuming that CEMS environment using MQTT as a communication protocol, we present experimental results on the scalability of MQTT to the number of concurrent sessions. We have obtained the results that MQTT broker can accept newly arriving connection requests even when the CPU utilization is almost 100%. We also found that the message processing time at MQTT broker increases monotonically with the increase in the number of concurrent sessions.

  29. An Analysis Study on the Impact of Network Topology on the Performance of TDMA-based Multihop Wireless Networks

    KOYAMA Kai, HASEGAWA Go, MATSUOKA Morito

    IEICE technical report 2015/03/02

    More details Close

    In TDMA-based multihop wireless networks, we need to assign time slots to links according to their traffic load, that is determined by traffic demands of client terminals as well as the network topology itself. Therefore, the network topology and the client terminal accommodation are key factors for network performance improvement. In this report, we first give the analytical evaluation results on the impact of the network topology including client terminal accommodation on the performance of TDMA-based multihop wireless networks. We also define a problem of network topology construction as a combinatorial optimization problem and propose a network topology construction method to obtain enough network performance by solving the problem with a heuristic algorithm. Evaluation results show that the packet transmission delay can be reduced by 20 % in average and the network capacity can be increased by up to 43 % when using the proposed method, as compared with the simple network topology.

  30. Construction method of service space in virtualized network system based on chemical-inspired spatial coordination model

    SAKURAI Shun, HASEGAWA Go, MURATA Masayuki

    IEICE technical report 2015/03/02

    More details Close

    In virtualized network system, multiple services are located on virtual and physical servers for constructing service space, and these servers provide the services according to user requests. For ensuring the scalability of the system, and for quick detection and recovery of system failures in such large-scale system, we need to construct the service space in an autonomous distributed fashion. In this report, we propose a construction method of service space based on chemical-inspired spatial coordination model. We model a server as a tuple space, and chemical substances in the tuple space as server resources, service demands and user requests. Chemical reactions are defined in the tuple space to describe various behaviors in the server. We confirm the behavior of the proposed method by simulation experiments. Furthermore, we present the application scenario of the proposed method to placing functions and determining packet flow routes in Network Function Virtualization (NFV) architecture to confirm the suitability of the proposed method for actual network services.

  31. B-5-101 A Study of VFDM Multi-Antenna Expansion Method for 5G Wireless Communication System

    HASEGAWA Tsuyoshi

    Proceedings of the IEICE General Conference 2015/02/24

  32. B-6-110 Acceleration Method for Web Performance by Caching Rendering Result

    Nakano Yuusuke, Kamiyama Noriaki, Shiomoto Kohei, Hasegawa Go, Murata Masayuki, Miyahara Hideo

    Proceedings of the IEICE General Conference 2015/02/24

  33. Virtualized mobile core network architecture for accommodating M2M traffic

    HASEGAWA Go, MURATA Masayuki

    IEICE technical report 2015/02/23

    More details Close

    In this report, we focus on the mobile core networks based on SDN architecture for accommodating M2M communication terminals, that separates data plane and control plane and utilizes cloud environment to accommodate one or both planes. We give a mathematical analysis results to reveal the performance characteristics of possible network architectures. The evaluation results confirm that we can increase the capacity of the mobile core network by up to 124% in terms of the number of accommodated M2M terminals, by appropriate plane separation and resource sharing in the cloud environment, and by combining communication aggregation method.

  34. Evaluation of Traffic Engineering Based on Model Predictive Control Using Traffic Trace in Actual Network

    MORIMOTO Akira, HASEGAWA Go, MURATA Masayuki

    IEICE technical report. Information and communication management 2014/11/18

    More details Close

    The available bandwidth on an end-to-end network path is an important performance metric for various network control. Existing methods for measuring available bandwidth can only the available bandwidth value of the path and it cannot acquire the information of bottleneck location on the path, or the detailed hop-by-hop available bandwidth distribution of the path. Our research group has proposed a novel measurement method of the available bandwidth for arbitrary parts of an end-to-end path. In this report, we show the evaluation results of the proposed method with an experimental network environment. We present that the proposed method can measure the available bandwidth with less than 3.6% error even when the receiver-side available bandwidth is twice larger than the sender-side available bandwidth on the end-to-end path.

  35. Performance analysis of aggregation method for machine type communications in mobile core networks

    HASEGAWA Go, MURATA Masayuki

    IEICE technical report. MoNA, Mobile network and applications 2014/07/29

    More details Close

    In this report, we focus on the aggregation method for the M2M communications in the mobile core networks to decrease the control plane overhead in the network. We give the mathematical analysis for the bearer establishment latency for each M2M terminal to begin the data transmission. The objective of the analysis is to reveal the effect of the aggregation method on additional load on the mobile core network and the communication performance of M2M terminals. Through numerical results we present that we can decrease the load of the mobile core networks by the aggregation method and reduce the bearer establishment latency. Especially, when we assume enough processing performance for MME, we can increase the capacity of the mobile core network by around six times in terms of the number of accommodated M2M terminals.

  36. Analysis of Locality Tendency of Web Traffic

    KAMIYAMA Noriaki, NAKANO Yusuke, SHIOMOTO Kohei, HASEGAWA Go, MURATA Masayuki, MIYAHARA Hideo

    IEICE technical report 2014/04/17

    More details Close

    Modern web-browsing services contain a number of rich objects, which are dynamically produced by servers and client PCs at diverse locations. Consequently, we face complications in understanding the communication structure of traffic generated when accessing websites. To improve the response time and suppress the amount of traffic transferred in networks, we need to adequately control caches, i.e., the placement and replacement of objects, based on the communication structure of web traffic. In this paper, we measure the communication structure of traffic generated when accessing about 1,000 most popular websites from 12 locations in the world using the PlanetLab. We investigate the locality tendencies of various metrics, e.g., server distance, delay, and object count, and we apply the cluster analysis to web sites based on the locality tendencies for various metrics in each object type and URL category. As a result, we find an insight to effectively improve the user response time through the cache control methods based on the locality tendencies of web sites.

  37. Improving estimation accuracy of packet loss ratio on overlay networks based on spatial composition

    IIJIMA Yusuke, HASEGAWA Go, MURATA Masayuki

    IEICE technical report. Information and communication management 2014/03/13

    More details Close

    Although most of existing measurement mechanisms for overlay networks employ the full-mesh measurement, the increase in the measurement overhead and the degradation of the measurement accuracy due to path overlapping become a serious problem. In this report, we propose statistical processing methods of measurement results to improve estimation accuracy of spatial composition-based measurement method for packet loss ratio. We introduce a statistical test for measurement results to exclude outliers from spatial composition. We also propose some statistical indexes for determining whether we should discard the measurement results and reconduct the measurement. From the evaluation results we find that the proposed methods can decrease the estimation error of the spatial composition of packet loss ratio by 36% and 23%, respectively.

  38. Robust virtual machine deployment method for datacenter inspired by degeneracy in biological networks

    SOE Ryota, HASEGAWA Go, MURATA Masayuki

    IEICE technical report. Information and communication management 2014/03/06

    More details Close

    In this report, we propose a virtual machine deployment method for datacenter inspired by degeneracy found in biological networks. The main idea is to exploit the concept of networked buffering observed in biological networks, providing many-to-many redundancy with small amount of additional resources, unlike the one-to-one or one-to-many redundancy. We evaluate the fundamental characteristics of the proposed method by computer simulation, and show that the proposed virtual machine deployment method can largely improve the recovery performance from large-scale failures and reduce additional resources compared with existing methods.

  39. Performance Evaluation of HEMS over ASP service utilizing Websocket Protocol

    TONG Qiling, HASEGAWA Go, MURATA Masayuki, MATSUOKA Morito

    IEICE technical report 2014/03/06

    More details Close

    In our previous research, we realize a Home Energy Management System (HEMS) as an ASP service with the Websocket protocol, which can provide Web-based bidirectional communication channels. We showed that the proposed architecture can reduce the server load and the network traffic significantly. However, the performance evaluation has been conducted by only simple mathematical analysis. In this report, we designed the cloud-based HEMS assuming energy control from HEMS server to Air conditioners and LED lightings in households, and evaluated its performance by implementation experiments. We found that the memory usages of the HEMS server increase in nearly proportion to the number of households. On the other hand, CPU utilization and end-to-end message delay fluctuate unpredictably according to the number of CPU cores. We concluded that the usage of multi-core processor largely affects the performance of HEMS server.

  40. エンド端末間パスにおける複数区間の利用可能帯域計測手法の実験評価—Experimental Evaluation of Available Bandwidth Measurement Method for Arbitrary Parts of End-to-End Path—情報通信マネジメント

    森本 顕, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 2014/03

  41. Counting Pedestrians using binary sensor array

    Shuto Fujii, Yoshiaki Taniguchi, Go Hasegawa, Morito Matsuoka

    IEICE Technical Report 2014/03

  42. An evaluation of the impact of task allocation on power consumption in data centers

    Koji Suganuma, Takaaki Deguchi, Yoshiaki Taniguchi, Go Hasegawa, Yutaka Nakamura, Norimichi Ukita, Kazuhiro Matsuda, Morito Matsuoka

    IEICE Technical Report 2014/03

  43. Performance evaluation of task assignment method for reducing air conditioning power consumption at data centers

    Takaaki Deguchi, Yoshiaki Taniguchi, Go Hasegawa, Yutaka Nakamura, Norimichi Ukita, Kazuhiro Matsuda, Morito Matsuoka

    IEICE Technical Report 2014/03

  44. Performance study of IEEE 802.16j relay networks by multiple regression analysis

    Kohei Higo, Go Hasegawa, Yoshiaki Taniguchi, Hirotaka Nakano, Morito Matsuoka

    IEICE Technical Report 2014/03

  45. Comparative evaluation of heuristic algorithms of time slot assignment for IEEE 802.16j relay networks

    Shoichi Takagi, Go Hasegawa, Yoshiaki Taniguchi, Hirotaka Nakano, Morito Matsuoka

    IEICE Technical Report 2014/03

  46. Extension of a Back-off Feature for Temporal Load Balancing in Mobile Core Networks

    IWAI Takanori, HASEGAWA Go, WAKAMIYA Naoki

    IEICE technical report. MoNA, Mobile network and applications 2014/01/23

    More details Close

    Machine-to-Machine (M2M) communication has been paid much attention as a new communication paradigm to increasing mobile network traffic. Since M2M communication terminals send data periodically, access requests on mobile core networks are concentrated at a specific timing. Considering the fact that most of such M2M terminals would accept a certain amount of delay in their cyclic communication, we propose a scheduling method of communication timing to mitigate traffic concentration. By extending the back-off mechanism, our method balances the access load on mobile core networks while satisfying requirements on communication delay.

  47. Energy efficient information dissemination scheme based on the received signal strength in wireless sensor networks

    HISAMATSU Hiroyuki, HASEGAWA Go, MURATA Masayuki

    IEICE technical report. Information networks 2013/11/21

    More details Close

    In this report, we propose an information dissemination scheme to facilitate electric power consumption for wireless sensor networks. Our new dissemination scheme is based on the flooding and uses the receiver signal strength for determining the broadcast timing. We evaluated our proposed scheme by simulations. We used a network model where sensor nodes are arranged on the square lattices. As a result, it is shown that our proposed scheme improves the information delivery ratio by increasing the power consumption slightly in the network. Furthermore, we ran simulations using a network model where sensor nodes are randomly located and showed that the proposed scheme had the same characteristics as simulation results using the network model, where sensor nodes are arranged on the square lattices.

  48. An Available Bandwidth Measurement Method for Arbitrary Parts of End-to-End Path

    KOITANI Kazumasa, HASEGAWA Go, MURATA Masayuki

    IEICE technical report 2013/11/14

    More details Close

    Existing techniques for measuring available bandwidth measure the available bandwidth at bottlenecks along the path, and most of them do not specify the bottleneck location. In this report, we propose an end-to-end measurement method for the hop-by-hop available bandwidth along a network path. Such a technique can facilitate advanced traffic control, especially in heterogeneous network environments. The proposed method assumes a situation where intermediate routers can record the arrival and departure times of incoming packets as timestamps in the packets themselves. The endhost sends probe packets at various rates and estimates the available bandwidth at each network section using the incoming and outgoing rates of packets calculated from intermediate timestamps, based on statistical processing under a fluid traffic model. We present extensive simulation results for the proposed method and confirm that it can accurately measure the available bandwidth of each section along the network path even when the available bandwidth of the sender-side network is smaller than that of the receiver-side network.

  49. A GPU Offloading method for improving performance of checksum computation in the TCP/IP stack

    Yuuki Tsubouchi, Go Hasegawa, Yoshiaki Taniguchi, Hirotaka Nakano, Morito Matsuoka

    IEICE Technical Report 2013/10

  50. A distributed method for measuring available bandwidth in overlay networks exploiting path overlap

    TIEN HOANG Dinh, HASEGAWA Go, MURATA Masayuki

    IEICE technical report 2013/09/12

    More details Close

    The estimation of available bandwidth is crucial for many overlay network applications. However, measuring available bandwidth requires a large amount of probe traffic. Furthermore, the measurement conflict of route-overlapping paths can cause serious degradation of measurement accuracy and non-negligible increase in the network load. In this report, we propose a distributed method for measuring available bandwidth in overlay networks that can reduce measurement conflict while maintaining high measurement accuracy with low cost. The main idea is that neighboring overlay nodes exchange the route information to detect overlapping paths, and share measurement results of overlapping paths to configure parameter settings for available bandwidth measurement. Simulation results show that the relative errors in the measurement results of our method are approximately only 65% of those of the existing method.

  51. Experimental Evaluation of Energy-Efficient TCP Data Transfer over a Wireless LAN

    HASHIMOTO Masafumi, HASEGAWA Go, MURATA Masayuki

    Technical report of IEICE. CQ 2013/09/12

    More details Close

    Energy efficiency of a wireless client is one of the important issues in wireless communications. We have proposed an energy-efficient method for TCP data transfer over a wireless LAN (WLAN) environment. The proposed method is termed SCTP tunneling, and aggregates multiple TCP flows into a single SCTP association between a wireless client and access point to control packet transmission and reception timings. Furthermore, SCTP tunneling lengthens sleep duration by transmitting and receiving multiple packets in a bursty fashion. In this report, we assess energy efficiency and data transfer time of SCTP tunneling through experiments in a WLAN test-bed in which prototype of SCTP tunneling is implemented. From the experimental evaluations, we show that, compared with U-APSD, SCTP tunneling can reduce energy consumption while keeping the increase in data transfer time.

  52. Monte Carlo-based bi-directional pedestrian counting method for compound-eye sensor systems composed of multiple binary sensors

    Shuto Fujii, Yoshiaki Taniguchi, Go Hasegawa, Hirotaka Nakano, Morito Matsuoka

    IEICE Technical Report 2013/07

  53. Pedestrian counting based on the number of salient points considering effect of occlusions in video sequences

    Kazuyuki Hashimoto, Yoshiaki Taniguchi, Go Hasegawa, Hirotaka Nakano

    Proceedings of Media Computing Conference 2013 2013/06

  54. Performance evaluation of tunnel aggregation method for reducing control plane cost in mobile core networks

    SAKURAI Shun, HASEGAWA Go, WAKAMIYA Naoki, IWAI Takanori

    IEICE technical report. MoNA, Mobile network and applications 2013/05/23

    More details Close

    Machine-to-Machine (M2M) communication has been paid much attention as a new communication paradigm to increasing wireless network traffic. When considering M2M devices are accommodated to mobile cellular networks, since the Average Revenue Per User (ARPU) for M2M devices is quite smaller than traditional cellular phones, the cost for accommodating M2M devices to the mobile cellular networks cannot be ignored for mobile network carriers. In this report, we apply a tunnel aggregation method to suppress the cost for accommodating M2M devices in the mobile cellular networks. The proposed method decreases the number of tunnels in mobile network system without compromising communication performances of terminals. We evaluate the performance of this method by mathematical analysis and show the basic characteristics. We also estimate the monetary cost for realizing the proposed method and reveal that it can reduce the cost by up to 80% compared with the traditional mobile core networks, while keeping the call blocking rate less than 0.1%.

  55. Performance evaluation of tunnel aggregation method for reducing control plane cost in mobile core networks

    2013/05/16

  56. Performance evaluation of tunnel aggregation method for reducing control plane cost in mobile core networks

    2013/05/16

  57. End-to-end bandwidth measurement method considering effects on power-saving routers

    KOBAYASHI Daisuke, HASEGAWA Go, MURATA Masayuki

    IEICE technical report 2013/05/16

    More details Close

    In environment when power-saving routers and switches exist in an end-to-end path, since the amount of bandwidth-related resources of an end-to-end network path changes over time, the accuracy of existing end-to-end measurement methods of available bandwidth may degrade. Furthermore, the energy efficiency of power-saving routers also decreases due to additional traffic load by bandwidth probing. In this report, we propose a method for measuring physical capacity and available bandwidth simultaneously for the situation in which power-saving routers exist on the end-to-end path. By showing simulation results, we show that the proposed method can measure available bandwidth with high accuracy, while maintaining the energy efficiency of power-saving routers.

  58. 生物ネットワークの縮退特性に基づくシステム冗長化方式における自律的障害回復手法—Autonomous failure recovery scheme for redundancy configuration method inspired by degeneracy in biological networks

    長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 2013/04

  59. Cooperative cache sharing among ISPs for reducing inter-ISP transit cost in content-centric networking

    MATSUDA Kazuhito, HASEGAWA Go, MURATA Masayuki

    IEICE technical report 2013/03/07

    More details Close

    Content-Centric Networking (CCN)has an in-network caching mechanism, which can suppress traffic volume along the route to the destination host. This traffic volume reduction can also decrease inter-ISP transit cost. However, the memory spaces for caching at CCN routers are relatively small for the amount of contents. In addition, any initial access to a content requested by users must use the transit link, even when nearby CCN routers outside the route has the cached content. In this report, we propose a method of cooperative cache sharing among CCN routers in multiple ISPs. It aims to lead the further reduction in the inter-ISP transit cost by improving the cache hit ratio. In the proposed method, the CCN routers share the memory space for caching and cache contents without overlapping. We evaluate the proposed method by simulation experiments using the actual ISPs' IP-level network topologies, and show that the inter-ISP transit traffic can reduce by up to 28%compared to the normal caching behavior of the CCN.

  60. Robust redundant configuration method of information network systems inspired by degeneracy in biological networks

    OKAZAKI Takuro, HASEGAWA Go, MURATA Masayuki

    IEICE technical report 2013/03/07

    More details Close

    In this report, we propose a design method of information network systems, inspired by degeneracy and redundancy found in biological networks. It achieves high-level robustness against large-scale failures. The main idea is to realize a novel redundant configration inspired by networked buffering characteristics in gene network, providing many-to-many backup with small amount of additional resources, unlike the one-to-one or one-to-many backup in the traditional redundant systems. We evaluate the fundamental characteristics of the proposed method by computer simulations, and show that the proposed system can largely improve the recovery performance from large-scale failures compared with existing methods.

  61. Virtual Network Assignment Considering Performance and Fault Tolerance in a Multi-tenant Data Center

    OGAWA Yukio, HASEGAWA Go, MURATA Masayuki

    IEICE technical report. Information networks 2013/03/07

    More details Close

    In a multi-tenant data center, a proper assignment of tenants' virtual overlay networks on the physical underlay network is indispensable for sharing total bandwidth of the physical network effectively and tolerating net- work failures. In this report, for increasing performance and availability of the virtual networks, we first formulate the problem that deals with the effective bandwidth of a virtual network, which is defined by the difference between available bandwidth allocated to the virtual network and loss of the bandwidth when the failure of an element oc- curs in the physical network. Then, we provide procedures to recover from the failure, and propose a model for the virtual network's recovery time from the failure in the physical network. In the proposed model, the recovery time depends on the degree of concentration of the virtual network elements on the physical network elements. Finally, using computer simulations, we confirm that when we assign the virtual networks so as to maximize the sum of their effective bandwidth, the virtual networks can fully utilize the physical bandwidth, while the total downtime is reduced to one-third as compared to the assignment for maximizing the sum of available bandwidth of the virtual networks.

  62. Balancing algorithm of time slot assignment accommodating traffic load in IEEE 802.16j relay networks

    Tomoya Kitayama, Go Hasegawa, Yoshiaki Taniguchi, Hirotaka Nakano

    IEICE Technical Report 2013/03

  63. Effect of interference estimation methods on performance of IEEE 802.16j relay networks

    Ryosuke Mine, Go Hasegawa, Yoshiaki Taniguchi, Hirotaka Nakano

    IEICE Technical Report 2013/03

  64. An interdomain overlay network based on ISP alliance

    Xun Shao, Go Hasegawa, Yoshiaki Taniguchi, Hirotaka Nakano

    IEICE Technical Report 2013/03

  65. Multiple Regression Analysis of Explanatory Variables for Pedestrian Counting in Video Sequences

    2013/02/28

  66. Development of a demonstration system for User and Resource Management Technologies towards Pareto-optimal Wired-wireless Networks

    YAMORI Kyoko, OHTA Chikara, HASEGAWA Go, SHINKUMA Ryoichi, OGUCHI Masato, MURASE Tutomu

    Technical report of IEICE. CQ 2013/01/25

    More details Close

    In New Generation Networks, it is necessary to utilize network resources efficiently while avoiding selfish/greedy usages that result in unbalanced and poor resource utilization. Further, it is necessary to develop some mechanisms that appropriately organize and control network resource in order to satisfy various user requirements for power-saving, throughput, link speed, connectivity, and mobility. In this paper, the concept of PONET (Pareto Optimal NETwork) and the demonstration system are introduced.

  67. Study on HEMS over Cloud System utilizing Realtime Web Technologies

    MASUO Tsuyoshi, NAKAMURA Jiro, MATSUOKA Morito, HASEGAWA Go, MURATA Masayuki, MATSUDA Kazuhiro

    IEICE technical report 2012/12/13

    More details Close

    Home Energy Management System (HEMS) is paid much attraction as one of power-saving technologies for home appliances. In Japan, ECHONET and ECHONET Lite are possible candidates as HEMS protocol. Although the current HEMS is implemented as a closed system within Home Area Network (HAN), increased cost becomes a serious problem in large-scale deployment of HEMS. Therefore, in this report, we propose a method to apply ASP service for implementing HEMS at a low cost. We show the overall architecture, performance evaluation of protocol implementations for interactive Web service, and prototype implementation of the proposed system.

  68. モバイルコアネットワークにおけるトンネル集約方式—A tunnel aggregation method for a mobile core networks

    岩井 孝法, 長谷川 剛, 若宮 直紀

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 2012/12

  69. User and Resource Management Technologies towards Pareto-optimal Wired-wireless Networks

    OHTA Chikara, HASEGAWA Go, SHINKUMA Ryoichi, YAMORI Kyoko, OGUCHI Masato, MURASE Tutomu

    IEICE technical report. Information networks 2012/10/03

    More details Close

    We have proposed a network architecture concept named C3E2 (Cognition, Coordination and Cooperation for Economically Efficient resource-usage) for "Pareto-optimal networks" which we regard as a modality of future networks such as New Generation Networks. Advances of network usage will bring not only broad characteristics of traffic patterns, applications, and networks but also various user utilities and network utilities. In order to achieve Pareto optimality, it is necessary to utilize network resources efficiently while avoiding selfish and greedy usages that result in unbalanced and poor resource utilization. Further, it is necessary to develop some mechanisms that appropriately organize and control network resource in order to satisfy various user requirements for power saving, throughput, link speed, connectivity, and mobility. In this literature, the C3E2 concept and some approaches of network control based on the concept are discussed.

  70. A Route Control Method in Software Defined Access Networks

    IMANAKA Norihiro, NAKAMURA Nobuyuki, NAKAHIRA Yoshihiro, KASHIMA Masayuki, ATA Shingo, HASEGAWA Go

    IEICE technical report. Information networks 2012/10/03

    More details Close

    Due to the wide use and spread of network communications, importance of provide appropriate qualities for network service, for incetance, to each user or each service has become greater. We are trying to provide these qualities in access networks because facilities could be introduced easily in access networks compared to core and metro networks. On the contrary, recentry Software Defined Network (SDN) came to be actively conducted research region. Especially OpenFlow has attracted considerable attention as it enables flexible network control through dealing with traffic in each flow. Hence it can be suitable for providing qualities on the goals of us. Therefore in the first pahase we propose a route control method in cases where OpenFlow is utilizable in multihomed access networks. In addition we offer its evaluation results in OpenFlow multihomed networks established across the Internet.

  71. Time slot adding assignment in IEEE 802.16j wireless relay networks

    Tomoya Kitayama, Go Hasegawa, Yoshiaki Taniguchi, Hirotaka Nakano

    IEICE Technical Report 2012/10

  72. Time slot assignment algorithm for IEEE 802.16j relay networks considering wireless link transmission quality

    Shoichi Takagi, Go Hasegawa, Yoshiaki Taniguchi, Hirotaka Nakano

    IEICE Technical Report 2012/10

    More details Close

    In IEEE 802.16j relay networks, wireless communication is carried out based on Time Division Multiple Access. By using the adaptive modulation and coding, each link in the network can obtain the data rate according to the Signal to Interference Noise Ratio (SINR). When a few links utilize a certain time slot, the data rate becomes large because of less radio interference. But, it means that the degree of spatial reuse of the network resources is low, increasing the frame size. Therefore, it is necessary to assign time slots so that the traffic demand of each link is satisfied, as well as achieving small frame length. In this report, we propose new time slot assignment methods for IEEE 802.16j relay networks. One method is to assign time slots to each link in the predetermined order of links, and the another is to determine the group of links to utilize each time slot. As a result of the evaluation by simulation experiments, we show that the latter method is more effective to reduce the frame length.

  73. Performance evaluation of time slot assignment algorithms with various radio interference models in IEEE 802.16j relay networks

    Ryosuke Mine, Go Hasegawa, Yoshiaki Taniguchi, Hirotaka Nakano

    IEICE Technical Report 2012/09

    More details Close

    Time slot assignment algorithms in IEEE 802.16j multi-hop relay networks often assume simple radio interference models based on the distance or the number of hops between nodes due to their simpleness. However, by using more detailed models that consider the signal to interference plus noise ratio and its temporal fluctuation, we can obtain more effective time slot assignment. In addition, when we use the adaptive modulation and coding (AMC),we can expect stable and eMcient network performance according to the transmission quality. In this report, we evaluate the performance of the time slot assignment algorithms in IEEE 802.16j multi-hop relay networks with line of sight and Rayleigh fading environments so that we clarify the impact of the radio interference models on the network performance. Through performance evaluations, we confirm that by carefully choosing parameters of simple interference models, we can obtain almost the same network performance as those with detailed models.

  74. B-6-11 Home Energy Management System utilizing Web of Things (1)

    Masuo Tsuyoshi, Nakamura Jiro, Matsuoka Morito, Hasegawa Go, Murata Masayuki, Matsuda Kazuhiro

    Proceedings of the Society Conference of IEICE 2012/08/28

  75. BS-4-3 Study on Exploiting SCTP to Save Energy of TCP Data Transfer over a Wireless LAN

    Hashimoto Masafumi, Hasegawa Go, Murata Masayuki

    Proceedings of the Society Conference of IEICE 2012/08/28

  76. A distributed and conflict-aware measurement method using local information exchange in overlay networks

    HOANG Dinh Tien, HASEGAWA Go, MURATA Masayuki

    IEICE technical report. Information networks 2012/07/12

    More details Close

    Network resource information, including available bandwidth, propagation delay and packet loss ratio, should be obtained by measurements for maintaining effectiveness of overlay network services. Although measurement accuracy can be enhanced by frequent measurements, performing measurements with high frequency can cause measurement conflict problem, that increases the network load and degrades measurement accuracy. In this report, we propose a distributed and conflict-aware measurement method which can reduce measurement conflicts and obtain high measurement accuracy. The main idea is that overlay nodes exchanges the route information and measurement results only with neighboring overlay nodes, while decreasing the measurement frequency. Simulation results show that the relative error of measurement results of our method is less than half of that of an existing method when the total measurement overhead of both methods are equal. We also confirm that exchanging of measurement results contributes more to the enhancement of measurement accuracy than performing measurements.

  77. A dynamic application-level routing method reacting traffic changes based on distributed heuristic algorithm

    MATSUDA Kazuhito, HASEGAWA Go, MURATA Masayuki

    IEICE technical report. Information networks 2012/07/12

    More details Close

    Application-level traffic routing that chooses an end-to-end traffic route relaying other end-hosts can improve user-perceived performance. However, selfish route selection performed by each end user can lead to the decrease in the path performance due to overload by route overlaps. It also causes the increase in the inter-ISP transit cost as a result of utilizing more transit links than in the case of native IP routing. To deal these problems, we formulated the application-level route selection as the optimization problem and proposed the method based on distributed simulated annealing to obtain near-optimal solutions to the problem. In this report, we extend the proposed method to react the network traffic changes. We evaluate the proposed method in such an environment and the proposed method can reduce the overloaded routes by 70% compared a method without a coordinated manner. We also discuss some application-scenarios of the proposed method.

  78. A study on information network design inspired by degeneracy and redundancy in biological networks

    HASEGAWA Go, MURATA Masayuki

    Technical report of IEICE. CQ 2012/07/05

    More details Close

    In this report, we propose a design method of information network systems, inspired by degeneracy and redundancy found in biological networks. It achieves high-level robustness, fast recovery from large-scale failures, and sustainable network growth without degrading the system performance. The main idea is to realize a novel redundant system called as networked buffering, providing many-to-many backup with small amount of additional resources, unlike the one-to-one or one-to-many backup in the traditional redundant systems. We evaluate the fundamental characteristics of the proposed method by computer simulations, and show that the proposed system can largely improve the recovery performance from large-scale failures compared with existing methods.

  79. 複眼センサシステムのためのモンテカルロ法に基づく歩行者数推定手法の提案と評価—Monte Carlo-based bi-directional pedestrian counting with compound-eye binary sensors—言語理解とコミュニケーション

    藤井 崇渡, 谷口 義明, 長谷川 剛

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 2012/06/29

  80. Proposal of SCTP Tunneling for Energy-Efficient TCP Data Transfer over a Wireless LAN Environment

    HASHIMOTO Masafumi, HASEGAWA Go, MURATA Masayuki

    IEICE technical report. Information networks 2012/06/14

    More details Close

    The energy efficiency of a wireless client is an important issue on wireless network environments. When multiple TCP flows are established from a wireless client, it is difficult for a wireless network interface of the wireless client to understand and control the timings for sleeping. In addition, the frequent state transitions between active and sleep modes consume energy, resulting in the reduction of energy efficiency. In this report, we propose an energy-efficient method for multiple TCP flows in wireless LAN environments. The proposed method is called as SCTP tunneling, that aggregates multiple TCP flows to a single SCTP association between a wireless client and an access point to control the timings of packet transmission and reception. Furthermore, it lengthens sleep time by transmitting and receiving multiple packets in a bursty fashion. We construct a mathematical model for an energy consumption model of SCTP tunneling to assess its energy efficiency. Through numerical examples, we show the proposed method can reduce up to around 70 % energy consumption.

  81. Modeling the Interaction of Overlay Routing and Multihoming ISP with Game Theory

    2012/05/03

  82. Modeling the Interaction of Overlay Routing and Multihoming ISP with Game Theory

    2012/05/03

  83. Modeling the interaction of overlay routing and multihoming ISP with game theory

    Xun Shao, Go Hasegawa, Yoshiaki Taniguchi, Hirotaka Nakano

    IEICE Technical Report 2012/05

  84. A data gathering mechanism using phase-locking and anti-phase synchronization for wireless sensor networks

    Yoshiaki Taniguchi, Go Hasegawa, Hirotaka Nakano

    IEICE Technical Report 2012/05

  85. BT-4-5 Network Management and Control Technologies for Pareto Optimal Network

    Yamori Kyoko, Ohta Chikara, Shinkuma Ryoichi, Hasegawa Go, Murase Tutomu, Oguchi Masato

    Proceedings of the IEICE General Conference 2012/03/06

  86. Node repositioning method based on distance between nodes in IEEE 802.16j relay networks

    Takafumi Shigefuji, Go Hasegawa, Yoshiaki Taniguchi, Hirotaka Nakano

    IEICE Technical Report 2012/03

    More details Close

    IEEE 802.16j-based wireless multihop relay networks, the locations of relay nodes and the network topology are important factors in achieving high performance. In particular, radio wave interference must be considered when determining node locations. However, nodes are generally deployed in limited areas and it is difficult to move them to arbitrary positions. In this report, we propose a node repositioning method that works within such constraints to improve network performance. Since the computational cost is high for assessing all possible node positions, the proposed method limits the number of candidate nodes to be repositioned on the basis of distance information. We examine the effectiveness of the proposed method through simulation experiments and show that a performance improvement of up to 28% is realized by repositioning 30% of nodes and that nearly optimal results can be obtained, but at lower computational cost than an exhaustive search.

  87. Performance estimation based on multiple regression analysis for IEEE 802.16j networks with obstacles

    Yuuki Ise, Go Hasegawa, Yoshiaki Taniguchi, Hirotaka Nakano

    IEICE Technical Report 2012/03

    More details Close

    In IEEE 802.16j networks, obstacles largely affect the connectivity between nodes and radio wave interference among wireless links. In our previous work, we evaluated the performance of IEEE 802. 6j networks considering radio wave obstruction with the protocol model, which is one of major radio interference models. When constructing IEEE 802.16j-based network, the accurate estimation of network performance before the network is actually constructed is highly valuable. In this report, we propose a method for estimating the performance of IEEE 802.16j networks with obstacles. For the performance estimation, we construct regression equations through the regression analysis of numerical results of simulation experiments. By evaluating the accuracy of the performed analysis based on real-world environment, we confirmed that the relative error in the service ratio is less than 0.1 for 90% of simulation experiments.

  88. Advanced Memory Controller for Low Power Router Architecture

    KURODA Yasuto, IWAMOTO Hisashi, YANO Yuji, OTANI Shiro, OKUDA Kenzo, ATA Shingo, INOUE Kazunari, HASEGAWA Go, MURATA Masayuki

    IEICE technical report 2012/03/01

    More details Close

    The complete network service of infrastructure is an urgent issue by means of continuous growth in network traffic. Apparently, the energy consumption of network routers may arise one of global environmental affairs, and therefore Research and Development works regarding power reduction is well desired. Our group proposes a unique feature embedded onto routers, which consists of plurality of slice that equipped with power control. In this paper, we have examined slice control, and have shown the validity of memory controller.

  89. Panel Discussion : Management and Control of User and Resource toward Pareto-optimal Wireless and Wired Networks

    Ohta Chikara, Hasegawa Go, Shinkuma Ryoichi, Yamori Kyoko, Oguchi Masato, Murase Tutomu, Sarkar Dilip, Raychaudhuri Dipankar

    IEICE technical report 2012/01/26

    More details Close

    We have proposed a network architecture concept named C3E2 (Cognition, Coordination and Cooperation for Economically Efficient resource-usage) for "Pareto-optimal networks" which we regard as a modality of future networks such as New Generation Networks. Advances of network usage will bring not only broad characteristics of traffic patterns, applications, and networks but also various user utilities and network utilities. In order to achieve Pareto optimality, it is necessary to utilize network resources efficiently while avoiding selfish/greedy usages that result in unbalanced and poor resource utilization. Further, it is necessary to develop some mechanisms that appropriately organize and control network resource in order to satisfy various user requirements for power-saving, throughput, link speed, connectivity, and mobility. In this literature, the C3E2 concept and some approaches of network control based on the concept are discussed.

  90. Research histories and trends on transport-layer protocols in the Internet

    HASEGAWA Go

    Technical report of IEICE. PRMU 2012/01/12

    More details Close

    Transmission Control Protocol (TCP) is the most important transport-layer protocols in the current Internet. Its performance, especially the performance of congestion control mechanisms, plays an important role since most of current Internet applications, including Web, P2P file sharing, VoD streaming services, utilize TCP. In this report, we first summarize congestion control mechanisms of TCP, and present recent researches on its problems. We also introduce our latest research topic on energy-efficient TCP, which tries to decrease power consumption of data transmission over Wireless LAN by modifying TCP's data transmission behaviors.

  91. Performance evaluation of IEEE 802.16j relay networks considering radio wave blocking by obstacles

    Yuuki Ise, Go Hasegawa, Yoshiaki Taniguchi, Hirotaka Nakano

    Proceedings of the 9th IEICE QoS Workshop 2011/11

  92. Evaluation of end-to-end bandwidth measurement method with power-saving routers

    KOBAYASHI Daisuke, HASEGAWA Go, MURATA Masayuki

    IEICE technical report 2011/10/06

    More details Close

    In recent years, the increase of energy consumption associated with network traffic explosion is becoming a major problem. For energy-efficient networking, some researchers focus on the technologies of dynamically changing router's processing performance and link bandwidth according to the network traffic load. However, if such power-saving routers exists on an end-to-end network path, the accuracy of existing measurement methods of end-to-end available bandwidth may degrade because of fluctuations of bandwidth and delay at a bottleneck link. Furthermore, the energy efficiency of power-saving routers also decreases due to additional traffic load by bandwidth probing. In this report, we evaluate the performance of Pathload, one of the popular end-to-end available bandwidth measurement methods, in the environment with power-saving routers. We also show the parameter settings of Pathload for not affecting the behavior of power-saving routers, while keeping the measurement accuracy.

  93. 特別講演 パレート最適ネットワーク制御技術の実現にむけて--無線・有線コグニティブ環境におけるユーザを主体としたネットワーク制御—Network control for Pareto optimality in future internet: user-centric wired-wireless cognitive technology—モバイルマルチメディア通信

    村瀬 勉, 新熊 亮一, 長谷川 剛

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 2011/09

  94. Network Control for Pareto Optimality in Future Internet : User-Centric Wired-Wireless Cognitive Technology

    MURASE Tutomu, SHINKUMA Ryoichi, HASEGAWA Go, YAMORI Kyoko, OGUCHI Masato, OHTA Chikara, SARKAR Dilip, RAYCHAUDHURI Dipankar

    IEICE technical report 2011/09/01

    More details Close

    We have proposed a concept, C3E2 (Cognition, Coordination and Cooperation for Economically Efficient resource-usage) for Pareto optimality in future networks such as New Generation Networks. Advances of network usage could bring broad characteristics of traffic patterns, applications, networks as well as those of individual user utilities and network utilities. In order to achieve Pareto optimality, it is necessary to efficiently use network resources with avoiding selfish/greedy usages that result in unbalanced and poor resource utilization. Therefore, it is necessary to develop some mechanisms that appropriately organize and control network resource elements both to meet various user requirements such as power-saving, throughput, link speed and connectivity and to fit various kinds of mobility. The C3E2 concept and some approaches of network control based on the concept are here discussed.

  95. Network Control for Pareto Optimality in Future Internet : User-Centric Wired-Wireless Cognitive Technology

    2011/09

  96. An application-level routing method for improving end-to-end network performance based on heuristic algorithm

    MATSUDA Kazuhito, HASEGAWA Go, KAMEI Satoshi, MURATA Masayuki

    IEICE technical report 2011/08/25

    More details Close

    Recent researches revealed that an application-level routing that chooses a route relaying other end-hosts can improve user-perceived performance. However, selfish selection of route by each application user would lead to decreasing the route performance due to route overlaps, and increasing the inter-ISP transit cost because of utilizing more transit links than IP routing. In the present paper, we first strictly define the application-level routing optimization problem using the routing matrix. We then propose an application-level routing method for improving end-to-end network performance and reducing the transit cost, which based on centralized and distributed processings based on simulated annealing. We evaluate the performance of the proposed method assuming that the PlanetLab nodes utilize an application-level routing. We show that the proposed method can achieve the large degree of improvement of network performance. Especially, in the case of using bandwidth as the routing metric, we can improve the performance by 87% on an average.

  97. Energy Efficiency Analysis of TCP with Delayed ACK in a Wireless LAN Environment

    HASHIMOTO Masafumi, HASEGAWA Go, MURATA Masayuki

    IEICE technical report 2011/07/14

    More details Close

    The common strategy for energy saving of wireless network devices is to stay in sleep mode when no data is being transmitted or received. For effective energy saving, it is important to understand the relationships between the behaviors of the transport-layer protocols and energy efficiency. From the transport-layer viewpoint, it is effective to lengthen the idle interval by transmitting and receiving multiple packets successively in an RTT, which is called as the burst transmission. In this report, we analyze the energy consumption in TCP data transfer with the burst transmission of TCP over a wireless LAN. Through numerical results of our analysis, we reveal the burst transmission can reduce the energy consumption in TCP data transfer by an approximately three-fifth. We also discuss factors of WLAN devices for effective energy saving based on the analysis results.

  98. Cooperation Mechanism in Bandwidth Limitation Its Implementation in Wireless LANs

    Takayuki Nishio, Ryoichi Shinkuma, Tatsuro Takahashi, Go Hasegawa, Narayan Mandayam

    IPSJ SIG technical reports 2011/05/26

    More details Close

    In this paper, we discuss a cooperation framework applicable for wireless local area networks (WLANs), called TXOP (transmission opportunity) Exchange, in which only stations (STAs) participating in TXOP Exchange cooperatively use their available bandwidth to satisfy their required throughputs. TXOP Exchange enables flexible bandwidth exchange between compliant STAs without any effect on the legacy access point and legacy STAs. We evaluate the effectiveness of our mechanism through simulations and demonstrate a real implementation of TXOP exchange as application software.

  99. Cooperation Mechanism in Bandwidth Limitation Its Implementation in Wireless LANs

    NISHIO Takayuki, SHINKUMA Ryoichi, TAKAHASHI Tatsuro, HASEGAWA Go, MANDAYAM Narayan

    IEICE technical report 2011/05/26

    More details Close

    In this paper, we discuss a cooperation framework applicable for wireless local area networks (WLANs), called TXOP (transmission opportunity) Exchange, in which only stations (STAs) participating in TXOP Exchange cooperatively use their available bandwidth to satisfy their required throughputs. TXOP Exchange enables flexible bandwidth exchange between compliant STAs without any effect on the legacy access point and legacy STAs. We evaluate the effectiveness of our mechanism through simulations and demonstrate a real implementation of TXOP exchange as application software.

  100. Proposal and evaluation of time slot assignment algorithms considering adaptive modulation and coding in IEEE 802.16j relay networks

    Tomoya Kitayama, Go Hasegawa, Yoshiaki Taniguchi, Hirotaka Nakano

    IEICE Technical Report 2011/05

    More details Close

    The adaptive modulation and coding in wireless networks increases the amount of the data transmitted by a wireless link while maintaining the transmission quality. However, in IEEE 802.16j wireless multi-hop relay networks, there is no research on the performance evaluation and improvement of a time slot assignment algorithm considering the adaptive modulation and coding. In this report, we propose a time slot assignment method for the IEEE 802.16j multi-hop relay networks in consideration of the signal to noise ratio in the data transmission between relay nodes. The proposed method improves the network performance by adjusting the number of time slots assigned to links according to transmission quality. Through performance evaluations, we confirm that the data transfer throughput is increased by up to 50% by using our method.

  101. The implication of overlay routing on ISPs' connecting strategies

    Xun Shao, Go Hasegawa, Yoshiaki Taniguchi, Hirotaka Nakano

    IEICE Technical Report 2011/05

    More details Close

    The Internet is composed of many distinct networks, operated by independent Internet Service Providers (ISPs). ISPs' traffic and economic relationships are mainly decided by ISPs' routing policy. However, in today's Internet, overlay routing, which changes traffic routing at the application layer is rapidly increasing, and brings challenge to the ISPs' settlement researches. The goal of this report is to study the economic implications of overlay routing on ISPs. For this purpose, we introduce an ISP interconnection business model based on a simple ISPs' network. We then study the overlay traffic patterns in the network in various conditions. Combining the business model with traffic patterns, we study the ISPs' costs reduction with Bill-and-Keep peering and paid peering. We also discuss the ISPs' incentive to upgrade network with each peering strategy.

  102. Parameter tuning of protocol interference model considering SINR for wireless mesh networks

    Gyeongyeon Kang, Yoshiaki Taniguchi, Go Hasegawa, Hirotaka Nakano

    IEICE Technical Report 2011/03

  103. A distributed method for controlling coverage area using local topology information for wireless networks

    Shoichi Takemori, Go Hasegawa, Yoshiaki Taniguchi, Hirotaka Nakano

    IEICE Technical Report 2011/03

  104. Improvement of time slot assignment algorithm considering upstream transmission path in IEEE 802.16j networks

    Shimpei Tanaka, Go Hasegawa, Yoshiaki Taniguchi, Hirotaka Nakano

    IEICE Technical Report 2011/03

  105. A transport-layer solution for alleviating tcp unfairness in a wireless LAN environment

    Masafumi Hashimoto, Go Hasegawa, Masayuki Murata

    IEICE Transactions on Communications 2011/03

  106. Short-term precipitation forecasting using an optical flow algorithm

    IMAJO Kentaro, HASEGAWA Go, TANIGUCHI Yoshiaki, NAKANO Hirotaka

    IEICE technical report 2011/02/28

    More details Close

    For forecasting precipitation within a few hours, extrapolation methods based on the motion of observed rainy areas are generally used. This is because the computational time is shorter than that of simulating atmospheric disturbances based on hydrodynamics, especially for a few-hour forecasting. However, weather radars owned by Japan Meteorological Agency (JMA) cannot observe sudden and short-term downpours causing urban-area flood, since they do not have enough resolution and frequency. Recently, high-performance radars are being deployed to overcome the problem. However, there is no forecasting information provided using observed data by such high-performance radars. In this report, we propose a method to do short-term forecasting of precipitation with the observation data from high-performance radars. The proposed algorithm is based on an optical flow algorithm using block matching algorithm. We evaluated the proposed method and revealed that the proposed method can provide more accurate forecasting results compared with Nowcast provided by JMA, by more than 25% for between 5 and 60 minutes forecasting.

  107. BS-5-7 Analysis of Power Consumption of a Single TCP Flow with Burst Transmission in a Wireless LAN Environment

    Hashimoto Masafumi, Hasegawa Go, Murata Masayuki

    Proceedings of the IEICE General Conference 2011/02/28

  108. A Router Architecture comprises plural components of Slice enabling Energy Consumption Reduction

    IWAMOTO Hisashi, INOUE Kazunari, ATA Shingo, OTANI Shiro, HASEGAWA Go, YANO Yuji, KURODA Yasuto, MURATA Masayuki

    IEICE technical report 2011/02/24

    More details Close

    The complete network service of infrastructure is an urgent issue by means of continuous growth in network traffic. Apparently, the energy consumption of network routers may arise one of global environmental affairs, and therefore Research and Development works regarding power reduction is well desired. Our group proposes a unique feature embedded onto routers, which consists of plurality of slice, and is dynamically controlled by the prediction of network traffic flow. In this paper, we've examined slice control and LSI architecture, and have shown the validity of slice-architectural router.

  109. Performance evaluation of spatial composition method of measurement results in overlay networks

    SHOHARA Ryuta, HASEGAWA Go, MURATA Masayuki

    IEICE technical report 2011/02/24

    More details Close

    An overlay network is an application-layer network logically constructed on IP network. It is important for overlay networks to regularly measure the path performance to maintain and improve its service quality. One of the most accurate measurement method is full-mesh measurement, but when the number of overlay node is n, the method needs O(n^2) cost to measure all paths. So, the spatial composition method of measurement results has been proposed, which do not measure the overlapping part of the overlay path and estimate the path performance from measurement results of partial paths. However, we should discuss the estimation error between the estimated results and actually-maesured results. Therefore, in this report, we evaluate the estimation accuracy of the spacial composition method using actual measurement results on PlanetLab environment. We also propose the statistical method to enhance the estimation accuracy. We present numerical evaluation results and confirm that the proposed method can decrease the estimation error from 88% to 2%, while keeping the measurement efficiency.

  110. A Cooperative Mechanism for Fair and Efficient Bandwidth Usage in Dynamic Wireless Access Networks

    NISHIO Takayuki, SHINKUMA Ryoichi, TAKAHASHI Tatsuro, HASEGAWA Go, MANDAYAM Narayan

    IEICE technical report 2011/02/23

    More details Close

    In this paper we present a cooperative mechanism called TXOP (transmission opportunity) Exchange, in which only stations (STAs) participating in TXOP Exchange cooperatively use their available bandwidth to satisfy their required throughputs, while other legacy STAs continue to see same throughput as before. TXOP Exchange enables flexible bandwidth exchange between compliant STAs without any effect on the legacy access point and legacy STAs. Further, our NBS (Nash bargaining solution)-based algorithm also ensures fair incentives for cooperation between STAs. We evaluate the effectiveness of our mechanism through analysis and simulations.

  111. BS-5-1 Toward Realization of Pareto-optimal Network Control Technologies

    Ohta Chikara, Shinkuma Ryoichi, Hasegawa Go, Yamori Kyoko, Murase Tutomu

    Proceedings of the IEICE General Conference 2011

  112. Analysis of Power Consumption in TCP Data Transmission over a Wireless LAN Environment

    HASHIMOTO Masafumi, HASEGAWA Go, MURATA Masayuki

    IEICE technical report 2010/12/09

    More details Close

    Reduction of power consumption is one of an important issue in wireless communications because most mobile devices are battery-driven. For effective power saving, it is important to understand the behaviors of the transport layer protocols used by upper-layer applications, since packet transmission and reception timing are mainly determined by those behaviors. In this report, we propose a power consumption model based on a treatment of detailed TCP behaviors within a WLAN environment. Comparing the model with and without ideal sleeping, we analyze the power consumption of a single wireless client as it sends data to a wired host by TCP. From the numerical results of our analysis, we show the lower-bound for power consumption in upstream TCP data transfer with ideal sleeping. We also discuss the trade-off between power saving and network performance in TCP data transfer.

  113. Node repositioning for improvement of network performance in IEEE 802.16j relay networks

    Takafumi Shigefuji, Go Hasegawa, Yoshiaki Taniguchi, Hirotaka Nakano

    Proceedings of the 8th IEICE QoS Workshop 2010/11

  114. Time slot assignment algorithms for reducing latency of uplink transmission in IEEE 802.16j networks

    Shimpei Tanaka, Go Hasegawa, Yoshiaki Taniguchi, Hirotaka Nakano

    IEICE Technical Report 2010/10

    More details Close

    In IEEE 802.16j wireless multihop networks, transmission latency from relay nodes to a gateway node is one of the important performance metrics. The transmission latency is mainly affected by the scheduling delay at every relay nodes, which is determined by the time slot assignment algorithms to wireless links between relay nodes. In this report, we propose two kinds of time slot assignment algorithms for upward wireless links in IEEE 802.16j multihop networks. One of the proposed algorithms assigns time slots considering the hop count from a gateway node. Another assigns time slots considering the path from relay nodes to the gateway nodes. We evaluate the performance of the proposed algorithms through simulation experiments. We confirm that our algorithms can decrease the upstream latency by up to 15% compared with the existing method.

  115. Extending protocol interference model for wireless mesh networks considering signal-to-noise ratio

    Gyeongyeon Kang, Yoshiaki Taniguchi, Go Hasegawa, Hirotaka Nakano

    IEICE Technical Report 2010/10

  116. Design and Evaluation of a Data Transfer Mechanism for Video Streaming over TCP

    HISAMATSU Hiroyuki, HASEGAWA Go, MURATA Masayuki

    Technical report of IEICE. CQ 2010/09/02

    More details Close

    In recent years, video streaming services using TCP as a transport layer protocol represented by YouTube have been popular, with rapid increase of the network bandwidth. Congestion control of TCP increases the congestion window until a packet loss is detected. Therefore, the video streaming over TCP sends packets to a network at a higher speed than the video playback speed that takes the bandwidth of other competing traffic unnecessarily. In this report, we first investigate the data transfer mechanism of existing video streaming services using TCP and show that the existing video streaming services perform data transfer at the extremely higher rate than the video playback speed. Then, we propose the data transfer mechanism for video streaming over TCP that does not take the network bandwidth excessively by controlling the data transfer at an application layer. The proposed mechanism acquires the TCP state variables from the source host TCP, and estimates network congestion status. Moreover, the amount of buffered video data is acquired from a destination host. By adjusting the amount of data passed to a source host TCP in one round-trip time based on the network congestion status and the amount of buffered video data, the proposed mechanism controls the data transfer speed. Simulation results show that the proposed mechanism decreases the frequency of buffer underflow at the destination host, and does not take the bandwidth of background traffic.

  117. Performance evaluation of IEEE 802.16j relay networks with consideration of blocking radio waves by obstacles

    Yuuki Ise, Go Hasegawa, Yoshiaki Taniguchi, Hirotaka Nakano

    IEICE Technical Report 2010/09

  118. Design and evaluation of a data transfer mechanism for video streaming over TCP

    ITE technical report 2010/09

  119. B-6-74 A Transport Control Method for Cooperative Bandwidth Allocation in Wireless Downlinks

    NISHIO Takayuki, SHINKUMA Ryoichi, TAKAHASHI Tatsuro, HASEGAWA Go

    Proceedings of the Society Conference of IEICE 2010/08/31

  120. Application of inline network measurement technique to adaptive quality control in video conferencing system

    HASEGAWA Go, OIKE Kenji, AMANO Katsuhiro, MURATA Masayuki

    IEICE technical report 2010/07/08

    More details Close

    In this report, we propose the video conferencing system which change the audio and video quality according to the inline measurement results of the available bandwidth of the network path. We propose two types of application-level implementation methods for bandwidth measurement, which take different trade-off relationships between measurement accuracy and CPU load. From experimental results we confirm the effectiveness of the proposed measurement method.

  121. Accuracy evaluation of spatial composition of measurement results in overlay networks

    HASEGAWA Go, MURATA Masayuki

    IEICE technical report 2010/05/13

    More details Close

    In network performance measurement in overlay networks, measurement conflict occurs when multiple overlay paths share the underlay network route when they are measured at the same time, which increase the network load and the measurement accuracy degrades. We have proposed the spatial composition method of measurement results, where we estimate the network performance of the longer overlay path from the measurement results of partial paths, when the longer path includes other overlay nodes. In this report, we evaluate the accuracy of the composition method in terms of delay, packet loss ratio, and TCP throughput, by utilizing the measurement results in PlanetLab environment. From the evaluation results, we confirm that the estimation error is enough small for all metrics, but sometimes the error becomes large especially when the load of the internal overlay node is high.

  122. Reducing inter-ISP transit cost caused by overlay routing

    MATSUDA Kazuhito, HASEGAWA Go, KAMEI Satoshi, MURATA Masayuki

    IEICE technical report 2010/05/13

    More details Close

    Overlay routing is an application-level routing mechanism. Recent researches have revealed that user-perceived performance can be improved by overlay routing. However, because of the policy mismatch between overlay routing and IP routing, overlay-routed traffic would increase inter-ISP transit cost. In the previous work, we proposed a method to reduce inter-ISP transit cost caused by overlay routing. We utilize the number of transit links on overlay-routed paths as a metric of the inter-ISP transit cost, and estimate it utilizing the multiple regression analysis. By limiting the estimated number of transit links, we can reduce the inter-ISP transit cost. In the present report, we evaluate the performance of the proposed method in the two network environments that we assume, which are a generalized PlanetLab environment and a Japanese commercial network environment, to demonstrate the performance of the proposed method in various network environments. We also discuss the network properties which affect the performance of the proposed method, utilizing the analysis results of the both environments.

  123. Performance evaluation of service area deployment methods of IEEE 802.16j relay networks

    Shoichi Takemori, Go Hasegawa, Yoshiaki Taniguchi, Hirotaka Nakano

    IEICE Technical Report 2010/04

    More details Close

    In wireless relay networks based on IEEE 802.16j, each relay node has its own service area that provides wireless Internet access service to client terminals. In order to achieve effective region covering and efficient utilization of wireless network resources, it is important to determine the service area size by using the location information of other neighboring nodes. However, the amount of available information is heavily affected by the situation when constructing the networks and the function of the equipments. In this report, we introduce three methods to determine the service area size, each of which assumes a different level of knowledge regarding neighboring nodes. Through extensive simulation experiments, we confirm the trade-off relationships between the knowledge level and performance in these methods. Moreover, we show that the method based on voronoi area information can reduce the frame length by more than 40%, and that we can reduce the effects of biased node density by utilizing a few amount of information.

  124. Improving hypothesis management and considering sensor information loss for scenario-type hypothesis object tracking

    Masakazu Murata, Yoshiaki Taniguchi, Go Hasegawa, Hirotaka Nakano

    IEICE Technical Report 2010/03

  125. Evaluation of packet transmission latency in IEEE 802.16j relay networks

    Rintaro Ishii, Go Hasegawa, Yoshiaki Taniguchi, Hirotaka Nakano

    IEICE Technical Report 2010/03

  126. Proactive failure recovery method for overlay networks

    HORIE Takuro, HASEGAWA Go, MURATA Masayuki

    IEICE technical report 2010/02/25

    More details Close

    In this paper, we propose a proactive recovery method against multiple failures in the underlay network. Our method employs the proactive recovery method by using overlay networking technique. Specifically, it constructs multiple logical network topologies assuming various failure patterns. When a failure is detected, the proposed method can immediately recover from the failure by utilizing the appropriate topology to the failure, without waiting the routing convergence in the underlay network. Furthermore, the proposed method considers the correlation among overlay links in terms of utilizing underlay links. Through numerical calculation results in terms of the reachability and the average path length, we show that our method improves the network reachability from 41 % to 97 %, while keeping the path length to be enough small, when 11 % underlay links are down simultaneously.

  127. Performance Evaluation of Distributed Computing Environment Considering Power Consumption

    OGAWA Yukio, HASEGAWA Go, MURATA Masayuki, NISHIMURA Shinji

    IEICE technical report 2010/02/25

    More details Close

    When information systems are consolidated in a large data center, a huge amount of energy is consumed for transferring massive amounts of data to the data center through a wide area network. Our approach is to reduce the network power consumption by distributing servers capable of reducing or localizing traffic across the network. In this paper, we develop the models of applications, their traffic and a network system for transferring the traffic. We also introduce the models of route's and server's energy consumption, and formulate the power consumption caused by the traffic. Then, we evaluate the power consumption reduction as a result of traffic reduction by the distributed servers. Numerical evaluation results show that the whole power consumption reduces by about 20 percent when the more servers are added to the network; it increases due to the server power consumption when a lot of servers are added to the network.

  128. Decreasing measurement conflict on overlay network based on randomized algorithms

    HASEGAWA Go, MURATA Masayuki

    IEICE technical report 2010/01/14

    More details Close

    In this report, we propose a randomized algorithm to decrease measurement conflicts in overlay network. The proposed algorithm is based on the number of overlay paths which share some router-level links in their route and determine the measurement timing in a random fashion. By simulation experiments with some network topologies, we present that the proposed mechanism can increase the successful measurements while decreasing measurement conflicts, regardless of the network topologies and overlay node density.

  129. A method to reduce inter-ISP transit cost caused by overlay routing based on end-to-end measurement

    2010

  130. Experimental Evaluation of TCP Congestion Control Mechanisms in Wireless LAN Environment with a Novel Performance Metric

    HASHIMOTO Masafumi, HASEGAWA Go, MURATA Masayuki

    IEICE technical report 2009/12/03

    More details Close

    It has been pointed out in the past researches that per-flow unfairness in TCP throughput can be found in IEEE 802.11 wireless LAN environment. The main reason for the unfairness is that TCP keeps growing the congestion window size even when the access point is highly congested and numerous TCP ACK packets are discarded. In this report, we first propose a novel performance metric, considering both of per-flow fairness and bandwidth efficiency at network bottleneck. We then evaluate the performance of our proposed method for alleviating TCP unfairness problem through experiments in real wireless LAN environment using the metric. We show that the proposed method can improve TCP fairness up to 180 % regardless of vendor implementations of wireless access points and wireless interface cards.

  131. 複数のバイナリセンサを組み合わせた複眼センサによるオブジェクトの移動特性検出—Detection of movement characteristics of objects with compound-eye binary sensors—情報ネットワーク

    谷口 義明, 合田 幸裕, 長谷川 剛

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 2009/11

  132. Object tracking method based on scenario-type hypothesis tracking in segmented multiple regions

    Masakazu Murata, Yoshiaki Taniguchi, Go Hasegawa, Hirotaka Nakano

    IEICE Technical Report 2009/10

  133. B-11-8 Probabilistic method for avoiding measurement overlaps in overlay networks

    Hasegawa Go, Murata Masayuki

    Proceedings of the Society Conference of IEICE 2009/09/01

  134. Transport-layer optimization methods for wireless network environment

    HASEGAWA Go, MURATA Masayuki

    IEICE technical report 2009/07/02

    More details Close

    Transmission Control Protocol (TCP) is the most popular transport-layer protocol in the current Internet, and it is very robust protocol, meaning that it can provide a stable communication path under various and heterogeneous network environment. However, it sometimes fails to optimize its performance for each network environment. In this report, we especially focus on wireless access network environment and discuss recent research issues, including our previous research works, on transport-layer optimization methods against throughput and fairness problems in wireless networks.

  135. Transport-layer optimization methods for wireless network environment

    HASEGAWA Go, MURATA Masayuki

    IEICE technical report 2009/07/02

    More details Close

    Transmission Control Protocol (TCP) is the most popular transport-layer protocol in the current Internet, and it is very robust protocol, meaning that it can provide a stable communication path under various and heterogeneous network environment. However, it sometimes fails to optimize its performance for each network environment. In this report, we especially focus on wireless access network environment and discuss recent research issues, including our previous research works, on transport-layer optimization methods against throughput and fairness problems in wireless networks.

  136. Routing on overlay networks and its impact on ISP

    HASEGAWA Go, MURATA Masayuki

    IEICE technical report 2009/06/04

    More details Close

    Overlay networking technologies have been extensively investigated as possible solutions for quick deployment of new network applications to the Internet environment. In this report, we focus on an overlay routing mechanism, that is one of important functions of overlay networks, and discuss its advantages and disadvantages. Especially, we present the recent research issues on end-to-end performance imporvement by overlay routing, and its ill-effects on Internet Service Providers (ISPs) caused by the interactions between IP routing and overlay routing.

  137. IEEE802.16メッシュネットワークにおける物理トポロジ情報を用いた被覆領域の改善手法—Improving coverage area quality using physical topology information in IEEE802.16 mesh networks—情報ネットワーク

    竹森 翔一, 長谷川 剛, 谷口 義明

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 2009/05

  138. Load-balanced and interference-aware spanning tree construction algorithm for TDMA-based wireless mesh networks

    TOKITO Hiroshi, SASABE Masahiro, HASEGAWA Go, NAKANO Hirotaka

    IEICE technical report 2009/03/05

    More details Close

    Wireless mesh networks have been attracting many users in recent years. By connecting base stations (mesh nodes) with each other via wireless connections, they can achieve a wide-area wireless environment with flexible-configuration and low-cost properties at the risk of radio interference between wireless links. When we utilize the wireless mesh networks as an infrastructure for Internet access, all network traffic from mobile nodes goes through a gateway node which is directly connected to the wired network. Therefore, we need to distribute the traffic load by deploying multiple gateway nodes. In this paper, we propose a spanning tree construction algorithm for TDMA-based wireless mesh networks with multiple gateway nodes, which aims to maximize the traffic going to wired network (system throughput) by taking account of the traffic load on the gateway nodes, the access link capacity and the radio interference. Through simulation experiments, we show that the proposed algorithm increases the system throughput regardless of the bottleneck position and achieves up to 3.1 times higher system throughput than the conventional algorithm.

  139. Power control methods considering radio interference and path length for wireless mesh networks

    HIDEKUMA Toshiaki, HASEGAWA Go, SASABE Masahiro, NAKANO Hirotaka

    IEICE technical report 2009/03/05

    More details Close

    Wireless Mesh Networks (WMNs) have attracted significant interest as a cost-effective wireless network infrastructure. However, the efficiency of wireless resource utilization decreases by radio interference when multiple transmissions in an interference region occur simultaneously. One of possible solutions for this problem is to control the transmission power of mesh nodes. In this report, we propose a power control method of wireless mesh nodes for increasing spatial reuse in WMNs with TDMA MAC protocol. The proposed method decreases radio interference, considering the ill-effect of the increase in path length by cutting too many wireless links. Numerical evaluation results reveal that the proposed method decreases the frame length by up to 27% with non-sensitive parameter setting.

  140. Performance evaluation of P2P file-sharing network with relay caching in overlay routing

    NODA Takeshi, HASEGAWA Go, MURATA Masayuki

    IEICE technical report 2009/03/05

    More details Close

    In recent years, P4P have attracted a great deal of interest as a method to alleviate ineffective usage of the network resource by P2P applications. P4P provides various information such as ISP's traffic engineering policies and congestion level to P2P applications so that P2P peer node can select appropriate peer to connect. In this paper, we show extensive simulation results on the performance of P2P file sharing system with consideration of P4P. We also investigate the effect of relay caching, where the conveyed contents are cached on the relay node when activating overlay routing. Through simulation results, we show that P4P can improve both of the application performance and decrease the amount of outgoing traffic for ISPs. We also present that the effect of relay caching is limited for application performance, but has significant reduction of ISPs' cost.

  141. Reducing measurement overhead using path overlapping in overlay networks

    MORI Hiroki, HASEGAWA Go, MURATA Masayuki

    IEICE technical report 2009/03/05

    More details Close

    In overlay networks, the requirements for the effective and accurate measurement of the underlay IP networks between overlay nodes change according to the density of overlay nodes to the number of routers in the network. In this report, we propose the density-aware measurement strategies for reducing the number of measurements required for obtaining the full-mesh measurement results. Our method selects overlay paths for measurements depending on overlap between paths. We cofirm that the number of measurements can be further reduced when we select the location of overlay nodes by considering degree distribution.

  142. B-11-5 Reducing measurement conflict on overlay networks

    Hasegawa Go, Murata Masayuki

    Proceedings of the IEICE General Conference 2009/03/04

  143. Bandwidth-based congestion control for TCP with awareness of measurement noise and environmental change

    KODAMA Mizuho, HASEGAWA Go, MURATA Masayuki

    IEICE technical report 2009/02/24

    More details Close

    We have proposed a bandwidth-based TCP congestion control mechanism with an inline network measurement technique. The proposed method, named as TCP Symbiosis, controls the window size based on the bandwidth information unlike the standard TCP and the recent works on loss-based, delay-based and hybrid congestion control mechanisms. TCP Symbiosis has the effectiveness in terms of average throughput, scalability to the bandwidth-delay product, convergence time, stability, and fairness among connections. However, the performance of TCP Symbiosis highly depends on the measurement results of available bandwidth and environmental changes. In this paper, we redesign TCP Symbiosis to deal with the measurement error and environmental change. First, we propose the dynamic parameter setting algorithm based on the variance of the measured available bandwidth. Second, for the purpose of absorbing the ill-effect of environmental change, we intensionally add self-induced oscillation to the congestion window size of TCP connection. We confirm that the proposed method has the effectiveness without change in the basic nature of TCP Symbiosis.

  144. Evaluation of free-riding traffic problem in overlay routing and its mitigation method

    Go Hasegawa, Yuichiro Hiraoka, Masayuki Murata

    Proceedings of the 5th International Conference on Networking and Services, ICNS 2009 2009

  145. Performance evaluation of time slot allocation algorithms in IEEE 802.16 multi-hop relay networks

    ISHII Rintaro, HASEGAWA Go, TANIGUCHI Yoshiaki, NAKANO Hirotaka

    IEICE Technical Report 2009

    More details Close

    In this report, we propose a scheduling algorithm of timeslots for wireless links in IEEE802.16 multihop relay networks. The main purpose is to reduce transmission delay between relay nodes and gateway nodes as well as keeping total network throughput. The proposed algorithm is based on the existing method which utilizes a greedy algorithm but changes the order of timeslot assignment. It also accommodates the weighted assignment of timeslots, which is out of scope in the original method. The performance evaluation is conducted through both of simulation and numerical calculation and confirm that the proposed algorithm can provide smaller transmission delay in shorter calculation time.

  146. Detection of movement characteristics of objects with compound-eye binary sensors

    IEICE Technical Report 2009

  147. Scalable and density-aware measurement strategies for overlay networks

    HASEGAWA Go, MURATA Masayuki

    IEICE technical report 2008/12/04

    More details Close

    In overlay networks, when we consider the effective and accurate measurement of the underlay IP network between overlay nodes, it is important to take care the density of the overlay nodes to the number of routers in the network. In this report, we propose the density-aware measurement strategies for overlay networks. Our method can reduce the number of measurements required for obtaining the full-mesh measurement results by 1/50-1/100. We also confirm that the overlay node density highly affects the path overlap frequency, which is important factor when the overlay node can recognize the path overlapping in the network.

  148. Delay Analysis and Transport-Layer Optimization for Improving Performance of Thin-Client Traffic

    OGAWA Yukio, HASEGAWA Go, MURATA Masayuki

    IEICE technical report 2008/09/04

    More details Close

    Thin-client system is a system in which a client transmits a user event such as a mouse or keyboard input to a server and the server returns screen updates of a desktop application to the client. Network traffic in a thin-client system, that is, thin client traffic, is recognized by using two state system, that is consist of interactive data flows and bulk data flows. The interactive data flows mainly transfer character information, and the bulk data flows transfer screen update information. Our purpose is to minimize the latency time of the interactive data flows as well as to keep the performance of whole data flows in order to improve user's operation performance. We run the traffic simulation using the real field data, and show that the latency time of an interactive data flow is almost the sum of queuing delay at the router connecting to the bottleneck link and TCP's transmit delay at the server. We propose techniques of priority queuing of the interactive data flows as well as restraining the retransmission time out of the bulk data flows, and we show the effectiveness of the techniques when the two data flows exist together in a TCP connection as well as when each data flow has its own TCP connection.

  149. A new method of proactive recovery mechanisms for large-scale network failures

    HORIE Takuro, HASEGAWA Go, KAMEI Satoshi, MURATA Masayuki

    IEICE technical report 2008/09/04

    More details Close

    This paper proposes a recovery mechanism from large-scale failure based on overlay networking technologies. Our method is based on the proactive recovery scheme, which pre-calculates multiple routing tables for possible network failures and select one of them immediately after detecting the failures. Through numerical calculation results in terms of reachability and average path length, we show that our method improves the network reachability after the failures from 87% to 98%, while keeping the path length to be enough small, when 8% of the network nodes are down simultaneously.

  150. Power control method for increasing capacity in wireless mesh networks

    IEICE technical report 2008/07/24

  151. Performance Evaluation and Improvement of Hybrid TCP Congestion Control Mechanisms in Wireless LAN Environment

    HASHIMOTO Masafumi, HASEGAWA Go, MURATA Masayuki

    IEICE technical report 2008/07/10

    More details Close

    In this report, we evaluate the performance of recent TCP variants for high-speed and long-delay networks in IEEE 802.11 wireless LAN environment. We show that some of them have well-known TCP unfairness among up-link and down-link flows, and there is another unfairness problem among up-link flows. We then proposed an end-to-end-basis modification to TCP congestion control mechanisms to alleviate the unfairness problems, which activates congestion control when detecting ACK packet losses. We present that the proposed method is effective not only for improving the TCP fairness among up-link flows but also for the TCP fairness among up-link and down-link flows.

  152. 無線メッシュネットワークにおけるゲートウェイ負荷を均一化するための経路制御手法—Routing method for gateway load balancing in wireless mesh networks

    時任 宏, 笹部 昌弘, 長谷川 剛

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 2008/07

  153. Evaluation of free-riding traffic problem in routing overlay networks and its mitigation method

    HIRAOKA Yuichiro, HASEGAWA Go, MURATA Masayuki

    IEICE technical report 2008/03/06

    More details Close

    Recent researches on overlay networks have revealed that user-perceived network performance such as end-to-end delay could be improved by overlay routing mechanism, since the traditional IP routing is not generally configured according to such metrics. However, "free-riding" traffic problem in routing overlay networks, which is mainly caused by policy mis-match between the overlay routing and the underlay IP routing, may become harmful for ISPs. In this report, we first define the free-riding problem in routing overlay network and evaluate the degree of free-riding traffic problem, using the measurement results of delay and available bandwidth of network paths between PlanetLab nodes. We also present the possible way to select overlay paths to mitigate the problem.

  154. B-5-103 A Study of a Approximate Equalizer Wait Calculation Method by using FFT

    HASEGAWA Tsuyoshi

    Proceedings of the IEICE General Conference 2008/03/05

  155. Impact of unreliable link metric on traffic routing performance

    KODAMA Mizuho, KAMEI Satoshi, HASEGAWA Go, KAWAHARA Ryoichi, MURATA Masayuki, YOSHINO Hideaki

    IEICE technical report 2007/11/08

    More details Close

    In this report, we focus on network control mechanisms, especially traffic routing mechanisms, for achieving global optimization of the network performance. With the widespread and development of internet, the IP networks have been used in diverse environments. Because the existing traffic engineering did not designed for the environment, traffic engineering is required for wide area. Although routing mechanisms for global optimization require precise and up-to-date information on link metric of all links in the network, it is difficult to obtain it in low cost and short time in large-scale networks. Therefore, we need the routing mechanism which can achieve good performance even with incomplete and unreliable link metric. In this report, we evaluate of unreliable link metric the impact on routing from performance by using simulation experiments and examine the requirement for global optimum routing mechanism for large-scale networks.

  156. Effectiveness of overlay routing based on delay and bandwidth information

    HIRAOKA Yuichiro, HASEGAWA Go, MURATA Masayuki

    IEICE technical report 2007/07/12

    More details Close

    Recent researches on overlay networks have revealed that user-perceived network performance such as end-to-end delay could be improved by overlay routing mechanism, since the traditional IP routing is not always configured according to the user-perceived performance metrics. However, those studies only focus on end-to-end delay, and the bandwidth-related information such as available bandwidth and physical capacity is not considered. In this report, we use the measurement results of delay and available bandwidth of network paths between PlanetLab nodes and investigate the effect of overlay routing. We further reveal the relationships between delay and available bandwidth of the network paths. Finally we discuss two kinds of problems caused by the increase of the amount of overlay-routed traffic.

  157. A study on emergency networking services based on overlay network technologies

    HASEGAWA Go, KAMEI Satoshi, MURATA Masayuki

    IEICE technical report 2007/06/14

    More details Close

    In this report, we propose an architecture for emergency networking services, which is based on overlay routing technologies. We propose the improvement of existing overlay routing algorithm in terms of the amount of overhead in measuring reachability and exchanging informations between overlay nodes, and overlay-routing mechanism especially against the large-scale network failure caused by disasters, terrorism, routing software bugs, and so on. Through numerical examples with the actual AS-level network topology of the current Internet, we show that our approach can reduce the overhead in exchanging routing information up to 1/1000, and improve the network connectivity by up to 9 times.

  158. The Construction of Campus-wide IT Authentication Infrastructure : Installation Examples and Issues in Osaka University

    AKIYAMA Toyokazu, TERANISHI Yuichi, OKAMURA Shingo, SAKANE Eisaku, HASEGAWA Go, BABA Ken-ichi, NAKANO Hirotaka, SHIMOJO Shinji

    2007/05/30

    More details Close

    In Osaka University, since many academic affairs systems are going to become online, we have upgraded campus-wide IT authentication infrastructure to support higher security. The new infrastructure resolves vulnerability of the password authentication by introducing PKI authentication. Since key management devices are required to establish secure and convenient PKI, not all of the campus-users can use PKI. We combine PKI and single-sign-on to enable step-by-step migration from password to PKI and to support mixed authentication method. In this paper, we will describe the architecture, the operation status and the future works of the campus-wide IT authentication infrastructure.

  159. The Construction of Campus-wide IT Authentication Infrastructure : Installation Examples and Issues in Osaka University

    AKIYAMA Toyokazu, TERANISHI Yuichi, OKAMURA Shingo, SAKANE Eisaku, HASEGAWA Go, BABA Ken-ichi, NAKANO Hirotaka, SHIMOJO Shinji

    IEICE technical report 2007/05/22

    More details Close

    In Osaka University, since many academic affairs systems are going to become online, we have upgraded campus-wide IT authentication infrastructure to support higher security. The new infrastructure resolves vulnerability of the password authentication by introducing PKI authentication. Since key management devices are required to establish secure and convenient PKI, not all of the campus-users can use PKI. We combine PKI and single-sign-on to enable step-by-step migration from password to PKI and to support mixed authentication method. In this paper, we will describe the architecture, the operation status and the future works of the campus-wide IT authentication infrastructure.

  160. Implementation Experiments of a Congestion Control Mechanism of TCP with Inline Network Measurement

    KODAMA Mizuho, YAMANEGI Kana, HASEGAWA Go, MURATA Masayuki

    IEICE technical report 2007/04/23

    More details Close

    In this report, we investigate the performance of a new congestion control mechanism for TCP, TCP Symbiosis, which is proposed by our previous studies. Whereas the traditional TCP Reno recognizes the network congestion only by detecting packet losses, the proposed mechanism directly obtains the information of physical and available bandwidths of the network path, and utilize an algorithm based on logistic growth model and Lotka-Volterra competition model from biophysics to regulate the congestion window size. We investigate the performance of the proposed mechanism through experiments using the actual public Internet environment. We show the effectiveness of the proposed mechanism, especially in terms of scalability with the bandwidth-delay product of the network path.

  161. Implementation and Evaluation of TCP Congestion Control Mechanism for Predictable Throughput

    YAMANEGI Kana, HASEGAWA Go, MURATA Masayuki

    IEICE technical report 2007/03/01

    More details Close

    Recently, real-time media delivery services such as video streaming and VoIP have rapidly become popular. For these applications requiring high-level QoS guarantee, our research group has proposed a transport-layer approach to provide predictable throughput for upper-layer applications. In the previous paper, we have evaluated the performance of the proposed mechanism through simulation experiments and confirmed that the proposed mechanism can provide required throughput for TCP connections if the required throughput is not so large compared to the physical bandwidth, even when competing traffic occupies almost all of the bottleneck link bandwidth. In the present paper, we implement the proposed mechanism and evaluate it in the actual network. We investigate the performance through the experiments both in the experimental network and the commercial Internet environment, and validate that the proposed mechanism can achieve the required throughput with high probability as is the simulation results.

  162. Inferring bandwidth of overlay network paths using inline network measurement

    LE THANH MAN Cao, HASEGAWA Go, MURATA Masayuki

    IEICE technical report 2007/03/01

    More details Close

    To optimize the overlay route selections, overlay nodes require end-to-end bandwidth information of the paths between the overlay nodes. In the present paper, we introduce ImSystem, a distributed system installed in the overlay end hosts. ImSystem infers real-time information concerning the available bandwidth of all of the paths in the overlay networks, using a technique called inline network measurement. The key concept in ImSystem is that, when the overlay hosts transmit overlay traffic, they deploy the traffic to perform inline network measurements and exchange results with each other. ImSystem performs supplemental active measurements only when overlay traffic is insufficient for inline measurements, and therefore injects very little probe traffic onto the network. In addition, we enhance the system to ImSystemPlus, in which conflicts of the supplemental active measurements are greatly reduced, providing that the IP network topology is known. The simulation results show that the proposed systems have the same accuracy as that when all paths are measured by active measurements, while using only a small amount of probe traffic.

  163. Effect of Paced TCP on Router Buffer Sizing

    TADA Kentaro, HASEGAWA Go, MURATA Masayuki

    IEICE technical report 2007/03/01

    More details Close

    Buffer sizes for today's Internet routers is configured based on a rule-of-thumb called the bandwidth-delay product rule. which means a product of the link bandwidth and the average round trip time (RTT) of flows passing through the router. On the other hand, the recent research has proposed that when the number of flows is sufficiently large, the buffer size can be decreased to the bandwidth-delay product divided by the square-root of the number of flows (sqrt-N rule), without introducing the under-utilization of the network link. In addition, the another research has proposed that when smoothing the behavior of TCP traffic by using TCP Pacing, the buffer size can be more decreased to dozens of packets. However, these proposal has been evaluated only from the aspects of utilization of the bottleneck link. In this paper, we consider that effect of TCP Pacing on router buffer sizing, focusing on the performance of TCP connections traversing the router. Through extensive simulation experiments, we show that when the buffer size is decreased by using TCP Pacing, it would degrade the TCP performance when compared with the bandwidth-delay product rule with using TCP Reno.

  164. Detection and Control Mechanisms of Tampered-TCP at Edge Routers

    MARUYAMA Junichi, HASEGAWA Go, MURATA Masayuki

    IEICE technical report 2007/03/01

    More details Close

    In this report, we propose a new mechanism which detects tampered-TCP connections and keeps the fairness among TCP connections at edge routers. The proposed mechanism monitors TCP packets at an edge router and estimates the window size or throughput of each TCP connection. By using estimation results, the proposed mechanism judges whether each connection is tampered or not and drops packets intentionally if necessary to improve the fairness among connections. From the results of simulation experiments, we exhibit that the proposed mechanism can identify tampered-TCP connections at high probability and regulate throughput ratio between tampered-TCP connections and competing TCP Reno connections to around 1.

  165. Transport-layer protocols for high-speed and long-delay networks

    HASEGAWA Go, MURATA Masayuki

    IEICE technical report 2007/01/25

    More details Close

    In this report, we discuss the modifications of the congestion control mechanism of TCP, which is the major transport-layer protocol in the current Internet, for high-speed and long-delay networks. We categorize them by the network congestion indications which a TCP sender utilizes to increase/decrease its congestion window size. We also introduce recent works of our research group, which is an inline network measurement method which measures the bandwidth information of the network path between sender and receiver hosts, and TCP Symbiosis which control its congestion window size based on the measured bandwidth information.

  166. A study on "free-riding" traffic problem in routing overlay networks

    HASEGAWA Go, KOBAYASHI Masayoshi, MURATA Masayuki, MURASE Tutomu

    IEICE technical report 2006/12/07

    More details Close

    In this paper, we discuss the "free-riding"traffic problem in routing overlay networks, which is mainly caused by policy mis-match between the overlay routing and the underlay IP routing. We first define the free-riding problem in routing overlay network, and construct mathematical models for the amount of the free-riding traffic. We next present the numerical examples on the effectiveness of the overlay routing and the amount of free-riding traffic, and point out that we expect significant amount of free-riding traffic in the actual Internet environment.

  167. 大規模ネットワークにおけるTCPトラヒックを考慮したルータのバッファサイズの検討

    久松 潤之, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 2006/12

  168. Achieving predictable throughput of TCP based on inline network measurement

    YAMANEGI Kana, HASEGAWA Go, MURATA Masayuki

    IEICE technical report 2006/09/07

    More details Close

    The demand of Internet users for diversified services has increased due to the rapid development of the Internet, and applications requiring QoS guarantee, such as real-time media delivery services, have become popular. Our research group has proposed transport-layer approaches to provide such high-level quality of network services. In the present paper, we propose a congestion control mechanism of TCP for achieving predictable throughput. It does not mean we can guarantee the throughput, while we can provide the throughput required by an upper-layer application at high probability when network congestion level is not so high. We herein present the evaluation results for the proposed mechanism obtained in simulation experiments and confirm that the proposed mechanism can assure a TCP throughput if the required bandwidth is not so high compared to the physical bandwidth, even when other ordinary TCP (e.g., TCP Reno) connections occupy the link.

  169. Evaluation of the effectiveness of tampered-TCP

    MARUYAMA Junichi, HASEGAWA Go, MURATA Masayuki

    IEICE technical report 2006/07/06

    More details Close

    In this paper, we investigate the effectiveness of tampered-TCP, in which the congestion control mechanism is modified by malicious users for higher throughput than the normal TCP. We focus on a tampered-TCP which changes the increase and decrease rate of congestion window size. We discuss the performance of the tampered-TCP through the mathematical analysis and simulation, and show its characteristics as: (1) when the increase rate is larger than 2 packets per RTT, the throughput degrades significantly due to many timeouts, (2) decreasing the decrease rate is effective for the throughput improvement, (3) the effectiveness of decreasing the decrease rate is smaller than the throughput degradation due to increasing the increase rate. We conclude that there is little region where the tampered-TCP obtains much higher throughput.

  170. Implementation issues on inline network measurement algorithms in gigabit networks

    TSUGAWA Tomoaki, LE THANH MAN Cao, HASEGAWA Go, MURATA Masayuki

    IEICE technical report 2006/07/06

    More details Close

    We have proposed the concept of inline network measurement, which involves the concept of "plugging" an active bandwidth measurement mechanism into an active TCP connection. Mechanisms using this method have the advantage of requiring no extra traffic for measuring available bandwidth. However, when the inline network measurement algorithms are implemented in general-purpose computers, some problems arise, such as the clock resolution of the kernel system, Interrupt Coalescence (IC) deployed in network interface cards, and the behavior of TCP receiver. In the present paper, we explain these difficulties and describe our current solutions. Furthermore, we implement the measurement algorithms and the solutions against those problems in a FreeBSD 4.10 kernel system, and present some results on experimental networks. The experimentally obtained results are used to verify the solutions and to confirm the effectiveness of our concept, inline network measurement, on actual networks.

  171. Performance Analysis of Large-Scale IP Networks considering TCP Traffic

    HISAMATSU Hiroyuki, HASEGAWA Go, MURATA Masayuki

    IEICE technical report 2006/04/10

    More details Close

    In this paper, we propose a novel analysis method for large-scale networks with consideration of the behavior of the congestion control mechanism of TCP. In the analysis, we model the behavior of TCP at end-hosts and network links as independent systems, and combine them into a single system in order to analyze the entire network. We then derive the utilization of the network links, the packet loss ratio of the link buffer, the throughput of TCP connections, and the location and degree of the network congestion. Using this analysis, we can analyze a large-scale network, i.e. with over 100/1,000/10,000 routers/hosts/links and 100,000 TCP connections in substantially short time. Especially, a calculation time of our analysis, which is different from that of ns-2, is independent of a network bandwidth and/or propagation delay. We validate our approximate analysis by comparing analytic results with simulation ones. We also show that our analysis method treats the behavior of TCP connection in a large-scale network appropriately.

  172. TCPトラヒックを考慮した大規模ネットワーク解析手法の提案

    久松 潤之, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 2006/04

  173. BS-5-4 A Packet Burst-based Inline Network Measurement Mechanism

    Cao Le Thanh Man, Hasegawa Go, Murata Masayuki

    Proceedings of the IEICE General Conference 2006/03/08

  174. BS-10-2 Analytical Evaluation of Receiver-based ACK Splitting Mechanism for TCP over Wired/wireless Heterogeneous Networks

    Nakata Masashi, Hasegawa Go

    Proceedings of the IEICE General Conference 2006/03/08

  175. Effect of the router's buffer size on TCP performance

    TOMIOKA Takshi, HASEGAWA Go, MURATA Masayuki

    IEICE technical report 2006/03/02

    More details Close

    The size of router buffers are traditionally determined by the bandwidth-delay product rule, which means a product of the link bandwidth and the average round trip time (RTT) of flows passing through the router. On the other hand, the recent research results have revealed that when the number of flows is sufficiently large, the buffer size can be decreased to the bandwidth-delay product divided by the square-root of the number of flows (sqrt-N rule), without introducing the under-utilization of the network link. In this paper, we compare the performance of the above two rules for the router buffer size, focusing on the performance of TCP connections traversing the router. Through extensive simulation experiments, we show that it would degrade the TCP performance in terms of packet loss ratio and file transmission delay, and the sqrt-N rule would enhance the network performance only when the transferring file size is between 50-100 Kbytes or when the propagation delay between the sender and the receiver hosts is significantly small.

  176. スループット保証を実現するTCPの輻輳制御方式の提案と評価

    山根木 果奈, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 2006/03

  177. Implementation Experiments of Inline Measurement TCP and its Application Technique

    MORI Kazunari, HAMA Takayuki, HASEGAWA Go, MURATA Masayuki, SHIMONISHI Hideyuki, MURASE Tutomu

    IEICE technical report 2006/02/16

    More details Close

    In our previous studies, we proposed ImTCP, a novel inline network measurement technique which can obtain available bandwidth information continuously, and ImTCP-bg, a new background TCP data transfer mechanism by using measurement results. We investigated the effectiveness of ImTCP and ImTCP-bg through evaluation with simulation and experimental network. However, it is expected that ImTCP doesn not obtain preferable measurement results in an actual public network according to various factors. In this paper, we evaluate the performance of ImTCP and ImTCP-bg in the actual public network. We investigate the performance of the proposed mechanisms through the various experiments, and validate their effectiveness in terms of the measurement accuracy and the interference degree with the other traffic.

  178. Throughput Analysis of ACK Splitting Mechanism for TCP over Heterogeneous Networks with Wired and Wireless Links

    NAKATA Masashi, HASEGAWA Go, NAKANO Hirotaka

    IEICE technical report 2006/01/19

    More details Close

    Although many solutions for the problem that the throughput of TCP degrades on heterogeneous networks with wired and wireless links have been proposed in the past literature, they have various problems such as the difficulties in introduction by wireless access network provider and end users, the violation of TCP's end-to-end principle by splitting connection, and the inapplicability to encrypted traffic by access to TCP header at the base station. Therefore, we have proposed a receiver-based mechanism using ACK-splitting method which does not have these problems. In this paper, we analyze the performance of the proposed mechanism, and verify its validity.

  179. Reasons not to Parallelize TCP Connections for Fast Long-Distance Networks

    ZHANG Zongsheng, HASEGAWA Go, MURATA Masayuki

    IEICE technical report 2006/01/12

    More details Close

    For utilizing fast long-distance networks effectively, parallel TCP was proposed, and has been employing. However, as high-speed transport-layer protocols appear, it is necessary to reinvestigate the performance of parallel TCP. In this paper, we use mathematical analysis to explore its performance. Analysis results show that the open issue of choosing the number of TCP connections is difficult to be solved in practice. Despite the mechanism that adjusts the number of TCP connections during data transfer is proposed, some potential problems still remain. In contrast, it is a better choice to use high-speed TCP in your future applications.

  180. An Inline Network Measurement Mechanism for High-Speed Networks

    LE THANH MAN Cao, HASEGAWA Go, MURATA Masayuki

    IEICE technical report 2005/12/15

    More details Close

    In high-speed networks, such as 1-Gbps or higher networks, bandwidth measurement algorithms that utilize packet transmission/arrival intervals, such as packet trains and packet pairs, have a number of problems. First, network measurement for large bandwidth requires short packet transmission intervals, which causes a heavy load on the CPU. Second, network interface cards for high-speed networks usually employ Interrupt Coalescence (IC), which rearranges the arrival intervals of packets and causes bursty transmission of packets. In the present study, we introduce ICIM (Interrupt Coalescence -aware inline measurement), a new bandwidth measurement approach that overcomes these two problems. ICIM utilizes the data packets of an active TCP connection for the measurement. In order to determine the available bandwidth, rather than adjusting the packet transmission intervals, the TCP sender instead adjusts the number of packets involved in a burst and checks whether the corresponding ACK packets also form a burst. Simulation results show that ICIM can measure the bandwidth as high as some Gbps while requiring a number of data packets that is only 1/100 of that of the existing stream-based algorithm. TCP that is deploying ICIM can yield measurement results in intervals as short as some RTTs, while maintaining the properties of the original TCP.

  181. Implementation and evaluation of an inline network measurement algorithm and its application technique

    TSUGAWA Tomoaki, HASEGAWA Go, MURATA Masayuki

    IEICE technical report 2005/12/15

    More details Close

    In our previous studies, we proposed ImTCP, a novel inline network measurement technique which can obtain available bandwidth information continuously, and ImTCP-bg, a new background TCP data transfer mechanism by using measurement results. We investigated the effectiveness of ImTCP and ImTCP-bg through simulation experiments. However, it is important to test the measurement-related mechanisms in actual networks when we evaluate their effectiveness. In this paper, we implement the proposed mechanisms and evaluate them in the experiment network. We investigate the performance through the experiments, and validate the effectiveness of measurement accuracy and interference degree with the other traffic.

  182. Evaluation of TCP-Westwood Low-Priority in the Internet

    HAMA Takayuki, MORI Kazunari, SHIMONISHI Hideyuki, MURASE Tutomu, HASEGAWA Go, MURATA Masayuki

    IEICE technical report 2005/12/15

    More details Close

    To differentiate transmission quality of user sessions without any modifications or configurations of network equipment, we have proposed a congestion control scheme called TCP Westwood Low-Priority (TCPW-LP), which realizes a low priory transfer for an TCP session. Our simulation and experimental evaluations show that TCPW-LP is able to fully utilize residual network capacity without degrading the transmission quality of coexisting traffic. Since TCPW-LP relies on a RTT (Round Trip Time) measurement for its congestion control, its accuracy of control depends on other traffic characteristics to be degraded in a real Internet environment where measured RTT fluctuates due to, for example, bursty nature of Internet traffic. In this paper, we investigate the relation-ship between network load and measured RTT. And we propose an optimal smoothing method for RTT measurements and show that TCPW-LP can fully utilize residual network capacity without degrading the transmission quality of the other traffic in the Internet.

  183. Dynamic ACK-splitting Mechanism for TCP on wired/wireless heterogeneous networks

    NAKATA Masashi, HASEGAWA Go, NAKANO Hirotaka

    IEICE technical report 2005/07/14

    More details Close

    Though a lot of solving methods for the problem that the throughput of TCP degrades on wired/wireless heterogeneous networks have been proposed in the past literature, they have problems such as difficultie of introduction by wireless access network provider and end users, or violation of TCP's end-to-end principle by splitting connection, or being inapplicable to encrypted traffic. In this paper, we propose a receiver-based mechanism using ACK-splitting method and considering network congestion level, which does not have these problems. Simulation results show that the proposed method improves TCP's data transmission performance.

  184. Inline Measurement Method for Capacity Bandwidth of End-to-end Network Path

    LE THANH MAN Cao, HASEGAWA Go, MURATA Masayuki

    IEICE technical report. Information networks 2005/06/09

    More details Close

    We previously proposed a new version of TCP, called Inline measurement TCP (ImTCP), in [1, 2]. The ImTCP sender adjusts the transmission intervals of data packets and then utilizes the arrival intervals of ACK packets for available bandwidth estimation. This type of active measurement is preferred because the obtained results are as accurate as those of other conventional types of active measurement, even though no extra probe traffic is injected onto the network. In the present research, we propose a new capacity measurement function and combine it with ImTCP in order to enable simultaneous measurement of both capacity and available bandwidth in ImTCP. The capacity measurement algorithm is a new packet-pair-based measurement technique that utilizes the estimated available bandwidth values for capacity calculation. This new algorithm promises faster measurement than current packet-pair-based measurement algorithms for various situations and works well for high-load networks, in which current algorithms do not work properly. Moreover, the new algorithm provides a confidence interval for the measurement result.

  185. Implementation Experiments on HighSpeed and Parallel TCP

    ZHANG Zongsheng, HASEGAWA Go, MURATA Masayuki

    IEICE technical report. Information networks 2005/06/09

    More details Close

    It is well-known that TCP Reno cannot provide satisfactory performance in high-speed long-delay networks. As a means addressing this problem, gentle HighSpeed TCP (gHSTCP) has been proposed in [1]. However, its effectiveness has only been demonstrated in simulation experiments. In the present paper, a refined gHSTCP algorithm is proposed for application to real networks. The performance of the refined gHSTCP algorithm is then assessed experimentally. The refined gHSTCP algorithm is based on the original algorithm, which uses two modes (Reno mode and HSTCP mode) in the congestion avoidance phase and switches modes based on RTT increasing trends. The refined gHSTCP algorithm compares two RTT thresholds and judges which mode will be used. The experimental results demonstrate that gHSTCP can provide a better tradeoff in terms of utilization and fairness against co-existing traditional TCP Reno connections.

  186. A New Congestion Control Mechanism of TCP based on Bandwidth Measurement

    IGUCHI Tomohito, HASEGAWA Go, MURATA Masayuki

    IEICE technical report 2005/02/25

    More details Close

    In this paper, we propose a new congestion control mechanism of TCP, using bandwidth information obtained by inline network measurement to control the congestion window size. Whereas the traditional TCP Reno recognizes the network congestion by detecting packet losses, the proposed mechanism obtains directly the information of physical and available bandwidths by using an inline network measurement technique. It adjusts the congestion window size by using an algorithm based on logistic model and Lotka-Volterra competition model from biophysics. The proposed mechanism is intensively investigated through analysis and simulation evaluations, and we show the effectiveness of the proposed mechanism in terms of scalability with the network bandwidth-delay product, convergence time, fairness among connections, and stability.

  187. Experimental Study of a TCP-Adaptive Reno for High Speed Networks

    HAMA Takayuki, YAMANEGI Kana, SHIMONISHI Hideyuki, MURASE Tutomu, HASEGAWA Go, MURATA Masayuki

    IEICE technical report 2005/02/25

    More details Close

    It has been recognized that current TCP (mostly TCP-Reno) throughput deteriorates in emerging high-speed network environments with high bandwidth-delay products. This is because the congestion control mechanism of widely used TCP-Reno, as well as its default buffer setting, is not adequate for such environments. Since it's difficult to change the TCP implementations and settings of every end hosts, we propose a high-speed and TCP-Reno-friendly protocol, called TCP-Adaptive Reno, and implemented it into our transparent TCP proxy. We evaluate this proxy on both an experimental network and a long-distance Internet environment. The results show that the proxy provides roughly three time larger throughput than end-to-end TCP-Reno flows of the experimental network, and also two times larger throughput at the Internet environment. It is also shown that the proxy does not deteriorate co-existing TCP-Reno flows and fairly share the link bandwidth.

  188. Implementation Experiments of TCP Proxy Mechanism

    YAMANEGI Kana, HAMA Takayuki, HASEGAWA Go, MURATA Masayuki, SHIMONISHI Hideyuki, MURASE Tutomu

    IEICE technical report. Information networks 2005/02/17

    More details Close

    TCP overlay network, which controls data transmission quality at the transport layer, is paid much attention as the users' demands for diversified services in the Internet becomes large. In the TCP overlay network, a TCP proxy is a fundamental mechanism which splits a TCP connection between sender and receiver hosts into multiple TCP connections at some nodes in the network and relays data packets from the sender host to the receiver host via the split TCP connections. In this paper, we investigate the performance of the TCP proxy mechanism through experiments using the actual public network. We show the results that the TCP proxy mechanism can enhance the data transfer throughput without any change at the endhost's TCP/IP protocol stack. We also evaluate the performance of gentle High-Speed TCP, proposed in the previous work, when it is used on the TCP connection between the TCP proxy nodes.

  189. ImTCP-bg : Background TCP data transfer with inline network measurement

    TSUGAWA Tomoaki, HASEGAWA Go, MURATA Masayuki

    IEICE technical report. Information networks 2005/02/17

    More details Close

    In this paper, we propose ImTCP-bg, a new background TCP data transfer mechanism by using an inline network measurement technique. ImTCP-bg sets an upper limit of the congestion window size of the sender TCP based on the results of the inline network measurement of available bandwidth of the network path between the sender and receiver hosts. ImTCP-bg can provide a background data transfer without affecting the foreground traffic, whereas the previous methods can not avoid the network congestion essentially. We investigate the performance of ImTCP-bg through simulation expeiments, and we validate the effectiveness of ImTCP-bg in terms of interference with foreground traffic and the link utilization.

  190. A New Congestion Control Mechanism of TCP with Inline Network Measurement

    IGUCHI Tomohito, HASEGAWA Go, MURATA Masayuki

    IEICE technical report. Information networks 2004/10/15

    More details Close

    In this paper, we propose a novel congestion control mechanism of TCP, by using an inline network measurement technique. By using information of available bandwidth of a network path between sender and receiver hosts, we construct quite a different congestion control mechanism from the traditional TCP Reno and its variants, based on logistic and Lotka-Volterra models from biophysics. The proposed mechanism is intensively investigated through analysis and simulation evaluations, and we show the effectiveness of the proposed mechanism in terms of scalability with the network bandwidth, convergence time, fairness among connections, and stability.

  191. Performance Analysis and Evaluation of TCP Overlay Networks

    MAKI Ichinoshin, HASEGAWA Go, MURATA Masayuki, MURASE Tutomu

    IEICE technical report. Information networks 2004/10/15

    More details Close

    TCP overlay network, which controls data transmission quality at the transport layer, is paid much attention as the users' demands for diversified services in the Internet becomes large. In the TCP overlay network, a TCP proxy is a fundamental mechanism which splits a TCP connection between sender and receiver hosts into multiple TCP connections at some nodes in the network and relays data packets from the sender host to the receiver host via the split TCP connections. In our previous work, we find that the end-to-end throughput of the TCP connection can be considerably improved by the TCP proxy mechanism. In this paper, we investigate the performance of the TCP proxy mechanism when it handles Web traffic and discuss the strategy for preventing the increase of document transfer delay due to the processing delay of a TCP proxy node.

  192. Performance Analysis and Improvement of HighSpeed TCP with TailDrop/ARED Routers

    ZHANG Zongsheng, HASEGAWA Go, MURATA Masayuki

    IEICE technical report. Information networks 2004/05/14

    More details Close

    Continuous and explosive growth of the Internet has shown that current TCP mechanisms can obstruct efficient use of high-speed, long-delay networks. To address this problem we propose an enhanced transport-layer protocol called gHSTCP, based on the Highspeed TCP protocol proposed by Sally Floyd. It uses two modes in the congestion avoidance phase based on the changing trend of RTT. Simulation results show gHSTCP can significantly improve performance in mixed environments, in terms of throughput and fairness against the traditional TCP Reno flows. However, the performance improvement is limited due to the nature of TailDrop router, and the ARED routers can not alleviate the problem completely. Therefore, we present a modified version of Adaptive RED, called gARED, directed at the problem of simultaneous packet drops by multiple flows in high speed networks. This new Active Queue Management (AQM) mechanism can eliminate weaknesses found in Adaptive RED by monitoring the trend in variation of the average queue length of the router buffer. Our approach, combining gARED and gHSTCP, is more effective and fair to competing traffic than Adaptive RED with Highspeed TCP.

  193. ImTCP : TCP with an inline network measurement mechanism

    LE THANH MAN Cao, HASEGAWA Go, MURATA Masayuki

    IEICE technical report. Information networks 2004/05/14

    More details Close

    We introduce a new version of TCP (ImTCP : Inline Measurement TCP), which can make use of the data it transfers through a network path binding two end hosts to measure the bandwidth available in the path (inline measurement). ImTCP adjusts the transmission intervals of some data packets then utilize the arrival ACK packets to perform the measurement. ImTCP can be realized based RenoTCP by only changing the sender program. The simulation results show that the measurement mechanism does not degrade the performance of TCP's data transmission, does not give extra effect on surrounding traffic while yielding measurement results in short intervals such as 1-4 RTTs.

  194. SB-10-1 Congestion Prevention Buffer Management in TCP Proxy(SB-10. Latest Trends on Broadband Contents Delivery Technologies)

    Yamasaki Yasuhiro, Murase Tutomu, Hasegawa GO, Murata Masayuki

    Proceedings of the IEICE General Conference 2004/03/08

  195. TCPコネクションのためのアクセスリンク資源管理方式

    東 和弘, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 2004/03/04

  196. Performance Analysis of TCP Proxy Mechanism in TCP Overlay Networks

    MAKI Ichinoshin, HASEGAWA Go, MURATA Masayuki, MURASE Tutomu

    IEICE technical report. Information networks 2004/02/06

    More details Close

    TCP overlay network, which controls data transmission quality at the transport layer, is paid much attention as the users' demands for diversified services in the Internet becomes large. In the TCP overlay network, a TCP proxy is a fundamental mechanism which splits a TCP connection between sender and receiver hosts into multiple TCP connections at some nodes in the network and relays data packets from the sender host to the receiver host via the split TCP connections. It is expected to enhance the end-to-end throughput of the TCP connection because of the reduction of the Round Trip Time and the packet dropping ratio of each split TCP connection, but performance degradation may happen due to the undesired interaction among the split TCP connections. In this paper, we introduce an analysis approach to estimate the end-to-end throughput of the TCP proxy mechanism in consideration of the performance degradation. We also discuss about the effectiveness of TCP proxy mechanism through our analysis results.

  197. Inline network measurement : TCP with a built-in measurement technique

    長谷川 剛

    電子情報通信学会2004ソサイエティ大会 2004

  198. Congestion Prevention Buffer Management in TCP Proxy

    YAMASAKI Yasuhiro, MURASE Tutomu, HASEGAWA Go, MURATA Masayuki

    IEICE technical report 2003/12/04

    More details Close

    Recently, TCP overlay network which relays TCP connections is proposed for purposes of improvement of performance, stability and reliability. This is because that relaying TCP enables to achieve both small RTT (Round Trip Time) and low packets loss rate. TCP throughput, however, happens to be degraded when the TCP connections are relayed without any control in TCP Proxy. We revealed that trivial congestion in TCP downstream causes severe throughput degradation in upstream. In order cope with this problem, we propose congestion prevention buffer management for TCP Proxy. The proposed method can suppress throughput degradation in upstream with notification (advertisement) of smaller buffer size than available one to the upstream TCP connection. This method has no modification on TCP protocol so that this inherits a nature of "TCP friendly". Through simulation and prototyping the performance improvement of the proposed method is evaluated. The results show that the proposal method can achieve twice as high as that in no control.

  199. Implementation and Evaluation of Resource Management System for Internet Servers

    AZUMA Kazuhiro, OKAMOTO Takuya, HASEGAWA Go, MURATA Masayuki

    IEICE technical report 2003/09/04

    More details Close

    We propose a new resource management scheme for Web/Web proxy servers, which manages their resources for TCP connections, effectively and fairly. In the proposed system, we focus on the effective use of server resources by assigning dynamically the send/receive socket buffer according to the required size of each TCP connection, and terminating positively the idol persistent connection. In this paper, we validate the effectiveness of our proposed scheme through implementation experiments, and confirm conclusively that Web/Web proxy server throughput can be improved by 25% at maximum, and document transfer delay perceived by client hosts can be decreased by 90%.

  200. HighSpeed TCPの性能評価とその性能改善方式の提案

    徳田 航一, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 2003/03/07

  201. Inline Network Measurement with Active TCP connections

    Man Cao Le Thanh

    Proceedings of the IEICE General Conference 2003/03/03

  202. サービスオーバーレイネットワークのためのインラインネットワーク計測に関する一検討

    Cao Le Thanh Man, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 2003/01/17

  203. Dynamic Receive Socket Buffer Allocation at Web Proxy Servers

    OKAMOTO Takukya, HASEGAWA Go, MURATA Masayuki

    IEICE technical report. Information networks 2002/10/11

    More details Close

    In the current Internet, many HTTP sessions are established between Web clients and servers via Web proxy servers. Since the Web proxy server accommodates lots of TOP connections from Web client hosts, and those to Web servers, it cannot show sufficient performance if the resources of the proxy server should be utilized effectively. In this paper, we propose a new resource management scheme for Web proxy servers to improve their performance and to reduce Web document transfer time via it. Our proposed scheme assigns the proper size of receive socket buffer to each TOP connection, which downloads the original Web document from the Web server via the Web proxy server. That is, a larger size of the receive socket buffer is assigned for a TOP connection with larger link bandwidth, and vice versa. We validate an effectiveness of our proposed scheme through simulation experiments. The simulation results show that our proposed scheme can manage resouces at the Web proxy server and an about twice throughput of the Web Proxy server and up to one-quater response time of document transfer is obtained our proposed scheme as compared with the conventional method.

  204. ネットワークプロセッサを用いた実験用ネットワークエミュレータシステムの構築

    東條 晴基, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 2002/03/14

  205. Proxy Mechanism of Multiplexing TCP Connections over Satellite Internet

    KOUDA Morihiro, HASEGAWA Go, MURATA Masayuki

    IEICE technical report. Information networks 2002/03/14

    More details Close

    In this paper, we propose a novel architecture of a proxy mechanism for multiple TCP connections over the satellite Internet, which is provided by GEO (Geostationary Earth Orbit) satellites. The proposed architecture splits the TCP connection between the sender and receiver hosts into two terrestrial connections and one satellite connection. We then adopt SCTP (Stream Control Transmission Protocol) as a transport-layer protocol to multiplex TCP connections on the satellite link, to effectively use its capacity. We further propose a congestion control mechanism for the satellite SCTP connection, which is based on the congestion control mechanism of TCP Vegas. We evaluate the performance of the proposed mechanism through numerical results of simulation experiments, and confirm that the proposed mechanism can improve the utilization of the satellite link and the fairness among multiplexed TCP connections, when compared with the traditional mechanisms.

  206. Design and Evaluation of Dynamic Resource Management Scheme for High-Performance Web Proxy Servers

    TERAI Tatsuhiko, OKAMOTO Takuya, HASEGAWA Go, MURATA Masayuki

    IEICE technical report. Information networks 2002/02/14

    More details Close

    In the current Internet, a significant amount of Web document transfer requests are through Web proxy servers. In this paper, we propose a new resource management scheme for Web proxy servers to improve their performance and to reduce Web document transfer time via the Web proxy servers. Our proposed scheme has two components. One is an enhanced E-ATBT (Equation-based Automatic TCP Buffer Tuning), which assigns send socket buffer to TCP connections on the proxy servers according to their characteristics and network condition. The other is a scheme that manages persistent TCP connections on Web proxy servers to avoid rejecting the newly arriving TCP connections due to lack of their resources. We validate an effectiveness of our proposed scheme through simulation experiments, We also discuss implementation issues of our proposed scheme on the actual Web proxy servers.

  207. 転送データサイズの違いによるTCPコネクション間の不公平性に関する一検討

    徳田 航一, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 2002/01/18

  208. Survey on Fairness Issues of Internet Flows

    HASEGAWA Go, MURATA Masayuki

    IEICE technical report. Information networks 2001/10/19

    More details Close

    In this paper, we survey the fairness issues in the congestion control mechanisms of TCP, which is one of most important service aspects in the current and future Internet. We first summarize characteristics and problems of the congestion control mechanism of TCP, RED and ECN mechanism, from a perspective of the fair service among connections. Several solution methods are next surveyed. Those are modifications of TCP congestion control mechanism and router support for achieving the fair service among TCP connections.

  209. The dynamic threthold control algorithm of RED for thousands of TCP flows

    HASEGAWA Go, ITAYA Natsuki, MURATA Masayuki

    IEICE technical report 2001/04/20

    More details Close

    In this paper, we first investigate the performance of RED and the traditional TD(Tail-Drop) routers when there are more than 1000 TCP connections in the network, especially in term of fairness among connections. The result is that RED can achieve better fairness than TD when its control parameters are appropriately tuned according to the network condition. However, when the parameters are not regulated properly, the performance of RED seriously degrades. That is, for the effective usage of RED, the control parameters must be set carefully. However, it is very difficult because the network condition varies largely, especially when the number of accommodated connections is large. In this paper, therefore, we propose dt-RED(RED with dynamic threshold control), which dynamically regulates the RED parameters according to the observed behavior of the RED queue. We confirm the effectiveness of the proposed algorithm through some simulation experiments, and the results show that it can provide better fairness than the original RED, and TD routers, without careful setting of the parameters.

  210. Implementation and Evaluation of SSBT for High-Performance Web Servers

    TERAI Tatsuhiko, OKAMOTO Takuya, HASEGAWA Go, MURATA Masayuki

    IEICE technical report. Information networks 2001/03/09

    More details Close

    Most of the researches have been concentrated on how to avoid and dissolve the network congestion, and only a few discussions on the performance improvement of the endhosts are recently made. We have already proposed a new architecture,which is called Scalable Socket Buffer Tuning (SSBT), to provide high performance and fair service for many TCP connections at the Internet endhosts. In this paper,we evaluate an effectiveness of our proposed algorithm through verious kinds of implementation experiments. In the experiments, we confirm the behavior and effectiveness of the SSBT through both transport-layer benchmark results and application-layer benchmark results. In the transport-layer tests, we use the native TCP data transfer to evaluate SSBT performance. In the application-layer tests, we use HTTP data transfer from the Web server which transfer the data by TCP, considering the Web traffic on the Internet.

  211. A Study on the implementation of ZL-RED mechanism on the Network Processor

    KURATA Kenji, HASEGAWA Go, MURATA Masayuki

    IEICE technical report. Information networks 2001/03/09

    More details Close

    In this paper, we propose a ZL-RED (Zombie Listed RED)algorithm, which ehhances a SRED algorithm to provide better fairness arnong many flows at the router buffer. ZL-RED uses the Zombie List, which is originally proposed by SRED, to detect mis-behaving flows which send packets at higher rate than orters. Then ZL-RED sets higher packet discarding probability to those mis-behaving fows.We evaluate an effectiveness of ZL-RED by simulation experiments, and shlow that ZL-RED can actually improve fairness among TCP connections. Furthermore, we discuss the implementation design of ZL-RED mechanism on thc network processor.

  212. More Results on ZL-RED for fairness enhancement between TCP Reno and Vegas

    KURATA Kenji, HASEGAWA Go, MURATA Masayuki

    Technical report of IEICE. SSE 2000/10/27

    More details Close

    In this paper, we propose ZL-RED(Zombie Listed RED)algorithm, which ehhances SRED algorithm to provide better fairness among many flows at the router buffer. ZL-RED uses the Zombie List, which is also used by SRED, to detect mis-behaving flows which send packets to the router at higher rate than the other flows, and sets larger packet discarding probability to those flows. We evaluate the effectiveness of ZL-RED by simulation experiments, and show that ZL-RED can improve fairness among TCP Reno connections and TCP Vegas connections, and that it can provide higher performance than SRED, even when the number of accommodated connections is large.

  213. ZL-RED mechanism for Fairness Improvement between TCP Reno and Vegas

    KURATA Kenji, HASEGAWA Go, MURATA Masayuki

    Technical report of IEICE. SSE 2000/06/30

    More details Close

    TCP Vegas version is expected to achieve higher throughput than TCP Tahoe and Reno versions, which are currently used in the Internet. However, we have revealed that when the traditional TCP Reno connections and TCP Vegas connections co-exist in the network, the throughput of TCP Vegas connections degrades significantly. In this paper, we propose ZL-RED(Zombie Listed RED), which memorizes flow informations of recently arrived packets in a fixed size table, and use the table to decide the discarding probabilities of arriving packets, to improve fairness between TCP Reno connections and TCP Vegas connections. We show the effectiveness of ZL-RED through some simulation experiments.

  214. TCP Vegas+ for Fairness Improvement between TCP Reno and TCP Vegas

    HASEGAWA Go, KURATA Kenji, MURATA Masayuki

    Technical report of IEICE. SSE 2000/05/26

    More details Close

    TCP Vegas version is expected to achieve higher throughput than TCP Tahoe and Reno versions, which are currently used in the Internet. However, we have revealed that when the traditional TCP Reno connections and TCP Vegas connections co-exists in the network, the through put of TCP Vegas connections degrades significantly. In this paper, we propose TCP Vegas+, which improved the congestion control algorithms of TCP Vegas, so that it can avoid such unfairness property between TCP Reno and TCP Vegas. TCP Vegas+ judges whether the competing TCP Reno connections exist in the network, and changes its behavior to increase its window size moderately/aggressively. We show the effectiveness of our TCP Vegas+ through some simulation experiments.

  215. Improvement of Processing Time at Endhosts for High-Speed Data Transfer by TCP

    TERAI Tatsuhiko, MATSUO Takahiro, HASEGAWA Go, MURATA Masayuki

    IEICE technical report. Information networks 2000/05/19

    More details Close

    Most of the researches have been concentrated on how to avoid and dissolve the network congestion, and only a few discussions on the performance improvement of the endhosts are recently made. In this paper, we focus on data transfer using TCP and analyze the details of TCP data transfer at the endhost. Through the analysis, we have found that memory access is the largest obstacle for performance improvement in TCP data transfer. Then we propose a new mechanism which reduces the number of memory access in TCP data transfer, and compose some of new socket system calls to avoid the redundant memory copy process. We further implement the proposed mechanism to the actual computers running FreeBSD, and show that the proposed mechanism can improve 30-50% of the transfer speed compared with the original mechanism through some experiments.

  216. スケーラビリティおよび公平性を考慮したTCPバッファ制御

    松尾 孝広, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 2000/03/09

  217. TCP RenoとTCP Vegasの混在環境における公平性の評価

    倉田 謙二, 長谷川 剛, 村田 正幸

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 1999/11/15

  218. Performance evaluation of packet scheduling algorithms for fair service among connections

    1999/09/28

  219. A Study on Memory Stored Fast Cell Search Algorithm for W-CDMA Mobile Station

    HASEGAWA Tsuyoshi, MATSUYAMA Koji, SHIMIZU Masahiko, TOZAWA Yoshiharu

    Proceedings of the Society Conference of IEICE 1999/08/16

  220. Performance evaluation of packet scheduling algorithms and improvement of RED algorithm for fair service among connections

    HASEGAWA Go, Matsuo Takahiro, MURATA Masayuki, MIYAHARA Hideo

    IEICE technical report. Information networks 1999/03/18

    More details Close

    In this paper, we investigate the performance of TCP under the packet scheduling algorithms of the router, in order to provide fair service among TCP connections sharing the network bandwidth. We consider the following four packet scheduling algorithms; FIFO, RED, and DRR, and DRR+. Based on the our previous results, we first propose derive the appropriate dropping probability of the RED algorithm according to each connection's input link capacity, in order to avoid the unfairness property of the original RED algorithm. We next evaluate the effects of Ill-behaved flow, which does not follow the congestion control algorithm of TCP in order to achieve higher throughput than the other connections.

  221. Fairness and Stability of Congestion Control Mechanism of TCP

    Rroceedings of IEEE INFOCOM '99 1999

  222. Effects of different propagation delays on congestion control mechanisms of TCP

    HASEGAWA Go, MURATA Masayuki, MIYAHARA Hideo

    Technical report of IEICE. SSE 1998/05/28

    More details Close

    In this paper, we will analytically investigate the fairness of the congestion control mechanisms of TCP in the network where each connection has a different propagation delay. We will focus on TCP Tahoe and TCP Reno, which are the popular versions in the current Internet, and TCP Vegas, which is proposed to improve throughput, and enhanced TCP Vegas, which is proposed in our previous work. We will find the results that the window size becomes proportional to the inverse of the propagation delay in TCP Tahoe and TCP Reno, and proportional to the propagation delay in TCP Vegas and enhanced TCP Vegas.

  223. Performance Evaluation of HTTP/TCP on Asymmetric Networks

    HASEGAWA Go, MURATA Masayuki, MIYAHARA Hideo

    Proceedings of 1998 CQR International WorkShop 1998/02/19

  224. Performance Evaluation of TCP on Asymmetric Networks

    HASEGAWA Go, MURATA Masayuki, MIYAHARA Hideo

    Technical report of IEICE. CQ 1997/12/19

    More details Close

    As the Internet users grows, new network services are emerging. Those includes ADSL and CATV Internet, which provide asymmetric bandwidth for uplink and downlink of the user's connection. In this paper, we investigate the TCP behavior on such asymmetric networks, and derive the analytic results of the TCP performance. Through numerical examples, it is shown that as the asymmetry of the network becomes large, the performance of TCP is significantly degraded. We further present how the various network parameters affect the TCP performance, and show the designing policy of TCP on the asymmetric network.

  225. A study on flow control and error recovery mechanism of TCP

    HASEGAWA Go, MURATA Masayuki, MIYAHARA Hideo

    IEICE technical report. Information networks 1997/04/09

    More details Close

    A recent development of an ATM network technology provides a large bandwidth, and ER(Explicit Rate) mode of the ATM ABR service can offer fixed-bandwidth. When we apply TCP, a most popular transport protocol in the current Internet, to such a service, we encounter several problems since TCP is essentially for the shared-bandwidth environment. In this paper, we focus on TCP's mis-retransmission, which is that TCP unnecessarily retransmits segments. We discuss a cause of such mis-retransmissions in depth and investigate how the performance is degraded. Then, a modification method of TCP is proposed and evaluated to show that performance degradation is avoided to the minimum by adding only fifteen lines in the source code of TCP sender.

  226. More results on Performance of TCP over ATM Networks

    HASEGAWA Go, OHSAKI Hiroyuki, MURATA Masayuki, MIYAHARA Hideo

    Technical report of IEICE. SSE 1996/03/14

    More details Close

    In this paper, the performance of TCP over ATM networks is evaluated using a simulation technique for the network where the multihop ATM switches are interconnected. In multihop networks, the unfairness among connections may become a problem due to the difference of the number of hops on the round trip times among connections. We first compare TCP over ABR, TCP over UBR with EPD (Early Packet Discard) and EPD per-VC accounting. The performance of TCP over ABR is degraded once the cell loss takes place. We then consider TCP over ABR with EPD and TCP over ABR with FEC (Forward Error Correction) for possible performance improvement. Last, the multimedia network environment is also considered by setting the model in which the VBR traffic co-exists in the network in addition to the ABR traffic.

  227. Performance Evaluation and Parameter Tuning of TCP over ABR Service in ATM Networks

    HASEGAWA Go, OHSAKI Hiroyuki, MURATA Masayuki, MIYAHARA Hideo

    Technical report of IEICE. SSE 1995/12/07

    More details Close

    In this paper, we exhibit performance of TCP protocol over ATM networks by using a simulation technique. We first compare rate-based control of ABR service and EPD applied to UBR service, and show that rate-control achieves better fairness and higher throughput in most circumstances. However, rate-based control requires careful tuning of control parameters to obtain its effectiveness. Then we show the appropriate parameter set suitable to TCP on ABR service, and point out that some modification of TCP may be necessary for further performance improvement.

Show all Show first 5

Research Projects 15

  1. ネットワーク内制御に基づくインターネット輻輳制御の新たなパラダイムの追求

    長谷川 剛

    Offer Organization: 日本学術振興会

    System: 科学研究費助成事業

    Category: 基盤研究(C)

    Institution: 東北大学

    2023/04/01 - 2026/03/31

    More details Close

    本研究では、今後ますます多様化し複雑になっていくインターネットにおいては、E2E の観測から得られる情報のみで理想的な輻輳制御を実現することは難しいと考え、新しい輻輳制御アーキテクチャである (in-network congestion control (NCC))を提案している。具体的には、送受信端末間の経路上に、輻輳制御を行うNCC ノードを1 つあるいはそれ以上導入することで、端末間のネットワークパスを複数のサブパスに分割し、複数のフィードバックループを構築する。さらに、分割されたサブパスごとに、そのネットワーク特性に応じた輻輳制御を行う。サブパスに分割することで伝搬遅延を小さく、複雑なネットワーク特性を単純化できるので、輻輳制御アルゴリズムの性能は大きく向上することが期待できる。また、サブパス単位で行われる輻輳制御は従来のE2E の輻輳制御と同じ仕組みで行われるので、NCC を用いることで、40 年以上にわたって培われてきた輻輳制御の利点を最大限に活かすことができる。 本年度の研究においては特に、ネットワーク内輻輳制御アーキテクチャの、大規模ネットワークを想定した環境における潜在的な性能評価を行い、NCC ノードの設置台数や設置方法、NCC ノード間のコネクションに用いる輻輳制御アルゴリズム等がデータ転送性能に与える影響を明らかにした。その結果、輻輳制御アルゴリズムの変更と、NCC ノードの導入台数の増加は、NCC ノードの導入割合に依存して、どちらが有利かが変化することも明らかとなった。さらに、NCC ノードを設置するネットワークノードを選択する手法によっては、データ転送性能に最大で約24% の違いが出ることがわかった。

  2. バッファリング遅延ゼロ・100%リンク利用率を達成する理想的な輻輳制御の追求

    内海 哲史, 長谷川 剛

    Offer Organization: 日本学術振興会

    System: 科学研究費助成事業

    Category: 基盤研究(C)

    Institution: 福島大学

    2020/04/01 - 2023/03/31

    More details Close

    【具体的内容】本研究では、遅延時間が小さく、100%の回線利用率を達成する理想的な輻輳制御アルゴリズムを実現することを目的とする。具体的には、バッファブロートと呼ばれる、遅延時間が数秒クラスに増大する輻輳問題に着目する。従来の輻輳制御アルゴリズムでは用いられていないネットワーク計測手法を活用し、数学的理論に基づいて輻輳状態を正確に推定する。その結果を、新たな輻輳制御アルゴリズムへ応用する。提案手法の有効性を数学的に保証すると共に、コンピュータシミュレーション及び実ネットワーク環境下での実験により実用性の検証を行った。2020年度までは、我々の提案するアルゴリズム(提案アルゴリズム)の性能評価がシミュレーション実験にとどまっていたが、実機実験による性能評価を実施できるように、提案アルゴリズムのオペレーティングシステム(OS)への実装も進めた。また、2021年度からは、2020年度までの研究を発展させ、従来型の輻輳制御アルゴリズムであるCUBICと、遅延を抑える輻輳制御アルゴリズムであるBBRとの競合時における公平性の問題についても研究を進め、成果を挙げた。 【意義】提案アルゴリズムの実機での実現可能性を示唆した。また、Google社が2016年に発表した遅延を抑える輻輳制御アルゴリズムであるBBRと、現在のインターネットにおいてもっとも普及している輻輳制御アルゴリズムであるCUBICとのスループット公平性を改善することに成功し、BBRや提案アルゴリズムの普及に寄与すると考える。 【重要性】提案アルゴリズムが、シミュレーション上における実装や理論上にとどまらず、実機実装でも高性能を実現できることを確認している。また、異種輻輳制御アルゴリズム間の公平性改善の方法について、解析的手法に基づいたフレームワーク(枠組み)を与えることができたと考える。

  3. Researches on mobile core network architecture for beyond 5G

    Hasegawa Go

    Offer Organization: Japan Society for the Promotion of Science

    System: Grants-in-Aid for Scientific Research

    Category: Grant-in-Aid for Scientific Research (C)

    Institution: Tohoku University

    2019/04/01 - 2022/03/31

    More details Close

    This research aims to establish a mobile core network architecture that can flexibly and efficiently accommodate network services such as ultra-high-speed communications regardless of location, high-volume and diverse IoT applications, and ultra-low latency communications required for automated driving technology, etc., in anticipation of the Beyond 5G era. A method of balancing the resource utilization of the servers in the mobile core network and improving the number of units that can be accommodated by making minor changes to the signaling protocol and dynamically adjusting parameters, as well as the utilization of server resources in the mobile core network and the protocol for allocating wireless resources to terminals. Through the analysis, we analyzed the time it takes for a terminal to transmit data.

  4. Constructing NFV service architecture based on biochemical reaction model

    Hasegawa Go

    Offer Organization: Japan Society for the Promotion of Science

    System: Grants-in-Aid for Scientific Research

    Category: Grant-in-Aid for Scientific Research (C)

    Institution: Osaka University

    2015/04/01 - 2019/03/31

    More details Close

    In Network Function Virtualization (NFV), various Virtual Network Functions (VNFs) are deployed on general purpose servers. To operate the NFV system, placement of VNFs on servers, resource allocation to each VNF, and flow routes are determined adaptively. Furthermore, to respond to environmental fluctuations, and to maintain the scalability of the NFV services, a distributed control is more feasible than a centralized one. One way to achieve such behaviors is to exploit a biochemical mechanism with autonomous dispersibility and self organization. In this work, we has proposed a construction method of service space in virtualized network system based on biochemically inspired tuple space model. In this method, the behaviors in the virtualized network system are described by biochemical reactions in tuple spaces. To operate the NFV system, the method has been extended to handle flow routes in accordance with SFC requests, and server resource limitation.

  5. Transport-layer architecture for maximizing the power saving performance of wireless network devices

    Go Hasegawa

    Offer Organization: Japan Society for the Promotion of Science

    System: Grants-in-Aid for Scientific Research

    Category: Grant-in-Aid for Scientific Research (C)

    Institution: Osaka University

    2012/04/01 - 2016/03/31

    More details Close

    In this work, the modification to the transport layer protocol is considered to effectively exploit the power saving functions of wireless network devices and protocols. In detail, based on the power saving profile of wireless devices such as start-up/sleeping time and power consumption values, the packet transmission timings are controlled with consideration of lower-layer protocols at wireless devices for power savings. The effectiveness of the proposed method is confirmed through computer simulations and experimentations with actual wireless network devices.

  6. Researches on transport-layer services based on inline network measurement technologies

    HASEGAWA Go

    Offer Organization: Japan Society for the Promotion of Science

    System: Grants-in-Aid for Scientific Research

    Category: Grant-in-Aid for Scientific Research (C)

    Institution: Osaka University

    2007 - 2009

    More details Close

    I construct a robust, selfadaptive, scalable, and robust congestion control mechanism for TCP named as TCP Symbiosis. The largest difference of our proposed mechanism from existing TCP variants is that I borrowed algorithms from biophysics to update the window size : the logistic growth model and the Lotka-Volterra competition model. I treat the competitive relationship among species in biophysics models as the bandwidth sharing among competing TCP connections in the Internet. I then enhance the congestion control mechanism to to deal with the environmental changes, by adding the noise term to Lotka-Volterra competition model equation and adaptively setting control parameters. I investigate the effectiveness of the proposed mechanisms by both simulation and implementation experiments and confirm that TCP Symbiosis can privide high performance regardless of the network bandwidth delay product, and survive against measurement errors and sudden environmental changes.

  7. Implementation and evaluation of simultaneous readout of huge quantities of electronic tags

    NAKANO Hirotaka, HASEGAWA Go, SASABE Masahiro

    Offer Organization: Japan Society for the Promotion of Science

    System: Grants-in-Aid for Scientific Research

    Category: Grant-in-Aid for Scientific Research (B)

    Institution: Osaka University

    2007 - 2008

  8. Network control methods for information networks having power-law degree distribution

    MURATA Masayuki, TAKINE Tetsuya, WAKAMIYA Naoki, HASEGAWA Go, ARAKAWA Shinichi, SASABE Masahiro

    Offer Organization: Japan Society for the Promotion of Science

    System: Grants-in-Aid for Scientific Research

    Category: Grant-in-Aid for Scientific Research (A)

    Institution: Osaka University

    2006 - 2008

  9. Establishment of Networking Technologies for Meta Information Environment

    IMASE Makoto, MURATA Masayuki, WAKAMIYA Naoki, HASEGAWA Go, TADA Harumasa, AIDA Masaki

    Offer Organization: Japan Society for the Promotion of Science

    System: Grants-in-Aid for Scientific Research

    Category: Grant-in-Aid for Scientific Research (A)

    Institution: Osaka University

    2004 - 2007

    More details Close

    1: Ad-hoc networks for the meta-in formation environment 1-1 : Routing which maximizes the network connectivity (Makoto Imase, Harumasa Tada) We proposed routing algorithms to maximize the network connectivity taking into account unidirectional links and to support various type of communication, taking inspiration from the foraging behavior of ants, and showed that the adaptability and robustness of our proposals outperformed the existing protocols. 1-2 : Congestion control mechanisms for mobile ad-hoc network environment (Go Hasegawa) We developed an inline network measurement method, which utilizes data and acknowledgement packets of an active TCP connection for packet interval-based bandwidth measurement of a network path. We then proposed a novel congestion control mechanisms on the inline measurement method. In addition, we introduced a new transport-layer service, which is the background transfer service, which is also based on the proposed measurement technique. 1-3 Information management mechanism for ad hoc networks (Masaki Aida) To improve scalability and tolerance against changes of network topology in sensor networks, we proposed a new node placement algorithm and verified its performance in saving energy consumption. Also, we showed that a combination of the algorithm and an aggregation routing improves the tolerance of networks. In addition, we proposed a new stability analysis of systems that takes user behaviors into consideration. -2 : Sensor networks for the meta-information environment 2-1 : Energy-efficient routing (Masayuki Murata) 2-1: Energy-efficient routing (Masayuki Murata) We proposed a communication mechanism which autonomously generated energy-efficient communication patterns by adopting the traveling-wave phenomena in the pulse-coupled oscillator model and showed its effectiveness through simulation and practical experiments. 2-2: Data gathering (Naoki Wakamiya) We proposed a control scheme which gathered sensor information in an energy-efficient way under usual conditions and transmitted urgent information in a fast and reliable way under emergent conditions and showed its effectiveness through simulation and practical experiments.

  10. 10Gbpsのスループットを達成する真にスケーラブルなTCPの輻輳制御方式の開発

    長谷川 剛

    Offer Organization: 日本学術振興会

    System: 科学研究費助成事業

    Category: 若手研究(A)

    Institution: 大阪大学

    2004 - 2006

    More details Close

    今年度の研究においては、昨年度までに提案した輻輳制御手法の性能評価を実装し、実ネットワークにおける性能評価を行った。提案方式は、開発した高速ネットワークにおける計測手法を用いて、利用可能帯域および物理帯域を取得する方式と、提案手法を組み合わせ、提案手法が1Gbpsを超えるネットワークにおいて高いスループットを得るものである。 提案方式が持つウィンドウサイズ制御のアルゴリズムは、帯域に関する情報を用いることによってウィンドウサイズを適切な値にすばやく調節すること、および他のコネクションが競合する際に公平に帯域を分配できることを目的として設計している。そのために、数理生態学において生物の個体数の変化を表すモデルとして有名なロジスティック増殖モデル、およびロトカ・ヴォルテラ競争モデルを適用した。これらのモデルをTCPのウィンドウサイズ制御へ適用するために、生物の個体数をデータ転送速度に、個体数の収束値である環境容量を物理帯域に、および種間の競争を同一リンク上の複数コネクションの競合にそれぞれ変換した。 本年度の研究では、研究室内の小規模実験ネットワーク、また、大阪・東京間および大阪・米国カリフォルニア間の公衆インターネット環境を用いて、データ転送実験を行った。その結果、インライン計測によって正確な利用可能帯域の値が得られる場合には、低速・低遅延環境においても十分な性能を発揮できること。また、高速・高遅延ネットワーク環境においては、計測精度が低下したとしても、従来手法に比べて最大で100%のスループット向上を達成できることがわかった。

  11. Researches on Inline Network Measurement Mechanisms for Service Overlay Networks

    MURATA Masayuki, HASEGAWA Go, ATA Shingo

    Offer Organization: Japan Society for the Promotion of Science

    System: Grants-in-Aid for Scientific Research

    Category: Grant-in-Aid for Scientific Research (A)

    Institution: Osaka University

    2003 - 2005

    More details Close

    In this Research, we first introduce a new bandwidth measurement algorithm that can perform measurement estimates quickly and continuously and is suitable for inline measurement because of the smaller number of probe packets required and the negligible effect on other network traffic. We then show how the algorithm is applied in TCP through a modification to the TCP sender only. We also present a system we designed for storing measurement results from which an application can retrieve results data for any time scale. In addition, we present examples in which TCP data transmission performance is improved by using the measurement results. We then propose ImTCP-bg (ImTCP background mode), a new TCP-based background data transfer mechanism. ImTCP-bg sets the upper limit of the congestion window size of the sender TCP based on the results of ImTCP, an inline network measurement technique which measures the available bandwidth of the network path between the sender and receiver hosts from data/ACK packets transmitted by active TCP connections in an inline fashion. ImTCP-bg can provide background data transfer without affecting competing traffic, whereas previous methods cannot avoid network congestion. ImTCP-bg also employs an enhanced RTT-based mechanism so that ImTCP-bg can detect and resolve network congestion, even when reliable measurement results cannot be obtained. We finally introduce ICIM (Interrupt Coalescence -aware inline measurement), a new bandwidth measurement approach that overcomes these two problems. ICIM utilizes the data packets of an active TCP connection for the measurement. In order to determine the available bandwidth, rather than adjusting the packet transmission intervals, the TCP sender instead adjusts the number of packets involved in a burst and checks whether the inter-intervals of the bursts of corresponding ACK packets are increased or not. Simulation results show that ICIM can measure the bandwidth as high as some Gbps while requiring a number of data packets that is only 1/100 of that of the existing stream-based algorithm.

  12. 高機能・高性能フロー処理方式の提案とネットワークプロセッサ上での実装と評価

    長谷川 剛

    Offer Organization: 日本学術振興会

    System: 科学研究費助成事業

    Category: 若手研究(B)

    Institution: 大阪大学

    2001 - 2002

    More details Close

    本年度の研究においては、昨年度の研究において提案し、基礎的な評価を行った、RED(Random Early Detection)方式のパラメータを自動的かつ動的に設定するdt-RED方式のさらなる評価を行った。その結果、広いネットワークパラメータ領域において、オリジナルのRED方式よりも高いスループットおよびフロー間の公平性を満たすことができ、RED方式の最大の欠点であるパラメータ設定問題を解決することができることを明らかにした。 また、ルータにおける高機能なフロー処理方式として、ユーザ間の公平性のみではなく、転送ドキュメントサイズによるスループットの不公平の解消を目的とした、バッファにおけるパケット処理方式の提案を行った。本検討においては、まずTCPを用いてドキュメントを転送する際に、そのサイズによってスループットに大きな不公平が発生することを、コンピュータ上のシミュレーションおよび数学的解析によって検討を行った。その結果、Webドキュメントの大半を占める、サイズの小さなドキュメント転送の際のスループットが、非常に小さいことが明らかとなった。そこで、この不公平を解消するために、ルータにおいて各TCPフローの転送パケット数を監視し、その量に応じてパケット廃棄確率を変化させることによって、ドキュメントサイズによるスループットの不公平性を解消する方式を提案した。その結果、非常に軽量なアルゴリズムを用いて、不公平性をほとんど完全に解消できることを明らかにした。 また、これらの方式をネットワークプロセッサシステムIXP1200上に実装するための基礎的検討として、IXP1200によってTCPコネクションを取り扱う際のオーバヘッド、処理能力に関する評価を行った。その結果、将来ネットワークプロセッサが高速化することによって、現実的な処理速度で、ネットワークブロセッサ上でTCPパケットを処理することが可能であることを示した。

  13. Research on high-performance end-system architecture with high-speed data transfer mechanism

    MURATA Masayuki, HASEGAWA Go

    Offer Organization: Japan Society for the Promotion of Science

    System: Grants-in-Aid for Scientific Research

    Category: Grant-in-Aid for Scientific Research (B)

    Institution: Osaka University

    2001 - 2002

    More details Close

    Although many research efforts have been devoted to the network congestion against an increase of the Internet traffic, only a few discussions are recently made on the performance improvement of the endhosts. In this paper, we propose a new architecture, which is called Scalable Socket Buffer Tuning (SSBT), to provide high performance and fair service for many TCP connections at the Internet endhosts. SSBT has two major features. The one is the Equation-based Automatic TCP Buffer Tuning (E-ATBT), where the sender host estimates 'expected' throughput of the TCP connections through a simple mathematical equation, and assigns the send socket buffer to them according to the estimated throughput. The other is to reduce the number of memory accesses at the sender host by using some of new system calls, which is called Simple Memory-copy Reduction (SMR) scheme. We confirm an effectiveness of our proposed algorithm through the implementation experiments, and we have found that our SSBT can achieveup to 30% gain of the Web server throughput, and the fair and effective usage of the sender socket buffer can be achieved. Furthermore, we propose a new resource management scheme for proxy servers to improve theirperformance and to reduce Web document transfer time via the proxy servers. Our proposed scheme has the following two components. One is an enhanced EATBT, which is an enhancement version of our previous SSBT for proxy servers by taking account of different characteristics among TCP connections. The other is a scheme that manages persistent TCP connections at proxy servers to avoidnewly arriving TCP connections from being rejected due to lack of resources. We validate an effectiveness of our proposed scheme through simulation experiments, and confirm that it can manage proxy server resources effectively.

  14. 高連トランスポート層プロトコルに関する研究 Competitive

  15. Study on High-Speed transport-layer protocols Competitive

Show all Show first 5

Works 12

  1. ネットワーキングハードウェアの徹底したスライス化に基づく省電力カルータアーキテクチャの研究開発

    2010 -

  2. 新世代NWにおけるトラヒックエンジニアリング・自律分散制御の研究

    2009 -

  3. 生体ゆらぎに学ぶ知的人工物と情報システム

    2008 -

  4. べき乗則に従うトポロジーを有する情報ネットワークのための新しい制御方式の確立

    2008 -

  5. べき乗則に従うトポロジーを有する情報ネットワークのための新しい制御方式の確立

    2007 -

  6. べき乗則に従うトポロジーを有する情報ネットワークのための新しい制御方式の確立

    2006 -

  7. サービスオーバーレイネットワークのためのインラインネットワーク計測技術の確立

    2005 -

  8. サービスオーバーレイネットワークのためのインラインネットワーク計測技術の確立

    2004 -

  9. ユビキタスインターネットのための高位レイヤスイッチング技術の研究開発

    2004 -

  10. サイバーソサエティ実現のための仮想網技術

    2004 -

  11. メタ情報環境を実現するネットワーキング技術の確立

    2004 -

  12. 10Gbpsのスループットを達成する真にスケーラブルなTCPの輻輳制御方式の開発

    2004 -

Show all ︎Show first 5