Results 41 to 50 of about 49,625 (158)
Shortest-Path Reconstruction Algorithms [PDF]
The Computer Journal, 1993 Summary: We study the problem of computing shortest paths between pairs of vertices in an \(n\)-vertex graph, given only the all pairs shortest paths distance matrix. This computation is called a reconstruction, since the algorithm has no access to explicit information about edges in the original graph. We present the following results: 1.
openaire +2 more sources
ARP-Path: ARP-Based, Shortest Path Bridges [PDF]
IEEE Communications Letters, 2011 This letter is a summary proposal for an evolution of the Ethernet transparent bridge paradigm that provides simple, shortest path bridging in campus networks. ARP-Path Ethernet Switches set up an on-demand path between two hosts just reusing and flooding the standard ARP request frame through all links and confirming the path reaching to the ...
Ibáñez Fernández, Guillermo Agustín +4 more
openaire +3 more sources
CASPaR: Congestion avoidance shortest path routing for delay tolerant networks
International Journal of Distributed Sensor Networks, 2017 Unlike traditional transmission control protocol/Internet protocol–based networks, delay/disruption tolerant networks may experience connectivity disruptions and guarantee no end-to-end connectivity between source and destination.
Michael Stewart +3 more
doaj +1 more source
The Multi-Objective Shortest Path Problem with Multimodal Transportation for Emergency Logistics
MathematicsThe optimization of emergency logistical transportation is crucial for the timely dispatch of aid and support to affected areas. By incorporating practical constraints into emergency logistics, this study establishes a multi-objective shortest path mixed-
Jinzuo Guo +4 more
doaj +1 more source
AlgorithmsIn the obstacle grid map, due to the limitations in search direction imposed by classical path algorithms and meta-heuristic algorithms, the shortest paths are not the true shortest paths (TSPs) but rather the shortest grid paths (SGPs).
Yijie Zhang, Jizhou Chen
doaj +1 more source
Performance Evaluation of Load-Balanced Routing via Bounded Randomization
CLEI Electronic Journal, 2000 Future computer networks are expected to carry bursty traffic. Shortest -path routing protocols such as OSPF and RIP have t he disadvantage of causing bottlenecks due to their inherent single -path routing.
Sangman Bak +2 more
doaj +1 more source
Non-crossing Rectilinear Shortest Minimum Bend Paths in the Presence of Rectilinear Obstacles
Journal of Telecommunications and Information Technology, 2018 The paper presents a new algorithm to determine the shortest, non-crossing, rectilinear paths in a twodimensional grid graph. The shortest paths are determined in a manner ensuring that they do not cross each other and bypass any obstacles present. Such
Shylashree Nagaraja
doaj +1 more source
The Capacity Expansion Path Problem in Networks
Journal of Applied Mathematics, 2013 This paper considers the general capacity expansion path problem (GCEP) for the telecommunication operators. We investigate the polynomial equivalence between the GCEP problem and the constrained shortest path problem (CSP) and present a pseudopolynomial
Jianping Li, Juanping Zhu
doaj +1 more source
Distributional Properties of Stochastic Shortest Paths for Smuggled Nuclear Material [PDF]
Journal of Systemics, Cybernetics and Informatics, 2012 The shortest path problem on a network with fixed weights is a well studied problem with applications to many diverse areas such as transportation and telecommunications.
Leticia Cuellar +3 more
doaj
Fuzzy Shortest Path Problem Based on Level 𝜆-Triangular LR Fuzzy Numbers
Advances in Fuzzy Systems, 2012 In problems of graphs involving uncertainties, the fuzzy shortest path problem is one of the most studied topics, since it has a wide range of applications in different areas and therefore deserves special attention.
S. Elizabeth, L. Sujatha
doaj +1 more source