Panna Kristof

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
A fundamental unsolved challenge in multipath routing is to provide disjoint end-to-end paths, each one satisfying certain operational goals (e.g., shortest possible), without overwhelming the data plane with prohibitive amount of forwarding state. In this paper, we study the problem of finding a pair of shortest disjoint paths that can be represented by(More)
  • 1