• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.5
• /
• pp.1554-1566
• /
• 2014

Cloud Computing allows application providers seamlessly scaling their services and enables users scaling their usage according to their needs. In this paper, using queuing game model, we present service scheduling schemes which are used in software as a service (SaaS). The object is maximizing the Cloud Computing platform's (CCP's) payoff via controlling the service requests whether to join or balk, and controlling the value of CCP's admission fee. Firstly, we treat the CCP as one virtual machine (VM) and analyze the optimal queue length with a fixed admission fee distribution. If the position number of a new service request is bigger than the optimal queue length, it balks. Otherwise, it joins in. Under this scheme, the CCP's payoff can be maximized. Secondly, we extend this achievement to the multiple VMs situation. A big difference between single VM and multiple VMs is that the latter one needs to decide which VM the service requests turn to for service. We use a corresponding algorithm solve it. Simulation results demonstrate the good performance of our schemes.

• Journal of Korean Society of Transportation
• /
• v.23 no.8 s.86
• /
• pp.181-191
• /
• 2005

This study developed an algorithm for real-time signal control based on the detection system that can collect sectional travel time. The signal control variable is maximum queue length per cycle and this variable has a sectional meaning. When a individual vehicle pass through the detector, we can gather the vehicle ID and the detected time. Therefor we can compute the travel time of an individual vehicle between consecutive detectors. This travel time informations were bisected including the delay and not. We can compute queue withdrawing time using this bisection and the max queue length is computed using the deterministic delay model. The objective function of the real-time signal control aims equalization of queue length for all direction. The distribution of the cycle is made by queue length ratios.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.13 no.1
• /
• pp.1-14
• /
• 2014

The expansion of the physical road in response to changes in social conditions and policy of the country has reached the limit. In order to alleviate congestion on the existing road to reconsider the effectiveness of this method should be asking. Currently, how to collect traffic information for management of the intersection is limited to point detection systems. Intelligent Transport Systems (ITS) was the traffic information collection system of point detection method such as through video and loop detector in the past. However, intelligent transportation systems of the next generation(C-ITS) has evolved rapidly in real time interval detection system of collecting various systems between the pedestrian, road, and car. Therefore, this study is designed to evaluate the development of an algorithm for queue length based real-time traffic signal control methodology. Four coordinates estimate on time-space diagram using the travel time each individual vehicle collected via the interval detector. Using the coordinate value estimated during the cycle for estimating the velocity of the shock wave the queue is created. Using the queue length is estimated, and determine the signal timing the total queue length is minimized at intersection. Therefore, in this study, it was confirmed that the calculation of the signal timing of the intersection queue is minimized.

• Journal of Korean Society of Transportation
• /
• v.20 no.5
• /
• pp.145-152
• /
• 2002

Real-time queueing information and/or predictive queue built-up information can be a good criterion in selecting travel options, such as routes, both for users, and for operators in operating transportation system. Provided properly, it will be a key information for reducing traffic congestion. Also, it helps drivers be able to select optimal roues and operators be able to manage the system effectively as a whole. To produce the predictive queue information, this paper proposes a predictive model for estimating and predicting queue lengths, mainly based on Kalman Filter. It has a structure of having state space model for predicting queue length which is set as observational variable. It has been applied for the Namsan first tunnel and the application results indicate that the model is quite reasonable in its efficacy and can be applicable for various ATIS system architecture. Some limitations and future research agenda have also been discussed.

• Journal of applied mathematics & informatics
• /
• v.9 no.1
• /
• pp.349-357
• /
• 2002

In this paper, we analyze queueing behaviors and investigate the possibilities of reducing and controlling shortages and oversupplies in the bidirectional queueing system which forms a negative queue by demand and a positive queue by supply. Interarrival times of units in the bidirectional queueing system investigated are exponetially distributed. Instant pairing off implies that queue can be either positive or negative, but not both at the same time. The results include a proof that sum of queue lengths is minimized if rates of demand and supply in each system are equal and optimum solutions for rates of supply which minimize the sum of queue lengths when rates of demand and sum of rates of supply are given. In addition, the relationship between the ordinary queueing system and the bidirectional queueing system is investigated.

• Journal of Communications and Networks
• /
• v.6 no.2
• /
• pp.133-146
• /
• 2004

Recently, many active queue management (AQM) algorithms have been proposed to address the performance degradation. of end-to-end congestion control under tail-drop (TD) queue management at Internet routers. However, these AQM algorithms show performance improvement only for limited network environments, and are insensitive to dynamically changing network situations. In this paper, we propose an adaptive queue management algorithm, called PID-controller, that uses proportional-integral-derivative (PID) feedback control to remedy these weak-Dalles of existing AQM proposals. The PID-controller is able to detect and control congestion adaptively and proactively to dynamically changing network environments using incipient as well as current congestion indications. A simulation study over a wide range of IP traffic conditions shows that PID-controller outperforms other AQM algorithms such as Random Early Detection (RED) [3] and Proportional-Integral (PI) controller [9] in terms of queue length dynamics, packet loss rates, and link utilization.

• International Journal of Highway Engineering
• /
• v.11 no.1
• /
• pp.145-151
• /
• 2009

Current highway design standards is based on the safety under the free flow condition. The length of deceleration lane is also determined in terms of the deceleration distance which is necessary for the driers to adjust the vehicle speed from the speed limit on the main road to that on the exit ramp of the interchange. However, the queues are frequently developed on the deceleration, and the following vehicles to exit must decelerate on the main road. It may cause delay on the main road and traffic accidents. This study is to suggest a methodology to minimize such problems with the shock-wave theory. The queue length of exiting vehicles can be estimated by the design speeds, traffic volumes of main road and the exiting ramp, and the countermeasures to the operational problems. According to the results, the queue length can be shortened to 80% by upgrading the design speed of exit ramp as the amount of 10km/h. Fifty percent of queue length can be shortened by adding an additional lane on the ramp to two lanes.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.32 no.2
• /
• pp.141-147
• /
• 2007

We consider a GI/M/1 queue with vacations such that the server works with different rate rather than completely stops working during a vacation period. We derive the transform of the joint distribution of the length of a busy period, the number of customers served during the busy period, and the length of the subsequent idle period.

• Journal of applied mathematics & informatics
• /
• v.18 no.1_2
• /
• pp.455-464
• /
• 2005

In this paper, we analyze a queueing system with overload control by arrival rates. This paper is motivated by overload control to prevent congestion in telecommunication networks. The arrivals occur dependent upon queue length. In other words, if the queue length increases, the arrivals may be reduced. By considering the burstiness of traffics in telecommunication networks, we assume the arrival to be a Markov-modulated Poisson process. The analysis by the embedded Markov chain method gives to us the performance measures such as loss and delay. The effect of performance measures on system parameters also is given throughout the numerical examples.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1999.10a
• /
• pp.62-62
• /
• 1999

In this paper, we propose a new technique of estimating tail of steady-state queue length distribution; Pr(Q>q), fo ATM multiplexer. Pr(Q>q) is a fundamental measure of network congestion. Assessing Pr(Q>q) properly is crucial for design and control of ATM networks. Data traffic pattern of high-speed networks is highly correlated and bursty. Estimating Pr(Q>q) is very difficult because of correlation and burstiness. We estimate entropy(rate-function) using large deviation principles and threshold bootstrap. Simulation studies are conducted to compare the performance of an existing method and our new method.