Based on hierarchy and recursion (shortly, HR), recursive networking has evolved to become a possible architecture for the future Internet. In this paper, we advance the study of HR-based routing by means of the Gershenson-Fernandez information-theoretic framework, which provides four different complexity measures. Then, we introduce a novel and general approach for computing the information associated to a known or estimated routing table. Finally, we present simulation results regarding networks that are characterized by different topologies and routing strategies. In particular, we discuss some interesting facts we observed while comparing HR-based to traditional routing in terms of complexity measures.

Evaluation of advanced routing strategies with information-theoretic complexity measures / Amoretti, Michele; Cagnoni, Stefano. - ELETTRONICO. - 659:(2016), pp. 145-153. (Intervento presentato al convegno 31st International Symposium on Computer and Information Sciences, ISCIS 2016 tenutosi a pol nel 2016) [10.1007/978-3-319-47217-1_16].

Evaluation of advanced routing strategies with information-theoretic complexity measures

AMORETTI, Michele;CAGNONI, Stefano
2016-01-01

Abstract

Based on hierarchy and recursion (shortly, HR), recursive networking has evolved to become a possible architecture for the future Internet. In this paper, we advance the study of HR-based routing by means of the Gershenson-Fernandez information-theoretic framework, which provides four different complexity measures. Then, we introduce a novel and general approach for computing the information associated to a known or estimated routing table. Finally, we present simulation results regarding networks that are characterized by different topologies and routing strategies. In particular, we discuss some interesting facts we observed while comparing HR-based to traditional routing in terms of complexity measures.
2016
9783319472164
Evaluation of advanced routing strategies with information-theoretic complexity measures / Amoretti, Michele; Cagnoni, Stefano. - ELETTRONICO. - 659:(2016), pp. 145-153. (Intervento presentato al convegno 31st International Symposium on Computer and Information Sciences, ISCIS 2016 tenutosi a pol nel 2016) [10.1007/978-3-319-47217-1_16].
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11381/2822835
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
social impact