• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.6
• /
• pp.68-76
• /
• 2008

It is difficult to maintain mutes in the mobile ad hoc network (MANET) due to the high probability of disconnected routes break by frequent change of topology. The links can have the different reliability about data transmission due to these characteristics. Hence a measure which can evaluate this reliability and a algorithm which reflects this are required. In this paper, we propose routing algorithm based on reliability about transmission. First the bayesian inference which infers the hypothesis by past information is considered to obtain the link's transmission reliability. The other is that the link-based reliability estimation model which considers each link's reliability additionally is proposed while the standard uses only Dijkstra's shortest path algorithm. the simulation results using NS-2 show that the performance of proposed algorithm is superior to the standard OLSR in terms of throughput and stability.

• Journal of Communications and Networks
• /
• v.7 no.4
• /
• pp.499-508
• /
• 2005

In this paper, we address the problem of efficient routing and wavelength assignment (RWA) in multi-fiber wavelength division multiplexing (WDM) networks without wavelength translation, under dynamic traffic. We couple Dijkstra's shortest path algorithm with a suitable weight function which chooses optical paths based both on wavelength availability and multi-fiber segments. We compare our approach with other RWA schemes both for regular and irregular WDM multi-fiber network topologies in terms of blocking probability and overall link utilization.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.5
• /
• pp.2362-2378
• /
• 2017

To mitigate the performance degradation caused by performance anomaly, a number of channel assignment algorithms have been proposed for multi-rate wireless mesh networks. However, network conditions have not been fully considered for routing process in these algorithms. In this paper, a joint scheme called Multi-rate Dijkstra's Shortest path - Rate Separated (MDSRS) is proposed, combining routing metrics and channel assignment algorithm. In MDSRS, the routing metric are determined through the synthesized deliberations of link costs and rate matches; then the rate separated channel assignment is operated based on the determined routing metric. In this way, the competitions between high and low rate links are avoided, and performance anomaly problem is settled, and the network capacity is efficiently improved. Theoretical analysis and NS-3 simulation results indicate that, the proposed MDSRS can significantly improve the network throughput, and decrease the average end-to-end delay as well as packet loss probability. Performance improvements could be achieved even in the heavy load network conditions.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.5
• /
• pp.76-87
• /
• 2014

Today the energy consumption of ICT networks is about 10% of the worldwide power consumption and is predicted to increase remarkably in the near future. For this reason, this paper studies energy saving strategies assuring the network-level QoS. In the strategies, the energy consumption of NIC(network interface card) on both endpoint of links decreases by selecting links and making them sleep when the total traffic volume of the IP network is lower than a threshold. In this paper, we propose a heuristic routing algorithm based on so-called delegating/delegated routers, and evaluate its characteristics using computer simulation considering network-level QoS. The selection of sleep links is determined in terms of the number of traffic paths (called min_used path) or the amount of traffics(called min_used traffic) through those kinks. To our experiment, the min_used traffic method shows a little better energy saving but the increased path length compared to the min_used path method. Those two methods have better energy saving characteristics than the random method. This paper confirms that the delegating/delegated router-based routing algorithm results in energy saving effects and sustains network-level QoS in IP networks.

• Journal of Korean Society of Transportation
• /
• v.20 no.1
• /
• pp.77-90
• /
• 2002

Network expansion has been an inevitable method for most traffic equilibrium assignments to consider intersection movements such as intersection delays. The drawback of network expansion is that because it dramatically increases network sizes to emulate possible directional movements as corresponding links, not only is complexities for building network amplified, but computational performance is shrunk. This paper Proposes a new variational inequality formulation for a user-optimal traffic equilibrium assignment model to explicitly consider directional delays without building expanded network structures. In the formulation, directional delay functions are directly embedded into the objective function, thus any modification of networks is not required. By applying a vine-based shortest Path algorithm into the diagonalization algorithm to solve the problem, it is additionally demonstrated that various loop-related movements such as U-Turn, P-Turn, etc., which are frequently witnessed near urban intersections, can also be imitated by blocking some turning movements of intersections. The proposed formulation expects to augment computational performance through reduction of network-building complexities.

• Journal of the Korean Regional Science Association
• /
• v.33 no.1
• /
• pp.29-41
• /
• 2017

This study proposes an integrated accessibility measurement algorithm, which is applied to the Seoul Metropolitan public transportation system consisting of bus and subway networks, and analyzes the result. We construct a public transportation network graph linking bus-subway networks and take the time distance as the link weight in the graph. We develop a time-distance algorithm to measure the time distance between each pair of transit stations based on the T-card transaction database. The average travel time between nodes has been computed via the shortest-path algorithm applied to the time-distance matrix, which is obtained from the average speed of each transit route in the T-card transaction database. Here the walking time between nodes is also taken into account if walking is involved. The integrated time-distance accessibility of each node in the Seoul Metropolitan public transportation system has been computed from the T-card data of 2013. We make a comparison between the results and those of the bus system and of the subway system, and analyze the spatial patterns. This study is the first attempt to measure the integrated time-distance accessibility for the Seoul Metropolitan public transportation system consisting of 16,277 nodes with 600 bus routes and 16 subway lines.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.6
• /
• pp.672-677
• /
• 2016

Development of Internet has been successfully inspired with extensive deployment of the network technology and application. However, increases in Internet usage had caused a lot of traffic overload in these days. Thus, we need a continuous research and development on the network virtualization for effective resource allocation. In this paper, we propose a minimal cost virtual network mapping algorithm using Piecewise Linear Cost Function. We exploited an algorithm with Linear Programming and D-VINE for node mapping, and Shortest Path Algorithm based on linear programming solution is used for link mapping. In this way, we compared and analyzed the average cost for arrival rate of VN request with linear and tree structure. Simulation results show that the average cost of our algorithm shows better efficiency than ViNEyard.

• Journal of Korean Society of Transportation
• /
• v.23 no.1
• /
• pp.103-114
• /
• 2005

The transit fare resulted from the renovation of public transit system in Seoul is basically determined based on the distance-based fare policy (DFP). In DFP, the total fare a passenger has to pay for is calculated by the basic-transfer-premium fare decision rule. The fixed amount of the basic fare is first imposed when a passenger get on a mode and it lasts within the basic travel distance. The transfer fare is additionally imposed when a passenger switches from one mode to another and the fare of the latter mode is higher than the former. The premium fare is also another and the fare of the latter begins to exceed the basic travel distance and increases at the proportion of the premium fare distance. The purpose of this study is to propose an algorithm for finding K number of paths, paths that are sequentially sorted based on total amount of transit fare, under DFP of the idstance-based fare policy. For this purpose, the link mode expansion technique is proposed in order to save notations associated with the travel modes. Thus the existing K shortest path algorithms adaptable for uni-modal network analysis are applicable to the analysis for inter-modal transportation networks. An optimality condition for finding the K shortest fare routes is derived and a corresponding algorithms is developed. The case studies demonstrate that the proposed algorithm may play an important role to provide diverse public transit information considering fare, travel distance, travel time, and number of transfer.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.4
• /
• pp.71-81
• /
• 2010

In grid system, Task scheduling based on list scheduling models has showed low complexity and high efficiency in fully connected processor set environment. However, earlier schemes did not consider sufficiently the communication cost among tasks and the composition process of lightpath for communication in optical gird environment. In this thesis, we propose LSOG (Leveling Selection in Optical Grid) which sets task priority after forming a hierarchical directed acyclic graph (DAG) that is optimized in optical grid environment. To determine priorities of task assignment in the same level, proposed algorithm executes the task with biggest communication cost between itself and its predecessor. Then, it considers the shortest route for communication between tasks. This process improves communication cost in scheduling process through optimizing link resource usage in optical grid environment. We compared LSOG algorithm with conventional ELSA (Extended List Scheduling Algorithm) and SCP (Scheduled Critical Path) algorithm. We could see the enhancement in overall scheduling performance through increment in CCR value and smoothing network environment.

• The KIPS Transactions:PartC
• /
• v.12C no.4 s.100
• /
• pp.543-550
• /
• 2005

Many routing algorithms, proposed for ad-hoc wireless networks, we based on source routing scheme and shortest path route has short lifetime especially in highly dense ad-hoc wireless networks. So some routing protocols such as SSA and ABR are considering the link stability and try finding more stable route. In this paper we propose a new routing algorithm considering utilization metric based on SSA routing algerian in Ad-Hoc networks. To reduce the bottleneck by specific metric of SSA, proposed scheme makes load balancing in networks by distributing the connections to several routes. For the evaluation of the performance we compare our scheme with existent routing protocol AODV and SSA. And the results, obtained using the ns-2 network simulation platform, show good performance that reduced the number of reconstructions remarkably by distributing the whole traffic to several routes when there are several stable routes.