UB Paderborn / Katalog / Suche / in CDI

Design of robust programmable networks with bandwidth-optimal failure recovery scheme

Computer networks (Amsterdam, Netherlands : 1999), 2021-06, Vol.192 (108043), p.108043, Article 108043

2021

Volltextzugriff (PDF)

Optimal Network Service Chain Provisioning

IEEE/ACM transactions on networking, 2018-06, Vol.26 (3), p.1320-1333

2018

Volltextzugriff (PDF)

Order statistics and estimating cardinalities of massive data sets

Discrete Applied Mathematics, 2009, Vol.157 (2), p.406-427

Giroire, Frédéric

2009

Volltextzugriff (PDF)

Efficient data collection and tracking with flying drones

Ad hoc networks, 2019-06, Vol.89 (C), p.35-46

2019

Volltextzugriff (PDF)

A random growth model with any real or theoretical degree distribution

Theoretical computer science, 2023-01, Vol.940 (Part A), p.36-51

2023

Volltextzugriff (PDF)

Energy-efficient service function chain provisioning

Journal of optical communications and networking, 2018-03, Vol.10 (3), p.114-124

2018

Volltextzugriff (PDF)

Analysis of the Failure Tolerance of Linear Access Networks

IEEE transactions on intelligent transportation systems, 2018-04, Vol.19 (4), p.1166-1175

2018

Volltextzugriff (PDF)

On the Complexity of Compressing Two Dimensional Routing Tables with Order

Algorithmica, 2018, Vol.80 (1), p.209-233

2018

Volltextzugriff (PDF)

Preferential attachment hypergraph with high modularity

Network science (Cambridge University Press), 2022-12, Vol.10 (4), p.400-429

2022

Volltextzugriff (PDF)

Minimization of network power consumption with redundancy elimination

Computer communications, 2015-03, Vol.59, p.98-105

2015

Volltextzugriff (PDF)

Minnie: An SDN world with few compressed forwarding rules

Computer networks (Amsterdam, Netherlands : 1999), 2017-07, Vol.121, p.185-207

2017

Volltextzugriff (PDF)

Energy-Aware Routing in Software-Defined Network using Compression

Computer journal, 2018-10, Vol.61 (10), p.1537-1556

2018

Volltextzugriff (PDF)

Resource Requirements for Reliable Service Function Chaining

2018 IEEE International Conference on Communications (ICC), 2018, p.1-7

2018

Volltextzugriff (PDF)

Provably Efficient Algorithms for Placement of Service Function Chains with Ordering Constraints

IEEE INFOCOM 2018 - IEEE Conference on Computer Communications, 2018, p.774-782

2018

Volltextzugriff (PDF)

Bringing Energy Aware Routing Closer to Reality With SDN Hybrid Networks

IEEE transactions on green communications and networking, 2018-12, Vol.2 (4), p.1128-1139

2018

Volltextzugriff (PDF)

To satisfy impatient Web surfers is hard

Theoretical computer science, 2014-03, Vol.526, p.1-17

2014

Volltextzugriff (PDF)

Optimization of network service chain provisioning

2017 IEEE International Conference on Communications (ICC), 2017, p.1-7

2017

Volltextzugriff (PDF)

Order statistics and estimating cardinalities of massive data sets

Discrete Mathematics and Theoretical Computer Science, 2005-01, Vol.DMTCS Proceedings vol. AD,... (Proceedings), p.157-166

Giroire, Frédéric

2005

Volltextzugriff (PDF)

On the complexity of equal shortest path routing

Networks, 2015-07, Vol.65 (4), p.344-352

2015

Volltextzugriff (PDF)

Grid spanners with low forwarding index for energy efficient networks

Discrete Applied Mathematics, 2018-09, Vol.246, p.99-107

2018

Volltextzugriff (PDF)

Compressing Two-dimensional Routing Tables with Order

Electronic notes in discrete mathematics, 2016-06, Vol.52, p.351-358

2016

Volltextzugriff (PDF)

P2P storage systems: Study of different placement policies

Peer-to-peer networking and applications, 2014-12, Vol.7 (4), p.427-443

2014

Volltextzugriff (PDF)

On the hull number of some graph classes

Theoretical computer science, 2013-03, Vol.475, p.1-12

2013

Volltextzugriff (PDF)

Be Scalable and Rescue My Slices During Reconfiguration

ICC 2020 - 2020 IEEE International Conference on Communications (ICC), 2020, p.1-6

2020

Volltextzugriff (PDF)

Maintaining balanced trees for structured distributed streaming systems

Discrete Applied Mathematics, 2017-12, Vol.232, p.176-188

2017

Volltextzugriff (PDF)

Menü

Weitere Dienste

Einstellungen

Design of robust programmable networks with bandwidth-optimal failure recovery scheme

Optimal Network Service Chain Provisioning

Order statistics and estimating cardinalities of massive data sets

Efficient data collection and tracking with flying drones

A random growth model with any real or theoretical degree distribution

Energy-efficient service function chain provisioning

Analysis of the Failure Tolerance of Linear Access Networks

On the Complexity of Compressing Two Dimensional Routing Tables with Order

Preferential attachment hypergraph with high modularity

Minimization of network power consumption with redundancy elimination

Minnie: An SDN world with few compressed forwarding rules

Energy-Aware Routing in Software-Defined Network using Compression

Resource Requirements for Reliable Service Function Chaining

Provably Efficient Algorithms for Placement of Service Function Chains with Ordering Constraints

Bringing Energy Aware Routing Closer to Reality With SDN Hybrid Networks

To satisfy impatient Web surfers is hard

Optimization of network service chain provisioning

Order statistics and estimating cardinalities of massive data sets

On the complexity of equal shortest path routing

Grid spanners with low forwarding index for energy efficient networks

Compressing Two-dimensional Routing Tables with Order

P2P storage systems: Study of different placement policies

On the hull number of some graph classes

Be Scalable and Rescue My Slices During Reconfiguration

Maintaining balanced trees for structured distributed streaming systems

Suchergebnisse filtern