• Journal of applied mathematics & informatics
• /
• v.35 no.5_6
• /
• pp.623-649
• /
• 2017

Retrial queues have been widely used to model the many practical situations arising from telephone systems, telecommunication networks and call centers. An approximation method for a simple Markovian retrial queue by reducing the two dimensional problem to one dimensional problem was presented by Fredericks and Reisner in 1979. The method seems to be a promising approach to approximate the retrial queues with complex structure, but the method has not been attracted a lot of attention for about thirty years. In this paper, we exposit the method in detail and show the usefulness of the method by presenting the recent results for approximating the retrial queues with complex structure such as multi-server retrial queues with phase type distribution of retrial time, impatient customers with general persistent function and/or multiclass customers, etc.

• Journal of Computing Science and Engineering
• /
• v.5 no.4
• /
• pp.283-287
• /
• 2011

Due to the proliferation of software parallelization on multi-core CPUs, the number of concurrently executing processes is rapidly increasing. Unlike processes running in a server environment, those executing in a multi-core desktop or a multi-core mobile platform have various correlations. Therefore, it is crucial to consider correlations among concurrently running processes. In this paper, we exploit the property that for a given created location in the binary image of the parent process, the average running time of child processes residing in the run-queue differs. We claim that this property can be exploited to improve the overall system performance by running processes that have a relatively short running time before those with a longer running time. Experimental results verified that the running time was actually improved by 11%.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.12
• /
• pp.2226-2231
• /
• 2008

As the mobile devices and the wireless networks have high-performance capabilities, it is possible to synchronize the spatio-temporal data of a server with the spatio-temporal data of a mobile device which are collected at a field. However, since the server process the synchronization which the model device requests, the whole synchronizations of mass mobile devices take long time. In this paper, we propose the scheme to process concurrently the synchronizations of mobile devices to use multi-queue which does not conflict.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.22 no.2
• /
• pp.134-141
• /
• 2008

This paper presents an innovative load management technique that can effectively lower the summer peak load by adjusting the aircondition loads through smoothe coordinations between utility companies and large customers. An intelligent hierarchical load management system composed of a Central Intelligent Load Management System(CIMS) and multiple Local Intelligent Management Systems(LIMS) is also proposed to implement the reposed technique. Upon receiving a load curtailment request from the utilities, CIMS issues tokens, which can be used by each LIMS as a right to turn on the airconditioner. CIMS creates and maintains a queue for fair allocation of the tokens among the LIMS demanding tokens. By adjusting the number tokens and queue management Policies, desired load factors can be achieved conveniently. The Markov Birth and Death Process and the Balance Equations are employed in estimating various queue performances. The proposed technique is tested using a summer load data of a large apartment complex and proved to be quite effective in load management while minimizing the customer inconveniences.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.4
• /
• pp.344-365
• /
• 2009

The performance of a tracking system is greatly increased if multiple types of sensors are combined to achieve the objective of the tracking instead of relying on single type of sensor. To conduct the multi-modal tracking, we have previously developed a multi-modal sensor-based tracking model where acoustic sensors mainly track the objects and visual sensors compensate the tracking errors [1]. In this paper, we find a network synchronization problem appearing in the developed tracking system. The problem is caused by the different location and traffic characteristics of multi-modal sensors and non-synchronized arrival of the captured sensor data at a processing server. To effectively deliver the sensor data, we propose a time-based packet aggregation algorithm where the acoustic sensor data are aggregated based on the sampling time and sent to the server. The delivered acoustic sensor data is then compensated by visual images to correct the tracking errors and such a compensation process improves the tracking accuracy in ideal case. However, in real situations, the tracking improvement from visual compensation can be severely degraded due to the aforementioned network synchronization problem, the impact of which is analyzed by simulations in this paper. To resolve the network synchronization problem, we differentiate the service level of sensor traffic based on Weight Round Robin (WRR) scheduling at the routers. The weighting factor allocated to each queue is calculated by a proposed Delay-based Weight Allocation (DWA) algorithm. From the simulations, we show the traffic differentiation model can mitigate the non-synchronization of sensor data. Finally, we analyze expected traffic behaviors of the tracking system in terms of acoustic sampling interval and visual image size.

• The KIPS Transactions:PartC
• /
• v.10C no.1
• /
• pp.87-94
• /
• 2003

As the number of the Internet users increases explosively, a solution for this problem is web caching. So, many techniques on improving cache server performance have been suggested. In this paper, we analyze the cause of the bottleneck in cache servers, and propose an arbitral thread and delayed caching mechanism as a solution. We use an arbitral thread in order to provide a quick service to user requests through eliminating the ready multi-thread search problem in case of disk writing operation. We also use delayed caching in order to provide stable system operation through avoiding overloaded disk operation and queue threshold. Proposed cache server is implemented through modification on SQUlD cache server, and we compare its performance with the original SQUID cache server.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.12
• /
• pp.95-102
• /
• 2005

This paper is purpose for improvement performance wireless lan of IEEE802.11a/b/g. Access point utilized a single server, multi-queuing system, FIFS system model to adapted priority multi-bufferto be alteration packet type. The main purpose of the paper improve the transmission rate and the performance of access point to settle transmission delay for load in MAC, has priority multi-buffer. We use experimentation to obtain our model of the access point and buffer-related parameters. Using our test design, we are able to extract the parameters of an analytic equation giving the average service time of a packet as a function of packer IP payload.

• Journal of Internet Computing and Services
• /
• v.23 no.5
• /
• pp.33-46
• /
• 2022

This paper, in order to minimize the ground waiting time of an Air tanker, the queuing theory, that is, a queue that calculates the waiting time under single-server and multi-server situations, was used in the study. Since the national budget and resources are limited, the unlimited increase of the logistics support service team is limited. Therefore, the number of logistic support service teams that can adaptively control the ground waiting time according to the wartime preparation stage or war environment was calculated. The results of this study provide a stipulated standard for calculating the optimal number of air tanker logistic support service teams of the Air Force, providing a basis for the logistical commander to assign logistic support service teams to each stage from peacetime to wartime.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.171-174
• /
• 2008

As the mobile devices and the wireless networks have high-performance capabilities, it is possible to synchronize the spatio-temporal data of a server with the spatio-temporal data of a mobile device which are collected at a field. However, since the server process the synchronization which the model device requests the whole synchronizations of mass mobile devices take long time. In this paper, we propose the scheme to Process concurrently the synchronizations of mobile devices which does not conflict with others using the scheme of a multi-queue.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.1
• /
• pp.141-146
• /
• 2011

The GIS service has to provide latest spatio-temporal data for the effective service. The two-way synchronization scheme collects updated spatio-temporal data in the field and synchronizes with a server by using the wireless network. However, since the two-way synchronization scheme processes sequentially synchronizing work of clients, it has the problem that the synchronization of multiple clients takes long time. In this paper, we propose the concurrent synchronizations scheme based on the multi-queue in order to reduce the waiting time of multiple clients. We also build both schemes and evaulate the performance test. The results show that the proposed scheme reduce the waiting time by 31%.