• Journal of Korean Society of Transportation
• /
• v.9 no.1
• /
• pp.47-56
• /
• 1991

With respect to stochastic delays at linked signals the solid quantitative information has not been available as yet. On the basis of field data the values of "I" (variance-mean ration of flow) were related with the rate of flow. The stochastic delays with specific "I" values were obtained from the distribution of overflow queue, which were calculated by the use of Markov chains. This examination of the results led to the derivation of a simple method for calculating stochastic dclays through the introduction of "I" into Miller's model. The good agreement was shown between the model and the field. The relationships between the cycle lengths and delays were examinated in a large number of conditions with regard to degree of saturation. signal split and link length. Within the practical range of cycle length uniform delays were dominant and no critical point was found in terms of minimum, delay. In highly saturated conditions however the weight of stochastic delay is noticeable.

• Proceedings of the KOR-KST Conference
• /
• 1998.10a
• /
• pp.196-205
• /
• 1998

교통신호에서 주로 고려되는 변수는 신호주기(cycle length), 녹색시간(green split), 옵셋(offset)그리고 좌회전 현시순서(left-turn phase sequence)로 구성된다. 기존의 대부분의 연동 모델들은 고정된 주기하에서 평균적인 유입 교통량을 측정한 후, 선형최적화 이론을 적용하여 최적 신호를 산출한다. 그러나 이 방법은 어디까지나 평균적인 데이터에 대해서 계산을 한 것이기 때문에 실시간 최적화를 제공하기가 어렵다. 본 연구에서는 평균 차량 통행량 대신 실시간으로 입력되는 차량 대기행렬, 차량 도착률을 기초로 대기차량을 최소화하는 동적 신호시간 산출 모델을 개발하였다. 본 모델에서는 Peytechew가 제안한 각 진입로에서의 대기 차량 예측 모델을 기초로 하여 다음 주기에서의 차량 대기 행렬을 예측한 후, 선형 최적화 이론을 적용하여 신호시간을 산출한다. 본 모델에서 산출된 신호주기와 녹색시간은 대기차량길이를 최소화하는 신호 시간으로서 교차로간의 연동효과를 고려하여 실시산 교통상황에 따라 주기별로 변화한다. 본 모델은 3개의 교차로로 구성된 네트워크를 대상으로 적용하였다. 실험 네트워크의 주도로 교통량은 부도로의 교통량 보다 많다고 가정하였으며 각 링크사이에서의 차량 진출입은 없다고 보았다.

• Journal of Communications and Networks
• /
• v.11 no.4
• /
• pp.406-415
• /
• 2009

In this work, we consider performance modeling of a wireless sensor network with a time division multiple access (TDMA) media access protocol with slot reuse. It is assumed that all the nodes are peers of each other and they have two modes of operation, active and sleep modes. We model the sensor network as a Jackson network with unreliable nodes with on and off states. Active and sleep modes of sensor nodes are modeled with on and off states of unreliable nodes. We determine the joint distribution of the sensor node queue lengths in the network. From this result, we derive the probability distribution of the number of active nodes and blocking probability of node activation. Then, we present the mean packet delay, average sleep period of a node and the network throughput. We present numerical results as well as simulation results to verify the analysis. Finally, we discuss how the derived results may be used in the design of sensor networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.9A
• /
• pp.684-693
• /
• 2003

This paper analyzes transmissiondelays of a message and a packet in a time-varying and packet-based radio link. The paper assumes that thearrivals of messages have a Bernoulli process and the lengths of the messages a exponential distribution. To reflect the feature of the time-varying radio link, we use a two-state Markov model. From the model the mean transmission delay of and the mean queue length of the packet are analyzed in terms of the packet distribution function, the packet transmission service time, and the PER of the radio link. And the mean message transmission delay time and the mean queue length are derived using the performance indices of the packet. Numerical results show that the message arrival rate and the message length have some bounds to keep the transmission of the message steady and to improve the performance indices of the message. It can be known that the PER of the state influences on the performance indices more than the sojourn time of the state.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.2 no.1 s.2
• /
• pp.63-73
• /
• 2003

COSMOS(Cycle, Offset, Split Model for Seoul), a real-time traffic adaptive signal system. estimates queue lengths on each approach on the basis of arithmetic average spot speeds calculated on loop detectors installed at each of two adjacent lanes. In this paper, A new method, a traffic volume-weighted average method, was studied and compared with the existing arithmetic average method. It was found that the relationship between the ratio of volumes of two lanes and the difference of average speed of each lane has a linear form. With field data, The two methods were applied and the proposed method shows more stable and reasonable queue estimation results.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.92-96
• /
• 2000

In this paper, we propose a call admission control(CAC) scheme fer the mixed voice/data DS-CDMA systems and analyze the Er-lang capacity under the proposed CAC scheme. Voice and data traffics require different system resources based oil their Quality of Service(QoS) requirements. In the proposed CAC scheme, some system resources are reserved exclusively for handoff calls to have high priority Over new calls. Additionally the queueing of both new and handoff data traffics that are not sensitive to delay is allowed. Ar a performance measure for the suggested CAC scheme. Erlang capacity is utilized. For the performance analysis, a four-dimensional Markov chain model is developed. Erlang capacity of a practical IS-95B type system depicts, and optimum values of system parameters such as the number of reservation channels and queue lengths are found with respect to Erlang capacity. Finally, it is observed that Erlang capacity is improved more than two times by properly selecting the system parameters with the proposed CAC scheme.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.20 no.43
• /
• pp.153-162
• /
• 1997

M/G/1 queueing system is one of the most widely used one to model the real system. When operating a real systems, since it often takes cost, some control policies that change the operation scheme are adopted. In particular, the N-policy is the most popular among many control policies. Almost all researches on queueing system are based on the assumption that the arrival rates of customers into the queueing system is constant, In this paper, we consider the M/G/1 queueing system whose arrival rate varies according to the servers status : idle, set-up and busy states. For this study, we construct the steady state equations of queue lengths by means of the supplementary variable method, and derive the PGF(probability generating function) of them. The L-S-T(Laplace Stieltjes transform) of waiting time and average waiting time are also presented. We also develop an algorithm to find the optimal N-value from which the server starts his set-up. An analysis on the performance measures to minimize total operation cost of queueing system is included. We finally investigate the behavior of system operation cost as the optimal N and arrival rate change by a numerical study.

• Journal of Korea Society of Industrial Information Systems
• /
• v.23 no.2
• /
• pp.29-39
• /
• 2018

In this paper, we discuss a discrete-time queueing system with dyadic server control policy that combines workload control and multiple vacations. Customers arrive at the system with Bernoulli arrival process. If there is no customer to serve in the system, an idle single server spends a vacation of discrete random variable V and returns. The server repeats the vacation until the total service time of waiting customers exceeds the predetermined workload threshold D. In this paper, we derived the steady-state workload distribution of a discrete-time queueing system which is operating under a more realistic and flexible server control policy. Mean workload is also derived as a performance measure. The results are basis for the analysis of system performance measures such as queue lengths, waiting time, and sojourn time.

• Journal of Korean Society of Transportation
• /
• v.24 no.7 s.93
• /
• pp.65-79
• /
• 2006

The ATIS(Advance Traveler Information System), as one part of ITS, is a system aiming to disperse traffic volume on transportation networks by providing traffic information to transportation users on pre-trip and en-route trips. One of tools in ATIS is usage of VMS(Variable Message Signs). It provides to the drivers with direct information about state of processing direction. which is considered as the most effective method in ATIS. The purposes of providing VMS information are classified two categories. One is to provide simple information to drivers for their convenience. The other is to manage traffic demand to improve transportation network performance. However, for more effective and reliable VMS information, several strategies should be taken into account. The main VMS management strategy is "Traffic Diversion Strategy for minimum delay" when traffic congestion or incident are occurred. For effective operation. firstly. reasonable diversion traffic volume is determined by network traffic condition Secondly, it is necessary to make providing information strategy which reflects driver response behavior for controling diversion traffic volume. This paper focuses on the providing real-time route guidance information by VMS when congestion is occurred by the incidents. This sturdy estimates time-dependent system optimal diversion rate that inflects travel time and queue lengths using traffic flow simulation model on base Cellular Automata. In addition, route choice behavior models are developed using binary logit model for traffic information variable by traffic system controller. Finally, this study provides time-dependent VMS massage contents and degree of providing information in order to optimize the traffic flow.

• Journal of Korean Society of Transportation
• /
• v.22 no.7 s.78
• /
• pp.131-137
• /
• 2004

Conventional traffic signal optimization models assume that green intervals for pedestrian crossings are given as exogenous inputs such as minimum green intervals for straight-ahead movements. As the result, in reality, the green intervals of traffic movements may not distribute adequately by the volume/saturation-flow of them. In this paper, we proposed signal optimization models formulated in BMILP to integrate pedestrian crossings into traffic movements under under-saturated traffic flow. The model simultaneously optimizes traffic and pedestrian movements to minimize weighted queues of primary queues during red interval and secondary queues during queue clearance time. A set of linear objective function and constraints set up to ensure the conditions with respect to pedestrian and traffic maneuvers. Numerical examples are given by pedestrian green intervals and the number of pedestrian crossings located at an arm. Optimization results illustrated that pedestrian green intervals using proposed models are greater than those using TRANSYT-7F, but opposite in the ratios of pedestrian green intervals to the cycle lengths. The simulation results show that proposed models are superior to TRANSYT-7F in reducing delay, where the longer the pedestrian green interval the greater the effect.