• Journal of the Korea Institute of Military Science and Technology
• /
• v.17 no.4
• /
• pp.501-509
• /
• 2014

In NCW(Network Centric Warfare) environment, mobile nodes communicate through wireless link. But wireless link provides limited networking performance due to signal interferences or mobility of nodes. So it is quite challenge to acquire enough networking resources and use the resources efficiently. In this paper, we have proposed a P2P based tactical information sharing system which provides satisfactory visual information playout for mobile nodes(i.e., military personnel, vehicle,..) in NCW environment. Our proposed system consists of two components. One is caching-enabled switch which stores tactical information segments at its internal storage and then transports them to mobile nodes when require. Another is centralized scheduling algorithm which exploits networking resources more efficiently. To validate performance of proposed system, we performed series of experiments in wireless network testbed. Results show improved performance in terms of segment-missing ratio, networking resources usage, sharing time, and number of simultaneous playout mobile nodes with acceptable playout continuity(i.e., over 95%).

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.10
• /
• pp.3627-3641
• /
• 2021

Fintech, which stands for financial technology, is growing fast globally since the economic crisis hit the United States in 2008. Fintech companies are striving to secure a competitive advantage over existing financial services by providing efficient financial services utilizing the latest technologies. Fintech companies can be classified into several areas according to their business solutions. Among the Fintech sector, peer-to-peer (P2P) lending companies are leading the domestic Fintech industry. P2P lending is a method of lending funds directly to individuals or businesses without an official financial institution participating as an intermediary in the transaction. The rapid growth of P2P lending companies has now reached a level that threatens secondary financial markets. However, as the growth rate increases, so does the potential risk factor. In addition to government laws to protect and regulate P2P lending, further measures to reduce the risk of P2P lending accidents have yet to keep up with the pace of market growth. Since most P2P lenders do not implement their own credit rating system, they rely on personal credit scores provided by credit rating agencies such as the NICE credit information service in Korea. However, it is hard for P2P lending companies to figure out the intentional loan default of the borrower since most borrowers' credit scores are not excellent. This study analyzed the voices of telephone conversation between the loan consultant and the borrower in order to verify if it is applicable to determine the personal credit score. Experimental results show that the change in pitch frequency and change in voice pitch frequency can be reliably identified, and this difference can be used to predict the loan defaults or use it to determine the underlying default risk. It has also been shown that parameters extracted from sample voice data can be used as a determinant for classifying the level of personal credit ratings.

• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.6
• /
• pp.662-673
• /
• 2003

This paper proposed a workflow enactment model to provide process management functions for the next generation Internet service environment such as Web Service and Grid Computing. The existing enterprise workflow enactment models could not meet the scalability and reliability requirements for aforementioned environments. To satisfy these requirements, this study addressed on applying P2P model to the workflow enactment model. Mathematical description and proof were employed to show the recovery based on set theory and we also showed performance enhancement through simulations, which demonstrated a comprehensive result giving more than 100 times fast response time than the existing centralized model on the same resources.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10c
• /
• pp.187-189
• /
• 2004

피어-투-피어 시스템에서는 한 홉(hop) 떨어진 두 피어간의 네트워크 상 거리는, 이들 피어들이 서로 다른 대륙간 네트워크에 존재할 수도 있기 때문에 매우 클 수 있다. 그러나 검색 질의 메시지를 전달할 다음 피어를 선택하는 기존의 방법은 네트워크의 근접성을 고려하지 않고, 단순히 목적 피어까지의 홉 수를 최대로 줄이는 피어를 선택한다. 따라서 네트워크의 근접성을 고려하여 동적으로 다음 라우팅 피어를 선택하는 새로운 기법이 필요하다. 본 논문에서는 대표적 DHT 방식 시스템인 Chord를 중심으로, 검색 시간을 향상시키기 위한 적응적 근접 경로 선택 기법을 제시한다. 본 기법에서는 동적인 P2P 환경에 적응하기 위해서 지수적 최근-가중치 평균을 통해 예측된 지연시간을 바탕으로 쿼리를 전달할 다음 피어를 선택한다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.3
• /
• pp.165-171
• /
• 2009

With rapid growth of Mobile Ad-Hoc network(MANET) and P2P service technologies, many attempts for integration of MANET and P2P service and development of such applications are actively introduced recently. The implementation of stable P2P service, however, is very difficult challenge because of the high mobility of mobile users in MANET. In this paper, we propose an efficient mobile P2P service, which shares and manages multimedia data files efficiently in mobile environment, uses distributed caches to store files considering their popularities in order to achieve high performance. The performance of proposed P2P service is evaluated by an analytic model and compared with those of existing DHT based P2P service in peer-to-peer network.

• Journal of KIISE:Information Networking
• /
• v.31 no.6
• /
• pp.643-658
• /
• 2004

Mobile ad hoc networks(MANET) have recently attrarted a lot of attention in the research community as well as in industry. Although the previous research mainly focused on the various problems of MANET in data link and network layers, we consider, in this paper, how to efficiently support applications such as service discovery on top of MANET. Peer-to-Peer(P2P) overlay network can be adopted to service discovery mechanism because P2P and MANET share certain similarities, primarily the fact that both arc instances of self-organizing decentralized systems. Especially, distributed hash table(DHT) systems used for r2r overlay network can be effective in reducing the communication overhead in service discovery. However, since overlay network is independent of physical network topology and existing topology-aware mechanisms are based on the wired network, they are inefficient in MANET. We propose a proximity-based overlay network routing to overcome the inefficiency of routing in overlay network. In the proximity-based overlay network routing, each node collects information of physically close nodes by using one hop broadcast and routes messages to the logically closest node to destination. In a detailed ns-2 simulation study, we show that the proximity-based overlay network routing reduces the number of physical hops comparable to the flooding-based mechanism with low communication overhead. We also find that the proposed scheme works well in the mobile environment.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.103-109
• /
• 2005

Research about P2P system have recently a lot of attention in connection of form that pass early Centralized P2P and is Decentralized P2P. Specially, Structured P2P System of DHT base have a attention to scalability and systematic search and high search efficiency by routing. But, Structured P2P System of DHT base have problem, file can be located only their unique File IDs that although user may wish to search for files using a set descriptive keyword or do not have the exact File ID of the files. This paper propose extended-CAN mechanism that creates File ID of Contents base and use KID and CKD for commonness keyword processing to support keyword search in P2P System of DHT base.

• 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 .

• Electronics and Telecommunications Trends
• /
• v.20 no.1 s.91
• /
• pp.147-156
• /
• 2005

이동 환경에서 뿐만 아니라 향후 단말 중심의 개인화 서비스가 제공되는 유비쿼터스 환경에서는 다양한 단말 및 센서들이 존재할 것이고 이들은 네트워크 상에서 서로 상대의 위치를 인식하여 특정 장치가 가진 기능이나 서비스를 획득하기 위하여 상호 통신하거나 새로이 추가되는 장치를 자동으로 구성할 수있어야 한다. 이와 같이, 위치 기반 서비스 및 peer-to-peer 컴퓨팅을 지원하기 위해 ‘서비스 발견’은 모바일 컴퓨팅을 위한 미들웨어로서의 역할을 수행하게 될 것이다. 본 논문에서는 JINI, UPnP, Salutation, SLP2, Bluetooth SDP 등의 기술에서 제공되는 서비스 발견 프로토콜(메커니즘)을 살펴보고 이들의 특성을 비교하고자 한다.

• The KIPS Transactions:PartA
• /
• v.11A no.5
• /
• pp.325-332
• /
• 2004

For a P2P network, the contents distribution is a very important service because the contents provider is not fixed. And in the P2P media streaming, a request peer replays and saves media data simultaneously, and after streaming it acts as a new source peer providing media files to other peers. Therefore streaming and file saying operations should be simultaneously carried out in order to distribute contents through the P2P network. In this paper, a P2P multi-source media streaming system which can replay the contents data during downloading is proposed and implemented. The system reduces the user response time and the number of simultaneous user increases more than two times. Moreover, transmitting a part of media file makes fast distribution and diffusion of contents possible.