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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Network throughput has become an important issue for big-data analysis on Warehouse-Scale Computing (WSC) systems. It has been… 
2018
2018
In this paper, a survivable routing and wavelength assignment strategy using flow network concepts of network graph theory has… 
2014
2014
The problem of routing and Spectrum Assignment (RSA) is a key challenge in implementing a elastic optical network, and has… 
2010
2010
The bandwidth problem is one of the most serious problems for multi-hop wireless mesh networks (WMNs) due to the influence of… 
2009
2009
In this paper, we propose a contamination aware droplet routing algorithm for digital microfluidic biochips (DMFBs). To reduce… 
2007
2007
In all-optical networks, physical impairments and latency have become two major concerns as they can limit the network… 
2007
2007
Summary The bandwidth problem is one of the most serious problems for multi-hop wireless mesh networks (WMNs) due to the… 
2007
2007
The bandwidth problem is one of the most serious problems for multi-hop wireless mesh networks (WMNs) due to interference. We… 
1992
1992
Issues of the load-balanced K-shortest path routing are investigated in this paper, including multiple alternative routing… 
1992
1992
An extension to the MKV GOS method, which was originally limited to OOC-SF (originating office control with spill-forward) table…