Notes on the Topological Consequences of BGP Policy Routing on the Internet AS Topology

Szabó, Dávid; Gulyás, András

doi:10.1007/978-3-642-40552-5_25

Cited by 1 publication

(1 citation statement)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Third, navigability does not always have to be maximised as many specific networks perform many specific functions other than navigation. Our game-theoretic approach can be extended to accommodate some of these functions, such as error tolerance or policy compliance [51], but not all possible functions of different real networks can be formalised within this game-theoretic framework. Some networks are centrally designed to optimise a particular function globally [38].…”

Section: Discussionmentioning

confidence: 99%

Navigable networks as Nash equilibria of navigation games

Gulyás¹,

Bı́ró²,

Kő̈rösi

et al. 2015

Nat Commun

Self Cite

View full text Add to dashboard Cite

Common sense suggests that networks are not random mazes of purposeless connections, but that these connections are organized so that networks can perform their functions well. One function common to many networks is targeted transport or navigation. Here, using game theory, we show that minimalistic networks designed to maximize the navigation efficiency at minimal cost share basic structural properties with real networks. These idealistic networks are Nash equilibria of a network construction game whose purpose is to find an optimal trade-off between the network cost and navigability. We show that these skeletons are present in the Internet, metabolic, English word, US airport, Hungarian road networks, and in a structural network of the human brain. The knowledge of these skeletons allows one to identify the minimal number of edges, by altering which one can efficiently improve or paralyse navigation in the network.

show abstract

Section: Discussionmentioning

confidence: 99%