• Journal of Internet Computing and Services
• /
• v.7 no.1
• /
• pp.143-150
• /
• 2006

The quickest path problem deals with the transmission of a message of size ${\sigma}$ from a source to a destination with the minimum end to end delay over a network with bandwidth and delay constraints on the links. We consider two basic modes and four variations for the message delivery at the nodes reflecting the mechanisms such as circuit switching. Internet protocol, and their combinations, For each of first five modes, we present O($m^2+mnlogn$) algorithm to compute the quickest path for a given message size ${\sigma}$, For the last mode, the quickest path can be computed in O(m+nlogn) time.

• Journal of Korean Society for Quality Management
• /
• v.26 no.1
• /
• pp.192-200
• /
• 1998

The quickest path problem is one of the important things for quality of services in communication networks. It is to find a path to send a given amount of data from the source to the sink with minimum transmission time, where the transmission time is dependent on both the capacities and the traversal times of the arcs in the network. This is found under the networks that the capacity and the lead time of each ring are predetermined. It is general to solve the quickest path problem using shortest path algorithms. The relevant algorithms proposed till now are based on the capacity of rings in distributed environments. When the configuration of networks is changed, there can be two a, pp.oaches to find the quickest paths. The one is to find new quickest paths, and the other is to update the current quickest paths. As one of the algorithms for the latter, the distributed quickest path update algorithm was proposed. This paper aims to propose the distributed algorithm a, pp.icable to find the quickest path, when the configuration of networks is changed, using the quickest path tree update altorithm, and to verify its possibility of a, pp.ication by analyzing the transmission amount of data from one node to another from the theoretical point of view.

• Journal of the military operations research society of Korea
• /
• v.26 no.2
• /
• pp.1-7
• /
• 2000

A quickest path in a network is a path that takes the shortest time to send the amount of data from the source node to the sink node. Martin and Santos presented a theorem on the quickest path by which a quickest path for the amount of data is determined. However, we find a counterexample to Martins and Santos' theorem. In this paper, we present the corrected theorem and give a revised algorithm for finding quickest paths.

• Proceedings of the KOR-KST Conference
• /
• 2007.05a
• /
• pp.681-690
• /
• 2007

• Journal of Korean Society of Transportation
• /
• v.25 no.6
• /
• pp.197-208
• /
• 2007

Enormously sized buildings are appearing world-wide with the advancement of construction techniques. Large-scaled and complicated structures will have increased difficulties for dealing with safety, and will demand well-matched safety measures. This research introduced up-to-date techniques and systems which are applied in buildings in foreign nations. Furthermore, it proposed s direct guidance plan for buildings in case of fire. Since it is possible to install wireless sensor networks which detect fires or effects of fire, the plan makes use of this information. Accordingly, the authors completed a direct guidance plan that was based on omnidirectional guidance lights. It is possible to select a route with concern about both time and capacity with a concept of a non-dominated path. Finally, case studies showed that quickest path algorithms were effective for guiding efficient dispersion routes and in case of restriction of certain links in preferred paths due to temperature and smoke, it was possible to avoid relevant links and to restrict demand in the network application. Consequently, the algorithms were able to maximize safety and minimize evacuation time, which were the purposes of this study.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.04b
• /
• pp.1165-1168
• /
• 2001

최단경로문제(Shortest Path Problem)는 네트???p에서 하나 혹은 그 이상의 노드들의 쌍 사이에서 가장 짧은 경로, 가장 저렴한 경로 또는 가장 신뢰할 만한 경로를 찾을 때 고려된다. 컴퓨터나 통신망들은 edge-weighted 그래프로 대치될 수 있으며 그렇게 함으로써 최단 경로를 찾아줄 수 있다. 통신 링크는 실제 실패할 수도 있고, 또한 전송될 데이터의 양에 따라 전달되는 시간이 달라지기도 하므로, 가장 신뢰할만한 경로 중에서 가장 빠른 경로(The Quickest Most Reliable Path) 문제와 가장 빠른 경로 중에서 가장 신뢰할만한 경로(The Most Reliable Quickest Path) 문제는 최단경로문제보다 더 현실적이다[1]. 이 논문에서는 그 중 '가장 신뢰할만한 경로 중에서 가장 빠른 경로' 문제를 자바를 사용하여 시각화함으로써 가변 상황에 따라 다른 경로를 찾아주는 과정을 보여준다.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.05a
• /
• pp.14-20
• /
• 2003

Supply chain is the link that moves products between suppliers, manufactures, wholesalers, distribution, retailers and ended consumers. Supply chain management(SCM) is a way to supervise the flow of products, materials and information as they move along the supply chain. In the recent years, Most of the companies are in a hurry the introduction of SCM to obtain international competitiveness. The goal of SCM is to optimize the supply chain, which can not only reduce inventories, but may also create a higher profit margin for finished goods by giving customers exactly what they want. There are four major decision areas (location, production, inventory, transportation) in supply chain management, and there are both strategic and operational elements in each of these decision areas. This paper is concerned with the integrated production planning problem including not only the production cost but also the transportation cost in supply chains, and an efficient algorithm using genetic algorithm and quickest path method is presented to solve the problem.

• The Transactions of the Korea Information Processing Society
• /
• v.13 no.6
• /
• pp.269-277
• /
• 2024

With the advancement of modern IT technologies, the operation of autonomous vehicles is becoming a reality, and route planning is essential for this. Generally, route planning involves proposing the shortest path to minimize travel distance and the quickest path to minimize travel time. However, the quality of these routes depends on the topological characteristics of the road network graph. If the connectivity structure of the road network is not rational, there are limits to the performance improvement that routing algorithms can achieve. Real drivers consider psychological factors such as the number of turns, surrounding environment, traffic congestion, and road quality when choosing routes, and they particularly prefer routes with fewer turns. This paper introduces a simple path algorithm that seeks routes with the fewest turns, in addition to the traditional shortest distance and quickest time routes, to evaluate the characteristics of road networks. Using this simple path algorithm, we compare and evaluate the connectivity characteristics of road networks in 20 major cities worldwide. By analyzing these road network characteristics, we can identify the strengths and weaknesses of urban road networks and develop more efficient and safer route planning algorithms. This paper comprehensively examines the quality of road networks and the efficiency of route planning by analyzing and comparing the road network characteristics of each city using the proposed simple path algorithm.

• International Journal of Computer Science & Network Security
• /
• v.22 no.10
• /
• pp.67-72
• /
• 2022

A wireless sensor network (WSN), with its constrained sensor node energy supply, needs an energy-efficient routing technique that maximises overall system performance. When rumours are routed using a random-walk routing algorithm, which is not highly scalable, spiral pathways may appear. Because humans think a straight line is the quickest route between two sites and two straight lines in a plane are likely to intersect, straight-line routing (SLR) constructs a straight path without the aid of geographic information. This protocol was developed for WSNs. As a result, sensor nodes in WSNs use less energy when using SLR. Using comprehensive simulation data, we show that our upgraded SLR systems outperform rumour routing in terms of performance and energy conservation.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.28 no.4D
• /
• pp.459-467
• /
• 2008

Because of the insufficiency of ground space, the utilization of underground is getting more and more in these days. Moreover, underground space is being used not only buildings but multipurpose space for movement, storage and shopping. However, ground space has vital weakness for fire compared to ground space. Especially in case of underground shopping center, there are various stuffs to burn and poisonous gas can be exposed on this count when the space is burned. A large number of casualties can be also occurred from conflagration as underground space has closed structures that prevent rapid evacuation and access. Therefore, this research proposes the guidance methodology for evacuation from conflagration in large-sized underground facilities. In addition, suggested methodology uses high technology wireless sensor information from up-to-date ubiquitous sensor networks. Fire information collected by sensors is integrated with existing underground facilities information and this is sent to guidance systems by inducing process. In the end, this information is used for minimum time paths finding algorithm considering the passageway capacity and distance. Also, usefulness and inadequacies of proposed methodology is verified by a case study.