Florin Ciucu

Orcid: 0009-0000-7715-6917

According to our database1, Florin Ciucu authored at least 69 papers between 2000 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
POMACS V8, N2, June 2024 Editorial.
Proc. ACM Meas. Anal. Comput. Syst., 2024

POMACS V8, N1, March 2024 Editorial.
Proc. ACM Meas. Anal. Comput. Syst., 2024

2023
POMACS V7, N3, December 2023 Editorial.
Proc. ACM Meas. Anal. Comput. Syst., December, 2023

On Ultra-Sharp Queueing Bounds.
SIGMETRICS Perform. Evaluation Rev., September, 2023

Poly-Exp Bounds in Tandem Queues.
CoRR, 2023

On a Continuous-Time Martingale and Two Applications.
Proceedings of the Twenty-fourth International Symposium on Theory, 2023

2021
Practical Analysis of Replication-Based Systems.
Proceedings of the 40th IEEE Conference on Computer Communications, 2021

2020
On the Throughput Optimization in Large-scale Batch-processing Systems.
Perform. Evaluation, 2020

2019
Queue and Loss Distributions in Finite-Buffer Queues.
Proc. ACM Meas. Anal. Comput. Syst., 2019

Application areas and fundamental challenges in Network Functions Virtualization.
Comput. Networks, 2019

Dealing with Dependence in Stochastic Network Calculus - Using Independence as a Bound.
Proceedings of the Analytical and Stochastic Modelling Techniques and Applications, 2019

2018
Two Extensions of Kingman's GI/G/1 Bound.
Proc. ACM Meas. Anal. Comput. Syst., 2018

2017
Distributed resource management across process boundaries.
Proceedings of the 2017 Symposium on Cloud Computing, SoCC 2017, Santa Clara, CA, USA, 2017

2016
Stochastic bounds in Fork-Join queueing systems under full and partial mapping.
Queueing Syst. Theory Appl., 2016

Stochastic Upper and Lower Bounds for General Markov Fluids.
Proceedings of the 28th International Teletraffic Congress, 2016

Contrasting Effects of Replication in Parallel Systems: From Overload to Underload and Back.
Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science, 2016

Randomized Load Balancing in Finite Regimes.
Proceedings of the 36th IEEE International Conference on Distributed Computing Systems, 2016

2015
Maximizing Cache Hit Ratios by Variance Reduction.
SIGMETRICS Perform. Evaluation Rev., 2015

Characterizing the impact of the workload on the value of dynamic resizing in data centers.
Perform. Evaluation, 2015

Network Calculus (Dagstuhl Seminar 15112).
Dagstuhl Reports, 2015

Computable Bounds in Fork-Join Queueing Systems.
Proceedings of the 2015 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, 2015

Service-martingales: Theory and applications to the delay analysis of random access protocols.
Proceedings of the 2015 IEEE Conference on Computer Communications, 2015

Towards 48-fold cabling complexity reduction in large flattened butterfly networks.
Proceedings of the 2015 IEEE Conference on Computer Communications, 2015

On multiplexing flows: Does it hurt or not?
Proceedings of the 2015 IEEE Conference on Computer Communications, 2015

2014
Stochastic Bounds on Inter-Miss Times from TTL Caches.
Prax. Inf.verarb. Kommun., 2014

Scheduling analysis with martingales.
Perform. Evaluation, 2014

Exact analysis of TTL cache networks.
Perform. Evaluation, 2014

Exact analysis of TTL cache networks: the case of caching policies driven by stopping times.
Proceedings of the ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, 2014

Reducing cabling complexity in large flattened butterfly networks by an order of magnitude.
Proceedings of the Optical Fiber Communications Conference and Exhibition, 2014

On capacity dimensioning in dynamic scenarios: The key role of peak values.
Proceedings of the 20th IEEE International Workshop on Local & Metropolitan Area Networks, 2014

On the catalyzing effect of randomness on the per-flow throughput in wireless networks.
Proceedings of the 2014 IEEE Conference on Computer Communications, 2014

Sharp per-flow delay bounds for bursty arrivals: The case of FIFO, SP, and EDF scheduling.
Proceedings of the 2014 IEEE Conference on Computer Communications, 2014

Towards a system theoretic approach to wireless network capacity in finite time and space.
Proceedings of the 2014 IEEE Conference on Computer Communications, 2014

A QoE Perspective on Sizing Network Buffers.
Proceedings of the 2014 Internet Measurement Conference, 2014

2013
A martingale-envelope and applications.
SIGMETRICS Perform. Evaluation Rev., 2013

A System Theoretic Approach for Network Capacity in Finite Time and Space Regimes.
CoRR, 2013

Performance modelling and analysis of unreliable links with retransmissions using network calculus.
Proceedings of the 25th International Teletraffic Congress, 2013

Firming solar power.
Proceedings of the ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, 2013

Sharp bounds in stochastic network calculus.
Proceedings of the ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, 2013

2012
Delay Bounds in Communication Networks With Heavy-Tailed and Self-Similar Traffic.
IEEE Trans. Inf. Theory, 2012

Stochastic bounds for randomized load balancing.
SIGMETRICS Perform. Evaluation Rev., 2012

A Stochastic Power Network Calculus for Integrating Renewable Energy Sources into the Power Grid.
IEEE J. Sel. Areas Commun., 2012

A leftover service curve approach to analyze demultiplexing in queueing networks.
Proceedings of the 6th International ICST Conference on Performance Evaluation Methodologies and Tools, 2012

Perspectives on network calculus: no free lunch, but still good value.
Proceedings of the ACM SIGCOMM 2012 Conference, 2012

Longtime behavior of harvesting spam bots.
Proceedings of the 12th ACM SIGCOMM Internet Measurement Conference, 2012

Coding of Brownian motion by quantization of exit times.
Proceedings of the 50th Annual Allerton Conference on Communication, 2012

2011
On superlinear scaling of network delays.
IEEE/ACM Trans. Netw., 2011

Non-asymptotic capacity and delay analysis of mobile wireless networks.
Proceedings of the SIGMETRICS 2011, 2011

On the scaling of non-asymptotic capacity in multi-access networks with bursty traffic.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

On expressing networks with flow transformations in convolution-form.
Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011

On the convergence to fairness in overloaded FIFO systems.
Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011

On Revealing the ARQ Mechanism of MSTV.
Proceedings of IEEE International Conference on Communications, 2011

2010
Non-asymptotic Delay Bounds for Networks with Heavy-Tailed Traffic.
Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

On Computing Bounds on Average Backlogs and Delays with Network Calculus.
Proceedings of IEEE International Conference on Communications, 2010

Non-asymptotic throughput and delay distributions in multi-hop wireless networks.
Proceedings of the 48th Annual Allerton Conference on Communication, 2010

2009
Viewing impaired video transmissions from a modeling perspective.
SIGMETRICS Perform. Evaluation Rev., 2009

Delay Bounds for Networks with Heavy-Tailed and Self-Similar Traffic
CoRR, 2009

End-to-end delay analysis for networks with partial assumptions of statistical independence: invited paper.
Proceedings of the 4th International Conference on Performance Evaluation Methodologies and Tools, 2009

Scaling of buffer and capacity requirements of voice traffic in packet networks.
Proceedings of the 21st International Teletraffic Congress, 2009

A Case for Decomposition of FIFO Networks.
Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

The stochastic network calculus: a modern approach to queueing using inequalities.
Proceedings of the AINTEC '09, 2009

2007
Exponential supermartingales for evaluating end-to-end backlog bounds.
SIGMETRICS Perform. Evaluation Rev., 2007

Network Calculus Delay Bounds in Queueing Networks with Exact Solutions.
Proceedings of the Managing Traffic Performance in Converged Networks, 2007

On Q(H log H) Scaling of Network Delays.
Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

2006
Scaling properties of statistical end-to-end bounds in the network calculus.
IEEE Trans. Inf. Theory, 2006

2005
A network service curve approach for the stochastic analysis of networks.
Proceedings of the International Conference on Measurements and Modeling of Computer Systems, 2005

2003
On multiplexing gain for networks with deterministic delay guarantees.
Proceedings of the Global Telecommunications Conference, 2003

2000
Disciple-COA: From Agent Programming to Agent Teaching.
Proceedings of the Seventeenth International Conference on Machine Learning (ICML 2000), Stanford University, Stanford, CA, USA, June 29, 2000

Rapid Development of a High Performance Knowledge Base for Course of Action Critiquing.
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence, July 30, 2000


  Loading...