default search action
Lluís Fàbrega
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c18]Mohammad S. Obaidat, Jose L. Marzo, Pere Vilà, Kuei-Fang Hsiao, Petros Nicopolitidis, Yu Guo, Lluís Fàbrega, Zhaolong Ning, Antonio Bueno:
CITS 2024 General Chairs' Message. CITS 2024: I-III - 2023
- [j12]Miquel Farreras
, Paola Soto, Miguel Camelo, Lluís Fàbrega
Improving Network Delay Predictions Using GNNs. J. Netw. Syst. Manag. 31(3): 65 (2023) - 2022
- [c17]Miquel Farreras
Predicting network performance using GNNs: generalization to larger unseen networks. NOMS 2022: 1-6
2010 – 2019
- 2019
- [j11]Daniela Aguirre-Guerrero
Low time complexity algorithms for path computation in Cayley Graphs. Discret. Appl. Math. 259: 218-225 (2019) - 2018
- [j10]Daniela Aguirre-Guerrero
WMGR: A Generic and Compact Routing Scheme for Data Center Networks. IEEE/ACM Trans. Netw. 26(1): 356-369 (2018) - [c16]Daniela Aguirre-Guerrero
Evaluation of Cayley Graphs for Parallel Computer Systems. CITS 2018: 1-5 - 2017
- [j9]Sahel Sahhaf, Wouter Tavernier, Dimitri Papadimitriou, Davide Careglio
Routing at Large Scale: Advances and Challenges for Complex Networks. IEEE Netw. 31(4): 108-118 (2017) - 2014
- [j8]Miguel Camelo, Dimitri Papadimitriou, Lluís Fàbrega
Geometric Routing With Word-Metric Spaces. IEEE Commun. Lett. 18(12): 2125-2128 (2014) - [c15]Miguel Camelo, Dimitri Papadimitriou, Lluís Fàbrega
Efficient Routing in Data Center with Underlying Cayley Graph. CompleNet 2014: 189-197 - [c14]Miguel Camelo, Pere Vilà
Cayley-Graph-Based Data Centers and Space Requirements of a Routing Scheme Using Automata. ICDCS Workshops 2014: 63-69 - 2013
- [j7]Lluís Fàbrega
A review of the architecture of admission control schemes in the Internet. Netw. Protoc. Algorithms 5(3): 1-32 (2013) - [j6]Lluís Fàbrega
Network schemes for TCP elastic traffic in the Internet. Netw. Protoc. Algorithms 5(3): 33-67 (2013) - [e1]Lluís Fàbrega, Pere Vilà, Davide Careglio, Dimitri Papadimitriou:
Measurement Methodology and Tools - First European Workshop, FP7 FIRE/EULER Project, Aalborg, Denmark, May 9, 2012, Revised and Extended Papers. Lecture Notes in Computer Science 7586, Springer 2013, ISBN 978-3-642-41295-0 [contents] - 2012
- [j5]Dimitri Papadimitriou, Lluís Fàbrega
Measurement-based research: methodology, experiments, and tools. Comput. Commun. Rev. 42(5): 62-68 (2012) - [c13]Lluís Fàbrega
Introduction. FP7 FIRE/EULER 2012: 1-4 - [c12]Dimitri Papadimitriou, Lluís Fàbrega
Measurement-Based Experimental Research Methodology. FP7 FIRE/EULER 2012: 5-22 - [c11]Dimitri Papadimitriou, Florin Coras, Alberto Rodriguez, Valentin Carela, Davide Careglio
Iterative Research Method Applied to the Design and Evaluation of a Dynamic Multicast Routing Scheme. FP7 FIRE/EULER 2012: 107-126 - [c10]Lluís Fàbrega
Summary and Conclusions. FP7 FIRE/EULER 2012: 195-203 - 2011
- [j4]Lluís Fàbrega
A network scheme for TCP elastic traffic with admission control using edge-to-edge per-aggregate measurements in class-based networks. J. High Speed Networks 18(1): 15-32 (2011)
2000 – 2009
- 2008
- [b1]Lluís Fàbrega:
Admission control schemes for TCP elastic traffic in class-based networks. University of Girona, Spain, 2008 - 2007
- [j3]Lluís Fàbrega
A guaranteed minimum throughput service for TCP flows using measurement-based admission control. Int. J. Commun. Syst. 20(1): 43-63 (2007) - 2006
- [j2]Lluís Fàbrega
Throughput Guarantees for TCP Flows in a Network Based on Packet Classes Using Edge-to-Edge Per Flow Measurements. Simul. 82(6): 383-397 (2006) - [c9]Lluís Fàbrega
Admission Control for TCP Flows Using Packet Classes and Edge-to-edge Measurements of Aggregates. ICC 2006: 760-765 - 2005
- [c8]Lluís Fàbrega
A Packet Class-Based Scheme for Providing Throughput Guarantees to TCP Flows. IPOM 2005: 76-87 - 2004
- [c7]Liliana Carrillo, José-Luis Marzo, Lluís Fàbrega
Ant Colony Behaviour as Routing Mechanism to Provide Quality of Service. ANTS Workshop 2004: 418-419 - [c6]Josep L. Marzo, Pere Vilà, Antonio Bueno, Lluís Fàbrega, Eusebi Calle:
Automatic self-configuration of the logical network using distributed software agents. GLOBECOM 2004: 2103-2107 - [c5]Eusebi Calle
Enhancing fault management performance of two-step QoS routing algorithms in GMPLS networks. ICC 2004: 1932-1936 - 2003
- [j1]José-Luis Marzo
A distributed simulator for network resource management investigation. Comput. Commun. 26(15): 1782-1791 (2003) - [c4]Yezid Donoso Meisel, Ramón Fabregat, Lluís Fàbrega
Multi-objective scheme over multi-tree routing in multicast MPLS networks. LANC 2003: 59-71 - [c3]Lluís Fàbrega
Throughput guarantees for elastic flows using end-to-end admission control. LANC 2003: 153-162 - 2002
- [c2]Lluís Fàbrega, Jordi Massaguer, Teodor Jové, David Mérida:
A virtual network laboratory for learning IP networking. ITiCSE 2002: 161-164 - 2001
- [c1]José-Luis Marzo, Pere Vilà, Lluís Fàbrega
An ATM Distributed Simulator for Network Management Researc. Annual Simulation Symposium 2001: 185-192
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-07 21:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: