Eppstein (1998) Finding the k shortest paths (SIAM J Computing)
An algorithm to find the \(k\) shortest paths from node \(s\) to node \(t\) is presented.
[more]
Atlas & Zinin (2008) Basic Specification for IP Fast Reroute: Loop-Free Alternates (RFC5286)
This is an RFC on how to select the “next hop” for fast reroute protections. The default next hop is called “primary” and therefore the one used for fast reroute is called “alternate” next hop. The alternate next hop is not necessary to be in the shortest path, but it...
[more]
Yen (1971) Finding the K Shortest Loopless Paths in a Network (Management Sci)
This paper gives a survey on the previous algorithms to find \(k\) shortest loopless paths in a network and proposed a new one.
[more]
Dukkipati et al (2010) An Argument for Increasing TCP’s Initial Congestion Window (CCR)
Traditional congestion window in TCP is set initially to 3 segments, approximately 4KB for 1500 byte MTU. This paper argues that, it is not optimal for modern time network for a number of reasons:
[more]
Banner & Orda (2007) Multipath Routing Algorithms for Congestion Minimization (TON)
Brief read.
[more]