• The Journal of the Korea institute of electronic communication sciences
• /
• v.6 no.6
• /
• pp.915-920
• /
• 2011

P2P technology is the concept to share resources efficiently in distributed environments that a lot of research is underway. a lot. In these P2P systems, the server to support the contents-information have less overloads than the composed system as the server to have resources generally. In this paper, we suggest a P2P system to support conveniences to choice time for users that were connected with the information of joint-buying based on social network. Social networks based on co-purchasing information and price alerts using the P2P system is provided by the peer, this relay information is provided by the P2P server.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.2
• /
• pp.121-129
• /
• 2011

With advances in wireless networks and advent of powerful mobile devices such as smart phones, the demand for mobile IPTV services has been increasing. It is essential to minimize the energy consumption of mobile devices because their battery capacity is limited. In this paper, we therefore propose a new streaming structure in P2P-based mobile IPTV systems to minimize the energy consumption of mobile peers using agent peers. Agent peers can decrease the energy consumption of mobile peers significantly by performing streaming functionality and exchanging control messages for joining and leaving overlay networks in place of corresponding mobile peers. Finally, by simulation experiments using an energy model, we show that our proposed streaming structure can increase the lifetime of mobile peers using agent peers.

• The KIPS Transactions:PartA
• /
• v.17A no.5
• /
• pp.237-248
• /
• 2010

UPnP(Universal Plug and Play) is a middleware of DLNA (Digital Living Network Alliance) services a home network. UPnP supports the connections between each other devices in networks and also provides service discovery and advertisement with SSDP(Simple Service Discovery Protocol), which is generally designed for wired networks. SSDP operates on multicasting discovery request and advertisement and unicasting a reply in networks. It is a challenge issue for service discovery protocol such as SSDP to provide a stable and effective service in wireless ad-hoc networks. Wired based service discovery protocol does not consider the dynamics of wireless ad-hoc network. In that case, the nodes are freely in or out. Therefore, this paper proposes a flexible SSDP(fSSDP) which is a peer-to-peer(P2P) discovery protocol adopted for wireless ad-hoc Networks. It is implemented on the extension of SSDP. fSSDP supports a functionality that the broadcast area of service discovery dynamically changes with the periodically updated area of advertisement. It is good for reducing messaging overhead caused from the broadcast flooding of service discovery in wireless ad-hoc network.

• Journal of Korea Society of Industrial Information Systems
• /
• v.11 no.1
• /
• pp.21-28
• /
• 2006

This paper describes the design and implementation of video conference system using hybrid type P2P(Peer to Peer). The proposed video conference system has hybrid type P2P architecture based on a client-server and P2P(Peer to Peer), where client-server is used for exchange of account management, client list and status information and P2P is used for the real time video conference. The proposed video conference system decreases the traffic of server, and cuts down the load of a network. Because the multimedia data is decentralized to client by P2P. Also, this system is tested by the multi-party video conference system using communication protocol and application software through high speed networks.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.3
• /
• pp.123-130
• /
• 2008

To avoid some protection systems such as firewall, P2P applications have recently used to apply dynamic port numbers. Reliable estimates of P2P traffic require examination of packet payload, a methodological land mine from legal, privacy technical, logistic, and fiscal perspectives. Indeed, access to user payload is often rendered impossible by one of these factors, inhibiting trustworthy estimation of P2P growth and dynamics. Despite various methods such as port-based and signature-based techniques, it still dose not satisfy the method which uses both qualitative and quantitative aspects. In this paper, a method using SVM mechanism which discriminate the P2P traffic from non-P2P traffics using differences between P2P and other application traffics is suggested. This is a systematic methodology to identify P2P networks, and without relying on packet payload.

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

최근 MANET(Mobile Ad-hoc Networks)에서의 P2P 응용을 이용한 서비스 개발이 활발히 진행 중이다. 이와 함께 에드혹 환경에서의 적합한 P2P 모델에 관한 연구로 기존 P2P 모델인 Gnutella, DHT등을 에드혹에 적용한 연구 역시 활발히 이루어지고 있다. 본 논문에서는 on-demand 방식의 에드혹 라우팅 프로토콜인 AODV(Ad-hoc On-Demand Distance Vector)상에서, 대표적인 P2P 응용인 Gnutella의 동작 과정을 통해 P2P 응용이 갖는 문제점을 분석하고, P2P 응용의 검색과정에서 발생하는 오버헤드를 줄이기 위한 방안을 제안한다. 그리고 위의 연구 결과를 바탕으로 현재 IPv6 AODV상에서 MANET을 위한 응용인 DiPP(Fully Distributed Peer-to-Peer)시스템을 구현한다. DiPP 시스템은 MANET상에서의 메신저와 파일공유를 위한 기능을 위해 동작한다.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2005.05a
• /
• pp.139-143
• /
• 2005

The P2P is a network environment supporting data exchange which is directly connected peers without limit of existing server-client and intervening central server for resource or offered service with each peer. JXTA is a representative of P2P system. JXTA is a typical distributed computing model that proposed by Sun Microsystems. JXTA that doesn't require centralized services or resources is adaptable in extreme changes of network organization. MANET(Mobile Ad Hoc Network) is a representative wireless network that is composed of mobile nodes without infrastructure. So MANET establishes the path for the communication of each peers and maintains the newest routing information by exchanging routing information. In this paper, we propose a technique of JXTAMAUET which implements JXTA which is the P2P network system from the wireless network which is becoming the foundation of ubiquitous computing. For the performance evaluation of the JXTAMANET, we use simulation.

• Journal of Korea Multimedia Society
• /
• v.11 no.12
• /
• pp.1706-1715
• /
• 2008

In a super-peer based P2P network, the network is clustered and each cluster is managed by a special peer, which is called a super-peer. A Super-peer has information of all the peers in its cluster. This type of clustered P2P model is known to have efficient information search and less traffic load than unclustered P2P model. In this paper, we compute the message traffic cost incurred by peers' query, join and update actions within a cluster as well as between the clusters. With these values, we estimate the optimal number of super-peers that minimizes the traffic cost for the various size of super-peer based P2P networks.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.05a
• /
• pp.706-709
• /
• 2008

With the increasing popularity of P2P file sharing and advancement of mobile technologies, mobile P2P has revealed its attraction. Anonymity has become an increasing requirement in mobile networks. To reduce receiving garbage files, file validation and filtering are other requirements in the mobile P2P environment. If there are effective file filtering and validation mechanism, nodes' battery duration will be saved. In this paper, we do an analysis of security and anonymity in P2P file sharing and exchange system in mobile ad hoc environment, and propose a new efficient anonymous protocol, which can provide anonymity by broadcasting with a probabilistic algorithm and hiding real hop count information, the file validation by the file's special hash value and file filtering mechanism through the collaboration of middle nodes.

• Journal of KIISE:Information Networking
• /
• v.29 no.2
• /
• pp.181-187
• /
• 2002

Connection admission control(CAC), which decides whether or not to accept a new call request, is one of the most Important preventive congestion control techniques in asynchronous transfer mode(ATM) networks. To develop a practical CAC scheme, first we propose a "Modified Cell Loss Probability MP${\nu}"$, which is based on "Virtual Cell Loss Probability P${\nu}"$, taking into account mean burst duration of input traffic source and buffer size in ATM networks. MP${\nu}"$ computes more accurate cell loss probability than P${\nu}"$ without increasing computational complexity, since P${\nu}"$ is formulated simply form the maximum and the average cell rate of input traffic. P${\nu}"$ is overestimated as compared to the real cell loss probability when the mean burst duration is relatively small to the buffer capacity. Then, we Propose a CAC scheme, based on "Modified Virtual Bandwidth(MVB)" method, which may individualize the cell loss probabilities in heterogeneous traffic environments. For the proposed approach, we define the interference intensity to identify interferences between heterogeneous traffic sources and use it as well as MP${\nu}"$ to compute MVB. Our approach is well suitable for ATM networks since it provides high bandwidth utilization and guarantees simple and real time CAC computation for heterogeneous traffic environments.heterogeneous traffic environments.