A Pragmatic Definition of Elephants in Internet Backbone Traffic

Studies of the Internet traffic at the level of network prefixes, fixed length prefixes, TCP flows, AS’s, and WWW traffic, have all shown that a very small percentage of the flows carries the largest part of the information. This behavior is commonly referred to as “the elephants and mice phenomenon”. Traffic engineering applications, such as re-routing or load balancing, could exploit this property by treating elephant flows differently. In this context, though, elephants should not only contribute significantly to the overall load, but also exhibit sufficient persistence in time. The challenge is to be able to examine a flow’s bandwidth and classify it as an elephant based on the data collected across all the flows on a link. In this paper, we present a classification scheme that is based on the definition of a separation threshold, that elephants have to exceed. We introduce two single-feature classification schemes, and show that the resulting elephants are highly volatile. We then propose a two-feature classification scheme that incorporates temporal characteristics and show that this approach is more successful in isolating elephants that exhibit consistency thus making them more attractive for traffic engineering applications

Optimal transport on supply-demand networks

Previously, transport networks are usually treated as homogeneous networks, that is, every node has the same function, simultaneously providing and requiring resources. However, some real networks, such as power grid and supply chain networks, show a far different scenario in which the nodes are classified into two categories: the supply nodes provide some kinds of services, while the demand nodes require them. In this paper, we propose a general transport model for those supply-demand networks, associated with a criterion to quantify their transport capacities. In a supply-demand network with heterogenous degree distribution, its transport capacity strongly depends on the locations of supply nodes. We therefore design a simulated annealing algorithm to find the optimal configuration of supply nodes, which remarkably enhances the transport capacity, and outperforms the degree target algorithm, the betweenness target algorithm, and the greedy method. This work provides a start point for systematically analyzing and optimizing transport dynamics on supply-demand networks.Comment: 5 pages, 1 table and 4 figure

Identifiability of flow distributions from link measurements with applications to computer networks

We study the problem of identifiability of distributions of flows on a graph from aggregate measurements collected on its edges. This is a canonical example of a statistical inverse problem motivated by recent developments in computer networks. In this paper (i) we introduce a number of models for multi-modal data that capture their spatio-temporal correlation, (ii) provide sufficient conditions for the identifiability of nth order cumulants and also for a special class of heavy tailed distributions. Further, we investigate conditions on network routing for the flows that prove sufficient for identifiability of their distributions (up to mean). Finally, we extend our results to directed acyclic graphs and discuss some open problems.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/58107/2/ip7_5_004.pd

Long-term drivers of broadband traffic in next-generation networks

This paper is concerned with long-term (20+ years) forecasting of broadband traffic in next-generation networks. Such long-term approach requires going beyond extrapolations of past traffic data while facing high uncertainty in predicting the future developments and facing the fact that, in 20 years, the current network technologies and architectures will be obsolete. Thus, "order of magnitude" upper bounds of upstream and downstream traffic are deemed to be good enough to facilitate such long-term forecasting. These bounds can be obtained by evaluating the limits of human sighting and assuming that these limits will be achieved by future services or, alternatively, by considering the contents transferred by bandwidth-demanding applications such as those using embedded interactive 3D video streaming. The traffic upper bounds are a good indication of the peak values and, subsequently, also of the future network capacity demands. Furthermore, the main drivers of traffic growth including multimedia as well as non-multimedia applications are identified. New disruptive applications and services are explored that can make good use of the large bandwidth provided by next-generation networks. The results can be used to identify monetization opportunities of future services and to map potential revenues for network operators

The ACM SIGCOMM 2009 Technical Program Committee Process

Selecting a technical program for a conference, and running the process so that decisions are well received by authors and participants, is a challenging task. We report our experience in running the SIGCOMM 2009 Technical Program Committee (TPC). The purpose of this article is to document the process that we followed, and discuss it critically. This should let authors get a better understanding of what led to the final acceptance or rejection of their work, and hopefully let other colleagues in charge of similar tasks make use of our experience

Proceedings of the ACM SIGCOMM 2009 conference on Data communication

The proceedings contain 27 papers. The topics discussed include: cross-layer wireless bit rate adaptation; SMACK - a SMart ACKnowledgment scheme for broadcast messages in wireless networks; white space networking with Wi-Fi like connectivity; PortLand: a scalable fault-tolerant layer 2 data center network fabric; VL2: : a scalable and flexible data center network; BCube: a high performance, server-centric network architecture for modular data centers; de-anonymizing the Internet using unreliable IDs; SmartRE: an architecture for coordinated network-wide redundancy elimination; practical, distributed channel assignment and routing in dual-radio mesh networks; pathlet routing; cutting the electric bill for Internet-scale systems; Persona: an online social network with user-defined privacy; interference alignment and cancellation; stable and flexible iBGP; LIPSIN: line speed publish/subscribe inter-networking; and PLUG: flexible lookup modules for rapid deployment of new protocols in high-speed routers