• ETRI Journal
• /
• v.28 no.3
• /
• pp.371-374
• /
• 2006

We propose and analyze a priority queuing scheme that gives priority in the same class of calls according to their total resource requirements (TRRs). The proposed scheme gives a higher priority to the calls that have a lower TRR over the calls that have a higher TRR. The numerical results show that the proposed priority queuing scheme provides better performance than the traditional queuing schemes in call blocking probability.

• Journal of Korea Multimedia Society
• /
• v.10 no.12
• /
• pp.1622-1631
• /
• 2007

To realize the wireless packet scheduler which efficiently considers both the effect of adaptive modulation and coding (AMC) scheme due to variable wireless communication channel information from physical layer and the QoS differentiation of multimedia services from internet protocol (IP) layer, this paper proposes a new downlink AMC-based priority queuing (APQ) scheduler which combines AMC scheme and service priority method in multimedia services at the same time. The result of numerical analysis shows that the proposed APQ algorithm plays a role in increasing the number of services satisfying the mean waiting time requirements per each service in multimedia services because the APQ scheme allows the mean waiting time of each service to be reduced much more than existing packet scheduler having only user selection processor.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.2
• /
• pp.459-466
• /
• 1999

I broadband ISDN every packet will show different result if it would be processed according to its usage by the server. That is, normal data won't show big differences if they would be processed at normal speed. But it will improve the quality of service to process some kinds of data - for example real time video or voice type data or some data for a bid to by something through the internet - more fast than the normal type data. solution for this problem was suggested - priority packets. But the analyses of them are under way. Son in this paper a switching system for an output queuing model in a single server was assumed and some packets were given priorities and analysed. And correlation, simulating real life situation, was given too. These packets were analysed through three cases, first packets having no correlation, second packets having only correlation and finally packets having priority three cases, first packets having no correlation, second packets having only correlation and finally packets having priority and correlation. The result showed that correlation doesn't affect the mean delay time and the high priority packets have improved mean delay time regardless of the arrival rate. Those packets were assumed to be fixed-sized like ATM fixed-sized cell and the contention strategy was assumed to be short bus contention method for the output queue, and the mean delay length and the maximum 버퍼 length not to lose any packets were analysed.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.231-233
• /
• 2004

Queuing is waiting lines which play routing service when packet entered. Queuing is decide how and whom is going to provide priority service. This is kind of first in first out(FIFO) or weighted fair queuing(WFQ) method. In this study, UDP design using WFQ way to serve to provide service evenly and rapidly in network. Also in actuality internet, datagram analyzed by packet captured. Queuing services through the requesting port number, input, output, output queuing creation & delete, message request by internet control message protocol(ICMP). Queuing designed in control block module, input queues, input/output module composition. In conclusion, I have confirm queuing result of WFQ method by the datagram information analyzed.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10c
• /
• pp.405-407
• /
• 1999

WFQ(Weighted Fair Queuing)은 지연이나 공평성의 특성에 있어서 이상적인 트래픽 스케줄링 알고리즘으로 간주되었다. N세션에 서비스를 제공하는 WFQ 스케줄러의 스케줄링 연산은 각 패킷 전송 시간당 O(n)의 계산 복잡도를 가지며, 구현 또한 복잡하다. Self-Clocked Fair Queuing과 같은 WFQ 알고리즘의 구현을 간단히 하고자 하는 노력은 지연범위나 특성에 영향을 주게 되어 다양한 트래픽이 제공되는 경우 각 트래픽의 공평성을 지원해주지 못한다. 그러므로 지연이나 지연 변이 측면에서 공평성을 지원하고 구현상의 계산 복잡도를 줄인 스케줄링 알고리즘이 필요하게 되었다. ATM 다중화기의 셀 스케줄링 알고리즘 역시, ATM의 특성상 다양한 특성의 서비스를 제공하기 위해서, 다양한 특성의 트래픽에 대한 공평성을 제공하는 새로운 알고리즘의 연구가 필요하다. 이 논문에서는 ATM 스위치 내의 다중화기에서 사용되는 새로운 셀 스케줄링 알고리즘을 제안하고 실험을 통해 이 알고리즘의 성능을 검증하고자 한다. 이 알고리즘은 여러 개의 우선 순위 큐를 갖고, 각 우선순위 큐마다 스케줄링 연산이 O(1)의 계산 복잡도를 갖는 Parallel Priority Queuing 알고리즘이다.

• Industrial Engineering and Management Systems
• /
• v.12 no.3
• /
• pp.274-280
• /
• 2013

This paper proposes a space merging approach to studying the queuing models with finite buffers and jump priorities. Upon the arrival of a call with low priority, one call of such kind is assumed to be transferred to the end of the queue of high priority calls. The transfer probabilities depend on the state of the queue of the heterogeneous calls. We developed the algorithms to calculate the quality of service metrics of such queuing models, and the results of the numerical experiments are shown.

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

• Journal of Communications and Networks
• /
• v.13 no.3
• /
• pp.286-297
• /
• 2011

A novel converged optical network unit (ONU)-base station (BS) architecture has been contemplated for next-generation optical-wireless networks. It has been demonstrated through high quality studies that data traffic carried by both wired and wireless networks exhibit self-similar and long range dependent characteristics; attributes that classical teletraffic theory based on simplistic Poisson models fail to capture. Therefore, in order to apprehend the proposed converged architecture and to reinforce the provisioning of tightly bound quality of service (QoS) parameters to end-users, we substantiate the analysis of the QoS behavior of the ONU-BS under self-similar and long range dependent traffic conditions using custom queuing which is a common queuing discipline. This paper extends our previous work on priority queuing and brings novelty in terms of presenting performance analysis of the converged ONU-BS under realistic traffic load conditions. Further, the presented analysis can be used as a network planning and optimization tool to select the most robust and appropriate queuing discipline for the ONU-BS relevant to the QoS requirements of different applications.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.3B
• /
• pp.232-238
• /
• 2006

We propose a novel call admission control scheme which improves the handoff drop and the new call block probabilities of high priority services, minimizing the negative impact on low priority services, in multimedia service cellular networks. This paper proposes three schemes to solve this problem; the packing scheme in which available channels of a cell distributed to each frequency channel are concentrated on one frequency channel and a high transmission rate service is assigned to the frequency channel; the queuing scheme in which the queue is used for high transmission rate calls; and the power reallocation scheme in which the power assigned to calls under service is temporarily reduced and a high transmission rate service is allowed. The simulation results revealed that our scheme improved the drop and the block probabilities of the high priority services compared with the conventional scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.10A
• /
• pp.877-885
• /
• 2005

The Home Phoneline Networking Alliance (HomePNA) 2.0 technology can establish a home network using existing in-home phone lines, which provides a channel rate of 4-32 Mbps. HomePNA 2.0 Medium Access Control(MAC) protocol adopts an IEEE 802.3 Carrier Sense Multiple Access with Collision Detection (CSMA/CD) access method, Quality of Service(QoS) algorithm, and Distributed Fair Priority Queuing(DFPQ) collision resolution algorithm. In this paper, we propose some mathematical models about the important elements of HomePNA 2.0 MAC protocol performance, which are Saturation Throughput, Packet Delay and Packet Jitter. Then, we present an overall performance analysis of HomePNA 2.0 MAC protocol along with simulations.