Filters








2,563 Hits in 3.5 sec

Research on Ship Meteorological Route Based on A-Star Algorithm

Ge Chen, Tao Wu, Zheng Zhou, Xianyong Li
2021 Mathematical Problems in Engineering  
The best route is a balance between economy and safety, that is, based on ensuring the safety of ship navigation, the route that meets the shortest navigation time, the least fuel consumption, or the least  ...  algorithm at each node is restricted, and an improved A-star algorithm is proposed.  ...  It constantly checks the nodes adjacent to the current node in the set of all nodes that have not found the shortest path and adds the node with the smallest cost value from the set of all nodes that have  ... 
doi:10.1155/2021/9989731 fatcat:dumwj3kw2rashns6zw4x3trbsq

Efficient Route Planning with Temporary Driving Bans, Road Closures, and Rated Parking Areas [article]

Alexander Kleff, Frank Schulz, Jakob Wagenblatt, Tim Zeitz
2020 arXiv   pre-print
Our goal is to find Pareto-optimal routes with regards to arrival time at the destination and total cost.  ...  In this setting, feasible routes may require waiting at parking areas, and several feasible routes with different trade-offs between waiting and driving detours around closed areas may exist.  ...  Given a path, a route with that path which arrives as soon as possible has also minimal travel time cost.  ... 
arXiv:2004.09163v1 fatcat:jue6jldcqbbibhhrnipscc4yya

Timing-Driven Interconnect Synthesis [chapter]

Jiang Hu, Gabriel Robins, Cliff Sze
2008 Handbook of Algorithms for Physical Design Automation  
However, during that early era in the evolution of VLSI CAD, routing solutions were typically not available during the placement phase.  ...  ., Steiner) interconnect trees, especially as die sizes continue to grow while feature dimensions steadily shrink. 1 The exposition below focuses on selected approaches to performance-driven routing, and  ...  ., shortest paths) tree, while increasing ǫ loosens the radius restriction, thus allowing further tree cost optimization. At the other extreme, setting ǫ = ∞ results in a minimum-cost spanning tree.  ... 
doi:10.1201/9781420013481.ch25 fatcat:hprn5yjm4balzg3poc4f3q6ifm

Routing in Wireless Sensor Networks [chapter]

2017 Network Routing  
We give a survey of state-of-the-art routing techniques with a focus on geographic routing, a paradigm that enables a reactive message-efficient routing without prior route discovery or knowledge of the  ...  Different geographic routing strategies are described as well as beaconless routing techniques. We also show the physical layer impact on routing and outline further research directions.  ...  Additionally, it is shown in [15] that power-, cost-, and power-cost-routing is competitive with Dijkstra's single source shortest path algorithm using the general power, cost, and power-cost metric,  ... 
doi:10.1002/9781119114864.ch11 fatcat:2x3gnyy2g5ezjpgyzs7i3txjl4

Efficient Route Planning with Temporary Driving Bans, Road Closures, and Rated Parking Areas

Alexander Kleff, Frank Schulz, Jakob Wagenblatt, Tim Zeitz, Domenico Cantone, Simone Faro
2020 Symposium on Experimental and Efficient Algorithms  
Our goal is to find Pareto-optimal routes with regards to arrival time at the destination and total cost.  ...  In this setting, feasible routes may require waiting at parking areas, and several feasible routes with different trade-offs between waiting and driving detours around closed areas may exist.  ...  Road closures and country-wide driving bans lead to different optimal routes. When there is a road closure on the shortest path ignoring any driving restrictions, we often have two optimal routes.  ... 
doi:10.4230/lipics.sea.2020.17 dblp:conf/wea/Kleff0WZ20 fatcat:tr6ml6dhjvafdjphgwqfpo4xkq

A Distributed Algorithm for the Dead End Problem of Location Based Routing in Sensor Networks

L. Zou, M. Lu, Z. Xiong
2005 IEEE Transactions on Vehicular Technology  
Current solutions to this problem are insufficient in either eliminating traffic/path memorization or finding satisfactory short paths.  ...  In this paper, we propose a novel algorithm, called partial-partition avoiding geographic routing (PAGER), to solve the problem.  ...  The performance of PAGER-S/M is compared with AODV, GPSR, and the shortest path with respect to delivery ratio, path length, routing overhead, and energy efficiency.  ... 
doi:10.1109/tvt.2005.851327 fatcat:6o27ynebgjhhvpsbhaqavj74lm

Multi-constrained Routing Optimization for Data Center Network

Feng-jun Shang, Xing Chen
2017 DEStech Transactions on Engineering and Technology Research  
Some SCDC-based routing algorithms had been proposed, but these algorithms have the following disadvantages:1) The most advanced routing algorithms in SCDC are only considering hop count in path selection  ...  ;2) Traditional QOS multiconstrained routing algorithms usually find one available path and is oriented to the switches; 3) The current multi-path algorithm cannot guarantee the quality of the selected  ...  meet the constraint requirements, we calculate the path cost: q q i i i c v v v w v v v COST 1 4 1 4 2 1 4 2 1 } ] ) , , ( [ { ) , , (    (8) If the path does not satisfy the restriction, the path is  ... 
doi:10.12783/dtetr/apetc2017/11265 fatcat:kefed5nfarginbu4rgoj2f4nmy

Scalable geographic routing algorithms for wireless ad hoc networks

H. Frey
2004 IEEE Network  
About fifteen years ago heuristic greedy algorithms have been proposed, which in order to provide loop-freedom might fail even if there is a path from source to destination.  ...  This article provides a tutorial for this class of geographic routing algorithms and will discuss recent improvements to both greedy forwarding and routing in planar graphs.  ...  Additionally, it is shown that power-, cost-, and power-cost-aware greedy routing is competitive with Dijkstra single source shortest path algorithm using the general power, cost, and power-cost metric  ... 
doi:10.1109/mnet.2004.1316756 fatcat:szjniplj4jhdpo4s4k3r54w354

Routing Optimization in IP Networks Utilizing Additive and Concave Link Metrics

Anton Riedl, Dominic A. Schupke
2007 IEEE/ACM Transactions on Networking  
Routing optimization provides network operators with a powerful method for traffic engineering.  ...  Unlike other work in this area, we consider routing protocols, which are able to take into account concave routing metrics in addition to additive ones.  ...  OSPF allows equal-cost load sharing, which means that traffic for a certain destination is split equally over all routes with the same shortest path lengths (equal-cost multipath, ECMP).  ... 
doi:10.1109/tnet.2007.902546 fatcat:deo3ejgctref5lxxdgwtlxwxiu

QoS routing in networks with uncertain parameters

D.H. Lorenz, A. Orda
1998 IEEE/ACM Transactions on Networking  
Our solution is similar to that of the restricted shortest-path problem, which renders itself to near-optimal approximations of polynomial complexity.  ...  This work considers the problem of routing connections with Qo!3 requirements across networks, when the information available for ma:king routing decisions is inaccurate.  ...  Problem RSP (Restricted Shortest Path): Given a network G (V, E), a delay and a cost for each link {dz, Ct}l=E and a maximal delay D, find a path p* s.t.  ... 
doi:10.1109/90.748088 fatcat:7uy44r5xrzduxgwzer6myuedxy

Minimizing re-routing in MPLS networks with preemption-aware constraint-based routing

Balázs Szviatovszki, Áron Szentesi, Alpár Jüttner
2002 Computer Communications  
The difference between priority-based path selection methods and previously proposed CSPF methods lies in the way the selection is done among equal cost shortest paths.  ...  In this paper, we study the effect of distributed constrained shortest path first (CSPF) based path selection on the dynamics of LSP preemption in Multiprotocol Label Switching (MPLS) networks.  ...  Therefore, CSPF aims at minimizing resource usage by restricting path selection to a shortest path that satisfies the bandwidth constraints.  ... 
doi:10.1016/s0140-3664(02)00025-7 fatcat:ijl4uojdpfe4ver5jbvcxadqhm

Routing in Turn-Prohibition Based Feed-Forward Networks [chapter]

Markus Fidler, Gerrit Einhoff
2004 Lecture Notes in Computer Science  
Then, we address the general case and introduce the Turnnet concept, which supports arbitrary combinations of routing algorithms with turn-prohibiting feed-forward mechanisms.  ...  Unfortunately, current routing algorithms are usually not equipped to handle forbidden turns and the required extensions are nontriviaL We discuss the relevant issues for the example of the widely deployed  ...  This work was supported in part by the Path Allocation in Backhone Networks (PAB) project funded by the German Research Network (DFN) and the Federal Ministry of Education and Research (BMBF) and in part  ... 
doi:10.1007/978-3-540-24693-0_96 fatcat:wwakzbhk4nfxzgausb2kxrudgm

Comparative analysis of path computation techniques for MPLS traffic engineering

Gargi Banerjee, Deepinder Sidhu
2002 Computer Networks  
This necessitates the development of sophisticated path selection algorithms which deviate from the shortest-path routing philosophy in traditional IP networks.  ...  request blocking probability, reduction in network costs and load distribution.  ...  Related to MCP, but with a slightly different objective is the restricted shortest-path (RSP) problem.  ... 
doi:10.1016/s1389-1286(02)00270-0 fatcat:a2wgyf3navdjhg4xioe76y66ty

A Characterized And Optimized Approach For End-To-End Delay Constrained Qos Routing

P.S.Prakash, S.Selvan
2008 Zenodo  
The ODCR which uses an adaptive path weight function together with an additional constraint imposed on the path cost, to restrict search space and hence ODCR finds near optimal solution in much quicker  ...  to find low-cost paths that satisfy given QoS constraints.  ...  / c , D(P)/ d ], the algorithm finds the shortest path with both cost and delay are far from their bounds.  ... 
doi:10.5281/zenodo.1072049 fatcat:alwp4exsqfa5zb44xjszc2njam

The VPN Conjecture Is True

Navin Goyal, Neil Olver, F. Bruce Shepherd
2013 Journal of the ACM  
We are given an undirected graph G = (V, E) with edges costs c(e) and a set of terminal nodes W . A hose matrix for W is any symmetric matrix (D ij ) such that for each i, j =i D ij ≤ 1.  ...  An oblivious routing template, in this context, is a simple path P ij for each pair i, j ∈ W .  ...  path routing problem, the flows in the routing template are restricted to be unsplittable, i.e. each pair i,j routes along a single path P ij .  ... 
doi:10.1145/2487241.2487243 fatcat:pjb5s542m5c3bcv5pa5eoidbxi
« Previous Showing results 1 — 15 out of 2,563 results