Contact The DL Team Contact Us | Switch to tabbed view

top of pageABSTRACT

An abstract is not available.

top of pageAUTHORS



K. Papagiannaki K. Papagiannaki
dinaattid.es
Bibliometrics: publication history
Publication years2001-2016
Publication count84
Citation Count1,788
Available for download67
Downloads (6 Weeks)226
Downloads (12 Months)1,698
Downloads (cumulative)35,648
Average downloads per article532.06
Average citations per article21.29
View colleagues of K. Papagiannaki


Author image not provided  N. Taft

No contact information provided yet.

Bibliometrics: publication history
Publication years2001-2011
Publication count38
Citation Count834
Available for download26
Downloads (6 Weeks)98
Downloads (12 Months)743
Downloads (cumulative)16,540
Average downloads per article636.15
Average citations per article21.95
View colleagues of N. Taft


Author image not provided  S. Bhattacharyya

No contact information provided yet.

Bibliometrics: publication history
Publication years1998-2010
Publication count19
Citation Count602
Available for download10
Downloads (6 Weeks)37
Downloads (12 Months)282
Downloads (cumulative)9,588
Average downloads per article958.80
Average citations per article31.68
View colleagues of S. Bhattacharyya


Author image not provided  P. Thiran

No contact information provided yet.

Bibliometrics: publication history
Publication years1994-2018
Publication count68
Citation Count930
Available for download36
Downloads (6 Weeks)71
Downloads (12 Months)528
Downloads (cumulative)13,655
Average downloads per article379.31
Average citations per article13.68
View colleagues of P. Thiran


Author image not provided  K. Salamatian

No contact information provided yet.

Bibliometrics: publication history
Publication years2001-2017
Publication count48
Citation Count773
Available for download25
Downloads (6 Weeks)126
Downloads (12 Months)787
Downloads (cumulative)15,585
Average downloads per article623.40
Average citations per article16.10
View colleagues of K. Salamatian


Author image not provided  C. Diot

No contact information provided yet.

Bibliometrics: publication history
Publication years1995-2016
Publication count131
Citation Count3,545
Available for download79
Downloads (6 Weeks)277
Downloads (12 Months)2,085
Downloads (cumulative)55,059
Average downloads per article696.95
Average citations per article27.06
View colleagues of C. Diot

top of pageREFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
K. Papagiannaki et. al. On the feasibility of identifying elephants in internet backone traffic. Sprint ATL Technical Report TR01-ATL-110918, Sprint Labs, November 2001.

top of pageCITED BY

16 Citations

 
 
 
 
 
 
 
 
 
 
 

top of pageINDEX TERMS

The ACM Computing Classification System (CCS rev.2012)

Note: Larger/Darker text within each node indicates a higher relevance of the materials to the taxonomic classification.

top of pagePUBLICATION

Title IMW '02 Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment table of contents
Pages 175-176
Publication Date2002-11-06 (yyyy-mm-dd)
Sponsor SIGCOMM ACM Special Interest Group on Data Communication
PublisherACM New York, NY, USA ©2002
ISBN: 1-58113-603-X Order Number: ACM Order No.: 533027 doi>10.1145/637201.637227
Conference IMCInternet Measurement Conference IMC logo
Paper Acceptance Rate 40 of 90 submissions, 44%
Overall Acceptance Rate 69 of 170 submissions, 41%
Year Submitted Accepted Rate
IMW '01 80 29 36%
IMW '02 90 40 44%
Overall 170 69 41%

APPEARS IN
Networking

top of pageREVIEWS


Reviews are not available for this item
Computing Reviews logo

top of pageCOMMENTS

Be the first to comment To Post a comment please sign in or create a free Web account

top of pageTable of Contents

Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Table of Contents
previousprevious proceeding |no next proceeding
SESSION: Session 1: DNS
King: estimating latency between arbitrary internet end hosts
Krishna P. Gummadi, Stefan Saroiu, Steven D. Gribble
Pages: 5-18
doi>10.1145/637201.637203
Full text: PDFPDF

The ability to estimate network latencies between arbitrary Internet end hosts would enable new measurement studies and applications, such as investigating routing path inefficiencies on a wide-scale or constructing topologically sensitive overlay networks. ...
expand
Diversity in DNS performance measures
Richard Liston, Sridhar Srinivasan, Ellen Zegura
Pages: 19-31
doi>10.1145/637201.637204
Full text: PDFPDF

DNS is a critical component of the operation of Internet applications. However, DNS performance in the wide-area is not well understood. A number of studies present DNS performance measurements [1], [2], [3], [4], but the measurements are out of date, ...
expand
SESSION: Session 2: modeling
A flow-based model for internet backbone traffic
Chadi Barakat, Patrick Thiran, Gianluca Iannaccone, Christophe Diot, Philippe Owezarski
Pages: 35-47
doi>10.1145/637201.637206
Full text: PDFPDF

Our goal is to design a traffic model for uncongested IP backbone links that is simple enough to be used in network operation, and that is protocol and application agnostic in order to be as general as possible. The proposed solution is to model the ...
expand
Testing the Gaussian approximation of aggregate traffic
Jorma Kilpi, Ilkka Norros
Pages: 49-61
doi>10.1145/637201.637207
Full text: PDFPDF

We search for methods or tools to detect whether the 1-dimensional marginal distribution of traffic increments of aggregate TCP-traffic satisfy the hypothesis of approximate normality. Gaussian approximation requires a high level of aggregation in both ...
expand
Does fractal scaling at the IP level depend on TCP flow arrival processes?
Nicolas Hohn, Darryl Veitch, Patrice Abry
Pages: 63-68
doi>10.1145/637201.637208
Full text: PDFPDF

In addition to the well known long-range dependence in time series of IP bytes and packets, evidence for scaling behaviour has also been found at small scales for these series, separated by a characteristic transition timescale. It is less well known ...
expand
SESSION: Session 3: inference and statistical analysis
A signal analysis of network traffic anomalies
Paul Barford, Jeffery Kline, David Plonka, Amos Ron
Pages: 71-82
doi>10.1145/637201.637210
Full text: PDFPDF

Identifying anomalies rapidly and accurately is critical to the efficient operation of large computer networks. Accurately characterizing important classes of anomalies greatly facilitates their identification; however, the subtleties and complexities ...
expand
Statistical analysis of malformed packets and their origins in the modern internet
Marina Bykova, Shawn Ostermann
Pages: 83-88
doi>10.1145/637201.637211
Full text: PDFPDF

In this work, we collect and analyze all of the IP and TCP headers of packets seen on a network that either violate existing standards or should not appear in modern internets. Our goal is to determine the reason that these packets appear on the network ...
expand
Iterative Bayesian estimation of network traffic matrices in the case of bursty flows
Sandrine Vaton, Annie Gravey
Pages: 89-90
doi>10.1145/637201.637212
Full text: PDFPDF
Experience in measuring backbone traffic variability: models, metrics, measurements and meaning
Matthew Roughan, Albert Greenberg, Charles Kalmanek, Michael Rumsewicz, Jennifer Yates, Yin Zhang
Pages: 91-92
doi>10.1145/637201.637213
Full text: PDFPDF

Understanding the variability of Internet traffic in backbone networks is essential to better plan and manage existing networks, as well as to design next generation networks. However, most traffic analyses that might be used to approach this problem ...
expand
Passive network tomography using Bayesian inference
Venkata N. Padmanabhan, Lili Qiu, Helen J. Wang
Pages: 93-94
doi>10.1145/637201.637214
Full text: PDFPDF
SESSION: Session 4: traffic anomalies
Measuring packet reordering
John Bellardo, Stefan Savage
Pages: 97-105
doi>10.1145/637201.637216
Full text: PDFPDF

The Internet architecture provides an unsequenced datagram delivery service. Nevertheless, many higher-layer protocols, such as TCP, assume that packets are usually delivered in sequence, and consequently suffer significant degradation when packets are ...
expand
Detection and analysis of routing loops in packet traces
Urs Hengartner, Sue Moon, Richard Mortier, Christophe Diot
Pages: 107-112
doi>10.1145/637201.637217
Full text: PDFPDF

Routing loops are caused by inconsistencies in routing state among a set of routers. They occur in perfectly engineered networks, and have a detrimental effect on performance. They impact end-to-end performance through increased packet loss and delay ...
expand
Measurement and classification of out-of-sequence packets in a tier-1 IP backbone
Sharad Jaiswal, Gianluca Iannaccone, Christophe Diot, Jim Kurose, Don Towsley
Pages: 113-114
doi>10.1145/637201.637218
Full text: PDFPDF
SESSION: Session 5: P2P and streaming
A hierarchical characterization of a live streaming media workload
Eveline Veloso, Virgílio Almeida, Wagner Meira, Azer Bestavros, Shudong Jin
Pages: 117-130
doi>10.1145/637201.637220
Full text: PDFPDF

We present what we believe to be the first thorough characterization of live streaming media content delivered over the Internet. Our characterization of over 3.5 million requests spanning a 28-day period is done at three increasingly granular ...
expand
MediaPlayer™ versus RealPlayer™: a comparison of network turbulence
Mingzhe Li, Mark Claypool, Robert Kinicki
Pages: 131-136
doi>10.1145/637201.637221
Full text: PDFPDF

The performance of currently available streaming media products will play an important role in the network impact of streaming media. However, there are few empirical studies that analyze the network traffic characteristics and lnternet impact of current ...
expand
Analyzing peer-to-peer traffic across large networks
Subhabrata Sen, Jia Wang
Pages: 137-150
doi>10.1145/637201.637222
Full text: PDFPDF

The use of peer-to-peer (P2P) applications is growing dramaticaliy, particularly for sharing large video/audio files and software. In this paper, we analyze P2P traffic by measuring flow-level information collected at multiple border routers across a ...
expand
Provisioning on-line games: a traffic analysis of a busy counter-strike server
Wu-chang Feng, Francis Chang, Wu-chi Feng, Jonathan Walpole
Pages: 151-156
doi>10.1145/637201.637223
Full text: PDFPDF

This paper describes the results of a 500 million packet trace of a popular on-line, multi-player, game server. The results show that the traffic behavior of this heavily loaded game server is highly predictable and can be attributed to the fact that ...
expand
SESSION: Session 6: flow measurement
Properties and prediction of flow statistics from sampled packet streams
Nick Duffield, Carsten Lund, Mikkel Thorup
Pages: 159-171
doi>10.1145/637201.637225
Full text: PDFPDF

Many routers can generate and export statistics on flows of packets that traverse them. Increasingly, high end routers form flow statistics from only a sampled packet stream in order to manage resource consumption involved.This paper addresses three ...
expand
NetFlow: information loss or win?
Robin Sommer, Anja Feldmann
Pages: 173-174
doi>10.1145/637201.637226
Full text: PDFPDF
A pragmatic definition of elephants in internet backbone traffic
K. Papagiannaki, N. Taft, S. Bhattacharyya, P. Thiran, K. Salamatian, C. Diot
Pages: 175-176
doi>10.1145/637201.637227
Full text: PDFPDF
Automated measurement of high volume traffic clusters
Cristian Estan, Stefan Savage, George Varghese
Pages: 177-178
doi>10.1145/637201.637228
Full text: PDFPDF

Traffic measurement often focuses on measuring traffic at various granularities. Our paper considers an approach that generalizes previous solutions: we define a traffic cluster to consist of all traffic that matches a specified set of values ...
expand
Traffic classification for application specific peering
Balachander Krishnamurthy, Jia Wang
Pages: 179-180
doi>10.1145/637201.637229
Full text: PDFPDF
SESSION: Session 7: BGP
Observation and analysis of BGP behavior under stress
Lan Wang, Xiaoliang Zhao, Dan Pei, Randy Bush, Daniel Massey, Allison Mankin, S. Felix Wu, Lixia Zhang
Pages: 183-195
doi>10.1145/637201.637231
Full text: PDFPDF

Despite BGP's critical importance as the de-facto Internet inter-domain routing protocol, there is little understanding of how BGP actually performs under stressful conditions when dependable routing is most needed. In this paper, we examine BGP's behavior ...
expand
BGP routing stability of popular destinations
Jennifer Rexford, Jia Wang, Zhen Xiao, Yin Zhang
Pages: 197-202
doi>10.1145/637201.637232
Full text: PDFPDF

The Border Gateway Protocol (BGP) plays a crucial role in the delivery of traffic in the Internet. Fluctuations in BGP routes cause degradation in user performance, increased processing load on routers, and changes in the distribution of traffic load ...
expand
An empirical study of router response to large BGP routing table load
Di-Fa Chang, Ramesh Govindan, John Heidemann
Pages: 203-208
doi>10.1145/637201.637233
Full text: PDFPDF

Anecdotal evidence suggests that misconfiguration of backbone routers occasionally leads to an injection of large routing tables into the BGP routing system. In this paper, we investigate the detailed mechanics of router response to large BGP routing ...
expand
On the structure and application of BGP policy atoms
Yehuda Afek, Omer Ben-Shalom, Anat Bremler-Barr
Pages: 209-214
doi>10.1145/637201.637234
Full text: PDFPDF

The notion of Internet Policy Atoms has been recently introduced in [1], [2] as groups of prefixes sharing a common BGP AS path at any Internet backbone router In this paper we further research these 'Atoms'. First we offer a new method for computing ...
expand
SESSION: Session 8: IGP and topology
A case study of OSPF behavior in a large enterprise network
Aman Shaikh, Chris Isett, Albert Greenberg, Matthew Roughan, Joel Gottlieb
Pages: 217-230
doi>10.1145/637201.637236
Full text: PDFPDF

Open Shortest Path First (OSPF) is widely deployed in IP networks to manage intra-domain routing. OSPF is a link-state protocol, in which routers reliably flood "Link State Advertisements" (LSAs), enabling each to build a consistent, global view of the ...
expand
Inferring link weights using end-to-end measurements
Ratul Mahajan, Neil Spring, David Wetherall, Tom Anderson
Pages: 231-236
doi>10.1145/637201.637237
Full text: PDFPDF

We describe a novel constraint-based approach to approximate ISP link weights using only end-to-end measurements. Common routing protocols such as OSPF and IS-IS choose least-cost paths using link weights, so inferred weights provide a simple, concise, ...
expand
Analysis of link failures in an IP backbone
Gianluca Iannaccone, Chen-nee Chuah, Richard Mortier, Supratik Bhattacharyya, Christophe Diot
Pages: 237-242
doi>10.1145/637201.637238
Full text: PDFPDF

Today's IP backbones are provisioned to provide excellent performance in terms of loss, delay and availability. However, performance degradation and service disruption are likely in the case of failure, such as fiber cuts, router crashes, etc. In this ...
expand
Topology inference from BGP routing dynamics
David G. Andersen, Nick Feamster, Steve Bauer, Hari Balakrishnan
Pages: 243-248
doi>10.1145/637201.637239
Full text: PDFPDF

This paper describes a method of inferring logical relationships between network prefixes within an Autonomous System (AS) using only passive monitoring of BGP messages. By clustering these prefixes based upon similarities between their update times, ...
expand
On the geographic location of internet resources
Anukool Lakhina, John W. Byers, Mark Crovella, Ibrahim Matta
Pages: 249-250
doi>10.1145/637201.637240
Full text: PDFPDF
SESSION: Session 9: traffic analysis
Observed structure of addresses in IP traffic
Eddie Kohler, Jinyang Li, Vern Paxson, Scott Shenker
Pages: 253-266
doi>10.1145/637201.637242
Full text: PDFPDF

This paper investigates the structure of addresses contained in IP traffic. Specifically, we analyze the structural characteristics of destination IP addresses seen on Interuet links, considered as a subset of the address space. These characteristics ...
expand
A technique for counting natted hosts
Steven M. Bellovin
Pages: 267-272
doi>10.1145/637201.637243
Full text: PDFPDF

There have been many attempts to measure how many hosts are on the Internet. Many of those end-points, however, are NAT boxes (Network Address Translators), and actually represent several different computers. We describe a technique for detecting NATs ...
expand
Code-Red: a case study on the spread and victims of an internet worm
David Moore, Colleen Shannon, k claffy
Pages: 273-284
doi>10.1145/637201.637244
Full text: PDFPDF

On July 19, 2001, more than 359,000 computers connected to the Internet were infected with the Code-Red (CRv2) worm in less than 14 hours. The cost of this epidemic, including subsequent strains of Code-Red, is estimated to be in excess of $2.6 billion. ...
expand
Agile and scalable analysis of network events
Mike Fisk, George Varghese
Pages: 285-290
doi>10.1145/637201.637245
Full text: PDFPDF

The state of the art in general purpose software systems for large-scale traffic measurement has not progressed much past the venerable libpcap. In this paper we describe a new data analysis system that provides a scalable, flexible system for ...
expand
SESSION: Session 10: active measurement
Active probing using packet quartets
Attila Pásztor, Darryl Veitch
Pages: 293-305
doi>10.1145/637201.637247
Full text: PDFPDF

A significant proportion of link bandwidth measurement methods are based on IP's ability to control the number of hops a packet can traverse along a route via the time-to-live (TTL) field of the IP header. A new delay variation based path model is introduced ...
expand
Predicting and bypassing end-to-end internet service degradations
Anat Bremler-Barr, Edith Cohen, Haim Kaplan, Yishay Mansour
Pages: 307-320
doi>10.1145/637201.637248
Full text: PDFPDF

We study the patterns and predictability of Internet End-to-End service degradations, where a degradation is a significant deviation of the round trip time between a client and a server. We use simultaneous RTT measurements collected from several ...
expand
The effect of layer-2 switches on pathchar-like tools
Ravi S. Prasad, Constantinos Dovrolis, Bruce A. Mah
Pages: 321-322
doi>10.1145/637201.637249
Full text: PDFPDF
Preliminary measurements on the effect of server adaptation for web content delivery
Balachander Krishnamurthy, Craig Wills, Yin Zhang
Pages: 323-324
doi>10.1145/637201.637250
Full text: PDFPDF

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2019 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us