Open shortest path first routing under random early detection
Sign Up to like & getrecommendations! Published in 2018 at "Networks"
DOI: 10.1002/net.21792
Abstract: In this article, we consider a variant of Open Shortest Path First (OSPF) routing that accounts for Random Early Detection (RED), an Active Queue Management method for backbone networks. In the version of OSPF we… read more here.
Keywords: open shortest; early detection; path first; shortest path ... See more keywords
On the Complexity of the Bilevel Shortest Path Problem
Sign Up to like & getrecommendations! Published in 2024 at "Networks"
DOI: 10.1002/net.70002
Abstract: We introduce a new bilevel version of the classic shortest path problem and completely characterize its computational complexity with respect to several problem variants. In our problem, the leader and the follower each control a… read more here.
Keywords: problem; path; complexity; shortest path ... See more keywords
Fault-Tolerant Approximate Shortest-Path Trees
Sign Up to like & getrecommendations! Published in 2017 at "Algorithmica"
DOI: 10.1007/s00453-017-0396-z
Abstract: The resiliency of a network is its ability to remain effectively functioning also when any of its nodes or links fails. However, to reduce operational and set-up costs, a network should be small in size,… read more here.
Keywords: path trees; fault tolerant; case; shortest path ... See more keywords
A new semi-local centrality for identifying influential nodes based on local average shortest path with extended neighborhood
Sign Up to like & getrecommendations! Published in 2024 at "Artificial Intelligence Review"
DOI: 10.1007/s10462-024-10725-2
Abstract: Quantifying the importance of nodes in complex networks is known as the problem of identifying influential nodes and is considered a critical aspect in interacting with these networks. This problem has many applications such as… read more here.
Keywords: influential nodes; extended neighborhood; centrality; average shortest ... See more keywords
A novel deep neural networks based path prediction
Sign Up to like & getrecommendations! Published in 2020 at "Cluster Computing"
DOI: 10.1007/s10586-020-03056-8
Abstract: With the advancements in sensor applications, wireless sensor networks (WSNs) become significant area of research. WSNs compose various tiny sensor nodes to sense an environment, depends upon the given application. However, these nodes are battery… read more here.
Keywords: sensor; deep neural; novel deep; shortest path ... See more keywords
Shortest Path Evaluation in Wireless Network Using Fuzzy Logic
Sign Up to like & getrecommendations! Published in 2018 at "Wireless Personal Communications"
DOI: 10.1007/s11277-018-5645-1
Abstract: Evaluation of the shortest path in a wireless network is to ensure the fast and guaranteed delivery of the data over the established wireless network. Most of the wireless protocols are using a shortest path… read more here.
Keywords: wireless network; shortest path; evaluation; path ... See more keywords
Most vital vertices for the shortest s–t path problem: complexity and Branch-and-Cut algorithm
Sign Up to like & getrecommendations! Published in 2020 at "Optimization Letters"
DOI: 10.1007/s11590-019-01527-5
Abstract: In this paper we study the most vital vertices for the shortest s–t path problem. This problem consists, given a digraph $$D=(V\cup \{s,t\},A)$$D=(V∪{s,t},A) and a threshold $$d\in \mathbb {N}$$d∈N, in finding the minimum number of… read more here.
Keywords: vital vertices; vertices shortest; path problem; shortest path ... See more keywords
An extension principle based solution approach for shortest path problem with fuzzy arc lengths
Sign Up to like & getrecommendations! Published in 2017 at "Operational Research"
DOI: 10.1007/s12351-016-0230-4
Abstract: AbstractA shortest path problem on a network in the presence of fuzzy arc lengths is focused in this paper. The aim is to introduce the shortest path connecting the first and last vertices of the… read more here.
Keywords: arc lengths; fuzzy; path problem; path ... See more keywords
An enhanced Benders decomposition method for unique shortest path routing
Sign Up to like & getrecommendations! Published in 2024 at "OPSEARCH"
DOI: 10.1007/s12597-023-00718-0
Abstract: With the aim of looking into a comparatively more efficient solution approach for the unique shortest path routing problem, an alternative problem formulation to a counterpart is first introduced. The model is mathematically equivalent to… read more here.
Keywords: enhanced benders; problem; unique shortest; shortest path ... See more keywords
Shortest Path Computation in a Network with Multiple Destinations
Sign Up to like & getrecommendations! Published in 2020 at "Arabian Journal for Science and Engineering"
DOI: 10.1007/s13369-020-04340-w
Abstract: The shortest path problem is the problem of finding a path with minimum total weight from a source node to each destination node in a network. The existing solution to this fundamental problem searches the… read more here.
Keywords: network; path computation; shortest path; path ... See more keywords
A Retroactive Approach for Dynamic Shortest Path Problem
Sign Up to like & getrecommendations! Published in 2018 at "National Academy Science Letters"
DOI: 10.1007/s40009-018-0674-6
Abstract: AbstractDynamic shortest path algorithms modify the existing shortest path tree or graph, taking into account changes in the underlying graph configuration. In the premise of this paper, the dynamic Dijkstra algorithm is specifically considered which… read more here.
Keywords: retroactive approach; approach dynamic; path problem; path ... See more keywords