Albert Banchs

Albert Banchs

Auto-generated profile, based on publicly available information

Albert Banchs

IMDEA Networks Institute and Universidad Carlos III de Madrid, Madrid, Spain

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
2 August 2018 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
PCPablo Caballero
Pablo Caballero
ABAlbert Banchs
Albert Banchs
GVGustavo de Veciana
Gustavo de Veciana
XCXavier Costa-Perez
Xavier Costa-Perez
AAArturo Azcorra
Arturo Azcorra
Technologies that enable network slicing are expected to be a key component of next generation mobile networks. Their promise lies in enabling tenants (such as mobile operators and/or services) to reap the cost and performance benefits of sharing resources while retaining the ability to customize their own allocations. When employing dynamic sharing mechanisms, tenants may exhibit strategic behavior, optimizing their choices in response to those of other tenants. This paper analyzes dynamic sharing in network slicing when tenants support inelastic users with minimum rate requirements. We propose a NEtwork Slicing (NES) framework combining: 1) admission control; 2) resource allocation; and 3) user dropping. We model the network slicing system with admitted users as a NES game; this is a new class of game where the inelastic nature of the traffic may lead to dropping users whose requirements cannot be met. We show that, as long as admission control guarantees that slices can satisfy the rate requirements of all their users, this game possesses a Nash equilibrium. Admission control policies (a conservative and an aggressive one) are considered, along with a resource allocation scheme and a user dropping algorithm, geared at maintaining the system in Nash equilibria. We analyze our NES framework's performance in equilibrium, showing that it achieves the same or better utility than static resource partitioning, and bound the difference between NES and the socially optimal performance. Simulation results confirm the effectiveness of the proposed approach.

14 February 2019 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Open access
PCPablo Caballero
Pablo Caballero
ABAlbert Banchs
Albert Banchs
GVGustavo De Veciana
Gustavo De Veciana
XCXavier Costa-Perez
Xavier Costa-Perez
Network slicing to enable resource sharing among multiple tenants-network operators and/or services-is considered as a key functionality for next generation mobile networks. This paper provides an analysis of a well-known model for resource sharing, the share-constrained proportional allocation mechanism, to realize network slicing. This mechanism enables tenants to reap the performance benefits of sharing, while retaining the ability to customize their own users' allocation. This results in a network slicing game in which each tenant reacts to the user allocations of the other tenants so as to maximize its own utility. We show that, for elastic traffic, the game associated with such strategic behavior converges to a Nash equilibrium. At the Nash equilibrium, a tenant always achieves the same or better performance than that of a static partitioning of resources, thus providing the same level of protection as static partitioning. We further analyze the efficiency and fairness of the resulting allocations, providing tight bounds for the price of anarchy and envy-freeness. Our analysis and extensive simulation results confirm that the mechanism provides a comprehensive practical solution to realize network slicing. Our theoretical results also fills a gap in the analysis of this resource allocation model under strategic players.

18 July 2019 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Open access
VSVincenzo Sciancalepore
Vincenzo Sciancalepore
XCXavier Costa-Perez
Xavier Costa-Perez
ABAlbert Banchs
Albert Banchs
Network slicing is considered one of the main pillars of the upcoming 5G networks. Indeed, the ability to slice a mobile network and tailor each slice to the needs of the corresponding tenant is envisioned as a key enabler for the design of future networks. However, this novel paradigm opens up to new challenges, such as isolation between network slices, the allocation of resources across them, and the admission of resource requests by network slice tenants. In this paper, we address this problem by designing the following building blocks for supporting network slicing: i) traffic and user mobility analysis, ii) a learning and forecasting scheme per slice, iii) optimal admission control decisions based on spatial and traffic information, and iv) a reinforcement process to drive the system towards optimal states. In our framework, namely RL-NSB, infrastructure providers perform admission control considering the service level agreements (SLA) of the different tenants as well as their traffic usage and user distribution, and enhance the overall process by the means of learning and the reinforcement techniques that consider heterogeneous mobility and traffic models among diverse slices. Our results show that by relying on appropriately tuned forecasting schemes, our approach provides very substantial potential gains in terms of system utilization while meeting the tenants’ SLAs.

13 December 2019 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
DBDario Bega
Dario Bega
MGMarco Gramaglia
Marco Gramaglia
Marco FioreMarco Fiore
Marco Fiore
ABAlbert Banchs
Albert Banchs
XCXavier Costa-Perez
Xavier Costa-Perez
The dynamic management of network resources is both a critical and challenging task in upcoming multi-tenant mobile networks, which requires allocating capacity to individual network slices so as to accommodate future time-varying service demands. Such an anticipatory resource configuration process must be driven by suitable predictors that take into account the monetary cost associated to overprovisioning or underprovisioning of networking capacity, computational power, memory, or storage. Legacy models that aim at forecasting traffic demands fail to capture these key economic aspects of network operation. To close this gap, we present DeepCog, a deep neural network architecture inspired by advances in image processing and trained via a dedicated loss function. Unlike traditional traffic volume predictors, DeepCog returns a cost-aware capacity forecast, which can be directly used by operators to take short- and long-term reallocation decisions that maximize their revenues. Extensive performance evaluations with real-world measurement data collected in a metropolitan-scale operational mobile network demonstrate the effectiveness of our proposed solution, which can reduce resource management costs by over 50% in practical case studies.

17 June 2019 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Open access
CMCristina Marquez
Cristina Marquez
MGMarco Gramaglia
Marco Gramaglia
Marco FioreMarco Fiore
Marco Fiore
ABAlbert Banchs
Albert Banchs
XCXavier Costa-Perez
Xavier Costa-Perez

15 June 2006 in Wireless Networks
Verified
Journal Article
Closed access
PDF file
ABAlbert Banchs
Albert Banchs
Pablo SerranoPablo Serrano
Pablo Serrano
HOHuw Oliver
Huw Oliver