Updated on 2024/02/01

写真a

 
YOSHIDA Masahiro
 
Organization
Faculty of Global Informatics Associate Professor
Other responsible organization
Global Informatics Course of Graduate School of Global Informatics, Master's Program
External link

Degree

  • 博士(学際情報学) ( 東京大学 )

Professional Memberships

  • IEICE

Research Interests

  • Internet of Things

  • AI

Research Areas

  • Informatics / Information network  / Information network

  • Manufacturing Technology (Mechanical Engineering, Electrical and Electronic Engineering, Chemical Engineering) / Communication and network engineering  / Communication/Network engineering

Papers

  • EdgeRE: An Edge Computing-enhanced Network Redundancy Elimination Service for Connected Cars

    IEEE IoTNAT2021   2021

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)  

    researchmap

  • 2020年度ネットワークシステム研究会における研究動向報告

    電子情報通信学会NS研究会   2021

     More details

    Language:Japanese   Publishing type:Research paper (conference, symposium, etc.)  

    researchmap

  • 情報系学部におけるBYOD 利用の試み

    飯尾淳, 岡嶋裕史, 尾登啓一, 角田篤泰, 小花聖輝, 原田一義, 松崎和賢, 吉田雅裕

    ICT利用による教育改善研究発表会   2019

     More details

    Language:Japanese   Publishing type:Research paper (conference, symposium, etc.)   Publisher:公益社団法人私立大学情報教育協会  

    researchmap

  • エッジを活用した自律型モビリティのデータ圧縮方式 Invited

    吉田雅裕, 森航哉, 井上知洋, 田中裕之

    電子情報通信学会NS研究会   2019

     More details

    Language:Japanese   Publishing type:Research paper (conference, symposium, etc.)   Publisher:電子情報通信学会  

    researchmap

  • Multi-access edge computing: A survey Invited Reviewed

    Hiroyuki Tanaka, Masahiro Yoshida, Koya Mori, Noriyuki Takahashi

    Journal of Information Processing   26   87 - 97   2018.1

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:Information Processing Society of Japan  

    Multi-access Edge Computing (MEC) can be defined as a model for enabling business oriented, cloud computing platform within multiple types of the access network (e.g., LTE, 5G, WiFi, FTTH, etc.) at the close proximity of subscribers to serve delay sensitive, context aware applications. To pull out the most of the potential, MEC has to be designed as infrastructure, to support many kind of IoT applications and their eco system, in addition to sufficiently management mechanism. In this context, various research and standardization efforts are ongoing. This paper provides a comprehensive survey of the state-of-the-art research efforts on MEC domain, with focus on the architectural proposals as infrastracture, the issue of the partitioning of processing among the user devices, edge servers, and a cloud, and the issue of the resource management.

    DOI: 10.2197/ipsjjip.26.87

    Scopus

    researchmap

  • カメラ映像を収集するユースケースにおけるエッジコンピューティングを活用した映像トラヒック削減方式

    塩田純, 吉田雅裕, 高橋紀之

    電子情報通信学会NS研究会   2018

     More details

    Language:Japanese   Publishing type:Research paper (conference, symposium, etc.)   Publisher:電子情報通信学会  

    researchmap

  • 垂直分散環境における開発者による関数定義に非依存なアプリケーション分割方式の検討 Invited

    松尾和哉, 吉田雅裕, 高橋紀之, 田中裕之

    電子情報通信学会NS研究会   2018

     More details

    Language:Japanese   Publishing type:Research paper (conference, symposium, etc.)   Publisher:電子情報通信学会  

    researchmap

  • 自律型モビリティにおけるエッジサーバ切り替え予測方式

    吉田雅裕, 中田亮太, 森航哉, 井上知洋, 荒川豊, 高橋紀之, 田中裕之

    電子情報通信学会NS研究会   2018

     More details

    Language:Japanese   Publishing type:Research paper (conference, symposium, etc.)   Publisher:電子情報通信学会  

    researchmap

  • エッジコンピューティングを活用した車載カメラ映像トラヒック削減方式における実車実験評価

    塩田 純, 吉田 雅裕, 森 航哉, 高橋 紀之, 田中 裕之

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

     More details

    Language:Japanese   Publishing type:Research paper (conference, symposium, etc.)   Publisher:電子情報通信学会  

    researchmap

  • 垂直分散環境における関数定義に非依存なアプリケーション自動分割システムのプロトタイプの設計と実装

    松尾和哉, 吉田雅裕, 田中裕之

    電子情報通信学会NS研究会   2018

     More details

    Language:Japanese   Publishing type:Research paper (conference, symposium, etc.)   Publisher:電子情報通信学会  

    researchmap

  • Assessment of Physical Resource Specification in Hierarchical Edge Computing Architecture Implementation

    L. Andarini, M. Yoshida, N. Takahashi, H. Tanaka

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

     More details

    Language:Japanese   Publishing type:Research paper (conference, symposium, etc.)   Publisher:電子情報通信学会  

    researchmap

  • 自律型モビリティへのエッジコンピューティングの適用 Invited

    吉田雅裕

    電子情報通信学会ICM研究会   2017

     More details

    Language:Japanese   Publishing type:Research paper (conference, symposium, etc.)   Publisher:電子情報通信学会  

    researchmap

  • エッジコンピューティングにおけるモビリティ管理方式の一検討

    吉田雅裕, 中田亮太, 森航哉, 荒川豊, 高橋紀之, 田中裕之

    電子情報通信学会RCS研究会   2017

     More details

    Language:Japanese   Publishing type:Research paper (conference, symposium, etc.)   Publisher:電子情報通信学会  

    researchmap

  • エッジコンピューティングを用いた映像トラヒック削減方式

    塩田純, 吉田雅裕, 中田亮太, 森航哉, 高橋紀之, 田中裕之

    電子情報通信学会ASN研究会   2017

     More details

    Language:Japanese   Publishing type:Research paper (conference, symposium, etc.)   Publisher:電子情報通信学会  

    researchmap

  • Proof of Concept: Latency Estimation using Reusable Microservices Latency Profile Dictionary

    L. Andarini, M. Yoshida, N. Takahashi, H. Tanaka

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

     More details

    Language:English   Publishing type:Research paper (conference, symposium, etc.)   Publisher:電子情報通信学会  

    researchmap

  • Using the Edge to Drive Progress in Connected Cars and Autonomous Vehicles Invited Reviewed

    M. Yoshida

    Proc. of MEC Congress’17   2017

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:MEC Congress  

    researchmap

  • SDN/NFV展開に向けたSDNソフトウェアスイッチ「Lagopus」と仮想化サービスオーケストレータ「vConductor」 Reviewed

    坂井田規夫, 高橋宏和, 吉田雅裕, 日比智也

    NTT技術ジャーナル   28 ( 1 )   14 - 18   2016

     More details

    Language:Japanese   Publishing type:Research paper (bulletin of university, research institution)   Publisher:NTT  

    CiNii Books

    researchmap

  • SDN Software Switch “Lagopus” and NFV Service Orchestrator “vConductor” for Developing SDN/NFV Reviewed

    N. Sakaida, K. Takahashi, M. Yoshida, T. Hibi

    NTT Technical Review   2016

     More details

    Language:English   Publishing type:Research paper (bulletin of university, research institution)   Publisher:NTT  

    researchmap

  • vConductor: An Enabler for Achieving Virtual Network Integration as a Service Reviewed

    Wenyu Shen, Masahiro Yoshida, Kenji Minato, Wataru Imajuku

    IEEE COMMUNICATIONS MAGAZINE   53 ( 2 )   116 - 124   2015.2

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC  

    Network function virtualization is regarded as a promising candidate for future networks. Although many advantages are expected, there is still a lack of services that directly link to increased revenue for telecom operators. Therefore, we propose a new NFV-based service, virtual network integration as a service (VNIaaS). The service allows enterprise network administrators to construct and monitor virtual enterprise networks as necessary. As a key enabler, we further propose vConductor, an innovative technology due to its automatic network provisioning, multi-objective resource scheduling, and NFV-oriented inventory management characteristics. Finally, we show the feasibility through implementation of a prototype system. We believe that this contribution will be a catalyst to accelerate the industrialization of NFV.

    Web of Science

    researchmap

  • ETSI ISG NFVを中心としたE2Eオーケストレーションを目指した取り組みについて Invited

    清水敬司, 吉田雅裕

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

     More details

    Language:Japanese   Publishing type:Research paper (conference, symposium, etc.)   Publisher:電子情報通信学会  

    researchmap

  • WAN接続制御に向けたNFVオーケストレータ要求条件の一検討

    山崎敬広, 谷口篤, 吉田雅裕, 片山翔子, 川幡太一, 坂井田規夫

    電子情報通信学会NV研究会   2015

     More details

    Language:Japanese   Publishing type:Research paper (conference, symposium, etc.)   Publisher:電子情報通信学会  

    researchmap

  • Impact on placement of management data of NFV service orchestrating across multiple data centers and WANs Reviewed

    A. Taniguchi, T. Yamazaki, M. Yoshida, T. Kawabata, N. Sakaida, T. Shimizu

    Proc. of IEEE CNSM15   2015

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:IEEE  

    researchmap

  • 複数事業者のインフラを活用可能なネットワークシステムの自動構築技術の研究

    吉田雅裕, 山崎敬広, 谷口篤, 川幡太一, 坂井田規夫, 清水敬司

    電子情報通信学会NV研究会   2015

     More details

    Language:Japanese   Publishing type:Research paper (conference, symposium, etc.)   Publisher:電子情報通信学会  

    researchmap

  • 複数のデータセンタを跨るNFVを考慮した構成管理情報の配備方法に関する検討

    谷口篤, 山崎敬広, 吉田雅裕, 川幡太一, 坂井田規夫, 清水敬司

    電子情報通信学会ICM研究会   2015 ( 12 )   1 - 6   2015

     More details

    Language:Japanese   Publishing type:Research paper (conference, symposium, etc.)   Publisher:電子情報通信学会  

    In this study, we have studied on placement of management data based on NFV reference model for the use case of the NFV orchestrating across the data center and the wide area network (WAN).

    CiNii Books

    researchmap

  • 仮想化サービスオーケストレータの初期検討

    沈文裕, 吉田雅裕, 川幡太一, 湊賢治, 今宿亙

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

     More details

    Language:Japanese   Publishing type:Research paper (conference, symposium, etc.)   Publisher:電子情報通信学会  

    researchmap

  • NFVI資源最適化のための多目的遺伝アルゴリズムの適用

    吉田雅裕, 沈文裕, 湊賢治, 今宿亙

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

     More details

    Language:Japanese   Publishing type:Research paper (conference, symposium, etc.)   Publisher:電子情報通信学会  

    researchmap

  • vConductor: An NFV Management Solution for Realizing End-to-End Virtual Network Services Reviewed

    Wenyu Shen, Masahiro Yoshida, Taichi Kawabata, Kenji Minato, Wataru Imajuku

    2014 16th Asia-Pacific Network Operations and Management Symposium (APNOMS)   2014

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:IEEE  

    NFV, being discussed and standardized in ETSI, is regarded as a promising candidate technology for Future Networks. Although many advantages are expected, the introduction of NFV will greatly challenge current management systems. In this paper, we summarize some of the carrier's requirements for the management of NFV, based on which we propose vConductor as an NFV management solution. We say vConductor is innovative due to its characteristics of automatic service provisioning, end-to-end inventory management, and generic system design. To achieve these goals, we design a completely modular-based system structure and refine the process of provisioning a virtual network service. Furthermore, we propose a general data model, specifically for NFV, starting from the TM Forum SID. We believe that vConductor will be a catalyst for accelerating the industrialization of NFV.

    Web of Science

    researchmap

  • MORSA: A Multi-objective Resource Scheduling Algorithm for NFV Infrastructure Reviewed

    M. Yoshida, W. Shen, T. Kawabata, K. Minato, W. Imajuku

    2014 16th Asia-Pacific Network Operations and Management Symposium (APNOMS)   2014

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:IEEE  

    Capital expenditure (CAPEX) and operating expenses (OPEX) have been practical concerns for telecommunication companies, and Network Function Virtualization (NFV) has attracted significant attention in recent years. However, the NFV Infrastructure (NFVI) includes a wide variety of resource types and stakeholders. Hence, there is still a need for the existing resource scheduling approaches, but they are no longer sufficient. In this paper, we propose a Multi-objective Resource Scheduling Algorithm (MORSA) to optimize the NFVI resources. In the development of the MORSA, we designed a plug-in architecture to satisfy various requirements related to NFVI resources and stakeholder policies. The MORSA allows the NFVI Resource Scheduler to optimize simultaneously the combination of possibly conflicting objectives with multifaceted constraints in complex real world situations. Evaluation results show that the MORSA obtains approximate solutions among conflicting objectives in a reasonable computation time.

    Web of Science

    researchmap

  • ネットワーク資源を考慮したNFV基盤管理モジュールの初期検討

    吉田雅裕, 沈文裕, 川幡太一, 湊賢治, 今宿亙

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

     More details

    Language:Japanese   Publishing type:Research paper (conference, symposium, etc.)   Publisher:電子情報通信学会  

    researchmap

  • Deep Inspection of Unreachable BitTorrent Swarms Reviewed

    Masahiro Yoshida, Akihiro Nakao

    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS   E96D ( 2 )   249 - 258   2013.2

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG  

    BitTorrent is one of the most popular P2P file sharing applications worldwide. Each BitTorrent network is called a swarm, and millions of peers may join multiple swarms. However, there are many unreachable peers (NATed (network address translated), firewalled, or inactive at the time of measurement) in each swarm; hence, existing techniques can only measure a part of all the peers in a swarm. In this paper, we propose an improved measurement method for BitTorrent swarms that include many unreachable peers. In essence, NATed peers and those behind firewalls are found by allowing them to connect to our crawlers by actively advertising our crawlers' addresses. Evaluation results show that the proposed method increases the number of unique contacted peers by 112% compared to the conventional method. Moreover, the proposed method increases the total volume of downloaded pieces by 66%. We investigate the sampling bias among the proposed and conventional methods, and we find that different measurement methods yield significantly different results.

    DOI: 10.1587/transinf.E96.D.249

    Web of Science

    researchmap

  • P2P Network Measurement and Management Techniques Reviewed

    Masahiro Yoshida

    Ph.D. Thesis   2013

     More details

    Language:English   Publishing type:Doctoral thesis   Publisher:Applied Computer Science Course, The Graduate School of Interdisciplinary Information Studies, The University of Tokyo  

    researchmap

  • Caching-Based Multi-Swarm Collaboration for Improving Content Availability in BitTorrent Reviewed

    HyunYong Lee, Masahiro Yoshida, Akihiro Nakao

    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS   E95D ( 5 )   1446 - 1453   2012.5

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG  

    Despite its great success, Bit Torrent suffers from the content unavailability problem where peers cannot complete their content downloads due to some missing chunks, which is caused by a shortage of seeders who hold the content in its entirety. The multi-swarm collaboration approach is a natural choice for improving content availability, since content unavailability cannot be overcome by one swarm easily. Most existing multi-swarm collaboration approaches, however, suffer from content-related limitations, which limit their application scopes. In this paper, we introduce a new kind of multi-swarm collaboration utilizing a swarm as temporal storage. In a nutshell, the collaborating swarms cache some chunks of each other that are likely to be unavailable before the content unavailability happens and share the cached chunks when the content unavailability happens. Our approach enables any swarms to collaborate with each other without the content-related limitations. Simulation results show that our approach increases the number of download completions by over 50% (26%) compared to normal Bit Torrent (existing bundling approach) with low overhead. In addition, our approach shows around 30% improved download completion time compared to the existing bundling approach. The results also show that our approach enables the peers participating in our approach to enjoy better performance than other peers, which can be a peer incentive.

    DOI: 10.1587/transinf.E95.D.1446

    Web of Science

    researchmap

  • 大規模ネットワークデータ解析のためのマルチレベルグラフレイアウト

    宮村(中村)浩子, 吉田雅裕, 大坐畠智, 高橋成雄, 中尾彰宏, 川島幸之助

    電子情報通信学会NS研究会   2012

     More details

    Language:Japanese   Publishing type:Research paper (conference, symposium, etc.)   Publisher:電子情報通信学会  

    researchmap

  • Visualizing Scale Free Networks for the Analysis of P2P Network Traffic Data

    佐々木海, 吳湘筠, 吉田雅裕, 宮村(中村)浩子, 大坐畠智, 中尾彰宏, 高橋成雄

    電子情報通信学会NS研究会   2012

     More details

    Language:Japanese   Publishing type:Research paper (conference, symposium, etc.)   Publisher:電子情報通信学会  

    researchmap

  • BPEX: Improving The BitTorrent Locality via Biased Peer Exchange Invited

    M. Yoshida, A. Nakao

    電子情報通信学会NS研究会   2012

     More details

    Language:Japanese   Publishing type:Research paper (conference, symposium, etc.)   Publisher:電子情報通信学会  

    researchmap

  • Trading Seeder Bandwidth for Efficient Content Distribution in Swarming System Reviewed

    HyunYong Lee, Masahiro Yoshida, Akihiro Nakao

    2012 IEEE CONSUMER COMMUNICATIONS AND NETWORKING CONFERENCE (CCNC)   413 - 417   2012

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:IEEE  

    Although Bit Torrent scales well to support large peer populations, the non-uniform seeder distribution over swarms leads to suboptimal content distribution. In this paper, we propose Seeder Trading enabling the over-seeded swarms to trade the seeder bandwidth with the under-seeded swarms to examine the potential improvement through trading seeder bandwidth across swarms. Simulation results show that the under-seeded swarms can improve the content download performance while retaining the performance of over-seeded swarms, which means the content distribution performance and efficiency are improved. We also show that the trading seeder bandwidth across swarms can be done within short time (i.e., 60 seconds in our simulation).

    Web of Science

    researchmap

  • On Feasibility of P2P Traffic Control through Network Performance Manipulation Reviewed

    HyunYong Lee, Masahiro Yoshida, Akihiro Nakao

    2012 IEEE NETWORK OPERATIONS AND MANAGEMENT SYMPOSIUM (NOMS)   615 - 618   2012

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:IEEE  

    In this paper, we propose a new kind of P2P traffic control technique, called Netpherd exploiting the peer selection adaptation (i.e., preferring peers who are likely to provide better performance). Netpherd tries to enable the peers to communicate with the peers of the local domain by manipulating network performance (i.e., adding an artificial delay to the inter-domain traffic) at network device like router. Simulation results show that Netpherd can increases (decreases) the intra-domain (inter-domain) traffic by affecting the peer selection adaptation. Netpherd also improves the content download performance.

    Web of Science

    researchmap

  • BPEX: Localizing BitTorrent traffic via biased peer exchange Reviewed

    Masahiro Yoshida, Akihiro Nakao

    Proceedings - 2012 7th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing, 3PGCIC 2012   41 - 48   2012

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:IEEE  

    In recent years, BitTorrent traffic accounts for a substantial percentage of Internet traffic in the world. However, the current BitTorrent protocols disregards traffic cost at the underlying network and generate a large amount of inter-AS traffic. As a result, BitTorrent peers may suffer from slow download of files due to long delays. Moreover, ISPs may limit BitTorrent traffic to reduce inter-AS traffic. In this paper, we propose a new approach localizing BitTorrent traffic within neighboring ASes, gBPEXh, in which a controller and peers directly exchange lists of peer in the vicinity through BitTorrent's PEX protocol. Conducting experiments on Planet Lab, we show that BPEX significantly reduces inter-AS traffic and peers' download completion time. © 2012 IEEE.

    DOI: 10.1109/3PGCIC.2012.15

    Scopus

    researchmap

  • Winnyネットワークにおける検索クエリの遮断によるファイル流通制御方式 Invited Reviewed

    中澤大暁, 吉田雅裕, 大坐畠智, 中尾彰宏, 川島幸之助

    電子情報通信学会論文誌   J95-B ( 5 )   636 - 648   2012

     More details

    Language:Japanese   Publishing type:Research paper (scientific journal)   Publisher:電子情報通信学会  

    researchmap

  • Understanding of Network Operator-Friendly P2P Traffic Control Techniques Reviewed

    HyunYong Lee, Akihiro Nakao

    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS   E94D ( 12 )   2460 - 2467   2011.12

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG  

    In the network operator-friendly P2P traffic control technique such as P4P, peers are supposed to select their communication partners by following a guidance issued by the network operator. Thus, the guidance has significant impact on the traffic control. However, detailed performance study of available guidances is missing. Most existing approaches do not show how they affect intra-domain traffic control in detail while mostly focusing on inter-domain traffic control. In this paper, we try to understand how the guidances affect the intra and inter-domain traffic control for better guidance improving the traffic control. Through simulations, we reveal the following. The performance-based guidance reflecting the networking status shows attractive results in distributing the traffic over intra-domain links and in reducing the cross-domain traffic and the charging volume of inter-domain link compared to the distance-based guidance enforcing simple localization. However, the performance-based guidance shows one limitation that can cause unstable traffic control. To overcome the identified limitation, we propose peer-assisted measurement and traffic estimation approach. Then, we verify our approach through simulations.

    DOI: 10.1587/transinf.E94.D.2460

    Web of Science

    researchmap

  • Multi-Swarm Collaboration for Improving Content Availability in Swarming Systems Reviewed

    HyunYong Lee, Masahiro Yoshida, Akihiro Nakao

    2011 20TH INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS AND NETWORKS (ICCCN)   2011

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:IEEE  

    Despite its great success, BitTorrent suffers from a content unavailability problem where peers can not complete their content downloads due to some missing chunks, which is caused by an absence of seeders. Multi-swarm collaboration approach is a natural choice for improving the content availability, since the content unavailability can not be managed by one swarm easily. Most existing multi-swarm collaboration approaches, however, show content-related limitations, which limit their application scopes. In this paper, we introduce a new kind of multi-swarm collaboration utilizing a swarm as a temporal storage. In a nutshell, the collaborating swarms cache some chunks of each other that are likely to be unavailable when the seeders are online and share the cached chunks when the content unavailability happens. Our approach enables any swarms to collaborate with each other without the content-related limitations. Simulation results show that our approach improves the number of download completions by over 50% compared to vanilla BitTorrent with low caching overhead. The results also show that our approach enables the peers participating in our approach to enjoy better performance than other peers, which can be an peer incentive.

    Web of Science

    researchmap

  • Measuring BitTorrent Swarms Beyond Reach Reviewed

    Masahiro Yoshida, Akihiro Nakao

    2011 IEEE INTERNATIONAL CONFERENCE ON PEER-TO-PEER COMPUTING (P2P)   220 - 229   2011

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:IEEE  

    BitTorrent is one of the most popular P2P file sharing applications in the world. Each BitTorrent network is called a swarm and millions of peers may join multiple swarms. However, there are many unreachable peers (NATed, Fire-Walled, or inactive at the time of the measurement) in each swarm. Due to this unreachable peers problem, the existing work can measure only a part of the entire peers in a swarm. In this paper, we propose an improved measurement method for BitTorrent swarms that many unreachable peers. In a nutshell, our crawler obtains peers behind NAT and firewalls by letting them connect to our crawlers through actively advertising our crawlers addresses to them. The evaluation result shows that our proposed method increases the number of unique contacted peers by 112 % compared to the conventional method. The proposed method also increases the total volume of downloaded pieces by 66 %. We then investigate the sampling bias among our proposed method and conventional methods, and find that different measurement methods can lead to significantly different measurement results.

    Web of Science

    researchmap

  • Shareネットワークに対するコンテンツポイズニングを用いたファイル流通制御方式 Invited Reviewed

    吉田雅裕, 大坐畠智, 中尾彰宏, 川島幸之助

    電子情報通信学会論文誌   J94-B ( 5 )   686 - 697   2011

     More details

    Language:Japanese   Publishing type:Research paper (scientific journal)   Publisher:電子情報通信学会  

    researchmap

  • ピア特性とネットワーク構造に着目したP2P検索ネットワーク制御方式

    中澤大暁, 吉田雅裕, 大坐畠智, 中尾彰宏, 川島幸之助

    電子情報通信学会IN研究会   2011

     More details

    Language:Japanese   Publishing type:Research paper (conference, symposium, etc.)   Publisher:電子情報通信学会  

    researchmap

  • 複数BitTorrentネットワークにおける資源効率的なSwarm情報計測手法

    吉田雅裕, 中尾彰宏

    電子情報通信学会CQ研究会   2011

     More details

    Language:Japanese   Publishing type:Research paper (conference, symposium, etc.)   Publisher:電子情報通信学会  

    researchmap

  • 到達不可能ピアの影響を抑えたBitTorrentネットワーク計測方式

    吉田雅裕, 中尾彰宏

    電子情報通信学会NS研究会   111 ( 196 )   35 - 40   2011

     More details

    Language:Japanese   Publishing type:Research paper (conference, symposium, etc.)   Publisher:電子情報通信学会  

    BitTorrent is one of the most popular P2P file sharing applications in the world. Each BitTorrent network is called a swarm and millions of peers may join multiple swarms. However, there are many unreachable peers (NATed, FireWalled, or inactive at the time of the measurement) in each swarm. Due to this unreachable peers problem, the existing work can measure only a part of the entire peers in a swarm. In this paper, we propose an improved measurement method for BitTorrent swarms that include many unreachable peers. In a nutshell, our crawler obtains peers behind NAT and firewalls by letting them connect to our crawlers through actively advertising our crawlers addresses to them. The evaluation result shows that our proposed method increases the number of unique contacted peers by 112 % compared to the conventional method. The proposed method also increases the total volume of downloaded pieces by 66 %.

    CiNii Books

    researchmap

  • SeederTrading: Trading swarm capacity for improving content distribution Reviewed

    Hyun Yong Lee, Masahiro Yoshida, Akihiro Nakao

    IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum   1587 - 1594   2011

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:IEEE  

    A surplus seeding capacity is often observed in large swarms with many seeders while small swarms with few seeders suffer from low download performance. In this paper, we propose a multi-swarm collaboration approach, called Seed-erTrading to improve overall content distribution performance by exploiting non-uniform distribution of seeders over swarms. In a nutshell, we enable the over-seeded swarms to share their surplus seeding capacity with the under-seeded swarms. To realize the SeederTrading, we resolve several issues including estimation of swarm capacity, selection of swarms to be matched, and seeder trading across the selected swarms. Our extensive measurement shows that 12.9% of under-seeded swarms can achieve their maximum download throughput by utilizing the surplus seeding capacity. Simulation results show that the under-seeded swarms can improve the download performance by over 20% while retaining the content distribution performance of over-seeded swarms. We also show that the trading seeding capacity across swarms can be done within 60 seconds. © 2011 IEEE.

    DOI: 10.1109/IPDPS.2011.313

    Scopus

    researchmap

  • A resource-efficient method for crawling swarm information in multiple BitTorrent networks Reviewed

    Masahiro Yoshida, Akihiro Nakao

    Proceedings - 2011 10th International Symposium on Autonomous Decentralized Systems, ISADS 2011   497 - 502   2011

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:IEEE  

    BitTorrent is one of the most popular P2P file sharing applications in the world. Each BitTorrent network is called a swarm and millions of peers may join multiple swarms. Due to swarm's large network size and complexity, many resources (PC servers, the Internet connection, etc.) are required for measuring all the swarms in the world. For this reason, the existing work is forced to measure only a part of the entire set of swarms, thus, ends up understanding only a part of it. In this paper, we propose a resource-efficient method for crawling multiple BitTorrent swarms by only a limited amount of resources such as a single PC server. In the proposed method, our crawler avoids collecting redundant information of swarms without pressing WAN access links nor expending much processing resources. We also use a number of techniques to efficiently crawl all the participating peers of multiple swarms. We crawl over 4.3 million unique. torrent files, small files that store metadata used in BitTorrent, and 48,000 tracker addresses. We can crawl 4.3 million swarms within an hour. We obtain 24 swarm snapshots and 10 million unique peers in a day.

    DOI: 10.1109/ISADS.2011.72

    Scopus

    researchmap

  • P2Pファイル共有ネットワークにおけるポイズニングの動的な適用方式

    吉田雅裕, 大坐畠智, 中尾彰宏, 川島幸之助

    電子情報通信学会NS研究会   2010

     More details

    Language:Japanese   Publishing type:Research paper (conference, symposium, etc.)   Publisher:電子情報通信学会  

    researchmap

  • Controlling File Distribution in The Share Network Through Content Poisoning Reviewed

    Masahiro Yoshida, Satoshi Ohzahata, Akihiro Nakao, Konosuke Kawashima

    2010 24TH IEEE INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION NETWORKING AND APPLICATIONS (AINA)   1004 - 1011   2010

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:IEEE COMPUTER SOC  

    Peer-to-Peer (P2P) file sharing applications have dramatically increased in popularity for the past few years. Although a P2P file sharing network shares many files, it does not usually have a management and control mechanism for the files exchanged. Consequently, copyright infringement and malware propagation in P2P file sharing networks have become prevalent. In order to prevent these file distribution, content poisoning has attracted much attention recently. Although content poisoning aims to obfuscate users by diffusing a lot of poisoned chunks in P2P networks, its effect to the networks have not been well studied yet. In this paper, we apply content poisoning to "Share", one of the most popular P2P file sharing applications in Japan, to control its file distribution. Our evaluation includes how effective our proposed content poisoning method to a live Share network composed of over 100,000 active peers. The evaluation result shows that our content poisoning method decreases the number of peers that complete file download to less than 5% compared to the case without our control. Our content poisoning method also reduces additional traffic required for poisoning to 4%.

    DOI: 10.1109/AINA.2010.68

    Web of Science

    researchmap

  • P2Pファイル共有ネットワークのグラフ的特徴の解析および評価

    平野誠, 吉田雅裕, 大坐畠智, 川島幸之助

    情報処理学会全国大会   2010

     More details

    Language:Japanese   Publishing type:Research paper (conference, symposium, etc.)   Publisher:情報処理学会  

    researchmap

  • An Analysis of the P2P Traffic Characteristics on File Transfers Between Prefectures and Between Autonomous Systems in the Winny Network Reviewed

    Takashi Koizumi, Masahiro Yoshida, Satoshi Ohzahata, Konosuke Kawashima

    2010 16TH ASIA-PACIFIC CONFERENCE ON COMMUNICATIONS (APCC 2010)   147 - 152   2010

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:IEEE  

    Peer-to-peer (P2P) file-sharing applications are now widely used. The traffic generated by the P2P applications occupies a significant proportion of Internet traffic, and has an enormous impact on the backbone networks. Since these peers communicate by constructing virtual overlay routes, which are constructed independently from the IP networks topology, the characteristics of P2P traffic between regional networks such as those in prefectures and Autonomous Systems (ASs) have become an important issue. Consequently, it is necessary to understand the actual status of the characteristics of traffic matrices in order to construct and manage future networks. In this paper, we measured and analyzed the file transfer characteristics, such as traffic matrices, between prefectures and between ASs, by identifying file transfers between peers in Winny network, one of the most popular P2P applications in Japan. The results reveal that Winny increases traffic between prefectures and ASs, because file transfers in Winny network does not take account of locality.

    Web of Science

    researchmap

  • A Method for Controlling Search in a Pure P2P File Sharing Network Reviewed

    H. Nakazawa, M. Yoshida, S. Ohzahata, A. Nakao, K. Kawashima

    Proc. of IEEE APSITT2010   1 - 6   2010

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:IEEE  

    researchmap

  • Winnyネットワークにおける都道府県間及びAS間のファイルトラヒック交流特性

    小泉貴嗣, 吉田雅裕, 大坐畠智, 川島幸之助

    電子情報通信学会IN研究会   2010

     More details

    Language:Japanese   Publishing type:Research paper (conference, symposium, etc.)   Publisher:電子情報通信学会  

    researchmap

  • Winnyネットワークにおける検索ネットワーク制御方式

    中澤大暁, 吉田雅裕, 大坐畠智, 中尾彰宏, 川島幸之助

    電子情報通信学会IN研究会   2010

     More details

    Language:Japanese   Publishing type:Research paper (conference, symposium, etc.)   Publisher:電子情報通信学会  

    researchmap

  • ファイル検索クエリを用いたWinnyネットワークのトポロジ測定

    プトゥラプラタマ, 吉田雅裕, 大坐畠智, 中尾彰宏, 川島幸之助

    電子情報通信学会NS研究会   2009

     More details

    Language:Japanese   Publishing type:Research paper (conference, symposium, etc.)   Publisher:電子情報通信学会  

    researchmap

  • A Measurement Method for Capturing Winny Network Topology

    P. Putra, M. Yoshida, S. Ohzahata, A. Nakao, K. Kawashima

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

     More details

    Language:Japanese   Publishing type:Research paper (conference, symposium, etc.)   Publisher:電子情報通信学会  

    researchmap

  • Shareネットワークにおけるコンテンツポイズニングの適用と評価

    吉田雅裕, 大坐畠智, 中尾彰宏, 川島幸之助

    電子情報通信学会NS研究会   2009

     More details

    Language:Japanese   Publishing type:Research paper (conference, symposium, etc.)   Publisher:電子情報通信学会  

    researchmap

  • Controlling File Distribution in Winny Network Through Index Poisoning Reviewed

    Masahiro Yoshida, Satoshi Ohzahata, Akihiro Nakao, Konosuke Kawashima

    ICOIN: 2009 INTERNATIONAL CONFERENCE ON INFORMATION NETWORKING   210 - +   2009

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:IEEE  

    Peer-to-Peer (P2P) file sharing networks have witnessed dramatic increase in popularity for the past few years. In order to meet the demand of users, most P2P file sharing networks have been primarily focusing on improving transmission efficiency and network scalability. However, these networks do not usually have management mechanisms for distributing files in general. Consequently, copyright infringements in P2P file sharing networks have become prevalent. In order to prevent illegal file distribution, several anti-P2P companies have controlled the file distribution by index poisoning. Although index poisoning aims to obfuscate uses by diffusing a lot of dummy metadata in P2P networks, its effects have not been well studied yet. In this paper, we apply index poisoning to a Winny network, one of the most popular P2P file sharing networks in Japan, to control the file distribution. Our evaluation includes index poisoning in a live Winny network composed of over 100,000 active peers. The result shows that our proposed method can decrease the number of query hits to less than 0.004% compared to the case without our control, and that index poisoning is effective to control a small number of files. However, the result also shows that the index poisoning could cause a serious damage on a Winny network, when many files are under our control simultaneously.

    Web of Science

    researchmap

  • Winnyネットワークに対するインデックスポイズニングを用いたファイル流通制御方式 Reviewed

    吉田雅裕, 大坐畠智, 中尾彰宏, 川島幸之助

    情報処理学会論文誌   50 ( 8 )   2008 - 2022   2009

     More details

    Language:Japanese   Publishing type:Research paper (scientific journal)   Publisher:情報処理学会  

    researchmap

  • Winnyネットワークにおけるファイル移動トラヒック特性の測定と分析

    小泉貴嗣, 吉田雅裕, 大坐畠智, 川島幸之助

    電子情報通信学会CQワークショップ「コミュニケーション品質を見る技術」   2009

     More details

    Language:Japanese   Publishing type:Research paper (conference, symposium, etc.)   Publisher:電子情報通信学会  

    researchmap

  • ピュアP2Pアプリケーションにおけるファイル検索制御法の提案とその測定分析

    中澤大暁, 吉田雅裕, 大坐畠智, 川島幸之助

    電子情報通信学会NS研究会   109 ( 3 )   55 - 58   2009

     More details

    Language:Japanese   Publishing type:Research paper (conference, symposium, etc.)   Publisher:電子情報通信学会  

    researchmap

  • Winnyネットワークにおけるインデックスポイゾニングの適用と評価

    吉田雅裕, 大坐畠智, 中尾彰宏, 川島幸之助

    電子情報通信学会NS研究会   2008

     More details

    Language:Japanese   Publishing type:Research paper (conference, symposium, etc.)   Publisher:電子情報通信学会  

    researchmap

  • P2Pファイル共有ネットワークにおけるポイゾニング手法を用いたファイル流通制御方式

    吉田雅裕, 大坐畠智, 川島幸之助

    情報処理学会全国大会   2008

     More details

    Language:Japanese   Publishing type:Research paper (conference, symposium, etc.)   Publisher:情報処理学会  

    researchmap

  • 非構造化P2Pファイル共有ネットワークにおけるポイゾニングによるファイル流通制御方式の提案と評価

    吉田雅裕, 大坐畠智, 川島幸之助

    情報処理学会システム評価研究会   2008

     More details

    Language:Japanese   Publishing type:Research paper (conference, symposium, etc.)   Publisher:情報処理学会  

    researchmap

  • P2Pファイル共有ネットワークにおけるファイルID検索に対応したポイゾニング手法の提案

    吉田雅裕, 大坐畠智, 川島幸之助

    電子情報通信学会NS研究会   2008

     More details

    Language:Japanese   Publishing type:Research paper (conference, symposium, etc.)   Publisher:電子情報通信学会  

    researchmap

▼display all

Books

  • はじめてのAIリテラシー

    岡嶋裕史, 吉田雅裕( Role: Joint author)

    技術評論社  2021 

     More details

    Language:Japanese   Book type:Scholarly book

    researchmap

  • 国際情報学入門

    中央大学国際情報学部編, 吉田, ほか( Role: Joint author)

    ミネルヴァ書房  2020  ( ISBN:9784623089789

     More details

    Language:Japanese   Book type:Scholarly book

    researchmap

MISC

  • Annual Report of Technical Committee on Network Systems

    IEICE Communication Society Global Newsletter   2021

     More details

    Language:English   Publishing type:Internal/External technical report, pre-print, etc.  

    researchmap

  • Report on 37th NS/IN Research Workshop

    IEICE Communication Society Global Newsletter   2021

     More details

    Language:English   Publishing type:Internal/External technical report, pre-print, etc.  

    researchmap

  • Report on NS English Session at 2021 IEICE General Conference - BS-7: AI technologies and their applications for future network systems and services -

    IEICE Communication Society Global Newsletter   2021

     More details

    Language:English   Publishing type:Internal/External technical report, pre-print, etc.  

    researchmap

  • Annual Report of Technical Committee on Network Systems

    IEICE Communication Society Global Newsletter   2020

     More details

    Language:English   Publishing type:Internal/External technical report, pre-print, etc.  

    researchmap

  • Report on the 2020 NS English Session Awards and Award Ceremony

    IEICE Communication Society Global Newsletter   2020

     More details

    Language:English   Publishing type:Internal/External technical report, pre-print, etc.  

    researchmap

  • Visualization of Overlay Network using Autonomous System Relationships

    Nakamura Miyamura Hiroko, Hu Hsiang-Yun, Yoshida Masahiro, Ohzahata Satoshi, Nakao Akihiro, Takahashi Shigeo

    IEICE technical report   112 ( 463 )   577 - 582   2013.3

     More details

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

    This report presents a method for visualizing scale-free networks. Scale-free networks are said to be difficult to analyze and visualize, because distribution of the vertex degrees follow the power-law nature. Sasaki et al proposed scale-free network visualization technique that creates the hierarchical representation, referring to their vertex degrees. By using the AS relations data, we improve the method of Sasaki et al, and visualize the scale-free networks more clearly. We also applied the proposed method to overlay traffic data of BitTorrent in order to demonstrate the effective visualization of communication paths between a pair of peers over the scale-free network.

    CiNii Books

    researchmap

▼display all

Presentations

  • 「自律型モビリティシステムの開発・実証」エッジによる地域分散処理で自動運転を支えます" Invited

    井上 知洋, 吉田 雅裕, 森 航哉, 田中 裕之

    ヨコスカ×スマートモビリティ・チャレンジ推進協議会, ヨコスカ×スマートモビリティ・チャレンジ2019  2019.1 

     More details

    Language:Japanese   Presentation type:Symposium, workshop panel (nominated)  

    researchmap

Works

  • 【国際標準化寄書】Study on MEC support for V2X use cases

    M. Yoshida

    2017    

     More details

    国際標準化団体への寄書入力

    researchmap

  • 【国際標準化寄書】ME Application Mobility

    M. Yoshida

    2017    

     More details

    国際標準化団体への寄書入力

    researchmap

  • 【国際標準化寄書】Mobile Edge Computing (MEC);End to end mobility aspects

    M. Yoshida

    2017    

     More details

    国際標準化団体への寄書入力

    researchmap

  • 【国際標準化寄書】MEC018 - Relocation timing prediction

    M. Yoshida

    2016    

     More details

    国際標準化団体への寄書入力

    researchmap

  • 【国際標準化寄書】A review contribution for NFV-EVE005 draft GS

    M. Yoshida, T. Shimizu

    2015    

     More details

    国際標準化団体への寄書入力

    researchmap

  • 【国際標準化寄書】Network Functions Virtualisation (NFV); Ecosystem; Report on SDN Usage in NFV Architectural Framework

    M. Yoshida, T. Shimizu

    2015    

     More details

    国際標準化団体への寄書入力

    researchmap

  • 【新聞記事】電経新聞「研究派」

    吉田雅裕

    2015    

     More details

    新聞記事の寄稿

    researchmap

▼display all

Awards

  • Best Paper Award

    2021   IEEE   EdgeRE: An Edge Computing-enhanced Network Redundancy Elimination Service for Connected Cars

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

    2020   電子情報通信学会   IEICE・ICETC2020運営への貢献

  • 若手研究奨励賞

    2019   IEICE   Japan

    吉田雅裕, 森航哉, 井上知洋, 田中裕之

  • 若手研究奨励賞

    2018   IEICE   Japan

    松尾和哉, 吉田雅裕, 田中裕之

  • Best Paper Award

    2014   IEEE APNOMS   MORSA: A Multi-objective Resource Scheduling Algorithm for NFV Infrastructure

    M. Yoshida, W. Shen, T. Kawabata, K. Minato, W. Imajuku

  • 優秀ポスター賞

    2009   IEICE   Japan

    小泉貴嗣, 吉田雅裕, 大坐畠智, 川島幸之助

▼display all

Research Projects

  • 自動運転車の安全性を向上するネットワークプロトコルの研究開発

    Grant number:22K12000  2022.4 - 2027.3

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

    吉田 雅裕

      More details

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

    researchmap

  • A Network Management Protocol for Connected Cars

    Grant number:20K19790  2020.4 - 2022.3

    Japan Society for the Promotion of Science  Grants-in-Aid for Scientific Research  Grant-in-Aid for Early-Career Scientists  Chuo University

    Yoshida Masahiro

      More details

    Grant amount: \4160000 ( Direct Cost: \3200000 、 Indirect Cost: \960000 )

    Connected cars generate a huge amount of Internet of Things (IoT) sensor information called Controller Area Network (CAN) data. Although each CAN data packet is very small, a connected car generates thousands of CAN data packets per second. Therefore, real-time CAN data collection from connected cars to a cloud system is one of the most challenging problems in the current IoT. In this paper, we propose an Edge computing-enhanced network Redundancy Elimination service (EdgeRE) for CAN data collection. In developing EdgeRE, we design a CAN data compression architecture that combines in-vehicle computers, edge atacenters, and a public cloud system. EdgeRE includes the idea of a ierarchical data compression and dynamic data buffering at edge datacenters for real-time CAN data collection. Across a wide range of field tests with connected cars and an edge computing testbed, we show that the EdgeRE reduces the bandwidth usage by 88% and the number of packets by 99%.

    researchmap

  • 中央大学特定課題研究費

    2020 - 2022

      More details

    Grant type:Competitive

    researchmap

  • NTT委託研究 携帯電話網の通信品質を向上するハンドオフ方式の研究開発

    2019 - 2020

      More details

    Grant type:Competitive

    researchmap

  • 科学研究費補助金(研究活動スタート支援) 高速移動する自動運転車の安全性を向上するためのネットワーク制御方式の研究

    2019 - 2020

      More details

    Grant type:Competitive

    researchmap

  • 総務省委託研究 膨大な数の自律型モビリティシステムを支える多様な状況に応じた周波数有効利用技術の研究開発

    2017 - 2018

      More details

    Grant type:Competitive

    researchmap

  • 総務省委託研究 自律型モビリティシステム(自動走行技術、自動制御技術等)の開発・実証

    2016 - 2017

      More details

    Grant type:Competitive

    researchmap

  • FP7 project 257513 UNIVERSELF

    2014 - 2015

      More details

    Grant type:Competitive

    researchmap

  • 日本学術振興会 特別研究員奨励費

    2011 - 2013

      More details

    Grant type:Competitive

    researchmap

▼display all

Allotted class

  • 2023   データサイエンス基礎   Department

  • 2023   データベース論   Department

  • 2023   データマイニングとAI   Department

  • 2023   プログラミング基礎   Department

  • 2023   卒業制作   Department

  • 2023   国際情報史   Department

  • 2023   国際情報演習Ⅰ   Department

  • 2023   国際情報演習Ⅱ   Department

  • 2023   国際情報演習Ⅲ   Department

  • 2023   国際情報演習Ⅳ   Department

  • 2023   国際情報演習Ⅴ   Department

  • 2023   基礎演習   Department

  • 2023   情報ネットワーク論   Department

  • 2023   情報理論   Department

  • 2023   データマイニングとAI特論   Graduate school

  • 2023   国際情報学実践研究(1)   Graduate school

  • 2023   国際情報学研究指導Ⅰ   Graduate school

  • 2023   国際情報学研究指導Ⅱ   Graduate school

  • 2023   情報基盤研究法   Graduate school

▼display all

Teaching Experience

  • データマイニング(非常勤講師)

    Institution:芝浦工業大学

  • Data mining

    Institution:Shibaura Institute of Technology

Committee Memberships

  • 2020 - 2022

    電子情報通信学会   ネットワークシステム研究会幹事  

  • 2020 - 2022

    電子情報通信学会   英文B特集論文誌 幹事  

  • 2020 - 2021

    電子情報通信学会   通信ソサイエティ学術奨励賞選定委員会委員  

  • 2020 - 2021

    電子情報通信学会   総合大会プログラム編成委員会委員  

  • 2020 - 2021

    電子情報通信学会   ネットワークシステム研究会ワークショップ実行委員会  

  • 2020 - 2021

    電子情報通信学会   ネットワークシステム研究会 10月研究会座長  

  • 2020 - 2021

    電子情報通信学会   ネットワークシステム研究会 6月研究会座長  

  • 2020 - 2021

    電子情報通信学会   ソサイエティ大会プログラム編成委員会委員  

  • 2020 - 2021

    IEICE   ICETC2020 TPC  

  • 2015    

    IEEE MAW2015   Facilitator  

  • 2015    

    IEEE SYW2015   Mentor  

  • 2015    

    IEEE EWSDN2015   TPC  

▼display all