• Title/Summary/Keyword: peer-to-peer (p2p)

Search Result 585, Processing Time 0.029 seconds

P2P(Peer-to-Peer) Messenger Integrated Service (피어-투-피어 메신저 통합 서비스)

  • 이태열;박진기;함형범;이양선
    • Proceedings of the Korea Multimedia Society Conference
    • /
    • 2003.11b
    • /
    • pp.508-511
    • /
    • 2003
  • 최근에 인터넷 사용량이 증가함에 따라 자료의 양은 많아지고, 서비스 방식도 복잡해지는 문제가 생겨나게 되었다. 그에 따른 해결방안으로 P2P(Peer-to-Peer) 모델은 2000년대에 들어서 다시 컴퓨터 산업 무대의 중심으로 자리 잡게 되었다. 지금까지 잘 알려져 있는 클라이언트/서버 모델은 계속적으로 증가하고 있는 사용자와의 통신 수요에 대한 문제가 있다. 그렇기 때문에 P2P 모델은 이러한 구조에서 벗어나 사용자들 간의 직접적인 정보 교환을 가능하게 해주어 서버의 역할을 최소화 시켜 주었다. 이러한 이점 때문에 현재 많은 기업체들이 P2P 모델을 클라이언트/서버 모델 이상으로 선호하게 되었다. 자바를 이용해서 개발한 P2P용 메신저 통합 서비스에는 기존의 상대방과의 대화뿐만 아니라 파일 공유, 자료의 업/다운, 멀티미디어 채팅으로 상대방의 얼굴을 보며 대화를 할 수 있는 화상채팅 기능이 있고, 친구들을 쉽게 정리하여 사용자만이 관리를 할 수 있는 공유그룹과 폐쇄그룹을 추가하여 보안에 대비 하였다. 또 키워드 검색, 메타 검색으로 더 많은 자료를 손쉽게 찾을 수가 있다. 시스템 상에 XML, 웹 서버, WAP 게이트웨이 서버를 탑재하였고, 가상의 네트워크인 VPN 사용, 그리고 DB를 사용한 회원관리 및 여러 가지 서비스를 제공한다. 향후 P2P 기술은 P2P 검색, P2P 커뮤니케이션, 무선인터넷관련 기술, XML을 이용한 표준통합기술의 발전으로 더욱 침체된 시장에 활력소 역할을 할 것이다.

  • PDF

An Algorithm to Detect P2P Heavy Traffic based on Flow Transport Characteristics (플로우 전달 특성 기반의 P2P 헤비 트래픽 검출 알고리즘)

  • Choi, Byeong-Geol;Lee, Si-Young;Seo, Yeong-Il;Yu, Zhibin;Jun, Jae-Hyun;Kim, Sung-Ho
    • Journal of KIISE:Information Networking
    • /
    • v.37 no.5
    • /
    • pp.317-326
    • /
    • 2010
  • Nowadays, transmission bandwidth for network traffic is increasing and the type is varied such as peer-to-peer (PZP), real-time video, and so on, because distributed computing environment is spread and various network-based applications are developed. However, as PZP traffic occupies much volume among Internet backbone traffics, transmission bandwidth and quality of service(QoS) of other network applications such as web, ftp, and real-time video cannot be guaranteed. In previous research, the port-based technique which checks well-known port number and the Deep Packet Inspection(DPI) technique which checks the payload of packets were suggested for solving the problem of the P2P traffics, however there were difficulties to apply those methods to detection of P2P traffics because P2P applications are not used well-known port number and payload of packets may be encrypted. A proposed algorithm for identifying P2P heavy traffics based on flow transport parameters and behavioral characteristics can solve the problem of the port-based technique and the DPI technique. The focus of this paper is to identify P2P heavy traffic flows rather than all P2P traffics. P2P traffics are consist of two steps i)searching the opposite peer which have some contents ii) downloading the contents from one or more peers. We define P2P flow patterns on these P2P applications' features and then implement the system to classify P2P heavy traffics.

Extended Peer-to-Peer Protocol based on IPv6 (IPv6 기반 Peer-to-Peer 확장 프로토콜)

  • 박건우;남민지;조호식;권태경;최양회;유태완;이승윤
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2004.10c
    • /
    • pp.682-684
    • /
    • 2004
  • IPv4 주소공간의 고갈 문제를 해결하기 위해 많은 사람들은 IPv6의 도입을 추진하고 있다. 따라서 본격적인 보급을 눈앞에 두고 있는 IPv6은 6BONE과 같은 실험망에서 IPv6을 이용하여 개발된 여러 응용프로그램들로 그 성능 및 효용성을 테스트 받고 있다. IPv6 기반 P2P 확장 프로토콜 연구 및 응용 서비스 개발의 일환으로 Distributed Hash Table(DHT)을 이용한 P2P 오버레이 네트워크를 형성하는 툴을 소개한다. 이 툴은 인스턴트 메신저 기능을 함과 동시에 로그인한 사용자 모두를 대상으로 하는 파일 검색 및 공유 기능도 제공한다. 본 논문에서는 P2P 오버레이 네트워크의 구축 과정과 인스턴트 메신저의 친구 목록을 이용한 효과적인 파일 검색 기법을 중점적으로 설명한다.

  • PDF

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 Device Authentication Mechanism Reducing Performance Cost in Mobile P2P Networks

  • Jeong, Yoon-Su;Kim, Yong-Tae;Shin, Seung-Soo;Lee, Sang-Ho
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.4
    • /
    • pp.923-948
    • /
    • 2013
  • The main concern in mobile peer-to-peer (P2P) networks is security because jamming or eavesdropping on a wireless link is much easier than on a wired one and such damage can be incurred without physical access or contact. In particular, authentication has increasingly become a requirement in mobile P2P environments. This paper presents a new mutual authentication mechanism which requires less storage space and maintains a high level of security in mobile P2P networks. The proposed mechanism improves efficiency by avoiding the use of centralized entities and is designed to be agile in terms of both reliability and low-cost implementation. The mechanism suggested in the simulation evaluates the function costs occurring in authentication between the devices under mobile P2P network environment comparing to existing method in terms of basic operation costs, traffic costs, communications costs, storage costs and scalability. The simulation results show that the proposed mechanism provides high authentication with low cryptography processing overhead.

Continuous K-Nearest Neighbor Query Processing Considering Peer Mobilities in Mobile P2P Networks (모바일 P2P 네트워크에서 피어의 이동성을 고려한 연속적인 k-최근접 질의 처리)

  • Bok, Kyoung-Soo;Lee, Hyun-Jung;Park, Young-Hun;Yoo, Jae-Soo
    • The Journal of the Korea Contents Association
    • /
    • v.12 no.8
    • /
    • pp.47-58
    • /
    • 2012
  • In this paper, we propose a continuous k-nearest neighborhood query processing method for updating the query results in real-time over mobile peer-to-peer environments. The proposed method disseminates a monitoring region to efficiently monitor the k-nearest neighbor peers. The Monitoring Region is created to assure at least k peers as the result of the query within the time range using the vector of neighbor peers. In the propose method, the monitoring region is valid for a long time because it is calculated by the vector of neighbor peers of the query peer. Therefore, the proposed method decreases the cost of re-processing by monitoring region invalidation. In order to show the superiority of the proposed method, we compare it with the previous schemes through performance evaluation.

Efficient Flooding Algorithm for Mobile P2P Systems using Super Peer (슈퍼피어를 이용한 모바일 P2P시스템을 위한 효율적인 플러딩 알고리즘)

  • Kang, So-Young;Lee, Kwang-Jo;Yang, Sung-Bong
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.2
    • /
    • pp.217-221
    • /
    • 2010
  • As the appearances of various new mobile devices and the explosive growth of mobile device users, many researches related to mobile P2P systems have been proceeded actively. In this paper, we propose a new search algorithm for the double-layered super peer system in the mobile environment. For the proposed search algorithm, we divide the entire experiment region into a grid of cells, each of which has the same size. The grid is configured properly by considering the communication range of a mobile device and the number of peers in the system. The proposed search algorithm is a partial flooding search method based on the directions of cells involved with the search. It reduces successfully the network traffic, but shows a low search hit ratio. To enhance the search hit ratio, we introduce a bridge-peer table for a super peer and utilize an n-way search. The experimental results show that the proposed algorithm made an average of 20~30% reduction in the number of message packets over the double-layered system. The success ratio was also improved about 2~5% over the double-layered system.

An Optimal Resource Distribution Scheme for P2P Streaming Service over Centralized DU Environment in LTE (LTE에서 집중화된 DU 환경에서 P2P 스트리밍 서비스를 위한 최적의 자원 배분 방안)

  • Kim, Yangjung;Chong, Ilyoung
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.3 no.3
    • /
    • pp.81-86
    • /
    • 2014
  • According to the development of streaming services with P2P and mobile network technologies, researches to enhance the service quality in mobile environment have been proposed. However, streaming services considering high-speed mobile environment and characteristics of heterogenous terminals have been hindered from being provided with the required quality from user because of bandwidth congestion between selfish peers of existing P2P system. It is also prone to long delay and loss in accordance with the repeated traffic amounts because there are no optimized solution for traffic localization. The structure to enhance peer contribution for service differentiation and peer selection with clustering scheme with location information of terminal can satisfy both users and service providers with service quality and efficiency. In this paper, we propose an incentive mechanism and resource distribution scheme with user contribution and traffic cost information based on user location, which make mobile users increase the satisfaction of service quality in LTE environments.