 Busy-period branching equation

In an M/G/1 queue, arrivals during the first service generate independent subtrees of work. Conditional on service time $S=s$, the number of descendants is Poisson with mean $\lambda s$. Thus $B\stackrel{d}{=}S+{\sum }_{j=1}^{N(S)}{B}_j$, with independent descendant busy periods. Conditioning and the Poisson generating function give the displayed transform equation wherever its moment-generating functions are finite. Taking expectations yields $\mathbb{E}B=\mathbb{E}S+\lambda \mathbb{E}S\mathbb{E}B$ in the stable regime.