• 전기의세계
• /
• v.24 no.5
• /
• pp.32-37
• /
• 1975

The use of a Microprocessor and PROM memories in an Electronic Loop Switching System has been described. The use provides telephone service for up to 128 subscriber lines using 32 trunks with increased reliability, maintenance capabilities, and flexibility. Date Communication between the central office terminal and the remote terminal is by FSK at 1-KHz rates over an idle trunk. Software functions and traffic handling capabilities are also described.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.487-490
• /
• 1998

In this paper, we describe a method for two-way communication service for smart phone integrated with pager which receive various kinds of Internet service information and pushes this information into smart phone to make it available for Internet assess. In this method, the server can push the status data of message boxes into the smart phone and it makes connection to the server automatically. The proposed method will make it possible to manage and excange the information and resources in an efficient manner during idle time, and will provide the potential capabilities of developing a variety of new Internet services for the system.

• East Asian mathematical journal
• /
• v.24 no.1
• /
• pp.45-55
• /
• 2008

We consider an M/G/1 queue with $P^M_{\lambda}$-service policy, which is a two-stage service policy. The server starts to serve with rate 1 if a job arrives to the sever in idle state. If the workload of the system upcrosses $\lambda$, then the service rate is changed to M and this rate continues until the system is empty. It costs to change the service rate to M and maintaining the rate. When the expectation of the stationary workload is supposed to be less than a given value, we derive the optimal value of M.

• Industrial Engineering and Management Systems
• /
• v.15 no.2
• /
• pp.123-130
• /
• 2016

We introduce a queueing system with general arrival stream and exponential service time under the N-policy, where customers may renege during idle period and arrival rates may vary according to the server's status. Probability distributions of the lengths of idle period and busy period are derived using absorbing Markov chain approach and a method to obtain the optimal control policy that minimizes long-run expected operating cost per unit time is provided. Numerical analysis is done to illustrate and characterize the method.

• Proceedings of the Korean Statistical Society Conference
• /
• 2002.05a
• /
• pp.61-66
• /
• 2002

We consider a generalized N-policy for an M/M/1 queueing system. The idle server starts to work with ordinary service rate when a customer arrives. If the number of customers in the system reaches N, the service rate gets faster and continues until the system becomes empty. Otherwise, the server finishes the busy period with ordinary service rate. We obtain the limiting distribution of the number of customers in the system. After assigning various operating costs to the system, we show that there exists a unique fast service rate minimizing the long-run average cost per unit time.

• Journal of Institute of Control, Robotics and Systems
• /
• v.6 no.8
• /
• pp.629-637
• /
• 2000

Unbalance between user requirements and insufficient network resources makes a congestion. In the future since the communication networks will have very heavy traffic congestion will be more serious. The ATM networks was recommended to support the B-ISDN service for the future multimedia communication. In thie sense of congestion avoidance and recovery the ABR service category in ATM networks allows the feedback flow control mechanism to dynamically allocate the idle bandwidth of the network to users fairly and to control the network congestion rapidly In this paper we introduce a congestion control scheme using systematical approach to confirm robust stability with respect to unknown round trip delay for the network which has both unicast and multicast connections.

• Journal of Korea Society of Industrial Information Systems
• /
• v.25 no.1
• /
• pp.89-99
• /
• 2020

In this paper, we consider a dyadic server control policy that combines workload control and single vacation. Customer arrives at the system with Bernoulli process, waits until his or her turn, and then receives service on FCFS(First come first served) discipline. If there is no customer to serve in the system, the idle single server spends a vacation of discrete random variable V. If the total service times of the waiting customers at the end of vacation exceeds predetermined workload threshold D, the server starts service immediately, and if the total workload of the system at the end of the vacation is less than or equal to D, the server stands by until the workload exceeds threshold and becomes busy. For the discrete-time Geo/G/1 queueing system operated under this dyadic server control policy, an idle period is analyzed and the steady-state queue length distribution is derived in a form of generating function.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11a
• /
• pp.412-414
• /
• 2005

무선 랜 표준인 IEEE 802.11은 원래 best effort service를 위해 탄생된 기술이기 때문에 QoS(Quality of Service)에 대한 연구가 부족했다. 무선 랜에서는 기존 유선 랜보다 한정된 자원과 희박한 bandwidth, 다양한 노드들의 채널 공유로 인해 QoS를 보장하기가 어렵다. 이를 보완하기 위한 연구가 IEEE 802.11e 워킹그룹에서 진행되고 있다. 본 논문에서는 충돌방지를 위한 CSMA/CA 알고리즘의 back-off값 설정을 매개변수를 두어 idle 시간을 조정함으로써 QoS를 보장하는 알고리즘을 제안한다. 특히, QoS가 요구하는 패킷전달 간격 임계값(threshold)에 따른 매개변수를 조절하여 contention window 크기를 달리 조정함으로써 QoS를 요구하는 노드들의 수에 상관없이 균일한 서비스 성능을 유지하도록 한다. 이 때, 매개변수 값의 선택은 QoS를 제공하는 노드들의 서비스 성능 뿐 아니라 best effort service만을 제공해도 되는 일반 노드들의 서비스 성능도 함께 고려할 수 있도록 하였다.

• Proceedings of the KSR Conference
• /
• 2005.05a
• /
• pp.1097-1100
• /
• 2005

This study explored the ridership pattern between Seoul and Busan after the introduction of KTX in 2004. Since the KTX opening, average daily passengers on the Kyungbu lines have increased. These figures clearly indicate that the transportation network is becoming railroad-centric. However, the operation. of the KTX will leave many existing Saemaul and Mugunghwa train sets idle, which will be put into operation for areas, not covered by the KTX. Statistics show that the railroad ridership is clarified the distinction between train service levels. So, our paper studied the change of market share by service levels between Seoul-Busan line which is a long distance route.

• Communications of the Korean Institute of Information Scientists and Engineers
• /
• v.5 no.2
• /
• pp.49-60
• /
• 1987

To decide on the queuing system of the optimum-sized bank window, data by means of simulation was reckoned. That is, by linking the average arrival rate and the average service rate with the exponential random number, customers' arrival time and service time was reckoned and simulation size optionally decided. By so doing, this paper is aimed at predicting the conditions of a bank, average arrival time, average waiting time, aveerage service time, average queuing length, servers' idle time, etd, and at preparing for a simulation model of the queuing system that can apply not only to the bank window box but also to all system under which queuing phenomena may arise.