• Title/Summary/Keyword: Peer-To-Peer Search Scheme

Search Result 20, Processing Time 0.02 seconds

A Peer-to-Peer Search Scheme using Self-Organizing Super Peer Ring (자기 조직적 우수 피어 링 구조를 이용한 피어-투-피어 검색기법)

  • Son, Jae-Eui;Han, Sae-Young;Park, Sung-Yong
    • The KIPS Transactions:PartA
    • /
    • v.13A no.7 s.104
    • /
    • pp.623-632
    • /
    • 2006
  • We propose a peer-to-peer search scheme in which super peers with high rapacity constitute a ring by themselves and all peers utilize the ring for their query and publishing keys. In a dynamic peer-to-peer environment, the size of the super peer ring changes adaptively according to the changes of the system, but more powerful peers are continuously promoted to super peers. By simulations, we show that our proposed search scheme improves the query success rate of Gnutella+1hop replication search method, and maintains shorter query delay than JXTA as a static ring.

Adaptive Control of Super Peer Ration using Particle Swarm Optimization in Self-Organizing Super Peer Ring Search Scheme (자기 조직적 우수 피어 링 검색기법에서 입자 군집 최적화(PSO)를 이용한 적응적 우수 피어 비율 조절 기법)

  • Jang, Hyung-Gun;Han, Sae-Young;Park, Sung-Yong
    • The KIPS Transactions:PartA
    • /
    • v.13A no.6 s.103
    • /
    • pp.501-510
    • /
    • 2006
  • The self-organizing super peer ring P2P search scheme improves search performance of the existing unstructured peer-to-peer systems, in which super peers with high capacity constitute a ring structure and all peer in the system utilize the ring for publishing or querying their keys. In this paper, we further improves the performance of the self-organizing ring by adaptively changing its super peer ratio according to the status of the entire system. By using PSO, the optimized super peer ratio can be maintained within the system. Through simulations, we show that our self-organizing super peer ring optimized by PSO outperforms not only the fixed super peer ring but also the self-organizing super ring with fixed ratio in the aspect of query success rate.

Effective Routing Schemes for Double-Layered Peer-to-Peer Systems in MANET

  • Kim, Ji-Hoon;Lee, Kwang-Jo;Kim, Taek-Hun;Yang, Sung-Bong
    • Journal of Computing Science and Engineering
    • /
    • v.5 no.1
    • /
    • pp.19-31
    • /
    • 2011
  • In this paper, we propose two new routing schemes for double-layered peer-to-peer systems; a shorter-lower mobility routing scheme and a reverse path routing scheme. The shorter-lower mobility routing scheme first chooses shortest routing paths among possible routing paths and selects the path associated with the relay peer who has lower mobility to improve the reliability of the system. The reverse path routing scheme carries out unicasting (instead of multicasting) based on the reverse path information that can be obtained during the initial file search to further reduce network traffic. The experimental results showed that a double-layered peer-topeer system with the proposed hybrid scheme improved the reliability of the system about 1.5% over the hop count scheme and reduced network traffic by about 0.5% compared to the hop count scheme.

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

Peer Indexing Scheme using Efficient Data Dissemination in Mobile P2P Environment (이동 P2P 환경에서 효율적인 데이터 전송을 이용한 피어 색인 기법)

  • Kwak, Dong-Won;Bok, Kyoung-Soo;Park, Yong-Hun;Jeong, Keun-Soo;Choi, Kil-Sung;Yoo, Jae-Soo
    • The Journal of the Korea Contents Association
    • /
    • v.10 no.9
    • /
    • pp.26-35
    • /
    • 2010
  • In this paper, we propose the peer indexing scheme using data dissemination considering content and mobility. The proposed scheme consists of an index table, a buddy table, a routing table to support the cost of data dissemination, the search accuracy and cost. In this proposed scheme, a neighbor peer is recognized through a signal function and the cost of data dissemination is reduced by timestamp message. The transmitted messages are stored in the index structure considering timestamp and weight of interests which improves search accuracy and reduces the cost of search.

A Study on Research Scheme for Peer-to-Peer Network Using Smart Network (스마트 네트워크 구조를 활용한 Peer-to-Peer 기반 콘텐츠 검색 기법 연구)

  • Kang, Mi-Young;Nam, Ji-Seung
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.3 no.2
    • /
    • pp.57-62
    • /
    • 2014
  • In order to provide real-time multimedia streaming service, a lot of system resources and network bandwidth required. Thus each computer is any computer other equivalent has the ability to act as a client and a server Peer-to-Peer(P2P) architecture with much interest. In this paper, techniques of P2P content that requires a user to efficiently retrieve the desired time in the streaming service have placed the focus of the research techniques. In a number present in the P2P contents, the user requests to find out the desired amount of time the content streaming services in order to provide seamless lookup latency contents search algorithm to minimize the study. P2P based smart network system and the structure of the super-node and the peer node is composed of super-gateway. Smart network system architecture proposed by performing a content search algorithm. The user requests a desired content, the service can be retrieved within the provided the flexibility.

Adaptive Link Recovery Period Determination Algorithm for Structured Peer-to-peer Networks (구조화된 Peer-to-Peer 네트워크를 위한 적응적 링크 복구 주기 결정 알고리듬)

  • Kim, Seok-Hyun;Kim, Tae-Eun
    • Journal of Digital Contents Society
    • /
    • v.12 no.1
    • /
    • pp.133-139
    • /
    • 2011
  • Structured P2P (peer-to-peer) networks have received much attention in research communities and the industry. The data stored in structured P2P networks can be located in a log-scale time without using central severs. The link-structure of structured P2P networks should be maintained for keeping log-scale search performance of it. When nodes join or leave structured P2P networks frequently, some links become unavailable and search performance is degraded by these links. To sustain search performance of structured P2P networks, periodic link recovery scheme is generally used. However, when the link recovery period is short or long compared with node join and leave rates, it is possible that sufficient number of links are not restored or excessive messages are used after the link-structure is restored. We propose the adaptive link recovery determination algorithm to maintain the link-structure of structured P2P networks when the rates of node joining and leaving are changed dynamically. The simulation results show that the proposed algorithm can maintain similar QoS under various node leaving rates.

Time-based DHT Peer Searching Scheme for P2P VOD Service (P2P VOD 서비스를 위한 시간 기반 DHT 피어 탐색 기법)

  • Suh, Chedu;Ko, Choonghyo;Choi, Changyeol;Choi, Hwangkyu
    • Journal of Digital Contents Society
    • /
    • v.15 no.2
    • /
    • pp.251-261
    • /
    • 2014
  • In the typical P2P VOD system, it is very important to develop the fast and efficient peer searching scheme since the peers frequently join and leave to/from P2P system. This paper proposes a new peer searching scheme for P2P VOD system based on DHT network environment. The proposed scheme constructs DHT network by managing the peers having close playback starting times and close network locations into a peer all together. The peer information is mapped onto DHT nodes by hashing the key values each of which consists of the starting time and network location of the peer. From the simulation results, the number of messages required to search the partner peers are decreased, and the number of buffer maps exchanging among the peers are also decreased. The proposed scheme can reduce the average network distances among the partner peers. As a result, the proposed scheme makes routing more efficient and it saves the network resources by decreasing communication traffic overhead.

Efficient Peer-to-Peer Lookup in Multi-hop Wireless Networks

  • Shin, Min-Ho;Arbaugh, William A.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.3 no.1
    • /
    • pp.5-25
    • /
    • 2009
  • In recent years the popularity of multi-hop wireless networks has been growing. Its flexible topology and abundant routing path enables many types of applications. However, the lack of a centralized controller often makes it difficult to design a reliable service in multi-hop wireless networks. While packet routing has been the center of attention for decades, recent research focuses on data discovery such as file sharing in multi-hop wireless networks. Although there are many peer-to-peer lookup (P2P-lookup) schemes for wired networks, they have inherent limitations for multi-hop wireless networks. First, a wired P2P-lookup builds a search structure on the overlay network and disregards the underlying topology. Second, the performance guarantee often relies on specific topology models such as random graphs, which do not apply to multi-hop wireless networks. Past studies on wireless P2P-lookup either combined existing solutions with known routing algorithms or proposed tree-based routing, which is prone to traffic congestion. In this paper, we present two wireless P2P-lookup schemes that strictly build a topology-dependent structure. We first propose the Ring Interval Graph Search (RIGS) that constructs a DHT only through direct connections between the nodes. We then propose the ValleyWalk, a loosely-structured scheme that requires simple local hints for query routing. Packet-level simulations showed that RIGS can find the target with near-shortest search length and ValleyWalk can find the target with near-shortest search length when there is at least 5% object replication. We also provide an analytic bound on the search length of ValleyWalk.

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.