| 2012 | ||
|---|---|---|
| j14 | Sergio García-Gómez, Miguel Jiménez-Gañán, Yehia Taher, Christof Momm, Frederic Junker, József Bíró, Andreas Menychtas, Vasilios Andrikopoulos, Steve Strauch: Challenges for the comprehensive management of Cloud Services in a PaaS framework. Scalable Computing: Practice and Experience 13(3) (2012) | |
| c42 | János Tapolcai, András Gulyás, Zalán Heszberger, József Bíró, Péter Babarczi, Dirk Trossen: Stateless multi-stage dissemination of information: Source routing revisited. GLOBECOM 2012: 2797-2802 | |
| c41 | Sergio García-Gómez, Manuel Escriche-Vicente, Pablo Arozarena-Llopis, Francesco Lelli, Yehia Taher, Christof Momm, Axel Spriestersbach, Jürgen Vogel, Andrea Giessmann, Frederic Junker, Miguel Jiménez-Gañán, József Bíró, Goulven Le-Jeune, Michel Dao, Stephane P. Carrie, Jörg Niemöller, Dimitri Mazmanov: 4CaaSt: Comprehensive Management of Cloud Services through a PaaS. ISPA 2012: 494-499 | |
| c40 | András Gulyás, Attila Korösi, Gábor Rétvári, József Bíró, Dávid Szabó: Brief announcement: network formation games can give rise to realistic networks. PODC 2012: 329-330 | |
| 2011 | ||
| c39 | Gábor Rétvári, András Gulyás, Zalán Heszberger, Márton Csernai, József Bíró: Compact policy routing. PODC 2011: 149-158 | |
| 2009 | ||
| c38 | András Gulyás, József Bíró, Felician Németh: New stochastic network calculus for loss analysis. VALUETOOLS 2009: 38 | |
| 2007 | ||
| j13 | Dinh-Dung 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) | |
| j12 | 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) | |
| j11 | Gábor Rétvári, József Bíró, Tibor Cinkler: On shortest path representation. IEEE/ACM Trans. Netw. 15(6): 1293-1306 (2007) | |
| c37 | Gábor Rétvári, József Bíró, Tibor Cinkler: Routing-Independent Fairness in Capacitated Networks. ICC 2007: 6344-6349 | |
| c36 | Gábor Rétvári, József Bíró, Tibor Cinkler: Fairness in Capacitated Networks: A Polyhedral Approach. INFOCOM 2007: 1604-1612 | |
| c35 | Szabolcs Mate Kis, József Bíró, Sandor Szekely: Estimation of Multiplexing Gain on Small Business VoIP Networks. ISCC 2007: 913-919 | |
| 2006 | ||
| j10 | András Gulyás, József Bíró: A stochastic extension of network calculus for workload loss examinations. IEEE Communications Letters 10(5): 399-401 (2006) | |
| c34 | József Bíró: Bandwidth Requirement Estimates Based on Asymptotic Loss Performance Analysis with QoS Constraint. GLOBECOM 2006 | |
| c33 | András Gulyás, József Bíró, Zalán Heszberger: A Probabilistic Network Calculus for Characterizing Long-run Network Behavior. ICC 2006: 465-470 | |
| c32 | 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 | |
| c31 | 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 | |
| c30 | Gábor Rétvári, József Bíró, Tibor Cinkler: On Improving the Accuracy of OSPF Traffic Engineering. Networking 2006: 51-62 | |
| c29 | András Gulyás, József Bíró: Workload Loss Examinations with a Novel Probabilistic Extension of Network Calculus. Networking 2006: 533-544 | |
| c28 | József Bíró: Loss ratio approximations in buffered systems with regulated inputs. VALUETOOLS 2006: 68 | |
| 2005 | ||
| j9 | 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) | |
| j8 | 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) | |
| c27 | András Gulyás, József Bíró, Zalán Heszberger, Tamás Szénási: Dependency criteria on regulated inputs for buffer overflow approximation. ICC 2005: 83-87 | |
| c26 | 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 | |
| c25 | 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 | |
| 2004 | ||
| c24 | 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 | |
| c23 | Attila Takács, András Császár, József Bíró, Róbert Szabó, Tamás Henk: Path integrity aware traffic engineering [telecom traffic]. GLOBECOM 2004: 692-696 | |
| c22 | András Gulyás, Tamás Szénási, József Bíró: Buffer overflow estimation in network elements, multiplexing independent regulated inputs [packet switched networks]. GLOBECOM 2004: 1208-1212 | |
| c21 | József Bíró, Zalán Heszberger, Mátyás Martinecz, Felician Németh, Octavian Pop: Towards a framework of QoS measure estimates for packet-based networks. ICC 2004: 2231-2235 | |
| c20 | József Bíró, András Gulyás, Tamás Szénási, Zalán Heszberger: Distribution-free conservative bounds for QoS measures. ISCC 2004: 915-920 | |
| c19 | 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 | |
| c18 | 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 | |
| c17 | 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 | ||
| j7 | 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) | |
| j6 | 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) | |
| c16 | József Bíró, Zalán Heszberger, Mátyás Martinecz: Equivalent capacity estimators for bufferless fluid flow multiplexing. GLOBECOM 2003: 3706-3710 | |
| c15 | Árpád Szlávik, Gergely Seres, János Zátonyi, József Bíró: On the applicability of the on-off type approximation of the effective bandwidth function. ICC 2003: 183-187 | |
| c14 | 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 | |
| c13 | 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 | |
| 2002 | ||
| j5 | Dinh-Dung Luong, József Bíró: Hop-by-hop versus end-to-end active measurements. Computer Communications 25(10): 954-963 (2002) | |
| j4 | 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) | |
| j3 | 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) | |
| j2 | 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) | |
| c12 | 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 | |
| c11 | ||
| c10 | 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 | |
| c9 | 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 | |
| 2001 | ||
| c8 | Peter Barta, Felician Németh, Róbert Szabó, József Bíró: An approach for traffic characterization in generalized processor sharing networks. ICC 2001: 625-629 | |
| c7 | 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 | ||
| c6 | 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 | |
| c5 | 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 | |
| c4 | 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 | |
| c3 | 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 | |
| c2 | 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 | ||
| j1 | 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 | ||
| c1 | 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 | |
Colors in the list of coauthors
Last update Wed May 22 21:26:13 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page