József Bíró

According to our database1, József Bíró authored at least 77 papers between 1996 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Optimizing Partner Selection for Cooperative Solar Generation Forecasting.
Proceedings of the 8th IEEE Forum on Research and Technologies for Society and Industry Innovation, 2024

2023
Orderliness of Navigation Patterns in Hyperbolic Complex Networks.
Proceedings of the Complex Networks & Their Applications XII, 2023

2022
Intent-based 5G UPF configuration via Kubernetes Operators in the Edge.
Proceedings of the Thirteenth International Conference on Ubiquitous and Future Networks, 2022

Connected Hyperbolic Complex Networks.
Proceedings of the International Conference on Computational Science and Computational Intelligence, 2022

Stochastic analysis of the success rate in atomic swaps between blockchains.
Proceedings of the Fourth International Conference on Blockchain Computing and Applications, 2022

2021
Probabilistic Shared Risk Link Groups Modeling Correlated Resource Failures Caused by Disasters.
IEEE J. Sel. Areas Commun., 2021

Analysis of Routing Entropy in Hyperbolic Trees.
Proceedings of the International Conference on Computational Science and Computational Intelligence, 2021

2020
On the Memory Requirement of Hop-by-Hop Routing: Tight Bounds and Optimal Address Spaces.
IEEE/ACM Trans. Netw., 2020

2018
A Tractable Stochastic Model of Correlated Link Failures Caused by Disasters.
Proceedings of the 2018 IEEE Conference on Computer Communications, 2018

2017
Routes Obey Hierarchy in Complex Networks.
CoRR, 2017

Geometric explanation of the rich-club phenomenon in complex networks.
CoRR, 2017

2016
5G exchange for inter-domain resource sharing.
Proceedings of the IEEE International Symposium on Local and Metropolitan Area Networks, 2016

2015
Optimal False-Positive-Free Bloom Filter Design for Scalable Multicast Forwarding.
IEEE/ACM Trans. Netw., 2015

Deductive Way of Reasoning about the Internet AS Level Topology.
CoRR, 2015

2014
Complex Networks as Nash Equilibria of Navigation Games.
CoRR, 2014

2013
Compact policy routing.
Distributed Comput., 2013

Reduced information scenario for Shared Segment Protection.
Proceedings of the IEEE 4th International Conference on Cognitive Infocommunications, 2013

Discriminatory Processor Sharing from Optimization Point of View.
Proceedings of the Analytical and Stochastic Modelling Techniques and Applications, 2013

2012
Challenges for the comprehensive management of Cloud Services in a PaaS framework.
Scalable Comput. Pract. Exp., 2012

Brief announcement: network formation games can give rise to realistic networks.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

4CaaSt: Comprehensive Management of Cloud Services through a PaaS.
Proceedings of the 10th IEEE International Symposium on Parallel and Distributed Processing with Applications, 2012

Stateless multi-stage dissemination of information: Source routing revisited.
Proceedings of the 2012 IEEE Global Communications Conference, 2012

2010
Novel bandwidth requirement estimation based on exact large deviation asymptotics.
Comput. Commun., 2010

2009
New stochastic network calculus for loss analysis.
Proceedings of the 4th International Conference on Performance Evaluation Methodologies and Tools, 2009

2007
On shortest path representation.
IEEE/ACM Trans. Netw., 2007

Architecture and Configuration of Broadband Access Networks Supporting Multimedia Applications.
Int. J. Comput. Their Appl., 2007

Unicast probing techniques for estimation of shared loss rate.
Int. J. Commun. Syst., 2007

Estimation of Multiplexing Gain on Small Business VoIP Networks.
Proceedings of the 12th IEEE Symposium on Computers and Communications (ISCC 2007), 2007

Fairness in Capacitated Networks: A Polyhedral Approach.
Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

Routing-Independent Fairness in Capacitated Networks.
Proceedings of IEEE International Conference on Communications, 2007

2006
A stochastic extension of network calculus for workload loss examinations.
IEEE Commun. Lett., 2006

Loss ratio approximations in buffered systems with regulated inputs.
Proceedings of the 1st International Conference on Performance Evaluation Methodolgies and Tools, 2006

On Improving the Accuracy of OSPF Traffic Engineering.
Proceedings of the NETWORKING 2006, 2006

Workload Loss Examinations with a Novel Probabilistic Extension of Network Calculus.
Proceedings of the NETWORKING 2006, 2006

Searching for Synergy: Java and SAF AIS.
Proceedings of the Service Availability, 2006

Behavior of TCP algorithms on ad-hoc networks based on Different Routing Protocols(MANETs) and propagation models.
Proceedings of the Second International Conference on Wireless and Mobile Communications (ICWMC'06), 2006

A Probabilistic Network Calculus for Characterizing Long-run Network Behavior.
Proceedings of IEEE International Conference on Communications, 2006

Bandwidth Requirement Estimates Based on Asymptotic Loss Performance Analysis with QoS Constraint.
Proceedings of the Global Telecommunications Conference, 2006. GLOBECOM '06, San Francisco, CA, USA, 27 November, 2006

2005
Parsimonious estimates of bandwidth requirement for quality of service packet networks.
Perform. Evaluation, 2005

Network internal traffic characterization and end-to-end delay bound calculus for generalized processor sharing scheduling discipline.
Comput. Networks, 2005

A Novel Direct Upper Approximation for Workload Loss Ratio in General Buffered Systems.
Proceedings of the NETWORKING 2005: Networking Technologies, 2005

A precomputation scheme for minimum interference routing: the least-critical-path-first algorithm.
Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005

Dependency criteria on regulated inputs for buffer overflow approximation.
Proceedings of IEEE International Conference on Communications, 2005

2004
On the Representability of Arbitrary Path Sets as Shortest Paths: Theory, Algorithms, and Complexity.
Proceedings of the NETWORKING 2004, 2004

A Family of Performance Bounds for QoS Measures in Packet-Based Networks.
Proceedings of the NETWORKING 2004, 2004

A novel Lagrangian-relaxation to the minimum cost multicommodity flow problem and its application to OSPF traffic engineering.
Proceedings of the 9th IEEE Symposium on Computers and Communications (ISCC 2006), June 28, 2004

Distribution-free conservative bounds for QoS measures.
Proceedings of the 9th IEEE Symposium on Computers and Communications (ISCC 2006), June 28, 2004

Towards a framework of QoS measure estimates for packet-based networks.
Proceedings of IEEE International Conference on Communications, 2004

Path integrity aware traffic engineering [telecom traffic].
Proceedings of the Global Telecommunications Conference, 2004. GLOBECOM '04, Dallas, Texas, USA, 29 November, 2004

Buffer overflow estimation in network elements, multiplexing independent regulated inputs [packet switched networks].
Proceedings of the Global Telecommunications Conference, 2004. GLOBECOM '04, Dallas, Texas, USA, 29 November, 2004

Bottleneck links detection method based on passive monitoring.
Proceedings of the IASTED International Conference on Communications, Internet, and Information Technology, November 22, 2004

2003
Towards efficient decision rules for admission control based on the many sources asymptotics.
Perform. Evaluation, 2003

Call admission control in generalized processor sharing schedulers with tight deterministic delay bounds.
Comput. Commun., 2003

Unicast Probing to Estimate Shared Loss Rate.
Proceedings of the Management of Multimedia Networks and Services, 2003

Network Level Call Admission Control Algorithms for Generalized Processor Sharing Scheduling Discipline.
Proceedings of the Eighth IEEE Symposium on Computers and Communications (ISCC 2003), 30 June, 2003

On the applicability of the on-off type approximation of the effective bandwidth function.
Proceedings of IEEE International Conference on Communications, 2003

Equivalent capacity estimators for bufferless fluid flow multiplexing.
Proceedings of the Global Telecommunications Conference, 2003

2002
Efficient Chernoff-Based Resource Assessment Techniques in Multi-Service Networks.
Telecommun. Syst., 2002

Performance bounds for rate envelope multiplexing.
Perform. Evaluation, 2002

An optimization neural network model with time-dependent and lossy dynamics.
Neurocomputing, 2002

Hop-by-hop versus end-to-end active measurements.
Comput. Commun., 2002

Alternative admission rules based on the many sources asymptotics.
Proceedings of the Seventh IEEE Symposium on Computers and Communications (ISCC 2002), 2002

Analysis and application of congestion measures.
Proceedings of the Seventh IEEE Symposium on Computers and Communications (ISCC 2002), 2002

Call admission control algorithms for tandem generalized processor sharing networks.
Proceedings of the Seventh IEEE Symposium on Computers and Communications (ISCC 2002), 2002

2001
End-to-End Delay Bound Calculation in Generalized Processor Sharing Networks.
Proceedings of the Sixth IEEE Symposium on Computers and Communications (ISCC 2001), 2001

An approach for traffic characterization in generalized processor sharing networks.
Proceedings of the IEEE International Conference on Communications, 2001

On the proportional fairness of TCP Vegas.
Proceedings of the Global Telecommunications Conference, 2001

2000
Advertised Window-Based TCP Flow Control in Routers.
Proceedings of the Telecommunication Network Intelligence, 2000

Worst-Case Deterministic Delay Bounds for Arbitrary Weighted Generalized Processor Sharing Schedulers.
Proceedings of the NETWORKING 2000, 2000

Performance Evaluation of a Time Division Multiplexing Method Applicable for Dynamic Transfer Mode Networks.
Proceedings of the Fifth IEEE Symposium on Computers and Communications (ISCC 2000), 2000

Call Admission Control in Generalized Processor Sharing (GPS) Schedulers Using Non-Rate Proportional Weighting of Sessions.
Proceedings of the Proceedings IEEE INFOCOM 2000, 2000

Efficient bounds for bufferless statistical multiplexing.
Proceedings of the Global Telecommunications Conference, 2000. GLOBECOM 2000, San Francisco, CA, USA, 27 November, 2000

An optimization neural network model with time-dependent and lossy dynamics.
Proceedings of the 8th European Symposium on Artificial Neural Networks, 2000

1999
Comparison of simple tail distribution estimators.
Proceedings of the 1999 IEEE International Conference on Communications: Global Convergence Through Communications, 1999

1997
Analog Neural Optimization for ATM Resource Management.
IEEE J. Sel. Areas Commun., 1997

1996
A noise annealing neural network for global optimization.
Proceedings of International Conference on Neural Networks (ICNN'96), 1996

Neural Networks for Exact Constrained Optimization.
Proceedings of the Artificial Neural Networks, 1996


  Loading...