A csomagtovábbítás skálázhatósága: korlátok és optimumok
type: Item
instance of: scholarly article
title: A csomagtovábbítás skálázhatósága: korlátok és optimumok
zbMATH Open document ID: 1449.68002
DOI: 10.37070/AML.2019.36.2.12
author: Attila Kőrösi
author: Gábor Rétvári
published in: Alkalmazott Matematikai Lapok
publication date: 2020-02-26T00:00:00Z
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68P30
zbMATH DE Number: 7174961
zbMATH Keywords: shortest path routing
zbMATH Keywords: routing table entropy
MaRDI profile type: MaRDI publication profile
Recommended article: Q4413099
Recommended article: Upper bound of network capacity and a static optimal packet routing strategy
Recommended article: An O (log N ) deterministic packet-routing scheme
Recommended article: Bounds on the Performance of Dynamic Routing Schemes for Highly Connected Networks
Recommended article: On the space requirement of interval routing
Recommended article: Q4252279
Recommended article: Optimal scale-free compact routing schemes in networks of low doubling dimension
Recommended article: On Scalability of Routing Tables in Dense Flat-Label Wireless Networks
Recommended article: On efficient distributed construction of near optimal routing schemes (extended abstract)
description: scientific article; zbMATH DE number 7174961