• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 2005.05a
• /
• pp.477-482
• /
• 2005

Recently, client computing trend has been changed from server oriented information application to network based P2P(Peer to Peer) services. The conventional client/server method has the merit of accessing abundant information, on the other side P2P has the merit of synchronized community support and information exchange. P2P has four meaning of point to point, peer to peer, person to person and path to profitability. In manufacturing system field, the second meaning is interested. P2P is classified to three type such as conventional client/server, hybrid P2P and pure P2P. The third is really peer to peer concept. The related technologies with P2P are P2P searching, XML, cooperation, IPv6, computing sharing and P2P communication. This paper describes the scheme of P2P and related contents. And through the P2P based technology, a P2P-based collaborative machine and a vertical portal machine are introduced in this paper. The scheme of the machines mentioned above is suggested for cooperation in manufacturing system and u-Manufacturing.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.545-548
• /
• 2005

Recently, the computing environment of P2P come out to solve the excessive load of the server in the computing environment of the client/server. Currently, operated computing environment of P2P is mainly spreading out P2P system of read name or anonymity base about a publisher, sender and receiver of the file. But, to the current file protection there is three problem. The first problem is to a host become attack target. The second is to received file loose attack of Brute Force. The third is to define target of attack of DOS. To solve the this problem. it divide file into block unit. Each block is safely scattered peers. This paper propose the distribution P2P system of file division. Both proposing system solve the this problem and promote efficiency of file application.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.11
• /
• pp.831-835
• /
• 2009

Volunteer computing is a computing paradigm in which the operations of a large-scale application are processed using idle resources of Internet-connected computers. The redundant-work distribution techniques used in the volunteer computing environment cause some problems like delay of the work completion time or inefficiency of the work execution due to continuous requests of the work redistribution because the techniques do not consider the characteristics of works and dynamic resources. To cope with such problems this paper suggests a P2P based regional matchmaking technique which can redistribute works in consideration of the characteristics of the works and the participant resources. The techniques consist of the profiles for works/resources, the module for monitoring the available resources spaces, the protocols for the matching request/reply, the module for match-ratio calculation, and so on.

• Journal of Internet Computing and Services
• /
• v.12 no.4
• /
• pp.157-172
• /
• 2011

The latest active studies on distributed OLAP to adopt a distributed environment are mainly focused on DHT P2P OLAP and Grid OLAP. However, these approaches have its weak points, the P2P OLAP has limitations to multidimensional range queries in the cloud computing environment due to the nature of structured P2P. On the other hand, the Grid OLAP has no regard for adjacency and time series. It focused on its own sub set lookup algorithm. To overcome the above limits, this paper proposes an efficient central managed P2P approach for a cloud computing environment. When a multi-level hybrid P2P method is combined with an index load distribution scheme, the performance of a multi-dimensional range query is enhanced. The proposed scheme makes the OLAP query results of a user to be able to reused by other users' volatile cube search. For this purpose, this paper examines the combination of an aggregation cube hierarchy tree, a quad-tree, and an interval-tree as an efficient index structure. As a result, the proposed cloud P2P OLAP scheme can manage the adjacency and time series factor of an OLAP query. The performance of the proposed scheme is analyzed by a series of experiments to identify its various characteristics.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2005.05a
• /
• pp.139-143
• /
• 2005

The P2P is a network environment supporting data exchange which is directly connected peers without limit of existing server-client and intervening central server for resource or offered service with each peer. JXTA is a representative of P2P system. JXTA is a typical distributed computing model that proposed by Sun Microsystems. JXTA that doesn't require centralized services or resources is adaptable in extreme changes of network organization. MANET(Mobile Ad Hoc Network) is a representative wireless network that is composed of mobile nodes without infrastructure. So MANET establishes the path for the communication of each peers and maintains the newest routing information by exchanging routing information. In this paper, we propose a technique of JXTAMAUET which implements JXTA which is the P2P network system from the wireless network which is becoming the foundation of ubiquitous computing. For the performance evaluation of the JXTAMANET, we use simulation.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06d
• /
• pp.412-417
• /
• 2008

현재 OSGi 프레임워크의 서비스는 로컬 장비에서만 공유할 수 있기 때문에 하나의 장비에 서비스 부하가 집중되는 문제점을 가진다 이와 같은 문제점을 해결하기 위해 확장 서비스 레지스트리를 이용하는 방법이 제안되었지만, 확장 서비스 레지스트리를 재 검색해야 하므로 응답시간이 늦어지는 단점을 가진다. 따라서 본 논문에서는 추가적인 확장 서비스 레지스트리를 재 검색할 필요가 없고, 단지 로컬 서비스 레지스트리만을 검색하여 원격 서비스를 실행할 수 있는 P2P 기반의 RSP 번들을 설계하고 아기 보호를 위한 유비쿼터스 홈 시스템에 실제로 적용하여 구현하였다. 그러므로 본 논문에서 제안한 RSP 번들을 이용하면 하나의 OSGi 프레임워크에 집중될 수 있는 부하를 분산시킬 수 있고, 기존에 개발된 서비스들도 원격 서비스로 재정의하여 다른 OSGi 프레임워크와 서비스를 공유할 수 있게 된다.

• Journal of Digital Contents Society
• /
• v.14 no.1
• /
• pp.89-95
• /
• 2013

Many peer-to-peer (p2p) systems have been studied in distributed, ubiquitous computing environments. Distributed hash table (DHT)-based p2p systems can improve load-balancing even though locality utilization and user mobility are not guaranteed. We propose a mobile locality-based hierarchical p2p overlay network (MLH-Net) to address locality problems without any other services. MLH-Net utilizes mobility features in a mobile environment. MLH-Net is constructed as two layers, an upper layer formed with super-nodes and a lower layer formed with normal-nodes. The simulation results demonstrate that MLH-Net can decrease discovery routing hops by 13% compared with JXTA and 69% compared with Chord. It can decrease the discovery routing distance by 17% compared with JXTA and 83% compared with Chord depending on the environment.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.6
• /
• pp.49-57
• /
• 2007

The P2P distributed systems are proceeded various studies lively to use the idleness computing resources under the network connected computing environments. It's a general mean to communication from the peer of the shortest downloaded time among same target files to be searched. The P2P search algorithms are very important primary factor to decide a real downloaded time in the criteria to select the peer of a shortest downloaded time. However the peer to give resources could be changed into offline status because the P2P distributed systems have very weakness connection. In these cases. we have a choice to retransmit resources mainly. In this study, we suggested an effective backtracking search algorithm to improve the performance about the request to retransmit the resource.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.5
• /
• pp.143-150
• /
• 2019

Cloud computing has recently become an attractive solution for massively multiplayer online games(MMOGs), as it lifts operators from the burden of buying and maintaining hardware. Peer-to-peer(P2P) -based solutions present several advantages, including the inherent scalability, self-repairing, and natural load distribution capabilities. We propose a hybrid architecture for MMOGs that combines technological advantages of two different paradigms, P2P and cloud computing. An efficient and effective provisioning of resources and mapping of load are mandatory to realize an architecture that scales in economical cost and quality of service to large communities of users. As the number of simultaneous players keeps growing, the hybrid architecture relieves a lot of computational power and network traffic, the load on the servers in the cloud by exploiting the capacity of the peers. For MMOGs, besides server time, bandwidth costs represent a major expense when renting on-demand resources. Simulation results show that by controlling the amount of cloud and user-provided resource, the proposed hybrid architecture can reduce the bandwidth at the server while utilizing enough bandwidth of players.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10a
• /
• pp.40-42
• /
• 2004

Access Grid는 상호공동작업을 위하여 대용량의 컨텐츠 파일들을 주고받으며 공유한다. 특별히 중앙의 집중된 관리서버가 없는 Access Grid환경에서는 컨텐츠의 위치추적의 어려움, 부재, 병목 등의 현상이 발생하는데 이를 본 논문에서 1. 중앙 Hybrid서버의 구현 2. 집중컨텐츠의 거점노드복제 3. 중요컨텐츠의 24시간 공유보장 등의 기법으로 해결방안을 제안하였다. 그리고 이에 대한 효율성을 시뮬레이션 자료로 증명하였다.