Before revision:   Relating the system performance to properties of a specific random graph model, we establish a content placement strategy which again maximizes system performance , provided storage space per peer grows unboundedly, although arbitrarily slowly, with system size.
After revision:  Under this scaling, we establish that storage space per peer must necessarily grow unboundedly if bandwidth utilization is to be maximized. Relating the system performance to properties of a specific random graph model, we establish a content placement strategy which again maximizes system performance , provided storage space per peer grows unboundedly, although arbitrarily slowly, with system size.