Filters








8,731 Hits in 2.3 sec

Compact routing on internet-like graphs

D. Krioukov, K. Fall, Xiaowei Yang
IEEE INFOCOM 2004  
Using both direct analysis and simulation, we calculate the stretch distribution of this routing scheme on random graphs with power-law node degree distributions, P_k ∼ k^-γ.  ...  In particular, for the Internet interdomain graph, γ∼ 2.1, the average stretch is around 1.1, with up to 70 being shortest. As the network grows, the average stretch slowly decreases.  ...  To further investigate this relationship, we focus on the performance of compact routing schemes on scale-free graphs.  ... 
doi:10.1109/infcom.2004.1354495 dblp:conf/infocom/KrioukovFY04 fatcat:mnuhjwhbyngg7ofv635ru5lfle

Toward Compact Interdomain Routing [article]

Dmitri Krioukov, kc claffy
2005 arXiv   pre-print
We are fortunate that a sister discipline, theory of distributed computation, has developed routing algorithms that offer promising potential for genuinely scalable routing on realistic Internet-like topologies  ...  Many open questions remain, but we believe the applicability of compact routing techniques to Internet interdomain routing is a research area whose potential payoff for the future of networking is too  ...  An interesting question is why compact routing turns out to be so spectacularly efficient on Internet-like topologies.  ... 
arXiv:cs/0508021v1 fatcat:5ewovi7ri5abxdfuki4kvcmb3m

On compact routing for the internet

Dmitri Krioukov, k c claffy, Kevin Fall, Arthur Brady
2007 Computer communication review  
this paper that in view of recent results in compact routing research, such logarithmic scaling on Internet-like topologies is fundamentally impossible in the presence of topology dynamics or topology-independent  ...  While there exist compact routing schemes designed for grids, trees, and Internet-like topologies that offer routing tables of sizes that scale logarithmically with the network size, we demonstrate in  ...  Since they can work on all graphs, the worst-case graph may not be, and usually is not, "Internet-like."  ... 
doi:10.1145/1273445.1273450 fatcat:umclhzou6facdf25c3pxnfrrhi

Brief Announcement

Cyril Gavoille, Christian Glacet, Nicolas Hanusse, David Ilcinkas
2015 Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing - PODC '15  
This paper investigates compact routing schemes that are very efficient with respect to the memory used to store routing tables in internet-like graphs.  ...  Moreover, we experimentally show that our scheme is very efficient in terms of stretch and memory in internet-like graphs (CAIDA and other maps).  ...  PLRG) a model for internet-like graphs whose analytic study is less convenient than the RPLG model. antees, in internet-like graphs, to produce compact routing tables of very small average size at every  ... 
doi:10.1145/2767386.2767449 dblp:conf/podc/GavoilleGHI15 fatcat:x5cdczwxxfghtiouzhvrnhreem

Adding Geographical Embedding to AS Topology Generation [article]

Arne Schwabe, Holger Karl
2014 arXiv   pre-print
To study large-scale effects on the Internet various mod- els have been introduced to generate Internet-like autono- mous system (AS) topologies.  ...  These models how- ever lack the ability to generate routing path and realistic latency. We present a model to enrich the AS peering graph with peering points.  ...  Acknowledgment This work was partially supported by the German Research Foundation (DFG) within the Collaborative Research Center "On-The-Fly Computing" (SFB 901).  ... 
arXiv:1409.7042v1 fatcat:yxrp4bnkdfhcvmel3v6dktq3wi

Compact routing on the Internet AS-graph

Stephen D. Strowes, Graham Mooney, Colin Perkins
2011 2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)  
Prior analyses have shown strong performance on power-law random graphs, but to better understand the applicability of compact routing algorithms in the context of the Internet, they must be evaluated  ...  To this end, we present the first systematic analysis of the behaviour of the Thorup-Zwick (TZ) and Brady-Cowen (BC) compact routing algorithms on snapshots of the Internet Autonomous System graph spanning  ...  To understand the behaviour of compact routing on the Internet graph, we evaluate these algorithms against a series of AS graph topologies derived from full BGP routing tables from the same source spanning  ... 
doi:10.1109/infcomw.2011.5928931 fatcat:daaucvwkavhhtaupj73qcx3bki

Compact Routing on Power Law Graphs with Additive Stretch

Arthur Brady, Lenore Cowen
2006 2006 Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments (ALENEX)  
The Thorup-Zwick universal multiplicative stretch 3 scheme has recently been suggested for routing on the Internet inter-AS graph; we argue, based on the results in this paper, that it is possible to improve  ...  worst-case performance on this graph by directly exploiting its power-law topology.  ...  Dmitri Krioukov and k claffy of CAIDA (http://www.caida.org) continue to give critical insight about routing on "real" Internet graphs.  ... 
doi:10.1137/1.9781611972863.12 dblp:conf/alenex/BradyC06 fatcat:fdx5etsqujhvzkgok66d7by5mu

Improved Compact Routing Schemes for Power-Law Networks [chapter]

Mingdong Tang, Jianxun Liu, Guoqing Zhang
2011 Lecture Notes in Computer Science  
Simulations conducted on random power law graphs and real-world AS-level Internet graph validate the effectivity of our schemes.  ...  the Internet routing system.  ...  Krioukov [13] first evaluated the performance of the TZ scheme on Internet-like power-law graphs, and found that the performance is far better than the worst case theoretic results, e.g., the average  ... 
doi:10.1007/978-3-642-24403-2_4 fatcat:pvgwh3ieqrcobalup52y7wi2zu

Treewidth and Hyperbolicity of the Internet

Fabien de Montgolfier, Mauricio Soto, Laurent Viennot
2011 2011 IEEE 10th International Symposium on Network Computing and Applications  
On the other hand, the hyperbolicity (as a graph parameter) appears to be very low, reflecting a tree-like structure with respect to distances.  ...  We study the measurement of the Internet according to two graph parameters: treewidth and hyperbolicity. Both tell how far from a tree a graph is.  ...  Second, graphs with low hyperbolicity offer more tractability, enabling efficient algorithms for routing related problems like compact routing, or diameter estimation, among others [5] - [8] .  ... 
doi:10.1109/nca.2011.11 dblp:conf/nca/MontgolfierSV11 fatcat:mo76tsvokfhl3bbh6duh4ov7mu

Compact policy routing

Gábor Rétvári, András Gulyás, Zalán Heszberger, Márton Csernai, József J. Bíró
2011 Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing - PODC '11  
Compact routing and the Internet • The theory dealing with fundamental routing scalability is called compact routing • All our scalability results are for shortest paths • But Internet routing does not  ...  if there is at least one graph in which at least one node needs linear information for routingaccording to A, i.e., M A is Ω(n) • Compressible otherwisePropositions • Proposition: a routing policy A can  ...  Conclusions • Scaling limits for shortest path routing well researched • But shortest path routing does not matter in the Internet • The fundamental scalability of policy routing has so far not been studied  ... 
doi:10.1145/1993806.1993828 dblp:conf/podc/RetvariGHCB11 fatcat:szqorvr4mnbl5bdwmzlhon3pou

Compact policy routing

Gábor Rétvári, András Gulyás, Zalán Heszberger, Márton Csernai, József J. Bíró
2012 Distributed computing  
Compact routing and the Internet • The theory dealing with fundamental routing scalability is called compact routing • All our scalability results are for shortest paths • But Internet routing does not  ...  if there is at least one graph in which at least one node needs linear information for routingaccording to A, i.e., M A is Ω(n) • Compressible otherwisePropositions • Proposition: a routing policy A can  ...  Conclusions • Scaling limits for shortest path routing well researched • But shortest path routing does not matter in the Internet • The fundamental scalability of policy routing has so far not been studied  ... 
doi:10.1007/s00446-012-0181-9 fatcat:ea5j3nitjvgdna6phckumohe5u

Scalable routing on flat names

Ankit Singla, P. Brighten Godfrey, Kevin Fall, Gianluca Iannaccone, Sylvia Ratnasamy
2010 Proceedings of the 6th International COnference on - Co-NEXT '10  
Our design builds on theoretical advances in the area of compact routing, and is the first to realize these guarantees in a dynamic distributed setting. 1 The standard notationÕ(·) hides polylogarithmic  ...  We introduce a protocol which routes on flat, locationindependent identifiers with guaranteed scalability and low stretch.  ...  [29, 30] applied static compact routing algorithms to Internet-like topologies with promising results, but did not develop distributed protocols. Related techniques in overlay networks.  ... 
doi:10.1145/1921168.1921195 dblp:conf/conext/SinglaGFIR10 fatcat:3huahuvzijbhhf2kwogaj3rimi

On the Memory Requirement of Hop-by-Hop Routing: Tight Bounds and Optimal Address Spaces

Attila Korosi, Andras Gulyas, Zalan Heszberger, Jozsef Biro, Gabor Retvari
2020 IEEE/ACM Transactions on Networking  
Index Terms-Compact routing, name independent and name dependent routing, information theory, routing table entropy.  ...  Routing in large-scale computer networks today is built on hop-by-hop routing: packet headers specify the destination address and routers use internal forwarding tables to map addresses to next-hop ports  ...  HOP-BY-HOP ROUTING MODEL We adopt the model of static oblivious routing functions for compact routing from [19] . Let G(V, E) be a simple connected undirected graph on n nodes.  ... 
doi:10.1109/tnet.2020.2984761 fatcat:jqo5bqnfezaf7mjncesn56ddfe

On the Routability of the Internet [chapter]

Pau Erola, Sergio Gómez, Alex Arenas
2013 Modeling and Simulation in Science, Engineering and Technology  
Unfortunately, these studies have concluded that in the presence of topology dynamics, a better scaling on Internet-like topologies is fundamentally impossible: while routing tables can be greatly reduced  ...  Schemes based on compact routing and network architecture To reduce the cost of communication networks we should be concerned about the routing of messages through the network, which ideally should follow  ... 
doi:10.1007/978-1-4614-6729-8_3 fatcat:t2os4lymcfex5fvdqg5n4e7oa4

Scalable Routing on Flat Names [article]

Ankit Singla, P. Brighten Godfrey, Kevin Fall, Gianluca Iannaccone,, Sylvia Ratnasamy
2013 arXiv   pre-print
Our design builds on theoretical advances in the area of compact routing, and is the first to realize these guarantees in a dynamic distributed setting.  ...  We introduce a protocol which routes on flat, location-independent identifiers with guaranteed scalability and low stretch.  ...  [29, 30] applied static compact routing algorithms to Internet-like topologies with promising results, but did not develop distributed protocols. Related techniques in overlay networks.  ... 
arXiv:1302.6156v1 fatcat:uakohe72jjednmfv4dro7daqey
« Previous Showing results 1 — 15 out of 8,731 results