• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.2 no.2 s.3
• /
• pp.13-22
• /
• 2003

It is recognized that one of the problems for the current 'Traffic Adaptive Control System in Seoul' is the performance at the oversaturated condition. Instead of 'Degree of Saturation' adopted in the current system, the methodology of balancing the queue length was developed and evaluated in this study. This method keeps the balance of queue lengths on the intersections and reduces the overall queue lengths. In addition a traffic signal control model was developed based on the method. This model can reduce not only the queue lengths but also the average delay of vehicles according to the macroscopic and microscopic evaluations.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.29 no.5D
• /
• pp.563-570
• /
• 2009

This study is aimed to analyze the overall effects of the additional delay caused by the vehicle in front of the queue, at the signal, to the total delay estimation. To estimate the average vehicle delay at the signalized intersection, as survey of the queue length at the intersection and traffic counts were conducted. As a result of this analysis, all of the three delay estimation methods turned out to be similar in that the estimation of the average delay for the test vehicle was less than 60 sec/vehicle. However, the average delay time for the vehicle in front of the queue only, was estimated at 60-70 sec/vehicle which is similar to the average delay of the test vehicle.

• Journal of Korean Society of Transportation
• /
• v.27 no.2
• /
• pp.179-187
• /
• 2009

Currently, the signalized intersections in Korea are operated without providing an emergency vehicle preemption control strategy. Thus, it might threaten the safety of the pedestrians and drivers on highways when an emergency vehicle faces congested traffic conditions. The existing preemption control is activated when an emergency vehicle is detected along a path. This enables emergency vehicles to progress uninterrupted, but it also increases the delay of other vehicles. In this paper, a revised preemption control strategy considering queue length restrictions is proposed to make both a progressive movement of an emergency vehicle and reduce delay of other vehicles simultaneously. By applying the preemption control strategy through a simulation study, it was shown that delay of an emergency vehicle decreased to 44.3%-96.1% and speed increased to 8.8%-42.0% in all 9 cases as compared with a conventional signal control. The existing preemption control is superior for oversaturated conditions (v/c >1.0) or a link length less than 200m. However, the preemption control considering queue length constraints shows better performance than the existing preemption control when the v/c is less than 0.8 and a link length is longer than 500m.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.11
• /
• pp.2170-2178
• /
• 1994

Our previously proposed method is further applied to find the queue length distribution of MMPP/D1 in an ATM multiplexer. We derive some useful relationship between the queue distribution seen by arriving cells and for a server befor each service. The relations were used to improve out approximation. For MMPP/D1 the calculated results show a good agreement with those obtained by a simulation of the system. Furthermore, our approximation provides fast numerical algorithms for general traffic models. These advantages demomstrate that our approximation method is useful for a fast and accurate traffic analysis in ATM networks.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.42 no.4
• /
• pp.91-105
• /
• 2019

Discrete-time Queueing models are frequently utilized to analyze the performance of computing and communication systems. The length of busy period is one of important performance measures for such systems. In this paper, we consider the busy period of the Geo/Geo/1/K queue with a single vacation. We derive the moments of the length of the busy (idle) period, the number of customers who arrive and enter the system during the busy (idle) period and the number of customers who arrive but are lost due to no vacancies in the system for both early arrival system (EAS) and late arrival system (LAS). In order to do this, recursive equations for the joint probability generating function of the busy period of the Geo/Geo/1/K queue starting with n, 1 ≤ n ≤ K, customers, the number of customers who arrive and enter the system, and arrive but are lost during that busy period are constructed. Using the result of the busy period analysis, we also numerically study differences of various performance measures between EAS and LAS. This numerical study shows that the performance gap between EAS and LAS increases as the system capacity K decrease, and the arrival rate (probability) approaches the service rate (probability). This performance gap also decreases as the vacation rate (probability) decrease, but it does not shrink to zero.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10c
• /
• pp.423-426
• /
• 1999

In offering a statistical end-to-end bandwidth guarantee service, typically called Assured Service, in Differentiated Serviced (Diff-Serv) framework, the biggest issue is its inconsistency. Larger profile TCP flows fail to achieve the guaranteed rate when competing with many smaller profile flows. This phenomenon, which we call "bandwidth skew", stems from the fact that larger profile flows take longer time to recover from the congestion window size backoff after a packet drop. Proposed solutions to this problem, therefore, are focused on modifying the TCP behavior. However, TCP modification is not practicable, mainly due to its large installation base. We look to other mechanisms in the Diff-Serv framework to find more realistic solutions. In particular, we demonstrate that RIO, the de facto standard packet differentiation mechanism used for Assured Service, also contributes to the bandwidth skew. Based on this new finding, we design a modified RIO mechanism called RI+O. RI+O uses OUT queue length in addition to IN and IN+OUT queue length to calculate OUT packet drop probability. We show through extensive simulation that RI+O significantly alleviates the bandwidth skew, expanding the operating regime for Assured Service.d Service.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.1A
• /
• pp.81-89
• /
• 2000

In this paper, we analyzed the performance for CATV/LAN added priority problem. Upstrea nm channel which analyzed very deeply for CATV/LAN network have the preferential access property depending upon that positionand unidirectional property. To solve that fairness problem and priority, we propose the CSMA-CD/U/P-P protocolthat transmit as P1 probability if data packets happen. We assumed 2-Class priority(high, low). As the analyticresult and simulation, we obtained P1, value and its average delay time under priority problem assumed twoscenarios. Also, we get its variance value and queue length. Especially, the mean delay time increases nearer thanposition from H/E

• Journal of applied mathematics & informatics
• /
• v.8 no.1
• /
• pp.285-295
• /
• 2001

We consider a queueing system under overload control to support bursty traffic. The queueing system under overload control is modelled by MMBP/D1/K queue with two thresholds on buffer. Arrival of customer is assumed to be a Markov-modulated Bernoulli process (MMBP) by considering burstiness of traffic. Analysis is done in discrete-time case. Using the generating function method, we obtain the stationary queue length distribution. Finally, the loss probability and the waiting time distribution of a customer are given.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.29 no.3
• /
• pp.1-7
• /
• 2004

We demonstrate in this paper that the level crossing technique can be applied to such a system that not only the state vector is two-dimensional but Its two components are heterogeneous. As an example system, we use the GI-G/c/K queue whose state vector consists of the number of customers in the system and the total unfinished work.

• Journal of applied mathematics & informatics
• /
• v.26 no.3_4
• /
• pp.721-732
• /
• 2008

A single server infinite capacity queueing system with Poisson arrival and a general service time distribution along with repeated attempt and server vacation is considered. We made a comprehensive analysis of the system including ergodicity and limiting behaviour. Some operating characteristics are derived and numerical results are presented to test the feasibility of the queueing model.