• 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 Communications and Networks
• /
• v.14 no.5
• /
• pp.510-517
• /
• 2012

This paper analyzes the performance of voice-over-Internet protocol (VoIP) services in terms of the system throughput, the packet delay, and the signaling overhead in a mobile WiMAX system with a hybrid automatic repeat request (HARQ) mechanism. Furthermore, a queueing analytical model is developed with due consideration of adaptive modulation and coding, the signaling overhead, and the retransmissions of erroneous packets. The arrival process is modeled as the sum of the arrival rate at the initial transmission queue and the retransmission queue, respectively. The service rate is calculated by taking the HARQ retransmissions into consideration. This paper also evaluates the performance of VoIP services in a mobile WiMAX system with and without persistent allocation; persistent allocation is a technique used to reduce the signaling overhead for connections with a periodic traffic pattern and a relatively fixed payload. As shown in the simulation results, the HARQ mechanism increases the system throughput as well as the signaling overhead and the packet delay.

• Journal of Institute of Control, Robotics and Systems
• /
• v.7 no.11
• /
• pp.962-966
• /
• 2001

The major problem at a branch point for point-to-multipoint available bit rate(ABR) services in asynchronous transfer mode (ATM) networks is how to consolidate backward resource management(BRM) cells from each branch for a multicast connection. In this paper, we propose an efficient feedback consolidation algorithm based on an adaptive dynamic threshold(ADT) to eliminate the consolidation noise and the reduce the consolidation delay. The main idea of the ADT algorithm lies in that each branch point estimates the ABR traffic condition of the network through the virtual queue estimation and the transmission threshold of the queue level in branch points is adaptively controlled according to the estimation. Simulation results show that the proposed ADT algorithm can achieve a faster response in congestion status and a higher link utilization compared with the previous works.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.5A
• /
• pp.355-362
• /
• 2009

In real-time communication services, delay constraints are among the most important QoS (Quality of Service) factors. In particular, it is difficult to guarantee the delay requirement over wireless channels, since they exhibit dynamic time-varying behavior and even severe burst-errors during periods of deep fading. Channel throughput may be increased, but at the cost of the additional delays when ARQ (Automatic Repeat Request) schemes are used. For real-time communication services, it is very essential to predict data deliverability. This paper derives the delay distribution and the successful delivery probability within a given delay budget using a priori channel model and a posteriori information from the perspective of queueing theory. The Gilbert-Elliot burst-noise channel is employed as an a Priori channel model, where a two-state Markov-modulated Bernoulli process $(MMBP_2)$ is used. for a posteriori information, the channel parameters, the queue-length and the initial channel state are assumed to be given. The numerical derivation is verified and analyzed via Monte Carlo simulations. This numerical derivation is then applied to a rate control scheme for real-time video transmission, where an optimal encoding rate is determined based on the future channel capacity and the distortion of the reconstructed pictures.

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.1174-1177
• /
• 1987

The design of flow control protocols for integrared networks with complete voice traffic on the data link level is investigated. The class of admissible flow control policies analyzed maximized the average data link throughput subject to an average system time delay constraints a finite intervals (O,s). In particular, it is shown that the optimum control law is bang-bang (window flow mechanism). The window size L can be analytically derived from maximum tolerated time delay T, the input arrival C of the queueing system, the duration of the time interval S, the initial number of packets in the queue.

• The Journal of the Korea Contents Association
• /
• v.18 no.3
• /
• pp.34-40
• /
• 2018

In this study, the optimal buffer size is calculated for seamless video playback on a mobile device. Buffer means the memory space for multimedia packet which arrives in mobile device for video play such as VOD service. If the buffer size is too large, latency time before video playback can be longer. However, if it is too short, playback service can be paused because of shortage of packets arrived. Hence, the optimal buffer size insures QoS of video playback on mobile devices. We model the process of buffering into a discret-time queueing model. Mean busy period length and mean waiting time of Geo/G/1 queue with N-policy is analyzed. After then, we uses the main performance measures to present numerical examples to decide the optimal buffer size on mobile devices. Our results enhance the user satisfaction by insuring the seamless playback and minimizing the initial delay time in VOD streaming process.

• Journal of Korean Society of Transportation
• /
• v.29 no.2
• /
• pp.111-121
• /
• 2011

This paper discusses a method for optimizing the semi-actuated traffic signal control system by adjusting the initial interval according to the number of vehicles waiting for the green light in the actuated phase. We also present a Left-Turn actuated traffic signal control strategy that examines the vehicular noise in the detection area and determines the phase extension and the gap-out. In order to detect the vehicles in real-time, an image detector's Video Image Tracking technology was adopted. A 'Zone in Zone'method was implemented, and the image detection area is segmented into three zones: 1) Zone1 for verifying a vehicles obligatory presence, 2) Zone2 for counting the standby vehicles, and 3) Zone3 for examining the number of vehicles that have passed. The on-site assessment of the Left Turn Actuated Control is carried out using CORSIM, and the results show that the Control Delay decreased by 23.10%, 15.06%, and 4.34% compared to the delays resulted from pre-timed control, semi-actuated control-1 and semi-actuated control-2 traffic signal control systems respectively. The Queue Time also decreased by 36.24%, 20.10% and the Total Time by 14.36%, 7.02% for the same scenario. Which clearly demonstrates the operational efficiency. A sensitivity analysis reveals that the improvement from the propose traffic control strategy tends to increase as the through traffic volume reaches a saturated condition and the left-turn traffic volume decreases.

• Journal of KIISE:Information Networking
• /
• v.27 no.1
• /
• pp.98-107
• /
• 2000

This paper compares the performance of feedback consolidation algorithms with or without a fast overload indication function which has been recently proposed in the ATM Forum for multicast ABR (Available Bit Rate) services in ATM networks. We use the performance criteria such as the ACR (Allowed Cell Rate) of a source, queue length at a switch, link utilization, fairness, and BRM (Backward Resource Management) cell overhead. Simulation results show that performance of the feedback consolidation algorithms with a fast overload indication function can be improved sign.ificantly than that of algorithms without this function in terms of ramp-down delay, particularly in initial start-up period or under a severe overload situation. The fast overload indication function can be combined with any feedback consolidation algorithm, whereas its performance is highly dependent on an underlying basic feedback consolidation algorithm.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.40 no.2
• /
• pp.111-120
• /
• 2017

This paper proposes an improved standard genetic algorithm (GA) of making a near optimal schedule for integrated process planning and scheduling problem (IPPS) considering tool flexibility and tool related constraints. Process planning involves the selection of operations and the allocation of resources. Scheduling, meanwhile, determines the sequence order in which operations are executed on each machine. Due to the high degree of complexity, traditionally, a sequential approach has been preferred, which determines process planning firstly and then performs scheduling independently based on the results. The two sub-problems, however, are complicatedly interrelated to each other, so the IPPS tend to solve the two problems simultaneously. Although many studies for IPPS have been conducted in the past, tool flexibility and capacity constraints are rarely considered. Various meta-heuristics, especially GA, have been applied for IPPS, but the performance is yet satisfactory. To improve solution quality against computation time in GA, we adopted three methods. First, we used a random circular queue during generation of an initial population. It can provide sufficient diversity of individuals at the beginning of GA. Second, we adopted an inferior selection to choose the parents for the crossover and mutation operations. It helps to maintain exploitation capability throughout the evolution process. Third, we employed a modification of the hybrid scheduling algorithm to decode the chromosome of the individual into a schedule, which can generate an active and non-delay schedule. The experimental results show that our proposed algorithm is superior to the current best evolutionary algorithms at most benchmark problems.