• INFRES+LINCS Seminar:
  • When & Where: Seminars are generally (please, check the timeline and location before coming!) held on:
    • Wednesday afternoon at LINCS (14h-15h, Salle de Conseil) and
    • Thursday afternoon at Barrault (14h-15h, Amphi Saphir).
  • Contact us: if you wish to give a talk on networking, math, software or embedded-system topics, do not hesitate to contact us

[Next talks] [All talks]

03/01/2018 (14h@LINCS, Seminar Room)Diego Pacheco Paramo (Universidad Sergio Arboleda, Colombie)Reinforcement Learning for Efficient Access Control with M2M/H2H traffic in LTE-A networks
24/01/2018 (14h@LINCS, Seminar Room)Celine Comte (Nokia Bell Labs France and Telecom ParisTech)Performance of Balanced Fairness in Resource Pools: A Recursive Approach


Date:03/01/2018, 14h
Room:LINCS, Seminar Room
Speaker:Diego Pacheco Paramo (Universidad Sergio Arboleda, Colombie)
Talk:Reinforcement Learning for Efficient Access Control with M2M/H2H traffic in LTE-A networks
Abstract:Although many advantages are expected from the provision of services for M2M communications in cellular networks such as extended coverage, security, robust management and lower deployment costs, coexistence with a large number of M2M devices is still an important challenge, in part due to the difficulty in allowing simultaneous access. Although the random access procedure in LTE-A is adequate for H2H communications, it is necessary to optimize this mechanism when M2M communications are considered. One of the proposed methods in 3GPP is Access Class Barring (ACB), which is able to reduce the number of simultaneous users contending for access. However, it is still not clear how to adapt its parameters in dynamic or bursty scenarios, such as those that appear when M2M communications are introduced.We propose a dynamic mechanism for ACB based on reinforcement learning, which aims to reduce the impact that M2M communications have over H2H communications, while at the same time ensuring that the KPIs for all users are in acceptable levels.
Links:back to the list item, list top or summary top

Date:24/01/2018, 14h
Room:LINCS, Seminar Room
Speaker:Celine Comte (Nokia Bell Labs France and Telecom ParisTech)
Talk:Performance of Balanced Fairness in Resource Pools: A Recursive Approach
Abstract:Understanding the performance of a pool of servers is crucial for proper dimensioning. One of the main challenges is to take into account the complex interactions between servers that are pooled to process jobs. In particular, a job can generally not be processed by any server of the cluster due to various constraints like data locality. In this paper, we represent these constraints by some assignment graph between jobs and servers. We present a recursive approach to computing performance metrics like mean response times when the server capacities are shared according to balanced fairness. While the computational cost of these formulas can be exponential in the number of servers in the worst case, we illustrate their practical interest by introducing broad classes of pool structures that can be exactly analyzed in polynomial time. This extends considerably the class of models for which explicit performance metrics are accessible.This is a joint work with Thomas Bonald and Fabien Mathieu.
Links:back to the list item, list top or summary top