Data flow control

Claim 3

A method according to claim 1, wherein the at least one throttling order comprises one of a returned data packet/datagram and a congestion packet.

Claim 4

A method according to claim 1, wherein every line process or routing process checks the queue length of following line processes or routing processes in the path of a packet through the network and each line process or routing process is given at least one of a maximum allowable queue length and a threshold value for the queue length whereby the reached maximum allowable queue length gives rise to a throttling order in the form of a returned data packet/datagram, and where the reaching of the threshold value gives rise to the generation of a congestion packet which is sent towards the loading terminals.

Claim 5

A method according to claim 3, wherein when the length of a line process or routing process reaches the maximum allowable queue length or the threshold value, a throttling order only is sent from such line process or routing process to the terminals which load such process.

Claim 6

A method according to claim 3, wherein the threshold value is adjustable.

Claim 7

A method according to claim 5, wherein the threshold value is adjusted to be approximately 20.

Claim 8

A method according to claim 1, wherein a throttling order in the form of one of a congestion packet and a returned packet is given priority in the queues of the line processes and the routing processes, respectively, which the packet has to pass on its way to the loading terminal.

Claim 9

A method according to claim 1, wherein a frequency reduction factor per received throttling order is the same as a frequency increasing factor when no throttling is received.

Claim 10

A method according to claim 1, wherein a frequency reduction factor per received throttling order is different from a frequency increasing factor when no throttling is received.

Claim 11

A method according to claim 1, wherein a frequency reduction factor per received throttling order and a frequency increasing factor when no throttling order is received are adjustable and approximately between 1-12%.

Claim 12

A method according to claim 10, wherein the frequency reduction factor and the frequency increasing factor are approximately 10%.

Claim 13

A method according to claim 1, wherein the respective time interval is the same for every one of the plurality of terminals.

Claim 14

A method according to claim 1, wherein the respective time interval is different for different ones of the plurality of terminals.

Claim 15

A method according to claim 1, wherein one of the plurality of terminals is given a predetermined priority through the choice of one of a frequency reduction factor per received throttling order and a frequency increasing factor when no throttling order is received.

Claim 16

A method according to claim 14, wherein the one of the plurality of terminals is given at least one of a frequency reduction factor and a frequency increasing factor which differs from the frequency reduction factors and frequency increasing factors of others of the plurality of terminals in order to obtain a higher or a lower priority.

Claim 17

A method according to claim 1, wherein an occupational degree is given by a number of arriving/datagrams per unit time divided by a number of packets/datagrams per unit time that a line process or a routing process can handle and a congestion packet is dispatched when the occupational degree of a line process or a routing process reaches more than 0.9.

Claim 18

A packet data net or datagram net comprising a plurality of lines and a plurality of nodes, the lines connecting a plurality of terminals via the nodes for sending data packets/datagram between the terminals, every line and every node comprising a process, comprising a queue space belonging to the process, for monitoring and controlling the packet traffic in the net in such a way that terminals loading such processes associated with nodes and lines can selectively be throttled, each terminal comprising a timer which is set to a certain time interval, a counter for controlling the number of data packets dispatched during the time interval and means for dispatching data packets with a certain given frequency, the packets sent away from ones of the plurality of terminals are provided with an indication of an address and whereby in every process the queue length at the following process in the direction of transmission of a packet is examined, wherein a maximum value of queue length and a threshold value of the queue length are given, the reaching of the maximum value of queue length gives rise to returning of incoming packets and where reaching of the threshold value gives rise to a throttling order, the process comprising means for generation of a congestion packet and means for providing a return packet with a congestion indication, each terminal being so equipped that for each time interval during which no throttling order has been received, the frequency is increased by a first given factor until a certain maximum frequency is reached and, for each time interval during which a throttling order has been received, the frequency is reduced by a second given factor per throttling order.

Claim 19

A packet data net or datagram net comprising a plurality of lines and a plurality of nodes, the lines connecting a plurality of terminals via the nodes for sending data packets/datagram between the terminals, every line and every node comprising a process, comprising a queue space belonging to the process, for monitoring and controlling the packet traffic in the net in such a way that terminals loading such processes associated with nodes and lines can selectively be throttled, each terminal comprising a timer which is set to a certain time interval, a counter for controlling the number of data packets dispatched during the time interval and means for dispatching data packets with a certain given frequency, the packets sent away from ones of the plurality of terminals are provided with an indication of an address and whereby in every process the queue length at the following process in the direction of transmission of a packet is examined, wherein a maximum value of queue length and a threshold value of the queue length are given, the reaching of the maximum value of queue length gives rise to returning of incoming packets and where reaching of the threshold value gives rise to a throttling order, the process comprising means for generation of a congestion packet and means for providing a return packet with a congestion indication, each terminal being so equipped that for each time interval during which no throttling order has been received, the frequency is increased by a first given factor until a certain maximum frequency is reached and, for each time interval during which a throttling order has been received, the frequency is reduced by a second given factor per throttling order.