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

Search Result 125, Processing Time 0.037 seconds

An Efficient Peer-to-Peer Streaming Scheme Based on a Push-Mesh Structure (푸시-메시 구조 기반의 효율적인 피어투피어 스트리밍 기법)

  • Kim, Jin-Sung;Kim, Dong-Il;Kim, Eun-Sam;Pae, Sung-Il
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.3
    • /
    • pp.81-89
    • /
    • 2010
  • The research on peer-to-peer streaming schemes has largely focused on tree-push and mesh-pull structures. However, the tree-push structure has a defect that the tree restructuring time is long, and the mesh-pull structure has long startup delay and lag time from source servers. In this paper, we propose a new peer-to-peer live streaming scheme based on a push-mesh structure that takes advantages of tree-push and mesh-pull structure simultaneously. This structure basically provides the mesh-pull mechanism for data transmission and utilizes peers with high network upload capacity. It also supports the push mechanism along with paths from a source server, super peers, and selected general peers. By NS-2 simulation experiments, we finally show that our proposed scheme can achieve shorter startup delay than the mesh-pull structure, similar lag time to tree-push structure and best playback continuity among the three schemes.

Efficient Mobile P2P Structure for Content Search Services (콘텐츠 검색 서비스를 위한 효율적인 이동 P2P 구조)

  • Kwak, Dong-Won;Bok, Kyoung-Soo;Kang, Tae-Ho;Yeo, Myung-Ho;Yoo, Jae-Soo;Joe, Ki-Hung
    • The Journal of the Korea Contents Association
    • /
    • v.9 no.1
    • /
    • pp.30-44
    • /
    • 2009
  • In this paper, we propose the mobile P2P structure supporting content searches for mobile peers efficiently. The proposed mobile P2P structure is a 3-tier structure which consists of a mobile peer, a mobile super peer, and a stationary super peer to reduce the content search cost of mobile P2P service. For content searches, mobile peer searches content in the communication range and performs hierarchical content searches which is using mobile super peer, stationary super peer for expansion of query region. In order to support hierarchial content searches and the continuity of services according to peer mobilities, peer's join/leave processes are explicitly stored by supporting message structures to the upper layer It is shown through experimental evaluation that the proposed structure improves about 32% contents search performance over the existing 2-tier structure. Since it also reduces the messages transferred to the stationary super peers, it reduced about 25% search loads of them.

A Design of Peer-to-Peer Based IPTV System using Multiple Chain Architecture (다중 체인구조를 이용한 Peer-to-Peer 기반 IPTV 시스템 설계)

  • Kim, Ji-Hoon;Kim, Young-Han
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.12
    • /
    • pp.74-82
    • /
    • 2008
  • In this paper, we propose a P2P based IPTV system using a multiple chain architecture. Proposed system is robust to the peer churn. As opposed to the internet the IPTV network managed by a single ISP has fewer bandwidth constraints and end-to-end connectivity. So, we emphasize preferentially robustness of a P2P network in IPTV environment. A single chain structure which was proposed previously emphasizes simplicity, however there exists considerable delay time at the end part of peers as the number of peers increasing. As a solution to the problem, we propose the scheme which seperates the chain into several levels and again divides each level into spans to diminish a delay time. Though the chain is separated into level and span, basic structure of proposed scheme is still a chain structure. So the scheme simplifies the recovery procedure caused by join or departure of peers. We will show the improved performance of proposed scheme rather than single chain structure with respect to the delay time and reliability.

Examining the Effects of Trained Peer Feedback on EFL Students' Writing

  • Kim, Bo-Ram
    • English Language & Literature Teaching
    • /
    • v.15 no.2
    • /
    • pp.151-168
    • /
    • 2009
  • The present study investigates the impact of trained peer feedback on the quantity and quality of revisions made by EFL students at a low-intermediate level. Peer review training was carried out in experimental group through four in-class training sessions and four peer dyad-instructor conferences after class. Students' $1^{st}$ drafts with written peer feedback and revised drafts prior to and post training were collected and analyzed. Results reveal that after training the students produced more revisions in response to their peer comments (96% of total revisions) and those revisions were counted as enhanced in quality (93% of peer-triggered revisions). In contrast, the results of paired t-test within control group indicate that there was no significant difference between two data collected from week 3 and week 16 (t = -.57, df =19, p = .577 at p < .05). The findings suggest that training as an ongoing process of teacher intervention contributes to effectiveness of the peer feedback activity. The study provides pedagogical implications for how to structure and implement peer review training for the sake of its direct strength in an EFL writing class.

  • PDF

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.

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.

A Way of PC Mother Board Ethernet Test using P2P (P2P를 활용한 PC Mother Board Ethernet Test 방법 개선)

  • Lee, Young-Ho;Kim, In-Soo;Min, Hyoung-Bok;Kim, Young-Shil
    • Proceedings of the KIEE Conference
    • /
    • 2008.07a
    • /
    • pp.1961-1962
    • /
    • 2008
  • Hybrid Peer-to-Peer structure is sharing resource in each peer, but various resource that is with go peer indexing and segment that search from attained in server who function is solidified that is not attained in peer itself be. Basis algorithm was based on Ethernet protocol and administration of each peer enabled in center server and peer does as can confirm breakdown existence and nonexistence through communication with center server and the internet through this directly expensive test expense and a lot of test times of existing test method of access method necessary problem effectively improve.

  • PDF

Development of System Architecture and Communication Protocol for Unmanned Ground Vehicle (무인자율주행차량의 시스템 아키텍쳐 및 통신 프로토콜 설계)

  • Moon, Hee-Chang;Woo, Hoon-Je;Kim, Jung-Ha
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.14 no.9
    • /
    • pp.873-880
    • /
    • 2008
  • This paper deals with the peer-to-peer data communication to connect each distributed levels of developed unmanned system according to the JAUS. The JAUS is to support the acquisition of unmanned system by providing a mechanism for reducing system life-cycle costs. Each of distributed levels of the JAUS protocol divides into a system, some of subsystems, nodes and components/instances, each of which may be independent or interdependence. We have to distribute each of the levels because high performance is supported in order to create several sub-processor computing data in one processor with high CPU speed performance. To complement such disadvantage, we must think the concept that a distributed processing agrees with separating each of levels from the JAUS protocol. Therefore, each of distributed independent levels send data to another level and then it has to be able to process the received data in other levels. So, peer-to-peer communication has to control a data flow of distributed levels. In this research, we explain each of levels of the JAUS and peer-to-peer communication structure among the levels using our developed unmanned ground vehicle.

A Super-Peer Coordination Scheme for Decentralized Peer-to-Peer Networking Using Mobile Agents

  • Chung, Won-Ho;Kang, Namhi
    • International journal of advanced smart convergence
    • /
    • v.4 no.2
    • /
    • pp.38-45
    • /
    • 2015
  • Peer-to-Peer(P2P) systems are generally classified into two categories; hybrid and pure P2P. Hybrid systems have a single central index server keeping the details of shared information, so that undesirable effects such as heavy load on that server and lack of fault-tolerance can be caused. Pure P2P causes the other problems such as message flooding and scalability although it shows high degree of fault-tolerance. Recently, mobile agent-based distributed computing has been receiving wide attention for its potential to support disconnected operations, high asynchrony, and thus saving network bandwidth. In this paper, a new scheme of peer coordination is proposed for a decentralized P2P network with self-organizing structure. We deployed mobile agents for incorporating the advantages of usage of mobile agents into our P2P network. Proposed P2P network has both advantages of hybrid and pure P2P. The problems of heavy load on the server and lack of fault-tolerance are improved by using multiple special peers called super-peers. And the problems of pure P2P can be reduced by using mobile agents.