Summary: The design and analysis of congestion control mechanisms for modern data networks such as the Internet is a challenging problem. Mathematical models at various levels have been introduced in an effort to provide insight to some aspects of this problem. A model introduced and studied by Roberts and Massoulié aims to capture the dynamics of document arrivals and departures in a network where bandwidth is shared fairly amongst flows that correspond to continuous transfers of individual elastic documents. Here we consider this model under a family of bandwidth sharing policies introduced by Mo and Walrand. With generally distributed interarrival times and document sizes, except for a few special cases, it is an open problem to establish stability of this stochastic flow level model under the nominal condition that the average load on each resource is less than its capacity. As a step towards the study of this model, in a separate work [Ann. Appl. Probab. 19, No. 1, 243–280 (2009; Zbl 1169.60025)], we introduced a measure valued process to describe the dynamic evolution of the residual document sizes and proved a fluid limit result: under mild assumptions, rescaled measure valued processes corresponding to a sequence of flow level models (with fixed network structure) are tight, and any weak limit point of the sequence is almost surely a solution of a certain fluid model. The invariant states for the fluid model were also characterized in [loc. cit.]. In this paper, we review the structure of the stochastic flow level model, describe our fluid model approximation and then give two interesting examples of network topologies for which stability of the fluid model can be established under a nominal condition. The two types of networks are linear networks and tree networks.
For the entire collection see [Zbl 1159.60005].