作者: Sahel Sahhaf , Wouter Tavernier , Dimitri Papadimitriou , Davide Careglio , Alok Kumar
DOI: 10.1109/MNET.2017.1600203
关键词:
摘要: A wide range of social, technological and communication systems can be described as complex networks. Scale-free networks are one the well known classes in which nodes� degrees follow a power-law distribution. The design scalable, adaptive resilient routing schemes such is very challenging. In this article we present an overview required functionality, categorize potential dimensions protocols among existing schemes, analyze experimental results analytical studies performed so far to identify main trends/trade-offs draw conclusions. Besides traditional hierarchical/shortest-path path-vector routing, pays attention advances compact geometric since they significantly improve scalability terms memory space. identified trade-offs outcomes enable more careful conclusions regarding (un-)suitability different large-scale provide guideline for future research.