Publications—Péter Urbán

To appear

No publications.

Conference papers

• Matthias Wiesmann, Péter Urbán and Xavier Défago.
  An SNMP based failure detection service.
  In Proc. 25th Intl. Symp. on Reliable Distributed Systems (SRDS 2006), pages 365–374, Leeds, UK, October 2006. IEEE.
  [BibTeX] [Abstract] [PDF] [PDF slides] [Quicktime]
• Xavier Défago, Péter Urbán, Naohiro Hayashibara and Takuya Katayama.
  Definition and specification of accrual failure detectors.
  In Proc. Int'l Conf. on Dependable Systems and Networks (DSN), pages 206–215, Yokohama, Japan, June 2005.
  [BibTeX] [Abstract] [PDF] [DOI]
• Xavier Défago, Naohiro Hayashibara, Péter Urbán, Rami Yared and Takuya Katayama.
  Definitions and properties of accrual failure detectors.
  In Journées Scientifiques Francophones (JSF), Tōkyō, Japan, November 2004.
  [BibTeX] [PDF]
• Péter Urbán, Xavier Défago and Takuya Katayama.
  Composition of distributed protocols in the NekoLS framework.
  In Journées Scientifiques Francophones (JSF), Tōkyō, Japan, November 2004.
  [BibTeX] [Abstract] [PDF] [Conference site]
• Richard Ekwall, André Schiper and Péter Urbán.
  Token-based atomic broadcast using unreliable failure detectors.
  In Proc. 23nd IEEE Int'l Symp. on Reliable Distributed Systems (SRDS), pages 52–65, Florianópolis, Brazil, October 2004.
  [BibTeX] [Abstract] [PDF]
• Péter Urbán, Naohiro Hayashibara, André Schiper and Takuya Katayama.
  Performance comparison of a rotating coordinator and a leader based consensus algorithm.
  In Proc. 23nd IEEE Int'l Symp. on Reliable Distributed Systems (SRDS), pages 4–17, Florianópolis, Brazil, October 2004.
  [BibTeX] [Abstract] [PDF]
• Péter Urbán and André Schiper.
  Comparing distributed consensus algorithms.
  In Proc. IASTED Int'l Conf. on Applied Simulation and Modelling (ASM), pages 474–480, Rhodos, Greece, June 2004.
  [BibTeX] [Abstract] [PDF]
• Péter Urbán, Xavier Défago and Takuya Katayama.
  NekoLS: Prototyping and simulating large scale distributed systems.
  In Journées Scientifiques Francophones (JSF), Tōkyō, Japan, November 2003.
  [BibTeX] [Abstract] [PDF]
• Péter Urbán, Ilya Shnayderman and André Schiper.
  Comparison of failure detectors and group membership: Performance study of two atomic broadcast algorithms.
  In Proc. Int'l Conf. on Dependable Systems and Networks (DSN), pages 645–654, San Francisco, CA, USA, June 2003.
  [BibTeX] [Abstract] [PDF]
• Richard Ekwall, Péter Urbán and André Schiper.
  Robust TCP connections for fault tolerant computing.
  In Proc. 9th Int'l Conf. on Parallel and Distributed Systems (ICPADS), pages 501–508, Chung-li, Taiwan, December 2002.
  [BibTeX] [Abstract] [PDF]
• Naohiro Hayashibara, Péter Urbán, André Schiper and Takuya Katayama.
  Performance comparison between the Paxos and Chandra-Toueg consensus algorithms.
  In Proc. Int'l Arab Conf. on Information Technology (ACIT), pages 526–533, Doha, Qatar, December 2002.
  [BibTeX] [Abstract] [PDF]
• Fernando Pedone, André Schiper, Péter Urbán and David Cavin.
  Solving agreement problems with weak ordering oracles.
  In Proc. 4th European Dependable Computing Conf. (EDCC), volume 2485 of LNCS, pages 44–61, Toulouse, France, October 2002. Springer-Verlag.
  [BibTeX] [Abstract] [PDF]
• Andrea Coccoli, Péter Urbán, Andrea Bondavalli and André Schiper.
  Performance analysis of a consensus algorithm combining Stochastic Activity Networks and measurements.
  In Proc. Int'l Conf. on Dependable Systems and Networks (DSN), pages 551–560, Washington, DC, USA, June 2002.
  [BibTeX] [Abstract] [PDF]
• Fernando Pedone, André Schiper, Péter Urbán and David Cavin.
  Weak ordering oracles for failure detection-free systems.
  In Proc. Int'l Conf. on Dependable Systems and Networks (DSN), supplemental volume, pages B–32–33, June 2002.
  Fast abstract.
  [BibTeX] [PDF]
• Paweł Wojciechowski and Péter Urbán.
  Modular communication infrastructure design with quality of service.
  In 6th CaberNet Radicals Workshop (IST-2000-25088), Madeira Island, February 2002.
  [BibTeX] [PDF]
• Péter Urbán, Xavier Défago and André Schiper.
  Chasing the FLP impossibility result in a LAN or how robust can a fault tolerant server be?.
  In Proc. 20th IEEE Symp. on Reliable Distributed Systems (SRDS), pages 190–193, New Orleans, LA, USA, October 2001.
  [BibTeX] [Abstract] [PDF]
• Péter Urbán, Xavier Défago and André Schiper.
  Neko: A single environment to simulate and prototype distributed algorithms.
  In Proc. 15th Int'l Conf. on Information Networking (ICOIN), pages 503–511, Beppu City, Japan, February 2001.
  Best Student Paper award.
  [BibTeX] [Abstract] [PDF] [DOI]
• Péter Urbán, Xavier Défago and André Schiper.
  Contention-aware metrics for distributed algorithms: Comparison of atomic broadcast algorithms.
  In Proc. 9th IEEE Int'l Conf. on Computer Communications and Networks (IC3N), pages 582–589, October 2000.
  [BibTeX] [Abstract] [PDF]
• Gergely Faragó, Sándor Gajdos, Attila Máté, Péter Moskovits, István Németh, Péter Urbán and Kornél Wagner.
  Supporting an object oriented CASE tool with relational, object relational and object oriented database management systems – a case study.
  In 3rd Conf. Hungarian Relational Database Management System Users, Budapest, Hungary, 1997.
  [BibTeX]
• Jörn Altmann, András Pataricza, Tamás Bartha and Péter Urbán.
  Constraint based system-level diagnosis of multiprocessors.
  In 2nd IEEE European Dependable Computing Conference (EDCC), pages 403–414, Taormina, Italy, October 1996.
  [BibTeX] [Abstract] [PDF]

Journal papers

• Xavier Défago, André Schiper and Péter Urbán.
  Total order broadcast and multicast algorithms: Taxonomy and survey.
  ACM Computing Surveys, 36(4):372–421, December 2004.
  [BibTeX] [Abstract] [PDF] [DOI]
• Xavier Défago, André Schiper and Péter Urbán.
  Comparative performance analysis of ordering strategies in atomic broadcast algorithms.
  IEICE Trans. on Information and Systems, E86-D(12):2698–2709, December 2003.
  [BibTeX] [Abstract] [PDF]
• Richard Ekwall, Péter Urbán and André Schiper.
  Robust TCP connections for fault tolerant computing.
  Journal of Information Science and Engineering, 19(3):503–516, May 2003.
  [BibTeX] [Abstract] [PDF]
• S. Agostinelli et al.
  Geant4—a simulation toolkit.
  Nuclear Instruments and Methods in Physics Research, A(506):250–303, 2003.
  [BibTeX] [Abstract] [PDF]
• Péter Urbán, Xavier Défago and André Schiper.
  Neko: A single environment to simulate and prototype distributed algorithms.
  Journal of Information Science and Engineering, 18(6):981–997, November 2002.
  [BibTeX] [Abstract] [PDF]
• András Petri, Péter Urbán, Jörn Altmann, Mario Dal Cin, Endre Selényi, Károly Tilly and András Pataricza.
  Constraint based diagnosis algorithms for multiprocessors.
  Periodica Polytechnica, 40(1):39–52, 1996.
  Technical University of Budapest, Hungary.
  [BibTeX] [Abstract] [PDF]

Technical reports

• Péter Urbán, Sergio Mena, Xavier Défago and Takuya Katayama.
  Concurrency in microprotocol frameworks.
  Research Report IS-RR-2006-004, Japan Advanced Institute of Science and Technology, Ishikawa, Japan, February 2006.
  [BibTeX] [Abstract] [PDF]
• Matthias Wiesmann, Péter Urbán and Xavier Défago.
  An SNMP based failure detection service.
  Technical Report IS-RR-2006-001, Japan Advanced Institute of Science and Technology, Ishikawa, Japan, February 2006.
  [BibTeX] [Abstract] [PDF]
• Xavier Défago, Péter Urbán, Naohiro Hayashibara and Takuya Katayama.
  Definition and specification of accrual failure detectors.
  Research Report IS-RR-2005-004, Japan Advanced Institute of Science and Technology, Ishikawa, Japan, March 2005.
  [BibTeX] [Abstract] [PDF]
• Péter Urbán, Naohiro Hayashibara, André Schiper and Takuya Katayama.
  Performance comparison of a rotating coordinator and a leader based consensus algorithm (extended version).
  Research Report IS-RR-2004-016, Japan Advanced Institute of Science and Technology, Ishikawa, Japan, August 2004.
  [BibTeX] [Abstract] [PDF]
• Xavier Défago, Péter Urbán, Naohiro Hayashibara and Takuya Katayama.
  On accrual failure detectors.
  Research Report IS-RR-2004-011, Japan Advanced Institute of Science and Technology, Ishikawa, Japan, May 2004.
  [BibTeX] [Abstract] [PDF]
• Richard Ekwall, André Schiper and Péter Urbán.
  Token-based atomic broadcast using unreliable failure detectors.
  Technical Report IC/2004/40, École Polytechnique Fédérale de Lausanne, Switzerland, May 2004.
  [BibTeX] [Abstract] [PDF]
• Péter Urbán, Naohiro Hayashibara, André Schiper and Takuya Katayama.
  Performance comparison of a rotating coordinator and a leader based consensus algorithm.
  Research Report IS-RR-2004-008, Japan Advanced Institute of Science and Technology, Ishikawa, Japan, March 2004.
  [BibTeX] [Abstract] [PDF]
• Péter Urbán and André Schiper.
  Comparing the performance of two consensus algorithms with centralized and decentralized communication schemes.
  Research Report IS-RR-2004-009, Japan Advanced Institute of Science and Technology, Ishikawa, Japan, March 2004.
  [BibTeX] [Abstract] [PDF]
• Xavier Défago, André Schiper and Péter Urbán.
  Total order broadcast and multicast algorithms: Taxonomy and survey.
  Research Report IS-RR-2003-009, Japan Advanced Institute of Science and Technology, Ishikawa, Japan, September 2003.
  [BibTeX] [Abstract] [PDF]
• Péter Urbán, Ilya Shnayderman and André Schiper.
  Comparison of failure detectors and group membership: Performance study of two atomic broadcast algorithms (extended version).
  Technical Report IC/2003/15, École Polytechnique Fédérale de Lausanne, Switzerland, April 2003.
  [BibTeX] [Abstract] [PDF]
• Péter Urbán, Ilya Shnayderman and André Schiper.
  Comparison of failure detectors and group membership: Performance study of two atomic broadcast algorithms.
  Technical Report IC/2003/05, École Polytechnique Fédérale de Lausanne, Switzerland, February 2003.
  [BibTeX] [Abstract] [PDF]
• Naohiro Hayashibara, Péter Urbán, André Schiper and Takuya Katayama.
  Performance comparison between the Paxos and Chandra-Toueg consensus algorithms.
  Technical Report IC/2002/61, École Polytechnique Fédérale de Lausanne, Switzerland, August 2002.
  [BibTeX] [Abstract] [PDF]
• Fernando Pedone, André Schiper, Péter Urbán and David Cavin.
  Solving agreement problems with weak ordering oracles.
  Technical Report IC/2002/010, École Polytechnique Fédérale de Lausanne, Switzerland, March 2002.
  [BibTeX] [Abstract] [PDF]
• Péter Urbán, Xavier Défago and André Schiper.
  Chasing the FLP impossibility result in a LAN or how robust can a fault tolerant server be?.
  Technical Report DSC-2001-037, École Polytechnique Fédérale de Lausanne, Switzerland, August 2001.
  [BibTeX] [Abstract] [PDF]
• Xavier Défago, André Schiper and Péter Urbán.
  Totally ordered broadcast and multicast algorithms: A comprehensive survey.
  Technical Report DSC-2000-036, École Polytechnique Fédérale de Lausanne, Switzerland, September 2000.
  [BibTeX] [Abstract] [PDF]
• Péter Urbán, Xavier Défago and André Schiper.
  Contention-aware metrics: Analysis of distributed algorithms.
  Technical Report DSC-2000-012, École Polytechnique Fédérale de Lausanne, Switzerland, February 2000.
  [BibTeX] [Abstract] [PDF]

PhD dissertation

• Péter Urbán.
  Evaluating the Performance of Distributed Agreement Algorithms: Tools, Methodology and Case Studies.
  PhD thesis, École Polytechnique Fédérale de Lausanne, Switzerland, August 2003.
  Number 2824.
  [BibTeX] [Abstract] [PDF]

Others

• Péter Urbán.
  Optimising and extending the geometrical modeller of a physics simulation framework.
  Master's thesis, CERN European Particle Physics Laboratory, Technical University of Budapest, May 1998.
  [BibTeX] [Abstract] [PostScript]