Christopher Lydick

Learn More
—In network tomography, we seek to infer link status parameters (such as delay) inside a network through end-to-end measurements at (external) boundary nodes. As can be expected, such approaches generically suffer from identifiability problems; i.e., even with the maximum amount of data obtainable from such end-to-end probes, status of links in a large(More)
—In network tomography, we seek to infer link status parameters (delay, congestion, loss rates etc.) inside a network through end-to-end measurements at (external) boundary nodes. As can be expected, such approaches generically suffer from identifiability problems; i.e., status of links in a large number of network topologies is not identifiable. We(More)
Efficient routing algorithms are now becoming more and more necessary for productive Massively Parallel Processing (MPP) Computers, such as the Red Storm Supercomputer located at Sandia National Laboratories, NM. Some current implementations of MPP computers have used source-based routing, which during nodal failures, requires the entire network to halt and(More)
  • 1