• Journal of the Korea Society of Computer and Information
• /
• v.13 no.7
• /
• pp.109-115
• /
• 2008

In the P2P distributed system, such peers don't always keep on-line status. P2P systems are different from the ordinary systems that such peers are organically operated as the elements of system. In this case, users using P2P system are able to loss the reliability. At this point, many P2P studies are tried to resolve these problems. In this paper, we suggest a P2P search algorithm for multidirectional processing about the resources to be downloading. In existing studies, the loading rate is very high to select new resources supported peer, so we suggest new solution in this study.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10a
• /
• pp.49-51
• /
• 2004

데이터 그리드를 위한 기존의 복제 정책은 계층적 구조를 기반으로 하고 있기 때문에 상위계승에서 하위계층으로만 데이터를 복제할 수 있어 비효율적이다. 따라서 본 논문에서는 기존 데이터 그리드의 계층적 구조에 P2P(Peer-to-Peer)시스템을 적용하여 효율적으로 복제본을 유지할 수 있는 새로운 복제 정책을 제안한다. 이 정책의 특징은 클라이언트 노드의 저장 공간 일정 부분을 임계 구역(critical section)으로 지정하여 데이터 조작을 방지함으로써 클라이언트 노드도 데이터 복제본을 저장할 수 있는 기능을 가지도록 한 것이다. 따라서 계층적 구조에서 상위 계층뿐만 아니라 동일 계층 또는 클라이언트 노드들 간의 데이터 전송이 가능하기 때문에 데이터 그리드의 성능을 향상시킬 수 있다.

• Spatial Information Research
• /
• v.18 no.3
• /
• pp.53-62
• /
• 2010

Recent development in wireless communication technology, like GPS, and mobile equipments, like PDA and cellular phone, make location-based services (LBSs) popular. However, because, users continuously request a query to a server in the LBSs by using their exact locations, privacy information could be in danger. Therefore, a mechanism for users' privacy protection is required for the safe and comfortable use of LBSs by mobile users. For this, we, in this paper, propose a grid-based cloaking area creation scheme supporting continuous LBSs in peer-to-peer environment. The proposed scheme creates a cloaking area by using Chord protocol, so as to support the continuous LBSs in peer-to-peer environment. Finally, we show from a performance analysis that our cloaking scheme outperforms the existing cloaking schemes, in terms of service time.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.2
• /
• pp.47-60
• /
• 2017

Car sharing, which is considered as a good example of innovation in the transportation sector, is a type of use in which a plurality of people share a single vehicle for a short period of time. It is divided into various types, NFP (Not For Profit) operated by a non-profit organization, B2C (Business to Customer), which is operated by a company, and Peer to Peer (P2P), which is directly connected to an individual. Among them, P2P car sharing is a method of sharing personal vehicles owned by individuals. It has the merit of reducing traffic congestion and providing for efficient traffic demand management by reducing the purchase rate of additional vehicles and minimizing the number of idle ones. This study examines the introduction of P2P car sharing in order to develop a traffic demand management policy and facilitate the transition to a sustainable transportation system. The spatial extent of the study consisted of apartment complexes in Seoul. In apartment complexes, it is possible to minimize the level of expenditure, such as operating expenses, by utilizing the APT management office and there is no difficulty in securing the necessary parking space. Therefore, apartment complexes were selected as the spatial range.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.10
• /
• pp.5013-5034
• /
• 2019

In the Peer-to-Peer (P2P) streaming systems, peers randomly form a network overlay to share video resources with a data scheduling scheme. A data scheduling scheme can have a great impact on system performance, which should achieve two optimal objectives at the same time ideally. The two optimization objectives are to improve the perceived video quality and maximize the network throughput, respectively. Maximizing network throughput means improving the utilization of peer's upload bandwidth. However, maximizing network throughput will result in a reduction in the perceived video quality, and vice versa. Therefore, to achieve the above two objects simultaneously, we proposed a new data scheduling scheme based on multi-objective particle swarm optimization data scheduling scheme, called MOPSO-DS scheme. To design the MOPSO-DS scheme, we first formulated the data scheduling optimization problem as a multi-objective optimization problem. Then, a multi-objective particle swarm optimization algorithm is proposed by encoding the neighbors of peers as the position vector of the particles. Through extensive simulations, we demonstrated the MOPSO-DS scheme could improve the system performance effectively.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.7
• /
• pp.293-302
• /
• 2013

Home network providers have many worries about providing home network services with an expandable, reliable, flexible and low-cost structure according to the expanding market environment. The existing client-server system has various problems such as complexity and high costs in providing home network services. In this paper we propose the P2P-SIP structure. P2P communication terminal supporting access of distributed resources provides functions which the existing SIP-based network devices have. Because diverse terminals in a home network access through networks, also, partitioning network domains with home gateways to manage, and applying the network-based PMIPv6(Proxy Mobile IPv6) technology considering mobility of terminals would help to have a more efficient home network structure. Especially, the proposed P2P-SIP structure proves itself as a very efficient structure to have an outstanding expandability among different home networks in a region, and to reduce maintenance costs.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.8
• /
• pp.1571-1579
• /
• 2009

This paper proposes a P2P(Peer-to-Peer) streaming protocol which allows various QoS(Qualify of Service) requirements of video streaming to be supported for various personal IPTV applications in ubiquitous Internet environments. The proposed P2P streaming protocol takes fairly short startup delay, guarantees end-to-end delay bound and bandwidth requirements, and supports reliability level of video streaming for an IPTV application. The QoS-based P2P streaming protocol can properly use not only the advantages of scalability, availability, and ubiquity of P2P streaming but also complement its disadvantages of performance and reliability so that various types of personal IPTV applications can be properly implemented in the existing broadband Internet environments.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.21 no.4
• /
• pp.1-8
• /
• 2021

In this paper, we propose an approach that combines the technological advantages of P2P and cloud computing to support MMOGs that allowing a huge amount of users worldwide to share a real-time virtual environment. The proposed P2P system based on cloud computing can provide a greater level of scalability because their more resources are added to the infrastructure even when the amount of users grows rapidly. This system also relieves a lot of computational power and network traffic, the load on the servers in the cloud by exploiting the capacity of the peers. In this paper, we describe the concept and basic architecture of cloud computing-based P2P Systems for scalability of MMOGs. An efficient and effective provisioning of resources and mapping of load are mandatory to realize this architecture that scales in economical cost and quality of service to large communities of users. Simulation results show that by controlling the amount of cloud and user-provided resource, the proposed P2P system can reduce the bandwidth at the server while utilizing their enough bandwidth when the number of simultaneous users keeps growing.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.7
• /
• pp.1516-1523
• /
• 2004

In the paper, an algorithm fitted to P2P system was proposed by improving Kerberos which is an algorithm for mutual authentication. To keep the role of Kerberos and minimize load to server, the proposed algorithm imposed the server role of ticket recognition to the opposite peer. Using this method, the number of sewers as ticket recognition server was averted and function of server for authentication was minimized so that server load was mininized. The proposed algorithm enables the server to play the minimum of the role and to perform strong mutual authentication, while imposeing on the peers the role of authentication. To make suitable to P2P system, trial number oriented authentication limit was given, not time-oriented authentication expiration time. In the paper, a new P2P system was designed using this algorithm.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.163-165
• /
• 2001

오늘날 인터넷은 중앙 집중식 웹서버로 컨텐츠들을 서비스하는 방식을 주로 택하고 있으며, 이용자들은 저마다의 홈페이지 서버를 갖길 원하고 있다. 그러나 이런 중앙 집중식 서비스방적을 사용했을 경우 비용적인 측면과 유지 보수 관리적인 문제로 인해 사용자들의 욕구를 제대로 해결해주지 못하고 있다. 본 논문에서는 중앙집중형 웹 컨텐츠 서비스가 아닌 순수한 Peer to Peer 방식의 웹 서비스를 할 수 있는 P2P 웹서버의 개발을 소개하고자 한다. 기본 알고리즘은 Gnutella Protocol을 기본으로 하였으며, 여기에 웹서버를 두고 Gnutella Protocol에서 사용되는 Header외에 웹서버의 존재유무를 파악할 수 있도록 별도로 정의된 Header를 사용하여 쉽게 웹서버의 기능유무 및 위치추적을 가능하게 하였으며, 또한 기존의 Gnutella Protocol과도 호환성을 지니고 있다. 위치 추적 및 검색엔진은 Gnutella Protocol과 유사한 방식을 택했으며, 멀티미디어 파일의 검색 및 업/다운로드가 가능하고, 웹문서의 검색후 원하는 문서를 서비스한다. 즉 Peer가 검색엔진과 클라이언트 및 웹서버의 역할을 동시에 수행하는 순수 P2P 웹 서비스를 개발한다.