  Performance assessment and optimization for networks jointly performing
caching, computing, and communication (3C) has recently drawn significant
attention because many emerging applications require 3C functionality. However,
studies in the literature mostly focus on the particular algorithms and setups
of such networks, while their theoretical understanding and characterization
has been less explored. To fill this gap, this paper conducts the asymptotic
(scaling-law) analysis for the delay-outage tradeoff of noise-limited wireless
edge networks with joint 3C. In particular, assuming the user requests for
different tasks following a Zipf distribution, we derive the analytical
expression for the optimal caching policy. Based on this, we next derive the
closed-form expression for the optimum outage probability as a function of
delay and other network parameters for the case that the Zipf parameter is
smaller than 1. Then, for the case that the Zipf parameter is larger than 1, we
derive the closed-form expressions for upper and lower bounds of the optimum
outage probability. We provide insights and interpretations based on the
derived expressions. Computer simulations validate our analytical results and
insights.
