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:  Relating the system performance to properties of a specific random graph model, we establish a content placement strategy and a request acceptance policy which jointly maximize bandwidth utilization , provided storage space per peer grows unboundedly, although arbitrarily slowly, with system size.