权益分类	功能权益	普通用户	{{item.name}}会员
{{category.name}}	{{benefitItem.name}}

Autonomic group Computing in Peer-to-Peer Systems

对等系统中的自治组计算

基本信息

批准号：
16500042
负责人：
TAKIZAWA Makoto
金额：
$ 2.37万
依托单位：
TOKYO DENKI UNIVERSITY
依托单位国家：
日本
项目类别：
Grant-in-Aid for Scientific Research (C)
财政年份：
2004
资助国家：
日本
起止时间：
2004 至 2005
项目状态：
已结题

来源：
https://kaken.nii.ac.jp/en/grant/KAKENHI-PROJECT-16500042/
关键词：
Group Communication Autonomic System Peer-to-Peer (P2P) System Quality of Service (QoS)Mobile Agent Fault-tolerant System Transaction High-speed Network

项目摘要

The architecture of information system has been changing from the traditional client-server (CS) model to new type, peer-to-peer (P2P) ones. The P2P system is composed of peer computers, where each computer can play every role of client and server. In addition, the P2P system is scalable, i.e. a large number of computers are interconnected in various types of computers, ranging from personal computers to super computers. In addition, the P2P system is in nature open, i.e. computers autonomously join and leave the system, and the type of service and quality of service (QoS) supported by each computer are changing. Applications require the system to support various types of service requirements. In these P2P systems, it is difficult, maybe impossible to manage every component computer in a centralized control scheme as taken in traditional systems due to the scalability and openness of the P2P system. We have to develop novel concepts and architecture to design, implement, maintain, and … More operate the P2P system.In this research, we first discuss a hierarchical model for a scalable group of large number of peer processes. A group is a collection of multiple peer processes on various types of computers which are interconnected in networks like the Internet. Each peer process in a group send a message to multiple peer processes while receiving messages from multiple peer processes. Messages are required to be causally/totally delivered to processes in a group. The communication and computation overheads are O(n^*n) for the number n of processes in a group. In order to reduce the overhead, a group is composed of subgroups which are interconnected through gateway processes. Since a subgroup is smaller than the whole group, we can reduce the overhead. In addition, each peer process has to detect peer processes which support required service. We consider multimedia objects. In order to detect target processes, each peer process ask the acquaintance processes. Here, it is critical to discuss how much a peer process can trust each acquaintance process. We define the trustworthiness of each acquaintance peer in terms of QoS, and access right.This year, we discuss how to realize database applications on the P2P based architecture which we developed in the first year. In this research, database applications are realized in mobile agents. Especially, transactions can be fault-tolerant by using the mobile agents because the transactions can move to other operational computers from faulty computers.We published papers on the research in international journals like IJHPCN and JOIN and international conferences like IEEE AINA, ICPADS, ISORC, ISM, and DEXA. Less

信息系统的体系结构正从传统的客户机-服务器（CS）模式向新型的对等（P2P）模式转变。P2P系统是由对等计算机组成的，每台计算机都可以扮演客户端和服务器的角色。此外，P2P系统是可扩展的，即大量计算机在各种类型的计算机中互连，从个人计算机到超级计算机。此外，P2P系统本质上是开放的，即计算机自主地加入和离开系统，并且每台计算机所支持的服务类型和服务质量（QoS）都在变化。应用程序要求系统支持各种类型的服务要求。在这些P2P系统中，由于P2P系统的可扩展性和开放性，很难甚至不可能像传统系统那样以集中控制的方式管理每个组件计算机。我们必须开发新的概念和架构来设计、实现、维护和 ...更多信息在这项研究中，我们首先讨论了一个层次模型的可扩展组的大量对等进程。组是在互联网等网络中互连的各种类型的计算机上的多个对等进程的集合。组中的每个对等进程向多个对等进程发送消息，同时从多个对等进程接收消息。消息需要被因果地/完全地传递到组中的进程。对于一个组中的进程数n，通信和计算开销是O（n^*n）。为了减少开销，组由通过网关进程互连的子组组成。由于子组小于整个组，我们可以减少开销。此外，每个对等进程必须检测支持所需服务的对等进程。我们考虑多媒体对象。为了检测目标进程，每个对等进程询问熟人进程。在这里，讨论对等进程可以信任每个熟人进程的程度是至关重要的。我们用QoS和访问权限来定义每个熟人节点的可信度。今年，我们讨论如何在我们第一年开发的基于P2P的体系结构上实现数据库应用。在本研究中，数据库应用程序实现在移动的代理。特别地，通过使用移动的代理，事务可以是容错的，因为事务可以从故障计算机移动到其他操作计算机。我们在国际期刊上发表了论文，如IJHPCN和JOIN以及国际会议，如IEEE AINA，ICPADS，ISORC，ISM和DEXA。少

项目成果

期刊论文数量（71）

专著数量（0）

科研奖励数量（0）

会议论文数量（0）

专利数量（0）

Causally Ordered Delivery in a Hierarchical Group of Peer Processes

分层对等进程组中的因果顺序交付

DOI：
发表时间：
2005
期刊：
Computer Communications Journal Vol.28,No.11
影响因子：
0
作者：
Taguchi;K.;Watanabe;K.;Enokido;T.;Takizawa;M.
通讯作者：
M.

Quorum-Based Multi-Invocation Model for Replicated Objects

复制对象的基于仲裁的多调用模型

DOI：
发表时间：
2004
期刊：
Concurrent Engineering : Research and Application Journal (CERA) Vol.12,No.3
影响因子：
0
作者：
Enokido;T.;Hori;K.;Takizawa;M.;Raynal;M
通讯作者：
M

Heterogeneous Colck Group Protocol for Causally Ordered Delivery of Messages

用于按因果顺序传递消息的异构 Colck 组协议