English
法政大学 
理工学部 
創生科学科 

顔写真 教授 
滝沢 誠 
タキザワ マコト 
TAKIZAWA, Makoto 


1950年生まれ  
Tel.042-387-6218  
Fax.042-387-6129  
 
個人ウェブサイトはこちら  

出力する項目だけ表示しています。
更新日:2020/10/19 

プロフィール
Visiting professor, GMD-IPSI (currently Fraunhofer) , Darmstadt, Sept. 1989 to June 1990.
Visiting professor, DAKE Centre and Dept. of Computer Science, University of Keele, 1990
International adviser, State key lab. of ISN, Xidian University, X'ian, China, 2004 - 2006. 

経歴
(財)日本情報処理開発協会  1975/04/01-1986/03/31 
東京電機大学  理工学部情報システム工学科  教授  1986/04/01-2008/03/31 
GMD  IPSI  客員教授  1989/09/01-1990/03/31 
Keele大学  DAKEセンター及び計算科学科  客員教授  1990/04-1990/08/31 
西安電子科技大学  State key lab. of ISN  国際アドバイザー、客員教授  2004/10-2006 
成蹊大学  理工学部情報科学科  教授  2008/04/01-2013/03/31 
法政大学  理工学部創生科学科  教授  2013/04/01-現在 

学歴
東北大学  工学部  応用物理  1973/03/31  卒業 
東北大学  工学研究科  応用物理学  博士前期  1975/03/31  修了 

学位
工学博士  東北大学  1983/03/25 

免許・資格
第一種情報処理技術者  1976 

研究分野
計算機システム・ネットワーク 
ソフトウエア 
メディア情報学・データベース 

研究キーワード
分散システム 
コンピュータネットワーク 
省電力分散システム 
フォールト・トレラント分散システム 
P2Pシステム 
情報セキュリティ 
グループ通信 
分散データベース・システム 

研究テーマ
グル-プ通信プロトコル  グル-プ通信プロトコル  1985-現在 
オブジェクトシステム  オブジェクトシステム  1986-現在 
モバイルエージェントによるトランザクションモデル  モバイルエージェントによるトランザクションモデル  2000-現在 
自律分散システム  自律分散システム  2002-現在 
高速マルチメディア通信  高速マルチメディア通信  2002-現在 
フォールトトレラントなセンサー・アクターネットワーク  フォールトトレラントなセンサー・アクターネットワーク  2005-現在 
役割ベースのアクセス制御システムの研究  役割ベースのアクセス制御システムの研究  2000-現在 
省電力分散システム  省電力分散システム  消費電力を低減する大規模分散システムの研究。  2007-現在 

受託・共同研究希望テーマ
分散システムの低消費電力化の研究  産学連携等、民間を含む他機関等との共同研究を希望  受託研究,共同研究 
詳細表示...

受託・共同・寄附研究実績
分散システムにおける,主なインフラストラクチャとしての故障検出サービス  滝沢誠  滝沢誠、  2007-2010  共同研究  国際共同研究 
詳細表示...

競争的資金等の研究課題
エコモデルに基づいた大規模分散システムの研究  科学研究費  基盤研究(B)  法政大学  2015/04/01-2019/03/01  情報システムでは、処理時間、帯域等の性能目標に加えて新たに消費電力を削減することがエコ社会を実現するために重要な課題となってきている。CPU等のハードウェア、クラウドのサーバの低電力化が進められてきている。一方、コンピュータのみならずセンサ等の多種多様な「もの」が相互接続されたIoT(Internet of Things)の実現が重要となってきている。本研究では、分散型システムとしての大規模P2P型のIoTを対象として、ソフトウェアとサービス利用の観点から、従来からの性能目標に加えて消費電力を節減するためのモデルと方式の研究を行う。このために、コンピュータ、センサ等の種々の情報機器の電力消費モデルを研究し、このモデルに基づいて、性能、信頼性目標を達成しながら消費電力を低減できるプロセスの実行アルゴリズムを研究する。 
異種分散型P2Pシステムにおけるエコ・モデルの研究  科学研究費  基盤研究(B)一般  2011/04/01-2015/03/31 
完全分散型P2Pネットワークのピアの自信度に基づいた信用可能性の研究  科学研究費  基盤研究(C)一般  2008/04/01-2011/03/31 
Peer-to-Peerシステムにおける信用性の研究  科学研究費  基盤研究(C)一般  2006/04/01-2008/03/31 
Peer-to-Peerシステムでの自律的なグループコンピューティングの研究  科学研究費  基盤研究(C)一般  2004/04/01-2006/03/31 
詳細表示...

著書
Advanced Information Networking and Applications - Proceedings of the 33rd International Conference on Advanced Information Networking and Applications, AINA 2019, Matsue, Japan, March 27-29, 2019  Leonard Barolli, Makoto Takizawa, Fatos Xhafa, Tomoya Enokido  Springer  2020/04/15  978-3-030-15031-0  URL 
Web, Artificial Intelligence and Network Applications - Proceedings of the Workshops of the 33rd International Conference on Advanced Information Networking and Applications, AINA Workshops 2019, Matsue, Japan, March 27-29, 2019  Leonard Barolli, Makoto Takizawa, Fatos Xhafa, Tomoya Enokido  Springer  2019  978-3-030-15034-1  URL  Leonard Barolli, Makoto Takizawa, Fatos Xhafa, Tomoya Enokido 
Advances in Network-Based Information Systems, The 21st International Conference on Network-Based Information Systems, NBiS-2018, Bratislava, Slovakia, 5-7 September 2018  Leonard Barolli, Natalia Kryvinska, Tomoya Enokido, Makoto Takizaw  Springer  2019  978-3-319-98529-9  URL  Lecture Notes on Data Engineering and Communications Technologies 22 
Future Data and Security Engineering - 6th International Conference, FDSE 2019, Nha Trang City, Vietnam, November 27-29, 2019, Proceedings  Tran Khanh Dang, Josef Küng, Makoto Takizawa, Son Ha Bui  748  Springer  2019  978-3-030-35652-1  Lecture Notes in Computer Science 11814 
Complex, Intelligent, and Software Intensive Systems - Proceedings of the 12th International Conference on Complex, Intelligent, and Software Intensive Systems, CISIS-2018, Matsue, Japan, 4-6 July 2018.  Leonard Barolli, Nadeem Javaid, Makoto Ikeda, and Makoto Takizawa  1132  Springer  2019  978-3-319-93658-1  URL  Advances in Intelligent Systems and Computing 772, 
詳細表示...

論文
研究論文(学術雑誌)  共著  Fault-Tolerant Strategies in the Tree-Based Fog Computing Model  Ryuji Oma, Shigenari Nakamura, Tomoya Enokido, and Makoto Takizawa  International Journal of Distributed Systems and Technologies  IGI Global  11/ 4, 72-91  2020/10  1947-3532  10.4018/IJDST.2020100105  URL  In the Fog Comput$ing (FC) model of the Internet of Things (IoT), application processes to handle sensor data are distributed to fog nodes and servers. In the Tree-based FC (TBFC) model proposed by the authors, fog nodes are hierarchically structured. In this article, the authors propose a TBFC for a General Process (TBFCG) model to recover from the faults of fog nodes. If a node gets faulty, the child nodes are disconnected. The authors propose Minimum Energy in the TBFCG tree (MET) and selecting Multiple Parents for recovery in the TBFCG tree (MPT) algorithms to select a new parent node for the disconnected nodes. A new parent node has to process data from not only the disconnected nodes, but also its own child nodes. In the evaluation, the energy consumption and execution time of a new parent node can be reduced by the proposed algorithms. 
研究論文(学術雑誌)  共著  Information flow control in object‐based peer‐to‐peer publish/subscribe systems  Shigenari Nakamura, Tomoya Enokido, Makoto Takizawa  Concurrency and Computation: Practice and Experience  Wiley  32/ 8, 1-10  2020/04  1532-0634  10.1002/cpe.5118  URL  In this paper, we propose a P2PPSO (P2P [peer‐to‐peer] type of topic‐based Publish/Subscribe with Object concept) model, where each peer process (peer) exchanges objects by publishing and receiving event messages with no centralized coordinator. In addition, objects are characterized by topics. Suppose an event message ej published by a peer pj carries an object on some topics into a target peer pi. Here, information in the peer pj illegally flows to the peer pi if the target peer pi is not allowed to subscribe the topics. An illegal object is an object whose topics a target peer is not allowed to subscribe. Even if an event message is received by a target peer by checking topics, objects carried by the event message may be illegal at the target peer. In this paper, we propose a TOBS (topics‐of‐objects–based synchronization) protocol to prevent target peers from receiving illegal objects in the P2PPSO model. Here, even if an event message is received by a target peer, illegal objects in the event message are not delivered to the target peer. In the evaluation, we show how many event messages carry illegal objects in the TOBS protocol. 
研究論文(学術雑誌)  共著  Energy consumption laxity-based quorum selection for distributed object-based systems  Tomoya Enokido, Dilawaer Duolikun, Makoto Takizawa  Evolutionary Intelligence  Springer  13, 71-82  2020/03  1864-5909  10.1007/s12065-018-0157-1  URL  In object based systems, an object is an unit of computation resource. Distributed applications are composed of multiple objects. Objects in an application are replicated to multiple servers in order to increase reliability, availability, and performance. On the other hand, the large amount of electric energy is consumed in a system compared with non-replication systems since multiple replicas of each object are manipulated on multiple servers. In this paper, the energy consumption laxity-based quorum selection (ECLBQS) algorithm is proposed to construct a quorum for each method issued by a transaction so that the total electric energy consumption of servers to perform methods can be reduced in the quorum based locking protocol. The total electric energy consumption of servers, the average execution time of each transaction, and the number of aborted transactions are shown to be more reduced in the ECLBQS algorithm than the random algorithm in evaluation. 
共著  A topic-based synchronisation protocol in peer-to-peer publish/subscribe systems  Shigenari Nakamura; Tomoya Enokido; Makoto Takizawa  International Journal of Communication Networks and Distributed Systems (IJCNDS)  Inderscience  24/ 1, 106-121  2020/01  1754-3916  10.1504/IJCNDS.2020.103926  URL  In this paper, we discuss a peer-to-peer type of publish/subscribe (P2PPS) model which is composed of peer processes (peers). Here, each peer publishes event messages while receiving event messages. In the topic-based access control (TBAC) model proposed in our previous studies, only a peer granted publication and subscription rights on topics is allowed to publish and subscribe event messages on the topics, respectively. In our previous studies, the subscription-based synchronisation (SBS) protocol is proposed where illegal event messages are banned. It is checked whether or not each event message received is illegal in terms of subscription and publication rights granted to each peer. However, even some legal event messages are unnecessarily banned. In this paper, we newly propose a topic-based synchronisation (TBS) protocol where only and every illegal event message is banned. In the evaluation, we show only and every illegal event message is banned in the TBS protocol. 
研究論文(学術雑誌)  共著  The Redundant Energy Consumption Laxity Based Algorithm to Perform Computation Processes for IoT Services  Tomoya Enokido, Makoto Takizawa  Internet of Things (IoT)  Elsevier  9/ 100165, 1-14  2020/01/25  2542-6605  10.1016/j.iot.2020.100165  URL  There are various kinds of Internet of Things (IoT) services like home management services. In the IoT services, a large volume of data is gathered from various types of smart devices and is manipulated in scalable, high performance, and fault-tolerant computing systems like cloud computing systems. Reliable and available IoT services can be provided by replicating each application process on multiple virtual machines in a server cluster system. On the other hand, a server cluster system with process replicas consumes a larger amount of electric energy than non-replication approaches. Hence, not only fault-tolerant but also energy-efficient server cluster systems by using virtual machine technologies are required to realize IoT services. In this paper, a redundant energy consumption laxity based (RECLB) algorithm to redundantly and energy-efficiently perform each application process on multiple virtual machines is newly proposed. The RECLB algorithm is evaluated in terms of the total electric energy consumption of a server cluster and the average computation time of each process in both homogeneous and heterogeneous server clusters. 
詳細表示...

研究発表
シンポジウム・ワークショップ パネル(公募)  The Improved Energy Consumption Laxity Based (IECLB) Algorithm to Perform Computation Processes  the 13th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing (IMIS-2019)  2019/07/03  URL  The TBFC (Tree-Based Fog Computing) model is proposed to reduce the electric energy consumed by fog nodes and servers in the fog computing model. Here, fog nodes are hierarchically structured in a height-balanced tree. A root node shows a cloud of servers and leaf nodes are edge nodes which collect data from sensors and send actions to actuators. Each node receives data from child nodes and sends the processed data to a parent node. Finally, servers receive sensor data processed by fog nodes and send actions to actuators. Thus, sensor data is sent up to a root node from sensors and action are sent down to actuators from the root node. In order to more promptly deliver actions to actuators, the TWTBFC (Two-Way TBFC) model is proposed where nodes send processed data not only to a parent node but also to each child node. Thus, each node can get more global data obtained by processing data from every sibling node. The node can make a decision on actions to be done by descendant nodes. On the other hand, more amount of data is transmitted in networks and processed by a fog node. In this paper, we discuss how to reduce the processing load of each node in the TWTBFC model. 
シンポジウム・ワークショップ パネル(公募)  Evaluation of a Two-Way Tree-Based Fog Computing (TWTBFC) Model  the 13th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing (IMIS-2019)  2019/07/03  URL  The TBFC (Tree-Based Fog Computing) model is proposed to reduce the electric energy consumed by fog nodes and servers in the fog computing model. Here, fog nodes are hierarchically structured in a height-balanced tree. A root node shows a cloud of servers and leaf nodes are edge nodes which collect data from sensors and send actions to actuators. Each node receives data from child nodes and sends the processed data to a parent node. Finally, servers receive sensor data processed by fog nodes and send actions to actuators. Thus, sensor data is sent up to a root node from sensors and action are sent down to actuators from the root node. In order to more promptly deliver actions to actuators, the TWTBFC (Two-Way TBFC) model is proposed where nodes send processed data not only to a parent node but also to each child node. Thus, each node can get more global data obtained by processing data from every sibling node. The node can make a decision on actions to be done by descendant nodes. On the other hand, more amount of data is transmitted in networks and processed by a fog node. In this paper, we discuss how to reduce the processing load of each node in the TWTBFC model. 
シンポジウム・ワークショップ パネル(公募)  Capability-Based Information Flow Control Model in the IoT  the 13th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing (IMIS-2019)  2019/07/03  URL  Various types and huge number of nodes including not only computers like servers but also devices like sensors and actuators are interconnected in the IoT (Internet of Things). Here, the CapBAC (Capability-Based Access Control) model is proposed in the IoT system. In the CapBAC model, an owner of a device issues a capability token, i.e. a set of access rights to a subject. Here, the subject is allowed to manipulate the device according to the access rights in the capability token. In the IoT, a subject sbi can get the data of the device d1 from another device d2 to which the data of the device d1 is brought although the subject sbi is not allowed to get the data from the device d1. Here, the data in the device d1 illegal flows to the subject sbi. In this paper, first, we newly define information flow relations among devices based on the CapBAC model. Next, we newly propose an OI (Operation Interruption) protocol to prevent illegal information flow in the IoT based on the information flow relations among devices. In the OI protocol, an operation to imply illegal information flow is interrupted. 
シンポジウム・ワークショップ パネル(公募)  Personalized Protocols for Data Division and Knowledge Management  the 13th International Conference on Complex, Intelligent, and Software Intensive Systems (CISIS-2019)  2019/07/03  URL  In this paper will be proposed new personalized cryptographic protocols dedicated for secure information sharing and data management. Such new procedures will be based on mathematical formalisms and application of selected personal or behavioral patterns, which will be involved in the division and management processes. Such new management procedures can be created with application of different formal data representation classes. Possible application of such method will be also presented. 
シンポジウム・ワークショップ パネル(公募)  Message Ordering Based on the Object-Based-Causally (OBC) Precedent Relation  the 13th International Conference on Complex, Intelligent, and Software Intensive Systems (CISIS-2019)  2019/07/03  URL  The P2PPS model is a peer-to-peer (P2P) type of publish/subscribe (PS) model where peer processes (peers) are cooperating by publishing and subscribing messages with no centralized coordinator. Messages carry objects and are only received by target peers which are interested in the objects. Messages carrying a common object are related. After receiving messages, only related messages have to be causally delivered to target peers. In topic-based PS systems, objects are denoted by topics. Messages are characterized by publication topics which denote objects in the messages. Each peer specifies subscription topics and receives messages whose publication topics include some subscription topic. A pair of messages which have a common publication topic are considered to be related with respect to topics. Here, it is noted a pair of messages mi and mj may not be related in terms of objects even if mi and mj are related in terms of topics. In this paper, we propose an MTBC (Modified Topic-Based Causally ordering) protocol which uses topic vectors. In the evaluation, we show clear how many number of messages are unnecessarily ordered in the MTBC protocol. 
詳細表示...

知的財産権
特許  METHOD FOR TRANSMITTING DATA AND DATA TRANSMITTER  F060001466 
特許  データ送信方法及びデータ送信装置  特願2003-328132 PCT/JP2004/002947  2003/09/19  WO 2005/029806  2005/03/31  特許番号第4382752  2009/10/02 
詳細表示...

受賞
Outstanding Service Award  2019/07/09  https://tc.computer.org/tcdp/awardrecipients/ 
Best paper award  A Model for Energy-Aware Migration of Virtual Machines  2016/09/09 
Best paper award  A Flexible Read-Write Abortion Protocol with Sensitivity of Objects to Prevent Illegal Information Flow  2015/07/09  "Shigenari Nakamura, Dilawaer Duolikun, Tomoya Enokido, Makoto Takizawa: A Flexible Read-Write Abortion Protocol with Sensitivity of Objects to Prevent Illegal Information Flow" 
Best paper award  Power Consumtption Model for Redundantly Performing Mobile-Agents  2014/07/03  Power Consumtption Model for Redundantly Performing Mobile-Agents 
Outstanding Service Award  Significant Contribution to the MUE-2013  2013/05/10  Significant Contribution to the MUE-2013 
詳細表示...

担当授業科目
知能創造 
移動知能 
詳細表示...

教科書・教材
分散システム:P2Pモデル  2014/04 
詳細表示...

所属学協会
IEEE  1987/01/01-現在 
Association of Computing Machinery (ACM)  1975/01/01-現在 
情報処理学会  1975/01-現在 
詳細表示...