• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.5
• /
• pp.125-133
• /
• 2008

In this paper, we propose active queue management mechanism (Active-WRED) to guarantee quality of the high priority service class in multi-class traffic service environment. In congestion situation, this mechanism increases drop probability of low priority traffic and reduces the drop probability of the high priority traffic, therefore it can improve the quality of the high priority service. In order to analyze the performance of our mechanism we introduce the stochastic analysis of a discrete-time queueing systems for the performance evaluation of the Active Queue Management (AQM) based congestion control mechanism called Weighted Random Early Detection (WRED) using a two-state Markov-Modulated Bernoulli arrival process (MMBP-2) as the traffic source. A two-dimensional discrete-time Harkov chain is introduced to model the Active-WRED mechanism for two traffic classes (Guaranteed Service and Best Effort Service) where each dimension corresponds to a traffic class with its own parameters.

• Journal of Communications and Networks
• /
• v.18 no.3
• /
• pp.375-386
• /
• 2016

Most existing studies on broadcast services in orthogonal frequency division multiplexing (OFDM) systems have focused on how to allocate the transmission power to the subcarriers. However, because a broadcasting system must guarantee quality of service to all users, the performance of the broadcast service dominantly depends on the channel state of the user who has the lowest received signal-to-noise ratio among users. To reduce the effect of the worst user on the system performance, we propose a joint delivery scheme of unicast and broadcast transmissions in OFDM systems with broadcast and unicast best-effort users. In the proposed joint delivery scheme, the BS delivers the broadcast information using both the broadcast and unicast subcarriers at the same time in order to improve the performance of the broadcast service. The object of the proposed scheme is to minimize the outage probability of the broadcast service while maximizing the sum-rate of best-effort users. For the proposed joint delivery scheme, we develop an adaptive power and subcarrier allocation algorithm under the constraint of total transmission power. This paper shows that the optimal power allocation over each subcarrier in the proposed scheme has a multi-level water filling form. Because the power allocation and the subcarrier assignment problems should be jointly solved, we develop an iterative algorithm to find the optimal solution. Numerical results show that the proposed joint delivery scheme with adaptive power and subcarrier allocation outperforms the conventional scheme in terms of the outage probability of the broadcast service and the sum-rate of best-effort users.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.5B
• /
• pp.517-525
• /
• 2009

We propose a quality guaranteed scalable video streaming service over the Internet using a new rate adaptation algorithm. Because video data requires much more bandwidth rather than other types of service, therefore, quality of video streaming service should be guaranteed while providing friendliness with other service flows over the Internet. To successfully provide this, we propose a framework for providing quality-guaranteed streaming service using two-channel transport layer and rate adaptation of scalable video stream. In this framework, baseline layer for scalable video is transmitted using TCP transport for minimum qualify service. Enhancement layers are delivered using TFRC transport with layer adaptation algorithm. The proposed framework jointly uses the status of playout buffer in the client and the encoding rate of layers in media contents. Therefore, the proposed algorithm can remarkably guarantee minimum quality of streaming service rather than conventional approaches regardless of network congestion and the encoding rate variation of media content.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.5
• /
• pp.1185-1192
• /
• 2010

Recently, the demand for various contents and mobile web service has been rising due to the improvement of the techniques of wireless networks. In mobile web service, it is essential to exchange the device informations and contents using specific information which are standardized for users, operators and contents providers. This is based on the existing service providers based on the existing terminal, which provides information to help plan and operate independently of the mobile Web services and content services for various users needs. In this paper, the interoperable DDL is proposed for providing contents to fit with each different mobile device, which contributes toward the optimized mobile web service and guarantee the interoperability of device information. and we implemented the device information processing system, which has the purpose of servicing the device information and verifying the result to the interoperability of mobile web service on proposed DDL and the description language of the device information.

• Journal of KIISE:Information Networking
• /
• v.37 no.6
• /
• pp.483-488
• /
• 2010

Due to the prevalence of various mobile devices and wireless broadband networks, there has been a significant increase in interest and demand for multimedia streaming services. Moreover, the user can service the participatory video broadcasting service in the mobile device and it can be used to deliver the real-time news and more variety information in the user side. Live multimedia service of user participation should consider not only the video quality but also the delay bounds and continuity of video playback for improving the user perceived QoS (Quality of Service) of streaming service. In this paper, we propose an adaptive rate control scheme, called DeBuG (Delay Bounds Guaranteed), to guarantee the delay bounds and continuity of video playback for the real-time streaming in mobile devices. In order to provide those, the proposed scheme has a quality adaptation function based on the transmission buffer status and network status awareness. It also has a selective frame dropper, which is based on the media priority, before the transmission video frames. The simulation results demonstrate the effectiveness of our proposed scheme.

• Journal of Korea Multimedia Society
• /
• v.10 no.5
• /
• pp.612-622
• /
• 2007

As compared with wired network environment, mobile VOD service in wireless network environment is difficult to guarantee the quality of VOD service due to the limitation of the system resources. Moreover, the wireless network has small bandwidth resources and short access range so that has limitations for providing the service to a large number of mobile clients. The limited battery capacity of a mobile device becomes an obstacle to mobile clients for enjoying VOD service for a long time. Therefore, these drawbacks should be considered in developing mobile VOD applications. This paper proposes a new technique for improving QoS of mobile VOD service by jointly use of broadcasting technique, which can provide VOD service to a large number of mobile clients simultaneously, and bursty communication technique, which can reduce the power consumption of a mobile device. With having these two techniques, streaming data are divided into segments, each of which is grouped into a particular packet and then transmitted at a time in the busty communication manner. In the performance evaluation, the power consumption on WNIC of a mobile device can be reduced by over 80%, and the initial service delay can be reduced in proportion to the number of channels compared with the existing staggered broadcasting technique.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.15 no.6
• /
• pp.1099-1104
• /
• 2020

In order to provide various types of application services based on the Internet, it is ideal to guarantee the quality of service(QoS) for each flow. However, realizing these ideas is not an easy task.. It is effective to classify multiple flows having the same or similar service quality requirements into same group, and to provide service quality for each group. The queue management mechanism in the router plays a very important role in order to efficiently transmit data and to support differentiated quality of service for each service. In order to efficiently support various multimedia services, an intelligent and adaptive queue management mechanism is required. This paper proposes an intelligent queue management mechanism based on deep reinforcement learning that decides whether to deliver packets for each group based on the traffic information of each flow group flowing in for a certain period of time and the current network state information.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.7
• /
• pp.111-118
• /
• 2019

In this age where the social environment is changing rapidly and unpredictably, interest in safety from crime is increasing in Korean society. As the desire to live a life free from the fear of crime increases, interest in the construction of safe cities is also rising nationwide. For this, it is important to develop precision-positioning technology and support-service and intelligent security-service technology based on spatial information. Therefore, this study analyzes cases of multiple CCTV collaboration technology from among the intelligent-security technologies, and evaluates the technology's guarantee system through the evaluation system of the Technology Guarantee Fund, and evaluates continuity based on innovation, spreadability, usability, and proposed commercialization in order to enable utilization and commercialization. As a result of analyzing multiple CCTV collaborative technologies through the evaluation system of the Technology Guarantee Fund, the technology with the highest outlook was given five points, and the others were rated as excellent in terms of spreadability, usability, and differentiation. For innovation, the score was three points lower than the other evaluation items, but we expect to overcome that by introducing the latest technology and converging it with other technologies, such as the Internet of Things.

• Journal of information and communication convergence engineering
• /
• v.5 no.2
• /
• pp.171-176
• /
• 2007

To give a guarantee a consistently high level of quality and reliability of Telematics traffic service, traffic flow forecasting is very important issue. In this paper, we proposed an adaptable integrated prediction model to predict the traffic flow in the future. Our model combines two methods, short-term prediction model and long-term prediction model with different combining coefficients to reflect current traffic condition. Short-term model uses the Kalman filtering technique to predict the future traffic conditions. And long-term model processes accumulated speed patterns which means the analysis results for all past speeds of each road by classifying the same day and the same time interval. Combining two models makes it possible to predict future traffic flow with higher accuracy over a longer time range. Many experiments showed our algorithm gives a better precise prediction than only an accumulated speed pattern that is used commonly. The result can be applied to the car navigation to support a dynamic shortest path. In addition, it can give users the travel information to avoid the traffic congestion areas.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.9C
• /
• pp.836-841
• /
• 2002

Packet scheduling is an essential function to guarantee a quality of service by differentiating services in the Internet. Scheduling algorithms that have been suggested so far can be devided into Round-Robin methods and Fair Queueing methods Round-Robin methods have the advantage of high-speed processing through simple implementations, while Fair Queueing methods offer accurate services. Fair queueing algorithms, however, have problems of computational overheads and implementation complexity as their schedulers manage the states of every flow. This paper suggests a new method in which each flow performs the calculation in a distributed way to decide the service order. Our algorithm significantly reduces the scheduler's computational overheads while providing the same level of accuracy with the previous Fair Queueing algorithms.