• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.1
• /
• pp.110-122
• /
• 1993

When voice is transmitted through packet switching network, there needs a overload control, that is, a control for the congestion which lasts short periods and occurrs in local extents. In this thesis, we analyzed the performance of the statistical packet voice multiplexer using the overload control strategy by bit dropping. We assume that the voice is coded accordng to (4,2) embedded ADPCM and that the voice packet is generated and transmitted according to the procedures in the CCITT recomendation G. 764. For the performance analysis, we must model the superposed packet arrival process to the multiplexer as exactly as possible. It is well known that interarrival times of the packets are highly correlated and for this reason MMPP is more suited for the modelling in the viewpoint of accuracy. Hence the packet arrival process in modeled as MMPP and the matrix geometric method is used for the performance analysis. Performance analysis is similar to the MMPP IG II queueing system. But the overload control makes the service time distribution G dependent on system status or queue length in the multiplexer. Through the performance analysis we derived the probability generating function for the queue length and using this we derived the mean and standard deviation of the queue length and waiting time. The numerical results are verified through the simulation and the results show that the values embedded in the departure times and that in the arbitrary times are almost the same. Results also show bit dropping reduces the mean and the variation of the queue length and those of the waiting time.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.9 no.3
• /
• pp.30-40
• /
• 2010

The freeway congestion is largely generated by a mainline spillover of the exit ramp queue. So it is necessary to study for modeling of the phenomenon and applying the model. In this study, the authors evaluated applicability of the Supply-Demand model, which can express traffic flow for the freeway by applying flexibly supply and demand curves for capacity of the freeway. First the authors proposed methods processing input data required in the Supply-Demand model, such as sending & receiving functions and time-varying capacity constraints for the freeway mainline. After modeling the Supply-Demand application model, the authors applied the model to the site including congested Hongeun exit ramp in Seoul Ring-road, and improved the model by adjusting application techniques and calibrating parameters. The result of the analysis showed that the Supply-Demand model yielded a queuing pattern and queue location similar to them observed in the field data, and applicability of the Supply-Demand model was varified.

• Journal of Korean Tunnelling and Underground Space Association
• /
• v.18 no.1
• /
• pp.41-52
• /
• 2016

When the queue length of congestion vehicles in tunnel fire is extended beyond tunnel length, the capacity of smoke control system needs to be increased in line with ventilation resistance. However, the vehicle queue length is not defined, so a rational equation is necessary in current fire prevention guideline. This study is intended to propose an equation to calculate the queue length considering the number of vehicles in queue in tunnel fire and evaluate the applicability by tunnel length as well. When it comes to normal tunnel, it is necessary to compare the vehicle queue length with tunnel length up to the length of 1,200 m in a bid to avoid applying the vehicle queue length excessively in case of fire. As a result of evaluation of applicability to model a tunnel, saving the number of jet fan for smoke control appeared to be effective. Besides, quantitative approach to explain the vehicle queue length through the relationship between the percentage of large vehicles and tunnel length was presented. Consequently, when the queue length of the congestion vehicles exceeds the tunnel length in determining the capacity of smoke control system in case of fire, the number of vehicles beyond the tunnel length needs to be excluded from estimating the ventilation resistance by vehicles.

• Journal of Korean Society of Transportation
• /
• v.20 no.5
• /
• pp.81-98
• /
• 2002

This paper documents the development of a bi-objective(minimizing delays and Queue lengths) cycle-free signal timing length model using Genetic Algorithm. The model was embodied using MATLAB. the language of technical computing. A special feature of this model is its ability to concurrently manage delays and queue lengths of turning movement concurrently. The model produces a cycle-free signal timing(cycles and green times) for each intersection on the cycle basis. Appropriate offsets could be also accomplished by applying cycle-free based signal timings for respective intersections. The model was applied to an example network which consists of four intersections. The result shows that the model produces superior signal timings to the existing signal timing model in terms of managing delays and queue lengths of turning movements.

• Journal of Information Processing Systems
• /
• v.7 no.1
• /
• pp.1-16
• /
• 2011

With the increasing number of vehicles in use in our daily life and the rise of traffic congestion problems, many methods and models have been developed for real time optimisation of traffic lights. Nevertheless, most methods which consider real time physical queue sizes of vehicles waiting for green lights overestimate the optimal cycle length for such real traffic control. This paper deals with the development of a generic hybrid model describing both physical traffic flows and control of signalised intersections. The firing times assigned to the transitions of the control part are considered dynamic and are calculated by a simplified optimisation method. This method is based on splitting green times proportionally to the predicted queue sizes through input links for each new cycle time. The proposed model can be easily translated into a control code for implementation in a real time control system.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.14 no.23
• /
• pp.47-55
• /
• 1991

In automated assembly line, an automatic guided vehicle system(AGVS) represents a mire versatile means of moving materials automatically. In this paper, the vehicles not only provide the transportation medium between workstations but also as mobile workstations. The objective for the developed model is the determination of the appropriate time to control AGV based assembly line in order to minimize production makespan while maximizing the efficient use of vehicles. In this paper, we consider the finished goods of two types which are produced in assembly line. The assembly line is considered with and without queue. Because no buffer are present in case 1. this model seeks to determine the point in time at which vehicles should be launched in the assembly line without experiencing a delay. The case 2 model also seek to determine the vehicle launch times while minimizing production makespan. The assumption in this model is that the maximum queue size cannot exceed 1 at any time.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.5
• /
• pp.1070-1081
• /
• 1996

In this research, a model was developed for estimating the queue length of vehicles, based on occupancy time of each vehicle collected by loop detectors which were setup at the upstream of urban street. The estimation model suggestes a method which minimizes architectural effects of the street, such as existence of pedestrian crossing, for future applications to the field. The estimation model suggested in this research was established based on real traffic data collected at up-stream detectors in Kangnam Subway station, Seoul, and the formula of the model is based on Multi-Polynomial equations. Consequence of the experiments showed that the model can adequately and in real-time mode measure length of the queue which were constructed at the 80 to 90 meters away from the upstream detectors. The estimation accuracy of the model was verified in statistical analysis conducted by regressing analysis and test results in real traffic situation.

• Proceedings of the Korean Society of Computational and Applied Mathematics Conference
• /
• 2003.09a
• /
• pp.13.1-13
• /
• 2003

The Markovian arrival process with marked transitions (MMAP) is useful in modeling input processes of stochastic system with several types. Especially, the MMAP can be used to model the phenomena where the correlation of different types is considered. In this talk we discuss modeling issues for the queue with three types of customers; ordinary customers, negative customers and disasters which are correlated by using MMAP. We also present the recent results and further studies.

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

• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.1
• /
• pp.125-129
• /
• 1999

The Little's formula, $L={\lambda}W$, expresses a fundamental principle of queueing theory: Under very general conditions, the average queue length is equal to the product of the arrival rate and the average waiting time. This useful formula is now well known and frequently applied. In this paper, we demonstrate that the Little's formula has much more power than was previously realized when it is properly decomposed into what we call the microscopic Little's formula. We use the M/G/1 queue with server vacations as an example model to which we apply the microscopic Little's formula. As a result, we obtain a transform-free expression for the queue length distribution. Also, we briefly summarize some previous efforts in the literature to increase the power of the Little's formula.