• The Transactions of the Korea Information Processing Society
• /
• v.4 no.10
• /
• pp.2485-2492
• /
• 1997

Nowadays the traffic conditions have been getting worse due to continuous increase in the number of vehicles. So it has become more important to manage traffic signal lights efficiently. Recently fuzzy logic is introduced to control the cycle time of traffic lights adaptively. Conventional fuzzy logic controller adjusts the extension time of current green phase by using the fuzzy input variables such as the number of entering vehicles at the green light and the number of waiting vehicle during the red light. However this scheme is inadequate for an intersection with variable traffic densities. In this paper, a new FLC with asymmetric membership functions that reflects more exactly traffic flows than other FLCs with symmetric ones regardless of few control rules is propsed. The effectiveness of the proposed method was shown through simulation of a single intersection. The experimental results yielded the superior performance of the proposed FLC in terms of the average delay time, the number of passed vehicles, and the degree of saturation.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.20 no.5
• /
• pp.59-74
• /
• 2021

The domestic road space is reaching the limit of planar space distribution, and Increasingly, the importance of three-dimensional space distribution through the development of underground space. therefore, In this study, a study was conducted on a traffic control method that can safely induce two different traffic flows in the connection between the ground road and the underground road. Through VISSIM, we calculated the appropriate amount of outflow and inflow traffic compared to the capacity of the main line when there is a Merge/Diverge section in the underground road. and Through the analysis of the number of conflicts, the appropriate traffic control level for safety in the underground, A basic study was conducted on the level of risk in the underpass according to the level of delay in the ground part through the analysis of the delay scenario of the ground road.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.29 no.4D
• /
• pp.443-450
• /
• 2009

Uninterrupted facility - since there is a close relationship between traffic volume, speed and density -, when a ramp traffic flow merges into the main line, will change the traffic speed or density, and the corresponding correlational model equation will be changed. Thus, this study, using time and space-series traffic data on areas under the influence of such a merging, identified sections which changed the correlation between speed and density variables, and examined such changes. As a result, the upstream and merging sections showed the "Underwood"-shaped exponent, and the downstream after passing the merging section showed a straight line "Greenshields" model. The downstream section which changed the correlation between speed and density showed a gradual downstream movement phenomenon within 100 m-500 m from the end of the third lane linking with the ramp, as the traffic approached the inner lanes. Also, the upstream section, merging section, and downstream section involving a change showed heterogeneous traffic flows which, in the speed-density model, have a statistically different free flow speed (constant) and a different ratio of free flow speed to jam density (gradient).

• ETRI Journal
• /
• v.35 no.3
• /
• pp.414-424
• /
• 2013

We consider a new load balancing routing for delay-guaranteed services in the network in which the traffic is dynamic and network topologies frequently change. For such an ever-changing network, we propose a new online load balancing routing called AntLBR, which exploits the ant colony optimization method. Generally, to achieve load balancing, researchers have tried to calculate the traffic split ratio by solving a complicated linear programming (LP) problem under the static network environment. In contrast, the proposed AntLBR does not make any attempt to solve this complicated LP problem. So as to achieve load balancing, AntLBR simply forwards incoming flows by referring to the amount of pheromone trails. Simulation results indicate that the AntLBR algorithm achieves a more load-balanced network under the changing network environment than techniques used in previous research while guaranteeing the requirements of delay-guaranteed services.

• ETRI Journal
• /
• v.30 no.2
• /
• pp.216-226
• /
• 2008

This paper proposes a novel transport network architecture for the next generation network (NGN) based on the optical burst switching technology. The proposed architecture aims to provide efficient delivery of various types of network traffic by satisfying their quality-of-service constraints. To this end, we have developed a soft-state bandwidth reservation mechanism, which enables NGN transport nodes to dynamically reserve bandwidth needed for active data burst flows. The performance of the proposed mechanism is evaluated by means of numerical analysis and NS2 simulation. Our results show that the packet delay is kept within the constraint for each traffic flow and the burst loss rate is remarkably improved.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.26 no.4
• /
• pp.99-108
• /
• 2001

In the ring loading problem with demand splitting, traffic demands are given for each pall of nodes in an undirected ring network and a flow is routed in either of the two directions, clockwise and counter-clockwise. The load of a link is the sum of the flows routed through the link and the objective of the problem is to minimize the maximum load on the ring. The fastest a1gorithm to date is Myung, Kim and Tcha＇s a1gorithm that runs in Ο(n｜K｜) time where n is the number of nodes and K is the index set of the origin-destination pairs of nodes having flow traffic demands. Here we develop an a1gorithm for the ring loading problem with demand splitting that improves the rerouting step of Myung, Kim and Tcha＇s a1gorithm arid runs in Ο(min{n｜K｜, n$^2$}) time.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06d
• /
• pp.219-221
• /
• 2012

The concave utility in the Network Utility Maximization (NUM) problem is only suitable for elastic flows. In networks with multiclass traffic, the utility can be concave, linear, step or sigmoidal. Hence, the basic NUM becomes a nonconvex optimization problem. The current approach utilizes the standard dual-based decomposition method. It does not converge in case of scarce resource. In this paper, we propose an algorithm that always converges to a local optimal solution to the nonconvex NUM after solving a series of convex approximation problems. Our techniques can be applied to any log-concave utilities.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1995.04a
• /
• pp.451-453
• /
• 1995

This paper examines characteristics of the accounting rate system whereby international telecommunications carriers settle net balances of account arising from bilateral traffic flows. Using a two stage game model, we explain problems in the system: growing traffic and payment imbalances, and resulting conflicts regarding accounting rates between carriers of, say, developed and developing countries. In this paper, we view the problems as a splitting-a-pie game in which one carrier cannot get more without a loss of the other, but total pie size depends upon the accounting rate. Therefore, a natural solution should be inevitably of a Coasian-type to establish a mutual agreement. In this regard, we first derive an efficient accounting rate, in the sense that it can make both carriers better off. Next we suggest some ways of attaining the efficient outcome. Regulatory and policy implications are also discussed.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.2 no.3
• /
• pp.135-149
• /
• 2008

Traditional attack detection schemes based on packets or flows have very high computational complexity. And, network based anomaly detection schemes can reduce the complexity, but they have a limitation to figure out the pattern of the distributed global scale network attack. In this paper, we propose an efficient and fast method for detecting distributed global-scale network attack symptoms in high-speed backbone networks. The proposed method is implemented at the aggregate traffic level. So, our proposed scheme has much lower computational complexity, and is implemented in very high-speed backbone networks. In addition, the proposed method can detect attack patterns, such as attacks in which the target is a certain host or the backbone infrastructure itself, via collaboration of edge routers on the backbone network. The effectiveness of the proposed method are demonstrated via simulation.

• International Journal of Control, Automation, and Systems
• /
• v.5 no.3
• /
• pp.317-323
• /
• 2007

Quality of Service (QoS) in the Internet depends on queuing and sophisticated scheduling in routers. In this paper, we address the issue of managing traffic flows with different priorities. In our reference model, incoming packets are first classified based on their priority, placed into different queues with different capacities, and then multiplexed onto one router link. The fuzzy nature of the information on Internet traffic makes this problem particularly suited to fuzzy methodologies. We propose a new solution that employs a fuzzy inference system to dynamically and efficiently schedule these priority queues. The fuzzy rules are derived to minimize the selected Lyapunov function. Simulation experiments show that the proposed fuzzy scheduling algorithm outperforms the popular Weighted Round Robin (WRR) queue scheduling mechanism.