This paper describes an approach for the analysis of multistage switching networks with a variety of buffer sharing strategies. The approach allows non-uniform bursty traffic, and it features a computational complexity which is independent of the buffer size. We decompose the complex shared buffer analysis problem into an equivalent dedicated buffer problem through an iterative series of buffer size approximations. Results are compared with simulations and are used to quantify the performance differences of several buffer sharing policies.