Show simple item record

dc.contributor.authorSahhaf, Sahel
dc.contributor.authorTavernier, Wouter
dc.contributor.authorPapadimitriou, Dimitri
dc.contributor.authorCareglio, Davide
dc.contributor.authorKumar, Alok
dc.contributor.authorGlacet, Christian
dc.contributor.authorCoudert, David
dc.contributor.authorNisse, Nicolas
dc.contributor.authorFàbrega Soler, LLuís
dc.contributor.authorVila, Pere
dc.contributor.authorCamelo, Miguel
dc.contributor.authorAudenaert, Pieter
dc.contributor.authorColle, Didier
dc.contributor.authorDemeester, Piet M.A.
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament d'Arquitectura de Computadors
dc.identifier.citationSahhaf, S., Tavernier, W., Papadimitriou, D., Careglio, D., Kumar, A., Glacet, C., Coudert, D., Nisse, N., Fàbrega, L., Vila, P., Camelo, M., Audenaert, P., Colle, D., Demeester, P. Routing at large scale: advances and challenges for complex networks. "IEEE network", 1 Juliol 2017, vol. 31, núm. 4, p. 108-118.
dc.description.abstractA wide range of social, technological and communication systems can be described as complex networks. Scale-free networks are one of the well known classes of complex networks in which nodes' degrees follow a power-law distribution. The design of scalable, adaptive and resilient routing schemes in such networks is very challenging. In this article we present an overview of required routing functionality, categorize the potential design dimensions of routing protocols among existing routing schemes, and analyze experimental results and analytical studies performed so far to identify the main trends/trade-offs and draw main conclusions. Besides traditional schemes such as hierarchical/shortest-path path-vector routing, the article pays attention to advances in compact routing and geometric routing since they are known to significantly improve scalability in terms of memory space. The identified trade-offs and the outcomes of this overview enable more careful conclusions regarding the (un-)suitability of different routing schemes to large-scale complex networks and provide a guideline for future routing research.
dc.format.extent11 p.
dc.subjectÀrees temàtiques de la UPC::Enginyeria de la telecomunicació::Telemàtica i xarxes d'ordinadors
dc.subject.lcshComputer networks -- Scalability
dc.subject.lcshComputational complexity
dc.subject.lcshRouting protocols (Computer network protocols)
dc.subject.otherComplex networks
dc.subject.otherRouting protocols
dc.titleRouting at large scale: advances and challenges for complex networks
dc.subject.lemacComplexitat computacional
dc.subject.lemacEncaminadors (Xarxes d'ordinadors)
dc.contributor.groupUniversitat Politècnica de Catalunya. CBA - Sistemes de Comunicacions i Arquitectures de Banda Ampla
dc.description.peerreviewedPeer Reviewed
dc.rights.accessOpen Access
dc.description.versionPostprint (author's final draft)
dc.relation.projectidinfo:eu-repo/grantAgreement/EC/FP7/258307/EU/Experimental UpdateLess Evolutive Routing/EULER
local.citation.authorSahhaf, S.; Tavernier, W.; Papadimitriou, D.; Careglio, D.; Kumar, A.; Glacet, C.; Coudert, D.; Nisse, N.; Fàbrega, L.; Vila, P.; Camelo, M.; Audenaert, P.; Colle, D.; Demeester, P.
local.citation.publicationNameIEEE network

Files in this item


This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder