Emre Kıcıman, Dave Maltz, John Platt, and Moises Goldszmidt
15 September 2006
Content providers base their business on their ability to receive andfl
answer requests from clients distributed across the Internet. Sincefl
disruptions in the flow of these requests directly translate into lostfl
revenue, there is tremendous incentive to diagnose why some requestsfl
fail and prod the responsible parties into corrective action.fl
However, a content provider has only limited visibility into the statefl
of the Internet outside its domain. Instead, it must mine failure diagnosesfl
from available information sources to infer what is goingfl
wrong and who is responsible.fl
Our ultimate goal is to help Internet content providers resolve reliabilityfl
problems in the wide-area network that are affecting enduserfl
perceived reliability. We describe two algorithms that representfl
our first steps towards enabling content providers to extractfl
actionable debugging information from content provider logs, andfl
we present the results of applying the algorithms to a week’s worthfl
of logs from a large content provider, during which time it handledfl
over 1 billion requests originating from over 10 thousand ASes.
In ACM SIGCOMM Workshop on Mining Network Data (MineNet-06)
Publisher Association for Computing Machinery, Inc.
Copyright © 2007 by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept, ACM Inc., fax +1 (212) 869-0481, or firstname.lastname@example.org. The definitive version of this paper can be found at ACM’s Digital Library --http://www.acm.org/dl/.