#### Filter Results:

- Full text PDF available (55)

#### Publication Year

2004

2017

- This year (4)
- Last 5 years (21)
- Last 10 years (44)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Priya Mahadevan, Dmitri V. Krioukov, Marina Fomenkov, Xenofontas A. Dimitropoulos, Kimberly C. Claffy, Amin Vahdat
- Computer Communication Review
- 2006

The paper provides an overview of the current available data sets for AS level topology and examines the usefulness and intuition of many and most widely used metrics used for graph analysis, and highlight some less known metrics. The paper makes two practical contributions.First, the paper highlights an important issue: all source of AS information are not… (More)

- Priya Mahadevan, Dmitri V. Krioukov, Kevin R. Fall, Amin Vahdat
- SIGCOMM
- 2006

Researchers have proposed a variety of metrics to measure important graph properties, for instance, in social, biological, and computer networks. Values for a particular graph metric may capture a graph's resilience to failure or its routing efficiency. Knowledge of appropriate metric values may influence the engineering of future topologies, repair… (More)

- Xenofontas A. Dimitropoulos, Dmitri V. Krioukov, +4 authors George F. Riley
- Computer Communication Review
- 2007

Research on performance, robustness, and evolution of the global Internet is fundamentally handicapped without accurate and thorough knowledge of the nature and structure of the contractual relationships between Autonomous Systems (ASs). In this work we introduce novel heuristics for inferring AS relationships. Our heuristics improve upon previous works in… (More)

- Dmitri V. Krioukov, Fragkiskos Papadopoulos, Maksim Kitsak, Amin Vahdat, Marián Boguñá
- Physical review. E, Statistical, nonlinear, and…
- 2010

We develop a geometric framework to study the structure and function of complex networks. We assume that hyperbolic geometry underlies these networks, and we show that with this assumption, heterogeneous degree distributions and strong clustering in complex networks emerge naturally as simple reflections of the negative curvature and metric property of the… (More)

- Kimberly Claffy, Young Hyun, Ken Keys, Marina Fomenkov, Dmitri Krioukov
- 2009 Cybersecurity Applications & Technology…
- 2009

We are designing, implementing, deploying, and operating a secure measurement platform capable of performing various types of Internet infrastructure measurements and assessments. We integrate state-of-the-art measurement and analysis capabilities to try to build a coherent view of Internet topology. In September 2007 we began to use this novel architecture… (More)

- Priya Mahadevan, Calvin Hubble, Dmitri V. Krioukov, Bradley Huffaker, Amin Vahdat
- SIGCOMM
- 2007

Researchers involved in designing network services and protocols rely on results from simulation and emulation environments to understand their application performance and scalability. To better understand the behavior of these applications and predict their performance when deployed on the actual Internet, the generated topologies must closely match real… (More)

- Marián Boguñá, Dmitri V. Krioukov, Kimberly C. Claffy
- ArXiv
- 2007

Routing information through networks is a universal phenomenon in both natural and manmade complex systems. When each node has full knowledge of the global network connectivity, finding short communication paths is merely a matter of distributed computation. However, in many real networks nodes communicate efficiently even without such global intelligence.… (More)

- Priya Mahadevan, Dmitri V. Krioukov, +4 authors Amin Vahdat
- ArXiv
- 2005

Network topology plays a vital role in understanding the performance of network applications and protocols. Thus, recently there has been tremendous interest in generating realistic network topologies. Such work must begin with an understanding of existing network topologies, which today typically consists of a relatively small number of data sources. In… (More)

The Internet's routing system is facing stresses due to its poor fundamental scaling properties. Compact routing is a research field that studies fundamental limits of routing scalability and designs algorithms that try to meet these limits. In particular, compact routing research shows that shortest-path routing, forming a core of traditional routing… (More)

- Fragkiskos Papadopoulos, Marián Boguñá, Dmitri V. Krioukov
- Nature
- 2012

The principle that 'popularity is attractive' underlies preferential attachment, which is a common explanation for the emergence of scaling in growing networks. If new connections are made preferentially to more popular nodes, then the resulting distribution of the number of connections possessed by nodes follows power laws, as observed in many real… (More)