2024/05/02 更新

写真a

サトウ ダイスケ
佐藤 大輔
SATO Daisuke
所属
情報工学部 情報マネジメント学科 教授
大学院 工学研究科 修士課程 システムマネジメント専攻 教授
職名
教授
外部リンク

研究分野

  • 社会基盤(土木・建築・防災) / 防災工学

  • 情報通信 / 数理情報学

  • 情報通信 / 情報ネットワーク

  • 自然科学一般 / 応用数学、統計数学

  • 情報通信 / ソフトウェア

学歴

  • 早稲田大学   大学院理工学研究科   電気工学専攻電子通信学専門分野

    1992年4月 - 1994年03月

      詳細を見る

    国名: 日本国

    researchmap

  • 早稲田大学   理工学部   電子通信学科

    1988年4月 - 1992年03月

      詳細を見る

    国名: 日本国

    researchmap

経歴

  • 福岡工業大学   情報工学部 情報マネジメント学科   教授

    2024年4月 - 現在

      詳細を見る

    国名:日本国

    researchmap

  • 日本電信電話株式会社   ネットワークサービスシステム研究所   主任研究員

    2021年7月 - 2024年3月

      詳細を見る

    国名:日本国

    researchmap

  • 大阪大学   数理・データ科学教育研究センター   AI・データ利活用研究会講師

    2020年10月

      詳細を見る

    国名:日本国

    researchmap

  • 法政大学   理工学部経営システム工学科   非常勤講師

    2018年6月 - 2022年7月

      詳細を見る

    国名:日本国

    researchmap

  • 千葉工業大学   社会システム科学部 プロジェクトマネジメント学科   非常勤講師

    2018年4月 - 2023年8月

      詳細を見る

    国名:日本国

    researchmap

  • 工学院大学   工学部環境エネルギー化学科   非常勤講師

    2013年9月 - 2017年3月

      詳細を見る

    国名:日本国

    researchmap

  • 日本電信電話株式会社   ネットワーク基盤技術研究所   主任研究員

    2013年4月 - 2021年6月

      詳細を見る

    国名:日本国

    researchmap

  • 日本電信電話株式会社   情報流通基盤総合研究所企画部   主任研究員

    2011年7月 - 2013年3月

      詳細を見る

    国名:日本国

    researchmap

  • 日本電信電話株式会社   ネットワーク基盤技術研究所   主任研究員

    2011年4月 - 2011年6月

      詳細を見る

  • NTTアドバンステクノロジ株式会社   ネットワークテクノロジセンタ   担当課長

    2007年4月 - 2011年3月

      詳細を見る

    国名:日本国

    researchmap

  • 日本電信電話株式会社   サービスインテグレーション基盤研究所   主任研究員

    2006年4月 - 2007年3月

      詳細を見る

    国名:日本国

    researchmap

  • 芝浦工業大学   大学院理工学研究科(修士課程) システム理工学専攻   非常勤講師

    2004年11月

      詳細を見る

    国名:日本国

    researchmap

  • 日本電信電話株式会社   マルチメディアネットワーク研究所   研究主任

    2003年2月 - 2006年3月

      詳細を見る

    国名:日本国

    researchmap

  • 早稲田大学   理工学術院基幹理工学部   非常勤講師

    2002年9月 - 2015年8月

      詳細を見る

    国名:日本国

    researchmap

  • 日本電信電話株式会社   通信網研究所   社員

    1994年4月 - 2003年1月

      詳細を見る

    国名:日本国

    researchmap

▼全件表示

所属学協会

  • 日本応用数理学会

    2000年2月 - 現在

      詳細を見る

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

    1994年11月 - 現在

      詳細を見る

  • 電子情報通信学会

    1992年2月 - 現在

      詳細を見る

委員歴

  • 電子情報通信学会   英文論文誌A小特集(安全・安心な生活のための情報通信システム)編集  

    2022年12月 - 2023年12月   

      詳細を見る

    団体区分:学協会

    researchmap

  • 10th International Congress on Industrial and Applied Mathematics (ICIAM2023)   Local Scientific Program Committee Member  

    2021年8月 - 2023年8月   

      詳細を見る

    団体区分:学協会

    researchmap

  • 日本応用数理学会   理事  

    2020年6月 - 2022年6月   

      詳細を見る

    団体区分:学協会

    researchmap

  • 日本応用数理学会   代表会員  

    2020年4月 - 2023年3月   

      詳細を見る

    団体区分:学協会

    researchmap

  • American Mathematical Society   Reviewer for Mathematical Reviews  

    2019年12月 - 現在   

      詳細を見る

    団体区分:学協会

    researchmap

  • 電子情報通信学会基礎・境界ソサイエティ   Fundamentals Review編集  

    2016年9月 - 2018年9月   

      詳細を見る

    団体区分:学協会

    researchmap

  • 電子情報通信学会   英文論文誌A小特集(安全・安心な生活のための情報通信システム)編集幹事  

    2014年10月 - 2016年8月   

      詳細を見る

    団体区分:学協会

    researchmap

  • 電子情報通信学会 安全・安心な生活のためのICT研究会   専門委員  

    2014年2月 - 現在   

      詳細を見る

    団体区分:学協会

    researchmap

  • 日本応用数理学会   学会誌編集主幹,常任理事  

    2010年4月 - 2012年3月   

      詳細を見る

    団体区分:学協会

    researchmap

  • 日本応用数理学会   学会誌編集委員  

    2009年4月 - 2010年3月   

      詳細を見る

    団体区分:学協会

    researchmap

  • 日本応用数理学会   評議委員  

    2006年4月 - 2008年3月   

      詳細を見る

    団体区分:学協会

    researchmap

  • 日本オペレーションズ・リサーチ学会   2005年春季研究発表会実行委員  

    2004年12月 - 2005年3月   

      詳細を見る

    団体区分:学協会

    researchmap

  • 電子情報通信学会   常任査読委員  

    2003年11月 - 現在   

      詳細を見る

    団体区分:学協会

    researchmap

▼全件表示

論文

  • Analysis for flow termination in the decentralized and centralized pre-congestion notification architecture 査読

    Satoh D.

    Computer Networks   233   109876 - 109876   2023年9月

     詳細を見る

    担当区分:筆頭著者   記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:Computer Networks  

    This paper discusses decentralized and centralized pre-congestion notification (PCN)-based measured-rate flow termination (FT) in the case of a single bottleneck. The paper finds out that asynchronous measurement periods between ingress–egress aggregates (IEAs) cause overtermination in the decentralized PCN although RFC6661 states that the operation of PCN is not affected if the starting and ending times of the measurement periods for IEAs are different. Also, the paper finds that the asynchronous measurement periods can prevent a FT for one IEA from terminating enough flows in one shot. Furthermore, the paper proves that overtermination occurs in the decentralized PCN due to asynchronous measurement periods regardless of the same or different round trip time (RTT) and synchronous measurement period with different RTTs. In contrast, the centralized PCN can avoid overtermination due to effects of the asynchronous measurement periods and different RTTs.

    DOI: 10.1016/j.comnet.2023.109876

    Scopus

    researchmap

  • Changes in Calling Parties' Behavior Caused by Settings for Indirect Control of Call Duration under Disaster Congestion 査読

    Satoh D., Mochida T.

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences   E105.A ( 9 )   1358 - 1371   2022年9月

     詳細を見る

    担当区分:筆頭著者   記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences  

    The road space rationing (RSR) method regulates a period in which a user group can make telephone calls in order to decrease the call attempt rate and induce calling parties to shorten their calls during disaster congestion. This paper investigates what settings of this indirect control induce more self-restraint and how the settings change calling parties' behavior using experimental psychology. Our experiments revealed that the length of the regulated period differently affected calling parties' behavior (call duration and call attempt rate) and indicated that the 60-min RSR method (i.e., 10 six-min periods) is the most effective setting against disaster congestion.

    DOI: 10.1587/transfun.2021eap1094

    Scopus

    researchmap

  • Property of Gompertz data through convex of upper limit estimated with logistic difference equation 査読

    Satoh D.

    Research in Mathematics   9 ( 1 )   2022年1月

     詳細を見る

    担当区分:筆頭著者   記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:Research in Mathematics  

    The Gompertz curve and logistic curve models are often used to forecast the upper limit. An appropriate model-selection method as well as accurate parameter estimation is required to obtain an accurate estimation of the upper limit. Upper limits estimated with the logistic curve model as an inappropriate model were proved to be upward convex after a certain data size for data described on the exact solution of the Gompertz curve model. This was accomplished by using a difference equation that has the exact solution. The appropriate model-selection method with the properties of estimated upper limits that are upward convex and already obtained monotonic increase was applied to three actual datasets. These properties help us to select an appropriate model between the Gompertz curve and logistic curve models.

    DOI: 10.1080/27658449.2021.2011645

    Scopus

    researchmap

  • Discrete Gompertz equation and model selection between Gompertz and logistic models 査読

    Satoh D.

    International Journal of Forecasting   37 ( 3 )   1192 - 1211   2021年7月

     詳細を見る

    担当区分:筆頭著者   記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:International Journal of Forecasting  

    A discrete Gompertz model and model selection between the Gompertz and logistic models are proposed. The proposed method utilizes the difference between the regression equations for the proposed and the discrete logistic models. The difference is whether the log of both sides is taken or not. The proposed discrete model has higher goodness-of-fit for actual data than the non-homogeneous Poisson process Gompertz model that is commonly used in software reliability engineering. The proposed model selection method is simpler than an existing method based on the mean relative squared error, because the proposed method requires only the correlation coefficients between variables on regression equations for both discrete Gompertz and logistic models. It yields absolutely correct selection when pseudo-data are on exact solutions of the Gompertz and logistic models. Also, it yields correct results earlier than the existing model selection for actual data.

    DOI: 10.1016/j.ijforecast.2021.01.005

    Scopus

    researchmap

  • Riccati equation as topology-based model of computer worms and discrete SIR model with constant infectious period 査読

    Satoh D., Uchida M.

    Physica A: Statistical Mechanics and its Applications   566   125606 - 125606   2021年3月

     詳細を見る

    担当区分:筆頭著者   記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:Physica A: Statistical Mechanics and its Applications  

    We propose discrete and continuous infection models of computer worms via e-mail or social networking site (SNS) messengers that were previously classified as worms spreading through topological neighbors. The discrete model is made on the basis of a new classification of worms as “permanently” or “temporarily” infectious. A temporary infection means that only the most recently infected nodes are infectious according to a difference equation. The discrete model is reduced to a Riccati differential equation (the continuous model) at the limit of a zero difference interval for the difference equation. The discrete and continuous models well describe actual data and are superior to a linear model in terms of the Akaike information criterion (AIC). Both models overcome the overestimation that is generated by applying a scan-based model to topology-based infection, especially in the early stages. The discrete model gives a condition in which all nodes are infected because the vulnerable nodes of the Ricatti difference equation are finite and the solution of the Riccati difference equation plots discrete values on the exact solution of the Riccati differential equation. Also, the discrete model can also be understood as a model for the spread of infections of an epidemic virus with a constant infectious period and is described with a discrete susceptible–infected–recovered (SIR) model. The discrete SIR model has an exact solution. A control to reduce the infection is considered through the discrete SIR model.

    DOI: 10.1016/j.physa.2020.125606

    Scopus

    researchmap

  • Forecasting with full use of data without interpolation on logistic curve model with missing data 査読

    Satoh D., Matsumura R.

    Japan Journal of Industrial and Applied Mathematics   38 ( 2 )   473 - 488   2021年1月

     詳細を見る

    担当区分:筆頭著者   掲載種別:研究論文(学術雑誌)   出版者・発行元:Japan Journal of Industrial and Applied Mathematics  

    We propose a forecasting method based on a logistic curve model with missing data, which are a ubiquitous problem in social science forecasting, especially in marketing. The method completely recovers parameters of the difference equation when data are on an exact solution curve because it uses an unequal step difference equation that has an exact solution. It makes full use of data without wasting any data or generating plausible data for the missing data. It only requires regression analysis and a simple optimization technique and showed better fitting than two conventional methods for three actual datasets.

    DOI: 10.1007/s13160-020-00452-w

    Scopus

    researchmap

    その他リンク: https://link.springer.com/article/10.1007/s13160-020-00452-w/fulltext.html

  • Property of logistic data exposed with Gompertz model and resistance to noise in actual data 査読

    Satoh D.

    Japan Journal of Industrial and Applied Mathematics   36 ( 3 )   937 - 957   2019年8月

     詳細を見る

    担当区分:筆頭著者   記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:Japan Journal of Industrial and Applied Mathematics  

    A property of data on the exact solution of the logistic curve model was exposed by behavior of upper limits estimated with an unsuitable model (the Gompertz curve model). The property is that the upper limits estimated with the Gompertz curve model for logistic data change with the downward convex for the data as the data size increases, i.e., time elapses. This contributes to identifying a suitable model because the behavior is independent of noise included in actual data. A suitable model is indispensable for correct forecasts. The property was proved and the proof was accomplished thanks to difference equations that have exact solutions. Moreover, we analyzed how resistant the downward convex and monotonic decrease of the estimated upper limit were to noise included in actual data sets.

    DOI: 10.1007/s13160-019-00382-2

    Scopus

    researchmap

    その他リンク: http://link.springer.com/article/10.1007/s13160-019-00382-2/fulltext.html

  • Model selection among growth curve models that have the same number of parameters 査読

    Daisuke Satoh

    Cogent Mathematics & Statistics   6 ( 1 )   1660503 - 1660503   2019年1月

     詳細を見る

    担当区分:筆頭著者   記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:Informa UK Limited  

    DOI: 10.1080/25742558.2019.1660503

    researchmap

  • Properties of Gompertz data revealed with non-Gompertz integrable difference equation 査読

    Daisuke Satoh

    Cogent Mathematics & Statistics   6 ( 1 )   1596552 - 1596552   2019年1月

     詳細を見る

    担当区分:筆頭著者   記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:Informa UK Limited  

    DOI: 10.1080/25742558.2019.1596552

    researchmap

    その他リンク: https://www.tandfonline.com/doi/pdf/10.1080/25742558.2019.1596552

  • Monotonic decrease of upper limit estimated with Gompertz model for data described using logistic model 査読

    Satoh D., Matsumura R.

    Japan Journal of Industrial and Applied Mathematics   36 ( 1 )   79 - 96   2018年10月

     詳細を見る

    担当区分:筆頭著者   記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:Japan Journal of Industrial and Applied Mathematics  

    The Gompertz curve and logistic curve models are often used to forecast upper limits (saturation points). To accurately estimate an upper limit, an appropriate model selection as well as accurate parameter estimation is required. We mathematically analyze how an upper limit estimated with an inappropriate model changes as the data size increases, i.e., time elapses, when the Gompertz curve model is selected for data described on the exact solution of the logistic curve model. We prove that an estimated upper limit is strictly monotonically decreasing as the historical data size increases and that the upper limit estimated with the inappropriate model converges to the upper limit estimated with the appropriate model as the data size approaches infinity. These results can help in selecting an appropriate model.

    DOI: 10.1007/s13160-018-0333-9

    Scopus

    researchmap

    その他リンク: http://link.springer.com/content/pdf/10.1007/s13160-018-0333-9.pdf

  • Reduction of communication demand under disaster congestion using control to change human communication behavior without direct restriction 査読

    Satoh D., Takano Y., Sudo R., Mochida T.

    Computer Networks   134   105 - 115   2018年4月

     詳細を見る

    担当区分:筆頭著者   記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:Computer Networks  

    When a disaster strikes, many people make calls to their loved ones in the affected area. As a result, telephone networks become congested, making it difficult for people to contact each other. This congestion continues in the aftermath of a large-scale disaster. The sooner the congestion is eased, the sooner and easier people can contact each other. We accomplish this by reducing communication demand without directly restricting call duration. We propose a congestion control method, called the road space rationing (RSR) method (RSR was originally designed for transportation and restricts access to congested areas on the basis of the last digit of a vehicle's license plate or license number). Our RSR method only restricts the period in which to make a call on the basis of the last digits of calling parties’ phone numbers (e.g., only people with phone numbers ending in 1 can make calls between XX:06 and XX:12). It not only avoids restricting the overall number of calling parties but also prompts people to reduce their call duration consciously despite it being unrestricted. It thus has a mechanism to change human communication behavior without directly restricting call duration. This consciously willed reduction is effective against disaster congestion because there are no redials to the same called parties. This reduction in call duration in turn decreases congestion. Experimental results revealed that the RSR method reduced call duration by 30%.

    DOI: 10.1016/j.comnet.2018.01.049

    Scopus

    researchmap

  • Maintenance of communication carrier networks against large-scale earthquakes 査読

    Takahashi Y., Satoh D.

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences   E98.A ( 8 )   1602 - 1609   2015年8月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences  

    The network operations center of a communication carrier play an important and critical role in the early stage of disaster response because its function is the maintenance of communication services, which includes traffic control and restoration of services. This paper describes traffic control and restoration of services affected by the Great East Japan Earthquake. This paper discusses challenges on traffic congestion and restoration for future large-scale disasters.

    DOI: 10.1587/transfun.e98.a.1602

    Scopus

    researchmap

  • Effect of load-balancing against disaster congestion with actual subscriber extension telephone numbers 査読

    Satoh D., Kawano H., Chiba Y.

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences   E98.A ( 8 )   1637 - 1646   2015年8月

     詳細を見る

    担当区分:筆頭著者   記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences  

    We demonstrated that load balancing using actual subscriber extension numbers was practical and effective against traffic congestion after a disaster based on actual data. We investigated the ratios of the same subscriber extension numbers in each prefecture and found that most of them were located almost evenly all over the country without being concentrated in a particular area. The ratio of every number except for the fourth-last digit in the last group of four numbers in a telephone number was used almost equally and located almost evenly all over the country. Tolerance against overload in the last, second-, and third-last single digits stays close to that in the ideal situation if we assume that each session initiation protocol server has a capacity in accordance with the ratio of each number on every single digit in the last group of four numbers in Japan. Although tolerance against overload in double-, triple-, and quadruple-digit numbers does not stay close to that in the ideal situation, it still remains sufficiently high in the case of double- and triple-digit numbers. Although tolerance against overload in the quadruple-digit numbers becomes low, disaster congestion is still not likely to occur in almost half of the area of Japan (23 out of 47 prefectures).

    DOI: 10.1587/transfun.e98.a.1637

    Scopus

    researchmap

  • Marking algorithm of distinguishing three traffic load states with two encoding states for pre-congestion notification 査読

    Satoh D., Ueno H.

    Computer Communications   36 ( 10-11 )   1209 - 1224   2013年6月

     詳細を見る

    担当区分:筆頭著者   記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:Computer Communications  

    Pre-congestion notification (PCN) gives an early warning of congestion by marking packets to protect the quality of service of inelastic flows. PCN defines two rates per link: admissible rate (AR) and supportable rate (SR), which divide the PCN traffic load into three states, "no pre-congestion," "AR pre-congestion," and "SR pre-congestion." PCN admission control and flow termination control operate in accordance with these three states. However, only two PCN encoding states, unmarked and PCN marked, can be used due to the requirement of PCN encoding to survive tunneling through a currently used IPsec tunnel. We propose a marking algorithm, which uses the two encoding states, for distinguishing the three states of PCN traffic load. We also propose new admission and flow termination controls, which are based on the proposed marking algorithm, and evaluate their performance. Markings that require fewer PCN encoding states are preferable because the remaining encoding state can be used for a newly added PCN-based control in the future. Furthermore, distinguishing more states with fewer encoding states benefits not only PCN but also general marking techniques because header fields are limited; thus, valuable. © 2013 Elsevier B.V. All rights reserved.

    DOI: 10.1016/j.comcom.2013.03.004

    Scopus

    researchmap

  • Cause and countermeasure of overtermination for PCN-based flow termination 査読

    Satoh D., Ueno H.

    Proceedings - IEEE Symposium on Computers and Communications   155 - 161   2010年9月

     詳細を見る

    担当区分:筆頭著者   記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:Proceedings - IEEE Symposium on Computers and Communications  

    Pre-congestion notification (PCN) is a packet marking mechanism for DiffServ domains to facilitate feedback-based admission control (AC) and flow termination (FT) for the Internet to achieve quality of service (QoS) for inelastic flows. While AC blocks new flows to prevent an overly high load on network links, FT removes traffic to protect the QoS of the remaining PCN-flows when traffic is rerouted due to any kind of failure. We focus on one of the PCN methods, the controlled load (CL) method, whose edge behavior is now under standardization in the PCN working group of the Internet Engineering Task Force. The CL method terminates a sufficient number of flows in one shot and seems to have accurate control. However, we discovered that more termination than was needed, which we call overtermination, occurred in the CL method. We found that the CL method causes overtermination when not all the ingress-egress pairs have the same round-trip time. A countermeasure is presented to remove this overtermination. © 2010 IEEE.

    DOI: 10.1109/ISCC.2010.5546742

    Scopus

  • Nationwide SIP telephony network design to prevent congestion caused by disaster 査読

    Satoh D., Ashitagawa K.

    IEICE Transactions on Communications   E93-B ( 9 )   2273 - 2281   2010年9月

     詳細を見る

    担当区分:筆頭著者   記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:IEICE Transactions on Communications  

    We present a session initiation protocol (SIP) network design for a voice-over-IP network to prevent congestion caused by people calling friends and family after a disaster. The design increases the capacity of SIP servers in a network by using all of the SIP servers equally. It takes advantage of the fact that equipment for voice data packets is different from equipment for signaling packets in SIP networks. Furthermore, the design achieves simple routing on the basis of telephone numbers. We evaluated the performance of our design in preventing congestion through simulation. We showed that the proposed design has roughly 20 times more capacity, which is 57 times the normal load, than the conventional design if a disaster were to occur in Niigata Prefecture struck by the Chuetsu earthquake in 2004. Copyright © 2010 The Institute of Electronics, Information and Communication Engineers.

    DOI: 10.1587/transcom.e93.b.2273

    Scopus

    researchmap

  • A survey of PCN-based admission control and flow termination 査読 国際共著

    Menth M., Lehrieder F., Briscoe B., Eardley P., Moncaster T., Babiarz J., Charny A., Zhang X., Taylor T., Chan K.H., Satoh D., Geib R., Karagiannis G.

    IEEE Communications Surveys and Tutorials   12 ( 3 )   357 - 375   2010年4月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:IEEE Communications Surveys and Tutorials  

    Pre-congestion notification (PCN) provides feedback about load conditions in a network to its boundary nodes. The PCN working group of the IETF discusses the use of PCN to implement admission control (AC) and flow termination (FT) for prioritized realtime traffic in a DiffServ domain. Admission control (AC) is a well-known flow control function that blocks admission requests of new flows when they need to be carried over a link whose admitted PCN rate already exceeds an admissible rate. Flow termination (FT) is a new flow control function that terminates some already admitted flows when they are carried over a link whose admitted PCN rate exceeds a supportable rate. The latter condition can occur in spite of AC, e.g., when traffic is rerouted due to network failures. This survey gives an introduction to PCN and is a primer for this new technology. It presents and discusses the multitude of architectural design options in an early stage of the standardization process in a comprehensive and streamlined way before only a subset of them is standardized by the IETF. It brings PCN from the IETF to the research community and serves as historical record. © 2005 IEEE.

    DOI: 10.1109/surv.2010.040710.00078

    Scopus

    researchmap

  • SIP network design to prevent congestion caused by disaster 査読

    Satoh D., Ashitagawa K.

    IEEE International Conference on Communications   2009年11月

     詳細を見る

    担当区分:筆頭著者   記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE International Conference on Communications  

    We present a session initiation protocol (SIP) network design for a voice-over-IP (VoIP) network to prevent congestion caused by people calling friends and family after a disaster. The design increases the capacity of SIP servers in a network by using all the SIP servers equally. The design uses a property that SIP network elements do not carry voice data packets but signaling packets instead. Furthermore, the design achieves simple routing based on telephone numbers. We evaluate the performance of preventing congestion through simulation. We show that the proposed design has roughly 20 times more capacity, which is 57 times of the normal load, than the conventional design if a disaster were to occur in Niigata Prefecture. ©2009 IEEE.

    DOI: 10.1109/ICC.2009.5199461

    Scopus

  • Network topology design using analytic hierarchy process

    Kamiyama N., Satoh D.

    IEEE International Conference on Communications   2048 - 2054   2008年9月

     詳細を見る

    出版者・発行元:IEEE International Conference on Communications  

    The topology of a network seriously affects its cost, reliability, throughput, and traffic pattern, etc, so we need to simultaneously consider these multiple criteria, which have different units, when evaluating network topologies. Moreover, we need to reflect the relative importance of each criterion when evaluating the network topology. However, ordinary methods of network topology design consider only a single criterion. In this paper, we apply AHP (analytic hierarchy process), which has been widely used when making a rational decision with multiple criteria, to network topology design. AHP enables us to reflect the relative importance of each criterion on the results. In network topology design, we need to consider a huge number of candidates, and the differences in the weights among candidates are small. Therefore, the optimum topologies will be determined by just the weighted criteria, and other criteria will not be considered. Therefore, to emphasize the difference of the weights, we propose to use a linear-transformed value of each criterion when constructing weights in AHP. ©2008 IEEE.

    DOI: 10.1109/ICC.2008.393

    Scopus

  • Unicast probing techniques for estimation of shared loss rate 査読 国際共著

    Luong D.D., Vidács A., Biró J., Dang T.D., Satoh D., Ishibashi K.

    International Journal of Communication Systems   20 ( 5 )   613 - 632   2006年9月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:International Journal of Communication Systems  

    The paper introduces two new unicast active end-to-end measurement techniques, called the single-double unicast probing (SDUP) and the delay-based unicast probing (DUP), to estimate the rate of losses which occurs on the shared network path of two flows. A comprehensive performance evaluation and a comparison between these two techniques and an existing one having the same objective, the striped unicast probing (SUP) (Proceedings of the INFOCOM 2001-The IEEE Conference on Computer Communications, No. 2, Anchorage, Alaska, U.S.A., 2001; 915-923), were carried out. We demonstrate that our proposed SDUP technique provides even better estimation accuracy compared to that of the SUP while it requires only one piece of measurement equipment at only one receiver instead of deploying units to both receivers. Furthermore, with only one sender and receiver pair we can measure not only one shared path, but any partial path that begins at the sender and is located on the sender-receiver path. We also show that while the DUP have the same accuracy as the SUP in the case of Drop-Tail buffer management, the DUP is capable of measuring loss rates of RED buffers, which the other techniques do not work with. The SDUP and the DUP are less intrusive and cause less bursty traffic compared to the SUP. Finally, the adaptation of these techniques into passive measurements is also considered. Copyright © 2006 John Wiley & Sons, Ltd.

    DOI: 10.1002/dac.839

    Scopus

    researchmap

  • Bottleneck links detection method based on passive monitoring 査読 国際共著

    Moldován I., Dang T.D., Bíró J., Satoh D., Ishibashi K.

    Proceedings of the Third IASTED International Conference on Communications, Internet, and Information Technology   115 - 121   2004年12月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:Proceedings of the Third IASTED International Conference on Communications, Internet, and Information Technology  

    In this paper we present a new method for the detection of bottleneck link(s) in the networks. The proposed method is based on the variance-per-mean ratio of the flow's throughput crossing the link which can be calculated from the data trace information provided by passive traffic monitoring. This new indicator of bottleneck links is found to be effective and robust against the offered link loads, bottleneck bandwidth, and the traffic composition. The results are verified using both simulation and real measurement analysis.

    Scopus

  • Discrete Stochastic Gompertz Equations and Software Reliability Growth Models 査読

    Daisuke Satoh

    Supplementary Proceedings of 15th International Symposium on Software Reliability Engineering   49 - 50   2004年11月

     詳細を見る

    担当区分:筆頭著者   記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    researchmap

  • A Measure to Distinguish between a Logistic Curve Model and a Gompertz Curve Model 査読

    Daisuke Satoh

    Supplementary Proceedings of 14th International Symposium on Software Reliability Engineering   234 - 235   2003年11月

     詳細を見る

    担当区分:筆頭著者   記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    researchmap

  • An Advanced Technique on Bottleneck Detection 査読 国際共著

    Pal Valga, Gergely Kun, Peter Fodor, Jozsef Biro, Daisuke Satoh, Keisuke Ishibashi

    Proceedings of 9th EUNICE Open European Summer School and IFIP Workshop on Next Generation Networks   52 - 56   2003年9月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    researchmap

  • Unicast Probing to Estimate Share Loss Rate 査読 国際共著

    Dinh-Dung Luong, Attila Vidacs, Jozsef Biro, Daisuke Satoh, Keisuke Ishibashi

    Proceedings of 6th IFIP/IEEE International Conference (MMNS 2003)   503 - 515   2003年9月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    researchmap

  • 品質保証型帯域共有サービスの導入効果 : 経済的フィージビリティの検証 査読

    塩田茂雄, 佐藤大輔, 山本尚生

    46 ( 3 )   372 - 393   2003年9月

     詳細を見る

    記述言語:日本語   掲載種別:研究論文(学術雑誌)  

    DOI: 10.15807/jorsj.46.372

    researchmap

  • A Discrete Stochastic Logistic Equation and a Software Reliability Growth Model 査読

    Daisuke Satoh

    Supplementary Proceedings of 13th International Symposium on Software Reliability Engineering   141 - 142   2002年11月

     詳細を見る

    担当区分:筆頭著者   記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    researchmap

  • ソフトウェア信頼性評価のための差分方程式に基づく統計的データ解析モデルに関する考察 査読

    山田茂, 井上真二, 佐藤大輔

    日本応用数理学会論文誌   12 ( 2 )   155 - 168   2002年6月

     詳細を見る

    記述言語:日本語  

    researchmap

  • Estimating the Source-Destination Traffic Matrix of a Virtual Private Network 査読

    Shigeo Shioda, Daisuke Satoh, Takeo Kawahara

    Proceedings of Communications Quality & Reliability   94 - 98   2002年5月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    researchmap

  • Studies on Statistical Forecasting and Integrable Discrete Equations -Growth Curve Models-

    Daisuke Satoh

    Waseda University   ( 3345 )   2002年3月

     詳細を見る

    担当区分:筆頭著者   記述言語:英語   掲載種別:学位論文(博士)  

    researchmap

  • Parameter Estimation of Discrete Logistic Curve Models for Software Reliability Assessment 査読

    Satoh D., Yamada S.

    Japan Journal of Industrial and Applied Mathematics   19 ( 1 )   39 - 53   2002年2月

     詳細を見る

    担当区分:筆頭著者   記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:Japan Journal of Industrial and Applied Mathematics  

    We describe software reliability growth models that yield accurate parameter estimates in spite of a small amount of input data in an actual software testing. These models are based on discrete analogs of a logistic curve model. The models are described with two difference equations, one each proposed by Morishita and Hirota. The difference equations have exact solutions. The equations tend to a differential equation on which the logistic curve model is defined when the time interval tends to zero. The exact solutions also tend to the exact solution of the differential equation when the time interval tends to zero. The discrete models conserve the characteristics of the logistic model because the difference equations have exact solutions. Therefore, the proposed models provide accurate parameter estimates, making it possible to predict in the early development phase when software can be released.

    DOI: 10.1007/bf03167447

    Scopus

    researchmap

    その他リンク: http://link.springer.com/article/10.1007/BF03167447/fulltext.html

  • Traffic measurement and analysis in an ATM-based Internet backbone 査読

    Kawahara R., Ishibashi K., Hirano T., Saito H., Ohara H., Satoh D., Asano S., Matsukata J.

    Computer Communications   24 ( 15-16 )   1508 - 1524   2001年10月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:Computer Communications  

    This paper reports our measurements and analysis of traffic characteristics in an Internet backbone ATM network. In order to utilize network resource efficiently while satisfying the quality of service requirement, it is important to understand the traffic characteristics. We therefore monitored the traffic from the flow or application level to the cell level on a link between NTT's Open Computer Network (OCN) and the Science Information Network (SINET), which are two of the largest Internet backbone ATM-based networks in Japan. Using the monitored traffic, we also evaluated the performance of the aggregate traffic by real-time simulation. Results show that the performance (cell loss ratio) greatly depended not only on link utilization but also on the number of flows, flow size, and traffic composition in terms of applications. We also found that the degree of self-similarity in the Internet backbone was not large. In addition, we clarified that more statistical multiplexing gain could be obtained in the Internet backbone when more flows were multiplexed onto a link. © 2001 Elsevier Science B.V. All rights reserved.

    DOI: 10.1016/s0140-3664(01)00309-7

    Scopus

    researchmap

  • A discrete bass model and its parameter estimation 査読

    Satoh D.

    Journal of the Operations Research Society of Japan   44 ( 1 )   1 - 18   2001年3月

     詳細を見る

    担当区分:筆頭著者   記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:Journal of the Operations Research Society of Japan  

    A discrete Bass model, which is a discrete analog of the Bass model, is proposed. This discrete Bass model is defined as a difference equation that has an exact solution. The difference equation and the solution respectively tend to the differential equation which the Bass model is defined as and the solution when the time interval tends to zero. The discrete Bass model conserves the characteristics of the Bass model because the difference equation has an exact solution. Therefore, the discrete Bass model enables us to forecast the innovation diffusion of products and services without a continuous-time Bass model. The parameter estimations of the discrete Bass model are very simple and precise. The difference equation itself can be used for the ordinary least squares procedure. Parameter estimation using the ordinary least squares procedure is equal to that using the nonlinear least squares procedure in the discrete Bass model. The ordinary least squares procedures in the discrete Bass model overcome the three shortcomings of the ordinary least squares procedure in the continuous Bass model: the time-interval bias, standard error, and multicollinearity.

    DOI: 10.15807/jorsj.44.1

    Scopus

    researchmap

  • Real-time cell arrival sequence estimation and simulation for IP-over-ATM networks 査読 国際共著

    Saito H., Tsuchiya T., Satoh D., Maosi G., Horvath G., Tatai P., Asano S.

    IEICE Transactions on Communications   E84-B ( 3 )   634 - 643   2001年3月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:IEICE Transactions on Communications  

    We have developed a new traffic measuring tool and applied it to the real-time simulation of a network. It monitors IP traffic on an ATM link and continuously transfers the length and timestamp of each IP packet to a post-processing system. The post-processing system receives the data, estimates the cell's arrival epoch at the transmission queue of the ATM link, and simulates the queueing behavior on-line if conditions differ from those of the actual system. The measuring tool and real-time simulation represent a new approach to traffic engineering. A new estimation problem, the arrival sequence estimation, is shown and some algorithms are proposed and evaluated. Also, a new dimensioning algorithm called the queue decay parameter method, which is expected to be robust and applicable to real-time control, is proposed and evaluated.

    Scopus

  • Discrete equations and software reliability growth models 査読

    Satoh D., Yamada S.

    Proceedings of the International Symposium on Software Reliability Engineering, ISSRE   176 - 184   2001年

     詳細を見る

    担当区分:筆頭著者   記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:Proceedings of the International Symposium on Software Reliability Engineering, ISSRE  

    We propose a criterion to determine a more appropriate software reliability growth model in the early development phase. The criterion with a discrete software reliability growth model determines the absolute worth of a model because the discrete software reliability growth model perfectly reproduces the parameter estimates when the data are used as an exact solution of the equation. The values of the proposed criterion of a discrete software reliability growth model are smaller than those of another software reliability growth model in all periods during the test phase with actual data sets. The discrete software reliability growth models are described with difference equations which have exact solutions. The models yield accurate parameter estimates in spite of a small amount of input data in an actual software testing. Therefore, the criterion and discrete software reliability growth models enable us to predict in the early development phase when software can be released.

    DOI: 10.1109/ISSRE.2001.989471

    Scopus

  • Development of real-time simulator using traffic monitoring 査読

    Saito H., Ohara H., Satoh D.

    IEEE International Conference on Communications   1   195 - 199   2000年12月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)   出版者・発行元:IEEE International Conference on Communications  

    We have developed a real-time simulator that is connected to the network on-line and continuously uses the monitored IP traffic on AAL5/ATM. The simulator is software running on a real-time OS in a PC containing ATM network interface cards, which can use the information provided by the timestamp, VPI/VCI, IP address, protocol number, and port number of the monitored packets for the simulation. The simulator provides a simulation model of a multiplexer whose output link speed, buffer size, and queueing discipline can be changed by the user. In addition, we propose a simulation server that makes a simulation platform easily available. The simulator enables us to identify the appropriate amount of network resources, such as link speed and buffer size, and the effectiveness of various queueing disciplines. Numerical examples using the simulator in a real network are also shown.

    Scopus

  • Discrete Gompertz equation and a software reliability growth model 査読

    Satoh D.

    IEICE Transactions on Information and Systems   E83-D ( 7 )   1508 - 1513   2000年7月

     詳細を見る

    担当区分:筆頭著者   記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:IEICE Transactions on Information and Systems  

    I describe a software reliability growth model that yields accurate parameter estimates even with a small amount of input data. The model is based on a proposed discrete analog of a Gompertz equation that has an exact solution. The difference equation tends to a differential equation on which the Gompertz curve model is defined, when the time interval tends to zero. The exact solution also tends to the exact solution of the differential equation when the time interval tends to zero. The discrete model conserves the characteristics of the Gompertz model because the difference equation has an exact solution. Therefore, the proposed model provides accurate parameter estimates, making it possible to predict in the early test phase when software can be released.

    Scopus

  • A discrete gompertz equation and a software reliability growth model

    Satoh D.

    IEICE Transactions on Information and Systems   E83-D ( 7 )   2000年

     詳細を見る

    担当区分:筆頭著者   記述言語:英語   掲載種別:研究論文(学術雑誌)   出版者・発行元:IEICE Transactions on Information and Systems  

    I describe a software reliability growth model that yields accurate parameter estimates even with a small amount of input data. The model is based on a proposed discrete analog of a Gompertz equation that has an exact solution. The difference equation tends to a differential equation on which the Gompertz curve model is defined, when the time interval tends to zero. The exact solution also tends to the exact solution of the differential equation when the time interval tends to zero. The discrete model conserves the characteristics of the Gompertz model because the difference equation has an exact solution. Therefore, the proposed model provides accurate parameter estimates, making it possible to predict in the early test phase when software can be released.

    Scopus

  • Convergence to the Optimal Solution by Successive Control of Virtual Path Bandwidth 査読

    Daisuke Satoh, Shigeo Shioda

    Proceedings of 3rd APSITT   29 - 33   1999年9月

     詳細を見る

    担当区分:筆頭著者   記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    researchmap

  • Analysis of Preferences for Telecommunication Services in Each Area 査読

    Tohru Ueda, Daisuke Satoh

    Proceedings of the Fifth Conference of the International Federation of Classification Societies (IFCS-96)   708 - 715   1996年3月

     詳細を見る

    記述言語:英語   掲載種別:研究論文(国際会議プロシーディングス)  

    researchmap

▼全件表示

書籍等出版物

  • やさしいNGN/IPネットワーク技術箱 : これであなたもネットワーク技術のプロに

    鈴木, 滋彦, NTTアドバンステクノロジ株式会社ネットワークテクノロジセンタ( 担当: 分担執筆 範囲: QoS制御技術、将来ネットワーク技術)

    電気通信協会,オーム社 (発売)  2009年6月  ( ISBN:9784885490439

     詳細を見る

    総ページ数:525p   記述言語:日本語  

    CiNii Books

    researchmap

  • OR用語辞典

    日本オペレーションズ・リサーチ学会( 担当: 分担執筆 範囲: 生態学モデル,ロジスティックモデル,捕食者-被捕食者モデル)

    日科技連出版社  2000年4月  ( ISBN:4817150297

     詳細を見る

    総ページ数:ii, 258p   記述言語:日本語  

    CiNii Books

    researchmap

MISC

  • 巻頭言:離見の見

    佐藤大輔

    応用数理   32 ( 3 )   1   2022年9月

     詳細を見る

    担当区分:筆頭著者   記述言語:日本語  

    researchmap

  • 災害ふくそう対策研究―呼規制から行動変化誘導へ―

    佐藤大輔

    12 ( 4 )   301 - 311   2019年4月

     詳細を見る

    担当区分:筆頭著者   記述言語:日本語   掲載種別:記事・総説・解説・論説等(学術雑誌)  

    DOI: 10.1587/essfr.12.4_301

    researchmap

  • 電子メールを媒介としたコンピュータウィルス感染拡大モデル

    佐藤大輔, 内田真人

    応用数理   20 ( 3 )   50 - 55   2010年9月

     詳細を見る

    担当区分:筆頭著者   記述言語:日本語   掲載種別:記事・総説・解説・論説等(学術雑誌)  

    researchmap

  • Single PCN Threshold Marking by using PCN baseline encoding for both admission and termination controls

    Daisuke Satoh, Harutaka Ueno, Yuka Maeda, Oratai Phanache

    draft-satoh-pcn-st-marking-02   1 - 37   2009年9月

     詳細を見る

    担当区分:筆頭著者   記述言語:英語  

    researchmap

  • Performance evaluation of termination in CL-algorithm

    draft-satoh-pcn-performance-termination-00   1 - 11   2009年7月

     詳細を見る

    担当区分:筆頭著者   記述言語:英語  

    researchmap

  • Single PCN Threshold Marking by using PCN baseline encoding for both admission and termination controls

    Daisuke Satoh, Yuka Maeda, Oratai Phanache, Harutaka Ueno

    draft-satoh-pcn-st-marking-01   1 - 36   2009年3月

     詳細を見る

    担当区分:筆頭著者   記述言語:英語  

    researchmap

  • Single PCN Threshold Marking by using PCN baseline encoding for both admission and termination controls

    Daisuke Satoh, Mika Ishizuka, Oratai Phanache, Yuka Maeda

    draft-satoh-pcn-st-marking-00   1 - 22   2008年11月

     詳細を見る

    担当区分:筆頭著者   記述言語:英語  

    researchmap

  • 可積分差分による予測

    佐藤大輔

    数理科学   41 ( 9 )   2003年8月

     詳細を見る

    担当区分:筆頭著者   記述言語:日本語   掲載種別:記事・総説・解説・論説等(商業誌、新聞、ウェブメディア)  

    researchmap

  • 離散方程式の予測への応用

    佐藤大輔

    京大数理解析研講究録   1302   116116 - 136   2003年2月

     詳細を見る

    担当区分:筆頭著者   記述言語:日本語   掲載種別:速報,短報,研究ノート等(大学,研究機関紀要)  

    researchmap

  • Traffic and QoS monitor: ATM probe

    Satoh D., Ohara H., Abe T., Yokoi H.

    NTT Review   14 ( 4 )   30 - 33   2002年7月

     詳細を見る

    担当区分:筆頭著者   記述言語:英語   掲載種別:機関テクニカルレポート,技術報告書,プレプリント等   出版者・発行元:NTT Review  

    The ATM probe is a system intended for measuring traffic and QoS at each of the ATM, IP the TCP/UDP layers. The functions of this probe are realized by software in the PC. The probe has no effect on communication that is actually taking place. It also permits measurement without imposing a load on the network equipment.

    Scopus

  • マルチレイヤトラヒック・品質測定モニタリング装置の開発

    大原久樹, 佐藤大輔, 横井弘文, 阿部威郎

    NTT R&D   51 ( 1 )   48 - 58   2002年1月

     詳細を見る

    記述言語:日本語   掲載種別:機関テクニカルレポート,技術報告書,プレプリント等  

    researchmap

  • マルチレイヤトラヒック・品質測定モニタ ATMプローブ

    佐藤大輔, 大原久樹, 阿部威郎, 横井弘文

    NTT技術ジャーナル   14 ( 1 )   92 - 95   2002年1月

     詳細を見る

    担当区分:筆頭著者   記述言語:日本語   掲載種別:機関テクニカルレポート,技術報告書,プレプリント等  

    researchmap

  • Development of monitoring system to measure traffic and QoS of IP network

    Ohara H., Satoh D., Yokoi H., Abe T.

    NTT R and D   51 ( 1 )   48 - 58   2002年

     詳細を見る

    記述言語:日本語   掲載種別:機関テクニカルレポート,技術報告書,プレプリント等   出版者・発行元:NTT R and D  

    With networks like the Internet becoming increasingly utilized by businesses, network service providers are being asked to guarantee high QoS by making service level agreements with their users. To provide high QoS, they need to be able to measure network conditions in order to manage bandwidth and quality. In this paper, we introduce a monitoring system called "ATM probe", which measures traffic and QoS of IP-over-ATM packets.

    Scopus

▼全件表示

講演・口頭発表等

  • Economic Feasibility of Bandwidth Sharing Services with QoS Guarantees

    Shigeo Shioda, Daisuke Satoh, Hisao Yamamoto

    11th INFORMS Applied Probability Society Conference, pp. 20--21  2001年7月 

     詳細を見る

    記述言語:英語   会議種別:口頭発表(一般)  

    researchmap

  • Measurement of the Large Deviation Rate Function

    Daisuke Satoh, Shigeo Shioda

    11th INFORMS Applied Probability Society Conference, p.28  2001年7月 

     詳細を見る

    記述言語:英語   会議種別:口頭発表(一般)  

    researchmap

  • ゴンペルツ可積分差分方程式に基づく確率モデル化

    鈴木海斗, 黒沢健, 佐藤大輔

    信学技報, vol. 123, no. 399, R2023-62, pp. 42—45  2024年2月 

     詳細を見る

    記述言語:日本語   会議種別:口頭発表(一般)  

    researchmap

  • ユーザ行動変容による災害輻輳緩和 招待

    佐藤大輔, 持田岳美

    信学技報, vol. 123, no. 136, ICTSSL2023-16, pp. 15—20  2023年7月 

     詳細を見る

    記述言語:日本語   会議種別:口頭発表(招待・特別)  

    researchmap

  • 可積分差分方程式によるBassモデルの負パラメータ分析

    佐藤大輔

    日本オペレーションズ・リサーチ学会春季研究発表会, 1-B-6, pp. 40--41  2024年3月 

     詳細を見る

    記述言語:日本語   会議種別:口頭発表(一般)  

    researchmap

  • A method of Forecasting Demand for New Telecommunication Services

    Tohru Ueda, Tetsuji Suzuki, Daisuke Satoh

    9th European Meeting of the Psychometric Society  1995年7月 

     詳細を見る

    記述言語:英語   会議種別:口頭発表(一般)  

    researchmap

▼全件表示

受賞

  • テレコム学際研究賞

    2024年3月   電気通信普及財団  

    佐藤大輔, 持田岳美

     詳細を見る

  • 優秀研究賞

    2023年3月   電子情報通信学会 安全・安心な生活とICT研究会  

    佐藤大輔, 持田岳美

     詳細を見る

  • 貢献賞

    2020年9月   電子情報通信学会 基礎・境界ソサイエティ  

    佐藤大輔

     詳細を見る

  • 編集活動感謝状

    2019年9月   電子情報通信学会 基礎・境界ソサイエティ  

    佐藤大輔

     詳細を見る

  • 学術大会特別優秀発表賞

    2016年6月   日本心理学会  

    須藤竜之介, 佐藤大輔, 高野裕治, 持田岳美

     詳細を見る

  • ベストオーサー賞

    2011年9月   日本応用数理学会  

    佐藤大輔, 内田真人

     詳細を見る

  • 所長表彰

    2004年3月   NTTサービスインテグレーション基盤研究所   VoIPの輻輳制御に関する網羅的特許出願に対して

    佐藤大輔,森達哉

     詳細を見る

  • 社長表彰

    1999年10月   日本電信電話株式会社   ATMプローブの研究開発に対して

    斎藤洋,佐藤大輔,大原久樹

     詳細を見る

▼全件表示

担当経験のある科目(授業)

  • 経営システム特別講義

    2018年6月 - 2022年7月 機関名:法政大学

     詳細を見る

  • 基礎数学および演習

    2018年4月 - 2023年8月 機関名:千葉工業大学

     詳細を見る

  • 計量管理

    2013年9月 - 2017年3月 機関名:工学院大学

     詳細を見る

  • Cプログラミング入門

    2003年4月 - 2015年8月 機関名:早稲田大学

     詳細を見る

  • コンピュータリテラシー

    2002年9月 - 2012年3月 機関名:早稲田大学

     詳細を見る

社会貢献活動

  • 日本技術士会技術士第一次試験委員

    日本技術士会技術士  2014年3月 - 2018年2月

     詳細を見る

    種別:その他

    researchmap