WWWalter Willinger

Walter Willinger

*This is an algorithmically generated author record based on publicly available information.

Walter Willinger has a total of 37 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Demo abstract: towards extracting semantics by visualizing large traceroute datasets

    by Emden R. Gansner, Balachander Krishnamurthy, Walter Willinger, Fabián E. Bustamante, Mario A. Sánchez


  • Internet visualization

    by John Heidemann, Walter Willinger


  • A manifesto for modeling and measurement in social media

    by Graham Cormode, Balachander Krishnamurthy, Walter Willinger

    Online Social Networks (OSNs) have been the subject of a great deal of study in recent years. The majority of this study has used simple models, such as node-and-edge graphs, to describe the data. In this paper, we argue that such models, which necessarily limit the structures that can be described and omit temporal information, are insufficient to describe and study OSNs. Instead, we propose that a richer class of Entity Interaction Network models should be adopted. We outline a checklist of features that can help build such a model, and apply it to three popular networks (Twitter, Facebook and YouTube) to highlight important features. We also discuss important considerations for the collection, validation and sharing of OSN data.


  • Open Access

    Internet Traffic and Multiresolution Analysis

    by Ying Zhang, Zihui Ge, Suhas Diggavi, Z. Morley Mao, Matthew Roughan, Vinay Vaishampayan, Walter Willinger

    Traditional Internet traffic studies have primarily focused on the temporal characteristics of packet traces as observed on a single link within an ISP’s network. They have contributed to advances in the areas of self-similar stochastic processes, long-range dependence, and heavy-tailed distributions and have demonstrated the benefits of applying a wavelet-based multiresolution analysis (MRA) approach when analyzing these traces. However, an ISP’s physical infrastructure typically consists of 100s or 1000s of such links which are connected by routers or switches, and the Internet as a whole is made up of about 20,000 such ISPs. When viewed within this bigger context, the importance of the traffic’s spatial characteristics becomes evident, and traffic matrices—compact and succinct descriptions of the traffic exchanges between nodes in a given network structure—are used in practice to capture and explore critical aspects of this spatial component of Internet traffic. In this paper, we first review some of the known results about the observed multifaceted scaling behavior of Internet traffic as seen on a single link. Next, we give a detailed account of how the architectural design of the Internet gives rise to natural representation of traffic matrices at different scales or levels of resolution. Moreover, we discuss the development of a MRA-like framework of traffic matrices that respects the different physically or logically meaningful Internet connectivity structures and provides new insights into Internet traffic as a spatio-temporal object.Ying Zhang, Zihui Ge, Suhas Diggavi, Z. Morley Mao, MatthewRoughan, Vinay Vaishampayan, Walter Willinger and Yin Zhan


  • Open Access

    The Workshop on Internet Topology (WIT) Report

    by Dmitri Krioukov, Fan Chung, Kc Claffy, Marina Fomenkov, Alessandro Vespignani, Walter Willinger

    Internet topology analysis has recently experienced a surge of interest in computer science, physics, and the mathematical sciences. However, researchers from these different disciplines tend to approach the same problem from different angles. As a result, the field of Internet topology analysis and modeling must untangle sets of inconsistent findings, conflicting claims, and contradicting statements. On May 10-12, 2006, CAIDA hosted the Workshop on Internet topology (WIT). By bringing together a group of researchers spanning the areas of computer science, physics, and the mathematical sciences, the workshop aimed to improve communication across these scientific disciplines, enable interdisciplinary crossfertilization, identify commonalities in the different approaches, promote synergy where it exists, and utilize the richness that results from exploring similar problems from multiple perspectives. This report describes the findings of the workshop, outlines a set of relevant open research problems identified by participants, and concludes with recommendations that can benefit all scientific communities interested in Internet topology research.

  • An Optimization-Based Approach to Modeling Internet Topology

    by David Alderson, Walter Willinger, Lun Li, John Doyle


  • Open Access

    The many facets of internet topology and traffic

    by D. Alderson, H. Chang, M. Roughan, S. Uhlig, W. Willinger

    The Internet's layered architecture and organizational structure give rise to a number of different topologies, with the lower layers defining more physical and the higher layers more virtual/logical types of connectivity structures. These structures are very different, and successful Internet topology modeling requires annotating the nodes and edges of the corresponding graphs with information that reflects their network-intrinsic meaning. These structures also give rise to different representations of the traffic that traverses the heterogeneous Internet, and a traffic matrix is a compact and succinct description of the traffic exchanges between the nodes in a given connectivity structure. In this paper, we summarize recent advances in Internet research related to (i) inferring and modeling the router-level topologies of individual service providers (i.e., the physical connectivity structure of an ISP, where nodes are routers/switches and links represent physical connections), (ii) estimating the intra-AS traffic matrix when the AS's router-level topology and routing configuration are known, (iii) inferring and modeling the Internet's AS-level topology, and (iv) estimating the inter-AS traffic matrix. We will also discuss recent work on Internet connectivity structures that arise at the higher layers in the TCP/IP protocol stack and are more virtual and dynamic; e.g., overlay networks like the WWW graph, where nodes are web pages and edges represent existing hyperlinks, or P2P networks like Gnutella, where nodes represent peers and two peers are connected if they have an active network connection.


  • On TCP and self-similar traffic

    by Daniel R. Figueiredo, Benyuan Liu, Anja Feldmann, Vishal Misra, Don Towsley, Walter Willinger


  • Open Access

    What Causal Forces Shape Internet Connectivity at the AS-level?

    by Hyunseok Chang, Sugih Jamin, Walter Willinger

    Two ASs are connected in the Internet AS graph only if they have a business peering relationship. By focusing on the AS subgraph ASpc whose links represent provider-customer relationships, we present an empirical study that identifies three crucial causal forces at work in the design of AS connectivity: (i) AS-geography, i.e., locality and number of PoPs (Points-of-Presence) within individual ASs; (ii) AS-specific business models, abstract toy models that describe how individual ASs choose their best provider; and (iii) AS evolution, a historic account of the lives of individual ASs in a dynamic ISP market. Based on these findings that directly relate to how provider-customer relationships may be determined in the actual Internet, we develop a new optimization-driven model for Internet growth at the ASpc level. Its defining feature is an explicit construction of a novel class of intuitive, multi-objective, local optimizations by which the different ASs determine in a fully distributed and decentralized fashion their best upstream provider. We show that our model is broadly robust, perforce yields graphs that match inferred AS connectivity with respect to many different metrics, and is ideal for exploring the impact of new peering incentives or policies on AS-level connectivity.