• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.7C
• /
• pp.677-684
• /
• 2002

Today's Internet does not have efficient traffic engineering mechanism to support QoS for the explosive increasing internet traffic such as various multimedia traffic. This functional shortage degrades prominently the quality of service, and makes it difficult to provide multi-media service and real-time service. Various technologies are under developed to solve these problems. IETF (Internet Engineering Task Force) developed the MPLS (Multi-Protocol Label Switching) technology that provides a good capabilities of traffic engineering and is independent layer 2 protocol, so MPLS is expected to be used in the Internet backbone network$\^$[1][2]/. The faults occurring in high-speed network such as MPLS, may cause massive data loss and degrade quality of service. So fast network restoration function is essential requirement. Because MPLS is independent to layer 2 protocol, the fault detection and reporting mechanism for restoration should also be independent to layer 2 protocol. In this paper, we present the experimental results of the MPLS OAM function for the performance monitoring and fault detection 'll'&'ll' notification, localization in MPLS network, based on the OPNET network simulator

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.13 no.6
• /
• pp.2720-2728
• /
• 2012

Recently flexible mobile terminals which can freely change the shape of their device are coming out with the development of the flexible display, high capacity memory and system integration technology. The display and the antenna configuration of the future terminals will be altered according to the QoS (quality of service) and the communication environment of users. In particular, we present the new emergence of a multimedia language for human and system to communicate over subjective concepts, intention of users. The intension of users is expressed by changing the shape of their mobile terminal. In addition, antenna configuration is also related to shape of terminal and QoS of users. Therefore, we set up a specific usage scenarios for future mobile terminals and propose an adaptive MIMO (multiple-input multiple-output) schemes that can maximize channel capacity and fit to QoS of users simultaneously.

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

In wireless mobile environments, large bandwidth and high QoS (Quality of Service) are recently required to support the increased demands for multimedia services. LTE (Long Term Evolution) is one of the promising solutions for the next generation broadband wireless access systems. To efficiently use downlink resource and effectively support QoS, packet scheduling algorithm is one of the important features in LTE system. In this paper, we proposed DAPS (Delay-Aware Packet Scheduling) algorithm to consider QoS requirements of delays for various traffic classes as well as channel condition and fairness. To reflect delay experiences at scheduling instance, DAPS observes how queue waiting time of packet is closed to maximum allowable delay. The simulation results show that the DAPS algorithm yields better performance for delay experience by increasing the number of transmitted packets with satisfying the required delay time compared with existing scheduling algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.12
• /
• pp.5701-5722
• /
• 2018

The continuous increase in the cost of energy production and concerns for environmental sustainability are leading research communities, governments and industries to amass efforts to reduce energy consumption and global $CO_2$ footprint. Players in the information and communication industry are keen on reducing the operational expenditures (OpEx) and maintaining the profitability of cellular networks. Meanwhile, network virtualization has been proposed in this regard as the main enabler for 5G mobile cellular networks. In this paper, we propose a generic framework of slice resource provisioning and customized physical resource allocation for energy-efficiency and quality of service optimization. In resource slicing, we consider user demand and population resources provisioning scheme aiming to satisfy quality of service (QoS). In customized physical resource allocation, we formulate this problem with an integer non-linear programming model, which is solved by a heuristic algorithm based on minimum vertex coverage. The proposed algorithm is compared with the existing approaches, without consideration of slice resource constraints via system-level simulations. From the perspective of infrastructure providers, traffic is scheduled over a limited number of active small-cell base stations (sc-BSs) that significantly reduce the system energy consumption and improve the system's spectral efficiency. From the perspective of virtual network operators and mobile users, the proposed approach can guarantee QoS for mobile users and improve user satisfaction.

• The KIPS Transactions:PartC
• /
• v.17C no.2
• /
• pp.189-196
• /
• 2010

The LEACH does not use flooding method for data transmission and this makes low power consumption. So performance of the WSN is increased. On the other hand, QoS based algorithm which use restricted flooding method in WSN also achieves low power consuming rate by reducing the number of nodes that are participated in routing path selection. But when the data is delivered to the sink node, the LEACH choose a routing path which has a small hop count. And it leads that the performance of the entire network is worse. In the paper we propose a QoS based energy efficient clustering and routing algorithm in WSN. I classify the type of packet with two classes, based on the energy efficiency that is the most important issue in WSN. We provide the differentiated services according to the different type of packet. Simulation results evaluated by the NS-2 show that proposed algorithm extended the network lifetime 2.47 times at average. And each of the case in the class 1 and class 2 data packet, the throughput is improved 312% and 61% each.

• Journal of Multimedia Information System
• /
• v.1 no.1
• /
• pp.67-75
• /
• 2014

Nowadays as video services grow rapidly, it is important for the service providers to provide customized services. Video ranking plays a key role for the service providers to attract the subscribers. In this paper we propose a weekly video ranking mechanism based on the quantified user engagement. The traditional QoE ranking mechanism is relatively subjective and usually is accomplished by grading, while QoS is relatively objective and is accomplished by analyzing the quality metrics. The goal of this paper is to establish a ranking mechanism which combines the both advantages of QoS and QoE according to the third-party data collection platform. We use data mining method to classify and analyze the collected data. In order to apply into the actual situation, we first group the videos and then use the regression tree and the decision tree (CART) to narrow down the number of them to a reasonable scale. After that we introduce the analytic hierarchy process (AHP) model and use Elo rating system to improve the fairness of our system. Questionnaire results verify that the proposed solution not only simplifies the computation but also increases the credibility of the system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.3B
• /
• pp.135-143
• /
• 2008

In this paper, we propose a QoS guaranteed and energy-efficient transmission scheme for Wireless Personal Area Networks (WPANs), which operate in conjunction with contention-based access protocols such as CSMA/CA. Energy consumption is one of the most important issues in WPAN systems, because WPAN devices are often required to operate under limited battery capacity. Furthermore, if the WPAN adopts a contention-based medium access protocol, the energy consumption problem becomes even more critical due to the collisions caused by independent channel access trials. Therefore, in this paper, we propose an algorithm that selects the optimum fragment size, modulation level, and transmission power, in order to minimize the energy consumption and guaranteethe QoS (Quality of Service) requirements, simultaneously. Our simulation results show that the proposed algorithm has better performance than the previous ones.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.3
• /
• pp.1260-1283
• /
• 2019

Low earth orbit (LEO) satellite broadband network is a crucial part of the space information network. LEO satellite constellation design is a top-level design, which plays a decisive role in the overall performance of the LEO satellite network. However, the existing works on constellation design mainly focus on the coverage criterion and rarely take network performance into the design process. In this article, we develop a unified framework for constellation optimization design in LEO satellite broadband networks. Several design criteria including network performance and coverage capability are combined into the design process. Firstly, the quality of service (QoS) metrics is presented to evaluate the performance of the LEO satellite broadband network. Also, we propose a network stability model for the rapid change of the satellite network topology. Besides, a mathematical model of constellation optimization design is formulated by considering the network cost-efficiency and stability. Then, an optimization algorithm based on non-dominated sorting genetic algorithm-II (NSGA-II) is provided for the problem of constellation design. Finally, the proposed method is further evaluated through numerical simulations. Simulation results validate the proposed method and show that it is an efficient and effective approach for solving the problem of constellation design in LEO satellite broadband networks.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.8
• /
• pp.949-956
• /
• 1999

이 논문에서는 ATM (Asynchronous Transfer Mode) 방식의 초고속망의 장애 발생 시 이용자 연결의 QoS (Quality of Service)를 고려하여 복구할 수 있게 하는 보호 망 설계 방안을 제시한다. 제시한 설계 방안에 기초한 비용과 복구 특성을 분석과 모의 실험을 통해 알아본다. 제안하는 망에서의 복구는 분리 VP 그룹 (Disjoint Virtual Path Group, DVPG) 을 사용하는 상태 독립적 (State- independent) 방식으로 복구된다. ATM 망의 운용 및 보호 VP 할당과 용량 배정 문제를 정의하고 이를 바탕으로 최소의 비용을 갖는 VP 망을 설계한다. 망의 고장 시 기존 노드간의 VP 연결은 미리 할당된 링크 또는 노드 분리 보호 VP 경로를 따라 간단한 복구 알고리즘에 의해 빠르게 복구된다. QoS의 고려는 추가 비용을 필요로 하지만 정확한 이용자 연결의 복구를 실현하며, 분리 VP 그룹의 적용은 비용을 상승시키지만, 빠른 복구와 복수의 고장에 대처할 수 있는 방안이 된다.Abstract A cost evaluation of protection scheme for VP-based ATM network is presented here and its related characteristics are evaluated. The proposed and evaluated scheme is a state-independent restoration scheme using a disjoint path group. For fast and simple restoration of failed connections, link disjoint or node disjoint VP groups (DVPG) were utilized in this paper. A VP assignment and capacity planning problem is formulated. When failure occurs, the failed working VPs are switched to the protection VPs of disjoint path groups with a simple restoration scheme. And, cost evaluation and restoration characteristics are presented. The consideration of multiple QoS (Quality of Service) levels and disjoint path group protection scheme require additional network cost but acquire fit and fast restoration.

• Journal of Internet Computing and Services
• /
• v.8 no.1
• /
• pp.25-31
• /
• 2007

The development of efficient Quality of Service (QoS) routing algorithms in high speed networks is very difficult since divergent services require various quality conditions, If the QoS parameter we concern is to measure the delay on that link, then the routing algorithm obtains the Least Delay (LD) path, Meanwhile, if the parameter is to measure of the link cast, then it calculates the Least Cost (LC) path. The Delay Constrained Least Cast (DCLC) path problem of the mixed issues on LD and LC has been shown to be NP-hard. The path cost of LD path is relatively mere expensive than that of LC path, and the path delay of LC path is relatively higher than that of LD path in DCLC problem. In this paper. we propose the algorithm based on estimated path for the DCLC problem and investigate its performance, It employs a new parameter which is probabilistic combination of cost and delay, We have performed empirical evaluation that compares our proposed algorithm with the DCUR in various network situations.