pith. sign in

arxiv: 1907.02322 · v1 · pith:6NDXN7IDnew · submitted 2019-07-04 · 💻 cs.NI

Wireless Caching Helper System with Heterogeneous Traffic and Random Availability

Ioannis Avgouleas , Nikolaos Pappas , Vangelis Angelakis This is my paper

Pith reviewed 2026-05-25 09:08 UTC · model grok-4.3

classification 💻 cs.NI
keywords wireless cachinghelper systemsheterogeneous trafficrandom availabilitythroughputdelaymultimedia streamingqueueing model
0
0 comments X

The pith

In a wireless caching helper system separating cachable and non-cachable traffic, numerical results show throughput and user delay depend on arrival rates, helper availability, cache parameters, and request rates.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper models a wireless system where a user requests cachable content from a data center via base station, assisted by helpers that also exchange non-cachable traffic. Helpers have limited caches and random availability, while packets arrive in bursts at the source helper. Numerical evaluation quantifies how system throughput and the delay at the user change with packet arrival rate at the source helper, caching helper availability, cache parameters, and user request rate. A sympathetic reader would care because the results clarify performance when offloading multimedia streaming to nearby helpers instead of central base stations.

Core claim

By distinguishing cachable from non-cachable traffic in a system where a user is assisted by a pair of wireless helpers with their own caches and random availability, while the source helper receives bursty non-cachable packets, the throughput and the delay experienced by the user are shown to be affected by the packet arrival rate at the source helper, the availability of caching helpers, the caches' parameters, and the user's request rate through numerical results.

What carries the argument

The queueing model with random helper availability and separate handling of cachable versus non-cachable traffic.

If this is right

  • Varying the packet arrival rate at the source helper changes both system throughput and user delay.
  • Different levels of caching helper availability produce different delay values for the user.
  • Adjusting cache parameters alters the fraction of requests served locally versus from the base station.
  • Higher user request rates modify the overall throughput and delay metrics.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • System designers could tune cache sizes to reduce delay under specific availability conditions.
  • The random availability assumption implies that helper density alone may not guarantee better performance due to interference.
  • The numerical approach could be replaced by closed-form expressions if the queueing model is solved exactly.

Load-bearing premise

Distinguishing cachable from non-cachable traffic and modeling helper availability as random produces representative throughput and delay values for real wireless multimedia systems.

What would settle it

Measurements from a deployed wireless testbed with recorded helper availability patterns and known arrival statistics that differ substantially from the numerical throughput and delay curves would falsify the model's applicability.

Figures

Figures reproduced from arXiv: 1907.02322 by Ioannis Avgouleas, Nikolaos Pappas, Vangelis Angelakis.

Figure 1
Figure 1. Figure 1: The wireless network we analyze in our system model: user [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Operation of U in the described protocol. Operation of S S will transmit to U Q=0 Is the transmission successful? Is S attempting transmission to U? End N N Y U successfully receives from S U will retry in a subsequent time slot Is content cached at S? Is S attempting transmissions to D? S will transmit from its queue to D Is the transmission successful? Y D successfully receives from S D will retry in a N… view at source ↗
Figure 3
Figure 3. Figure 3: Operation of S when user U requests a file f from external resources. Operation of D D will transmit to U U externally requests content Is the transmission successful? Is content cached at D? Is D attempting transmission to U? End N N N Y Y Y U successfully receives from D Y U will try again in a future time slot N [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Operation of D when user U requests a file f from external resources. 4 [PITH_FULL_IMAGE:figures/full_fig_p004_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: The maximum weighted sum throughput vs. λ for α = 0.7 and different values of w when the queue at S is stable for: (a) δ = 0.5 and (b) δ = 1.2. Furthermore, it is observed that the maximum weighted sum throughput is achieved when q ∗ c = 1 for any value of w and λ when the queue at S is stable (see Table IV), but this is not the case when the queue is unstable i.e., the average arrival rate λ is greater th… view at source ↗
Figure 6
Figure 6. Figure 6: The maximum weighted sum throughput vs. MU when the queue at S is stable (λ = 0.4) and α = 0.7 using different values of w for: (a) δ = 0.5 and (b) δ = 1.2. almost constant (δ = 1.2) or decreases (δ = 0.5) as MU increases. The latter decrease can be attributed to the fact that TU i.e., the dominant term in the maximum weighted sum throughput, decreases as qU decreases (and MU increases). The values of q ∗ … view at source ↗
Figure 8
Figure 8. Figure 8: The maximum weighted sum throughput vs the average arrival rate [PITH_FULL_IMAGE:figures/full_fig_p009_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: The maximum weighted sum throughput vs. the average arrival rate [PITH_FULL_IMAGE:figures/full_fig_p010_9.png] view at source ↗
Figure 10
Figure 10. Figure 10: The average delay at U vs. average arrival rate λ at S for δ ∈ {0.5, 1.2}. attempts transmissions to U, qD, and the cache size at U, MU affect the average delay at U. The wireless links characteristics can be found in Table II. The cache sizes were set to hold MS = 2000 and MD = 1000 files at S and D, respectively and we used two different values for δ to examine its effect on the realized average delay. … view at source ↗
Figure 11
Figure 11. Figure 11: The average delay at U vs. data center’s random availability α for δ ∈ {0.5, 1.2}. to find an available helper is decreased (since the S − D pair communicates). Regarding the case in which the queue at S is stable, increasing qS does not contribute to delay’s improvement. Moreover, a lower value of qS is required to achieve queue stability at S when λ = 0.2 compared to λ = 0.4. This is expected since a hi… view at source ↗
Figure 12
Figure 12. Figure 12: The average delay at U vs. qS for δ ∈ {0.5, 1.2}. especially when δ is lowered. VI. CONCLUSION In this paper, we studied the effect of multiple randomly available caching helpers on a wireless system that serves cachable and non-cachable traffic. We derived the throughput for a system consisting of a user requesting cachable content from a pair of caching helpers within its proximity or a data center. The… view at source ↗
Figure 14
Figure 14. Figure 14: The average delay at U vs. Mu for δ ∈ {0.5, 1.2}. Workshop on Signal Processing Advances in Wireless Communications (SPAWC), pp. 1–6, July 2016. [14] D. Liu and C. Yang, “Energy Efficiency of Downlink Networks With Caching at Base Stations,” IEEE Journal on Selected Areas in Commu￾nications, vol. 34, no. 4, pp. 907–922, Apr. 2016. [15] S. Lin, D. Cheng, G. Zhao, and Z. Chen, “Energy-Efficient Wireless Cac… view at source ↗
read the original abstract

Multimedia content streaming from Internet-based sources emerges as one of the most high demanded services by wireless users. In order to alleviate excessive traffic due to multimedia content transmission, many architectures (e.g., small cells, femtocells, etc.) have been proposed to offload such traffic to the nearest (or strongest) access point also called "helper". The deployment of more helpers is not necessarily beneficial due to their potential of increasing interference. In this work, we evaluate a wireless system in which we distinguish between cachable and non-cachable traffic. More specifically, we consider a general system in which a wireless user with limited cache storage requests cachable content from a data center that can be directly accessed through a base station. The user can be assisted by a pair of wireless helpers that exchange non-cachable content as well. Packets arrive at the queue of the source helper in bursts. Each helper has its own cache to assist the user's requests for cachable content. Files not available from the helpers are transmitted by the base station. We analyze the system throughput and the delay experienced by the user and show how they are affected by the packet arrival rate at the source helper, the availability of caching helpers, the caches' parameters, and the user's request rate by means of numerical results.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 2 minor

Summary. The paper models a wireless caching helper system distinguishing cachable and non-cachable traffic. A user requests cachable content from a data center via base station and is assisted by two helpers that exchange non-cachable content and maintain their own caches. Bursty arrivals occur at the source helper queue. The central claim is that system throughput and user delay are analyzed and shown (via numerical results) to depend on packet arrival rate at the source helper, caching helper availability, cache parameters, and user request rate.

Significance. If the numerical evaluation is correctly implemented, the work supplies concrete illustrations of performance sensitivity to arrival rates, availability, and cache sizes in a heterogeneous-traffic wireless setting. This is useful for small-cell multimedia offloading design, though the contribution is primarily evaluative rather than deriving closed forms or proving optimality.

minor comments (2)
  1. The abstract states that throughput and delay 'are affected by' the listed parameters but does not indicate whether the observed trends are monotonic, exhibit thresholds, or reverse at high loads; adding one sentence summarizing the dominant trends would improve clarity for readers scanning the abstract.
  2. The model description refers to 'a pair of wireless helpers' without specifying whether they are symmetric or have distinct roles beyond one being the 'source helper'; a short sentence clarifying the asymmetry would remove potential ambiguity.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for reviewing our manuscript and recommending minor revision. The referee's summary accurately captures the system model, the distinction between cachable and non-cachable traffic, the bursty arrivals, and the numerical evaluation of throughput and delay as functions of arrival rate, helper availability, cache parameters, and request rate. We appreciate the observation that the contribution is primarily evaluative and useful for small-cell multimedia offloading design.

Circularity Check

0 steps flagged

No significant circularity

full rationale

The paper's central claim is limited to analyzing throughput and delay in a described queueing model with random helper availability and heterogeneous traffic, then showing their dependence on parameters via numerical results. This claim requires only the existence of such an evaluation and does not assert any closed-form derivation, uniqueness theorem, or prediction that could reduce to fitted inputs or self-citations by construction. The model assumptions are internal choices whose validity is not required for the stated claim to hold, and no equations or load-bearing self-references appear in the provided text.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract-only review supplies no information on free parameters, axioms, or invented entities.

pith-pipeline@v0.9.0 · 5762 in / 1011 out tokens · 28593 ms · 2026-05-25T09:08:18.117280+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

40 extracted references · 40 canonical work pages

  1. [1]

    Cisco Visual Networking Index: Global Mobile Data Traffic Forecast Update, 20172022 White Paper,

    “Cisco Visual Networking Index: Global Mobile Data Traffic Forecast Update, 20172022 White Paper,” 2019. [Online]. Available: https://www.cisco.com/c/en/us/solutions/collateral/service-provider/ visual-networking-index-vni/white-paper-c11-738429.html

    work page 2019

  2. [2]

    Wireless caching: technical misconceptions and business barriers,

    G. Paschos, E. Bastug, I. Land, G. Caire, and M. Debbah, “Wireless caching: technical misconceptions and business barriers,” IEEE Com- munications Magazine , vol. 54, no. 8, pp. 16–22, Aug. 2016. 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 2 3 4 5 6 7 (a) λ = 0.2 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 2 3 4 5 6 7 (b) λ = 0.4 Fig. 13: The average delay at U v...

    work page 2016

  3. [3]

    FemtoCaching: Wireless Content Delivery Through Dis- tributed Caching Helpers,

    K. Shanmugam, N. Golrezaei, A. G. Dimakis, A. F. Molisch, and G. Caire, “FemtoCaching: Wireless Content Delivery Through Dis- tributed Caching Helpers,” IEEE Transactions on Information Theory , vol. 59, no. 12, pp. 8402–8413, Dec. 2013

    work page 2013

  4. [4]

    The Role of Caching in Future Communication Systems and Networks,

    G. S. Paschos, G. Iosifidis, M. Tao, D. Towsley, and G. Caire, “The Role of Caching in Future Communication Systems and Networks,” IEEE Journal on Selected Areas in Communications , vol. 36, no. 6, pp. 1111– 1125, June 2018

    work page 2018

  5. [5]

    Fundamental Limits of Caching,

    M. A. Maddah-Ali and U. Niesen, “Fundamental Limits of Caching,” IEEE Transactions on Information Theory , vol. 60, no. 5, pp. 2856– 2867, May 2014

    work page 2014

  6. [6]

    Probabilistic Caching in Wire- less D2D Networks: Cache Hit Optimal Versus Throughput Optimal,

    Z. Chen, N. Pappas, and M. Kountouris, “Probabilistic Caching in Wire- less D2D Networks: Cache Hit Optimal Versus Throughput Optimal,” IEEE Communications Letters , vol. 21, no. 3, pp. 584–587, Mar. 2017

    work page 2017

  7. [7]

    On the delay of geographical caching methods in two-tiered heterogeneous networks,

    E. Batu, M. Kountouris, M. Bennis, and M. Debbah, “On the delay of geographical caching methods in two-tiered heterogeneous networks,” IEEE 17th International Workshop on Signal Processing Advances in Wireless Communications (SPA WC), pp. 1–5, July 2016

    work page 2016

  8. [8]

    Throughput and Delay Analysis of Wireless Caching Helper Systems With Random Availability,

    N. Pappas, Z. Chen, and I. Dimitriou, “Throughput and Delay Analysis of Wireless Caching Helper Systems With Random Availability,” IEEE Access, vol. 6, pp. 9667–9678, 2018

    work page 2018

  9. [9]

    A Cooperation-Based Caching Scheme for Heterogeneous Networks,

    J. Ma, J. Wang, and P. Fan, “A Cooperation-Based Caching Scheme for Heterogeneous Networks,” IEEE Access , vol. 5, pp. 15 013–15 020, 2017

    work page 2017

  10. [10]

    Cooperative Caching Placement in Cache-Enabled D2D Underlaid Cellular Network,

    Y . Wang, X. Tao, X. Zhang, and Y . Gu, “Cooperative Caching Placement in Cache-Enabled D2D Underlaid Cellular Network,” IEEE Communi- cations Letters , vol. 21, no. 5, pp. 1151–1154, May 2017

    work page 2017

  11. [11]

    Cooperative Caching and Transmission Design in Cluster-Centric Small Cell Net- works,

    Z. Chen, J. Lee, T. Q. S. Quek, and M. Kountouris, “Cooperative Caching and Transmission Design in Cluster-Centric Small Cell Net- works,” IEEE Transactions on Wireless Communications , vol. 16, no. 5, pp. 3401–3415, May 2017

    work page 2017

  12. [12]

    Modeling and Perfor- mance Analysis of Full-Duplex Communications in Cache-Enabled D2D Networks,

    M. Naslcheraghi, M. Afshang, and H. S. Dhillon, “Modeling and Perfor- mance Analysis of Full-Duplex Communications in Cache-Enabled D2D Networks,” IEEE International Conference on Communications (ICC) , pp. 1–6, May 2018

    work page 2018

  13. [13]

    D2D caching vs. small cell caching: Where to cache content in a wireless network?

    Z. Chen and M. Kountouris, “D2D caching vs. small cell caching: Where to cache content in a wireless network?” IEEE 17th International 12 0 200 400 600 800 1000 1.5 2 2.5 3 3.5 4 4.5 5 5.5 (a) λ = 0.2 0 200 400 600 800 1000 1 2 3 4 5 6 7 (b) λ = 0.4 Fig. 14: The average delay at U vs. Mu for δ ∈ {0.5, 1.2}. Workshop on Signal Processing Advances in Wirele...

    work page 2016

  14. [14]

    Energy Efficiency of Downlink Networks With Caching at Base Stations,

    D. Liu and C. Yang, “Energy Efficiency of Downlink Networks With Caching at Base Stations,” IEEE Journal on Selected Areas in Commu- nications, vol. 34, no. 4, pp. 907–922, Apr. 2016

    work page 2016

  15. [15]

    Energy-Efficient Wireless Caching in Device-to-Device Cooperative Networks,

    S. Lin, D. Cheng, G. Zhao, and Z. Chen, “Energy-Efficient Wireless Caching in Device-to-Device Cooperative Networks,” IEEE 85th V ehic- ular Technology Conference (VTC Spring) , June 2017

    work page 2017

  16. [16]

    Cache-Enabled Device-to-Device Communications: Offloading Gain and Energy Cost,

    B. Chen, C. Yang, and A. F. Molisch, “Cache-Enabled Device-to-Device Communications: Offloading Gain and Energy Cost,” IEEE Transactions on Wireless Communications , vol. 16, no. 7, pp. 4519–4536, July 2017

    work page 2017

  17. [17]

    Optimal caching place- ment for D2D assisted wireless caching networks,

    J. Rao, H. Feng, C. Yang, Z. Chen, and B. Xia, “Optimal caching place- ment for D2D assisted wireless caching networks,” IEEE International Conference on Communications (ICC) , pp. 1–6, May 2016

    work page 2016

  18. [18]

    Spatially Correlated Content Caching for Device-to-Device Communications,

    D. Malak, M. Al-Shalash, and J. G. Andrews, “Spatially Correlated Content Caching for Device-to-Device Communications,” IEEE Trans- actions on Wireless Communications , vol. 17, no. 1, pp. 56–70, Jan. 2018

    work page 2018

  19. [19]

    Edge Caching at Base Stations With Device-to-Device Offloading,

    W. Wang, R. Lan, J. Gu, A. Huang, H. Shan, and Z. Zhang, “Edge Caching at Base Stations With Device-to-Device Offloading,” IEEE Access, vol. 5, pp. 6399–6410, 2017

    work page 2017

  20. [20]

    Optimal Caching and Scheduling for Cache-Enabled D2D Communications,

    B. Chen, C. Yang, and Z. Xiong, “Optimal Caching and Scheduling for Cache-Enabled D2D Communications,” IEEE Communications Letters , vol. 21, no. 5, pp. 1155–1158, May 2017

    work page 2017

  21. [21]

    Exploiting Transmission and Caching Diversity in Cache-Enabled User-Centric Network: Analysis and Optimization,

    Y . Chen and H. Zhang, “Exploiting Transmission and Caching Diversity in Cache-Enabled User-Centric Network: Analysis and Optimization,” IEEE Access , vol. 7, pp. 65 934–65 943, 2019

    work page 2019

  22. [22]

    Online Caching and Cooperative Forwarding in Information Centric Networking,

    K. Thar, N. H. Tran, S. Ullah, T. Z. Oo, and C. S. Hong, “Online Caching and Cooperative Forwarding in Information Centric Networking,” IEEE Access, vol. 6, pp. 59 679–59 694, 2018

    work page 2018

  23. [23]

    Stability, Rate, and Delay Analysis of Single Bottleneck Caching Networks,

    F. Rezaei and B. H. Khalaj, “Stability, Rate, and Delay Analysis of Single Bottleneck Caching Networks,” IEEE Transactions on Commu- nications, vol. 64, no. 1, pp. 300–313, Jan. 2016

    work page 2016

  24. [24]

    Adaptive Video Streaming for Wireless Networks With Multiple Users and Helpers,

    D. Bethanabhotla, G. Caire, and M. J. Neely, “Adaptive Video Streaming for Wireless Networks With Multiple Users and Helpers,” IEEE Trans- actions on Communications , vol. 63, no. 1, pp. 268–285, Jan 2015

    work page 2015

  25. [25]

    Cost Optimization for On-Demand Content Streaming in IoV Networks With Two Service Tiers,

    X. Hong, J. Jiao, A. Peng, J. Shi, and C. Wang, “Cost Optimization for On-Demand Content Streaming in IoV Networks With Two Service Tiers,” IEEE Internet of Things Journal , vol. 6, no. 1, pp. 38–49, Feb. 2019

    work page 2019

  26. [26]

    A Q-Learning based Proactive Caching Strategy for Non-safety Related Services in Vehicular Networks,

    L. Hou, L. Lei, K. Zheng, and X. Wang, “A Q-Learning based Proactive Caching Strategy for Non-safety Related Services in Vehicular Networks,” IEEE Internet of Things Journal , pp. 1–1, 2019

    work page 2019

  27. [27]

    A Survey on Mobile Edge Networks: Convergence of Computing, Caching and Communications,

    S. Wang, X. Zhang, Y . Zhang, L. Wang, J. Yang, and W. Wang, “A Survey on Mobile Edge Networks: Convergence of Computing, Caching and Communications,” IEEE Access , vol. 5, pp. 6757–6779, 2017

    work page 2017

  28. [28]

    Mobility-Aware Coded Probabilistic Caching Scheme for MEC-Enabled Small Cell Networks,

    X. Liu, J. Zhang, X. Zhang, and W. Wang, “Mobility-Aware Coded Probabilistic Caching Scheme for MEC-Enabled Small Cell Networks,” IEEE Access , vol. 5, pp. 17 824–17 833, 2017

    work page 2017

  29. [29]

    Challenges of Mobile Social Device Caching,

    Y . Wu, S. Yao, Y . Yang, T. Zhou, H. Qian, H. Hu, and M. Hamalainen, “Challenges of Mobile Social Device Caching,” IEEE Access , vol. 4, pp. 8938–8947, 2016

    work page 2016

  30. [30]

    Low Latency Radio Access in 3GPP Local Area Data Networks for V2X: Stochastic Optimization and Learning,

    S. Lien, S. Hung, D. Deng, C. Lai, and H. Tsai, “Low Latency Radio Access in 3GPP Local Area Data Networks for V2X: Stochastic Optimization and Learning,” IEEE Internet of Things Journal , pp. 1–1, 2019

    work page 2019

  31. [31]

    Recent Advances of Edge Cache in Radio Access Networks for Internet of Things: Techniques, Performances, and Challenges,

    Z. Piao, M. Peng, Y . Liu, and M. Daneshmand, “Recent Advances of Edge Cache in Radio Access Networks for Internet of Things: Techniques, Performances, and Challenges,” IEEE Internet of Things Journal, vol. 6, no. 1, pp. 1010–1028, Feb 2019

    work page 2019

  32. [32]

    Joint Optimization of Radio and Computational Resources for Multicell Mobile-Edge Computing,

    S. Sardellitti, G. Scutari, and S. Barbarossa, “Joint Optimization of Radio and Computational Resources for Multicell Mobile-Edge Computing,” IEEE Transactions on Signal and Information Processing over Networks , vol. 1, no. 2, pp. 89–103, June 2015

    work page 2015

  33. [33]

    Joint allocation of computation and communication resources in multiuser mobile cloud computing,

    S. Barbarossa, S. Sardellitti, and P. Di Lorenzo, “Joint allocation of computation and communication resources in multiuser mobile cloud computing,” in IEEE 14th Workshop on Signal Processing Advances in Wireless Communications (SPA WC), June 2013, pp. 26–30

    work page 2013

  34. [34]

    Joint Optimization of Caching, Computing, and Radio Resources for Fog-Enabled IoT using Natural ActorCritic Deep Reinforcement Learning,

    Y . Wei, F. R. Yu, M. Song, and Z. Han, “Joint Optimization of Caching, Computing, and Radio Resources for Fog-Enabled IoT using Natural ActorCritic Deep Reinforcement Learning,” IEEE Internet of Things Journal, vol. 6, no. 2, pp. 2061–2073, Apr. 2019

    work page 2061

  35. [35]

    Joint Content Placement and Storage Allocation in C-RANs for IoT Sensing Service,

    J. Yao and N. Ansari, “Joint Content Placement and Storage Allocation in C-RANs for IoT Sensing Service,” IEEE Internet of Things Journal , vol. 6, no. 1, pp. 1060–1067, Feb 2019

    work page 2019

  36. [36]

    Content Caching and Distribution in Smart Grid Enabled Wireless Networks,

    X. Huang and N. Ansari, “Content Caching and Distribution in Smart Grid Enabled Wireless Networks,” IEEE Internet of Things Journal , vol. 4, no. 2, pp. 513–520, Apr. 2017

    work page 2017

  37. [37]

    CaaS: Caching as a Service for 5G Networks,

    X. Li, X. Wang, K. Li, and V . C. M. Leung, “CaaS: Caching as a Service for 5G Networks,” IEEE Access , vol. 5, pp. 5982–5993, 2017

    work page 2017

  38. [38]

    Relay- Assisted Multiple Access With Full-Duplex Multi-Packet Reception,

    N. Pappas, M. Kountouris, A. Ephremides, and A. Traganitis, “Relay- Assisted Multiple Access With Full-Duplex Multi-Packet Reception,” IEEE Transactions on Wireless Communications , vol. 14, no. 7, pp. 3544–3558, July 2015

    work page 2015

  39. [39]

    The stability of a queue with non-independent inter- arrival and service times,

    R. M. Loynes, “The stability of a queue with non-independent inter- arrival and service times,” Mathematical Proceedings of the Cambridge Philosophical Society , vol. 58, no. 3, pp. 497–520, 1962

    work page 1962

  40. [40]

    Walrand, Communication Networks: A First Course

    J. Walrand, Communication Networks: A First Course . 2nd ed., New York, NY , USA,: McGraw-Hill, 1998. 13

    work page 1998