• 한국통신학회논문지
• /
• 제25권12B호
• /
• pp.1996-2002
• /
• 2000

This paper investigates a priority scheme for IEEE 802.11 Carrier Sense Multiple Access/Collision Avoidance (CSMA/CA) protocol in order to provide short access times for priority frames (e.g. time-deadline traffic) even when the overall traffic on the wireless channel is heavy. Under the compatibility constraint for the IEEE 802.11 wireless LANs, two priority systems are simulated: no priority (current IEEE 802.11 standard) for time-deadline traffics and dynamic time-deadline priority. We evaluate algorithms to improve the time-deadline traffic performance using discrete event simulation (DES)

• 설비공학논문집
• /
• 제29권11호
• /
• pp.592-604
• /
• 2017

A chiller, having a thermal storage system, can contribute to load-leveling and can reduce the cost of electricity by using electricity at night. In this study, the control experiments and simulations are conducted using both conventional and advanced methods for the building cooling system. Advanced approaches, such as the "region control method", divide the control region into five zones according to the size of the building load, and determines the cooling capacities of the chiller and thermal storage. On the other hand, the "dynamic programming method" obtains the optimal cooling capacities of the chiller and thermal storage by selecting the minimum-cost path by carrying out repetitive calculations. The "thermal storage priority method" shows an inferior chiller performance owing to the low-part load operation, whereas the chiller priority method leads to a high electric cost owing to the low utilization of thermal storage and electricity at night. It has been proven that the advanced control methods have advantages over the conventional methods in terms of electricity consumption, as well as cost-effectiveness. According to the simulation results during the winter season, the electric cost when using the dynamic programming method was 6.5% and 8.9% lower than that of the chiller priority and the thermal storage priority methods, respectively. It is therefore concluded that the cost of electricity utilizing the region control method is comparable to that of the dynamic programming method.

• 한국음향학회지
• /
• 제19권8호
• /
• pp.3-11
• /
• 2000

음성의 특성은 지연에 매우 민감한 (delay-sensitive) 트래픽으로 시스템에서 손실에 민감한 (loss-sensitive) 다른 트래픽과 동일한 방식으로 서비스되어서는 두 트래픽 모두의 QoS (Quality of Service)를 만족시킬 수 없다. 효율적인 트래픽의 처리를 위해서는 시스템의 상태에 따라 손실에 민감한 트래픽에 영향을 적게 주면서 지연민감 트래픽의 성능도 만족하는 것이 바람직하다. 본 논문에서 도입한 동적우선권제어함수 (Dynamic Priority Control Function, DPCF)는 시스템의 상태에 따라 각 트래픽에 우선권을 동적으로 할당하여 서비스 스케줄링을 제어하는 함수f(·)로 기존의 우선권 제어방식을 더욱 일반화시킨 방식이다. 클래스 1의 손실민감 트래픽과 음성과 같은 클래스 2의 지연민감 트래픽을 수용하는 시스템에 TBPJ (Threshold-based Bernoulli Priority Jump) 방식의 DPCF을 적용하여 성능을 분석하였다. DPCF은 각 시스템에 대기하고 있는 트래픽의 양과 시스템의 가용 용량인 버퍼의 threshold에 따라 각 트래픽 클래스에 우선권을 동적으로 할당하여 서비스가 이루어지도록 한다. 성능분석을 통하여 TBPJ 제어방식이 기존의 우선권 제어 방식보다 성능 및 효율성에 있어서 우수함을 입증하였다. 즉 성능을 분석한 결과 손실민감 트래픽의 성능저하는 미미하고 지연민감 트래픽의 성능향상은 현저히 개선된 것을 확인하였다.

• ETRI Journal
• /
• 제24권5호
• /
• pp.360-372
• /
• 2002

In this paper, we propose the modified dynamic weighted round robin (MDWRR) cell scheduling algorithm, which guarantees the delay property of real-time traffic and also efficiently transmits non-real-time traffic. The proposed scheduling algorithm is a variation of the dynamic weighted round robin (DWRR) algorithm and guarantees the delay property of real-time traffic by adding a cell transmission procedure based on delay priority. It also uses a threshold to prevent the cell loss of non-real-time traffic that is due to the cell transmission procedure based on delay priority. Though the MDWRR scheduling algorithm may be more complex than the conventional DWRR scheme, considering delay priority minimizes cell delay and decreases the required size of the temporary buffer. The results of our performance study show that the proposed scheduling algorithm has better performance than the conventional DWRR scheme because of the delay guarantee of real-time traffic.

• 한국통신학회논문지
• /
• 제21권6호
• /
• pp.1470-1479
• /
• 1996

It was already proved that ATM has stability and flexibility of service applications, but because of the various characteristics of traffic and the QoS on user demandcaused by them, there are so many researches for traffic control method. In this paper, in order to give the more similar properties of the real traffic to the existing input traffic source, dividing them into four classes with different characteristics, and We proposed the integrated dynamic priority method, IDP which has advantages of the DMLT and the DQLT for time dynamic priority. Thus, it makes input queues about each of traffic classes and thresholds, and then use modified DMLT and DQLT methods. It has goal that proposed method to get more reliability and stability with advantage low loss of the DMLT, low delay of DQLT.

• ETRI Journal
• /
• 제32권3호
• /
• pp.422-429
• /
• 2010

We present guaranteed dynamic priority assignment schemes for multiple real-time tasks subject to (m, k)-firm deadlines. The proposed schemes have two scheduling objectives: providing a bounded probability of missing (m, k)-firm constraints and maximizing the probability of deadline satisfactions. The second scheduling objective is especially necessary in order to provide the best quality of service as well as to satisfy the minimum requirements expressed by (m, k)-firm deadlines. We analytically establish that the proposed schemes provide a guarantee on the bounded probability of missing (m, k)-firm constraints. Experimental studies validate our analytical results and confirm the effectiveness and superiority of the proposed schemes with regard to their scheduling objectives.

• 제어로봇시스템학회논문지
• /
• 제18권8호
• /
• pp.794-799
• /
• 2012

The international standard, ISO-11783, was designed for the communication within an agriculture machinery. Even if it is based on the CAN (Control Area Network) protocol, its extended features which include point-to-point communication and large data transmission support show different network performance from the standard CAN. This paper proposes a dynamic priority allocation method to improve the real-time performance of ISO-11783. Computer simulation shows reduction of the deadline-missed cases and community latency via proposed algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권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.

• 한국정보처리학회논문지
• /
• 제7권11S호
• /
• pp.3684-3693
• /
• 2000

본 논문에서는 다양한 트래픽을 수용해야 하는 차세대 인터넷에서 핵심적인 기능을 담당하는 고속 패킷스위치를 위한 동적우선권제어함수(Dynamic Priority Control Function)이 개념을 도입하고 TBPJ(Threshold-based Bernoulli Priority Jump) 방식에 대한 성능분석을 하였다. 동적우선권제어함수(Dynamic Priority Control Function)는 시스템의 상태에 따라 각 트래픽에 우선권을 동적으로 할당하여 패킷의 스케쥴링(scheduling)을 제어하는 함수 f(.)이다. 클래스 1의 손실민감(loss-sensitive) 트래픽과 클래스 2의 지연민감(delay-sensitive) 트래픽이 고속 패킷스위치의 모든 입력포트에 동일하게 입력되고 스위칭속도(switching capacity)가 m인 $N\timesN$용량의 고속 패킷스위치에 TBPJ 방식의 DPCF 함수를 적용하여 성능을 분석하였다. 이때 스위치는 유한한 크기의 입력 버퍼와 무한크기의 출력버퍼로 구성되어 있고 슬롯 단위로 동기방식(synchronous)으로 동작한다고 가정하였다. TBPJ 방식은 각 입력버퍼에 대기하고 있는 현재 트래픽의 양과 시스템 버퍼의 문턱값(threshold)에 따라 서비스 순위를 동적으로 할당하여 효율적인 스케쥴링이 이루어지도록 한다. 성능분석을 통하여 TBPJ 제어방식이 기존의 우선권 제어 방식보다 성능 및 효율성에 있어서 우수함을 입증하였다. 즉 TBPJ 방식을 적용하여 성능을 분석한 결과 손실민감 트래픽의 QoS(Quality of Service)를 만족시키기 위하여 패킷스위치를 스위치플랜으로 구현하는 경우 병렬로 (즉 m=2) 구성하면 충분하다는 것을 확인하였다.

• 한국정보처리학회논문지
• /
• 제6권11S호
• /
• pp.3251-3259
• /
• 1999

In this paper, we present a new mechanism applying more strict priority than RIO mechanism proposed as a drop precedence policy of AF classes in differentiated services. In this mechanism, applying strict priority to drop precedence policy, we get better performance on priority level. Simulation results indicate that the proposed mechanism may provide more efficient and more strict priority transmissions as compared to RIO regardless of traffic load.