• The Journal of the Korea institute of electronic communication sciences
• /
• v.15 no.6
• /
• pp.1099-1104
• /
• 2020

In order to provide various types of application services based on the Internet, it is ideal to guarantee the quality of service(QoS) for each flow. However, realizing these ideas is not an easy task.. It is effective to classify multiple flows having the same or similar service quality requirements into same group, and to provide service quality for each group. The queue management mechanism in the router plays a very important role in order to efficiently transmit data and to support differentiated quality of service for each service. In order to efficiently support various multimedia services, an intelligent and adaptive queue management mechanism is required. This paper proposes an intelligent queue management mechanism based on deep reinforcement learning that decides whether to deliver packets for each group based on the traffic information of each flow group flowing in for a certain period of time and the current network state information.

• Journal of Korean Institute of Industrial Engineers
• /
• v.27 no.4
• /
• pp.374-378
• /
• 2001

We present a discrete-time version of the distributional Little's law, of which the continuous-time version is well known. Then we extend it to the queue in which two or more customers may depart at the same time. As a demonstration, we apply this law to various discrete-time queues such as the standard Geom/G/1 queue, the Geom/G/1 queue with vacations, the multi-server Geom/D/c queue, and the bulk-service Geom/$G^b$/1 queue. As a result, we obtain the probability generating functions of the numbers in system/queue and the waiting times in system/queue for those queues.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.18 no.3
• /
• pp.179-186
• /
• 1993

We derive the arbitrary time point system size distribution of M/ $G^{B}$1 queue in which late arrivals are not allowed to join the on-going service. The distribution is given by P(z) = $P_{4}$(z) $S^{*}$ (.lambda.-.lambda.z) where $P_{4}$ (z) is the probability generating function of the queue size and $S^{*}$(.theta.) is the Laplace-Stieltjes transform of the service time distribution function. We also derive the distribution of the service siez at arbitrary point of time. time.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.525-528
• /
• 2000

According to the development of B-ISDN on ATM network, the uses of Multimedia service is growing. Although ABR service uses the network resource most effectively because it is able to change the transfer rate, it is not used for multimedia service until recently. In this paper, we set priority queue and non-priority queue in the ATM switch and each queue has threshold so is can be adopted in different transfer rate method. We propose the real-time traffic transfer method over ABR service based on an effective traffic control method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.5B
• /
• pp.942-955
• /
• 2000

This paper proposes enhanced designs of global service logic and information flow for the mass-call based IN service, which increase call completion rates and optimize the resource in joint wired and wireless networks. In order to hanve this logic implemented, we design a Dynamic Queue Manager(DQM) applied to the call queuing service feature in the Service Control Point(SCP). In order to apply this logic to wireless service subscribers as well as wired service subscribers, the service registration flags between the Home Location Register(HLR) and the SCP are managed to notify the DQM of the corresponding service subscribers’ mobility. Hence, we present a dynamic queue management mechanism, which dynamically manages the service group and the queue size based on M/M/c/K queueing model as the wireless subscribers roam the service groups due to their mobility characteristics. In order to determine the queue size allocated by the DQM, we simulator and analyze the relationship between the number of the subscriber’s terminals and the drop rate by considering the service increment rate. The appropriate waiting time in the queue as required is simulated according to the above relationship. Moreover, we design and implement the DQM that includes internal service logic interacting with SIBs(Service Independent building Blocks) and its data structure.

• Journal of the Chungcheong Mathematical Society
• /
• v.25 no.4
• /
• pp.747-752
• /
• 2012

When the service time distribution has a finite exponential moment, we present a large deviations result for the busy period distribution in the M/G/1 queue without the assumption of Abate and Whitt (1997) and Kyprianou (1971).

• Journal of Korean Institute of Industrial Engineers
• /
• v.22 no.3
• /
• pp.377-385
• /
• 1996

We present an approximate algorithmic approach for the m-server fork-join queueing system with infinite queue capacity. We analyze the system size and queue waiting time. We assume Poisson arrival process and independent exponential service times.

• Proceedings of the Korean Statistical Society Conference
• /
• 2004.11a
• /
• pp.295-300
• /
• 2004

We consider a G/M/1 queue with two-stage service policy. The server starts to serve with rate of ${\mu}1$ customers per unit time until the number of customers in the system reaches A. At this moment, the service rate is changed to that of ${\mu}2$ customers per unit time and this rate continues until the system is empty. We obtain the stationary distribution of the number of customers in the system.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2023.07a
• /
• pp.273-274
• /
• 2023

본교에서 강의실, 회의실 등 공용공간을 사용하기 위해서는 사용자가 수기로 양식을 작성하여 제출하고 담당자가 처리해야 한다. 이 방식은 사용자가 사용하고자 하는 공간의 예약 현황을 확인할 수 없고, 사용신청 과정에서 직접 담당자를 찾아가야 한다는 불편함이 따른다. 본 연구에서는 이러한 불편함을 개선하기 위하여 마이크로 서비스 아키텍처 기반의 공간 예약 웹서비스를 구현한다.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.2
• /
• pp.1-9
• /
• 1998

ATM was adopted as the switching and multiplexing technique for BISDN which aims at transmitting traffics with various characteristics in a unified network. To construct these ATM networks, the most important aspect is the design of the switching system with high performance and different service capabilities. In this paepr, we analyze the performance of an input and output queueing switch with preemptive priority which is considered to be most suitable for ATM networks. For the analysis of an input queue, we model each input queue as two separate virtual input queues for each priority class and we approximage them asindependent Geom/Geom/1 queues. And we model a virtual HOL queue which consists of HOL cells of all virtual input queues which have the same output address to obtain the mean service time at each virtual input queue. For the analysis of an output quque, we obtain approximately the arrival process into the output queue from the state of the virtual HOL queue. We use a Markov chain method to analyze these two models and obtain the maximum throughput of the switch and the mean queueing delay of cells. and analysis results are compared with simulation to verify that out model yields accurate results.