Algorithms & Randomness Center Colloquium with Howard Karloff

Primary tabs

The Algorithms & Randomness Center (ARC) in the College of Computing welcomes Howard Karloff of AT&T Research for a colloquium on "Disjoint-Path Facility Location: Theory and Practice."

Internet service providers hope to provide their customers with superior Internet connectivity, but do they always do so? How can an ISP even know what quality of service it's providing to its customers? To this end, researchers recently proposed a new scheme an ISP could use in order to estimate the packet loss rates experienced by its customers.

To implement the new scheme, one has to approximately solve an interesting NP-Hard optimization problem on the ISP's network. Specifically, one must choose a small set of network nodes such that from each customer node there are arc-disjoint paths to *two* of the selected nodes. I will discuss recent work, mostly at ATT, attacking this problem and its surprisingly good results, in light of the problem's provable inapproximability in the worst case.


  • Workflow Status: Published
  • Created By: Mike Terrazas
  • Created: 08/17/2010
  • Modified By: Fletcher Moore
  • Modified: 10/07/2016


Target Audience