Fullscreen
Loading...
 

ISC-PIF Publications

Fast Prev Item: 22/490 Fast Next Last Item
1 20 21 22 23 24 71 490

View Item

User Fabien Tarissan
title Impact of power-law topology on IP-level routing dynamics : simulation results.
Authors Amélie Medem, Clémence Magnien et Fabien Tarissan
Source Proceedings of the IEEE International Workshop on Network Science For Communication Networks (NetSciCom'12)
Year 2012
Type Workshop
Type of publication Other

Optional Infos

Abstract This paper focuses on the Internet ip-level routing topology and proposes relevant explanations to its apparent dynamics. We first represent this topology as a power-law random graph. Then, we incorporate to the graph two well known factors responsible for the observed dynamics, which are load balancing and route evolution. Finally, we simulate on the graph traceroute-like measurements. Repeating the process many times, we obtain several graph instances that we use to model the dynamics. Our results show that we are able to capture on power-law graphs the dynamic behaviors observed on the Internet. We find that the results on power-law graphs, while qualitatively similar to the one of Erdös-Rényi random graphs, highly differ quantitatively; for instance, the rate of discovery of new nodes in power-law graphs is extremely low compared to the rate in Erdös-Rényi graphs.
Link http://www-complexnetworks.lip6.fr/~tarissan/articles/pwipdyn.pdf
Bibtex @inproceedings{MMT-Netsci12,
title = {{Impact of power-law topology on IP-level routing dynamics: simulation results}},
author = {Am{\'e}lie Medem, Cl{\'e}mence Magnien, Fabien Tarissan},
abstract = {{This paper focuses on the Internet \ip{}-level routing topology and proposes relevant explanations to its apparent dynamics. We first represent this topology as a power-law random graph. Then, we incorporate to the graph two well known factors responsible for the observed dynamics, which are load balancing and route evolution. Finally, we simulate on the graph \traceroute{}-like measurements. Repeating the process many times, we obtain several graph instances that we use to model the dynamics. Our results show that we are able to capture on power-law graphs the dynamic behaviors observed on the Internet. We find that the results on power-law graphs, while qualitatively similar to the one of Erd\"{o}s-R\'enyi random graphs, highly differ quantitatively; for instance, the rate of discovery of new nodes in power-law graphs is extremely low compared to the rate in Erd\"{o}s-R\'enyi graphs.}},
Keywords = { Internet, routing, dynamics, modeling, measurements},
language = {Anglais},
booktitle = {{4th International IEEE INFOCOM workshop on Network Science for Communication Networks (NetSciCom)}},
address = {Orlando, Florida, USA},
affiliation = {Laboratoire d'Informatique de Paris 6 - LIP6 - CNRS/UPMC},
note = {6 pages },
year = {2012},
month = March,
pdf = {http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=06193495},
}

Created Tuesday 25 June, 2013 10:32:27


Show php error messages