• Journal of Industrial Technology
• /
• v.27 no.A
• /
• pp.131-139
• /
• 2007

The recent advance in wireless network technologies has enabled the streaming media service on the mobile devices such as PDAs and cellular phones. Since the wireless network has low bandwidth channels and mobile devices are actually composed of limited hardware specifications, the transcoding technology is needed to adapt streaming media to given mobile devices. Futhermore owing to the diversity of bandwidth in the wireless network by reason of mobile users' movements and environments, it is difficult to provide stable QoS. In this paper, the autonomic multimedia transcoding system is proposed in order for users to provide network adaptive QoS. Our proposed system is based on the estimation of available bandwidth in wireless network for seamless multimedia streaming service. The proposed system is designed and implemented for various mobile clients. In experiments, we evaluate its seamless multimedia streaming and the adaptation transcoding bit rate according to the changes of bandwidth in wireless network.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.6
• /
• pp.341-349
• /
• 2014

Dynamic adaptive streaming over HTTP (DASH) is the most recent and promising technology to support high quality streaming services. In dynamic adaptive streaming over HTTP (DASH), a client consecutively estimates the available network bandwidth and decides the transmission rate for the forthcoming video chunks to be downloaded. In this paper, we propose a novel rate adaptation algorithm called quality of experience QoE-enhanced adaptation algorithm over DASH (QAAD), which preserves the minimum buffer length to avoid interruption and minimizes the video quality changes during the playback. We implemented a DASH test bed and conducted extensive experiments. Experimental results demonstrate that under fluctuating network conditions, QAAD provides seamless streaming with stabilized video quality while the previous buffer-aware algorithm (i.e., QDASH[9]) frequently changes the video quality and undergoes the interruption.

• Journal of Communications and Networks
• /
• v.3 no.4
• /
• pp.307-316
• /
• 2001

Two hard sub-problems have emerged relating to the use of mobile agents for service management tasks. First, what is their impact on security, and second, how can they receive a flexible capacity to adapt to an open range of different environments on demand, without introducing trio stringent prior assumptions. In this paper, we present work towards solving the second problem, which is of particular interest to management software, because it typically needs to excert fine-grained and therefore particular resource control. We suggest a mechanism that reassembles mobile agents from smaller sub-components during arrival at each hop. The process incorporates patterns of unmutable and mutable sub-components, and is informed by the conditions of each local environment. We discuss different kinds of software adaptation and draw a distinction between static and continuous forms. Our software prototype for dynamic adaptation provides a concept far exchanging environment-dependent implementations of mobile agents during runtime. Dynamic adaptation enhances efficiency of mobile code in terms of bandwidth usage and scalability.

• Journal of Korea Multimedia Society
• /
• v.3 no.4
• /
• pp.399-406
• /
• 2000

There are sendee_based research and receiver_based research for dynamic adaptation to network congestion which arises from multicast video conference ; the former results in bandwidth waste of receivers who use high available bandwidth on account of average loss rate in transmission rate, the latter in short of the method that divides layers of available bandwidth of receivers dynamically. In order to do so, in this paper, we established two multicast groups divided into non-congestion status and congestion status according to receiver's network state, and implemented the bandwidth management algorithm which is designed for providing receivers with profitable qualities for available bandwidth by letting them choose each group dynamically in reference to loss rate. As a result, experiments proved that bandwidth waste problem was improved by receiver's dynamic choice according to loss rate.

• Structural Engineering and Mechanics
• /
• v.56 no.3
• /
• pp.423-442
• /
• 2015

This study examines the wavelet transform for output-only system identification of ambient excited engineering structures with emphasis on its utilization for modal parameter estimation of high-order and closely-spaced modes. Sophisticated time-frequency resolution analysis has been carried out by employing the modified complex Morlet wavelet function for better adaption and flexibility of the time-frequency resolution to extract two closely-spaced frequencies. Furthermore, bandwidth refinement techniques such as a bandwidth resolution adaptation, a broadband filtering technique and a narrowband filtering one have been proposed in the study for the special treatments of high-order and closely-spaced modal parameter estimation. Ambient responses of a 5-story steel frame building have been used in the numerical example, using the proposed bandwidth refinement techniques, for estimating the modal parameters of the high-order and closely-spaced modes. The first five natural frequencies and damping ratios of the structure have been estimated; furthermore, the comparison among the various proposed bandwidth refinement techniques has also been examined.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.2B
• /
• pp.124-132
• /
• 2007

Where a wireless LAN and a cellular network coexist, a mobile node has to experience vertical handoffs to move between them. Immediately after the vertical handoffs, TCP must need adaptation latency to adjust its congestion window to the proper size at a newly arrived network to use full of a new end-to-end available bandwidth. Even though SACK TCP has the best performance among other regular TCPs in the previous studies, it still cannot use full of the new available bandwidth quickly due to its inefficient increasing way of congestion window. BIC TCP, that becomes a popular TCP in long fat networks, has great feature working well against vertical handoffs by increasing congestion window exponentially with TCP connection sustained. In this paper, we derive adaptation latency of SACK TCP and BIC TCP numerically, and verify them by simulations. We also find that the shorter adaptation latency of BIC TCP produces higher throughput than SACK TCP on vertical handoffs. Consequently, to get higher performance on vertical handoff situations, we propose to use BIC TCP.

• Journal of KIISE:Software and Applications
• /
• v.35 no.4
• /
• pp.207-218
• /
• 2008

With the growth of the Internet, multimedia streaming becomes an important means to deliver video contents over the Internet and the amount of the streaming multimedia contents is also getting increased. However, it becomes difficult to guarantee the quality of service in real-time over the IP network environment with instantaneously varying bandwidth. In this paper, we propose an optimal adaptation framework for streaming contents over the Internet in the sense that the perceptual quality of the multi-angie content with multiple visual objects is maximized given the constraints such as available bandwidth and transcoding cost. In the multi-angle video service framework, the user can select his/her preferred alternate views among the given multiple video streams captured at different view angles for a same event. This enhanced experience often entails streaming problems in real-time over the network, such as instantaneous bandwidth changes in the Internet. In order to cope with this problem, we assume that multi-angle video contents are encoded at different bitrates and the appropriate video streams are then selected or transcoded for delivery to meet such bandwidth constraints. For the user selective consumption of the various bitstreams in the multi-angle video service, the bitstream in each angle can be encoded in various bitrate, and the user can select a sub-bitrstream in the given bitrstreams or transcode the corresponding content in order to deliver the optimally adapted video contents to the instantaneously changing network condition. Therefore, we define the transcoding cost which means the time taken for transcoding the video stream and formulate a unified optimization framework which maximizes the perceptual quality of the multiple video objects in the given constraints such as the transcoding cost and the network bandwidth. Finally, we present plenty of the experimental results to show the effectiveness of the proposed method.

• The KIPS Transactions:PartC
• /
• v.13C no.7 s.110
• /
• pp.933-938
• /
• 2006

Different multimedia services over networks not only require different amounts of bandwidth but also have different Qualify of Service (QoS) requirements. For example, QoS guarantees for higher priority calls is an important issue in multimedia communication networks. In this paper, we develop an adaptive bandwidth management algorithm, which is able to provide QoS guarantees for higher priority calls while accommodating as many heterogeneous multimedia call connections as possible. Our scheme, based on reservation and bandwidth adaptation, manages bandwidth based on real time estimates of current network conditions. Simulation results indicate the superior performance of our scheme providing excellent trade off between contradictory requirements.

• Journal of Communications and Networks
• /
• v.14 no.3
• /
• pp.286-295
• /
• 2012

To meet the increased demand of video-on-demand (VoD) services, peer-to-peer (P2P) mesh-based multiple video approaches have been recently proposed, where each peer is able to find a video segment interested without resort to the video server. However, they have not considered the constraint of the server's upload bandwidth and the fairness between upload and download amounts at each peer. In this paper, we propose a novel P2P VoD streaming system, named peer cache adaptation (PECAN) where each peer adjusts its cache capacity adaptively to meet the server's upload bandwidth constraint and achieve the fairness. For doing so, we first propose a new cache replacement algorithm that designs the number of caches for a segment to be proportional to its popularity. Second, we mathematically prove that if the cache capacity of a peer is proportional to its segment request rate, the fairness between upload and download amounts at each peer can be achieved. Third, we propose a method that determines each peer's cache capacity adaptively according to the constraint of the server's upload bandwidth. Against the proposed design objective, some selfish peers may not follow our protocol to increase their payoff. To detect such peers, we design a simple distributed reputation and monitoring system. Through simulations, we show that PECAN meets the server upload bandwidth constraint, and achieves the fairness well at each peer. We finally verify that the control overhead in PECAN caused by the search, reputation, and monitoring systems is very small, which is an important factor for real deployment.

• The Journal of the Korea Contents Association
• /
• v.12 no.4
• /
• pp.10-19
• /
• 2012

Seamless streaming of multimedia content that ensures Quality of Service over heterogeneous networks has been a desire for many multimedia services, for which the multimedia contents should be adapted to usage environments such as network characteristics, terminal capabilities, and user preferences. Scalability in video coding is a good feature to meet the requirement of heterogeneous networks. In this paper, we propose a dynamic adaptation scheme of H.264/AVC SVC bit-stream using the MPEG-21 Digital Item Adaptation (DIA) tool. MPEG-21 DIA framework provides systematic solutions in choosing an adaptation operation to given conditions and supports interoperable video adaptation. The experiment results show that the proposed adaptation scheme provides QoS-enabled delivery and consumption of SVC with time-varying constraints of network, terminal, and user preference, in a robust and efficient way. In particular, the proposed adaptation scheme is proved to work well with very low delay under the condition that the variation rate of the given network bandwidth is upto 62%.