• Journal of Communications and Networks
• /
• 제14권3호
• /
• pp.286-295
• /
• 2012

To meet the increased demand of video-on-demand (VoD) services, peer-to-peer (P2P) mesh-based multiple video approaches have been recently proposed, where each peer is able to find a video segment interested without resort to the video server. However, they have not considered the constraint of the server's upload bandwidth and the fairness between upload and download amounts at each peer. In this paper, we propose a novel P2P VoD streaming system, named peer cache adaptation (PECAN) where each peer adjusts its cache capacity adaptively to meet the server's upload bandwidth constraint and achieve the fairness. For doing so, we first propose a new cache replacement algorithm that designs the number of caches for a segment to be proportional to its popularity. Second, we mathematically prove that if the cache capacity of a peer is proportional to its segment request rate, the fairness between upload and download amounts at each peer can be achieved. Third, we propose a method that determines each peer's cache capacity adaptively according to the constraint of the server's upload bandwidth. Against the proposed design objective, some selfish peers may not follow our protocol to increase their payoff. To detect such peers, we design a simple distributed reputation and monitoring system. Through simulations, we show that PECAN meets the server upload bandwidth constraint, and achieves the fairness well at each peer. We finally verify that the control overhead in PECAN caused by the search, reputation, and monitoring systems is very small, which is an important factor for real deployment.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권9호
• /
• pp.2136-2152
• /
• 2012

The growth of Internet technologies and the widespread use of mobile devices have been paving the way for the increasing use of conferencing services. Two types of systems have been designed to provide conferencing services: 1) a conferencing system using session control over a peer-to-peer (P2P) network and 2) an IP Multimedia Subsystem (IMS) conferencing system. The IMS conferencing system was developed to adapt to a server-based centralized system, whereas the benefits of the P2P operational model in providing such conference services are widely acknowledged. However, each system provides conferencing services only to its own users. Therefore, in this paper, we propose an interworking model to support multimedia conferencing service between the P2P environment and IMS networks. We also introduce protocol architecture and some service scenarios. To verify this system model and the design architecture, we perform an actual implementation and show experienced test results.

• Journal of Communications and Networks
• /
• 제18권3호
• /
• pp.446-459
• /
• 2016

In this paper, we propose virtual direction multicast (VDM) for video multicast applications on peer-to-peer overlay networks. It locates the end hosts relative to each other based on a virtualized orientation scheme using real-time measurements. It builds multicast tree by connecting the nodes, which are estimated to be in the same virtual direction. By using the concept of directionality, we target to use minimal resources in the underlying network while satisfying users' quality expectations. We compare VDM against host multicast tree protocol.We simulated the protocol in a network simulator and implemented in PlanetLab. Results both from simulation and PlanetLab implementation show that our proposed technique exhibits good performance in terms of defined metrics.

• 융합신호처리학회 학술대회논문집
• /
• 한국신호처리시스템학회 2000년도 추계종합학술대회논문집
• /
• pp.9-12
• /
• 2000

본 논문은 leaky bucket을 이용하여 초고속망의 폭주를 제어하는 Advanced Peer-to-Peer Network(APPN)의 성능을 분석하였다. 제안된 논문에서는 손실 및 오류패킷에 대하여 재전송하는 오류제어 방식을 병행하여 사용하였다. APPN 모델의 성능 분석을 통하여 사용자 차원의 오류제어와 망 차원의 폭주제어 방식간의 상호작용을 연구하여 윈도우 크기와 leaky bucket의 토큰 생성속도가 end-to-end delay에 영향을 미치는 중요한 파라미터들임을 알 수 있었다.

• 정보처리학회논문지A
• /
• 제13A권1호
• /
• pp.1-10
• /
• 2006

비구조적인 피어-투-피어 시스템에서 효율적인 검색을 위하여 임의 경로 검색 방식이 제안되었는데, 이 방식의 낮은 검색 성공률을 보완하기 위하여 여러 가지 복제 기법이 연구되고 있다. 본 논문에서는 복제본의 생성을 최소화하고, 캐시를 효과적으로 사용함으로써 검색의 정확성과 속도를 높이고 비용을 줄이는 효율적인 복제 기법을 제안한다. 이 기법에서는 질의가 많이 도착하는 허브 노드에 캐시를 저장하고 그 이웃 노드 중 하나에 복제본을 저장하는데, 제한적이고 지역적인 정보만을 이용하여 허브를 판별하는 알고리듬을 제시하여 동적인 네트워크 내에서 적응적으로 캐시와 복제본을 생성할 수 있게 하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제3권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.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2007년도 한국컴퓨터종합학술대회논문집 Vol.34 No.1 (D)
• /
• pp.183-188
• /
• 2007

Peer-to-Peer (P2P) overlay networks have drawn much research interest in the past few years because they provide a good substrate for large-scale applications in the Internet. In this paper, we introduce the use of anycast, a new "one-to-one-of-many" communication method in the Internet, to solve the following common problems of P2P overlay networks: load-balancing, topology-awareness, system partitioning, and multi-overlay interconnection. We also give an analysis of the features and limitations of the recently deployed anycast infrastructures in the Internet for supporting P2P overlay networks.

• 정보처리학회논문지A
• /
• 제11A권7호
• /
• pp.511-520
• /
• 2004

P2P(peer-to-peer) 모델은 클라이언트-서버 모델의 서버 링크 병목현상을 해결하기 위한 대안으로 고려되고 있다. 본 연구에서, 우리는 P2P 네트웍에서 연속형 미디어의 배포 문제 중 두 가지를 다루었다. 첫째는 다중-소스 스트리밍 세션을 위한 미디어 데이터의 전송 스케쥴링 문제이다. 버퍼링 지연을 최소화시키는 정교한 분산 전송 스케쥴링으로서FSS(fixed-length slotted scheduling)라는 기법을 제안한다. 두 번째 문제는 스스로 성장하는 P2P 시스템에서 미디어 컨텐츠의 배포 속도 향상 문제이다. 이를 위해 우리는 시스템의 스트리밍 용량이 증가하는 속도를 가속시키는 FAST라 불리는 기술을 제안한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권11호
• /
• pp.2143-2159
• /
• 2011

The hybrid architecture of content delivery networks (CDN) and peer-to-peer overlay networks (P2P) is a promising technology enables effective real-time streaming services. It complements the advantages of quality control and reliability in a CDN, and the scalability of a P2P system. With real-time streaming services, however, high connection setup and media delivery latency are becoming the critical issues in deploying the CDN-P2P system. These issues result from biased peer selection without location awareness or content awareness, and can lead to significant service disruption. To reduce service disruption latency, we propose a group-based CDN-P2P hybrid architecture (iCDN-P2P) with a location/content-aware selection of peers. Specifically, a SuperPeer network makes a location-aware peer selection by employing a content addressable network (CAN) to distribute channel information. It also manages peers with content awareness, forming a group of peers with the same channel as the sub-overlay. Through a performance evaluation, we show that the proposed architecture outperforms the original CDN-P2P hybrid architecture in terms of connection setup delay and media delivery time.

• 한국통신학회논문지
• /
• 제34권7B호
• /
• pp.728-733
• /
• 2009

유비쿼터스 환경은 피어간의 연결, 이동이 전제되는 환경 등의 특정을 가지고 있다. 이러한 특정은 peer-to-peer(P2P) 시스템과 이동 애드혹 네트워크 (MANET)로 표현될 수 있다. P2P 시스템과 MANET은 비슷한 특징이 많이 있어 MANET 환경에서 P2P 시스템 구현은 매력적이다. 그러나 유선망에서 디자인된 P2P 시스템을 그대로 MANET에 적용하는 경우 성능이 만족스럽지 못하다는 것이 연구결과로 입증되었다. 이에 본 논문에서는 cross-layer 디자인을 사용하고 피어의 양호성을 고려하여 MANET 환경에서 만족스러운 성능을 낼 수 있는 P2P 시스템을 제안한다. 제안된 시스템은 라우팅 에트릭과 P2P 에트릭을 시용하여 연결을 유지할 피어를 선택하고, 피어 정보를 능동적으후 전달한다. 모의실험 결과, 제안한 방안은 라우팅 경로를 줄임으로써 쿼리 성공률, 쿼리 응답시간, 에너지 소모량에서 좋은 성능을 보여주었다.