Xi & Chao (2007) ESCAP: Efficient SCan for Alternate Paths to Achieve IP Fast Rerouting (Globecom)
Similar paper:
[more]
The correct way of doing probability
Reading an article from DataGenetics, which shows how people flawed when dealing with probability.
[more]
Kini et al (2009) Fast Recovery from Dual Link Failures in IP Networks (INFOCOM)
In a 3-edge connected network, the paper propose to build around any node some backup topology for fast recovery. Consider node \(n\) in the network \(G\), and there are several links connected \(n\) to the other part of the topology, if we build subgraphs \(G_1\), \(G_2\), etc which each of...
[more]
Huang & Langston (1988) Practical In-Place Merging
A paper I read because of a mention in StackOverflow about merging two sorted arrays. However, despite it claims that it can merge two lists in \(O(n)\) time and \(O(1)\) space, it seems that it does not work for arrays but linked lists. One key feature of the paper’s \(O(n)\)...
[more]
Repeated Hash and Collision
Reading an article from Umumble but it seems not very well formatted. So I do the math here again.
[more]