• Title/Summary/Keyword: P2P Network

Search Result 1,239, Processing Time 0.046 seconds

P2P Network Organization using Grouping in Mobile Ad-hoc Network (모바일 Ad-hoc 네트워크에서 그룹화를 통한 P2P 네트워크 구축)

  • Haw, Rim;Hong, Choong Seon;Kim, Dae Sun
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2009.04a
    • /
    • pp.1314-1316
    • /
    • 2009
  • 최근 모바일 단말의 사용과 그에 관련된 제품의 개발이 급증하고 있는 관계로 이와 관련된 많은 Peer-to-Peer (P2P) 연구들이 진행 중이다. 특히, Mobile Ad-Hoc 네트워킹 환경에서의 P2P 방식에 대한 연구 또한 활발히 진행되고 있다. 하지만, Flooding 방식의 메시지 전송은, 파일 탐색 시 Query 메시지 가 기하급수 적으로 증가할 수 있다. 이러한 메시지 전송은 센서 네트워크에서는 전력의 급격한 소모를 가져와 네트워크의 유지를 할 수 없게 하는 등의 오버헤드를 발생시킨다. 본 논문에서는 이러한 P2P 파일 검색에서의 메시지 전송수를 줄이기 위해 Mobile Ad-Hoc Network 환경에서 Peer를 Parent Peer(PPR)와 Child Peer(CPR)로 구분화하여 그룹화를 시키고 그룹을 Peer로 둔 P2P 네트워크를 구성하였다. 또한, 그룹 안에서 발생하는 CPR들의 가입과 탈퇴를 관리하여 오버헤드 발생을 줄이는 방법을 제안한다.

Overlay Multicast Network for IPTV Service using Bandwidth Adaptive Distributed Streaming Scheme (대역폭 적응형 분산 스트리밍 기법을 이용한 IPTV 서비스용 오버레이 멀티캐스트 네트워크)

  • Park, Eun-Yong;Liu, Jing;Han, Sun-Young;Kim, Chin-Chol;Kang, Sang-Ug
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.12
    • /
    • pp.1141-1153
    • /
    • 2010
  • This paper introduces ONLIS(Overlay Multicast Network for Live IPTV Service), a novel overlay multicast network optimized to deliver live broadcast IPTV stream. We analyzed IPTV reference model of ITU-T IPTV standardization group in terms of network and stream delivery from the source networks to the customer networks. Based on the analysis, we divide IPTV reference model into 3 networks; source network, core network and access network, ION(Infrastructure-based Overlay Multicast Network) is employed for the source and core networks and PON(P2P-based Overlay Multicast Network) is applied to the access networks. ION provides an efficient, reliable and stable stream distribution with very negligible delay while PON provides bandwidth efficient and cost effective streaming with a little tolerable delay. The most important challenge in live P2P streaming is to reduce end-to-end delay without sacrificing stream quality. Actually, there is always a trade-off between delay & stream quality in conventional live P2P streaming system. To solve this problem, we propose two approaches. Firstly, we propose DSPT(Distributed Streaming P2P Tree) which takes advantage of combinational overlay multicasting. In DSPT, a peer doesn't fully rely on SP(Supplying Peer) to get the live stream, but it cooperates with its local ANR(Access Network Relay) to reduce delay and improve stream quality. When RP detects bandwidth drop in SP, it immediately switches the connection from SP to ANR and continues to receive stream without any packet loss. DSPT uses distributed P2P streaming technique to let the peer share the stream to the extent of its available bandwidth. This means, if RP can't receive the whole stream from SP due to lack of SP's uploading bandwidth, then it receives only partial stream from SP and the rest from the ANR. The proposed distributed P2P streaming improves P2P networking efficiency.

An Effective P2P Searching Algorithm Based on Leveled OK Mechanism (단계별 OK 기법 기반 효과적 P2P 검색 알고리즘)

  • kim Boon-Hee;Lee Jun-Yeon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.2 s.34
    • /
    • pp.69-78
    • /
    • 2005
  • As the study and use of P2P systems are diversified, the effect of excessive amount of traffic, which occurs in searching peers' resource and is considered as a network bandwidth Problem, cannot let the matter Pass without making a protest. In case P2P application doesn't reduce network traffic, it can be much effected to use bandwidth smoothly in the internet environment where various network applications lie scattered and there will be inconvenience when many network users makes use of related applications . In this Paper, we propose a pure P2P model based-broadcasting technique for producing successful hit ratio and traffic amount in the weakly connected environment based-P2P system where situation of peers' connection and exit is ambiguous . The proposed searching technique is designed/implemented to improve a resident problem in the related system and we have estimated the performance of the proposed searching technique comparing our technique with the existing broadcasting based-searching technique .

  • PDF

Optimal Video Streaming Based on Delivery Information Sharing in Hybrid CDN/P2P Architecture

  • Lee, Jun Pyo;Lee, Won Joo;Lee, Kang-Ho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.23 no.9
    • /
    • pp.35-42
    • /
    • 2018
  • In this paper, we propose an optimal streaming service method based on Hybrid CDN/P2P architecture. Recently, video streaming utilizes a CDN (Content Delivery Network) operation technique based on a Proxy Server, which is an end node located close to a user. However, since CDN has a fixed network traffic bandwidth and data information exchange among CDNs in the network is not smooth, it is difficult to guarantee traffic congestion and quality of image service. In the hybrid CDN/P2P network, a data selection technique is used to select only the data that is expected to be continuously requested among all the data in order to guarantee the QoS of the user who utilizes the limited bandwidth efficiently. In order to search user requested data, this technique effectively retrieves the storage information of the constituent nodes of CDN and P2P, and stores the new image information and calculates the deletion priority based on the request possibility as needed. Therefore, the streaming service scheme proposed in this paper can effectively improve the quality of the video streaming service on the network.

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 Study on Intrusion Detection Method using Collaborative Technique (협업 기법을 이용한 침입탐지 탐지 방법에 관한 연구)

  • Yang, Hwan Seok
    • Convergence Security Journal
    • /
    • v.21 no.1
    • /
    • pp.121-127
    • /
    • 2021
  • MANET, which does not have any infrastructure other than wireless nodes, has the advantage of being able to construct a fast network. However, the movement of nodes and wireless media are also the causes of security vulnerabilities of MANET. In particular, the damage caused by the attacking nodes existing on the network is considerably greater than that of other networks. Therefore, it is necessary to detection technique for attacking nodes and techniques to reduce damage caused by attacks. In this paper, we proposed a hierarchical structure technique to increase the efficiency of intrusion detection and collaboration-based intrusion detection technique applying a P2P mesh network configuration technique to reduce damage caused by attacks. There was excluded the network participation of the attacking node in advance through the reliability evaluation of the nodes in the cluster. In addition, when an attack by an attacking node is detected, this paper was applied a method of minimizing the damage of the attacking node by transmitting quickly the attack node information to the global network through the P2P mesh network between cluster heads. The ns-2 simulator was used to evaluate the performance of the proposed technique, and the excellent performance of the proposed technique was confirmed through comparative experiments.

An Efficient Resource Discovery Mechanism based on Distributed Location Information in Pure P2P Environments (순수 P2P 환경에서 분산된 위치 정보를 이용한 자원 검색 기법)

  • Kim In-suk;Kang Yong-hyeog;Eom Young Ik
    • Journal of KIISE:Information Networking
    • /
    • v.31 no.6
    • /
    • pp.573-581
    • /
    • 2004
  • Recently, the rapid growth of Internet technology and the deployment of high speed networks make many kinds of multimedia services possible. Preexisting multimedia services are designed based on the client/server model which has the problems such as the network failure and the low speed communication due to the high load on the central server. In order to solve these problems, peer-to-peer networks are introduced and expanded through Internet environments. In this paper, we propose a pure peer-to-peer network based resource discovery mechanism for multimedia services. In the proposed scheme, each host maintains the location information of resources which are recently requested by other hosts as well as that oi the replicas of local resources. The proposed scheme has the faster response time and incurs the smaller traffic than the preexisting discovery schemes in pure peer-to-peer network environments. Also, by decentralizing the location information and differentiating the reply path, our proposed scheme can solve the search result loss problem that occurs when the network is unsettled.

Optimal Number of Super-peers in Clustered P2P Networks (클러스터 P2P 네트워크에서의 최적 슈퍼피어 개수)

  • Kim Sung-Hee;Kim Ju-Gyun;Lee Sang-Kyu;Lee Jun-Soo
    • The KIPS Transactions:PartC
    • /
    • v.13C no.4 s.107
    • /
    • pp.481-490
    • /
    • 2006
  • In a super-peer based P2P network, The network is clustered and each cluster is managed by a special peer, called a super-peer which has information of all peers in its cluster. This clustered P2P model is known to have efficient information search and less traffic load. In this paper, we first estimate the message traffic cost caused by peer's query, join and update actions within a cluster as well as between the clusters and with these values, we present the optimal number of super-peers that minimizes the traffic cost for the various size of super-peer based P2P networks.rks.

Device Discovery using Feed Forward Neural Network in Mobile P2P Environment

  • Kwon, Ki-Hyeon;Byun, Hyung-Gi;Kim, Nam-Yong;Kim, Sang-Choon;Lee, Hyung-Bong
    • Journal of Digital Contents Society
    • /
    • v.8 no.3
    • /
    • pp.393-401
    • /
    • 2007
  • P2P systems have gained a lot of research interests and popularity over the years and have the capability to unleash and distribute awesome amounts of computing power, storage and bandwidths currently languishing - often underutilized - within corporate enterprises and every Internet connected home in the world. Since there is no central control over resources or devices and no before hand information about the resources or devices, device discovery remains a substantial problem in P2P environment. In this paper, we cover some of the current solutions to this problem and then propose our feed forward neural network (FFNN) based solution for device discovery in mobile P2P environment. We implements feed forward neural network (FFNN) trained with back propagation (BP) algorithm for device discovery and show, how large computation task can be distributed among such devices using agent technology. It also shows the possibility to use our architecture in home networking where devices have less storage capacity.

  • PDF

A Study on Location-based Routing Technique for Improving the Performance of P2P in MANET (MANET에서 P2P 성능 향상을 위한 위치기반 라우팅 기법에 관한 연구)

  • Yang, Hwanseok
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.11 no.2
    • /
    • pp.37-45
    • /
    • 2015
  • The technology development of MANET and dissemination of P2P services has been made very widely. In particular, the development of many application services for the integration of P2P services in MANET has been made actively. P2P networks are commonly used because of the advantages of efficient use of network bandwidth and rapid information exchange. In P2P network, the infrastructure managing each node in the middle does not exist and each node is a structure playing a role as the sender and receiver. Such a structure is very similar to the structure of the MANET. However, it is difficult to provide reliable P2P service due to the high mobility of mobile nodes. In this paper, we propose location-based routing technique in order to provide efficient file sharing and management between nodes. GMN managing the group is elected after network is configured to the area of a certain size. Each node is assigned an identifier of 12 bit dynamically to provide routing which uses location information to the identifier. ZGT is managed in the GMN in order to provide management of group nodes and distributed cache information. The distributed cache technique is applied to provide a rapid retrieval of the sharing files in the each node. The excellent performance of the proposed technique was confirmed through experiments.