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

• ETRI Journal
• /
• v.28 no.5
• /
• pp.593-606
• /
• 2006

Thanks to the great possibilities of providing different types of telecommunication traffic to a large geographical area, satellite networks are expected to be an essential component of the next-generation internet. As a result, issues concerning the designing and testing of efficient connection-admission-control (CAC) strategies in order to increase the quality of service (QoS) for multimedia traffic sources, are attractive and at the cutting edge of research. This paper investigates the potential strengths of a generic digital-video-broadcasting return-channel-via-satellite (DVB-RCS) system architecture, proposing a new CAC algorithm with the aim of efficiently managing real-time multimedia video sources, both with constant and high variable data rate transmission; moreover, the proposed admission strategy is compared with a well-known iterative CAC mainly designed for the managing of real-time bursty traffic sources in order to demonstrate that the new algorithm is also well suited for those traffic sources. Performance analysis shows that, both algorithms guarantee the agreed QoS to real-time bursty connections that are more sensitive to delay jitter; however, our proposed algorithm can also manage interactive real-time multimedia traffic sources in high load and mixed traffic conditions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.9
• /
• pp.1492-1512
• /
• 2011

Due to multiple hops, mobility and time-varying channel, supporting delay sensitive real-time traffic in wireless local area network-based (WLAN) mesh networks is a challenging task. In particular for real-time traffic subject to medium access control (MAC) layer control overhead, such as preamble, carrier sense waiting time and the random backoff period, the performance of real-time flows will be degraded greatly. In order to support real-time traffic, an efficient adaptive packet scheduling (APS) scheme is proposed, which aims to improve the system performance by guaranteeing inter-class, intra-class service differentiation and adaptively adjusting the packet length. APS classifies incoming packets by the IEEE 802.11e access class and then queued into a suitable buffer queue. APS employs strict priority service discipline for resource allocation among different service classes to achieve inter-class fairness. By estimating the received signal to interference plus noise ratio (SINR) per bit and current link condition, APS is able to calculate the optimized packet length with bi-dimensional markov MAC model to improve system performance. To achieve the fairness of intra-class, APS also takes maximum tolerable packet delay, transmission requests, and average allocation transmission into consideration to allocate transmission opportunity to the corresponding traffic. Detailed simulation results and comparison with IEEE 802.11e enhanced distributed channel access (EDCA) scheme show that the proposed APS scheme is able to effectively provide inter-class and intra-class differentiate services and improve QoS for real-time traffic in terms of throughput, end-to-end delay, packet loss rate and fairness.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.737-740
• /
• 1999

This paper deals with a real time optimization algorithm within real time for DRGS(Dynamic Route Guidance System) and evaluate the algorithm. A pre-developed system offers the optimal route in using only static traffic information. In using real-time traffic information, Dynamic route guidance algorithm is needed. The serious problem in implementing it is processing time increase as nodes increase and then the real time processing is impossible. Thus, in this paper we propose the optimal route algorithm with window mechanism for the real-time processing and then evaluate the algorithms.

• Journal of Korean Society for Atmospheric Environment
• /
• v.27 no.4
• /
• pp.443-453
• /
• 2011

Real-time Traffic Information Service could play a key role in reducing incomplete combustion time remarkably since it can provide traffic information in real-time basis. Emission characteristics of test engines were studied in terms of travel distance and speed. The present study focused on a north district in Daegu, 12 km. The driving for the emission test was done at 8AM, 3PM, 7PM which represents various traffic conditions. The reduced emissions of Greenhouse Gases (GHG) have been measured for a travel distance running at different loads (conventional shortest route and Real-time Traffic Information) and GHG ($CO_2$, $CH_4$, $N_2O$) are all inventoried and calculated in terms of existing emission factors. The emission of GHG has been shown to reduce linearly with travel distance: $CO_2$ (9.15%), $CH_4$ (18.43%), $N_2O$(18.62%).

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.40.1-40
• /
• 2001

In this paper, control theoretic approaches are proposed to guarantee QoS (Quality of Series) such as packet delay and packet loss of real-time traffic in high-speed communication network. Characteristics of variable rate real-time traÆc in communication networks are described. The mathematical model describing networks including source and destination nodes are suggested. By a traffic control mechanism, it is shown that worst-case end-to-end transfer delay of traffic can be controlled and packet loss can be prevented. The simulation shows results of delay control and buer level control to raise QoS in realtime traffic.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.5 no.4
• /
• pp.360-366
• /
• 2005

In the past, when there were few vehicles on the road, the T.O.D.(Time of Day) traffic signal worked very well. The T.O.D. signal operates on a preset signal cycling which cycles on the basis of the average number of average passenger cars in the memory device of an electric signal unit. Now days, with increasing many vehicles on restricted roads, the conventional traffic light creates startup-delay time and end-lag-time. The conventional traffic light loses the function of optimal cycle. And so, $30-45\%$ of conventional traffic cycle is not matched to the present traffic cycle. In this paper we proposes electro sensitive traffic light using fuzzy look up table method which will reduce the average vehicle waiting time and improve average vehicle speed. Computer simulation results prove that reducing the average vehicle waiting time which proposed considering passing vehicle length for optimal traffic cycle is better than fixed signal method which doesn't consider vehicle length.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.2
• /
• pp.236-247
• /
• 2002

We propose a cell－multiplexing scheme for the real－time communication service in ATM network and a new service discipline guarantee end-to-end delay based on pseudo-isochronous cell switching. The proposed scheme consists of two level frame hierarchy, upper and lower frame, which is used to assign the bandwidth and to guarantee the requested delay bound, respectively. Since the Proposed algorithm employs two level frame hierarchy, it can overcome the coupling problem which is inherent to the framing strategy It can be comparatively reduce the complexity, and still guarantee the diverse delay bounds of end-to-end. Besides, it consists of two components, traffic controller and scheduller, as the imput traffic description model and regulates the input traffic specification. The function of the traffic controller is to shape real -time traffic to have the same input pattern at every switch along the path. The end-to-end delay is bounded by the scheduller which can limit the delay variation without using per-session jitter controllers, and therefore it can decrease the required buffer size. The proposed algorithm can support the QoS's of non-real time traffic as well as those of real time traffic.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.7 no.1
• /
• pp.15-23
• /
• 2003

ATM networks provide the various kinds of service which require the different Quality of Services(QoS) such as loss and delay. By statistically multiplexing of traffics and the uncertainty and fluctuation of source traffic pattern, the congestion may occur. The leaky bucket scheme is a representative policing mechanism for preventive congestion control. In this paper, we analyze the HOL(Head-of-Line) priority leaky bucket scheme. That is, traffics are classified into real-time and nonreal-time traffic. The real-time traffic has priority over nonreal-time traffic for transmission. For proposed mechanism, we obtain the system state distribution, finally the loss probability and the mean waiting time of real-time and nonreal-time traffic. The simple numerical examples also are presented.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.33 no.4
• /
• pp.287-296
• /
• 2015

Recent navigation systems provide quick guide services, based on processing real-time traffic information and past traffic information by applying predictable pattern for traffic information. However, the current pattern for traffic information predicts traffic information by processing past information that it presents an inaccuracy problem in particular circumstances(accidents and weather). So, this study presented a more precise predictive traffic information system than historical traffic data first by analyzing route search data which the drivers ask in real time for the quickest way then by grasping traffic congestion levels of the route in which future drivers are supposed to locate. First results of this study, the congested route from Yang Jae to Mapo, the analysis result shows that the accuracy of the weighted value of speed of existing commonly congested road registered an error rate of 3km/h to 18km/h, however, after applying the real predictive traffic information of this study the error rate registered only 1km/h to 5km/h. Second, in terms of quality of route as compared to the existing route which allowed for an earlier arrival to the destination up to a maximum of 9 minutes and an average of up to 3 minutes that the reliability of predictable results has been secured. Third, new method allows for the prediction of congested levels and deduces results of route searches that avoid possibly congested routes and to reflect accurate real-time data in comparison with existing route searches. Therefore, this study enabled not only the predictable gathering of information regarding traffic density through route searches, but it also made real-time quick route searches based on this mechanism that convinced that this new method will contribute to diffusing future traffic flow.