• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.7A
• /
• pp.717-724
• /
• 2006

In order to maximize the throughput and provide the fairness between users in MIMO-OFDM system, FATM(fairness-aware throughput maximization) scheduling algorithm was proposed. In this paper, a QoS-aware scheduling algorithms for MINO-OFDM system are proposed, each of which is based on FATM. These scheduling algorithms aim to satisfy the different service requirements of various service classes. Three proposed QoS scheduling algorithms called SPQ (Strict Priority Queueing), DCBQ (Delay Constraint Based Queuing), HDCBQ (Hybrid Delay Constraint Based Queuing) are compared through computer simulations. It is shown that HDCBQ algorithm outperforms other algorithms in satisfying different requirements of various service classes.

• The Journal of Engineering Research
• /
• v.3 no.1
• /
• pp.85-95
• /
• 1998

In this study, we consider a recursive procedure to obtain the stationary probability distribution for analyzing Coxian queueing networks with finite queues. This network deals with multiple class customers. Due to the state space representing multiple class customers, the sub-matrices corresponding to states can not be square matrices and can not be inverted. Therefore, we introduce more complex recursive method to avoid the singular problem. The open queueing network that we study consists of 3 parallel first-level sources linked to a single second level queue. We consider two types of schemes for entering a queue. The first scheme is assumed to be the first-blocked-first-enter (FBFE) and the second scheme is the higher-priority-first-enter (HPFE). Arrival and service times are assume to have a Coxian distribution with two phases. Comparison between the resulting using Gauss-Seidel method and recursive procedure will be shown.

• Journal of the Korea Society of Computer and Information
• /
• v.5 no.4
• /
• pp.82-89
• /
• 2000

This study analyzes the cell loss probability of an ATM multiplexer with real time and non-real time bursty traffics. It is assumed that an ATM multiplexer with loss priority control for the analysis. The loss priority control uses the CLP Reld of cell header. For easy analysis and less computation. the multiplexed traffic of the ATM multiplexer was modeled by the MMDP. The ATM multiplexer is simulated by the MMDP/MMDP/l/K queueing system. From the above results, The connection admission of an ATM multiplexer with loss priority control is determined by the cell loss probability with low priority as well as the size of threshold buffer. Therefore, to increase the statistical multiplexing gain it will be good to utilize the loss priority control in order.

• Journal of Korean Port Research
• /
• v.14 no.1
• /
• pp.27-35
• /
• 2000

In Pusan Harbour, new port development projects are implemented such as the Extended Terminal adjacent to the Gamman Terminal, Pusan New Port, the Navy $\bigcirc$$\bigcirc$ piers, etc. which will require new marine traffic environments in the Passage I of Pusan Harbour. Specially, the turning basin of the Extended Terminal adjacent to the Gamman Terminal has been designed to overlay the Passage I of Pusan Harbour, which will interrupt the inbound traffic flow and the results will be worried to decrease the efficiency of port operation. Therefore, this paper will be aimed to evaluate the traffic congestion in the Pusan Passage I due to the opening of new ports within Pusan Harbour in 2006 and 2011 by using computer simulation based the queueing theory.

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

• Proceedings of the IEEK Conference
• /
• 2003.07a
• /
• pp.637-640
• /
• 2003

본 논문은 리눅스를 내장하며, 다양한 인터페이스와 서비스 어플리케이션을 갖는 홈게이트웨이 시스템에서 리얼타임 서비스를 보장하며, 각 서비스 클래스에 대한 공정성을 보장하는 동적 우선순위 큐잉에 관한 연구이다. 기존의 리눅스에서는 동일한 우선순위를 부여함으로써 리얼타임 서비스에 대한 보장을 지원하지 못한다. 또한 리얼타임 서비스에 정적인 우선순위를 부여한다면 비리얼타임 서비스의 지연이 크게 되거나 서비스를 받지 못하는 기아현상이 발생한다. 본 논문에서는 일반 리눅스 커널에 리얼타임 리눅스 커널을 포팅하고, 리얼타임 커널에 큐잉엔진을 구현한다. 큐잉엔진은 동적 우선순위를 부여하고 리얼타임 스케줄러에 의해 처리되도록 함으로써, 리얼타임 서비스을 보장하고, 비리얼타임 서비스의 기아현상을 제거하며, 각 응용 서비스 클래스에 대한 서비스 공정성을 보장함으로써, 홈게이트웨이 시스템의 성능을 향상 시킨다.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.31A no.6
• /
• pp.9-17
• /
• 1994

ATM (Asynchronous Transfer Mode) has a fixed-length packet transport scheme. It is one of the promising proposals in B-ISDN.Since the packet length is fixed, it can be potentially to perform the various service to users. In this paper, a queueing model for an ATM multip`exer loaded by CBR and ON/OFF input sources is considered, and the two-queue system which each type of input sources has a queue with a finite capacity is analyzed. The cell loss probabilities for a performance measures of ATM multiplexer are derived, and are also evaluated through numerical examples. As a result, the cell loss probability of ON/OFF sources for the queue size is rapidly decreased when the multiplexed number and burstiness are increased. Since cells of the CBR source have lower priority than cells of the ON/OFF source, cell loss probabilities of CBR sources are accordingly high independently of CBR cell arrival rate when the number of CBR sources is large.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1995.04a
• /
• pp.729-738
• /
• 1995

We consider a priority-based packet-switching system with three phases of the packet transmission time. Each packet belongs to one of several priority classes, and the packets of each class arrive at a switch in a Poison process. The switch transmits queued packets on a priority basis with three phases of preemption mechanism. Namely, the transmission time of each packet consists of a preemptive-repeat part for the header, a preemptive-resume part for the information field, and a nonpreemptive part for the trailer. By an exact analysis of the associated queueing model, we obtain the Laplace-Stieltjes transform of the distribution function for the delay, i.e., the time from arrival to transmission completion, of a packet for each class. We derive a set of equations that calculates the mean response time for each class recursively. Based on this result, we plot the numerical values of the mean response times for several parameter settings. The probability generating function and the mean for the number of packets of each class present in the system at an arbitrary time are also given.

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