Sudhir Leslie Tauro

University of California, Riverside, Riverside, California, United States

Are you Sudhir Leslie Tauro?

Claim your profile

Publications (3)1.01 Total impact

  • Source
    Georgos Siganos · Sudhir Leslie Tauro · Michalis Faloutsos
    [Show abstract] [Hide abstract]
    ABSTRACT: Several novel concepts and tools have revolution-ized our understanding of the Internet topology. Most of the existing efforts attempt to develop accurate analytical models. In this paper, our goal is to develop an effective conceptual model: a model that can be easily drawn by hand, while at the same time, it captures significant macro-scopic properties. We build the foundation for our model with two thrusts: a) we identify new topological properties, and b) we provide met-rics to quantify the topological importance of a node. We propose the jellyfish as a model for the inter-domain Internet topology. We show that our model captures and represents the most sig-nificant topological properties. Furthermore, we observe that the jellyfish has lasting value: it describes the topology for more than six years.
    Preview · Article · Jan 2005 · Journal of Communications and Networks
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we develop methods to "sample " a large real network into a small realistic graph. Although topology modeling has received a lot attention lately, it has not yet been completely resolved. Several methods create arguably realistic topologies from scratch. Our approach moves in the exact opposite direction. First, we observe that many real topologies are available to the networking community. However, their size makes them expensive to use in simulations as is. This brings up the following question: how can we shrink a graph, so that it still retains its essential properties? We propose an iterative sampling framework and seven different "sampling" methods. We show that some of our methods can be very effective: they reduce a graph by 70%, and maintain several topological properties within 22% of the expected value. An advantage of this method is that it can potentially maintain topological properties that we are not yet aware: all we have to is sample "fairly". In addition, our methods are statistically robust and reliable. We find that apart from its practical applications, the problem of graph sampling is of interest in its own right.
    Preview · Article · Jul 2003
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we develop a conceptual visual model for the Internet inter-domain topology. Recently, power-laws were used to describe the topology concisely. Despite their success, the power-laws do not help us visualize the topology, ie, draw the topology on paper by hand. In this paper, we deal with the following questions: can we identify a hierarchy in the Internet; how can I represent the network in an abstract graphical way? The focus of this paper is threefold. First, we characterize nodes using three metrics of topological "importance"', which we later use to identify a sense of hierarchy. Second, we identify some new topological properties. We then find that the Internet has a highly connected core and identify layers of nodes in decreasing importance surrounding the core. Finally, we show that our observations suggest an intuitive model. The topology can be seen as a jellyfish, where the core is in the middle of the cap, and one-degree nodes form its legs
    Preview · Conference Paper · Feb 2001

Publication Stats

141 Citations
1.01 Total Impact Points


  • 2001
    • University of California, Riverside
      • Department of Computer Science and Engineering
      Riverside, California, United States