• Journal of the Korea Society of Computer and Information
• /
• v.4 no.4
• /
• pp.155-162
• /
• 1999

Various applications of video conferencing are required real-time transmission in order to offer service of best effort in internet. Because the bandwidth of internet changes dynamically, appropriated QoS could not be guaranteed To resolve the problem. available bandwidth between sender and receiver is measured. And according to measured bandwidth, the transmission of multimedia data is controlled In this paper, we propose algorithm of efficient transmission for best QoS in internet According to a present status of network, we measure available bandwidth using feedback RTCP information and change a compression rate to reduce a producing CODEC data. And according to the priority that is measured by packet loss for received RTCP information, we abandon frames indicated as lower weight in transmission buffer of sender.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.7
• /
• pp.63-73
• /
• 2015

In the end to end data transfer protocols, it is very important to correctly estimate available bandwidth. In UDT (UDP based Data Transfer), receiver estimates the MTR (Maximum Transfer Rate) of the current link using pair packets transmitted periodically from sender and, then sender finally decides the MTR through EWMA (Exponential Weighted Moving Average) algorithm. Here, MTR has to be exactly estimated because available bandwidth is calculated with difference of MTR and current transfer rate. However, when network is congested due to traffic load and where competing flows are coexisted, it bring about a severe fairness problem. This paper proposes a congestion degree based MTR estimation algorithm. Here, the congestion degree stands a relative index for current congestion status on bottleneck link, which is calculated with arriving intervals of a pair packets. The algorithm try to more classify depending on the congestion degree to estimate more actual available bandwidth. With the network simulation results, our proposed method showed that the fairness problem among the competing flows is significantly resolved in comparison with that of UDT.

• Journal of KIISE:Information Networking
• /
• v.32 no.5
• /
• pp.641-649
• /
• 2005

Metro networks use the existing circuit-switching technology like SONET/SDH. Such circuit-switching based networks are inefficient in tarrying Internet traffic with bursty nature. Therefore, metro networks can become a bottleneck In order to resolve this problem, the IEEE 802.17 working group has proposed the RPR (Resilient Packet Ring) technology. In addition to this, the RPR fairness mechanism has been defined to provide fairness among the stations in the RPR network. However, the current RPR fairness mechanism has the problem of inefficient use of the available bandwidth after when the congestion at a node is resolved. In this paper, we propose an improved bandwidth allocation mechanism in which, after the congestion resolution at a node, the node estimates the number of nodes transmitting data and measures the remaining bandwidth and fairly allocates the available bandwidth to active nodes. To show the performance of our proposed mechanism, we have performed simulation and showed that the proposed mechanism offers higher bandwidth utilization.

• Journal of KIISE:Information Networking
• /
• v.32 no.2
• /
• pp.134-146
• /
• 2005

Research about QoS in the ad-hoc networks for stable service of various applications has been needed as the expectation about the realization of the ad-hoc networks grows bigger. Existing researches about QoS in the ad-hoc network had the problems which can not guarantee the quantitative services or create the overhead. In this paper, we propose a novel algorithm of QFAN(QoS Framework for Ad-hoc Networks) the framework to resolve such problems and considered application of the proposed algorithm into the ad-hoc networks. Our model can guarantee the minimum bandwidth of the real-time traffic as minimized the overhead. And, disproportionate distribution of bandwidth problem can resolve by the proposed algorithm through the fair share between real-time traffic and best-effort traffic about available bandwidth. We design both the TiRe(Tiny Reservation) and the ADR(Adaptive Drop Rate) control algorithm to apply the proposed QFAN. Using simulation, we confirm fair share of available bandwidth between real-time traffic and best-effort traffic as guarantee minimum required bandwidth of real-time traffic.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.1
• /
• pp.308-324
• /
• 2018

HTTP adaptive streaming (HAS) is a promising technology for delivering video content over the Internet. HAS-based video streaming solutions rely on bandwidth estimation to select the appropriate video bitrate. Video streaming solutions that consider network conditions provide users with seamless video playback. However, when multiple clients compete for a common bottleneck link, conventional bandwidth estimation schemes that consider only one client overestimate the network bandwidth due to the ON-OFF traffic pattern. The bandwidth overestimation can cause Quality of Experience (QoE) degradation, such as unnecessary changes in video quality, and unfairness of video quality. In this paper, we propose a client-side bandwidth estimation scheme to obtain a better QoE of HAS in the multiple-client environment. The proposed scheme differentiates the client buffer status according to the buffer occupancy, and then estimates the available network bandwidth based on the buffer status and segment throughput. We evaluate the performance of HAS implemented in the ns-3 network simulator. Simulation results show that compared with the conventional schemes, the proposed scheme can enhance the QoE.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.9
• /
• pp.39-48
• /
• 2008

Recently, many multimedia services have emerged in Internet such as real-time and non- real time services. However, in this Internet environment, we have some limitations to satisfy each service feature. To guarantee the service features in Measurement-Based Admission Control(MBAC) based system on the flow-aware network, there is the method applying Dynamic Priority Scheduling(DPS) algorithm that gives a higher priority to an earlier incoming flow in all of the link bandwidth. This paper classifies all flows under several groups according to flow characteristics on per-flow MBAC algorithm based system. In each flow group, DPS algorithm is applied. This paper proposes two methods that are a DPS based bandwidth borrowing method and a bandwidth dynamic allocation method. The former is that if low priority class has available bandwidths, the flow of high priority class borrows the bandwidth of low priority class when high priority flow has insufficient bandwidth to connect a flow call. The later is that the each group has a minimum bandwidth and is allocated the bandwidth dynamically according to the excess rate for available bandwidth. We compare and analyze the characteristics of the two proposed methods through the simulation experiments. As the results of the experiment, the proposed methods are more effective than existing DPS based method on the packet loss and delay characteristics. Consequently the proposed two methods are very useful in various multimedia network environments.

• The KIPS Transactions:PartC
• /
• v.15C no.6
• /
• pp.547-556
• /
• 2008

Recently, with the advance of computing and networking technique, the high speed internet becomes widespread, however, it is still hard job to do streaming the media which requires high network bandwidth over the internet. Previous researches for streaming over the internet mainly proposed techniques that controls the QoS(Quality of Service) of the media in proportion to the network status. Though, this could be the solution for the service provider while the service user who wants constant QoS may not satisfy with variable QoS. In the paper, we propose a network adaptive prefetching technique, NAP, for guarantee of constant QoS. The NAP prefetches frames by increasing the frame transmission rate while the available network bandwidth is high. The NAP uses the prefetched frames to guarantee the QoS while the available network bandwidth is low. The experiment result shows that the proposed NAP could guarantee the constant QoS by prefetching the frames adaptively to the network bandwidth with the characteristic of video stream.

• The KIPS Transactions:PartA
• /
• v.16A no.5
• /
• pp.327-338
• /
• 2009

Recently, with the advance of computing and networking technique, the high speed internet becomes widespread, however, it is still hard job to do streaming the media which requires high network bandwidth over the internet. Previous researches for streaming over the internet mainly proposed techniques that controls the QoS(Quality of Service) of the media in proportion to the network status. Though, this could be the solution for the service provider while the service user who wants constant QoS may not satisfy with variable QoS. In the paper, we propose a network adaptive prefetching technique, PAP, for guarantee of constant QoS. The PAP prefetches frames by increasing the frame transmission rate while the available network bandwidth is high. The PAP uses the prefetched frames to guarantee the QoS while the available network bandwidth is low and increases the playout interval to prevent buffer underflow. The experiment result shows that the proposed PAP could guarantee the constant QoS by prefetching the frames adaptively to the network bandwidth with the characteristic of video stream.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.5
• /
• pp.888-908
• /
• 2011

The increasing demand from passengers in vehicles to improve safety, traffic efficiency, and comfort has lead to the growing interest of Wi-Fi based vehicle-to-infrastructure (V2I) communications. Although the V2I system provides fast and cost-effective Internet connectivity to vehicles via roadside Wi-Fi access points (APs), it suffers from frequent handoffs due to the high mobility of vehicles and the limited coverage of Wi-Fi APs. Recently, the Mobile AP (MAP) platform has emerged as a promising solution that overcomes the problem in the V2I systems. The main advantage is that MAPs may yield longer service duration to the nearby vehicles that have similar mobility patterns, yet they provide smaller link capacities than the roadside APs. In this paper, we present a new association control technique that harnesses available connection duration as well as achievable link bandwidth in high-speed vehicular network environments. We also analyze the tradeoff between two association metrics, namely, available connection duration and achievable link bandwidth. Extensive simulation studies based on real traces demonstrate that our scheme significantly outperforms the previous methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.11
• /
• pp.4519-4533
• /
• 2015

Hypertext Transfer Protocol (HTTP) adaptive streaming has become a new trend in video delivery. An HTTP adaptive streaming client needs to effectively estimate resource availability and demand. However, due to the bitrate of the video encoded in variable bitrate (VBR) mode, a bitrate mismatch problem occurs. With the rising demand for mobile devices, the likelihood of cases where two or more HTTP adaptive streaming clients share the same network bottleneck and competing for available bandwidth will increase. These mismatch and competition issues lead to network congestion, which adversely affects the Quality of Experience (QoE). To solve these problem, we propose a video rate adaptation scheme for the HTTP video streaming to guarantee and optimize the QoE. The proposed scheme estimates the available bandwidth according to the bitrate of each segment and also schedules the segment request time to expedite the response to the bandwidth variation. We used a multi-client simulation to prove that our scheme can effectively cope with drastic changes in the connection throughput and video bitrate.