• Convergence Security Journal
• /
• v.7 no.2
• /
• pp.39-47
• /
• 2007

The scheduling algorithms to provide quality of service (QoS) in broadband convergence network (BcN) are compared and analysed. The main QoS management methods such as traffic classification, traffic processing in the input queue and weighted queueing are first analysed, and then the major scheduling algorithms of round robin, priority and weighted round robin under recently considering for BcN to supply real time multimedia communications are analysed. The simulation results by NS-2 show that the scheduling algorithm with proper weights for each traffic class outperforms the priority algorithm.

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

In this thesis, we propose a Speed Accommodation Priority Algorithm Scheme(SPAS) and Traffic Control Model Scheme (TCMS) to satisfy a desired handoff dropping probability and to reduce the blocking probability of new calls using mobility characteristics and handoff rate in mobile communication networks. The guard channels below threshold can guarantee the Quality of Service(QoS) in terms of the request handoff dropping probability and the guard channels above the threshold can be used to handle high priority new calls and high priority handoff calls. When the ratio of the handoff call arrival rate is less then the ratio of the new call arrival rate, the proposed method can guarantee the new call better than the previous guard channel scheme.

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

Diverse multimedia services will be deployed at hand on 3G-and-beyond multi-service CDMA systems in order to satisfy different quality of service (QoS) according to traffic types. In order to use appropriate resources efficiently the call admission control (CAC) as a major resource control mechanism needs to be used to take care of efficient utilization of limited resources. In this paper, we propose a QoS-aware CAC (QCAC) that is enabled to provide service fairness and service differentiation in accordance with priority order and that applies the different thresholds in received power considering different QoS requirements such as different bit error rates (BER) when adopting total received power as the ceil load estimation. The proposed QCAC calculates the different thresholds of the different traffic types based on different required BER applies it for admission policy, and can get service fairness and differentiation in terms of call dropping probability as a main performance metric. The QCAC is aware of the QoS requirement per traffic type and allows admission discrimination according to traffic types in order to minimize the probability of QoS violation. Also the CAC needs to consider the resource allocation schemes such as complete sharing (CS), complete partitioning (CP), and priority sharing(PS) in order to provide fairness and service differentiation among traffic types. Among them, PS is closely related with the proposed QCAC having differently calculated threshold per each traffic type according to traffic priority orders.

• Journal of Korea Multimedia Society
• /
• v.6 no.7
• /
• pp.1219-1230
• /
• 2003

We analyze an integrated voice/data CDMA system, where the whole channels are divided into voice prioritized channels and voice non-prioritized channels. For real-time voice service, a preemptivc priority is granted in the voice prioritized channels. And, for delay-tolerant data service, the employment of buffer is considered. On the other hand, the transmission permission probability in best-effort packet-data service is controlled by estimating the residual capacity available for users. We build a 2-dimensional markov chain about prioritized-voice and stream-data services and accomplish numerical analysis in combination with packet-data traffic based on residual capacity equation.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.7 no.1
• /
• pp.101-114
• /
• 2008

Ubiquitous City (u-City) and Intelligent Transport System (ITS) provide services, which are different from each other yet have close relation to each other partially. Thus, since a redundancy issue occurs or it is difficult to efficiently provide services depending on the relation degree, it is required to analyze the relation of services between the two systems and to elicit a priority. A table of relation among the services was created and the relation degree was analyzed by performing a survey for experts. As a result of calculating the total marks by accumulating and summing up the survey results, the incident management service and u-accident/calamity and disaster service of the ITS had the lowest value. The project priority was as follows: The basic principle of the project was that services with high relation degrees shall be worked on first. The services were categorized in each step and packaging the services could result in the synergy effect. This study is significant since it analyzed the relation degree between u-City and ITS and proposed schemes for efficiently working on the project by eliciting the priority of the services based on the analysis results.

• Journal of KIISE:Information Networking
• /
• v.33 no.1
• /
• pp.103-112
• /
• 2006

Priority-based network service has been widely adopted for the Internet traffic management in the context of IETF differentiated services, and computing optimal prices for such priority-based service is the key topic in many pricing literature. While the equilibrium analysis has been commonly used to this end, many have criticized the validity of the underlying assumption of equilibrium analysis that user utility functions are precisely known. In this paper, we propose a solution for bridging the gap between the existing theoretical work on optimal pricing and the unavailability of precise user utility information in real networks. In the proposed method, the service provider obtains more and more accurate estimates of user utility functions from the initial imprecise knowledge by iteratively changing the price of service levels and observing the users' decisions under the changed price. Our contribution is two-fold. First, we have developed a general principle for estimating the user utility functions. Second, we have developed a novel method for setting the prices that can optimize the extraction of the knowledge about user utility functions. The extensive simulation results demonstrate the effectiveness of our method.

• Journal of the Korea Society for Simulation
• /
• v.18 no.4
• /
• pp.207-217
• /
• 2009

We propose a two-stage Distributed Denial of Service (DDoS) defense system, which can protect a given subnet by serving existing flows and new flows with a different priority based on IP history information. Denial of Service (DoS) usually occurs when the resource of a network node or link is limited and the demand of the users for that resource exceeds the capacity. The objective of the proposed defense system is to provide continued service to existing flows even in the presence of DDoS attacks. The proposed scheme can protect existing connections effectively with a smaller memory size by reducing the monitored IP address set through sampling and per-prefix history management. We evaluate the performance of the proposed scheme through simulation.

• The Journal of the Korea Contents Association
• /
• v.17 no.8
• /
• pp.152-161
• /
• 2017

This study aims to analyze what is necessary for realization of convergence smart city service, and what is the priority order for it. First, the concept is set up through the theoretical review about convergence smart city service. Second, conduct in-depth interviews with smart-city related experts and derive the necessary elements to implement convergence smart city service. Third, derive priorities by subdividing the derived elements and utilizing the AHP method. The result of this study is expected to contribute to the development of convergence smart city service by deriving what should be considered for implementation of convergence smart city service.

• Journal of Communications and Networks
• /
• v.7 no.3
• /
• pp.313-324
• /
• 2005

The success of the IEEE 802.11 standard has prompted research into efficiency of the different medium access methods and their support for different traffic types. A modified version of the point coordination function (PCF) called modified PCF has been introduced as a way to improve the efficiency over the standard method. It has been shown through a simulation study and a mathematical analysis that channel utilization can be much improved compared to the standard, in case there is no so-called hidden station problem. However, under the hidden station problem, the efficiency of the modified PCF would obviously decrease. In this paper, some enhancements of the modified PCF are introduced. Firstly, we propose a retransmission process to allow frames involved in collisions to be retransmitted. Then, we propose a collision resolution mechanism to reduce the frame collision probability due to the hidden station problem. In addition, we propose a priority scheme to support prioritization for different traffic types such as interactive voice and video, and real-time data traffic in the modified PCF. To prevent the starvation of one low priority traffic, minimum transmission period is also guaranteed to each traffic type via an admission control algorithm. We study the performance of the modified PCF under the hidden station problem and the performance of the modified PCF with priority scheme through simulations. To illustrate the efficiency of the priority scheme, we therefore compare its simulation results with those of some standardized protocols: The distributed coordination function (DCF), the enhanced distributed channel access (EDCA), the PCF, and our previously proposed protocol: The modified PCF without priority scheme. The simulation results show that the increment of delay in the network due to the hidden station problem can be reduced using the proposed collision resolution mechanism. In addition, in a given scenario the modified PCF with priority scheme can provide better quality of service (QoS) support to different traffic types and also support a higher number of data stations than the previous proposals.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.9
• /
• pp.4103-4121
• /
• 2018

Quality of Service (QoS) awareness is recognized as a key point for the success of Internet of Things (IOT).Realizing the full potential of the Internet of Things requires, a real-time task scheduling algorithm must be designed to meet the QoS need. In order to schedule tasks with diverse QoS requirements in cloud environment efficiently, we propose a task scheduling strategy based on dynamic priority and load balancing (DPLB) in this paper. The dynamic priority consisted of task value density and the urgency of the task execution, the priority is increased over time to insure that each task can be implemented in time. The scheduling decision variable is composed of time attractiveness considered earliest completion time (ECT) and load brightness considered load status information which by obtain from each virtual machine by topic-based publish/subscribe mechanism. Then sorting tasks by priority and first schedule the task with highest priority to the virtual machine in feasible VMs group which satisfy the QoS requirements of task with maximal. Finally, after this patch tasks are scheduled over, the task migration manager will start work to reduce the load balancing degree.The experimental results show that, compared with the Min-Min, Max-Min, WRR, GAs, and HBB-LB algorithm, the DPLB is more effective, it reduces the Makespan, balances the load of VMs, augments the success completed ratio of tasks before deadline and raises the profit of cloud service per second.