Caching and Network Coding for Smart Radio Access

Berksan Serbetci

Research output: ThesisPhD Thesis - Research UT, graduation UT

102 Downloads (Pure)

Abstract

The current generation has undoubtedly been witnessing a revolution of wireless network technologies in recent decades. First of all, there has been an enormous growth of wireless user equipments and network infrastructures in terms of both number and variety. Moreover, data traffic over wireless networks has significantly increased, especially since mobile video streaming and social networking has come into play. The demand is expected to further increase in the upcoming years such that current network infrastructures will not be able to support this demand. To tackle these problems and maintain uninterrupted, fast and reliable service, many different mobile radio access standards have been proposed and there have been many ongoing discussions on which of these numerous proposals should officially be standardized. Overall, the scope of this thesis is the development and the mathematical analysis of new techniques for mobile radio access that offer improved capacity, data rates and reliability. Particularly, we explore two of the key enablers of the future wireless standards by investigating the application of caching and network coding concepts to the evolution of the LTE standard.
In the first part, we investigate caching. One of the main bottlenecks in future cellular networks is formed by the backhaul and a promising means of reducing backhaul traffic is by reserving some storage capacity at base stations and use these as caches. In this way, part of the data is stored at the wireless edge and the backhaul is used only to refresh this stored data. Data replacement will depend on the users’ demand distribution over time, which is varying slowly, and the stored data can be refreshed at off-peak times. Thus, caches containing popular content can serve users without incurring an additional load on the backhaul. In order to show the effectiveness of caching techniques, we tackle the problem from different perspectives. Firstly, we use tools from stochastic geometry and mathematical optimization to model and analyze the optimal geographical caching in heterogeneous networks, in which an operator aims to jointly optimize the cached content in base stations with different storage capacities for the case where the content popularities are fixed and known. Secondly, in addition to the aforementioned tools, we also use tools from game theory and combinatorics and further exploit the topological properties of the network, again for the case where the content popularities are fixed and known; and we provide a distributed asynchronous algorithm for optimizing the content placement which can be interpreted as giving the best response dynamics in a potential game. Thirdly, we focus on the case where the content popularities evolve over time. We use the tools from estimation theory in addition to aforementioned ones. We provide a simple estimator that estimates the content popularities dynamically and propose an algorithm that uses these estimated content popularities to optimize the content placement in base stations. Particularly, in the first part of the thesis, we mainly focus on maximizing the probability that a user will find the content that she requests in one of the caches that she is covered by.
In the second part, we investigate network coding. Network coding is a family of coding technologies that promise more effective use of network resources. Many techniques have been proposed for broadcasting/multicasting data, serving multiple users by coordinated multipoint transmission elements and techniques that enable device-to-device (D2D) communication for future wireless standards. In all these techniques, the main obstacle is the requirement for perfect synchronization between the service elements and the user equipments in order to exploit the benefits endowed by these techniques that require coordination. In this thesis, we show that network coding is an effective tool to deal with uncertainty in wireless networks and alleviate the need for synchronization between network elements. We tackle the problem from both theoretical and practical perspectives. Firstly, we use the tools from queueing theory and analyze the decoding delay of a network containing a single source transmitting network coded packets via multiple routers to a receiver. Secondly, we develop a method for D2D assisted multicast service delivery to multiple equipments. Thirdly, we present two methods where network coding is used to mitigate the communication overhead between cooperating base stations. Finally, we propose an efficient repair scheme by combining network coding with broadcasting capability of the base stations.
In a nutshell, the mathematical methods, results, analysis and the techniques presented in this thesis provide key insights into the standardization of future wireless network standards and design of cache-enabled base stations; which are seen as key elements for offering improved capacity, data rates and reliability in future wireless networks.
Original languageEnglish
Awarding Institution
  • University of Twente
Supervisors/Advisors
  • Boucherie, Richardus J., Supervisor
  • Goseling, Jasper , Co-Supervisor
Award date12 Apr 2018
Place of PublicationEnschede
Publisher
Print ISBNs978-90-365-4508-2
DOIs
Publication statusPublished - 12 Apr 2018

Fingerprint

Network Coding
Caching
Wireless Networks
Cache
Storage Capacity
Broadcasting
Placement
Synchronization
Infrastructure
Optimise
Traffic
Potential Games
Stochastic Geometry
Asynchronous Algorithms
Estimation Theory
Queueing Theory
Multicasting
Video Streaming
Social Networking
Heterogeneous Networks

Keywords

  • Caching
  • Network coding
  • Wireless communication
  • Stochastic geometry
  • Cellular networks
  • Distributed Optimalization
  • Mathematical Optimization
  • Queueing Theory
  • Game Theory
  • Estimation Theory
  • Combinatorics
  • Simulated Annealing
  • D2D Communication
  • Multicasting/Broadcasting Techniques
  • LTE
  • 5G
  • Future Wireless Networks

Cite this

Serbetci, Berksan . / Caching and Network Coding for Smart Radio Access. Enschede : Ipskamp Printing, 2018. 187 p.
@phdthesis{b060e3fa9a54444195f7b8d7cb79cbd5,
title = "Caching and Network Coding for Smart Radio Access",
abstract = "The current generation has undoubtedly been witnessing a revolution of wireless network technologies in recent decades. First of all, there has been an enormous growth of wireless user equipments and network infrastructures in terms of both number and variety. Moreover, data traffic over wireless networks has significantly increased, especially since mobile video streaming and social networking has come into play. The demand is expected to further increase in the upcoming years such that current network infrastructures will not be able to support this demand. To tackle these problems and maintain uninterrupted, fast and reliable service, many different mobile radio access standards have been proposed and there have been many ongoing discussions on which of these numerous proposals should officially be standardized. Overall, the scope of this thesis is the development and the mathematical analysis of new techniques for mobile radio access that offer improved capacity, data rates and reliability. Particularly, we explore two of the key enablers of the future wireless standards by investigating the application of caching and network coding concepts to the evolution of the LTE standard.In the first part, we investigate caching. One of the main bottlenecks in future cellular networks is formed by the backhaul and a promising means of reducing backhaul traffic is by reserving some storage capacity at base stations and use these as caches. In this way, part of the data is stored at the wireless edge and the backhaul is used only to refresh this stored data. Data replacement will depend on the users’ demand distribution over time, which is varying slowly, and the stored data can be refreshed at off-peak times. Thus, caches containing popular content can serve users without incurring an additional load on the backhaul. In order to show the effectiveness of caching techniques, we tackle the problem from different perspectives. Firstly, we use tools from stochastic geometry and mathematical optimization to model and analyze the optimal geographical caching in heterogeneous networks, in which an operator aims to jointly optimize the cached content in base stations with different storage capacities for the case where the content popularities are fixed and known. Secondly, in addition to the aforementioned tools, we also use tools from game theory and combinatorics and further exploit the topological properties of the network, again for the case where the content popularities are fixed and known; and we provide a distributed asynchronous algorithm for optimizing the content placement which can be interpreted as giving the best response dynamics in a potential game. Thirdly, we focus on the case where the content popularities evolve over time. We use the tools from estimation theory in addition to aforementioned ones. We provide a simple estimator that estimates the content popularities dynamically and propose an algorithm that uses these estimated content popularities to optimize the content placement in base stations. Particularly, in the first part of the thesis, we mainly focus on maximizing the probability that a user will find the content that she requests in one of the caches that she is covered by.In the second part, we investigate network coding. Network coding is a family of coding technologies that promise more effective use of network resources. Many techniques have been proposed for broadcasting/multicasting data, serving multiple users by coordinated multipoint transmission elements and techniques that enable device-to-device (D2D) communication for future wireless standards. In all these techniques, the main obstacle is the requirement for perfect synchronization between the service elements and the user equipments in order to exploit the benefits endowed by these techniques that require coordination. In this thesis, we show that network coding is an effective tool to deal with uncertainty in wireless networks and alleviate the need for synchronization between network elements. We tackle the problem from both theoretical and practical perspectives. Firstly, we use the tools from queueing theory and analyze the decoding delay of a network containing a single source transmitting network coded packets via multiple routers to a receiver. Secondly, we develop a method for D2D assisted multicast service delivery to multiple equipments. Thirdly, we present two methods where network coding is used to mitigate the communication overhead between cooperating base stations. Finally, we propose an efficient repair scheme by combining network coding with broadcasting capability of the base stations.In a nutshell, the mathematical methods, results, analysis and the techniques presented in this thesis provide key insights into the standardization of future wireless network standards and design of cache-enabled base stations; which are seen as key elements for offering improved capacity, data rates and reliability in future wireless networks.",
keywords = "Caching, Network coding, Wireless communication, Stochastic geometry, Cellular networks, Distributed Optimalization, Mathematical Optimization, Queueing Theory, Game Theory, Estimation Theory, Combinatorics, Simulated Annealing, D2D Communication, Multicasting/Broadcasting Techniques, LTE, 5G, Future Wireless Networks",
author = "Berksan Serbetci",
note = "IDS Ph.D. thesis series no. 18-459",
year = "2018",
month = "4",
day = "12",
doi = "10.3990/1.9789036545082",
language = "English",
isbn = "978-90-365-4508-2",
publisher = "Ipskamp Printing",
address = "Netherlands",
school = "University of Twente",

}

Caching and Network Coding for Smart Radio Access. / Serbetci, Berksan .

Enschede : Ipskamp Printing, 2018. 187 p.

Research output: ThesisPhD Thesis - Research UT, graduation UT

TY - THES

T1 - Caching and Network Coding for Smart Radio Access

AU - Serbetci, Berksan

N1 - IDS Ph.D. thesis series no. 18-459

PY - 2018/4/12

Y1 - 2018/4/12

N2 - The current generation has undoubtedly been witnessing a revolution of wireless network technologies in recent decades. First of all, there has been an enormous growth of wireless user equipments and network infrastructures in terms of both number and variety. Moreover, data traffic over wireless networks has significantly increased, especially since mobile video streaming and social networking has come into play. The demand is expected to further increase in the upcoming years such that current network infrastructures will not be able to support this demand. To tackle these problems and maintain uninterrupted, fast and reliable service, many different mobile radio access standards have been proposed and there have been many ongoing discussions on which of these numerous proposals should officially be standardized. Overall, the scope of this thesis is the development and the mathematical analysis of new techniques for mobile radio access that offer improved capacity, data rates and reliability. Particularly, we explore two of the key enablers of the future wireless standards by investigating the application of caching and network coding concepts to the evolution of the LTE standard.In the first part, we investigate caching. One of the main bottlenecks in future cellular networks is formed by the backhaul and a promising means of reducing backhaul traffic is by reserving some storage capacity at base stations and use these as caches. In this way, part of the data is stored at the wireless edge and the backhaul is used only to refresh this stored data. Data replacement will depend on the users’ demand distribution over time, which is varying slowly, and the stored data can be refreshed at off-peak times. Thus, caches containing popular content can serve users without incurring an additional load on the backhaul. In order to show the effectiveness of caching techniques, we tackle the problem from different perspectives. Firstly, we use tools from stochastic geometry and mathematical optimization to model and analyze the optimal geographical caching in heterogeneous networks, in which an operator aims to jointly optimize the cached content in base stations with different storage capacities for the case where the content popularities are fixed and known. Secondly, in addition to the aforementioned tools, we also use tools from game theory and combinatorics and further exploit the topological properties of the network, again for the case where the content popularities are fixed and known; and we provide a distributed asynchronous algorithm for optimizing the content placement which can be interpreted as giving the best response dynamics in a potential game. Thirdly, we focus on the case where the content popularities evolve over time. We use the tools from estimation theory in addition to aforementioned ones. We provide a simple estimator that estimates the content popularities dynamically and propose an algorithm that uses these estimated content popularities to optimize the content placement in base stations. Particularly, in the first part of the thesis, we mainly focus on maximizing the probability that a user will find the content that she requests in one of the caches that she is covered by.In the second part, we investigate network coding. Network coding is a family of coding technologies that promise more effective use of network resources. Many techniques have been proposed for broadcasting/multicasting data, serving multiple users by coordinated multipoint transmission elements and techniques that enable device-to-device (D2D) communication for future wireless standards. In all these techniques, the main obstacle is the requirement for perfect synchronization between the service elements and the user equipments in order to exploit the benefits endowed by these techniques that require coordination. In this thesis, we show that network coding is an effective tool to deal with uncertainty in wireless networks and alleviate the need for synchronization between network elements. We tackle the problem from both theoretical and practical perspectives. Firstly, we use the tools from queueing theory and analyze the decoding delay of a network containing a single source transmitting network coded packets via multiple routers to a receiver. Secondly, we develop a method for D2D assisted multicast service delivery to multiple equipments. Thirdly, we present two methods where network coding is used to mitigate the communication overhead between cooperating base stations. Finally, we propose an efficient repair scheme by combining network coding with broadcasting capability of the base stations.In a nutshell, the mathematical methods, results, analysis and the techniques presented in this thesis provide key insights into the standardization of future wireless network standards and design of cache-enabled base stations; which are seen as key elements for offering improved capacity, data rates and reliability in future wireless networks.

AB - The current generation has undoubtedly been witnessing a revolution of wireless network technologies in recent decades. First of all, there has been an enormous growth of wireless user equipments and network infrastructures in terms of both number and variety. Moreover, data traffic over wireless networks has significantly increased, especially since mobile video streaming and social networking has come into play. The demand is expected to further increase in the upcoming years such that current network infrastructures will not be able to support this demand. To tackle these problems and maintain uninterrupted, fast and reliable service, many different mobile radio access standards have been proposed and there have been many ongoing discussions on which of these numerous proposals should officially be standardized. Overall, the scope of this thesis is the development and the mathematical analysis of new techniques for mobile radio access that offer improved capacity, data rates and reliability. Particularly, we explore two of the key enablers of the future wireless standards by investigating the application of caching and network coding concepts to the evolution of the LTE standard.In the first part, we investigate caching. One of the main bottlenecks in future cellular networks is formed by the backhaul and a promising means of reducing backhaul traffic is by reserving some storage capacity at base stations and use these as caches. In this way, part of the data is stored at the wireless edge and the backhaul is used only to refresh this stored data. Data replacement will depend on the users’ demand distribution over time, which is varying slowly, and the stored data can be refreshed at off-peak times. Thus, caches containing popular content can serve users without incurring an additional load on the backhaul. In order to show the effectiveness of caching techniques, we tackle the problem from different perspectives. Firstly, we use tools from stochastic geometry and mathematical optimization to model and analyze the optimal geographical caching in heterogeneous networks, in which an operator aims to jointly optimize the cached content in base stations with different storage capacities for the case where the content popularities are fixed and known. Secondly, in addition to the aforementioned tools, we also use tools from game theory and combinatorics and further exploit the topological properties of the network, again for the case where the content popularities are fixed and known; and we provide a distributed asynchronous algorithm for optimizing the content placement which can be interpreted as giving the best response dynamics in a potential game. Thirdly, we focus on the case where the content popularities evolve over time. We use the tools from estimation theory in addition to aforementioned ones. We provide a simple estimator that estimates the content popularities dynamically and propose an algorithm that uses these estimated content popularities to optimize the content placement in base stations. Particularly, in the first part of the thesis, we mainly focus on maximizing the probability that a user will find the content that she requests in one of the caches that she is covered by.In the second part, we investigate network coding. Network coding is a family of coding technologies that promise more effective use of network resources. Many techniques have been proposed for broadcasting/multicasting data, serving multiple users by coordinated multipoint transmission elements and techniques that enable device-to-device (D2D) communication for future wireless standards. In all these techniques, the main obstacle is the requirement for perfect synchronization between the service elements and the user equipments in order to exploit the benefits endowed by these techniques that require coordination. In this thesis, we show that network coding is an effective tool to deal with uncertainty in wireless networks and alleviate the need for synchronization between network elements. We tackle the problem from both theoretical and practical perspectives. Firstly, we use the tools from queueing theory and analyze the decoding delay of a network containing a single source transmitting network coded packets via multiple routers to a receiver. Secondly, we develop a method for D2D assisted multicast service delivery to multiple equipments. Thirdly, we present two methods where network coding is used to mitigate the communication overhead between cooperating base stations. Finally, we propose an efficient repair scheme by combining network coding with broadcasting capability of the base stations.In a nutshell, the mathematical methods, results, analysis and the techniques presented in this thesis provide key insights into the standardization of future wireless network standards and design of cache-enabled base stations; which are seen as key elements for offering improved capacity, data rates and reliability in future wireless networks.

KW - Caching

KW - Network coding

KW - Wireless communication

KW - Stochastic geometry

KW - Cellular networks

KW - Distributed Optimalization

KW - Mathematical Optimization

KW - Queueing Theory

KW - Game Theory

KW - Estimation Theory

KW - Combinatorics

KW - Simulated Annealing

KW - D2D Communication

KW - Multicasting/Broadcasting Techniques

KW - LTE

KW - 5G

KW - Future Wireless Networks

U2 - 10.3990/1.9789036545082

DO - 10.3990/1.9789036545082

M3 - PhD Thesis - Research UT, graduation UT

SN - 978-90-365-4508-2

PB - Ipskamp Printing

CY - Enschede

ER -