Abstract: In a connection between an origin node (S, VS1) and a destination node (D, VD2), data traffic is policed by a policing device (POL) so that traffic descriptors in a traffic contract between subscriber and network provider and rules specified in standards have to be respected by the origin node (S, VS1), unless data will be discarded by the policer (POL). To control its cell transmit rate, the origin node (S, VS1) regularly transmits resource management cells (FRM) which are returned by nodes along the path to the destination (D, VD2). Once reflected, the resource management cells (FRM) become backward resource management cells (BRM). Each time such a backward resource management cell (BRM) passes the policing device (POL), the policer determines a scheduled rate value (R.sub.-- first, R.sub.-- last) and associated scheduled time value (T.sub.-- first, T.sub.-- last) and memorises both values in a list of scheduled rate values.

Abstract: As long as a queuing network node (Q) is not congested, it returns to the source terminals (S1, S2, S3, S4) transmitting data packets through this queuing network node (Q), upper packet rate values (ER) which are proportional to the actual packet rate values (CCR). The transmit rate of a source terminal (S1, S2, S3, S4) upon receipt of the upper packet rate value (ER), is controlled so that it stays below this upper packet rate value. In this way, the queuing network node (Q) allows its aggregate input rate to increase in a controlled, smooth way and does not rely on the sources (S1, S2, S3, S4) themselves. Once the queuing network node (Q) gets congested a fair share algorithm is used to determine which source terminals have to decrease their transmit rates and which source terminals are allowed to further increase their transmit rates.