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

Video streaming services make up a large proportion of Internet traffic on both fixed and mobile access throughout the world. Adaptive streaming allows for dynamical adaptation of the bitrate with varying network conditions, to guarantee the best user experience. Adaptive bitrate algorithms face a significant challenge in correctly estimating the throughput as it varies widely over time. In this paper, we first evaluate the throughput estimation techniques and show that the method that we have used offers stable response to throughput fluctuations while maintaining a stable playback buffer. Then, we propose an adaptive bitrate scheme that intelligently selects the video bitrates based on the estimated throughput and buffer occupancy. We show that the proposed scheme improves viewing experience by achieving a high video rate without taking unnecessary risks and by minimizing the frequency of changes in the video quality. Furthermore, we show that it offers a stable response to short-term fluctuations and responds swiftly to large fluctuations. We evaluate our algorithm for both constant bitrate (CBR) and variable bitrate (VBR) video content by taking into account the segment sizes and show that it significantly improves the quality of video streaming.

• Journal of Communications and Networks
• /
• v.18 no.2
• /
• pp.261-269
• /
• 2016

In this paper, the impact of energy constraints on a two-hop network with a source, a relay and a destination under random medium access is studied. A collision channel with erasures is considered, and the source and the relay nodes have energy harvesting capabilities and an unlimited battery to store the harvested energy. Additionally, the source and the relay node have external traffic arrivals and the relay forwards a fraction of the source node's traffic to the destination; the cooperation is performed at the network level. An inner and an outer bound of the stability region for a given transmission probability vector are obtained. Then, the closure of the inner and the outer bound is obtained separately and they turn out to be identical. This work is not only a step in connecting information theory and networking, by studying the maximum stable throughput region metric but also it taps the relatively unexplored and important domain of energy harvesting and assesses the effect of that on this important measure.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.11
• /
• pp.5455-5475
• /
• 2016

In this article, we model the distributed relay assignment network as a many-to-one matching market with peer effects. We discuss two scenarios for throughput optimization of relay networks: the scenario of aggregate throughput optimization and the scenario of fairness performance optimization. For the first scenario, we propose a Mutual Benefit-based Deferred Acceptance (MBDA) algorithm to increase the aggregate network throughput. For the second scenario, instead of using the alternative matching scheme, a non-substitution matching algorithm (NSA) is designed to solve the fairness problem. The NSA improves the fairness performance. We prove that both two algorithms converge to a globally stable matching, and discuss the practical implementation. Simulation results show that the performance of MBDA algorithm outperforms existing schemes and is almost the same with the optimal solution in terms of aggregate throughput. Meanwhile, the proposed NSA improves fairness as the scale of the relay network expands.

• 한국생물공학회:학술대회논문집
• /
• 2005.10a
• /
• pp.422-423
• /
• 2005

• KIISE Transactions on Computing Practices
• /
• v.21 no.12
• /
• pp.780-785
• /
• 2015

Recently HTTP (Hypertext Transfer Protocol) adaptive streaming services have been the subject of much attention. The video quality control scheme of conventional HTTP adaptive streaming services estimates bandwidth using segment throughput and smooths out the sample of segment throughput. However, the conventional scheme has the problem of QoE (Quality of experience) degradation occurring with buffer underflow and frequent quality change due to the fixed number of samples. In order to solve this problem, we propose a video quality control scheme based on segment throughput and buffer occupancy. The proposed scheme determines the number of samples according to the variation of segment throughput. The proposed scheme also controls video quality based on the threshold of bitrate to keep stable buffer occupancy. The simulation results show that proposed scheme improves QoE by preventing buffer underflow and decreasing quality change when compared with the conventional scheme.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.143-146
• /
• 2004

Differentiated services (DiffServ) has been widely accepted as the service model to adopt for providing quality-of­service (QoS) over the next-generation IP networks. There is a growing need to support QoS in mobile ad hoc networks. Supporting DiffServ in mobile ad hoc networks, however, is very difficult because of the dynamic nature of mobile ad hoc networks, which causes network congestion. The network congestion induces long transfer packet delay and low throughput which make it very difficult to support QoS in mobile ad hoc networks. We propose DiffServ module to support differentiated service in mobile ad hoc networks through congestion control. Our DiffServ module uses the periodical rate control for real time traffic and also uses the best effort bandwidth concession when network congestion occurs. Network congestion is detected by measuring the packet transfer delay or bandwidth threshold of real time traffic. We evaluate our mechanism via a simulation study. Simulation results show our mechanism may offer a low and stable delay and a stable throughput for real time traffic in mobile ad hoc networks.

• Journal of Communications and Networks
• /
• v.14 no.2
• /
• pp.162-168
• /
• 2012

This paper considers the scenario in which a set of nodes share a common channel. Some nodes have a rechargeable battery and the others are plugged to a reliable power supply and, thus, have no energy limitations. We consider two source-destination pairs and apply the concept of cognitive radio communication in sharing the common channel. Specifically, we give high-priority to the energy-constrained source-destination pair, i.e., primary pair, and low-priority to the pair which is free from such constraint, i.e., secondary pair. In contrast to the traditional notion of cognitive radio, in which the secondary transmitter is required to relinquish the channel as soon as the primary is detected, the secondary transmitter not only utilizes the idle slots of primary pair but also transmits along with the primary transmitter with probability p. This is possible because we consider the general multi-packet reception model. Given the requirement on the primary pair's throughput, the probability p is chosen to maximize the secondary pair's throughput. To this end, we obtain two-dimensional maximum stable throughput region which describes the theoretical limit on rates that we can push into the network while maintaining the queues in the network to be stable. The result is obtained for both cases in which the capacity of the battery at the primary node is infinite and also finite.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.10A
• /
• pp.780-787
• /
• 2003

Adaptive modulation is the method to increase the throughput of the mobile system using the power margin of the system design. In this paper, we propose the method to change adaptive modulation parameters for the stable system operation by monitoring the mobility of the mobile station. The proposed method measures the instanteneous mobility of the mobile station monitoring the closed power control data. The MPSK modulation method is used for the basic modulation method because of the hardware implementation. Using the proposed method we can get the more powerful throughput. By the system simulation to verify the evaluation of the proposed algorithm, we can notice the algorithm is more efficient than the typical method

• Journal of Korea Port Economic Association
• /
• v.35 no.4
• /
• pp.169-186
• /
• 2019

This study suggests a development direction by comparing the cargo throughput of the port of Yeosu-Gwangyang during 2007-2015 with that of domestic ports. It derived a concentration index (HHI) of cargo throughput in domestic ports by Yeosu-Gwangyang port docks, shipping companies, and abroad regions. The main results were as follows. First, in terms of total cargo handled, the port of Yeosu-Gwangyang was second only to the port of Busan, and the HHIs for the past nine years were relatively low. Second, the port of Yeosu-Gwangyang ranked first for total import and export cargo throughput, showing relatively stable HHIs from 2007 to 2015. Third, the HHIs of container handling performance by national shipping companies showed stable levels below 1,800. Fourth, there were no regions where cargo volume was noticeably concentrated in the port of Yeosu-Gwangyang, and it showed cargo throughput across various abroad regions. While changes in national shipping companies are expected after the Hanjin Shipping Crisis, there should be no serious concern regarding the dependence of the port of Yeosu-Gwangyang. It is expected to develop further by realizing the full use of all its facilities, diversifying the tenants in the Yeosu-Gwangyang area, and improving the demurrage rate.

• Journal of Communications and Networks
• /
• v.12 no.5
• /
• pp.499-509
• /
• 2010

A plethora of transmission control protocol (TCP) congestion control algorithms have been devoted to achieving the ultimate goal of high link utilization and fair bandwidth sharing in high bandwidth-delay product (HBDP) networks. We present a new insight into the TCP congestion control problem; in particular an end-to-end delay-based approach for an HBDP network. Our main focus is to design an end-to-end mechanism that can achieve the goal without the assistance of any network feedback. Without a router's aid in notifying the network load factor of a bottleneck link, we utilize goodput and throughput values in order to estimate the load factor. The obtained load factor affects the congestion window adjustment. The new protocol, which is called TCP-goodput and throughput (GT), adopts the carefully designed inversely-proportional increase multiplicative decrease window control policy. Our protocol is stable and efficient regardless of the link capacity, the number of flows, and the round-trip delay. Simulation results show that TCP-GT achieves high utilization, good fairness, small standing queue size, and no packet loss in an HBDP environment.