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]
Benson et al (2010) Network Traffic Characteristics of Data Centers in the Wild (IMC)
Extension of a previous paper. Brief read.
Following are the summary from the paper’s introduction:
[more]
Zhang et al (2004) Efficient TCP Connection Failover in Web Server Clusters (INFOCOM)
Brief read.
[more]