2007 |
40 | EE | Gábor Rétvári,
József Bíró,
Tibor Cinkler:
Fairness in Capacitated Networks: A Polyhedral Approach.
INFOCOM 2007: 1604-1612 |
39 | EE | Szabolcs Mate Kis,
József Bíró,
Sandor Szekely:
Estimation of Multiplexing Gain on Small Business VoIP Networks.
ISCC 2007: 913-919 |
38 | | Mátyás Martinecz,
András Kern,
Zalán Heszberger,
József Bíró:
Architecture and Configuration of Broadband Access Networks Supporting Multimedia Applications.
I. J. Comput. Appl. 14(1): 2-12 (2007) |
37 | EE | Gábor Rétvári,
József Bíró,
Tibor Cinkler:
On shortest path representation.
IEEE/ACM Trans. Netw. 15(6): 1293-1306 (2007) |
36 | EE | Dung-Dinh Luong,
Attila Vidács,
József Bíró,
Trang Dinh Dang,
Daisuke Satoh,
Keisuke Ishibashi:
Unicast probing techniques for estimation of shared loss rate.
Int. J. Communication Systems 20(5): 613-632 (2007) |
2006 |
35 | EE | József Bíró:
Bandwidth Requirement Estimates Based on Asymptotic Loss Performance Analysis with QoS Constraint.
GLOBECOM 2006 |
34 | EE | Mohamed Yahia,
József Bíró:
Behavior of TCP algorithms on ad-hoc networks based on Different Routing Protocols(MANETs) and propagation models.
ICWMC 2006: 40 |
33 | EE | Tero Laine,
József Bíró,
Jussi Riihelä,
Jens Jensen,
Magnus Karlson,
Peter Kristiansson:
Searching for Synergy: Java and SAF AIS.
ISAS 2006: 229-252 |
32 | EE | Gábor Rétvári,
József Bíró,
Tibor Cinkler:
On Improving the Accuracy of OSPF Traffic Engineering.
Networking 2006: 51-62 |
31 | EE | András Gulyás,
József Bíró:
Workload Loss Examinations with a Novel Probabilistic Extension of Network Calculus.
Networking 2006: 533-544 |
30 | EE | József Bíró:
Loss ratio approximations in buffered systems with regulated inputs.
VALUETOOLS 2006: 68 |
2005 |
29 | EE | Gábor Rétvári,
József Bíró,
Tibor Cinkler,
Tamás Henk:
A precomputation scheme for minimum interference routing: the least-critical-path-first algorithm.
INFOCOM 2005: 260-268 |
28 | EE | József Bíró,
András Gulyás,
Zalán Heszberger:
A Novel Direct Upper Approximation for Workload Loss Ratio in General Buffered Systems.
NETWORKING 2005: 718-729 |
27 | EE | Felician Németh,
Peter Barta,
Róbert Szabó,
József Bíró:
Network internal traffic characterization and end-to-end delay bound calculus for generalized processor sharing scheduling discipline.
Computer Networks 48(6): 910-940 (2005) |
26 | EE | József Bíró,
András Gulyás,
Mátyás Martinecz:
Parsimonious estimates of bandwidth requirement for quality of service packet networks.
Perform. Eval. 59: 159-178 (2005) |
2004 |
25 | | István Moldován,
Trang Dinh Dang,
József Bíró,
Daisuke Satoh,
Keisuke Ishibashi:
Bottleneck links detection method based on passive monitoring.
Communications, Internet, and Information Technology 2004: 115-121 |
24 | EE | József Bíró,
András Gulyás,
T. Szenasi,
Zalán Heszberger:
Distribution-free conservative bounds for QoS measures.
ISCC 2004: 915-920 |
23 | EE | Gábor Rétvári,
József Bíró,
Tibor Cinkler:
A novel Lagrangian-relaxation to the minimum cost multicommodity flow problem and its application to OSPF traffic engineering.
ISCC 2004: 957-962 |
22 | EE | József Bíró,
Zalán Heszberger,
Mátyás Martinecz:
A Family of Performance Bounds for QoS Measures in Packet-Based Networks.
NETWORKING 2004: 1108-1119 |
21 | EE | Gábor Rétvári,
Róbert Szabó,
József Bíró:
On the Representability of Arbitrary Path Sets as Shortest Paths: Theory, Algorithms, and Complexity.
NETWORKING 2004: 1180-1191 |
2003 |
20 | EE | Felician Németh,
Peter Barta,
József Bíró:
Network Level Call Admission Control Algorithms for Generalized Processor Sharing Scheduling Discipline.
ISCC 2003: 1299-1305 |
19 | EE | Dinh-Dung Luong,
Attila Vidács,
József Bíró,
Daisuke Satoh,
Keisuke Ishibashi:
Unicast Probing to Estimate Shared Loss Rate.
MMNS 2003: 503-515 |
18 | EE | Peter Barta,
Felician Németh,
Róbert Szabó,
József Bíró:
Call admission control in generalized processor sharing schedulers with tight deterministic delay bounds.
Computer Communications 26(2): 65-78 (2003) |
17 | EE | Gergely Seres,
Árpád Szlávik,
János Zátonyi,
József Bíró:
Towards efficient decision rules for admission control based on the many sources asymptotics.
Perform. Eval. 53(3-4): 209-223 (2003) |
2002 |
16 | EE | Peter Barta,
Felician Németh,
Róbert Szabó,
József Bíró:
Call admission control algorithms for tandem generalized processor sharing networks.
ISCC 2002: 789-795 |
15 | EE | Dinh-Dung Luong,
József Bíró:
Analysis and application of congestion measures.
ISCC 2002: 843-848 |
14 | EE | Gergely Seres,
Árpád Szlávik,
János Zátonyi,
József Bíró:
Alternative admission rules based on the many sources asymptotics.
ISCC 2002: 995-1000 |
13 | EE | Gergely Seres,
Árpád Szlávik,
János Zátonyi,
József Bíró:
Towards Efficient Decision Rules for Admission Control Based on the Many Sources Asymptotics.
NETWORKING 2002: 166-177 |
12 | EE | Dinh-Dung Luong,
József Bíró:
Hop-by-hop versus end-to-end active measurements.
Computer Communications 25(10): 954-963 (2002) |
11 | EE | Zalán Heszberger,
József Bíró:
An optimization neural network model with time-dependent and lossy dynamics.
Neurocomputing 48(1-4): 53-62 (2002) |
10 | | Zalán Heszberger,
János Zátonyi,
József Bíró:
Performance bounds for rate envelope multiplexing.
Perform. Eval. 48(1/4): 87-101 (2002) |
9 | | Zalán Heszberger,
János Zátonyi,
József Bíró:
Efficient Chernoff-Based Resource Assessment Techniques in Multi-Service Networks.
Telecommunication Systems 20(1-2): 59-80 (2002) |
2001 |
8 | EE | Peter Barta,
Felician Németh,
Róbert Szabó,
József Bíró:
End-to-End Delay Bound Calculation in Generalized Processor Sharing Networks.
ISCC 2001: 282-287 |
2000 |
7 | EE | Zalán Heszberger,
József Bíró,
Edith Halász:
An optimization neural network model with time-dependent and lossy dynamics.
ESANN 2000: 287-292 |
6 | EE | Róbert Szabó,
Peter Barta,
Felician Németh,
József Bíró:
Call Admission Control in Generalized Processor Sharing (GPS) Schedulers Using Non-Rate Proportional Weighting of Sessions.
INFOCOM 2000: 1243-1252 |
5 | EE | Csaba Antal,
József Bíró,
Tamás Henk,
Gergely Mátéfi:
Performance Evaluation of a Time Division Multiplexing Method Applicable for Dynamic Transfer Mode Networks.
ISCC 2000: 34-39 |
4 | EE | Róbert Szabó,
Peter Barta,
Felician Németh,
József Bíró:
Worst-Case Deterministic Delay Bounds for Arbitrary Weighted Generalized Processor Sharing Schedulers.
NETWORKING 2000: 727-739 |
3 | | Octavian Pop,
István Moldován,
Csaba Simon,
József Bíró,
Arata Koike,
Hiroshi Ishii:
Advertised Window-Based TCP Flow Control in Routers.
SMARTNET 2000: 197-218 |
1997 |
2 | | András Faragó,
József Bíró,
Tamás Henk,
Miklós Boda:
Analog Neural Optimization for ATM Resource Management.
IEEE Journal on Selected Areas in Communications 15(2): 156-164 (1997) |
1996 |
1 | | József Bíró,
Edith Halász,
Tibor Trón,
Miklós Boda,
Gábor Privitzky:
Neural Networks for Exact Constrained Optimization.
ICANN 1996: 537-542 |