@inproceedings{ Lakhina2003,
  abstract = {Considerable attention has been focused on the properties of graphs derived from Internet measurements. Router-level topologies collected via traceroute-like methods have led some to conclude that the router graph of the Internet is well modeled as a power-law random graph. In such a graph, the degree distribution of nodes follows a distribution with a power-law tail. We argue that the evidence to date for this conclusion is at best insufficient. We show that when graphs are sampled using traceroute-like methods, the resulting degree distribution can differ sharply from that of the underlying graph. For example, given a sparse Erd ̈ os-R ́ enyi random graph, the subgraph formed by a collection of shortest paths from a small set of random sources to a larger set of random destinations can exhibit a degree distribution remarkably like a power-law. We explore the reasons for how this effect arises, and show that in such a setting, edges are sampled in a highly biased manner. This insight allows us to formulate tests for determining when sampling bias is present. When we apply these tests to a number of well-known datasets, we find strong evidence for sampling bias.},
  address = {San Francisco},
  author = {Lakhina, Anukool and Byers, John W and Crovella, Mark},
  booktitle = {INFOCOM},
  doi = {10.1109/INFCOM.2003.1208685},
  file = {:home/ecem/Dropbox/mendeley_sampling_references/Lakhina, Byers, Crovella/2003_Lakhina, Byers, Crovella_Sampling biases in IP topology measurements.pdf:pdf},
  isbn = {0-7803-7752-4},
  keywords = {bias,ip,traceroute},
  mendeley-tags = {bias,ip,traceroute},
  pages = {332--341},
  title = {{Sampling biases in IP topology measurements}},
  volume = {1},
  year = {2003}
}

{"_id":{"_str":"534211116d78590a0600006c"},"__v":4,"authorIDs":[],"author_short":["Lakhina, A.","Byers","W, J.","Crovella, M."],"bibbaseid":"lakhina-byers-w-crovella-samplingbiasesiniptopologymeasurements-2003","bibdata":{"abstract":"Considerable attention has been focused on the properties of graphs derived from Internet measurements. Router-level topologies collected via traceroute-like methods have led some to conclude that the router graph of the Internet is well modeled as a power-law random graph. In such a graph, the degree distribution of nodes follows a distribution with a power-law tail. We argue that the evidence to date for this conclusion is at best insufficient. We show that when graphs are sampled using traceroute-like methods, the resulting degree distribution can differ sharply from that of the underlying graph. For example, given a sparse Erd ̈ os-R ́ enyi random graph, the subgraph formed by a collection of shortest paths from a small set of random sources to a larger set of random destinations can exhibit a degree distribution remarkably like a power-law. We explore the reasons for how this effect arises, and show that in such a setting, edges are sampled in a highly biased manner. This insight allows us to formulate tests for determining when sampling bias is present. When we apply these tests to a number of well-known datasets, we find strong evidence for sampling bias.","address":"San Francisco","author":["Lakhina, Anukool","Byers","W, John","Crovella, Mark"],"author_short":["Lakhina, A.","Byers","W, J.","Crovella, M."],"bibtex":"@inproceedings{ Lakhina2003,\n abstract = {Considerable attention has been focused on the properties of graphs derived from Internet measurements. Router-level topologies collected via traceroute-like methods have led some to conclude that the router graph of the Internet is well modeled as a power-law random graph. In such a graph, the degree distribution of nodes follows a distribution with a power-law tail. We argue that the evidence to date for this conclusion is at best insufficient. We show that when graphs are sampled using traceroute-like methods, the resulting degree distribution can differ sharply from that of the underlying graph. For example, given a sparse Erd ̈ os-R ́ enyi random graph, the subgraph formed by a collection of shortest paths from a small set of random sources to a larger set of random destinations can exhibit a degree distribution remarkably like a power-law. We explore the reasons for how this effect arises, and show that in such a setting, edges are sampled in a highly biased manner. This insight allows us to formulate tests for determining when sampling bias is present. When we apply these tests to a number of well-known datasets, we find strong evidence for sampling bias.},\n address = {San Francisco},\n author = {Lakhina, Anukool and Byers, John W and Crovella, Mark},\n booktitle = {INFOCOM},\n doi = {10.1109/INFCOM.2003.1208685},\n file = {:home/ecem/Dropbox/mendeley_sampling_references/Lakhina, Byers, Crovella/2003_Lakhina, Byers, Crovella_Sampling biases in IP topology measurements.pdf:pdf},\n isbn = {0-7803-7752-4},\n keywords = {bias,ip,traceroute},\n mendeley-tags = {bias,ip,traceroute},\n pages = {332--341},\n title = {{Sampling biases in IP topology measurements}},\n volume = {1},\n year = {2003}\n}","bibtype":"inproceedings","booktitle":"INFOCOM","doi":"10.1109/INFCOM.2003.1208685","file":":home/ecem/Dropbox/mendeley_sampling_references/Lakhina, Byers, Crovella/2003_Lakhina, Byers, Crovella_Sampling biases in IP topology measurements.pdf:pdf","id":"Lakhina2003","isbn":"0-7803-7752-4","key":"Lakhina2003","keywords":"bias,ip,traceroute","mendeley-tags":"bias,ip,traceroute","pages":"332--341","title":"Sampling biases in IP topology measurements","type":"inproceedings","volume":"1","year":"2003","bibbaseid":"lakhina-byers-w-crovella-samplingbiasesiniptopologymeasurements-2003","role":"author","urls":{},"keyword":["bias","ip","traceroute"],"downloads":0,"html":""},"bibtype":"inproceedings","biburl":"http://www.utdallas.edu/~emrah.cem/Sampling.bib","downloads":0,"keywords":["bias","ip","traceroute"],"search_terms":["sampling","biases","topology","measurements","lakhina","byers","w","crovella"],"title":"Sampling biases in IP topology measurements","year":2003,"dataSources":["NzvQMDNRQxZEm47er"]}