Abstract: A method is provided in which at least one of the following parameters is first determined for a transmitter: parameter representative of the presence of the message oriented memory management feature in the receiver; number of message storage locations provided in the receiver; size of the message storage locations provided in the receiver. A receiver transmits to the transmitter the number of information units still permitted under time control or under event control, the receiver ascertaining this number from the number of messages received or from the number of message storage locations which are still free. The transmitter ascertains the number of messages that can still be transmitted to the receiver from the transmitted number of information units which are still permitted.

Abstract: A service indicator SI field is used for load sharing in SS7 networks, in addition to the service link selection SLS field. If there are only two links or connections between two points of the SS7 network, load sharing can also be performed on the basis of the SI field only.

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: Method to support a plurality of checksum algorithms in a first network node (A), according to which a communication relationship is established between the first network node (A) and a second network node (B), the initialization of which is effected by the first network node (A) in that in a first step a first checksum algorithm is selected by the first network node (A), in a second step the selected checksum algorithm is signaled to the second d network node (B) by the first network node (A), in a third step the communication relationship is established using the selected checksum algorithm if the initialization of the communication relationship by means of the selected checksum algorithm is accepted by the second network node (B) or in the third step a further checksum algorithm is selected by the first network node (A) if the initialization of the communication relationship by means of the selected checksum algorithm is rejected or ignored by the second network node (B), the second and third step then bei

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.