• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10c
• /
• pp.463-465
• /
• 2002

본 논문에서는 다자계산 이론과 Peer-to-Peer 네트워크 기술을 이용하여 안전하고 효율적인 경매 모델을 제안하고자 한다 기존에 제안된 경매 모델의 경우 안전한 계산을 할 수 있었으나 메시지 전송에 있어 효율적인 작업을 할 수 없었다. 또한 경매의 규모가 커져감에 따라 부가적으로 들어가는 비용도 증가해야만 했다. 그러나 제안된 모델에서는 Peer-to-Peer 네트워크 기술을 이용함으로써 서버에 집중되는 네트워크 부하를 줄이고 또한 제안된 모델을 사용하는 다른 경매 그룹과 쉽게 연동 할 수 있어 경매 규모를 쉽게 확장을 할 수 있게 하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.5
• /
• pp.709-735
• /
• 2010

The reciprocal virtue of peer-to-peer networking has stimulated an explosion of peer population and service capacity, ensuring rapid content distribution in peer-to-peer networks. Critical issues such as peer churn, free riding, and skewed workload significantly affect performance results such as service agility, fairness, and resource utilization. To resolve these problems systematically, this study proposes a peer assignment scheme that supports fair peer-to-peer file sharing applications. The proposed scheme exploits the peer duality of both server-oriented peer capacity and client-oriented peer contribution. Accordingly, the system server can prioritize download requests and appropriately assign server peers to uploading file objects. Several functional extensions, including peer substitution and elimination, bandwidth adjustment, and distributed modification, help cope with subtle situations of service starvation and download blocking, and hence make the system design robust and amenable. Simulation results show this design is examined under both centralized and distributed peer-to-peer environments. Performance results confirm that the proposed mechanisms are simple but effective in maintaining service agility and fairness, without loss of overall service capacity in peer-to-peer files sharing systems.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04d
• /
• pp.118-120
• /
• 2003

유무선 인터넷 기술의 발달로 인해, 네트워크 전반에 걸쳐 산재해 있는 개인 정보에 대한 공유 및 교환에 대한 요구가 점차로 증가하고 있다. 본 논문에서는 이동에이전트 기반의 peer-to-peer(P2P) 네트워킹을 위한 새로운 기법이 설계되고 구현된다. 설계된 시스템은 이동에이전트를 사용함으로써, 냅스터 및 그 누텔라로 대표되는 기존의 혼합형 P2P와 순수형 P2P에서 발생하는 문제점들을 보완시킨 새로운 기법이며, 혼합형과 순수형 모두에 적용이 가능하다. 또한 분산 정보 공유 및 교환을 위한 응용 개발의 용이함을 위해 다양한 고급의 AH들을 제공하고 있다.

• The KIPS Transactions:PartC
• /
• v.11C no.7 s.96
• /
• pp.1033-1042
• /
• 2004

According to the arbitration mechanism among the peers in the network, the P2P networking environments can be classified into hybrid P2P networking environments and pure P2P networking environments. In hybrid P2P networking environments, each peer gets continual services from the servers that arc operational most of the time, and so, network isolation does not occur because every peer can always keep connection to the server. In pure P2P networking environments, however, every peer directly connects to another peer without server intervention, and so, network isolation can occur when the per mediating the connection is terminated. In this paper, we propose a scheme for each peer to keep connection information of other peers by maintaining IDs of its neighbor peers, to reconnect to another peers when the mediating peer fails to work. and, for efficiency. to balance the number of connections that should be maintained by each peer. With our mechanism, each pier in the network can continuously maintain connection to the network and get seamless services from other peers. Through the simulation, we ascer-tained that network isolation does not occur in the pure P2P network adopting our mechanism and that our mechanism distributes and balances the connections that are maintained by each peer. We also analyzed the total network traffic and the mean number of hops for the connections made by each peer according to the recommended number of connections that is established at system setup time.

• Journal of KIISE:Information Networking
• /
• v.32 no.6
• /
• pp.705-715
• /
• 2005

A peer-to-peer web caching has been studied recently as it can reduce the traffic converged on the server side and can support the traditional web caching model. Although the peer-to-peer web caching has the merit of having additional cache space from the local caches of peers without additional infrastructure, several constraints such as dynamic participation and local caching strategy caused by the autonomy of peers in peer-to-peer networks nay limit the performance of the peer-to-peer web caching. To overcome these limitations, we propose an efficient directory-based peer-to-peer web caching system under dynamic participation of peers. In the proposed caching system, we present new peer selection and replica management schemes by introducing the concept of the object lifetime in P2P networks. We evaluate the effectiveness of the proposed system through trace-driven simulations with a web log dataset. Simulation results show that the proposed system has higher accuracy and fewer redirection failures than the conventional directory-based P2P web caching system in feasible peer-to-peer networks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.1
• /
• pp.133-151
• /
• 2019

In order to achieve faster content distribution speed and stronger fault tolerance, a P2P peer can connect to multiple peers in parallel and receive chunks of the data simultaneously. A critical issue in this environment is selecting a set of nodes participating in swarming sessions. Previous related researches only focus on performance metrics, such as downloading time or the round-trip time, but in this paper, we consider a new performance metric which is closely related to the network and propose a peer selection algorithm that produces the set of peers generating optimal worst link stress. We prove that the optimal algorithm is practicable and has the advantages with the experiments on PlanetLab. The algorithm optimizes the congestion level of the bottleneck link. It means the algorithm can maximize the affordable throughput. Second, the network load is well balanced. A balanced network improves the utilization of resources and leads to the fast content distribution. We also notice that if every client follows our algorithm in selecting peers, the probability is high that all sessions could benefit. We expect that the algorithm in this paper can be used complementary to existing methods to derive new and valuable insights in peer-to-peer networking.

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

• International Commerce and Information Review
• /
• v.6 no.3
• /
• pp.63-79
• /
• 2004

Peer-to-peer(P2P) has potential strength and possible factors which enable it to develop toward a new business by supplementing the limitation of the existing central server-type network. In various business sectors, various attempts have already been made to apply P2P. The computing power which was possible to be formed through peer-to-peer networking will become a powerful tools for expanding toward new business area depending the utilization methods by sector. Although the technology-centric P2P concept is a major interest now, its development direction will head toward service-centric P2P concept for satisfying desires of end-users(individual peers) for reliable contents and improving their purchasing convenience. But the solution requisites should be solved for the efficient application of P2P to business such as the establishment of and supplement for the industrial standard and legal system for P2P, the enhancement of peers recognition of P2P. Presently e-commerce using P2P is being implemented by a few enterprises locally by means of B2C. But if many enterprises enter this type of e-commerce, and the standardization of peer programmes, goods and documents is made, it will be able to be extended to B2B. Also it seems that it can be utilized in international transactions as well as in domestic transactions. So there is much room for the application of P2P to be extended further. Also there has been presented the necessity for related industries to support their work with theories and for academic studies to be made actively to set the direction of its development. It is hoped that multi-angled and in-depth studies on the utilization of P2P and various attempts to application of it to business be made on the basis of this study. For the development of P2P, continuous study and attempts are needed. The field of P2Ps application is very large and it will become a powerful tool, depending upon its application methods.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.05a
• /
• pp.568-570
• /
• 2013

NFC represents the 2nd generation of the proximity contact-less technology, which beyond the RFID, supports peer-to-peer communication, and enables consumer access to aggregated services, anytime, anywhere, with any type of consumer stationary and mobile devices. NFC is a short range device wireless technology designed to exchange data, initiate connections with other wireless networks and act as a secured smart key for access to services such as cashless payment, ticketing, on-line entertainment and access control. In this paper, the NFC services for social networking applications are studied, and the signal flow of SNS application based on NFC P2P for smart devices and server model is proposed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.1B
• /
• pp.73-85
• /
• 2004

SIn this paper, we introduce our experience for designing and implementing new concept of a global XML-based Peer-to-Peer (P2P) engine to support various P2P applications, and interconnection among PC, Web and mobile computing environments. The proposed P2P engine can support to heterogeneous data exchanges and web interconnection by facilitating with the text-base XML while message exchange are necessary. It is also to provide multi-level security functions as well as to apply different types of security algorithms. The system consist of four modules; a message dispatcher to scheduling and filtering the message, a SecureNet to providing security services and data transmission, a Discovery Manager to constructing peer-to-peer networking, and a Repository Manager to processing data management including XML documents. As a feasibility test, we implement various P2P services such as chatting as a communication service, white-board as an authoring tool set during collaborative working, and a file system as a file sharing service. We also compared the proposed system to a Gnutella in order to measure performance of the systems.