• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.1
• /
• pp.103-112
• /
• 2000

As today's market share of Intelligent Network (IN) service and wireless tele-communication is growing rapidly, the increment in service requests of wireless IN service subscribers and users has to be taken into account for implementing advanced IN services. In this paper, we design Global Service Logic for IN Freephone service, which is one of the commercially most interesting IN services, applied call queuing service feature with mass call processing to enhance call completion rate by considering the mobility of wireless service subscribers with mobile terminals as well as existing wireline service subscribers. Due to the location management of each IN subscribers 'mobile terminals, we design the structure and operation mechanism of Queue Manager which adjusts dynamically service subscribers groups according to their mobility. We optimize the queue size according to the call attempt rate and drop rate, and present the appropriate waiting time in the queue.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.39 no.2
• /
• pp.1-10
• /
• 2016

In this paper, we present a new way to derive the mean cycle time of the G/G/m failure prone queue when the loading of the system approaches to zero. The loading is the relative ratio of the arrival rate to the service rate multiplied by the number of servers. The system with low loading means the busy fraction of the system is low. The queueing system with low loading can be found in the semiconductor manufacturing process. Cluster tools in semiconductor manufacturing need a setup whenever the types of two successive lots are different. To setup a cluster tool, all wafers of preceding lot should be removed. Then, the waiting time of the next lot is zero excluding the setup time. This kind of situation can be regarded as the system with low loading. By employing absorbing Markov chain model and renewal theory, we propose a new way to derive the exact mean cycle time. In addition, using the proposed method, we present the cycle times of other types of queueing systems. For a queueing model with phase type service time distribution, we can obtain a two dimensional Markov chain model, which leads us to calculate the exact cycle time. The results also can be applied to a queueing model with batch arrivals. Our results can be employed to test the accuracy of existing or newly developed approximation methods. Furthermore, we provide intuitive interpretations to the results regarding the expected waiting time. The intuitive interpretations can be used to understand logically the characteristics of systems with low loading.

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

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.07a
• /
• pp.74-74
• /
• 2004

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.07a
• /
• pp.156-156
• /
• 2004

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.11a
• /
• pp.481-481
• /
• 2004

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06a
• /
• pp.313-315
• /
• 2012

SSD(Solid State Drives)에서는 쓰기 버퍼를 활용해 쓰기 연산의 횟수를 줄임으로써 입출력 성능향상을 가져오고, 부가적으로 삭제 연산이 줄어들어 수명 향상의 효과를 얻고 있다. 하지만 지금까지의 쓰기 버퍼 관련 연구에서는 SSD의 컨트롤러 구조를 모두 고려하지 못하고 있다. 이 논문에서는 쓰기 버퍼의 데이터 히트(HIT)율을 높이기 위한 방법으로 지금까지 고려하지 못했던 SSD 컨트롤러 구조 내 명령 큐(Command Queue)의 정보를 통해 가까운 미래에 도착할 쓰기 명령을 예측하고, 이를 기존 버퍼 관리 기법에 적용하는 방안을 연구한다.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.767-771
• /
• 2004

In this paper the performance of some control theory-based Active Queue Management (AQM) methods are improved and investigated through simulation. The simulation scenario is considered to be closely realistic, in which the traffic is mainly due to http sessions. The results show the best performance of PID controller with respect to the others in good queue regulation as well as high link utilization and low delay metrics.

• Journal of Institute of Control, Robotics and Systems
• /
• v.7 no.11
• /
• pp.962-966
• /
• 2001

The major problem at a branch point for point-to-multipoint available bit rate(ABR) services in asynchronous transfer mode (ATM) networks is how to consolidate backward resource management(BRM) cells from each branch for a multicast connection. In this paper, we propose an efficient feedback consolidation algorithm based on an adaptive dynamic threshold(ADT) to eliminate the consolidation noise and the reduce the consolidation delay. The main idea of the ADT algorithm lies in that each branch point estimates the ABR traffic condition of the network through the virtual queue estimation and the transmission threshold of the queue level in branch points is adaptively controlled according to the estimation. Simulation results show that the proposed ADT algorithm can achieve a faster response in congestion status and a higher link utilization compared with the previous works.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.11S
• /
• pp.3320-3331
• /
• 1999

In this paper, we explore two ways to improve the bandwidth assurance performance of Assured Service(AS). It is well known that AS fails to meet the bandwidth assurance target for large-profile TCP flows competing with many small-profile flows. This flows after the back-offs induced by packet drops. Thus currently proposed solution to this problem naturally focus on modifying TCP's behavior to counter the unfairness in the TCP dynamics. Unfortunately, these proposals lack practicability in terms of the required changes in the incumbent Internet infrastructure. Admitting this difficulty, we instead look to not yet deployed Diff-Serv mechanisms for practical solutions. In particular, we investigate the role of RIO, RED with IN(in-profile) and OUT(out-profile), queue management scheme in the assurance failure for As. Specifically, we identify the inadequacy of RIO that aggravates the bandwidth assurance failure. Then we alleviates the bandwidth assurance failure problem by separately controlling the out-of-profile packet queue length. Through extensive simulations we demonstrate that RI+O extends the regime where AS consistently provides the bandwidth assurance.