Skip to search formSkip to main contentSkip to account menu

K shortest path routing

The K shortest path routing algorithm is an extension algorithm of the shortest path routing algorithm in a given network. It is sometimes crucial to… 
Wikipedia (opens in a new tab)

Related topics

Related topics

19 relations
Bellman–Ford algorithmBreadth-first searchComputational linguisticsConstrained Shortest Path First

Broader (1)

Network theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
k-Optimized Path Routing for High-Throughput Data Center Networks
Network throughput has become an important issue for big-data analysis on Warehouse-Scale Computing (WSC) systems. It has been… 
2018
2018
Maximum Network Flow Aware Multi-lightpath Survivable Routing in WDM Networks
In this paper, a survivable routing and wavelength assignment strategy using flow network concepts of network graph theory has… 
2010
2010
Joint bandwidth guaranteed scheduling and shortest path routing algorithms in multi-channel wireless mesh networks
The bandwidth problem is one of the most serious problems for multi-hop wireless mesh networks (WMNs) due to the influence of… 
2009
2009
A contamination aware droplet routing algorithm for digital microfluidic biochips
In this paper, we propose a contamination aware droplet routing algorithm for digital microfluidic biochips (DMFBs). To reduce… 
2007
2007
An Efficient Scheme for Solving Bandwidth Guaranteed Scheduling and Shortest path Routing Problem in Wireless Mesh Networks
Summary The bandwidth problem is one of the most serious problems for multi-hop wireless mesh networks (WMNs) due to the… 
2007
2007
Bandwidth Guaranteed Scheduling and Shortest Path Routing in Wireless Mesh Networks
The bandwidth problem is one of the most serious problems for multi-hop wireless mesh networks (WMNs) due to interference. We… 
2007
2007
BER and Latency Constrained QoS-Aware Distributed Routing for All-optical Networks
In all-optical networks, physical impairments and latency have become two major concerns as they can limit the network… 
2006
2006
Restoration Mechanism and Maximum Dual Failure Restorability of Span-restorable Optical Networks
  • Ling Zhou
  • Asian Optical Fiber Communication…
  • 2006
  • Corpus ID: 33042127
A survivable network is commonly designed to be 100% restorable to any single span failure. The restoration mechanism of networks… 
1992
1992
Load-Balanced K-Shortest Path Routing for Circuit-Switched Networks
Issues of the load-balanced K-shortest path routing are investigated in this paper, including multiple alternative routing… 
1992
1992
Single-moment analysis of unreliable trunk networks employing K-shortest-path routing
An extension to the MKV GOS method, which was originally limited to OOC-SF (originating office control with spill-forward) table… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)