Abstract: A node to which message channels are connected is considered in a communication network. Traffic sources and traffic sinks are connected to the other end of these message channels. The transmission power of the traffic sources is unknown, and the traffic sources are not all always active. A number of message channels may be connected to one node. A protocol which has a window mechanism for controlling the number of messages which a traffic source may send without acknowledgement is used for reliable message transmission. In the event of reception overload, messages may be rejected in such a node. The present invention controls the window size on the basis of the number of received messages, and not at fixed time intervals. No measurements are carried out for inactive message channels, which are thus not associated with any computation capacity. Message channels which always completely fill their windows are controlled more frequency than message channels which do not completely fill their windows.

Abstract: A node to which message channels are connected is considered in a communication network. Traffic sources and traffic sinks are connected to the other end of these message channels. The transmission power of the traffic sources is unknown, and the traffic sources are not all always active. A number of message channels may be connected to one node. A protocol which has a window mechanism for controlling the number of messages which a traffic source may send without acknowledgement is used for reliable message transmission. In the event of reception overload, messages may be rejected in such a node. The present invention controls the window size on the basis of the number of received messages, and not at fixed time intervals. No measurements are carried out for inactive message channels, which are thus not associated with any computation capacity. Message channels which always completely fill their windows are controlled more frequency than message channels which do not completely fill their windows.