  The traditional notion of capacity studied in the context of memoryless
network communication builds on the concept of block-codes and requires that,
for sufficiently large blocklength n, all receiver nodes simultaneously decode
their required information after n channel uses. In this work, we generalize
the traditional capacity region by exploring communication rates achievable
when some receivers are required to decode their information before others, at
different predetermined times; referred here as the "time-rate" region. Through
a reduction to the standard notion of capacity, we present an inner-bound on
the time-rate region. The time-rate region has been previously studied and
characterized for the memoryless broadcast channel (with a sole common message)
under the name "static broadcasting".
