... On sojourn times for an infinite-server system in random environment and its application to processor sharing systems Manfred Brandt Konrad-Zuse-Zentrum f¨r Informationstechnik Berlin ... random environment As (A2) implies (A1) for this infinite-server system, we obtain immediately results for the sojourn time of an arbitrary arriving request by using the results of Section for the ... S For M/GI/1 − P S and M/M/SDP S, the lower and upper bounds for ˚(τ )/τ )k ] in case of k ∈ N, cf (4.28), are given in [CVB] and [BB2], E[(V respectively ˚ For M/GI/SDP S, the upper bound for...