• 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 Digital Contents Society
• /
• v.14 no.1
• /
• pp.25-33
• /
• 2013

P2P(Peer-to-Peer) architecture can reduce the network bandwidth and resource on the server since peers exchange data chunks with each other, while server-client architecture causes a lot of traffic on the server. Peers receive a data more reliably when the number of participating peer increases. Currently, P2P traffic has accounted for about 65% of the world's Internet traffic and diverse P2P streaming services have launched combining to video streaming technology. However, the requirements and data chunk delivery algorithms for mobile P2P streaming service should be investigated, since the existing P2P technologies have been developed and designed for the wired network. In particular, the bandwidth fluctuation caused by user mobility, wireless packet collisions, and packet losses brings about different problems on the mobile P2P streaming service compared to existing P2P streaming service. In this paper, we analyzed the problem of mobile P2P streaming services in the 802.11n wireless LAN environment through experiments.

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

In traditional unstructured P2P file sharing network, each peer establishes connections with a certain number of randomly chosen other peers. This would lead to redundant traffic and P2P network partition in mobile ad hoc network (MANET). We propose an approach to construct an efficient unstructured P2P overlay over MANET using underlying cluster-based routing (CBRP). One of the peers in the P2P network is used as a root-peer to connect all peers. Each peer maintains connection with physically closer peers such that it can reach the root-peer. The peer constructs a minimum-spanning tree consisting of itself, its directly connected neighbor peers and 2-hop away neighbor peers to remove far away redundant links and to build an overlay closer to the physical network. Due to on-demand nature of inter-cluster routing of CBRP, the positioning algorithm for MANET is used to retrieve the file by a peer from the source peer via shorter path in the physical network. We can show by simulation that our approach performs better in comparison with the existing approach.

• Journal of information and communication convergence engineering
• /
• v.11 no.3
• /
• pp.173-178
• /
• 2013

To discover objects of interest in unstructured peer-to-peer networks, the peers rely on flooding query messages which create incredible network traffic. This article evaluates the performance of an unstructured Gnutella-like protocol over mobile ad-hoc networks and proposes modifications to improve its performance. This paper offers an enhanced mechanism for an unstructured Gnutella-like network with improved peer features to better meet the mobility requirement of ad-hoc networks. The proposed system introduces a novel caching optimization technique and enhanced ultrapeer selection scheme to make communication more efficient between peers and ultrapeers. The paper also describes an enhanced query mechanism for efficient searching by applying multiple walker random walks with a jump and replication technique. According to the simulation results, the proposed system yields better performance than Gnutella, XL-Gnutella, and random walk in terms of the query success rate, query response time, network load, and overhead.

• ETRI Journal
• /
• v.34 no.4
• /
• pp.591-601
• /
• 2012

Unstructured peer-to-peer (p2p) networks usually employ flooding search algorithms to locate resources. However, these algorithms often require a large storage overhead or generate massive network traffic. To address this issue, previous researchers explored the possibility of building efficient p2p networks by clustering peers into communities based on their social relationships, creating social-like p2p networks. This study proposes a social relationship p2p network that uses a measure based on Hebbian theory to create a social relation weight. The contribution of the study is twofold. First, using the social relation weight, the query peer stores and searches for the appropriate response peers in social-like p2p networks. Second, this study designs a novel knowledge index mechanism that dynamically adapts social relationship p2p networks. The results show that the proposed social relationship p2p network improves search performance significantly, compared with existing approaches.

• ETRI Journal
• /
• v.27 no.1
• /
• pp.22-42
• /
• 2005

Traditional traffic identification methods based on wellknown port numbers are not appropriate for the identification of new types of Internet applications. This paper proposes a new method to identify current Internet traffic, which is a preliminary but essential step toward traffic characterization. We categorized most current network-based applications into several classes according to their traffic patterns. Then, using this categorization, we developed a flow grouping method that determines the application name of traffic flows. We have incorporated our method into NG-MON, a traffic analysis system, to analyze Internet traffic between our enterprise network and the Internet, and characterized all the traffic according to their application types.

• Journal of KIISE
• /
• v.42 no.3
• /
• pp.408-412
• /
• 2015

In base station based networks, traffic overload at the base station is inevitable. Peer-to-peer DTN which disperses the traffic overhead to each node can relieve the traffic overload at the base station. To increase the message delivery ratio and reduce the message overhead, we present novel routing using mobility information which can be obtained from each node, unlike the existing flooding based routings. In the proposed routing scheme, the routing decision metric, which is defined based on the node mobility information, is computed by using the expected distance between each node to the destination. The message is copied to other nodes that have lower expected distance to the destination than the value for the node willing to copy the message. We conducted simulations by using both a random mobility model and a real mobility trace to compare the performance of the proposed routing scheme to the existing routing scheme that does not utilize the mobility information. The performance evaluation showed the proposed routing successfully delivers messages with 10% to 30% less copies compared to previously proposed routing schemes.

• Journal of Broadcast Engineering
• /
• v.25 no.1
• /
• pp.94-104
• /
• 2020

Currently media consumption over fixed/mobile Internet is mostly conducted by adaptive media streaming technology such as DASH (Dynamic Adaptive Streaming over HTTP), which is an ISO/IEC MPEG (Moving Picture Experts Group) standard, or some other technologies similar to DASH. All these heavily depend on the HTTP caches that ISPs (Internet Service Providers) are obliged to provide sufficiently to make sure fast enough Web services. As a result, as the number of media streaming users increases, ISPs' burden for HTTP cache has been greatly increased rather than CDN (Content Delivery Network) providers' server burden. Hence ISPs charge traffic cost to CDN providers to compensate for the increased cost of HTTP caches. Recently in order to reduce the traffic cost of CDN providers, P2P (Peer-to-Peer)-assisted DASH system was proposed and a peer selection algorithm that maximally reduces CDN provides' traffic cost was investigated for this system. This algorithm, however, tends to concentrate the burden upon the selected peer. This paper proposes a new peer selection algorithm that distributes the burden among multiple peers while maintaining the proper reduction level of the CDN providers' cost. Through implementation of the new algorithm in a Web-based media streaming system using WebRTC (Web Real-Time Communication) standard APIs, it demonstrates its effectiveness with experimental results.

• KIPS Transactions on Computer and Communication Systems
• /
• v.3 no.3
• /
• pp.81-86
• /
• 2014

According to the development of streaming services with P2P and mobile network technologies, researches to enhance the service quality in mobile environment have been proposed. However, streaming services considering high-speed mobile environment and characteristics of heterogenous terminals have been hindered from being provided with the required quality from user because of bandwidth congestion between selfish peers of existing P2P system. It is also prone to long delay and loss in accordance with the repeated traffic amounts because there are no optimized solution for traffic localization. The structure to enhance peer contribution for service differentiation and peer selection with clustering scheme with location information of terminal can satisfy both users and service providers with service quality and efficiency. In this paper, we propose an incentive mechanism and resource distribution scheme with user contribution and traffic cost information based on user location, which make mobile users increase the satisfaction of service quality in LTE environments.

• The KIPS Transactions:PartC
• /
• v.9C no.5
• /
• pp.615-626
• /
• 2002

Recently, as interest in Home networking is increased, research about multimedia clip service is gone. Because of the limit to bandwidth of home network, the problem of server traffic is increased by transferring many multimedia data through Client-Sewer Way for long. The data share network system applied is designed and implemented to solve this problem. P2P is connected directly between clients and exchanges data without going through a sewer. We implemented platform-independent System using Java and applied P2P skill to reduce server traffic.