• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.950-953
• /
• 2008

MANET(Mobile Ad-hoc Network) 환경에서 P2P(peer to peer) 시스템은 중앙 집중식 서버 구조나 고정된 인프라를 활용할 수 없다는 제약 때문에 효율적인 파일 공유 및 검색을 지원하기 어렵다. 본 논문에서는 위치기반 라우팅의 위치 서비스 메커니즘을 사용하는 MANET P2P 파일 검색 프로토콜을 제안한다. 제안하는 시스템에서 참여 노드들은 응용 계층의 파일 색인 테이블과 네트워크 계층의 라우팅 테이블을 통합한 크로스 레이어 테이블을 유지한다. 참여 노드들은 이를 이용해 플러딩(flooding)을 배제한 파일 검색을 수행할 수 있으며 질의에 검색된 파일은 파일 요청 노드의 지리적인 위치를 고려해 선택되기 때문에 최적화된 라우팅 경로를 형성할 수 있다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.11a
• /
• pp.982-985
• /
• 2007

인터넷의 보급과 PC의 발달로 정보의 분산과 공유가 가속화를 이루었고, 컴퓨팅 구조가 인터넷 기반으로 변화하였다. 이후 지금까지 수많은 시스템들이 클라이언트/서버 모델을 유지하고 있는 한편 대단위 분산 다중서버로 구성되는 환경이 출현하였다. 클라이언트/서버 모델에서 사용자들의 정보 공유의 제약을 해소하기 위해 개인의 피어 사이에 서로 공유하는 P2P(Peer-to-Peer) 패러다임이 출현 되었다. 하지만 기존의 DHT(Distributed Hash Table)를 기반으로 하는 P2P 시스템에선 정보를 검색할 때, 검색어와 검색결과의 모호성이 존재하고, 범위 검색을 지원하지 못하는 문제가 있었다. 우리는 이 문제를 해결할 한 가지 방안을 본 논문에서 제안한다.

• Journal of Computing Science and Engineering
• /
• v.2 no.3
• /
• pp.249-273
• /
• 2008

Epidemic protocols have two fundamental assumptions. One is the availability of a mechanism that provides each node with a set of log(N) (fanout) nodes to gossip with at each cycle. The other is that the network size N is known to all member nodes. While it may be trivial to support these assumptions in small systems, it is a challenge to realize them in large open dynamic systems, such as peer-to-peer (P2P) systems. Technically, since the most fundamental parameter of epidemic protocols is log(N), without knowing the system size, the protocols will be limited. Further, since the network churn, frequently observed in P2P systems, causes rapid membership changes, providing a different set of log(N) at each cycle is a difficult problem. In order to support the assumptions, the fanout nodes should be selected randomly and uniformly from the entire membership. This paper investigates one possible solution which addresses both problems; providing at each cycle a different set of log(N) nodes selected randomly and uniformly from the entire network under churn, and estimating the dynamic network size in the number of nodes. This solution improves the previously developed distributed algorithm called Shuffle to deal with churn, and utilizes the Shuffle infrastructure to estimate the dynamic network size. The effectiveness of the proposed solution is evaluated by simulation. According to the simulation results, the proposed algorithms successfully handle network churn in providing random log(N0 fanout nodes, and practically and accurately estimate the network size. Overall, this work provides insights in designing epidemic protocols for large scale open dynamic systems, where the protocols behave autonomically.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.11a
• /
• pp.211-214
• /
• 2003

Recently mobile SFA(Sales Force Automation) system makes rapidly progress specially in industries like insurance, manufacture, and distribution. However, there are some problems that information about products and trades is not promptly shared among sales agents or customers, since the current mobile SFA system has simply extended the existing systems for sales management. In order to improve these weaknesses, we introduce LBS(Location Based Service) and mobile P2P(Peer to Peer) service into the existing systems, then design and implement the enhanced system (or mobile SFA using them. Through this improvement, our system makes it possible for customers or sales agents to quickly share various information and increases the efficiency of sales activity by facilitating the competition and cooperation among sales agents and reducing time-cost.

• The KIPS Transactions:PartA
• /
• v.13A no.2 s.99
• /
• pp.147-156
• /
• 2006

Recently, streaming service accounts for large part of internet traffic and it is becoming the most popular service. Because of P2P's scalability, P2P-based streaming system is proposed. There are frequent leave and join of a node. To overcome the group dynamics, Multiple Multicast Trees Methods were suggested. However, since they did not consider discrepancy in peers' capacity, it may cause the trees to be long and unstable. So we suggest Resilient Capacity-Aware Multicast Tree construction scheme (R-CAT) that promotes superior peer to upper position in the tree and construct more stable and short multicast trees. By simulation we can show that R-CAT cost more overhead packets for tree joining process, but it reduce the end-to-end delay of the resulting tree and the number of packets lost during the node joining and leaving processes much more than SplitStream.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.116-119
• /
• 2009

In this paper, a P2P streaming system for community TV service which requires realtime interactions was designed and implemented. The proposed system constructs a short delay tree-based P2P network in order to effectively support various community TV services within end-to-end delay bounds. Because a community service based on conversation requires a short delay. The P2P network of this paper was constructed by using an algorithm which utilizes locality and delay information. The implemented P2P streaming system is composed of a Web server and a application, each of which was implemented using Asp.Net and C#.Net respectively.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.65 no.6
• /
• pp.1052-1059
• /
• 2016

Video-on-Demand(VoD) is one of the most popular media streaming which attracted many researchers' attention. VMesh is one of the most cited works in the field of the VoD system. VMesh is proposed to solve the problem of random seeking functionality. However, a large number of the DHT(Distributed Hash Table) searches in VMesh is sill the main problem which needs to be solved. In order to reduce the number of the DHT searches, the clustered segment index(CSI) scheme is proposed. In this scheme, the video segments are divided into clusters. The segment information of the video segments, which are clustered into the same cluster, are stored in the same clustered segment index that can be searched by using the hash key. Each peer also can request the required segments by using this clustered segment index. The experiment results show that the number of the DHT searches in the proposed scheme is less than that of VMesh even in case of peers leave and join the network or peers perform the fast forward/backward operations.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06d
• /
• pp.289-291
• /
• 2006

최근 인터넷 접속 환경의 발달과 시스템 및 네트워크 성능 향상의 영향으로 단순한 정보의 전달뿐만 아니라 오디오, 비디오와 같은 미디어 콘텐츠(contents)의 정보 전달을 효율적으로 제공하는 방안이 연구되고 있다. 미디어 콘텐츠를 스트리밍 하는 것은 인터넷 트래픽의 아주 큰 부분을 차지하기 때문에 이러한 콘텐츠를 효율적으로 분산하기 위하여 우리는 P2P(Peer-to-Peer) 오버레이 네트워크를 이용한다. 본 논문은 Tapestry[1]를 미디어 콘텐츠 스트리밍 환경에 맞게 변형하며, 노드와 네트워크의 부하를 균등하게 분산시키기 위해 MDC(multiple description coding)[2]를 이용하여 하나의 콘텐트를 다중 트리에 분산한다. 제안된 메커니즘으로 사용자에게 보다 강화된 서비스를 제공한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.517-519
• /
• 2004

Chord(6)는 N개의 노드로 이루어진 P2P(Peer-to-Peer)네트워크에서 검색에 사용되는 메시지를 O(logN)으로 줄인 P2P 검색 알고리즘이다. 하지만 모바일 Ad-hoc 네트워크에 이를 적용할 경우 검색 성공률이 매우 떨어져 (1000개의 노드가 도보속도(2m/s)로 움직이는 경우： 검색 성공률 30%이하)P2P 검색이 거의 이루어지지 않는 문제점이 발생한다. 본 논문에서는 이 같은 문제점을 극복하기 위한 알고리즘인 Backtracking Chord을 제안한다. Backtracking Chord 방식은 O(logN)메시지를 사용하여 순차적으로 t번까지 검색을 요청함으로써(t： Timeout의 횟수(0 < t< logN)) t에 따라 최고 88%(t>4)까지 검색 성공률을 높일 수 있다.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2006.05a
• /
• pp.345-346
• /
• 2006

In the future, a machine will be more improved in the form of advanced concept with collaborative ability in M2M(Machine to Machine, Mobile to Machine) environment for u-Manufacturing system. This paper tried to standardize M2M and design advanced concept machine. The M2M is front-end system for implementing autonomous ubiquitous environment. The advanced machine in M2M will be a collaborative machine with knowledge-evolutionary ability such as u-Machine(Ubiquitous machine), Vortal(Vertical Portal) machine and P2P(Peer to Peer) machine. Such advanced concept machines will be the key subject for M2M cooperation.