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

Vutukury (2000) MPATH: a loop-free multipath routing algorithm (M&M)

May 19, 2010 paper

The paper is to have a distributed routing algorithm to find, at each node \(i\), the successor set for destination \(j\) such that the routing path is loop-free at every instant even the link costs are changing with time. Such algorithm turns out finds the multipath route with unequal length.... [more]

Set membership check in Perl

May 6, 2010 blog code

Assume we represent a set by an array in Perl (so strictly speaking it is not merely a set but an ordered set). Now given an item, how to check if it is in the set or not? [more]

Outliers: The Story of Success

Malcolm Gladwell / 2008

May 5, 2010 book

A nice leisure book from a good author. [more]

The Combinatorics of Network Reliability

Charles J. Colbourn / 1987

May 5, 2010 book

This is a book I know when I was reading a paper that cited it. I did not read it from cover to cover but something interesting inside. [more]

Ridoux and Veitch (2010) Principles of Robust Timing over the Internet (ACM Queue)

May 2, 2010 paper

PC’s clock is an oscillator and HPET (high performance event timer) to count oscillator ticks. The time function is therefore \(C(t) = C_0 + p(t) \textrm{HPET}(t)\) where \(p(t)\) is the period of clock ticks and HPET is the tick count. Note, \(p(t)\) is varying slowly and therefore \(C(t)\) is not... [more]