• Proceedings of the KSR Conference
• /
• 2005.11a
• /
• pp.1028-1032
• /
• 2005

Due to excessive city's Traffic jam, which an energy and pollution problem of metropolis have risen seriouly, Many industrialized countries have developed many kind of new transportation system for the purpose of substituting the mass traffic. Maglev system has began the revenue operation from Japan and China recently and it is beginning highlighted the new system. We examined specification to be improved in the system and safety of maglev.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 1995.11a
• /
• pp.11-14
• /
• 1995

The question of recruitment qualification and standardization of VTS operators is reviewed through comparison with Air Traffic Control(ATC) The comparison reveals greater difference between the two services than commonality. While ATC enjoys a high degree of uniformity nationally and internationally the provision of VIS is dictated by varying local needs. The variety of those needs makes standardization of VTS operation a questionable short term objective. The paper concludes problem solving techniques such as the formal appreciation provide means of matching recruitment and qualification to local requriements.

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

• Journal of Electrical Engineering and Technology
• /
• v.12 no.1
• /
• pp.411-419
• /
• 2017

The Wireless Mesh Network (WMN) is a multi-hop wireless network consisting of mesh routers and clients, where the mesh routers have minimal mobility and form the backbone. The WMN is primarily designed to access outer network to mesh clients through backhaul gateways. As traffic converges on the gateways, traffic hotspots are likely to form in the neighborhood of the gateways. In this paper, we propose Congestion Aware Multi-path Routing (CAMR) protocol to tackle this problem. Upon congestion, CAMR divides the clients under a mesh STA into two groups and returns a different path for each group. The CAMR protocol triggers multi-path routing in such a manner that the packet reordering problem is avoided. Through simulations, we show that CAMR improves the performance of the WMN in terms of throughput, delay and packet drop ratio.

• Journal of the Korean Professional Engineers Association
• /
• v.19 no.2
• /
• pp.21-25
• /
• 1986

Structure-borne noise due to forced vibration which is originated from subway operation and transmitted to buildings in order of rail-wood tie-concrete bed-structure-soil-building foundations-members of building results in social problem of environmental pollution. Moreover this becomes a serious problem because of the increment of surface traffic and subway operation made by meeting traffic system in crowded cities. Since subway is constructed along the principal road or through the residential area and as the worst case may be, building foundations is contact with top part of subway structure, it is possible that vibration resonance results in fatal damage of buildings. And, structure-borne vibration noise due to subway operation at late and early hours have the residents suffer from insonmia, restlessness and so on. Therefore, to satisfy the future need concerning the environmental protection, this report deals with the influence of structure-borne vibration noise on the basis of the characteristics of Seoul Subway System.

• IE interfaces
• /
• v.15 no.4
• /
• pp.474-482
• /
• 2002

In this paper, we propose a parametric optimization approach to simultaneously determining trip distribution, mode choice, and user-equilibrium assignment. In our model, mode choice decisions are based on a binomial logit model and passenger and cargo demands are divided into appropriate mode according to the user equilibrium minimum travel time. Underlying network consists of road and rail networks combined and mode choice available is auto, bus, truck, passenger rail, and cargo rail. We provide an equivalent convex optimization problem formulation and efficient algorithm for solving this problem. The proposed algorithm was applied to a large scale network examples derived from the National Intermodal Transportation Plan (2000-2019).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.2
• /
• pp.259-267
• /
• 1997

The advent of B-ISDN using ATM(asynchronous transfer mode) made possible a variety of new multimedia services, however it also created a problem of congestion control due to bursty nature of various traffic sources. To tackle this problem, UPC/NPC(user parameter control/network parameter control) have been actively studied and DRLB(dynamic rate leaky bucket) algorithm, in which the token generation rate is changed according to states of data source andbuffer occupancy, is a good example of the UPC/NPC. However, the DRLB algorithm has drawbacks of low efficiency and difficult real-time implementation for bursty traffic sources because the determination of token generation rate in the algorithm is based on the present state of network. In this paper, we propose a more plastic and effective congestion control algorithm by combining the DRLB algorithm and neural network based prediction to remedy the drawbacks of the DRLB algorithm, and verify the efficacy of the proposed method by computer simulations.

• Proceedings of the KIEE Conference
• /
• 1997.11a
• /
• pp.109-112
• /
• 1997

A Discrete Event Dynamic System is a system whose states change in response to the occurrence of events from a predefined event set. A major difficulty in developing analytical results for the systems is the lack of appropriate modeling techniques. This paper proposes the use of Real-time Temporal Logic as a modeling tool for the modeling and control of fixed-time traffic control problem which by way of a DEDS. The Real-time Temporal Logic Frameworks is extended with a suitable structure of modeling hard real-time constraints. Modeling rules are developed for several specific situations. It is shown how the graphical model can be translated to a system of linear equations and constraints.

• Journal of Korean Institute of Industrial Engineers
• /
• v.26 no.2
• /
• pp.155-164
• /
• 2000

Recently Fiber-optic Micro-cellular Wireless Network is considered to solve frequent handoffs and local traffic unbalance in microcellular systems. In this system, central station which is connected to several microcells by optical fiber manages the channels. We propose an efficient sectorization algorithm which dynamically clusters the microcells to minimize the blocked and handoff calls and to balance the traffic loads in each cell. The problem is formulated as an integer linear programming. The objective is to minimize the blocked and handoff calls. To solve this real time sectorization problem the Tabu Search is considered. In the tabu search intensification by Swap and Delete-then-Add (DTA) moves is implemented by short-term memory embodied by two tabu lists. Diversification is considered to investigate proper microcells to change their sectors. Computational results show that the proposed algorithm is highly effective. The solution is almost near the optimal solution and the computation time of the search is considerably reduced compared to the optimal procedure.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.7
• /
• pp.3100-3116
• /
• 2016

With the rapid development of urban traffic system and fast increasing of vehicle numbers, the traditional centralized ways to generate the source-destination shortest path in terms of travel time(the optimal path) encounter several problems, such as high server pressure, low query efficiency, roads state without in-time updating. With the widespread use of smart cameras in the urban traffic and surveillance system, this paper maps the optimal path finding problem in the dynamic road network to the shortest routing problem in the smart camera networks. The proposed distributed optimal path generation algorithm employs the delay routing and caching mechanism. Real-time route update is also presented to adapt to the dynamic road network. The test result shows that this algorithm has advantages in both query time and query packet numbers.