J
József Bíró
Researcher at Budapest University of Technology and Economics
Publications - 102
Citations - 670
József Bíró is an academic researcher from Budapest University of Technology and Economics. The author has contributed to research in topics: Quality of service & Generalized processor sharing. The author has an hindex of 12, co-authored 101 publications receiving 617 citations. Previous affiliations of József Bíró include Nokia.
Papers
More filters
Journal ArticleDOI
Navigable networks as Nash equilibria of navigation games
TL;DR: It is shown that minimalistic networks designed to maximize the navigation efficiency at minimal cost share basic structural properties with real networks and these skeletons are present in the Internet, metabolic, English word, US airport, Hungarian road networks, and in a structural network of the human brain.
Proceedings ArticleDOI
A Tractable Stochastic Model of Correlated Link Failures Caused by Disasters
Janos Tapolcai,Balazs Vass,Zalán Heszberger,József Bíró,David Hay,Fernando A. Kuipers,Lajos Rónyai +6 more
TL;DR: A stochastic model of geographically correlated link failures caused by disasters is built, in order to estimate the hazards a network may be prone to, and to understand the complex correlation between possible link failures.
Journal ArticleDOI
On shortest path representation
TL;DR: To the best of the knowledge, this is the first time that an algorithm is proposed, which is not only able to find a minimal representation in polynomial time, but also assures link weight integrality.
Journal ArticleDOI
Optimal false-positive-free Bloom filter design for scalable multicast forwarding
TL;DR: In this paper, the authors revisited the idea of in-packet Bloom filters and source routing and built a Bloom filter by enclosing limited information about the structure of the tree.
Proceedings ArticleDOI
Stateless multi-stage dissemination of information: Source routing revisited
TL;DR: This paper revisits the idea of in-packet Bloom filters and source routing by enclosing limited information about the structure of the tree, namely its stage decomposition, which helps to get rid of typical Bloom filter illnesses as infinite loops and false positive forwarding.