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

Search Result 585, Processing Time 0.032 seconds

Digital Rights Management System for P2P Network (P2P 방식의 디지털 권한 관리 시스템)

  • Jung, Je-Rin;Choi, Hyong-Eun;Kim, Yun-Hyung;Kim, Tae-Hyung
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2006.10a
    • /
    • pp.203-208
    • /
    • 2006
  • 본 논문에서는 MPEG-21 프레임워크를 Peer-to-Peer Network 상에서 구동시킬 때의 문제점을 해결하면서, P2P의 장점을 최대한 이용할 수 있도록 하는 P2P 방식의 디지털 권한 관리 시스템(P2PDRMEngine)을 설계한다. MPEG-21 프레임워크의 여러 구성 요소들 중 IPMP(Intellectual Property Management and Protection components), DI(Digital Item), Multimedia Contents 등의 구조에 몇 가지 요소를 추가하여 P2PDRMEngine과 MPEG-21 프레임워크가 서로 유기적인 동작을 할 수 있도록 설계하고 또한, DI를 생산, 배포, 사용할 때 사용자에게 편리성을 제공 해주는 기능도 고려한다. P2PDRMEngine은 기존의 MPEG-21 프레임워크의 수행에 지장을 주지 않으면서 보안적인 측면과 요소 간의 기능을 강화하는 데 초점을 맞추어 설계한 시스템이다.

  • PDF

P2P Networking based on CAN for Effective Multimedia Contents Sharing (효율적인 멀티미디어 콘텐츠 공유를 위한 CAN 기반 P2P 네트워킹)

  • 박찬모;김종원
    • Proceedings of the IEEK Conference
    • /
    • 2003.11a
    • /
    • pp.259-262
    • /
    • 2003
  • A efficient P2P (peer to peer) networking for sharing multimedia contents is proposed to overcome the limitations of unstructured approaches. The proposed approach is attempting to organize the participating P2P nodes by modifying a n-dimensional cartesian-coordinate space DHT (distributed hash table), CAN (content addressable network). The network identifiers (e.g., network prefix of IP address) of participating nodes are mapped into the CAN virtual coordinate space (in 2-d) and nodes with similar identifiers are grouped into the same zone. The proposed scheme is expected to show some level of concentration reflecting the network identifiers. Network simulator-based evaluation is performed to verify the effectiveness of the proposed scheme.

  • PDF

A Symmetric Lookup-based Secure P2P Routing Algorithm

  • Luo, Bingqing;Jin, Yiai;Luo, Shengmei;Sun, Zhixin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.5
    • /
    • pp.2203-2217
    • /
    • 2016
  • To prevent structured peer to peer (P2P) overlay networksfrom being attacked by malicious nodes, a symmetric lookup-based routing algorithm referred to as Symmetric-Chord is proposed in this paper. The proposed algorithm determines the precision of routing lookup by constructing multiple paths to the destination. The selective routing algorithm is used to acquire information on the neighbors of the root. Authenticity of the root is validated via consistency shown between the information ascertained from the neighbors and information from the yet-to-be-verified root, resulting in greater efficiency of resource lookup. Simulation results demonstrate that Symmetric-Chordhas the capability of detecting malicious nodes both accurately and efficiently, so as to identify which root holds the correct key, and provides an effective approach to the routing security for the P2P overlay network.

An Efficient P2Proxy Caching Scheme for VOD Systems (VOD 시스템을 위한 효율적인 P2Proxy 캐싱 기법)

  • Kwon Chun-Ja;Choi Chi-Kyu;Lee Chi-Hun;Choi Hwang-Kyu
    • The KIPS Transactions:PartA
    • /
    • v.13A no.2 s.99
    • /
    • pp.111-122
    • /
    • 2006
  • As VOD service over the Internet becomes popular, a large sealable VOD system in P2P streaming environment has become increasing important. In this paper, we propose a new proxy caching scheme, called P2Proxy, to replace the traditional proxy with a sealable P2P proxy in P2P streaming environment. In the proposed scheme, each client in a group stores a different part of the stream from a server into its local buffer and then uses a group of clients as a proxy. Each client receives the request stream from other clients as long as the parts of the stream are available in the client group. The only missing parts of the stream which are not in the client group are directly received from the server. We represent the caching process between clients in a group and a server and then describe a group creation process. This paper proposes the directory structure to share the caching information among clients. By using the directory information, we minimize message exchange overload for a stream caching and playing. We also propose a recovery method for failures about the irregular behavior of P2P clients. In this paper, we evaluate the performance of our proposed scheme and compare the performance with the existing P2P streaming systems.

Analysis and Modeling of Traffic at Ntopia Subscriber Network of Korea Telecom (KT의 Ntopia가입자 망 트래픽 분석 및 모델링)

  • 주성돈;이채우
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.41 no.5
    • /
    • pp.37-45
    • /
    • 2004
  • As Internet technologies are mature, many new applications that are different characteristics are emerging. Recently we see wide use of P2P(Peer to Peer) applications of which traffic shows different statistical characteristics compared with traditional application such as web(HTTP) and FTP(File Transfer Protocol). In this paper, we measured subscriber network of KT(Korea Telecom) to analyze P2P traffic characteristics. We show flow characteristics of measured traffic. We also estimate Hurst parameter of P2P traffic and compare self-similarity with web traffic. Analysis results indicate that P2P traffic is much bustier than web traffic and makes both upstream traffic and downstream traffic be symmetric. To predict parameters related QoS such as packet loss and delays we model P2P traffic using two self-similar traffic models and predict both loss probability and mm delay then compare their accuracies. With simulation we show that the self-similar traffic models we derive predict the performance of P2P traffic accurately and thus when we design a network or evaluate its performance, we can use the P2P traffic model as reference input traffic.

Message Routing Mechanism using Network Topology Information in DHT based P2P Network (DHT 기반 P2P 네트워크에서 네트워크 토폴로지를 고려한 메시지 라우팅 매커니즘)

  • Son, Young-Sung;Kim, Hee-Jeong;Kim, Gyung-Seok
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.1
    • /
    • pp.175-178
    • /
    • 2005
  • 인터넷 상의 불특정 다수의 컴퓨팅 자원을 연계하여 오버레이 네트워크를 구성하여 새로운 컴퓨팅 인프라를 구성하려는 분산 해쉬 테이블 (Distributed Hash Table)방식의 Peer-to-Peer(P2P) 네트워크 관련 연구가 진행되고 있다. DHT 방식의 P2P네트워크는 자원의 복제 및 공유하여 컴퓨팅 시스템 전반에 걸친 신뢰성과 결함 감내 능력을 향상시키는 장점이 있는 반면에 하부 네트워크 정보를 무시하기 때문에 전체 시스템 구성 및 메시지 전송에 있어 실제적인 성능상의 문제점을 드러낸다. 이 논문에서는 하부 네트워크의 구성 정보를 이용하여 DHT 기반의 P2P 네트워크의 메시지 전송 방식의 효율을 높이는 방법을 소개한다.

  • PDF

A Preliminary Study on the Effectiveness of the Peer Relationship Enhancement Program in Adolescents at Risk for Internet and Smartphone Addiction

  • Kim, Tae-Ho;Jun, Young-Soon;Shin, Young-Tae;Lim, So-Hee;Seo, Joo-Won
    • Journal of the Korean Academy of Child and Adolescent Psychiatry
    • /
    • v.29 no.2
    • /
    • pp.40-46
    • /
    • 2018
  • Objectives: The purpose of this study is to evaluate the preliminary effects of the Peer Relationship Enhancement Program in adolescents deemed to be in an at-risk group for Internet and smartphone addiction. Methods: The study group consisted of 33 adolescent participants (24 boys and 9 girls) at risk of Internet and smartphone addiction in small and medium-sized cities. The subjects participated in 8 consecutive sessions of the Peer Relationship Enhancement Program. The Korean Internet Addiction Proneness Scale, the Korean Smartphone Addiction Proneness Scale, the Real-Ideal Self Discrepancy Scale, the UCLA Loneliness Scale, the Peer Intimacy Scale, and the Escaping from the Self Scale were evaluated before the initial and after the final session. A paired t-test was performed to statistically analyze the data. Results: The Peer Relationship Enhancement Program led to a significant decrease (p<0.05) in self-reported measures of The Korean Internet Addiction Proneness Scale, the Korean Smartphone Addiction Proneness Scale, and the Real-Ideal Self Discrepancy Scale. Conclusion: The Peer Relationship Enhancement Program reduces the risk of Internet and smartphone addiction and effectively prevents the associated problems.

A Data Dissemination Mechanism for Grid Environments (그리드 환경을 위한 데이터 분산 전송 기법)

  • Kim Hyung-Jinn;Lee Jong-Suk Ruth
    • Journal of Internet Computing and Services
    • /
    • v.7 no.6
    • /
    • pp.63-77
    • /
    • 2006
  • Nowadays as many Grid communities appear, the requirement of singlepoint-to-multipoint data transfer in Grid environment is growing. In a typical LAN or a special purpose network environment, a multicasting technology was used in such a data dissemination transfer case. However, compared with unicasting fouler performance transfer performance the multicating transfer is worse, and the obligation of a special hardware setting makes it difficult to implement in common Grid environment. Therefore, in this paper we propose on effective data dissemination mechanism for Grid environment named DDMG(Data Dissemination Mechanism for Grid), DDMG uses P2P(Peer-to-Peer) mechanism and Globus XIO library to improve the performance in a data dissemination process and to support heterogeneous protocols in Grid environment. We also evaluate the performance of DDMG mechanism in LAN and WAN environment by comparing with unicast transfer.

  • PDF

Dynamic Capacity and Similarity based Two-Layer P2P Network (동적인 성능과 유사도 기반의 계층형 P2P 시스템)

  • Min Su-Hong;Cho Dong-Sub
    • Annual Conference of KIPS
    • /
    • 2006.05a
    • /
    • pp.749-752
    • /
    • 2006
  • 최근 P2P (Peer-to-Peer) 시스템은 인터넷의 사용량 증가와 네트워크 속도의 증가, 개인 PC 의 성능 향상과 같은 외부적인 요인과 기존의 클라이언트 서버와 비교해 보다 효율적으로 다양한 자원을 공유할 수 있다는 내부적인 장점으로 인해 관심이 증가되고 있다. 초기 P2p 시스템은 냅스터와 같은 중앙 집중형 기반에서 JXTA 와 같은 순수 모델로 변화 되었으며, 최근 두 가지의 장점을 결합한 수퍼 피어 기반의 계층형 시스템이 연구되고 있다. 본 논문에서는 피어를 수퍼 피어와 일반 피어로 분류하는 2 계층 P2P 시스템에 대해 연구하였다. 제안한 시스템은 일반 피어가 동적인 성능과 유사도를 기반으로 최적의 수퍼 피어를 선택하도록 한다. 일반 피어는 가장 적합한 수퍼 피어를 선택함으로서 보다 효율적으로 쿼리를 처리할 수 있으며 일반 피어가 요구하는 서비스와 유사한 서비스를 제공함으로써 일반 피어의 만족도를 향상 시킬 수 있다.

  • PDF

Capacity aware Scalable Video Coding in P2P on Demand Streaming Systems

  • Xing, Changyou;Chen, Ming;Hu, Chao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.9
    • /
    • pp.2268-2283
    • /
    • 2013
  • Scalable video coding can handle peer heterogeneity of P2P streaming applications, but there is still a lack of comprehensive studies on how to use it to improve video playback quality. In this paper we propose a capacity aware scalable video coding mechanism for P2P on demand streaming system. The proposed mechanism includes capacity based neighbor selection, adaptive data scheduling and streaming layer adjustment, and can enable each peer to select appropriate streaming layers and acquire streaming chunks with proper sequence, along with choosing specific peers to provide them. Simulation results show that the presented mechanism can decrease the system's startup and playback delay, and increase the video playback quality as well as playback continuity, and thus it provides a better quality of experience for users.