• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11b
• /
• pp.1121-1124
• /
• 2003

스케줄링은 네트워크상의 공유된 자원을 보다 효과적으로 이용하기 위한 것으로서 delay, delay jitter, packet loss rate, throughput과 같은 서비스 값들의 QoA(Quality of Service)를 보장하기 위한 핵심 요소이다. 유선망에서의 스케줄링은 이미 익숙한 영역으로 많은 발전이 되어왔지만, 무선채널의 불안정성이나 사용자의 움직임으로 인해 발생하는 다양한 링크 에러율과 용량 때문에 무선망에서의 직접적용은 많은 문제를 일으키게 된다. 이 논문에서는 기존에 나와 있는 여러 무선 스케줄링 기법중 채널 보상 모델을 이용하여 서비스 차별화(Service Differentiation)와 공평성(Fairness)에 초점을 맞춘 QoS제공 성능향상 스케줄링 알고리즘을 제안하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.3
• /
• pp.971-989
• /
• 2015

With the development of cloud computing, more and more Web services are deployed on geo-distributed datacenters and are offered to cloud users all over the world. Through service composition technologies, these independent fine-grain services can be integrated to value-added coarse-grain services. During the composition, a number of Web services may provide the same function but differ in performance. In addition, the distribution of cloud datacenters presents a geographically dispersive manner, which elevates the impact of the network on the QoS of composite services. So it is important to select an optimal composition path in terms of QoS when many functionally equivalent services are available. To achieve this objective, we first present a graph model that takes both QoS of Web services and QoS of network into consideration. Then, a novel approach aiming at selecting the optimal composition path that fulfills the user's end-to-end QoS requirements is provided. We evaluate our approach through simulation and compare our method with existing solutions. Results show that our approach significantly outperforms existing solutions in terms of optimality and scalability.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.9
• /
• pp.4188-4206
• /
• 2016

Power control is widely used to reduce co-channel interference in wireless networks and guarantee the signal-to-interference plus noise ratio (SINR) of ongoing connections. This technique is also effective for wireless body area networks (WBANs). Although achieving satisfactory SINR is important for WBAN users, they may not be willing to achieve it at arbitrarily high power levels since power is a scarce resource in WBANs. Besides, for WBANs with different purposes, the QoS requirements and concern about the power consumption may be different. This motivates us to formulate the power control problem using the concepts from microeconomics and game theory. In this paper, the QoS objective is viewed as a utility function, which represents the degree of user satisfaction, while the power consumption is viewed as a cost function. The power control problem consequently becomes a non-cooperative multiplayer game, in which each player tries to maximize its net utility, i.e., the utility minus the cost. Within this framework, we investigate the Nash equilibrium existence and uniqueness in the game and derive the best response solution to reach the Nash equilibrium. To obtain the optimal transmission power in a distributed way, we further propose a utility-based and QoS-aware power control algorithm (UQoS-PCA). Tunable cost coefficient in UQoS-PCA enables this scheme to be flexible to satisfy diverse service requirements. Simulation results show the convergence and effectiveness of the proposed scheme as well as improvements over existing algorithm.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.10
• /
• pp.722-733
• /
• 2006

In scalable streaming application, there are two important knobs to tune to effectively exploit the underlying network resource and to maximize the user perceivable quality of service(QoS): layer selection and packet scheduling. In this work, we propose Semantics Aware Packet Scheduling (SAPS) algorithm to address these issues. Using packet dependency graph, SAPS algorithm selects a layer to maximize QoS. We aim at minimizing distortion in selecting layers. In inter-frame coded video streaming, minimizing packet loss does not imply maximizing QoS. In determining the packet transmission schedule, we exploit the fact that significance of each packet loss is different dependent upon its frame type and the position within group of picture(GOP). In SAPS algorithm, each packet is assigned a weight called QoS Impact Factor Transmission schedule is derived based upon weighted smoothing. In simulation experiment, we observed that QOS actually improves when packet loss becomes worse. The simulation results show that the SAPS not only maximizes user perceivable QoS but also minimizes resource requirements.

• Journal of information and communication convergence engineering
• /
• v.4 no.4
• /
• pp.141-146
• /
• 2006

In these days, wireless data services are becoming ubiquitous in our daily life because they offers several fundamental benefits including user mobility, rapid installation, flexibility, and scalability. Moreover, the requests for various multimedia services and the Quality of Service (QoS) support have been one of key issues in wireless data communications. Therefore the research relative to Medium Access Control (MAC) has been progressing rapidly. Especially a number of QoS-aware MAC schemes have been introduced to extend the legacy IEEE 802.11 MAC protocol which has not guaranteed any service differentiation. However, none of those schemes fulfill both QoS features and channel efficiency although these support the service differentiation based on priority. Therefore this paper studies a novel MAC scheme, referred to as Enhanced Distributed Coordination Function with Network Adaptation (EDCF-NA), for enhancements of both QoS and medium efficiency. It uses a smart factor denoted by ACK rate and Network Load Threshold (TH). In this paper, we study how the value of TH has effect on MAC performance and how the use of optimal TH pair improves the overall MAC performance in terms of the QoS, channel utilization, collision rate, and fairness. In addition, we evaluate and compare both the performance of EDCF-NA depending on several pairs of TH and the achievement of various MAC protocols through simulations by using Network Simulator-2 (NS-2).

• International Journal of Computer Science & Network Security
• /
• v.21 no.8
• /
• pp.342-352
• /
• 2021

Multicast Routings is a big challenge due to limitations such as node power and bandwidth Mobile Ad-hoc Network (MANET). The path to be chosen from the source to the destination node requires protocols. Multicast protocols support group-oriented operations in a bandwidth-efficient way. While several protocols for multi-cast MANETs have been evolved, security remains a challenging problem. Consequently, MANET is required for high quality of service measures (QoS) such infrastructure and application to be identified. The goal of a MANETs QoS-aware protocol is to discover more optimal pathways between the network source/destination nodes and hence the QoS demands. It works by employing the optimization method to pick the route path with the emphasis on several QoS metrics. In this paper safe routing is guaranteed using the Secured Multicast Routing offered in MANET by utilizing the Ant Colony Optimization (ACO) technique to integrate the QOS-conscious route setup into the route selection. This implies that only the data transmission may select the way to meet the QoS limitations from source to destination. Furthermore, the track reliability is considered when selecting the best path between the source and destination nodes. For the optimization of the best path and its performance, the optimized algorithm called the micro artificial bee colony approach is chosen about the probabilistic ant routing technique.

• 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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.10
• /
• pp.3361-3377
• /
• 2014

Synchronous computing models provided by real-time synchrony protocols, such as TTA [1] and PALS [2], greatly simplify the design, implementation, and verification of real-time distributed systems. However, their application to real systems has been limited since their assumptions on underlying systems are hard to satisfy. In particular, most previous real-time synchrony protocols hypothesize the existence of underlying fault tolerant real-time networks. This, however, might not be true in most soft real-time applications. In this paper, we propose a practical approach to a synchrony protocol, called Quality-Aware PALS (qPALS), which provides the benefits of a synchronous computing model in environments where no fault-tolerant real-time network is available. qPALS supports two flexible global synchronization protocols: one tailored for the performance and the other for the correctness of synchronization. Hence, applications can make a negotiation flexibly between performance and correctness. In qPALS, the Quality-of-Service (QoS) on synchronization and consistency is specified in a probabilistic manner, and the specified QoS is supported under dynamic and unpredictable network environments via a control-theoretic approach. Our simulation results show that qPALS supports highly reliable synchronization for critical events while still supporting the efficiency and performance even when the underlying network is not stable.

• Journal of Communications and Networks
• /
• v.6 no.1
• /
• pp.68-77
• /
• 2004

In the near future packet networks should support applications which can not predict their traffic requirements in advance, but still have tight quality of service requirements, e.g., guaranteed bandwidth, jitter, and packet loss. These dynamic characteristics mean that the sources can be made to modify their data transfer rates according to network conditions. Depending on the customer&; needs, network operator can differentiate incoming connections and handle those in the buffers and the interfaces in different ways. In this paper, dynamic QoS-aware scheduling algorithm is presented and investigated in the single node case. The purpose of the algorithm is in addition to fair resource sharing to different types of traffic classes with different priorities ?to maximize revenue of the service provider. It is derived from the linear type of revenue target function, and closed form globally optimal formula is presented. The method is computationally inexpensive, while still producing maximal revenue. Due to the simplicity of the algorithm, it can operate in the highly nonstationary environments. In addition, it is nonparametric and deterministic in the sense that it uses only the information about the number of users and their traffic classes, not about call density functions or duration distributions. Also, Call Admission Control (CAC) mechanism is used by hypothesis testing.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2018.10a
• /
• pp.133-135
• /
• 2018

In these days, providing flexible and personalized network services subject to customers' requirements becomes an interesting issue for network service providers. Moreover, because each network service provider own finite network resources and infrastructure, dynamic network provisioning is essential to leverage the limited network resources efficiently and effectively for supporting personalized network services. Recently, as the population of mobile devices increases, the location-awareness becomes as important as the QoS-awareness to provision a network service dynamically. In this paper, we propose a framework for providing location-aware dynamic network services. This framework includes the web user interface for obtaining customers' requirements such as locations and QoS, the network generator for mapping the requested locations and network infrastructure, the network path calculator for selecting routes to meet the requested QoS and the network controller for deploying a prepared network services into SDN(Software-Defined Networking) enabled network infrastructure.