Literature Database Entry

hauser2025fairer

Eric Hauser, Kilian Warmuth, Johannes Späth and Georg Carle, "Poster: The FAIRer Path Forward: Advancing Research Infrastructures for Unified Reproducibility and Usability," Proceedings of 21st International Conference on Emerging Networking Experiments and Technologies (CoNEXT 2025), Poster Session, Hong Kong, China, December 2025, pp. 12–14.

Abstract

Artifact evaluation places a significant burden on both authors and reviewers: Authors must package bespoke experimental setups, while committees struggle to validate them. Research Infrastructures (RIs) offer tools to support reproducibility, yet interoperability remains limited due to insufficient standardization efforts.To address this, we propose new standards that unify RIs through a formal experiment execution format and topology management for networked experiments. In addition, we advance sustainability through integrated energy analysis and modeling. Together, these contributions improve reproducibility, enable cross-RI collaboration, and foster more sustainable experiments. This makes RIs more FAIR–-particularly by strengthening interoperability and reusability–-while aiding broader adoption across the (network) research community.

Quick access

Original Version DOI (at publishers web site)
BibTeX BibTeX

Contact

Eric Hauser
Kilian Warmuth
Johannes Späth
Georg Carle

BibTeX reference

@inproceedings{hauser2025fairer,
    author = {Hauser, Eric and Warmuth, Kilian and Sp{\"{a}}th, Johannes and Carle, Georg},
    doi = {10.1145/3765515.3771744},
    title = {{Poster: The FAIRer Path Forward: Advancing Research Infrastructures for Unified Reproducibility and Usability}},
    pages = {12--14},
    publisher = {ACM},
    address = {Hong Kong, China},
    booktitle = {21st International Conference on Emerging Networking Experiments and Technologies (CoNEXT 2025), Poster Session},
    month = {12},
    year = {2025},
   }
   
   

Copyright notice

Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.

The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

The following applies to all papers listed above that are in submission to IEEE conference/workshop proceedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.

The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or permissions@acm.org.

The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at www.springerlink.com.

This page was automatically generated using BibDB and bib2web.

Last modified: 2026-04-30