• ETRI Journal
• /
• v.39 no.4
• /
• pp.558-569
• /
• 2017

In this study, a non-preemptive M/G/1 queueing model of a spectrum handoff scheme for cognitive wireless networks is proposed. Because spectrum handoff gives secondary users an opportunity to carry on their transmissions, it is crucially important to determine the actions of primary users. In our queueing model, prioritized data traffic is utilized to meet the requirements of the secondary users. These users' packets are categorized into three different priority classes: urgent, real-time, and non-real time. Urgent data packets have the highest priority, while non-real time data packets have the lowest priority. Riverbed (OPNET) Modeler simulation software was used to simulate both reactive and proactive decision spectrum handoff schemes. The simulation results were consistent with the analytical results obtained under different load and traffic conditions. This study also revealed that the cumulative number of handoffs can be drastically decreased by exploiting priority classes and utilizing a decent spectrum handoff strategy, such as a reactive or proactive decision-based strategy.

• The Journal of the Korea Contents Association
• /
• v.12 no.8
• /
• pp.69-76
• /
• 2012

This paper proposes an efficient power consumption scheme using sleep mode in home gateway. The scheme by this paper classifies incoming real time packet and non-real time packet in home gateway and delay non-real time packet. Therefore, the home gateway can have longer sleep time because non-real time packet can get additional delay time by proposing mechanism using timer. We use non-preemptive two priority queueing model for performance analysis. As a results, we verify that power consumption of proposed scheme is reduced more than existing scheme by delay of non-real time traffic.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.15 no.7
• /
• pp.602-617
• /
• 1990

In this paper, we analyze the performance of D-channel access protocol at the S-reference point for the ISDN user network interface recommended by CCITT. For the case of multipoint access to D-channel, a queueing model of D-channel access protocol is proposed. The delay is analyzed by decomposing it into waiting queue delay and contention delay. The contention delay is decomposed further into vain contention delay and pure contention delay so the analysis of the priority queueing system with symmetrical and asymmetrical arrival rates may be applied. The numerical results obtained are compared with the results of the single station queueing system served by the non-preemptive priority.

• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.1
• /
• pp.141-149
• /
• 1999

In this paper, we consider multiple-class queueing systems in which the server starts a set-up as soon as the number of customers in the "start-up class" reaches threshold N. After the set-up the server starts his service. We obtain the Laplace-Stieltjes transform and the mean of the waiting times of each class of customers for FCFS and non-preemptive priority disciplines.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.05a
• /
• pp.244-246
• /
• 2003

We consider an AS/RS(Automated Storage/ Retrieval System) which performs single and dual commands. In this paper, we also assume that the service times of single and dual commands are differently distributed. We transform the arrival rates of storage and retrieval commands into those of single and dual commands. Using this, we propose a non-preemptive queueing model with priority for the performance analysis of a AS/RS, and obtain approximated means of queue lengths and sojourn times.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.25 no.5
• /
• pp.31-38
• /
• 2002

In this paper, we model a two-server queueing system with priority, to which we put a restriction on the number of servers for each customer class. customers are divided into two different classes. Class 1 customers have non-preemptive priority over class 2 customers. They are served by both servers when available but class 2 customers are served only by a designated server. We use a method of generating function depending on the state of servers. We find the generating function of the number of customers in queue, server utilization, mean queue length and mean waiting time for each class of customers.

• Journal of Korean Society for Quality Management
• /
• v.31 no.3
• /
• pp.114-125
• /
• 2003

In this paper, we deal with the problem of modeling of agent-based robot manufacturing cell. Its role is becoming increasingly important in automated manufacturing systems. For Object Oriented & Queueing Petri Nets (OO&QPNs), an extended formalism for the combined quantitative and qualitative analysis of different systems is used for structure and performance analysis of mobile robotic cell. In the case study, the OO&QPN model of a mobile robotic cell is represented and analyzed, considering multi-class parts, non-preemptive priority and alternative routing. Finally, the comparison of performance values between Shortest Process Time (SPT) rule and First Come First Serve (FCFS) rule is suggested. In general, SPT rule is most suitable for parts that have shorter processing time than others.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.27 no.3
• /
• pp.26-30
• /
• 2004

We consider an AS/RS(Automated Storage/ Retrieval System) which performs both of single and dual commands. The service times of single and dual commands are assumed to be differently distributed. Steady-state probabilities at the service completion epochs are calculated. Then, we transform the arrival rates of storage and retrieval commands into those of single and dual commands. Using this, we propose a non-preemptive queueing model with priority for the performance analysis of an AS/RS, and obtain approximated means of queue lengths and waiting times.

• Journal of the military operations research society of Korea
• /
• v.2 no.1
• /
• pp.177-184
• /
• 1976

As the organizational size of a military service or business increases and its management becomes complex, the success in its management depends less on static type of management but more on careful, dynamic type of management. In this thesis, an operations research technique is applied to the problems of determining optimal air traffic control rule and of optimal capacity of air base for a military air base. An airport runway is regarded as the service facility in a queueing mechanism, used by landing, low approach, and departing aircraft. The usual order of service gives priority different classes of aircraft such as landings, departures, and low approaches; here service disciplines are considered assigning priorities to different classes of aricraft grouped according to required runway time. Several such priority rules are compared by means of a steady-state queueing model with non-preemptive priorities. From the survey conducted for the thesis development, it was found that the flight pattern such as departure, law approach, and landing within a control zone, follows a Poisson distribution and the service time follows an Erlang distribution. In the problem of choosing the optimal air traffic control rule, the control rule of giving service priority to the aircraft with a minimum average waiting cost, regardless of flight patterns, was found to be the optimal one. Through a simulation with data collected at K-O O Air Base, the optimal take-off interval and the optimal capacity of aircraft to be employed were determined.

• Proceedings of the Society of Korea Industrial and System Engineering Conference
• /
• 2002.05a
• /
• pp.133-138
• /
• 2002

In this paper, we model a two-server queueing system with priority, to which we put a restriction of the number of servers for each customer class. A group of customers is divided into two different classes. The class 1 customers has non -preemptive priority over class 2 customers. We use the method of PGF depending on the state of server We find the PGF of the number of customers in queue, server utilization, mean queue length and mean waiting time for each class of customers.