• Journal of the Korea Society for Simulation
• /
• v.15 no.1
• /
• pp.27-33
• /
• 2006

To guarantee QoS (Quality of Service), routers should determine routing paths satisfying service requirements, based on link state information as well as network topology. Link status database (LSD) in routers should be efficiently managed to effectively reflect the current state of all links. However, there is a trade off between the exact reflection of the current link status and its update cost. For exactly reflecting the current link status, each router immediately notifies its neighbors that link state information is changed. This may degrade performance of the router due to the processing of link state update messages. On the other side, if the current link state information is not updated appropriately, a route setup request can be rejected because of the discrepancy between the current link state information and previously updated link state information in LSD. In this paper, we propose a traffic variation based link state update algorithm for adaptively controlling the generation of link state update messages and compare its performance with those of four existing algorithms by intensive simulations.

• Journal of IKEEE
• /
• v.5 no.1 s.8
• /
• pp.24-34
• /
• 2001

IP address lookup is a major bottleneck of IP packet processing in high speed router. Existing IP lookup methods are focused only on lookup throughput without considering lookup table update. So their slow update can lead to lookup blocking or wrong routing decision based on obsolete routes. Especially existing IP lookup methods based on CAM(content addressable memory) have slow update of O(n) cycles in spite of their high throughput and low area complexity In this paper we proposes a new IP address lookup method based on pipelined CAM architecture(PICAM) with fast update of O(1) cycle of lookup table and high throughput and low area complexity.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04d
• /
• pp.448-450
• /
• 2003

인터넷 프로토콜의 이동성 지원(Mobile IP)은 단말의 이동성(host mobility)뿐만 아니라 네트워크의 이동성(network mobility)까지도 지원하도록 확장되고 있다. 그러나 이동 네트워크(mobile network)의 내부에 이동 단말(mobile host) 또는 이동 네트워크가 존재하는 경우와 칼이 중첩된 이동 네트워크(nested mobile network)의 경우 데이터가 전송되는 경로가 삼각형 또는 그 이상으로 복잡해지는 Triangular Routing 또는 Pinball Routing 문제가 발생하게 된다. 본 논문에서는 대응 단말(Correspondent node) 또는 Home Agent에서 위치 정보가 갱신(Binding Update)되는 과정을 재귀적으로 수행하게 함으로써 중첩된 이동 네트워크에서 최적의 경로로 데이터를 전달할 수 있도록 하는 방법을 제시한다.

• Journal of KIISE:Information Networking
• /
• v.29 no.3
• /
• pp.224-232
• /
• 2002

The routing protocols designed for wired networks can hardly be used for mobile ad-hoc networks due to limited bandwidth of wireless transmission and unpredictable topological change. Recently, several routing protocols for mobile ad-hoc networks have been proposed. However, when these protocols are applied to support real time services like multimedia transmission, they still have problems in ad-hoe networks, where the topology changes drastically. In this paper, we propose a new route selection algorithm which selects the most reliable rouse that is impervious to route failures by topological changes by mobile hosts. For reliable route selection, the concept of virtual zone (stable lone and caution zone) is proposed. The lone is located in a mobile node's transmission range and determined by mobile node's mobility information received by Global Positioning System (GPS). The proposed algorithm is applied to the route discovery procedure of the existing on-demand routing protocol, AODV, and evaluated by simulation in various traffic conditions and mobility patterns.

• International conference on construction engineering and project management
• /
• 2020.12a
• /
• pp.510-519
• /
• 2020

Within an intelligent automated cyber-physical system, the realization of the autonomous mechanism for data collection, data integration, and data analysis plays a critical role in the design, development, operation, and maintenance of such a system. This construct is particularly vital for fault-tolerant route-finding systems that rely on the imprecise GPS location of the vehicles to properly operate, timely plan, and continuously produce informative feedback to the user. More essentially, the integration of digital twins with cyber-physical route-finding systems has been overlooked in intelligent transportation services with the capacity to construct the network routes solely from the locations of the operating vehicles. To address this limitation, the present study proposes a conceptual architecture that employs digital twin to autonomously maintain, update, and manage intelligent transportation systems. This virtual management simulation can improve the accuracy of time-of-arrival prediction based on auto-generated routes on which the vehicle's real-time location is mapped. To that end, first, an intelligent transportation system was developed based on two primary mechanisms: 1) an automated route finding process in which predictive data-driven models (i.e., regularized least-squares regression) can elicit the geometry and direction of the routes of the transportation network from the cloud of geotagged data points of the operating vehicles and 2) an intelligent mapping process capable of accurately locating the vehicles on the map whereby their arrival times to any point on the route can be estimated. Afterward, the digital representations of the physical entities (i.e., vehicles and routes) were simulated based on the auto-generated routes and the vehicles' locations in near-real-time. Finally, the feasibility and usability of the presented conceptual framework were evaluated through the comparison between the primary characteristics of the physical entities with their digital representations. The proposed architecture can be used by the vehicle-tracking applications dependent on geotagged data for digital mapping and location tracking of vehicles under a systematic comparison and simulation cyber-physical system.

• Journal of Korea Multimedia Society
• /
• v.25 no.8
• /
• pp.1007-1021
• /
• 2022

Autonomous driving of unmanned aerial vehicles may have to pay expensive cost to create and switch new routes if unexpected obstacles exist or local map updates occured by the control system due to incorrect route information. Integrating digital twins into the path-following process requires more computing resources to quickly switch the wrong path to an alternative path, but it can quickly update the path during flight. In this study, we design a DEVS-based simulation environment which can modify optimized paths through short-term simulation of multi-virtual UAVs for applying digital twin concepts to path follow. Through simulation, we confirmed the possibility of increasing the mission stability of UAV.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.2
• /
• pp.89-95
• /
• 2017

There are a variety of apps that are finding their way. And in car navigation, we launched a product that reflects Augmented Reality technology this year. However, existing apps have problems. It is implemented in 2D or 3D, has a large error range because it has been modified in most vehicles, is not updated in real time, and car augmented reality navigation is a vehicle, and a separate device is required, etc. In this study, we implemented a smartphone app for walking directions using augmented reality, and made it possible to intuitively use a route service from a user 's location to a destination. The Dijkstra algorithm is applied to calculate the shortest path to solve the problem of finding the route with the least cost. By using this application, it is possible to use the route search service even in a data-free environment, to solve the inconvenience of the language barrier, and to update in real time, so that the latest information can be always maintained. In the future, we want to develop an app that can be commercialized by using a character in the path to promote it.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.12A
• /
• pp.1160-1170
• /
• 2010

Existing multipath routing mechanism has much overhead to maintain the state of nodes on the multipath route and does not guarantees completely disjoint multipath construction from source to destination. In this paper, we propose an Explicit Disjoint Multipath (EDM) routing algorithm to enhance energy efficiency through removing the flooding mechanism for route discovery process, minimizing the number of nodes participating in route update and balancing the traffic load for entire network. EDM constructs logical pipelines which can create disjoint multipaths in logical way. Then it physically performs anchor node based geographic routing along the logical pipeline in order to build multipath to the destination. EDM can provide the distribution effect of traffic load over the network, help to balance the energy consumption and therefore extend the network lifetime.

• Journal of Internet Computing and Services
• /
• v.12 no.4
• /
• pp.173-180
• /
• 2011

Various smart-phone applications for location-based service are enabled through mobile communications such as 3G and WiFi. We have developed MARS, an advanced location-based route-search application based on the Android platform. It provides three functions: route-registration, route-search, and route-evaluation. These functions are dynamically maintained by a web server, a database server, and user mobile terminals. As users can update location information using their smart-phone devices, servers provide the information and allow users to add, modify, and remove their own information as well as adding comments to others, while existing map services do not support direct inputs from users. We show our implementation process and demonstration of its operations. We also show the comparison results with existing services. Through these results, we can confirm that MARS can achieve better performance.

• Journal of KIISE:Information Networking
• /
• v.29 no.5
• /
• pp.573-582
• /
• 2002

We propose centralized server based QoS routing schemes, where a route server is responsible for determining QoS paths on behalf of all the routers in a routing domain. In the proposed server based schemes, the dynamic link QoS state information, which is required for a QoS path computation, is implicitly maintained at route server as it assigns or gets back QoS paths. By maintaining the network state information this way, we may not only eliminate the overhead to exchange network state update message but also achieve higher routing performance by utilizing accurate network state information in path computation. We discuss path caching techniques for reducing the amount of path computation overhead at the route server, and evaluate the performance of the proposed schemes using simulation. The simulation results show that the path caching schemes may significantly reduce the route server load. The proposed schemes are also compared to the distributed QoS routing schemes proposed in the literature. It has been shown that the proposed server based schemes not only enhance the routing performance, but they are also competitive with respect to routing overheads.