• Title/Summary/Keyword: Peer-to-peer Network

Search Result 423, Processing Time 0.026 seconds

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.

An Efficient Replication Scheme in Unstructured Peer-to-Peer Networks (비구조적인 피어-투-피어 네트워크상에서 효율적인 복제기법)

  • Choi Wu-Rak;Han Sae-Young;Park Sung-Yong
    • The KIPS Transactions:PartA
    • /
    • v.13A no.1 s.98
    • /
    • pp.1-10
    • /
    • 2006
  • For efficient searching in unstructured peer-to-peer systems, random walk was proposed and several replication methods have been studied to compensate for the random walk's low query success rate. This paper proposes an efficient replication scheme that improves the accuracy and speed of queries and reduces the cost by minimizing the number of replicas and by utilizing caches. In this scheme, hub nodes store only content's caches, and one of their neighbors stores the replica. By determining hubs with only limited and local information, we can adaptively generate caches and replicas in dynamic peer-to-peer networks.

Design and Implementation of Video Conference System Using Hybrid Type P2P (하이브리드형 P2P를 이용한 화상회의 시스템의 설계 및 구현)

  • Kim Hyen-Ki
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.11 no.1
    • /
    • pp.21-28
    • /
    • 2006
  • This paper describes the design and implementation of video conference system using hybrid type P2P(Peer to Peer). The proposed video conference system has hybrid type P2P architecture based on a client-server and P2P(Peer to Peer), where client-server is used for exchange of account management, client list and status information and P2P is used for the real time video conference. The proposed video conference system decreases the traffic of server, and cuts down the load of a network. Because the multimedia data is decentralized to client by P2P. Also, this system is tested by the multi-party video conference system using communication protocol and application software through high speed networks.

  • PDF

Enhanced Peer-to-Peer Streaming Protocol to Provide The Selective VoD Service in Live Streaming Session (스트리밍 세션에서 선택적 VoD 서비스 제공을 위한 향상된 피어-투-피어 스트리밍 프로토콜)

  • Yi, Seonwoo;Cho, Sunghyun
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.1
    • /
    • pp.40-47
    • /
    • 2015
  • We propose a method to provide a selective VoD service during live streaming sessions. In the proposed method, each peer joined the live streaming session receives video stream packets with P2P manner and stores the packets to provide a VoD service. To mitigate the overhead of each peer node to store the video stream packets, the proposed scheme categorizes peers into three different groups based on their link types. To increase data gathering speed and reduce the network load, we also proposes the P2P transmission scheme within the same AP network for the peers with Wi-Fi link. To evaluate the performance of the proposed method, we implement computer simulator using NS-3. Simulation results show that the proposed method reduces the overhead about 66% and increases the P2P data gathering speed about 50% compared to the conventional schemes.

A Study on the Possibility of Applying Peer-to-Peer(P2P) Model to e-Business (P2P(peer-to-peer) 모델의 e비즈니스 적용 가능성에 관한 연구)

  • Moon, Hyung-Nam
    • International Commerce and Information Review
    • /
    • v.6 no.3
    • /
    • pp.63-79
    • /
    • 2004
  • Peer-to-peer(P2P) has potential strength and possible factors which enable it to develop toward a new business by supplementing the limitation of the existing central server-type network. In various business sectors, various attempts have already been made to apply P2P. The computing power which was possible to be formed through peer-to-peer networking will become a powerful tools for expanding toward new business area depending the utilization methods by sector. Although the technology-centric P2P concept is a major interest now, its development direction will head toward service-centric P2P concept for satisfying desires of end-users(individual peers) for reliable contents and improving their purchasing convenience. But the solution requisites should be solved for the efficient application of P2P to business such as the establishment of and supplement for the industrial standard and legal system for P2P, the enhancement of peers recognition of P2P. Presently e-commerce using P2P is being implemented by a few enterprises locally by means of B2C. But if many enterprises enter this type of e-commerce, and the standardization of peer programmes, goods and documents is made, it will be able to be extended to B2B. Also it seems that it can be utilized in international transactions as well as in domestic transactions. So there is much room for the application of P2P to be extended further. Also there has been presented the necessity for related industries to support their work with theories and for academic studies to be made actively to set the direction of its development. It is hoped that multi-angled and in-depth studies on the utilization of P2P and various attempts to application of it to business be made on the basis of this study. For the development of P2P, continuous study and attempts are needed. The field of P2Ps application is very large and it will become a powerful tool, depending upon its application methods.

  • PDF

Double-layered Peer-to-Peer Systems in MobileAd-hoc Networks (모바일애드혹 네트워크에서의 2계층 피어-투-피어 시스템)

  • Kim, Ji-Hoon;Yang, Sung-Bong
    • The KIPS Transactions:PartC
    • /
    • v.17C no.1
    • /
    • pp.61-68
    • /
    • 2010
  • As the mobile technology advances, file searching among the mobile device users becomes more important. In this paper, we propose the uniform grid, greedy, and MIS P2P systems that have double-layered topology to search files efficiently for mobile ad-hoc networks. In these systems, peers are classified into two groups, super-peers and sub-peers, and each super-peer manages its neighboring sub-peers. In the proposed systems, each super-peer maintains the appropriate information of its sub-peers so that when a peer requests a file, the request is sent to its super-peers and then to neighboring super-peers. Hence the proposed systems could avoid multi-broadcasting and reduce network overheads. The experimental results show that the proposed systems outperform a single-layered P2P system in terms of the average number of messages to find target files. Especially the MISsystem improves by reducing the average number of messages by 48.9% while maintaining the same search accuracy.

Designing Reliable P2P Transmission Mechanism Against MITM Attack (MITM 공격에 안전한 P2P 신뢰전송 메커니즘의 설계)

  • Kim, Sang-Choon;Kwon, Hyeonk-Chan;Nah, Jae-Hoon
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.18 no.4
    • /
    • pp.103-109
    • /
    • 2008
  • Many Internet application provide the PKI(public key infrastructure)-based service to provide authentication and message integrity. Several researchers proposed PKI-based p2p network framework. However, in the real world, the use of PKI is not suitable for peer to peer network, because the peer-to-peer network is an open and dynamic network. Moreover, currently there is no nation-to-nation interoperable certificate. In this paper, we designed reliable p2p file sharing application without public key infrastructure. To do this we propose reliable public key distribution mechanism to distribute public key safely without PKI infrastructure for two-tier super-peer architecture. In our system, each peer generates and distributes its public/private key pairs, and the public key is securely distributed without PKI. The proposed mechanism is safe against MITM attack. This mechanism can be applied various P2P applications such as file sharing, IPTV, distributed resource sharing and so on

A P2P Service Protocol using The Open Mobile Network API for The Femtocell based Wireless Enterprise Network (Femtocell을 활용하는 기업무선망 환경을 위한 개방형 모바일 네트워크 API 기반 P2P 서비스 프로토콜)

  • Lee, Sung-Won
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.1
    • /
    • pp.21-28
    • /
    • 2009
  • In this paper, we consider the Femtocell based enterprise wireless network using 2G/3G/4G cellular network technologies. And, we apply the open network service API which enable an easy development of ISP or enterprise services to P2P enterprise services. Based on the proposed scheme, enterprise services can be always connected at anywhere and anytime via heterogeneous devices. By using a qualitative analysis, we evaluate the performance of the proposed scheme and compare with that of the famous P2P service - Skype. Results show that the proposed scheme requests smaller servers and flows with enhanced service quality.

A Study on the Relevance of Social Cognitive Map Analysis to Peer Subgrouping of Elementary School Students (초등학생의 또래하위집단 분류에 대한 사회인지도 분석의 적합성 연구)

  • Ahn, Ie-Hwan;Shin, Min-Shik
    • The Korean Journal of Elementary Counseling
    • /
    • v.10 no.2
    • /
    • pp.151-165
    • /
    • 2011
  • This study aims to demonstrate how well SCM analysis, which indicates social cognitive map of categorizing peer subgroups of elementary school students, corresponds with that of teachers. To do this, the subject of this study includes two classes of the 3rd and the 5th grade students in D elementary school in B-gu, Busan city. Over 30 students of each gender in each grade were surveyed with social network questionnaires to collect data. The result of the social network survey was analyzed by SCM 4.0 program to categorize peer subgroups within each class. The categorized peer subgroups were reported to the class teacher. Based on the report, the class teachers observed peer subgroups in classes. After the teachers observed and categorized the students into several peer groups, an analysis was conducted to compare the peer subgrouping by students with that by teachers. The result showed the two were 80% correspondent to each other regardless of gender and grade. If interobserver reliability stays within the range of 80-100%, it is considered reliable. And this leads to the conclusion that peer subgrouping by students' cognition and that by teachers' observation can be regarded quite corresponding. In conclusion, peer subgrouping through SCM is significant when peer subgrouping Korean children, and it appears to be more significant when analyzed considering different variables including gender and grade. Peer subgrouping by girls is shown to be more accurate than that by boys.

  • PDF

Effective B-Chord look-up peer in P2P overlay network (P2P 오버레이 네트워크에서 효과적인 Peer 검색을 위한 B-Chord)

  • Hong, Rok Ji;Moon, Il Young
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.7 no.4
    • /
    • pp.1-6
    • /
    • 2011
  • In this paper, search-efficient Bi-directional-Chord(B-Chord) is proposed in P2P (peer-to-Peer) overlay network. Chord is the most popular P2P Look-up protocol. However, it applied to the mobile environment, the search success rate become lower and the request delay time increases. That is big problem. Thus, by improving the existing Chord, in this paper proposed B-Chord reduces the request delay time to in a mobile environment. Proposed B-Chord have the two Finger table and can search by selecting Finger table depending on the value of Key. By use these bi-directional, it can reduce the number of nodes Hop and search delay time. Thus, As a result, it will be able to increase the search success rate in a mobile environment.