Publications

• D.Krioukov and M. Ostilli,
  Duality between equilibrium and nonequilibrium networks,
  arXiv,
  One-sentence abstract: under certain conditions, satisfied in causal sets and complex networks, equilibrium and growing network models are exactly identical.
   
• C. Orsini, E. Gregori, L. Lenzini, and D. Krioukov,
  Evolution of the Internet k-dense structure,
  arXiv,
  One-sentence abstract: The normalized k-dense decomposition of the Internet is time-ivariant.
   
• F. Papadopoulos, C. Psomas, and D. Krioukov,
  Replaying the Geometric Growth of Complex Networks and Application to the AS Internet,
  ACM SIGMETRICS Performance Evaluation Review, v.40, n.3, p.104-106, 2012 (DOI, arXiv),
  One-sentence abstract: replaying the historical growth of complex networks using popularity*similarity optimization maps them accurately to their hyperbolic spaces, and predicts missing links.
   
• D. Krioukov, M. Kitsak, R. Sinkovits, D. Rideout, D. Meyer, and M. Boguna,
  Network Cosmology,
  Nature Scientific Reports, v.2, p.793, 2012 (DOI, arXiv),
  Press: UCSD, SDSC, Space, Time, TheRegister, CBS, HuffingtonPost, HuffingtonPostUK, PopularScience, LiveScience, Slashdot, Robots.Net, PhysOrg, ScienceDaily, TGDaily, DigitalJournal, Vesti, MK, LifeNews, theRunet,...
  One-sentence abstract: The large-scale structure and dynamics of complex networks and the universe are asymptotically identical.
   
• F. Papadopoulos, M. Kitsak, M. Angeles Serrano, M. Boguna, and D. Krioukov,
  Popularity versus Similarity in Growing Networks,
  Nature, v.489, p.537, 2012 (DOI, arXiv),
  Press: UCSD, SDSC, Nature, Nature Physics, PhysOrg, ScienceDaily, AMS, Le Scienze, STRF, Elsevier, ...
  One-sentence abstract: Trade-offs between popularity and similarity shape the structure and dynamics of growing complex networks, with preferential attachment emerging from local optimization processes, casting these networks as random geometric graphs growing in hyperbolic spaces.
   
• D. Krioukov,
  The Proof of Innocence,
  Annals of Improbable Research, v.18, n.4, p.12, 2012 (AIR, arXiv),
  Press: a top physics newsmaker of 2012, appearing at all major news, TV, and radio channels worldwide, such as ABC, ABC Science, BBC, CBS, CNET, CNN, CNN International, Compulenta, Corriere, Daily Mail, Echo of Moscow, Fox News, KPBS, LA Times, LentaRu, MSN, NBC, NewsRu, NPR, CarTalk, Physics Central, Salon, Science, Slashdot, The Star, Union Tribune, Wired, Yahoo, ...
  One-sentence abstract: A way to fight your traffic tickets.
   
• M. Kitsak and D. Krioukov,
  Hidden Variables in Bipartite Networks,
  Physical Review E, v.84, 026114, 2011 (DOI, arXiv),
  One-sentence abstract: The hidden variable framework is extended to bipartite networks.
   
• M. Angeles Serrano, D. Krioukov, and M. Boguna,
  Percolation in Self-Similar Networks,
  Physical Review Letters, v.106, 048701, 2011 (DOI, arXiv),
  One-sentence abstract: Self-similar networks have zero percolation threshold.
   
• D. Krioukov, F. Papadopoulos, M. Kitsak, A. Vahdat, and M. Boguna,
  Hyperbolic Geometry of Complex Networks,
  Physical Review E, v.82, 036106, 2010 (DOI, arXiv)
  One-sentence abstract: A framework to study the structure and function of complex networks in purely geometric terms.
   
• M. Boguna, F. Papadopoulos, and D. Krioukov,
  Sustaining the Internet with Hyperbolic Mapping,
  Nature Communications, v.1, p.62, 2010 (DOI, arXiv, data),
  Press: UCSD, SDSC, U. Barcelona, Nature, New Scientist, IEEE Spectrum, Communications of the ACM, Computerworld, MIT Scope, The Register, CBC, El Pais, TOVIMA, Electronics Weekly, PhysOrg, ACMEscience, Science Daily, I Programmer, ISPreview, PC Pro, R&D Mag, EnterTheGrid, CNews, Compulenta, Daily UA, CyprusMail, ...
  One-sentence abstract: Mapping the Internet to its underlying hyperbolic space enables optimal routing in the Internet.
   
• F. Papadopoulos, D. Krioukov, M. Boguna, and A. Vahdat,
  Greedy Forwarding in Dynamic Scale-Free Networks Embedded in Hyperbolic Metric Spaces,
  INFOCOM 2010 (DOI, arXiv),
  One-sentence abstract: Almost all greedy-routing paths reach their destinations and follow shortest paths in scale-free networks growing on the hyperbolic plane.
   
• S. Shakkottai, M. Fomenkov, R. Koga, D. Krioukov, and kc claffy,
  Evolution of the Internet AS-Level Ecosystem,
  European Physical Journal B, v.74, p.271-278, 2010 (DOI, arXiv),
  COMPLEX 2009 (DOI, arXiv),
  One-sentence abstract: A customer-provider-based modification of preferential attachment explains Internet topology evolution.
   
• X. Dimitropoulos, D. Krioukov, A. Vahdat, and G. Riley,
  Graph Annotations in Modeling Complex Network Topologies,
  ACM Transactions on Modeling and Computer Simulation, v.19, n.4, p.17, 2009 (DOI, arXiv),
  One-sentence abstract: How to model, analyze, and generate complex network topologies using the correlations among network-specific annotations ("types") of links and nodes.
   
• D. Krioukov, F. Papadopoulos, A. Vahdat, and M. Boguna,
  Curvature and Temperature of Complex Networks,
  Physical Review E, v.80, 035101(R), 2009 (DOI, arXiv),
  One-sentence abstract: Hidden hyperbolic geometries, which are abstractions of the hierarchical (community) structure of complex networks, underlie and explain their observed scale-free topologies.
   
• A. Jamakovic, P. Mahadevan, A. Vahdat, M. Boguna, and D. Krioukov,
  How Small Are Building Blocks of Complex Networks,
  arXiv,
  One-sentence abstract: The global structure of complex networks is statistically determined by the probability of the presence of links between node triples, once this probability accounts for the degree of the individual nodes.
   
• D. Krioukov, F. Papadopoulos, M. Boguna, and A. Vahdat,
  Greedy Forwarding in Scale-Free Networks Embedded in Hyperbolic Metric Spaces,
  ACM SIGMETRICS Performance Evaluation Review, v.37, n.2, p.15-17, 2009 (DOI, arXiv),
  One-sentence abstract: Greedy forwarding in synthetic scale-free networks emerging on underlying hyperbolic metric spaces is remarkably efficient and robust with respect to link failures.
   
• kc claffy, Y. Hyun, K. Keys, M. Fomenkov, and D. Krioukov,
  Internet Mapping: From Art to Science,
  CATCH 2009 (DOI),
  One-sentence abstract: Introducing Ark, CAIDA's new Internet measurement infrastructure.
   
• M. Boguna and D. Krioukov,
  Navigating Ultrasmall Worlds in Ultrashort Time,
  Physical Review Letters, v.102, 058701, 2009 (DOI, arXiv),
  Press: Nature, NewScientist, PhysOrg,
  One-sentence abstract: Greedy-routing paths are asymptotically shortest paths in scale-free, strongly clustered networks.
   
• M. Boguna, D. Krioukov, and kc claffy,
  Navigability of Complex Networks,
  Nature Physics, v.5, p.74-80, 2009 (DOI, arXiv),
  Press: UCSD, Nature, DailyTech, Science Daily, Voice of San Deigo, Technology Review, news:lite, Lenta.ru, ...
  One-sentence abstract: Complex networks have navigable topologies.
   
• P. Krapivsky and D. Krioukov,
  Scale-Free Networks as Preasymptotic Regimes of Superlinear Preferential Attachment,
  Physical Review E, v.78, 026114, 2008 (DOI, arXiv),
  One-sentence abstract: Even super-linear preferential attachment can produce scale-free networks, although it can do so only in its vast pre-asymptotic regimes, which bring up the question what if observed power laws are actually pre-asymptotic effects?
   
• X. Dimitropoulos, M. Angeles Serrano, and D. Krioukov,
  On Cycles in AS Relationships,
  ACM SIGCOMM Computer Communication Review (CCR), v.38, n.3, p.103-104, 2008 (DOI, arXiv),
  One-sentence abstract: Cycles induced by business relationships among ASs are expected.
   
• M. Angeles Serrano, D. Krioukov, and M. Boguna,
  Self-Similarity of Complex Networks and Hidden Metric Spaces,
  Physical Review Letters, v.100, 078701, 2008 (DOI, arXiv),
  One-sentence abstract: Self-similarity of clustering in real complex networks provides a strong empirical evidence that hidden metric spaces underlie these networks.
   
• P. Mahadevan, C. Hubble, D. Krioukov, B. Huffaker, and A. Vahdat,
  Orbis: Rescaling Degree Correlations to Generate Annotated Internet Topologies,
  SIGCOMM 2007 (DOI),
  One-sentence abstract: Network topology generator inspired by the dK-series.
   
• D. Krioukov, kc claffy, K. Fall, and A. Brady,
  On Compact Routing for the Internet,
  ACM SIGCOMM Computer Communication Review (CCR), v.37, n.3, 2007 (DOI, arXiv),
  One-sentence abstract: Compact routing generally assumes the full global knowledge of the network topology, and therefore it cannot help with communication overhead/convergence scaling problems in Internet routing.
   
• D. Krioukov, F. Chung, kc claffy, M. Fomenkov, A. Vespignani, and W. Willinger,
  The Workshop on Internet Topology (WIT) Report,
  ACM SIGCOMM Computer Communication Review (CCR), v.37, n.1, 2007 (DOI, arXiv),
  One-sentence abstract: Some agreements about the Internet topology among researchers from different communities are reported; there are more disagreements, of course!
   
• X. Dimitropoulos, D. Krioukov, M. Fomenkov, B. Huffaker, Y. Hyun, kc claffy, and G. Riley,
  AS Relationships: Inference and Validation,
  ACM SIGCOMM Computer Communication Review (CCR), v.37, n.1, 2007 (DOI, arXiv, data),
  One-sentence abstract: Infer the AS relationships using our best-of-breed heuristics, validate their results via a questionnaire to network operators, adjust the code to run automatically once a week, and make the data publicly available.
   
• P. Mahadevan, D. Krioukov, K. Fall, and A. Vahdat,
  Systematic Topology Analysis and Generation Using Degree Correlations,
  SIGCOMM 2006 (DOI, arXiv),
  One-sentence abstract: dK-series is a series of degree correlations in small graphs on increasing size d, which does not have to be large: reproducing the 2K-correlations for the AS Internet topology reproduces its global structure, while d=3 is enough even for "very designed, non-random" graphs.
   
• X. Dimitropoulos, D. Krioukov, G. Riley, and kc claffy,
  Revealing the Autonomous System Taxonomy: The Machine Learning Approach,
  PAM 2006 (best paper award) (PAM, arXiv, data),
  One-sentence abstract: All you wish to know about the AS-level Internet topology: ASs are classified into AS types using a series of AS attributes, and all the data is made publicly available, along with AS links classified by AS business relationships.
   
• P. Mahadevan, D. Krioukov, M. Fomenkov, B. Huffaker, X. Dimitropoulos, kc claffy, and A. Vahdat,
  The Internet AS-Level Topology: Three Data Sources and One Definitive Metric,
  ACM SIGCOMM Computer Communication Review (CCR), v.36, n.1, 2006 (DOI, arXiv, data),
  Lessons from Three Views of the Internet Topology,
  Technical report CAIDA-TR-2005-02, 2005 (CAIDA, arXiv),
  One-sentence abstract: Extract the Internet AS topology from BGP routing tables and updates, traceroutes (skitter), and WHOIS databases, compute the most popular metrics for all the extracted topologies, and make all the resulting data (graphs and computed metrics) publicly available.
   
• X. Dimitropoulos, D. Krioukov, B. Huffaker, kc claffy, and G. Riley,
  Inferring AS Relationships: Dead End or Lively Beginning,
  WEA 2005; LNCS 3503:113-125, April 2005 (DOI, arXiv),
  One-sentence abstract: Yet another AS business relationship inference heuristic combining the best features of the best existing heuristics.
   
• X. Dimitropoulos, D. Krioukov, and G. Riley,
  Revisiting Internet AS-Level Topology Discovery,
  PAM 2005; LNCS 3431:177-188, March 2005 (DOI, arXiv),
  One-sentence abstract: In the BGP updates data the number of unique AS links grows linearly with the observation time, while the topological properties of BGP-updates- and BGP-tables-derived AS graphs are similar.
   
• D. Krioukov, K. Fall, and X. Yang,
  Compact Routing on Internet-Like Graphs,
  INFOCOM 2004 (DOI, INFOCOM),
  Technical report IRB-TR-03-10 (arXiv),
  One-sentence abstract: Compact routing on scale-free networks yields essentially the best possible trade-off between the average stretch (optimality of paths) and size of routing tables (memory requirements per node).
   
• E. Davies, A. Doria, H. Berkowitz, D. Krioukov, M. Carlzon, A. Bergsten, O. Pers, Y. Jiang, L. Carr-Motyckova, P. Fransson, O. Schelen, and T. Madsen,
  Analysis of Inter-Domain Routing Requirements and History,
  IRTF Routing Research Working Group RFC5773, 2010 (pdf, txt).
   
• E. Davies, A. Doria, H. Berkowitz, D. Krioukov, M. Carlzon, A. Bergsten, O. Pers, Y. Jiang, L. Carr-Motyckova, P. Fransson, O. Schelen, and T. Madsen,
  Future Domain Routing Requirements,
  IRTF Routing Research Working Group ID, 2001 (pdf, txt).
   
• H. Berkowitz and D. Krioukov,
  To Be Multihomed: Requirements and Definitions,
  IETF Network Working Group ID, 2001 (pdf, txt).
   
• D. Krioukov,
  Construction of Effective Electromagnetic Currents for Two-Body Quasipotential Equations,
  Ph.D. thesis, Old Dominion University, 1998 (pdf, ps).
   
• D. Krioukov,
  Non-standard Differential Calculi on the Quantum Group SL_q(2),
  Diploma, St. Petersburg University, 1993.

Book chapters

• Integrating Nonrouted Services and IRB,
  In CCNP: ACRC Study Guide,
  McGraw-Hill, 1999.

Recent Slides

Older Slides
(not updated)

• D. Krioukov, K. Fall, and kc claffy,
  Scalability of Routing: Compactness and Dynamics,
  IETF-67, San Diego, CA, November 2006 (ppt, pdf).
• D. Krioukov,
  dK-series: Systematic Topology Analysis and Generation Using Degree Correlations,
  LIAFA, Paris, France, June 2006 (ppt, pdf).
• D. Krioukov,
  Something We Always Wanted to Know about ASs: Relationships and Taxonomy,
  LIP6, Paris, France, June 2006 (ppt, pdf).
• D. Krioukov,
  Flat Routing on Curved Spaces,
  UC Berkeley, Berkeley, CA, April 2006 (ppt, pdf).
• D. Krioukov,
  Theory of Networks,
  UCSD, San Diego, CA, June 2005 (ppt, pdf).
• D. Krioukov,
  Degree Correlations and Topology Generators,
  5^th CAIDA-WIDE Workshop, Marina Del Rey, CA, March 2005 (ppt, pdf).
• D. Krioukov,
  Progress in Inferring Business Relationships Between ASs,
  4^th CAIDA-WIDE Workshop, San Diego, CA, August 2004 (ppt, pdf).
• D. Krioukov,
  RR-FS Status Report,
  IETF-60, San Diego, CA, August 2004 (ppt, pdf).
• D. Krioukov and kc claffy,
  Introduction to Compact Routing,
  Interdomain Routing Workshop, Amsterdam, Holland, May 2004 (abstract, ppt, pdf).
• D. Krioukov,
  Introduction to Compact Routing,
  3^rd CAIDA-WIDE Workshop, Marina del Rey, CA, April 2004 (ppt, pdf).
• D. Krioukov and D. Volchenkov,
  Modeling Self-Organized Data Network Growth,
  L'ATELIER PMN: Systemes dynamiques, controle et reseaux genetiques,
  La Villa Clythia, Frejus, France, May 2003.
• D. Krioukov,
  Project for a ®Evolution in Data Network Routing: the Kleinrock Universe and Beyond,
  Midnight Sun Routing Workshop, Lulea, Sweden, June 2002 (ppt, pdf).
• D. Krioukov and A. Kit,
  Global Server Load Balancing,
  NANOG20, Washington, DC, October 2000 (ppt, pdf).
• D. Krioukov and J. W. Van Orden,
  Construction of Effective Electromagnetic Currents for Two-Body Quasipotential Equations,
  APS/AAPT Joint Meeting, Columbus, OH, April 1998 (ps, pdf).