Carsten Lund

Lund, Carsten
1 AT&T Way
Bedminster, NJ

Technical Documents

Why OSPF paths aren’t always shortest
David Applegate, Carsten Lund, Aman Shaikh
NANOG 54,  2012.  [LINK]  [BIB]

NANOG Copyright

Efficient stream sampling for variance-optimal estimation of subset sums
Edith Cohen, Nicholas Duffield, Carsten Lund, Mikkel Thorup, Haim Kaplan
SIAM Journal on Computing,  2011.  [PDF]  [BIB]

SIAM (Society fir Industrial and Applied Mathematics) Copyright

FlowRoute: Inferring Forwarding Table Updates Using Passive Flow-level Measurements
Lee Breslau, Cheng Ee, Alexandre Gerber, Subhabrata Sen, Amogh Dhamdhere, Nicholas Duffield, Carsten Lund
in Proc. of ACM Internet Measurement Conference (IMC),  2010.  [PDF]  [BIB]

ACM Copyright

Scalable VPN Routing via Relaying
Changhoon Kim, Alexandre Gerber, Carsten Lund, Dan Pei, Subhabrata Sen
in Proc. ACM SIGMETRICS,  2008.  [PDF]  [BIB]

ACM Copyright


Optimal Combination Of Sampled Measurements, May 19, 2009
Methods and apparatus for detection of hierarchical heavy hitters, October 14, 2008
Method and apparatus for managing hierarchical collections of data, December 18, 2007
Apparatus for size-dependent sampling for managing a data network, November 20, 2007
Method and apparatus for size-dependent sampling for managing a data network, July 18, 2006
System and method for deriving traffic demands for a packet-switched network, April 11, 2006
Science & Technology Medal, 2005. Honored for fundamental advances in algorithms and complexity, and their application to network design and management.

Goedel Prize, 2001.