Zobrazeno 1 - 10
of 49
pro vyhledávání: '"Anne Bouillard"'
Autor:
Anne Bouillard
Publikováno v:
IEEE Networking Letters. 3:80-83
Bandwidth-sharing policies guarantee a proportion of the service offered by a server to each class of traffic. These policies include GPS (Generalized Processor Sharing) and DRR (Deficit Round Robin). In this letter, we compute service curves for eac
Publikováno v:
IEEE INFOCOM 2020-IEEE Conference on Computer Communications Workshops
INFOCOM 2020: IEEE International Conference on Computer Communications
INFOCOM 2020: IEEE International Conference on Computer Communications, Jul 2020, Virtual conference, Canada. pp.1324-1325, ⟨10.1109/INFOCOMWKSHPS50562.2020.9162999⟩
INFOCOM Workshops
INFOCOM 2020: IEEE International Conference on Computer Communications
INFOCOM 2020: IEEE International Conference on Computer Communications, Jul 2020, Virtual conference, Canada. pp.1324-1325, ⟨10.1109/INFOCOMWKSHPS50562.2020.9162999⟩
INFOCOM Workshops
International audience; In telecommunications, fault management is critical to improve network availability and user experience. To enhance reliability of their networks, operators require tools to quickly understand the cause of an outage. In partic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cde655f256447202f602f14748bfc9e2
https://hal.archives-ouvertes.fr/hal-02909944
https://hal.archives-ouvertes.fr/hal-02909944
Autor:
Anne Bouillard
Publikováno v:
Performance Evaluation. 153:102250
Computing accurate deterministic performance bounds is a strong need for communication technologies having stringent requirements on latency and reliability. Within new scheduling protocols such as TSN, the FIFO policy remains at work inside each cla
Publikováno v:
Machine Learning for Networking: second IFIP TC 6 international conference, MLN 2019, Paris, France, December 3–5, 2019, revised selected papers
MLN 2019: 2nd IFIP International Conference on Machine Learning for Networking
MLN 2019: 2nd IFIP International Conference on Machine Learning for Networking, Dec 2019, Paris, France. pp.134-153, ⟨10.1007/978-3-030-45778-5_10⟩
Machine Learning for Networking ISBN: 9783030457778
MLN
MLN 2019: 2nd IFIP International Conference on Machine Learning for Networking
MLN 2019: 2nd IFIP International Conference on Machine Learning for Networking, Dec 2019, Paris, France. pp.134-153, ⟨10.1007/978-3-030-45778-5_10⟩
Machine Learning for Networking ISBN: 9783030457778
MLN
International audience; Increasing size and complexity of telecommunication networks make troubleshooting and network management more and more critical. As analyzing a log is cumbersome and time consuming, experts need tools helping them to quickly p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a1594b4e0793cc92039d3c668f691ef3
https://hal.archives-ouvertes.fr/hal-02484330v2/document
https://hal.archives-ouvertes.fr/hal-02484330v2/document
Autor:
Anne Bouillard
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030296612
FORMATS
FORMATS
With the development of real-time systems and of new wireless communication technologies having strong requirements on latencies and reliability, there is a need to compute deterministic performance bounds in networks. This paper focuses on the perfo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4984b72e780c9b3d7e28b4b4bf84c488
https://doi.org/10.1007/978-3-030-29662-9_6
https://doi.org/10.1007/978-3-030-29662-9_6
Low complexity state space representation and algorithms for closed queueing networks exact sampling
Publikováno v:
Performance Evaluation
Performance Evaluation, 2016, 103, pp.2-22. ⟨10.1016/j.peva.2016.06.006⟩
Performance Evaluation, Elsevier, 2016, 103, pp.2-22. ⟨10.1016/j.peva.2016.06.006⟩
Performance Evaluation, 2016, 103, pp.2-22. ⟨10.1016/j.peva.2016.06.006⟩
Performance Evaluation, Elsevier, 2016, 103, pp.2-22. ⟨10.1016/j.peva.2016.06.006⟩
We consider exact sampling from the stationary distribution of a closed queueing network with finite capacities. In a recent work a compact representation of sets of states was proposed that enables exact sampling from the stationary distribution wit
Publikováno v:
ITC (2)
Stochastic network calculus is a tool for computing error bounds on the performance of queueing systems. However, deriving accurate bounds for networks consisting of several queues or subject to non-independent traffic inputs is challenging. In this
Deterministic network calculus is a theory based on the (min,plus) algebra. Its aim is to compute worst-case performance bounds in communication networks. Our goal is to provide a comprehensive view of this theory and its recent advances, from its th
Publikováno v:
3rd IEEE Workshop on Next Generation Backhaul/Fronthaul Networks
3rd IEEE Workshop on Next Generation Backhaul/Fronthaul Networks, Sep 2017, Toronto, Canada
VTC-Fall
3rd IEEE Workshop on Next Generation Backhaul/Fronthaul Networks, Sep 2017, Toronto, Canada
VTC-Fall
International audience; The evolution of LTE and advent of 5G networks increases further the bandwidth requirements for Radio Access Network (RAN). In parallel, the deployment of Centralized RAN architecture raises new challenges on the FrontHaul net
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::31fcb8960bdfb1bbb3ff72742e03801a
https://inria.hal.science/hal-01615361/document
https://inria.hal.science/hal-01615361/document