∫ntegrabℓε ∂iﬀerentiαℓs · unorganised notes, code, and writings of random topics

Greenberg et al (2009) VL2: A Scalable and Flexible Data Center Network (SIGCOMM)

May 30, 2011 paper

An architecture of data center network to support virtual machines as workhorses and standard Ethernet as layer-2 with flat-addressing. Load-balancing is provided by Valiant Load Balancing (i.e. OSPF ECMP), and the multipath capability of the network is exploited by modifying the OS of hosts — so that different MAC addresses... [more]

Eppstein (1998) Finding the k shortest paths (SIAM J Computing)

May 24, 2011 paper

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)

May 21, 2011 paper

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)

May 18, 2011 paper

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)

May 9, 2011 paper

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]