• The KIPS Transactions:PartC
• /
• v.10C no.1
• /
• pp.33-38
• /
• 2003

Most of the existing algorithms try to disseminate the multimedia contents of internet service provider (ISP), without taking into account characteristics and capacities of duplicated servers. However, they are less reliable without prior information on capacities of duplicated servers. In this paper we propose two algorithms, performance rating algorithm of hardware and capacity algorithm, inspired by the need of improving QoS of delivering multimedia contents without incurring long access delays when the capacities of duplicated servers are significantly different and clients locate in a fixed geographical domain Our simulation results show that they are better than HTTP response time algorithm when the multimedia contents are large and quite different from performances between duplicated servers.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.12
• /
• pp.1-8
• /
• 2005

In this paper, we study a call admission control algorithm for supporting multicast service under the BcN environment where broadcasting, communication and Internet are converging to be one. It is necessary to control service requests with a certain criteria in order to guarantee QoS because the system capacity is limited. As a possible solution, we divide one multicast service into 3 classes and set up a threshold per each class to control service request. Especially, for the purpose of system benefit, we define system pay-off rate 'GAIN' with the term 'Reward' and 'Penalty' according to admit and reject service request. And we confine the range of threshold which makes GAIN to be maximized. For the performance analysis, we model the system as M/M/m/m queueing system, investigate GAIN under various conditions and show the effectiveness of the proposed algorithm.

• Proceedings of the Korea Contents Association Conference
• /
• 2008.05a
• /
• pp.51-55
• /
• 2008

Request High-Images, High-quality, duplex transmission, BcN Voice telephone, Broadcast, Data internet service came to be all possible and demolished original communication service area. Also, The quality is guaranteed stablely to new business and ISP the requirement comes to become a multicasting quality guarantee mechanism which there is the reliability for a information communication and High-quality multimedia service. Like this, a multicast mechanism to be guaranteed must become air control End-to-End QoS for a service supply, a transmission delay a packet loss or requirement which the user requests guarantee and multicast Path-NET which there is the reliability must be provided. Therefor, we proposed IP base multicast new join the present the multicast mechanism of Probing packet foundation which there is the efficiently a linking acceptance, we used ns-2 simulator for the performance evaluation of the proposed.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.1
• /
• pp.41-47
• /
• 2002

Path setup considering QoS is one of the main problems to solve in Internet traffic engineering. In network restoration that is one of the traffic engineering components, to establish a backup path or backup path for a working path to be protected is the main task. The backup path should have enough bandwidth to guarantee the working paths. Thus this work requires the QoS routing solution that is to set up a backup path as well as a working path at the same time provisioning enough bandwidth. In this paper, we propose an algorithm to setup a backup path that shares the bandwidth of other backup paths whose working path does not pass along the same link with the working path we are considering. In this way we can reduce much bandwidth consumption caused by setting up backup paths. We also analyze the disjoint path computation algorithms. Finally we show simulation results how the algorithm can reduce the bandwidth consumption and how it will affect blocking when we setup paths.

• The KIPS Transactions:PartA
• /
• v.8A no.4
• /
• pp.345-352
• /
• 2001

In this paper, a VoIP (Voice on Internet Protocol) terminal system, which can process voice in real time based on Linux, is designed and implemented. The hardware of it is designed using a i486 processor and a DSP codec chip which encodes and decodes voice data in real time. As an operating system, RTLinux, which is a real-time operating system based on Linux, is ported to manage real-time voice processing. The voice processing module of the system uses G.723.1 voice codec of ITU-T standard. It transfers voice data within 30ms to assure good voice quality. In order to satisfy the real time requirements and QoS (Quality-of-Service) for the voice data, the real-time voice processing device driver is designed and implemented. To verify the system, the chatting application program is developed and tested for QoS of the system.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.6
• /
• pp.225-236
• /
• 2003

In this paper, we propose a wireless scheduling algorithm to provide the Internet delay proportional differentiated services in wireless networks. For considering network environments that have burst and location-dependent channel errors, our proposed WDPS(Wireless Delay Proportional Service) scheduling algorithm adaptively serves packets in class queues based on the delivered delay performance for each class. The remarkable characteristics of WDPS scheduler are supporting a fair relative delay service, providing graceful throughput and delay compensation, and avoiding class queue blocking problem. Through simulations, we show that the algorithm achieves the desirable properties to provide delay proportional services in wireless networks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.6
• /
• pp.2824-2837
• /
• 2019

Container technologies are widely used in infrastructures to deploy and manage applications in cloud computing environment. As containers are light-weight software, the cluster of cloud applications can easily scale up or down to provide Internet-based services. Container-based applications can well deal with fluctuate workloads by dynamically adjusting physical resources. Current works of scheduling applications often construct applications' performance models with collected historical training data, but these works with static models cannot self-adjust physical resources to meet the dynamic requirements of cloud computing. Thus, we propose a self-adaptive automatic container scheduling framework AutoScale for cloud applications, which uses a feedback-based approach to adjust physical resources by extending, contracting and migrating containers. First, a queue-based performance model for cloud applications is proposed to correlate performance and workloads. Second, a fuzzy Kalman filter is used to adjust the performance model's parameters to accurately predict applications' response time. Third, extension, contraction and migration strategies based on predicted response time are designed to schedule containers at runtime. Furthermore, we have implemented a framework AutoScale with container scheduling strategies. By comparing with current approaches in an experiment environment deployed with typical applications, we observe that AutoScale has advantages in predicting response time, and scheduling containers to guarantee that response time keeps stable in fluctuant workloads.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.5
• /
• pp.714-724
• /
• 2022

The spread of mobile devices comes to increase explosive data traffic and then results in various types of service demands. In order to satisfy the increment of traffic and the requirements for various services, optical internet technologies that transmit several Tbps through only a single optical fiber have been actively studied. Because of the large bandwidth, an optical link can accommodate a large number of service types. Therefore, new technologies are required to guarantee the survivability of optical internet and handle the requirements of each service. So, in this article, a new scheme based on GMPLS technologies is proposed to deal with the various service demands and survivability issues in IP over WDM networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7B
• /
• pp.641-649
• /
• 2004

We propose a dynamic traffic management model which uses adaptive priority reassignment algorithm to deliver service differentiation in home networks, and implement adaptive priority reassignment algorithm using FPGA. The proposed architecture is designed to handle home network traffic without the need for signaling protocol. We categorize home network traffic into three kinds of traffic class: control data traffic class, the Internet data and non-real-time data traffic class, and multimedia data traffic class (include non-real-time and real-time multimedia data traffic). To support differential service about these kinds of traffic class, we designed and implemented a traffic management framework that dynamically change each traffic class priority depending on bandwidth utilization of each traffic class.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.12
• /
• pp.1-8
• /
• 2003

Scheduling technology is one of the most important elements required to support the Quality of service (QoS) in the Internet and a lot of scheduling algorithms have been developed. However, most of these algorithms ire not flexible to distribute the excess bandwidth. In order to provide flexibility for distributing the excess bandwidth, we proposed excess bandwidth fair queueing (EBFQ) algorithm with relatively low complexity. In this paper, we propose the new extension to this EBFQ algorithm for the hierarchical fair queueing system. This extension can be naturally applied to the existing hierarchical algorithm and simultaneously provide the same level of fairness. Through the simulation and analysis, we verify it.