Data flow control
AssigneeTelefonaktiebolaget L M Ericsson
InventorJan Kullander
Life of this patent
Estimating the term…
Loading patent…
AssigneeTelefonaktiebolaget L M Ericsson
InventorJan Kullander
Estimating the term…
A method for monitoring and controlling the data flow in a packet data net or a datagram net comprising lines and nodes, the lines via nodes connecting by the network comprised terminals between which traffic takes place in the form of data packets or datagram. Every line and every node comprises a process preceded by a certain queue of data packets/datagram. Data packets are sent in to the net from the terminal for with a given frequency during a given time interval. If during this interval no throttling order is received from the following process, the frequency is increased by a given factor. This occurs successively until a given maximum frequency is reached. If on the other hand a throttling order is received during the interval, the frequency is instead reduced by a given factor which also occurs successively until no throttling order is received during an interval.
A method for monitoring and controlling dataflow in a packet data network or a datagram network comprising a plurality of lines and a plurality of nodes, the lines connecting a plurality of terminals with each other via the nodes, the lines and nodes forming paths through the network, between which terminals flow data packets/datagrams, every line and every node respectively comprising a line process and a routing process respectively preceded by a queue of data packets/datagrams and loading terminals among the plurality of terminals sending in data packet/datagrams into the network with a respective frequency during a respective time interval, comprising the steps of sending data packets/datagrams directly into the network without preceding control-packets with frequencies which successively increase at a predetermined rate for successive elapsed time intervals during which not throttling order was received from the line processes and routing processes, and sending data packets/datagrams with frequencies which successively decrease at a second predetermined rate for elapsed time intervals during which at least one throttling order has been received from the line processes and the routing processes.
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.
Dependencies are inferred from the claim text.