• Title/Summary/Keyword: Peer Agent

Search Result 40, Processing Time 0.024 seconds

A Study on the Security that Using SNMP in Peer to Peer Environment (Peer to Peer환경에서 SNMP를 이용한 보안에 관한 연구)

  • Roh, Jeong-Hee;Moon, Jeong-Hwan;Lee, Joon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2002.11a
    • /
    • pp.401-404
    • /
    • 2002
  • 최근 모자이크의 시대 이후 인터넷의 폭발적인 발달로 인해 Client-Sever의 방식의 네트웍 서비스 방식 뿐만 아니라 P2P(Peer to Peer) 등 분산 서비스 환경이 각광을 받고 있다. 사용자의 직접적인 자료의 공유를 위해서는 Peer to Peer 환경을 설정하여 분산되어진 자료의 효과적인 관리를 위한 통신의 주체가 되는 각각의 에이젼트들 간의 통신과 Sever와 Agent의 통신에 있어 악의적인 침입에 의한 정보누출이 문제가 되고 있다. 본 논문에서는 이러한 문제의 해결방안으로 P2P 환경에 적합한 PKI(공개키 기반구조)를 기반을 이용하여 보안 메커니즘을 설계하였다.

  • PDF

A Study on the Control Agent System of P2P Business Model (P2P 비지니스 모델에서의 조정 에이전트 시스템에 관한 연구)

  • Kim, Dong-Hyun;Lee, Sung-Ju
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.12 no.1
    • /
    • pp.73-79
    • /
    • 2002
  • At present, most Electronic Commerce System is made mainstream of Server-Client Commerce. For searching goods information, we must entering the EC sites and search that s information. but, P2P(Peer to Peer) System being escape traditional structure, Server-Client, it enable information transact between users, and resolve the problem of network, add-cost of server-ensurance, etc. Also, it is possible to trade information between person to person, client to provide. In this paper, we investigate on-going p2p models and study on the p2p based control based system.

Mobile Agent Based Discovery Mechanism for Pure P2P Environments (순수 P2P 환경을 위한 이동 에이전트 기반 자원 검색 기법)

  • Kim, In-Suk;Kim, Moon-Jeong;Kim, Moon-Hyun;Kim, Ung-Mo;Eom, Young-Ik
    • The KIPS Transactions:PartD
    • /
    • v.10D no.2
    • /
    • pp.327-336
    • /
    • 2003
  • Recently the rapid growth of Internet and the construction of high speed networks make many kinds of multimedia services possible. But most of current multimedia services are designed being by client/server model, which incurs high load of central server. In order to solve this problem, we propose a peer-to-peer network-based discovery mechanism for multimedia services. In the proposed scheme, mobile agents that have autonomy and mobility are used to search the location of resources. Use of mobile agents can solve the loss problem of the search result that occurs when the network is unsettled in pure peer-to-peer network. It also supports interoperability in heterogeneous system environments. In the proposed scheme, each host maintains the location information of resources which are locally requested or recently requested by other hosts. So, the proposed scheme has faster response time than the pre-existing mechanisms in pure peer-to-peer network environments.

A Super-Peer Coordination Scheme for Decentralized Peer-to-Peer Networking Using Mobile Agents

  • Chung, Won-Ho;Kang, Namhi
    • International journal of advanced smart convergence
    • /
    • v.4 no.2
    • /
    • pp.38-45
    • /
    • 2015
  • Peer-to-Peer(P2P) systems are generally classified into two categories; hybrid and pure P2P. Hybrid systems have a single central index server keeping the details of shared information, so that undesirable effects such as heavy load on that server and lack of fault-tolerance can be caused. Pure P2P causes the other problems such as message flooding and scalability although it shows high degree of fault-tolerance. Recently, mobile agent-based distributed computing has been receiving wide attention for its potential to support disconnected operations, high asynchrony, and thus saving network bandwidth. In this paper, a new scheme of peer coordination is proposed for a decentralized P2P network with self-organizing structure. We deployed mobile agents for incorporating the advantages of usage of mobile agents into our P2P network. Proposed P2P network has both advantages of hybrid and pure P2P. The problems of heavy load on the server and lack of fault-tolerance are improved by using multiple special peers called super-peers. And the problems of pure P2P can be reduced by using mobile agents.

JXTA based P2P Framework using Mobile Agents (모바일 에이전트를 이용한 JXTA 기반의 P2P 프레임워크)

  • Min, Su-Hong;Cho, Dong-Sub
    • Proceedings of the KIEE Conference
    • /
    • 2003.11c
    • /
    • pp.384-387
    • /
    • 2003
  • In this paper, we have designed the integrated wire and wireless P2P framework using mobile agents to share efficiently resources as media file. Most of the P2P applications are used on the wire network. We propose the integrated wire and wireless P2P framework. Proposed P2P platform is based on JXTA of Sun Microsystems. But JXTA is pure peer-to-peer network model, so it sends message other peers as broadcast style to request resources. In this way, there are some problems as massage overload, bandwidth loss, etc. In order to solve this problem, we propose a hybrid peer-to-peer network model using mobile agent. Proposed scheme also solve existing hybrid pEp model's flaws which have the delay and low rate due to concentrated server. In proposed scheme, mobile agents that have autonomy and mobility are used to search the location of resources. Besides, mobile agents could solve the loss problem of the search result. To improve P2P QoS(Quality of Service), we could monitor peer's state information using PIP(Peer Information Protocol) of JXTA.

  • PDF

Dynamic Load Balancing Scheme Based on Resource Reservation for Migration of Agents in Pure P2P Network Environments (순수 P2P 네트워크 환경에서 에이전트 이주를 위한 자원 예약 기반 동적 부하 균형 기법)

  • Kim, Kyung-In;Kim, Young-jin;Eom, Young-Ik
    • The KIPS Transactions:PartA
    • /
    • v.11A no.4
    • /
    • pp.257-266
    • /
    • 2004
  • Mobile agents are defined as processes which can be autonomously delegated or transferred among the hosts in a network in order to perform some computations on behalf of the user and co-operate with other agents. Currently, mobile agents are used in various fields, such as electronic commerce, mobile communication, parallel processing, search of information, recovery, and so on. In pure P2P network environment, if mobile agents that require computing resources rashly migrate to another peers without consideration on the peer's capacity of resources, the peer may have a problem that the performance of the peer is degraded due to lack of resources. To solve this problem, we propose resource reservation based load balancing scheme of using RMA(Resource Management Agent) that monitors workload information of the peers and that decides migrating agents and destination peers. In mobile agent migrating procedure, if the resource of specific peer is already reserved, our resource reservation scheme prevents other mobile agents from allocating the resource.

A Design of P2P Cloud System Using The Super P2P

  • Jung, Yean-Woo;Cho, Seongsoo;Lee, Jong-Yong;Jeong, KyeDong
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.7 no.1
    • /
    • pp.42-48
    • /
    • 2015
  • Generally, the current commercial cloud system is hosted by the centralization large datacenter. However, the other clouding forms existed and one of them is the P2P cloud. The P2P Cloud is a distributed systems, is freedom to join and leave and is possible to provide the IaaS. Commonly, P2P Cloud System is based on Pure-P2P System. Since a number of connection paths exist, it has a high reliability and easily scalability of the network. However, there are disadvantages of the slow rate of route because of looking up the all peers in order to search for the peer. In this paper, it proposes the P2P cloud system based on super-peer P2P. Super-peer P2P system has fast routing time, because of searching for cluster unit and it also can has high reliability and high scalability. We designs the super Peer cloud service and proposes the system model and Resource Allocation Algorithm for IaaS in Super peer P2P environment.

Design of Social Network P2P System based on Agent (에이전트 기반 소셜 네트워크 P2P 시스템 설계)

  • Kim, Boon-Hee
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.8 no.1
    • /
    • pp.121-126
    • /
    • 2013
  • In the past several years there has been increasing the studies using P2P technology in the distributed system areas. In these P2P systems, the server to support the contents-information have less overloads than the composed system as the server to have resources generally. In this paper, we propose the system to support a social network P2P service based on the social network P2P system. The object of this study was to widen the use of this menu system to determine the price based on visual information by a software agent. Therefore, this system is suitable for micro, small and medium industries in the use of P2P servers and is more usable system interface for owners than previous study.

Dynamic Network routing -an Agent Based Approach

  • Gupha, Akash;Zutshi, Aditya
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2001.01a
    • /
    • pp.50-58
    • /
    • 2001
  • Modern day networks are increasingly moving towards peer to peer architecture where routing tasks will not be limited to some dedicated routers, but instead all computers in a network will take part in some routing task. Since there are no specialized routers, each node performs some routing tasks and information passes from one neighbouring node to another, not in the form of dumb data, but as intelligent virtual agents or active code that performs some tasks by executing at intermediate nodes in its itinerary. The mobile agents can run, and they are free to d other tasks as the agent will take care of the routing tasks. The mobile agents because of their inherent 'intelligence'are better able to execute complex routing tasks and handle unexpected situations as compared to traditional routing techniques. In a modern day dynamic network users get connected frequently, change neighbours and disconnect at a rapid pace. There can be unexpected link failure as well. The mobile agent based routing system should be able to react to these situations in a fact and efficient manner so that information regarding change in topology propagates quickly and at the same time the network should not get burdened with traffic. We intend to build such a system.

  • PDF

Typologies and Characteristics of Adolescent-Peer Delinquency using Latent Class Analysis (잠재계층분석(LCA)을 이용한 청소년-또래 비행의 유형과 특성)

  • Park, Jisu;Kim, Ha Young;Yu, Jin Kyeong;Han, Yoonsun
    • Korean Journal of Child Studies
    • /
    • v.38 no.2
    • /
    • pp.165-176
    • /
    • 2017
  • Objective: Delinquent peers are important predictors of adolescent delinquent behavior. Few studies have classified individuals into groups based on patterns of delinquent behavior among youth and their peers. This study identified latent groups based on adolescent-peer delinquency and examined psychosocial characteristics of each latent group. Methods: First, the study employed latent class analysis based on a nationally representative data of South Korean middle school students (N = 2,277). Both adolescent and peer delinquent behaviors comprised 13 items in the questionnaire that was self-reported by adolescents. Second, the study used multivariate regression models to analyze psychosocial symptoms of latent groups and conducted Wald tests to compare differences among latent groups. Results: Patterns of adolescent-peer delinquency were classified into six latent groups. "Mutual total delinquent group (1.2%)" showed high rates in most delinquent experiences. "Mutual status delinquent group (5.7%)" mainly experienced status delinquency, "Mutual violence delinquent group (5.3%)" showed high rates of violent delinquency. "Peer-only total high delinquent group (3.8%)" reported friends to have engaged in all types of delinquency and "Peer-only total medium delinquent group (11.8%)" reported peer involvement in multiple status and few violent delinquency. Finally, "low risk group (72.2%)" reported low rates of delinquency for themselves and their friends. Regression analysis showed that every "mutual" delinquent group presented significantly worse psychosocial problems than the "low risk group." Conclusion: Using person centered latent class analysis, this study classified six latent classes while considering both delinquent agents and various types of delinquency and investigated specific groups with greater risk of psychosocial problems.