• Journal of Communications and Networks
• /
• v.10 no.4
• /
• pp.430-436
• /
• 2008

Recent studies have convinced that network coding can improve the performance of live media streaming in terms of startup delay, resilience to peer dynamics, as well as reduced bandwidth cost on dedicated streaming servers. However, there still exist some strategy drawbacks and neglected problems which need to be further researched. In addition to the commonly used evaluation parameters of the network and user experiences mentioned above, we focus on additional key factors, playback lag and switch lag, which have not been fully explored in previous work. In this paper, we present SonicStream, a novel and fully implemented live peer to peer (P2P) media streaming system with consideration of rich user experiences, including startup delay, playback continuity, playback lag, switch lag, etc. In pursuit of a further enhanced user experience, we revise traditional peer selection/data scheduling methods. Through a series of experimental evaluations and a cautious comparison with the latest similar work $R^2$, the superior performance of SonicStream has been preliminarily verified.

• The KIPS Transactions:PartA
• /
• v.13A no.2 s.99
• /
• pp.111-122
• /
• 2006

As VOD service over the Internet becomes popular, a large sealable VOD system in P2P streaming environment has become increasing important. In this paper, we propose a new proxy caching scheme, called P2Proxy, to replace the traditional proxy with a sealable P2P proxy in P2P streaming environment. In the proposed scheme, each client in a group stores a different part of the stream from a server into its local buffer and then uses a group of clients as a proxy. Each client receives the request stream from other clients as long as the parts of the stream are available in the client group. The only missing parts of the stream which are not in the client group are directly received from the server. We represent the caching process between clients in a group and a server and then describe a group creation process. This paper proposes the directory structure to share the caching information among clients. By using the directory information, we minimize message exchange overload for a stream caching and playing. We also propose a recovery method for failures about the irregular behavior of P2P clients. In this paper, we evaluate the performance of our proposed scheme and compare the performance with the existing P2P streaming systems.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.12
• /
• pp.81-88
• /
• 2012

As the performance of the next-generation broadband wireless networks is dramatically enhanced, various services (i.e., education, Live video streaming, Live video conferencing, online games, etc.) have been provided to users through a smart mobile platform. Those services are usually provided by using the centralized communication server. However, since all multimedia traffic is exchanged through a communication server, it often has the scalability problem with regard to traffic management. Our main purpose is for group smart users to provide scalable live multimedia streaming service based on P2P network. To do this, we have designed an architecture of P2P-based service management for mobile group communication management and service management protocol. In order to verify the performance of the proposed scheme, we have mathematically analyzed the performance in terms of the average transmission delay and bandwid th utilization.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.7
• /
• pp.1621-1630
• /
• 2009

There is a lot of recent research to provide services of dynamic distributed contents in P2P-based distributed environment. Distributed services of contents objects, however, have problems in QoS and dynamic management of segments. This paper proposed a new segment management method for the service of P2P-based distributed contents. The proposed method manages groups by the SGM(Segment Group Manager). The SGM manages streaming efficiently by the grouping of segments to be served in P2P environment. The segments in the same group cooperate for improved QoS using the management structure based on the distance and relationship. The distance-based management structure is for the improvement of retrieval efficiency while the relationship-based management structure is for the improvement of service ratio. The simulation results of the proposed method showed improvements in average transmission efficiency and average service rate. The improvement is 8% - 30% in average transmission efficiency and 10% - 30% in average service rate.

• KIPS Transactions on Computer and Communication Systems
• /
• v.3 no.2
• /
• pp.57-62
• /
• 2014

In order to provide real-time multimedia streaming service, a lot of system resources and network bandwidth required. Thus each computer is any computer other equivalent has the ability to act as a client and a server Peer-to-Peer(P2P) architecture with much interest. In this paper, techniques of P2P content that requires a user to efficiently retrieve the desired time in the streaming service have placed the focus of the research techniques. In a number present in the P2P contents, the user requests to find out the desired amount of time the content streaming services in order to provide seamless lookup latency contents search algorithm to minimize the study. P2P based smart network system and the structure of the super-node and the peer node is composed of super-gateway. Smart network system architecture proposed by performing a content search algorithm. The user requests a desired content, the service can be retrieved within the provided the flexibility.

• Journal of Digital Contents Society
• /
• v.13 no.4
• /
• pp.567-574
• /
• 2012

In this paper, we propose a buffering scheme to improve the performance by adaptively adjusting the length of the buffering period according to the degree of data duplication among peers that belong to each specific playback period in P2P live streaming systems. To do so, we first assign all the peers into many groups depending on their playback time positions. We then determine the length of their buffering periods according to the number of peers belonging to each group. That is, we increase the length of the buffering periods when much buffered data are duplicated among peers within a group while we decrease it when few buffered data are duplicated. By simulation experiments, we show that our proposed buffering scheme can improve the performance significantly compared to the fixed length buffering scheme that have been employed in the existing mesh-based P2P systems.

• Journal of Communications and Networks
• /
• v.13 no.3
• /
• pp.277-285
• /
• 2011

Real-time multimedia streaming over the Internet is rapidly increasing with the popularity of user-created contents, Web 2.0 trends, and P2P (peer-to-peer) delivery support. While many homes today are broadband-enabled, the quality of experience (QoE) of a user is still limited due to frequent interruption of media playout. The vulnerability of TCP (transmission control protocol), the popular transport-layer protocol for streaming in practice, to the packet losses, retransmissions, and timeouts makes it hard to deliver a timely and persistent flow of packets for online multimedia contents. This paper presents TCP-real-time online multimedia environment (ROME), a novel transport-layer framework that allows the establishment and coordination of multiple many-to-one TCP connections. Between one client with multiple home addresses and multiple co-located or distributed servers, TCP-ROME increases the total throughput by aggregating the resources of multiple TCP connections. It also overcomes the bandwidth fluctuations of network bottlenecks by dynamically coordinating the streams of contents from multiple servers and by adapting the streaming rate of all connections to match the bandwidth requirement of the target video.

• Journal of KIISE:Information Networking
• /
• v.35 no.4
• /
• pp.268-281
• /
• 2008

It is difficult to construct streaming services based on the overlay networks without any loss of scalability. DONet is one of the most representative streaming overlay network protocols without managing any specific structure. Since DONet does not support the nodes on private networks, it can be considered that the performance of the overlay is not the best. Hole Punching is one of the famous techniques participating the nodes on private networks to streaming overlay networks by using a rendezvous server. However, using only a single rendezvous server cannot be suggested in P2P environment, because it can cause problems in terms of scalability and so on. In this paper, we propose DONet-p, an extension of DONet with Distributed Hole Punching techniques. It supports the nodes on private networks without toss of scalability. The experimental results show the better performance and scalability than DONet with a minimum overhead for additional control messages.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.05a
• /
• pp.765-768
• /
• 2007

P2P Video-on-Demand (VoD) is becoming a popular service in the Internet. The first deployments are already in place, and millions of customers worldwide are already using this new medium. But its success is still quite limited and technically, these researches have been deployed in a rush, mostly based on practicality and instability. This paper studies the advantages and potential problems of VoD in peer-to-peer (P2P) network, we propose a system which uses a distributed VoD streaming scheme over P2P network to support media streaming.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.489-492
• /
• 2007

본 논문에서는 P2P 네트워크 상에 분산되어 있는 파일들을 수집하고 피어의 신뢰도가 낮은 접속에도 끊김 없는 스트리밍 서비스를 제공하기위해 Sequential Download System(SDS)을 제안하였다. SDS는 Download Manager를 이용하여 여러 피어로부터 파일을 수신하고, 파일 수신 시에 피어의 갑작스런 이탈에 대처하며 스트리밍 시 발생하는 버퍼링 시간을 최소화하여 안정된 스트리밍을 제공하게 된다. 또한 Memory map을 이용하여 다른 피어의 요청에도 대처할 수 있다.