Mobile edge computing represents a promising paradigm for 5G telecommunication operators. Among various services that can be provided by this technology, cloud edge caching is receiving increasing attention by network providers. By using cloud technology, in particular, the memory space of mobile edge network devices can be provisioned to OTT content providers over specific areas. They can use cache space in order to serve their customers with improved quality of service figures. We study a competitive scheme where contents are dynamically stored in the edge memory deployed by the network provider. OTT content providers are subject to Kelly mechanism with generalized cost and with bounded strategy set. After proving the uniqueness of the Nash equilibrium of such scheme, a simple bisection algorithm for its calculation is provided. Numerical results characterize the Nash equilibrium.
Bounded Generalized Kelly Mechanism for Multi-Tenant Caching in Mobile Edge Clouds / De Pellegrini, Francesco; Massaro, Antonio; Goratti, Leonardo; El-Azouzi, Rachid. - (2016), pp. 89-99. (Intervento presentato al convegno NETGCOOP 2016 tenutosi a Avignon, France nel 23rd-25th November) [10.1007/978-3-319-51034-7_9].
Bounded Generalized Kelly Mechanism for Multi-Tenant Caching in Mobile Edge Clouds
De Pellegrini Francesco;Massaro Antonio;
2016-01-01
Abstract
Mobile edge computing represents a promising paradigm for 5G telecommunication operators. Among various services that can be provided by this technology, cloud edge caching is receiving increasing attention by network providers. By using cloud technology, in particular, the memory space of mobile edge network devices can be provisioned to OTT content providers over specific areas. They can use cache space in order to serve their customers with improved quality of service figures. We study a competitive scheme where contents are dynamically stored in the edge memory deployed by the network provider. OTT content providers are subject to Kelly mechanism with generalized cost and with bounded strategy set. After proving the uniqueness of the Nash equilibrium of such scheme, a simple bisection algorithm for its calculation is provided. Numerical results characterize the Nash equilibrium.File | Dimensione | Formato | |
---|---|---|---|
Caching_NetGCoop2016_CR (1).pdf
Open Access dal 01/01/2018
Tipologia:
Post-print referato (Refereed author’s manuscript)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
503.09 kB
Formato
Adobe PDF
|
503.09 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione