• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.5
• /
• pp.444-460
• /
• 2009

In this paper, we propose an expanded patching technique in order to reduce the server network bandwidth requirements to support true VoD services in VoD Systems. Double Patching, which is a typical multicast technique, ensures that a long patching stream delivers not only essential video data for the current client but also extra video data for future clients. Since the extra data may include useless data, it results in server network bandwidth wastage. In order to prevent a server from transmitting useless data, the proposed patching technique uses a new kind of stream called a linking stream. A linking stream is transmitted to clients that have received short patching streams, and it plays a linking role between a patching stream and a regular stream. The linking stream enables a server to avoid transmitting unnecessary data delivered by a long patching stream in Double Patching, so the server never wastes its network bandwidth. Mathematical analysis shows that the proposed technique requires less server network bandwidth to support true VoD services than Double Patching. Moreover, simulation results show that it has better average service latency and client defection rate compared with Double Patching.

• Journal of Communications and Networks
• /
• v.12 no.1
• /
• pp.52-66
• /
• 2010

Since large objects consume substantial resources, web proxy caching incurs a fundamental trade-off between performance (i.e., hit-ratio and latency) and overhead (i.e., resource usage), in terms of caching and relaying large objects to users. This paper investigates how and to what extent the current dedicated-server based web proxy caching scheme is affected by large file transfers in a high bandwidth campus network environment. We use a series of trace-based performance analyses and profiling of various resource components in our experimental squid proxy cache server. Large file transfers often overwhelm our cache server. This causes a bottleneck in a web network, by saturating the network bandwidth of the cache server. Due to the requests for large objects, response times required for delivery of concurrently requested small objects increase, by a factor as high as a few million, in the worst cases. We argue that this cache bandwidth bottleneck problem is due to the fundamental limitations of the current centralized web proxy caching model that scales poorly when there are a limited amount of dedicated resources. This is a serious threat to the viability of the current web proxy caching model, particularly in a high bandwidth access network, since it leads to sporadic disconnections of the downstream access network from the global web network. We propose a peer-to-peer cooperative web caching scheme to address the cache bandwidth bottleneck problem. We show that it performs the task of caching and delivery of large objects in an efficient and cost-effective manner, without generating significant overheads for participating peers.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.4
• /
• pp.784-799
• /
• 2013

This paper presents an adaptive rate control scheme for streaming-based content sharing service. This scheme delivers multimedia contents from a user device to another device or seamlessly redirects streaming service across heterogeneous user devices. In the proposed scheme, a streaming server adjusts video quality level according to the network and client status. Our scheme is different from other rate control schemes, because the video quality at the server is decided not only based on the available bandwidth, but also based on the device characteristics and bandwidth requirement at the access network. We also propose a bandwidth estimation method to achieve more equitable bandwidth allocations among streaming flows competing for the same narrow link with different Round Trip Times (RTTs). Through the simulation, we prove that our scheme improves the network stability and the quality of streaming service by appropriately adjusting the quality of the video stream. The simulation results also demonstrate the ability of the proposed scheme in ensuring RTT-fairness while remaining throughput efficient.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.4
• /
• pp.29-37
• /
• 2013

Multiplayer games typically organized based on a client-server(CS) or peer-to-peer(PP) architecture. The CS architecture is not scalable with the number of players due to a large bandwidth requirement at the server. The PP architecture, on the other hand, introduces significant overhead for the players, as each player needs to check the consistency between its local state and the state of all other players. We then propose a method that combines the merits of CS and PP. In this method, players exchange updates with lower priority in a peer-to-peer manner but communicate directly with a central server for the other updates. As a result, the proposed method has a lower network bandwidth requirement than the server of a CS architecture and the server bandwidth bottleneck is removed. For another important issue about multiplayer games, this method always maintains state consistency among players correctly. The performance of this method is evaluated through extensive simulation experiments and analysis.

• International Journal of Advanced Culture Technology
• /
• v.2 no.1
• /
• pp.14-19
• /
• 2014

In this paper, we propose a stream based patching technique in order to reduce demands of network output bandwidth required to provide the true video-on-demand (VoD) service in a Multimedia server. The proposed scheme calculates required streams to clients accurately by analyzing temporal relationships between already arrived requests in a multimedia server and still progressing streams, and then transmits streams freshly. Since our stream based patching technique induces new linking stream which is playing a link role between long and short patching streams, it reduces demand of network output bandwidth required to provide the true VoD service in a multimedia server. Accordingly, we know that the proposed scheme improves service latency and defection rate than those of existing patching technique by a simulation study.

• ETRI Journal
• /
• v.35 no.2
• /
• pp.234-244
• /
• 2013

Internet protocol television (IPTV) service depends on the network quality of service (QoS) and bandwidth of the broadband service provider. IEEE 802.16j mobile multihop relay Worldwide Interoperability for Microwave Access networks have the opportunity to offer high bandwidth capacity by introducing relay stations. However, to actually satisfy QoS requirements for offering IPTV services (HDTV, SDTV, Web TV, and mobile TV) for heterogeneous users' requests, providers must use a video server for each IPTV service type, which increases the network load, especially bandwidth consumption and forwarding time. In this paper, we present a solution for forwarding IPTV video streaming to diverse subscribers via an 802.16j broadband wireless access network. In particular, we propose a new multicast tree construction and aggregation mechanism based on the unique property of prime numbers. Performance evaluation results show that the proposed scheme reduces both bandwidth consumption and forwarding time.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2S
• /
• pp.577-593
• /
• 2000

A distributed video-on-demand (VoD) system is one where collection of video data is located at dispersed sites across a computer network. In a single site environment, a local video server retrieves video data from its local storage device. However, in the setting of a distributed VoD system, when a customer requests a movie from the local server, the server may need to interact with other servers located across the network. In this paper, we present three types of presentation plans that a local server must construct in order to satisfy the customer request. Informally speaking, a presentation plan is a temporally synchronized detailed sequence of steps that the local server must perform for presenting the requested movie to the customer. This involves obtaining commitments from other video servers, obtaining commitments from the network service provider, as well as making commitments of local resources, within the limitations of available bandwidth, available buffer, and customer data consumption rates. Furthermore, for evaluating the goodness of a presentation plan, we introduce two measures of optimality for presentation plans: minimizing wait time for a customer, and minimizing access bandwidth is used. We develop algorithms to compute optimal presentation plans for all three types, and carry out extensive experiments to compare their performance. We have also mathematically proved certain results for the presentation plans that had previously been verified experimentally in the literature.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.4
• /
• pp.87-93
• /
• 2015

Recently, an idea has been suggested in which members construct the network by sharing their surplus bandwidth of their own access point. This kind of network is called public-shared network. As an application, SVC video streaming delivery system on public-shared network has been proposed. To send video stream from the stream server to clients, a tree structure is constructed where the root is a stream server, internal nodes are sharable access points, and leafs are clients. The previous researches have focused on constructing the minimal sharable-bandwidth tree which can serve all video streaming requests using the minimal sharable bandwidth. In this paper, we have shown that the problem of constructing a tree structure with given sharable access points to serve maximal video streaming requests is NP-hard. We also have developed an efficient heuristic algorithm for this problem and evaluated experimentally our algorithm.

• The KIPS Transactions:PartC
• /
• v.16C no.4
• /
• pp.487-494
• /
• 2009

VOD(Video On Demand) that provides streaming service according to the user's requirement in real time, consists of the video streaming server and the client system. Since it is very hard to apply the traditional server-client model that a server communicates with many clients through 1:1 connection to VOD system because it requires very high network bandwidth, many researches have been done to address this problem. Batching technique is one of VOD system based on Multicast that requires very small network bandwidth. However, the batching based VOD system has a limitation that it is very hard to provide VCR(Video Cassette Recorder) ability. In this paper, we propose a technique that reduces the required network bandwidth to provide VCR function by using the characteristic of MPEG, one of international video compression standard. In the proposed technique, a new video stream for VCR function is constructed with I pictures that is able to be decoded independently. The new video stream for VCR function is transmitted with the video stream for normal play together in Batching manner. The performance evaluation result shows that the proposed technique not only reduces the required network bandwidth and memory usage but also decreases the CPU usages.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.10 no.3
• /
• pp.171-179
• /
• 2014

Among the P2P based multimedia streaming architecture, multiple chain architecture has advantage in adapting to dynamically changing network topology simply and rapidly, so this architecture is used for UCC broadcasting system. In UCC broadcasting system, general peer involved in DSLAM becomes UCC server rather than broadcasting system that transfers data from ISP servers. Therefore UCC data generated from UCC server peers is transmitted to peers through DSLAM, and this transmission uses uplink bandwidth of DSLAM. In this paper, I propose an efficient management method of DSLAM uplink bandwidths through negotiating tracker and UCC server peer or head peers of DSLAM. I propose the method that tracker restricts a bitrate of uplink stream of UCC servers when used uplink bandwidth of DSLAM exceeds a certain point of maximum uplink bandwidths. I will show the improved performance of proposed scheme rather than general method with respect to the uplink bandwidth of DSLAM by numerical analysis and simulation.