• Journal of Communications and Networks
• /
• v.9 no.3
• /
• pp.229-235
• /
• 2007

This paper analyzes the performance of a Bluetooth piconet in error-prone environments. A statistical characterization of a waiting time, an end-to-end delay, and a goodput are derived analytically in terms of the arrival rates, the number of slaves, and the packet error rate (PER). For simplicity, half-symmetric piconet is assumed in this analysis. Both exhaustive and limited scheduling are considered. The analytic results are validated by simulations.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.8
• /
• pp.719-724
• /
• 2012

A traffic detection system is a device that collects traffic information around an intersection. Most existing traffic detection systems provide very limited traffic information for signal control due to the restriction of vehicle detection area. A signal control scheme determines the transition among signal phases and the time that a phase lasts for. However, the existing signal control scheme do not resolve the traffic congestion effectively since they use restricted traffic information. In this paper, a new traffic detection system with a zone division signal control scheme is proposed to provide correct and detail traffic information and decrease the vehicle's waiting time at the intersection. The traffic detection system obtains traffic information in a way of vehicle-to-roadside communication between vehicles and sensor network. A new signal control scheme is built to exploit the sufficient traffic information provided by the proposed traffic detection system efficiently. Simulation results show that the proposed signal control scheme has 121 % and 56 % lower waiting time and delay time of vehicles at an intersection than other fuzzy signal control scheme.

• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.524-529
• /
• 1989

In this paper, an approximate sojourn time distribution is obtained for cyclic service systems. We consider symmetric and limited service systems in which each queue has an infinite capacity. The combined service time is defined which consists of the frame service time and server waiting time that is approximated by two cases of the uniform and exponential distributions. The approximate sojourn time distribution is obtained from the Pollaczek-Khinchine formula where the combined service time is used for the service time in the M/G/I model. And some numerical examples are given to validate the suggested approximate analysis.

• Journal of Korean Institute of Industrial Engineers
• /
• v.20 no.4
• /
• pp.37-50
• /
• 1994

The efficiency of production system is mainly considered in the viewpoints of reducing the average flow time of products and increasing the throughput rate. The performance in these viewpoints is very depending on job dispatching of each machine in real time operation, in the case jobs are released dynamically. In this research, a heuristic dynamic dispatching method is suggested for a flow shop case where new jobs with random process times are released by an interarrival time distribution and the number of waiting jobs between each pair of machines are limited. The proposed method has been compared with some priority rule-based dispatching methods by simulation and found to be superior to them.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.4
• /
• pp.895-909
• /
• 2013

Distributed Denial-of-Service (DDoS) attacks towards name servers of the Domain Name System (DNS) have threaten to disrupt this critical service. This paper studies the vulnerability of the cache server to the flooding DNS query traffic. As the resolution service provided by cache server, the incoming DNS requests, even the massive attacking traffic, are maintained in the waiting queue. The sojourn of requests lasts until the corresponding responses are returned from the authoritative server or time out. The victim cache server is thus overloaded by the pounding traffic and thereafter goes down. The impact of such attacks is analyzed via the model of queuing process in both cache server and authoritative server. Some specific limits hold for this practical dual queuing process, such as the limited sojourn time in the queue of cache server and the independence of the two queuing processes. The analytical results are presented to evaluate the impact of DDoS attacks on cache server. Finally, numerical results are provided for further analysis.

• Journal of Navigation and Port Research
• /
• v.40 no.1
• /
• pp.35-41
• /
• 2016

Port congestion has been recognized as one of the critical factors for port service competitiveness and port selection criteria. However, congestion ratio, the congestion index currently used by Korea, plays a very limited role in shipping companies' and shippers' selection of port and port authorities' decision making regarding port management and development. This is mainly due to the fact that this ratio is only calculated as the ratio of the number of vessels by each port. Therefore, this study aims to measure service level related to vessel entry and departure in Korea ports by evaluating waiting ratio(WR) according to terminals and vessel types. The results demonstrate that the waiting ratio of containerships and non-containerships is less than 4% and 15% respectively, which satisfies the reasonable level suggested by the UNCTAD and OECD. Port of Pohang is revealed to have the highest WR of 57% and among the terminals, No. 1 Terminal of the Shinhang area has the highest WR. In terms of ship types, WR of Steel Product Carrier is highest, followed by General Cargo Ship and Bulk Carrier at the Pohang Shinhang area. In addition to WR, berth occupancy ratio as well as the number and time of waiting vessels can be utilized to evaluate service level by ports and terminals from port users' perspective, and furthermore, to improve the port management and development policy for port managers or authorities.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.10
• /
• pp.3851-3866
• /
• 2015

The dynamic nature of opportunistic networks results in long delays, low rates of success for deliveries, etc. As such user experience is limited, and the further development of opportunistic networks is constrained. This paper proposes a prediction-based routing method for opportunistic networks (PB-OppNet). Firstly, using an ARIMA model, PB-OppNet describes the historical contact information between a node pair as a time series to predict the average encounter time interval of the node pair. Secondly, using an optimal stopping rule, PB-OppNet obtains a threshold for encounter time intervals as forwarding utility. Based on this threshold, a node can easily make decisions of stopping observing, or delivering messages when potential forwarding nodes enter its communication range. It can also report different encounter time intervals to the destination node. With the threshold, PB-OppNet can achieve a better compromise of forwarding utility and waiting delay, so that delivery delay is minimized. The simulation experiment result presented here shows that PB-OppNet is better than existing methods in prediction accuracy for links, delivery delays, delivery success rates, etc.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.5
• /
• pp.2368-2374
• /
• 2013

Elevator power consists of power consumption in stand-by and in service. This paper designed a fuzzy controller saving stand-by power of elevators in a way that calculates the adequate number of elevators by the variable traffic volume of passenger and then powers off elevators being out of service. Also, the fuzzy controller was designed to minimize a increase of the average passenger's waiting time by the limited number of elevators in service. When the fuzzy controller designed in this paper was applied to the group elevator experimental device, The passenger's waiting time increased approximately 7.5%~9.5%, While the stand-by power saving is expected to be about 675KWh a day per unit and about 236.6KWh a year per unit.

• Journal of the Korea Society for Simulation
• /
• v.25 no.3
• /
• pp.117-123
• /
• 2016

This paper presents inference methods for inner operations of a multi-server queue when historical data are limited or system observation is restricted. In a queueing system analysis, autocorrelated arrival and service processes increase the complexity of modeling. Accordingly, numerous analysis methods have been developed. In this paper, we introduce an inference method for specific situations when external observations exhibit autocorrelated structure and and observations of internal operations are difficult. We release an assumption of the previous method and provide lemma and theorem to guarantee the correctness of our proposed inference method. Using only external observations, our proposed method deduces the internal operation of a multi-server queue via non-parametric approach even when the service times are autocorrelated. The main internal inference measures are waiting times and service times of respective customers. We provide some numerical results to verify that our method performs as intended.

• Journal of The Korea Institute of Healthcare Architecture
• /
• v.16 no.1
• /
• pp.35-42
• /
• 2010

As a functionally complicated facility, it requires rational strategy to accommodate multi-functional needs to plan a hospital. Ambulatory surgery units located in large hospitals have problems such as longer waiting time and congestion for patients due to complicated planning and organization within limited area, which raise needs for independent ambulatory surgery centers to enable smoother medical treatment for patients. To design an independent ambulatory surgery center, understanding of zoning and layout of each unit needs is particularly required. This study focuses on research of efficient zoning/organization of day surgery unit and circulation arrangements of ambulatory surgery centers by analyzing various examples abroad, which will eventually help finding appropriate way of planning domestic ambulatory surgery centers. Specific area of research includes ambulatory surgery process, programmatic requirements, spatial organization of the facility, layout of surgery unit and circulation arrangements of ambulatory surgery centers.