Updated on 2025/09/30

写真a

 
MIYOSHI NAOTO
 
Organization
School of Computing Professor
Title
Professor
External link

Degree

  • 博士 (工学) ( 京都大学 )

Research Interests

  • オペレーションズ・リサーチ

  • Theory of probability

  • 確率論

  • Operations research

Research Areas

  • Informatics / Mathematical informatics

Education

  • Kyoto University   Graduate School, Division of Engineering

    - 1994

      More details

  • Kyoto University

    - 1994

      More details

    Country: Japan

    researchmap

  • Kyoto University   Faculty of Engineering

    - 1989

      More details

    Country: Japan

    researchmap

Research History

  • Institute of Science Tokyo   School of Computing   Professor

    2024.10

      More details

  • Tokyo Institute of Technology   School of Computing   Professor

    2016.4 - 2024.9

      More details

  • Tokyo Institute of Technology   Graduate School of Information Science and Engineering   Professor

    2012.10 - 2016.3

      More details

  • Tokyo Institute of Technology   Graduate School of Information Science and Engineering   Associate Professor

    2007.4 - 2012.9

      More details

  • Tokyo Institute of Technology   Graduate School of Information Science and Engineering   Associate Professor

    2004.5 - 2007.3

      More details

  • Tokyo Institute of Technology   Graduate School of Information Science and Engineering   Associate Professor (Lecturer)

    1998.11 - 2004.4

      More details

  • Kyoto University   Graduate School of Informatics   Assistant Professor

    1998.4 - 1998.10

      More details

  • Kyoto University   Graduate School of Engineering   Assistant Professor

    1996.4 - 1998.3

      More details

  • Kyoto University   Faculty of Engineering   Assistant Professor

    1994.6 - 1996.3

      More details

▼display all

Professional Memberships

▼display all

Committee Memberships

  • 日本オペレーションズ・リサーチ学会   副会長  

    2023.4 - 2025.4   

      More details

    Committee type:Academic society

    researchmap

  • 日本オペレーションズ・リサーチ学会   研究普及委員  

    2021.4 - 2023.3   

      More details

    Committee type:Academic society

    researchmap

  • 日本オペレーションズ・リサーチ学会   研究普及理事  

    2019.4 - 2021.3   

      More details

    Committee type:Academic society

    researchmap

  • 日本オペレーションズ・リサーチ学会   表彰委員  

    2018.4   

      More details

    Committee type:Academic society

    researchmap

  • 日本オペレーションズ・リサーチ学会   待ち行列研究部会主査  

    2014.4 - 2016.3   

      More details

    Committee type:Academic society

    researchmap

  • 日本オペレーションズ・リサーチ学会   代議員  

    2010.4 - 2012.3   

      More details

    Committee type:Academic society

    researchmap

  • 日本オペレーションズ・リサーチ学会   論文誌編集委員  

    2008.4 - 2012.3   

      More details

    Committee type:Academic society

    researchmap

  • 日本オペレーションズ・リサーチ学会   研究普及委員  

    2005.4 - 2011.3   

      More details

    Committee type:Academic society

    researchmap

  • 日本オペレーションズ・リサーチ学会   待ち行列研究部会幹事  

    2000.4 - 2002.3   

      More details

    Committee type:Academic society

    researchmap

▼display all

Papers

▼display all

MISC

  • 空間点過程に対するヌヴーの交換公式と無線ネットワークへの応用 Invited

    三好 直人

    オペレーションズ・リサーチ(経営の科学)   67 ( 5 )   235 - 241   2022.5

     More details

    Authorship:Lead author, Last author, Corresponding author   Language:Japanese   Publishing type:Article, review, commentary, editorial, etc. (scientific journal)  

    researchmap

  • 整理券付き待ち行列

    車塚 彩菜, 矢島 萌子, 三好 直人

    オペレーションズ・リサーチ (経営の科学)   66 ( 9 )   600 - 606   2021.9

     More details

    Authorship:Last author   Language:Japanese   Publishing type:Article, review, commentary, editorial, etc. (scientific journal)  

    researchmap

  • 東京工業大学情報理工学院数理・計算科学系—情報の未来を作り出す数理的アプローチを探究する—

    金森 敬文, 樺島 祥介, 高安 美佐子, 中野 張, 福田 光浩, 三好 直人, 山下 真, 渡邊 澄夫

    オペレーションズ・リサーチ (経営の科学)   64 ( 1 )   31 - 32   2019.1

     More details

    Language:Japanese   Publishing type:Article, review, commentary, editorial, etc. (scientific journal)  

    researchmap

  • 空間確率モデルを用いた無線干渉場のスケール極限 Invited

    オペレーションズ・リサーチ (経営の科学)   63 ( 8 )   487 - 492   2018.8

     More details

    Language:Japanese   Publishing type:Article, review, commentary, editorial, etc. (scientific journal)  

    researchmap

    Other Link: http://orcid.org/0000-0001-9887-0933

  • セルラネットワークの空間確率モデル Invited

    三好 直人

    電子情報通信学会誌   100 ( 4 )   280 - 286   2017.4

     More details

    Publisher:電子情報通信学会  

    researchmap

  • 待ち行列理論を用いた駐車場共同利用の評価 Invited

    牛垣 龍一, フンドック トゥアン, 三好 直人

    オペレーションズ・リサーチ (経営の科学)   61 ( 10 )   690 - 691   2016.10

     More details

    Language:Japanese   Publishing type:Article, review, commentary, editorial, etc. (scientific journal)  

    researchmap

  • セルラネットワークの空間点過程モデル Invited

    Miyoshi Naoto

    オペレーションズ・リサーチ (経営の科学)   59 ( 11 )   678 - 683   2014.11

     More details

    Language:Japanese  

    CiNii Books

    researchmap

  • 待ち行列への点過程アプローチ: 入門編 Invited

    三好 直人

    オペレーションズ・リサーチ   59 ( 4 )   212 - 218   2014.4

     More details

    Language:Japanese  

    CiNii Books

    researchmap

  • BS-6-4 A STOCHASTIC GEOMETRY MODEL FOR UPLINK CELLULAR NETWORKS

    Kobayashi Takuya, Miyoshi Naoto

    Proceedings of the IEICE General Conference   2014 ( 2 )   "S - 194"-"S-195"   2014.3

     More details

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

    CiNii Books

    researchmap

  • 2-B-8 セルラ無線通信網における被覆確率のPade近似(情報・通信(1))

    永松 平, 三好 直人

    日本オペレーションズ・リサーチ学会秋季研究発表会アブストラクト集   2013   164 - 165   2013.9

     More details

    Language:Japanese   Publisher:公益社団法人日本オペレーションズ・リサーチ学会  

    CiNii Books

    researchmap

  • 2-F-8 セルラネットワークにおける上りリンクの確率幾何モデル(待ち行列(3))

    小林 拓矢, 三好 直人

    日本オペレーションズ・リサーチ学会春季研究発表会アブストラクト集   2013   252 - 253   2013.3

     More details

    Language:Japanese   Publisher:公益社団法人日本オペレーションズ・リサーチ学会  

    CiNii Books

    researchmap

  • 1-E-1 ユーザーによる干渉を考慮したセルラネットワークの幾何確率モデル(特別セッション 待ち行列と確率モデル(1))

    小林 拓矢, 三好 直人, 宮田 純子

    日本オペレーションズ・リサーチ学会秋季研究発表会アブストラクト集   2012   74 - 75   2012.9

     More details

    Language:Japanese   Publisher:公益社団法人日本オペレーションズ・リサーチ学会  

    CiNii Books

    researchmap

  • 2-D-4 Odds theorem in Markov-dependent trials with multiple selection chances

    ANO Katsunori, KAKIE Nobuhiro, MIYOSHI Naoto

    2011   192 - 193   2011.3

     More details

    Language:English   Publisher:The Operations Research Society of Japan  

    CiNii Books

    researchmap

  • Odds theorem in Markov-dependent trials with multiple selection chances (Decision making problems with uncertainty)

    Ano Katsunori, Kakie Nobuhiro, Miyoshi Naoto

    RIMS Kokyuroku   1734   212 - 219   2011.3

     More details

    Language:English   Publisher:Kyoto University  

    CiNii Books

    researchmap

    Other Link: http://hdl.handle.net/2433/170758

  • 確率モデルのシミュレーションにおける摂動解析法 Invited

    Miyoshi Naoto

    55 ( 11 )   720 - 722   2010.11

     More details

    Language:Japanese  

    CiNii Books

    researchmap

  • Multiple Sums-the-Odds Theorem (Decision Making Processes under Uncertainty and Ambiguity)

    Ano Katsunori, Kakinuma Hideo, Miyoshi Naoto

    RIMS Kokyuroku   1682   41 - 49   2010.4

     More details

    Language:English   Publisher:Kyoto University  

    CiNii Books

    researchmap

    Other Link: http://hdl.handle.net/2433/141405

  • On Scalability of Per-Flow QoS Evaluation in CoMPACT Monitor

    MURAKI Tsunehiko, AIDA Masaki, MIYOSHI Naoto

    IEICE technical report   106 ( 578 )   495 - 500   2007.3

     More details

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

    To achieve per-flow QoS measurement, the authors proposed a new technique, called the CoMPACT Monitor, which is based on the change-of-measure framework in probability/measure theory and transforms actively obtained information by using passively monitored data. This technique enables us to concurrently measure one-way delay information about individual users, applications and organizations in detail in a lightweight manner. The CoMPACT Monitor is scalable in the sense that the monitoring system does not become too complicated even if the number of the target flows sharing the same path increases. In this report, we demonstrate the scalability by verifying effectiveness of CoMPACT Monitor in the environment in which the number of target flows is 1,000.

    CiNii Books

    researchmap

  • On Mathematical Formulation of CoMPACT Monitor for Nonstationary User Traffic

    AIDA Masaki, MIYOSHI Naoto, ISHIBASHI Keisuke, KURIBAYASHI Shin-ichi

    IEICE technical report. Information networks   102 ( 561 )   59 - 64   2003.1

     More details

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

    To realize a scalable and lightweight QoS monitoring system, we have proposed a new QoS monitoring technique, Change-of-Measure based Passive/Active Monitoring (CoMPACT Monitor). In our previous studies, we have shown that theoretical formulation of CoMPACT Monitor for the stationary user traffic. We also have shown characteristics of CoMPACT Monitor with respect to implementation issues by using a simple simulation model. To generalize the results to more realistic network environment from both theoretical and practical points of view, this paper shows the mathematical formulation of CoMPACT Monitor for nonstationary user traffic, and characteristics fo CoMPACT Monitor with respect to the network model with multiple paths and bottlenecks.

    CiNii Books

    researchmap

  • On Mathematical Formulation of Change-of-Measure based Passive/Active Monitoring (CoMPACT Monitor)

    AIDA Masaki, MIYOSHI Naoto

    IEICE technical report. Information networks   102 ( 131 )   31 - 37   2002.6

     More details

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

    To realize a scalable and light-weight QoS monitoring system, we have proposed a new QoS monitoring method, Change-of-Measure based Passive/Active Monitoring (CoMPACT Monitor). This method enables us to measure detailed QoS information for individual users, applications, and organizations. In this paper, we show the mathematical foundation of the CoMPACT Monitor by using the Palm distribution. In addition, we show characteristics of the CoMPACT Monitor through simulations.

    CiNii Books

    researchmap

  • シミュレーションによる勾配推定の手法 Invited

    Miyoshi Naoto

    46 ( 4 )   182 - 187   2001.4

     More details

    Language:Japanese  

    CiNii Books

    researchmap

  • On a Change-of-Measure Algorithm for Rare-Event Estimation by Simulations

    MIYOSHI Naoto

    IEICE technical report. Information networks   99 ( 127 )   41 - 47   1999.6

     More details

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

    The importance sampling (IS) is well krnown as an effective technique to estimate rare-event probabilities via computer simulations. The main idea of IS is to change the probability distribution (change of measure) and make the event occurrence, which is originally rare, more frequent. In the IS setting, the choie of good distribution is crucial but the class of simulation models for which the optimal IS distribution is analytically calculated seems limited. In this note, we introduce some recent techniques to find (estimate) the optimal IS distribution through the simulation-based optimization approach.

    CiNii Books

    researchmap

  • 待ち行列モデルに対する摂動解析法 Invited

    Miyoshi Naoto

    Bulletin of the Japan Society for Industrial and Applied Mathematics   9 ( 2 )   14 - 23   1999.6

     More details

    Language:Japanese   Publisher:The Japan Society for Industrial and Applied Mathematics  

    Perturbation analysis (PA) has evolved as a method for estimating performance gradients with respect to the parameters of stochastic discrete event systems, and particularly queueing systems, using the infomation extracted from a single observed sample path. This article uses a simple single-server queueing model to give an introduction to PA and illustrate the basic theoretical issues, unbiasedness and strong consistency, involved in this field. We develop the principle of infinitesimal PA (IPA) in terms of evaluating the derivatives of sample functions and using them as estimators of performance derivatives. We then present the idea of "smoothing by conditioning" and discuss recent extensions to smoothed PA (SPA).

    DOI: 10.11540/bjsiam.9.2_114

    CiNii Books

    researchmap

  • 確率的なシステムに対する Ordinal Optimization の考え方 Invited

    Miyoshi Naoto

    Systems, control and information   43 ( 3 )   149 - 152   1999.3

     More details

    Language:Japanese   Publisher:Institute of Systems, Control and Information Engineers  

    CiNii Books

    researchmap

  • 摂動解析法による確率離散事象システムの勾配推定 Invited

    Miyoshi Naoto

    Systems, control and information   42 ( 8 )   440 - 446   1998.8

     More details

    Language:Japanese   Publisher:Institute of Systems, Control and Information Engineers  

    CiNii Books

    researchmap

  • ハキリアリの収穫行動のモデル Invited

    Miyoshi Naoto

    43 ( 5 )   287 - 288   1998.5

     More details

    Language:Japanese  

    CiNii Books

    researchmap

▼display all

Presentations

  • 測度変換型品質測定技術によるフロー毎品質推定のスケーラビリティ評価

    電子情報通信学会 情報ネットワーク研究会  2007 

     More details

  • Scale-free interval graphs generated by immigration-death processes

    2008 International Workshop on Applied Probability (IWAP 2008)  2008 

     More details

  • Scale-free interval graphs

    4th International Conference on Algorithmic Aspects in Information and Management (AAIM 2008)  2008 

     More details

  • Scale Free Interval Graphs

    2007 

     More details

    Presentation type:Poster presentation  

    researchmap

  • 無限サーバ待ち行列がつくるスケールフリー区間グラフ: クラスタ係数の評価

    日本オペレーションズ・リサーチ学会2008年秋季研究発表会  2008 

     More details

  • Scale free interval graphs

    2008 

     More details

  • 無限サーバ待ち行列がつくるスケールフリー区間グラフ

    日本オペレーションズ・リサーチ学会2008年春季研究発表会  2008 

     More details

  • Zipf型頻度分布をもつボールとビンの確率モデルにおける寸法指標の極限分布

    日本オペレーションズ・リサーチ学会待ち行列研究部会第206会例会  2008 

     More details

  • Scale free interval graphs

    The First Asian Association for Algorithms and Computation Annual Meeting (AAAC08)  2008 

     More details

  • P2Pネットワークにおける確率的フラッディングの効果について

    待ち行列シンポジウム「確率モデルとその応用」  2008 

     More details

  • On-line derivative estimation for the GI/G/1 queue with multiple vacations and Bernoulli service discipline

    14th International Teletraffic Congress  1994 

     More details

  • Perturbation analysis for the GI/G/1 queue with two priority classes

    11th International Conference on Analysis and Optimization of Systems  1994 

     More details

  • Perturbation analysis for the GI/G/1 queue with two priority classes

    11th International Conference on Analysis and Optimization of Systems  1994 

     More details

  • Smoothed perturbation analysis estimates for stationary multi-class queues

    34th IEEE Conference on Decision and Control  1995 

     More details

  • Sample path optimization with respect to input fraction of two job classes in queues

    Third European Control Conference  1995 

     More details

  • On-line derivative estimation for the GI/G/1 queue with multiple vacations and Bernoulli service discipline

    14th International Teletraffic Congress  1994 

     More details

  • Sensitivity analysis of the loss probability in a stationary gradual queue for high-speed networks

    IEEE INFOCOM '97  1997 

     More details

  • Sensitivity analysis of the loss probability in a stationary gradual queue for high-speed networks

    IEEE INFOCOM '97  1997 

     More details

  • Smoothed perturbation analysis estimates for stationary multi-class queues

    34th IEEE Conference on Decision and Control  1995 

     More details

  • Sample path optimization with respect to input fraction of two job classes in queues

    Third European Control Conference  1995 

     More details

  • Weak stationary solution of a G/G/1/infinity queue controlled by IPA-based SA with constant stepsize

    37th IEEE Conference on Decision and Control  1998 

     More details

  • Weak stationary solution of a G/G/1/infinity queue controlled by IPA-based SA with constant stepsize

    37th IEEE Conference on Decision and Control  1998 

     More details

  • Sensitivity estimation of the cell-delay in the leaky bucket traffic filter with stationary gradual input

    4th International Workshop on Discrete Event Systems  1998 

     More details

  • Scale Free Interval Graphs

    2007 

     More details

    Presentation type:Poster presentation  

    researchmap

  • Multiple sums-the-odds theorem

    2009 

     More details

  • Subexponential interval graphs generated by immigration-death processes

    2009 

     More details

    Presentation type:Poster presentation  

    researchmap

  • 2Qアルゴリズムのヒット率最大化

    待ち行列シンポジウム「確率モデルとその応用」  2009 

     More details

  • Scale-free interval graphs generated by immigration-death processes

    2008 International Workshop on Applied Probability (IWAP 2008)  2008 

     More details

  • Scale-free interval graphs

    4th International Conference on Algorithmic Aspects in Information and Management (AAIM 2008)  2008 

     More details

  • Limiting size index distributions for Zipf-type word frequencies

    2008 

     More details

    Presentation type:Poster presentation  

    researchmap

  • Limiting size index distributions for Zipf-type word frequencies

    2008 

     More details

    Presentation type:Poster presentation  

    researchmap

  • Multiple sums-the-odds theorem

    2009 

     More details

  • Scale free interval graphs

    The First Asian Association for Algorithms and Computation Annual Meeting (AAAC08)  2008 

     More details

  • Scale free interval graphs

    2008 

     More details

  • Subexponential interval graphs generated by immigration-death processes

    2009 

     More details

    Presentation type:Poster presentation  

    researchmap

  • DDoS攻撃に対するIPトレースバック技術の漸近評価

    待ち行列シンポジウム「ユビキタスネットワーク社会における情報通信サービスの設計・評価法」  2007 

     More details

  • On the implementation of smoothed perturbation analysis estimator for a single-server queue with multiple vacations

    1999 Winter Simulation Conference  1999 

     More details

  • Applications of m-balanced sequences to some network scheduling problems

    5th Workshop on Discrete Event Systems  2000 

     More details

  • Sensitivity estimation of the cell-delay in the leaky bucket traffic filter with stationary gradual input

    4th International Workshop on Discrete Event Systems  1998 

     More details

  • On the implementation of smoothed perturbation analysis estimator for a single-server queue with multiple vacations

    1999 Winter Simulation Conference  1999 

     More details

  • A scalable and lightweight QoS monitoring technique combining passive and active approaches: On the mathematical formulation of CoMPACT Monitor

    IEEE INFOCOM 2003  2003 

     More details

  • クーポン収集問題の漸近解析とIPトレースバック技術への応用

    待ち行列シンポジウム「確率モデルとその応用」  2006 

     More details

  • Applications of m-balanced sequences to some network scheduling problems

    5th Workshop on Discrete Event Systems  2000 

     More details

  • A scalable and lightweight QoS monitoring technique combining passive and active approaches: On the mathematical formulation of CoMPACT Monitor

    IEEE INFOCOM 2003  2003 

     More details

▼display all

Awards

  • Fellow

    2010   Operations Research Society of Japan  

     More details

  • 33rd Best Paper of the Year Award

    2005   Operations Research Society of Japan  

     More details

    Country:Japan

    researchmap

Research Projects

  • ショットノイズ確率場のスケール極限と無線通信ネットワークへの応用

    Grant number:24K14837  2024.4 - 2027.3

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

    三好 直人

      More details

    Grant amount:\1820000 ( Direct Cost: \1400000 、 Indirect Cost:\420000 )

    researchmap

  • 超高密度無線通信ネットワークの解析のための空間確率モデル

    Grant number:19K11838  2019.4 - 2023.3

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

    三好 直人

      More details

    Grant amount:\3900000 ( Direct Cost: \3000000 、 Indirect Cost:\900000 )

    本研究課題では,無線通信ネットワークの空間確率モデル (無線ノードの不規則な配置を空間点過程と呼ばれる確率過程を用いてモデル化したもの) において,特に基地局が無数に設置された超高密度ネットワークに焦点を当て,モデル化ならびに解析法の検討を行っています.2021年度の主な研究成果は以下の通りです.尚,以下 1),2) は昨年度の実績報告にも記載していますが,2021年度中に論文誌への掲載に至りましたので改めて報告するものです.
    1) 情報鮮度の相関を評価する公式の導出.通信ネットワークを介して伝送される情報は古くなると価値がなくなることがあり,情報鮮度はネットワークの重要な評価尺度です.また,様々な情報が限られたネットワーク資源を共有するため,それらの情報の鮮度には相関があります.そうした情報鮮度の相関を解析的に評価するための公式を導きました.
    2) 無線通信ネットワークの新しい空間確率モデルの提案と解析.これまで無線通信ネットワークの空間確率モデルとしては,解析の容易さからポアソン点過程を用いたモデルが主流でしたが,実際のノード配置を表現できているとは言えませんでした.一方,ノード配置の相関を表したモデルも提案されていますが,解析が複雑になるところが難点でした.そこで,格子の各点を独立かつランダムに摂動させたモデルを提案し,解析および考察を行いました.
    3) 2つの点過程の確率分布を結びつける公式の一般化と無線ネットワークへの応用.パルム分布は点過程を特徴づけるうえで重要な概念として知られています.従来,同時に定常な2つの点過程のパルム分布の間に成立する公式がありましたが,これを高密度無線ネットワークの空間確率モデルの解析に応用しやすい形に一般化しました.また,一般化した公式を利用して無線通信ネットワークの解析を行いました.

    researchmap

  • Analysis and performance evaluation of wireless communication networks via spatial stochastic models

    Grant number:16K00030  2016.4 - 2020.3

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

    Miyoshi Naoto

      More details

    Grant amount:\4680000 ( Direct Cost: \3600000 、 Indirect Cost:\1080000 )

    The aim of this research is that we analyze spatial stochastic models of wireless communication networks, where the locations of wireless nodes are expressed by spatial point processes, and then investigate performance of the networks. The main results are as follows: (1) For various cellular network models where the locations of base stations are positively or negatively correlated, we have derived the coverage probability, a primary performance measure of wireless networks, in numerically computable forms and have evaluated performance of the networks through numerical experiments. (2) We have proposed a simple approximate technique to compute the coverage probability in cellular networks. (3) We have investigated some asymptotic properties of the tail of coverage probability in cellular networks.

    researchmap

  • Determinantal processes and their generalizations

    Grant number:26287019  2014.4 - 2018.3

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

    Shirai Tomoyuki, MIYOSHI Naoto, OSADA Hirofumi

      More details

    Grant amount:\14690000 ( Direct Cost: \11300000 、 Indirect Cost:\3390000 )

    Determinantal point processes are one of the most important models of describing several phenomena that exhibit repulsion. We investigate theoretical aspects and also application aspects of determinantal point processes and their generalization. For example, we estimate the Signal-to-Interference-Ratio for the wireless network whose base stations are configurated by Ginibre point process, which is one of the most important determinantal point processes and has been used for the study of random matrices in physics.

    researchmap

  • Performance evaluation of wireless communication networks using spatial point processes

    Grant number:25330023  2013.4 - 2016.3

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

    Miyoshi Naoto, Shirai Tomoyuki

      More details

    Grant amount:\3900000 ( Direct Cost: \3000000 、 Indirect Cost:\900000 )

    In this work, we considered the spatial stochastic models of wireless communication networks, in particular cellular networks, where the configuration of wireless nodes are represented by spatial point processes. Through the analysis of the models, we evaluated the performance of cellular networks both theoretically and numerically.

    researchmap

  • Asymptotic analysis of correlated queues and its application to performance evaluation of some networks

    Grant number:22510142  2010 - 2012

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

    MIYOSHI Naoto

      More details

    Grant amount:\2730000 ( Direct Cost: \2100000 、 Indirect Cost:\630000 )

    In this work, we introduced quasi-renewal equations for nonrenewal one-dimensional stationary point processes and derived the limit theorems for those equations. Besides, for the applications to performance evaluation of some networks, we asymptotically evaluated the degree distribution of random graphs, which are constructed from spatial marked point processes, and investigated the asymptotic property of coverage probability for spatial point process model of cellular networks.

    researchmap

  • Numerical methods for large sensor network localization problems

    Grant number:22310089  2010 - 2012

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

    KOJIMA Masakazu, OKAMOTO Yoshio, MIYOSHI Naoto, YAMASHITA Makoto, FUJISAWA Katsuki

      More details

    Grant amount:\14950000 ( Direct Cost: \11500000 、 Indirect Cost:\3450000 )

    Sensor network localization (SNL) problems have attracted considerable research interests for a broad spectrum of applications such as environmental monitoring, traffic control and structural assessment. The problem is to estimate the locations of n sensors of unknown positions using given distances and some m sensors of known positions (called anchors) in a sensor network of m+n sensors. Finding the solutions of this problem is known to be NP-hard. Thus, approximating the solution of this problem has been dealt with from many angles. In this project, we have studied numerical methods based on the semidefinite programming (SDP) relaxation.The SDP relaxation can provide approximate solutions with accuracy, but the computational cost of solving SNL problems by the SDP relaxation becomes expensive rapidly as their sizes increase. To avoid this difficulty, we fully exploited the sparsity which were involved in large scale SNL problems and improved the performance of the SDP solver SDPA. As a final product, we released a software package SFSDP that can solve large-scale sensor network localization problems in high speed.

    researchmap

  • 入力に強い相関のある待ち行列過程の動的解析と最近の通信トラヒック技術への応用

    Grant number:15710112  2003 - 2005

    日本学術振興会  科学研究費助成事業  若手研究(B)

    三好 直人

      More details

    Grant amount:\2900000 ( Direct Cost: \2900000 )

    本研究の目的は,入力に相関性を有する待ち行列モデル,また,さらに一般的な確率ネットワークに対して,定常性を仮定しない解析,あるいは動的なふるまいの解析を行ない,インターネット等に見られる様々な新しい特性の評価に応用することです.この目的の遂行のため,また関連する課題として,今年度に行なった研究は以下の通りです.
    1.入力に相関を許す離散時間型の単一サーバ待ち行列モデルに対して,待合室の容量が異なるシステム間に成り立つ比例関係について解析しました.その結果は海外の学術論文誌への掲載が決定しています.ここではサンプルパス解析と呼ばれる手法を用いて,確率過程の定常性さえ要らない極めて一般的な仮定のもとで,待合室の容量が異なるシステムの系内人数分布の問に比例関係が成立することを示し,またその比例定数もサンプルパスを観測して得られる量から導けることを示しています.
    2.昨年度からのテーマとして,インターネットにおけるWebキャッシュ等で用いられているLRU(Least-Recently-Used)キャッシュの解析を行ないました.ここでは,Webページへのアクセス頻度にZipfの法則と呼ばれる裾の重い分布の形が見られることから,このZipfの法則を仮定し,ページアクセス過程には任意の相関を許して,キャッシュの効率の良さの指標であるページフォールト率の漸近解析を行ないました.この成果も海外の学術論文誌への掲載が決定しています.
    3.近年問題になっているインターネットにおけるDoS攻撃(サービス妨害攻撃)への対抗策である,確率的パケットマーキングによるIPトレースバック技術の性能評価法に関する研究も行いました.この問題は,組合せ確率論における古典的な問題であるクーポン収集問題の応用として表せることから,まずクーポン収集問題に対する漸近解析を行っています.
    4.本研究の応用の面での成果である,インターネットにおける通信品質を測定するための新しい手法について,得られた結果を海外の学術論文誌に投稿中と昨年度の報告書に書きましたが,残念ながら投稿して一年以上経過しているにもかかわらず,まだ一度目の審査結果さえ返って来ていません.提案した手法は,測定のためにネットワークに送り込む試験パケットによる負荷を極力抑えながら,複数の利用者が受けるサービス品質を同時にかつ個別に測定できるというものであり,確率論における測度変換,サンプルパス解析,点過程および流体近似等の概念を用いています.

    researchmap

  • 情報ネットワークのスケジューリングのためのm-バランス列とその拡張に関する研究

    Grant number:13780358  2001 - 2002

    日本学術振興会  科学研究費助成事業  若手研究(B)

    三好 直人

      More details

    Grant amount:\1600000 ( Direct Cost: \1600000 )

    本研究の課題は,複数種類の文字を並べて無限に長い文字列を構成する際に,各文字に対して列の中で現れる割合(出現率)が与えられているときに,それを満足しながら如何にバランス良く(なるべく均等に)文字を並べるかという問題への取り組み,ならびにその情報ネットワーク等のスケジューリングや制御への応用についてです.この課題の遂行,およびこれに関連するテーマとして,今年度は以下の研究を行いました.
    これまでに研究代表者の研究室では,上記の問題に対して「m-バランス列」という概念を提唱しています.これは,mに0以上の整数値を代入することによって,各文字が任意の出現率を持つ任意の(半)無限列に対してバランスの良さの指標を与える(mの値が小さい程バランスが良い)ものです.また,このm-バランス列を生成するアルゴリズムとして,ビリヤード列(billiard sequences)と呼ばれる文字列を生成するものを考え,N種の文字からなるビリヤード列は必ず(N-1)-バランス列になることを示しています.しかし,このアルゴリズムの問題点として,与えられた出現率の組によっては,よりバランスの良い列が存在するかもしれないにもかかわらず,それが実現されない場合がありました.これは,生成される文字列のバランスの良さが,アルゴリズムの初期値に大きく依存することに依ります.この問題に対して,文字の出現率が有理数であるときには,生成される文字列が周期列になることを利用し,確率的なアルゴリズムによって,ビリヤード列を生成するアルゴリズムに良い初期値を与えることに成功しました.尚,この研究成果は現在,海外の学術論文誌に投稿中です.
    上記に加えて,応用に関する課題として,ネットワークのスケジューリングにおいて重要な待ち行列システムの並列推定に関する研究も行いました.また,インターネットにおける性能や通信品質の推定法に関する研究も行っています.

    researchmap

  • Modeling and Analysis of Congested Systems Consisting of Intelligent Customers

    Grant number:11480094  1999 - 2001

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

    TAKAHASHI Yukio, MIYOSHI Naoto, YAMADA Takako, FUJIMOTO Kou

      More details

    Grant amount:\8200000 ( Direct Cost: \8200000 )

    In this research, we study congested phenomena in which customers behave with intelligence. So far congested phenomena, for example in telecommunication systems, computer systems production lines and car traffics, have been studied and analyzed mostly using models such as queuing models and car traffic models. In these phenomena, customers' behaviors are somewhat restricted by physical constraints, and so we may assume customers obey simple rules in the models.
    However for congested phenomena of other types, we might have to take more complicated customers' behaviors or judgements into account in our model because customers have more freedom in these phenomena. Here we consider the following phenomena :
    a) pedestrians' walks on a crossing
    b) passengers' movements at getting on and off a train
    c) users' behavior at internet terminal
    d) users' behavior at mobile phones
    In a), we develop a model in which each pedestrian anticipates future collisions and chooses best direction and best speed for walking without any collisions. Using this model, we derive a relation between pedestrian density and mean speed through simulation experiments. The relation is very similar to the one observed from real data of pedestrians. This shows our model captures major aspects of pedestrians' behavior.
    In b), we develop a model in which each passenger tries to minimize his/her potential function which reflects the distances from and the sights of other passengers. Further the model incorporates incentives concerning to getting on/off. Using this model, we derive a relation through simulation "between the congestion of a train and the time required for some number of passengers to get off. The result shows that when the half of passengers get off the time is longer than the case where all passengers get off. This phenomena has been already known but probably this is the first result which evaluate the phenomena quantitavely.
    In c), we observe traffic data passing through the gate of LAN of Tokyo Institute of Technology and develop a model for the traffic. However, the model cannot reflect users' behavior sufficiently for some reason. This is a theme for future study.
    In d), it is very difficult to capture users' behavior since we cannot get suitable data.

    researchmap

  • 定常入力をもつ確率離散事象システムの動的制御に関する研究

    Grant number:09750451  1997 - 1998

    日本学術振興会  科学研究費助成事業  奨励研究(A)

    三好 直人

      More details

    Grant amount:\1800000 ( Direct Cost: \1800000 )

    本研究の課題は,コンピュータ・システムや通信システムをモデル化した確率離散事象システムを,あるシステム・パラメータを動的に変化させることによって制御することにありました.以下では,まずこの課題の遂行のために前年度に行った研究を簡単に述べ,続いて今年度の成果について説明します.
    ●前年度は,確率離散事象システムの最も基本的なモデルである単一サーバ待ち行列を考え,システムの状態を観測しながら,あるシステム・パラメータを動的に更新するような制御手法に対して,待ち行列への入力が定常過程で与えられる場合に,更新されるパラメータの値がつくる確率過程も弱い意味での定常過程になることを示しました.また,パラメータの値に最適値が存在する場合,パラメータの値がつくる確率過程が最適値を中心に変動することを示しました.
    ●今年度は上記の結果を利用して,ATM通信ネットワークのデータ入力のフィルタとして知られているLeaky-bucketシステムを流体入力待ち行列としてモデル化し,leakybucketシステムにおける2つのパラメータの組をシステムの状態に応じて最適な値に定める手続きを示しました.この研究成果の一部を8月にイタリアで行われた離散事象システムに関する国際ワークショップで発表し,別の一部が現在論文誌に投稿中です.
    ●同じ単一サーバ待ち行列でも,サーバが遊休期間を持つような場合,すなわちあるランダムな期間サーバが使えなくなるようなモデルに対しては,これまで前年度の成果の基となった手法である摂動解析法を適用することが困難とされてきました.そのようなモデルに対しても,摂動解析法を適用するための手順を示しました.

    researchmap

  • パ-タベーション・アナリシスによる待ち行列モデルの動的制御に関する研究

    Grant number:08750478  1996

    日本学術振興会  科学研究費助成事業  奨励研究(A)

    三好 直人

      More details

    Grant amount:\1000000 ( Direct Cost: \1000000 )

    研究課題遂行のため,以下の基礎的研究を行った.
    ●特性の異なる種々のトラヒックをもつ通信システムを,複数の客のクラスをもつ待ち行列としてモデル化し,パ-タベーション・アナリシスを用いて,それぞれのクラスの客のサービス時間の分布のパラメータに関する感度推定を行なった.
    ●離散時間型の待ち行列モデルに対する感度推定法を提案した.
    ●パ-タベーシヨン・アナリシスによって得られる勾配の推定値を用いた制御パラメータの更新手続きを示し,定常な入力を持つ待ち行列に対して,更新ごとのパラメータの値がつくる確率過程に,弱い意味での定常解が存在することを示した.
    ●バ-タベーション・アナリシスをポアソン埋め込み法と呼ばれる考え方と組み合わせることにより,稀少事象を短時間で推定する手法を提案した.
    ●上記の理論的結果を実際にシミュレーションを行い検証した.

    researchmap

  • Studies on Intelligent Network Management of Integrated Information Systems

    Grant number:07650458  1995 - 1997

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

    HASEGAWA Toshiharu, NAOTO Miyoshi, KAWANO Hiroyuki, TAKAHASHI Yutaka

      More details

    Grant amount:\2200000 ( Direct Cost: \2200000 )

    We studied on the theoretical researches to evaluate the variation of some performance measures and the methodologies to cunstruct integrated information systems. Moreover, since it is also very important to develope and implement the practical systems, we developed the hybrid performance evaluation system AsQ with the object oriented simulator and knowledge base.
    ・We proposed the mathematical model to integrate various methods for performance evaluation, and applied proposed techniques to performance evaluation.
    ・We focused on the simulation with new techniques using characteristics of information system, and implemented object oriented simulator.
    ・We extended hybrid performance evaluation system AsQ in order to evaluate the performance of information flows, and developed GUI to edit elements of the networks.
    ・We enhanced the rules in the knowledge base of AsQ system, especially we paid attention to manage and control networks stable.

    researchmap

  • Modelling and Performance Evaluation of Multimedia Communication Networks

    Grant number:05680313  1993 - 1995

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

    TAKAHASHI Yutaka, MIYOSHI Naoto, KAWANO Hiroyuki

      More details

    Grant amount:\1900000 ( Direct Cost: \1900000 )

    In 1993, we surveyed the previous researches related to our project and made clear the research themes in the following three years. Moreover, we carried out the analysis of basic queueing models concerning the multimedia communication networks. In 1994, we developed mathematical models to describe the burstiness and correlation which typically appear in multimedia traffic. We also performed the analysis of these models. In 1995, based on the research carried out in 1994, we made research on the modelling and performance evaluation of multimedia communication networks to integrate analytical approach and simulation effectively.

    researchmap

  • Intelligent Management for Integrated Information Networks

    Grant number:05044092  1993 - 1995

    Japan Society for the Promotion of Science  Grants-in-Aid for Scientific Research  Grant-in-Aid for international Scientific Research

    HASEGAWA Toshiharu, WAJDA Krzysztof, BACCELLI Francois, FILIPIAK Janusz, FAYOLLE Guy, SUDA Tatsuya, YEMINI Yechiam, SCHWARTS Micha, MIYOSHI Naoto, KAWANO Hiroyuki, TAKINE Tetsuya, TAKAHASHI Yutaka, OIE Yuji, MIYAHARA Hideo

      More details

    Grant amount:\10000000 ( Direct Cost: \10000000 )

    In order to achieve the integration of traffic streams from multimedia sources in information networks, we have carried out theoretical joint reseach with world-wide leading experts in the field of telecommunication networkd. The research group from Japan consisting of professors from Kyoto University, Osaka University, Nara Advanced Institute of Technology have worked together with the professors from Columbia University, California University, University of Mettalurgy and Mining, Krakow, and INRIA.First, in order to clarify the quality of service in these information networks such as B-ISDN,ATM (Asynchronous Transfer Mode) networks, FDDI (Fiber Distrbuted Data Interface), we have developped mathematical models and analytical techniques for the models as well as intelligent management schemes for these information networks. Specific topics and results are as follows.
    ・We have developped a traffic model to describe the birstiness nature and correlation in cell arriving streams and analyzed the model to derive the cell loss probability and the cell transmission delay distribution.
    ・We have carried out the basic study on the knowledge discovery for network management purpose from a huge amount of traffic data collected through RMON (Remote Network Monitoring) and saved in MIB (Management Information Base).
    ・We have developped a mathematical model for ATM swtching node which performs a key element for future high speed information networks. The model is a discrete time queue with finite buffer and cells arrive according to a semi-Markov process. In order to clarify the fundamental characteristics of ATM nodes, we have analyzed the model to derive the individual cell loss probability, the successive cell loss probability, the probability distributions of the duration of cell loss period and interdeparture time.
    ・We have developped a mathematical model for moving picture traffic. Based on the model we have also proposed a mathematical method to generate a correlated cell stream for simulation purpose and analyzed the model to derive the cell loss probability.

    researchmap

  • 点過程, 待ち行列理論とその応用

      More details

    Grant type:Competitive

    researchmap

  • Point Processes, Queueing Theory and their Applications

      More details

    Grant type:Competitive

    researchmap

▼display all