Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,397,757 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
19 relations
Bellman–Ford algorithm
Breadth-first search
Computational linguistics
Constrained Shortest Path First
Expand
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
Ryuta Kawano
,
Ryota Yasudo
,
Hiroki Matsutani
,
H. Amano
International Symposium on Computing and…
2018
Corpus ID: 57364795
Network throughput has become an important issue for big-data analysis on Warehouse-Scale Computing (WSC) systems. It has been…
Expand
2018
2018
Maximum Network Flow Aware Multi-lightpath Survivable Routing in WDM Networks
D. K. Tyagi
,
V. K. Chaubey
Information and Communication Technology for…
2018
Corpus ID: 70023473
In this paper, a survivable routing and wavelength assignment strategy using flow network concepts of network graph theory has…
Expand
2014
2014
A Genetic Algorithm Using Priority-Based Encoding for Routing and Spectrum Assignment in Elastic Optical Network
Ta-Shan Huang
,
Bin Li
International Conference on Intelligent…
2014
Corpus ID: 16390549
The problem of routing and Spectrum Assignment (RSA) is a key challenge in implementing a elastic optical network, and has…
Expand
2010
2010
Joint bandwidth guaranteed scheduling and shortest path routing algorithms in multi-channel wireless mesh networks
Kai Xiang
,
Yuanyuan Zeng
,
Tong Wang
International Conference on Future Computer and…
2010
Corpus ID: 14565724
The bandwidth problem is one of the most serious problems for multi-hop wireless mesh networks (WMNs) due to the influence of…
Expand
2009
2009
A contamination aware droplet routing algorithm for digital microfluidic biochips
Tsung-Wei Huang
,
Chun-Hsien Lin
,
Tsung-Yi Ho
IEEE/ACM International Conference on Computer…
2009
Corpus ID: 14443344
In this paper, we propose a contamination aware droplet routing algorithm for digital microfluidic biochips (DMFBs). To reduce…
Expand
2007
2007
BER and Latency Constrained QoS-Aware Distributed Routing for All-optical Networks
Jun He
,
M. Brandt-Pearce
,
S. Subramaniam
Second International Conference on Communications…
2007
Corpus ID: 16082810
In all-optical networks, physical impairments and latency have become two major concerns as they can limit the network…
Expand
2007
2007
An Efficient Scheme for Solving Bandwidth Guaranteed Scheduling and Shortest path Routing Problem in Wireless Mesh Networks
Ziming Zeng
,
Yuanyuan Zeng
2007
Corpus ID: 17401178
Summary The bandwidth problem is one of the most serious problems for multi-hop wireless mesh networks (WMNs) due to the…
Expand
2007
2007
Bandwidth Guaranteed Scheduling and Shortest Path Routing in Wireless Mesh Networks
Zeng Ziming
,
Z. Liyi
International Conference on Wireless…
2007
Corpus ID: 16084607
The bandwidth problem is one of the most serious problems for multi-hop wireless mesh networks (WMNs) due to interference. We…
Expand
1992
1992
Load-Balanced K-Shortest Path Routing for Circuit-Switched Networks
C. Hsu
,
J. Hui
1992
Corpus ID: 17434361
Issues of the load-balanced K-shortest path routing are investigated in this paper, including multiple alternative routing…
Expand
1992
1992
Single-moment analysis of unreliable trunk networks employing K-shortest-path routing
M. C. Sinclair
1992
Corpus ID: 14029622
An extension to the MKV GOS method, which was originally limited to OOC-SF (originating office control with spill-forward) table…
Expand
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)
ACCEPT & CONTINUE
or Only Accept Required