Expert system method for performing window protocol-based data flow analysis within a data communication network
First Claim
1. An expert system method for analysing the window protocol-based data flow in a data communications network over which data packets are transmitted, said data packets including a data portion and a header portion, comprising:
- setting a packet transmission window to have a maximum quantity of N packets which can be transmitted within an interval from a node in the network;
setting a queued packet threshold value to a quantity of C packets which may be held in a queue during an interval at the node;
defining a data flow efficiency state variable S as a binary number having at least three bits, with a first bit B1;
counting the number of packets transmitted from the node during a measurement interval and setting B1 if the number of packets transmitted is equal to N;
setting B2 if any packet is held in the queue during the measurement interval;
setting B3 if more than C packets are held in the queue during the measurement interval;
determining the value of said data flow efficiency state variable S from values of B1, B2 and B3 set by said counting and setting steps;
accessing a knowledge base containing network problem determination recommendations which are accessible with said value of said data flow efficiency state variable S;
outputting a problem determination recommendation for optimizing data flow efficiency in said network in response to accessing said knowledge base with said value of S.
1 Assignment
0 Petitions
Accused Products
Abstract
An expert system method is disclosed for analyzing window protocol-based data flows in a data communications network. The method includes the use of a data flow efficiency state variable S which is a binary number having at least three bits which reflect the number of packets transmitted by a node, the queuing of packets within a node, and the congestion of the packets within the node or in the node connected to the node of interest. After having assigned a value to the state variable, a knowledge base is accessed containing network problem determination recommendations for optimizing data flow efficiency within the network.
123 Citations
21 Claims
-
1. An expert system method for analysing the window protocol-based data flow in a data communications network over which data packets are transmitted, said data packets including a data portion and a header portion, comprising:
-
setting a packet transmission window to have a maximum quantity of N packets which can be transmitted within an interval from a node in the network; setting a queued packet threshold value to a quantity of C packets which may be held in a queue during an interval at the node; defining a data flow efficiency state variable S as a binary number having at least three bits, with a first bit B1; counting the number of packets transmitted from the node during a measurement interval and setting B1 if the number of packets transmitted is equal to N; setting B2 if any packet is held in the queue during the measurement interval; setting B3 if more than C packets are held in the queue during the measurement interval; determining the value of said data flow efficiency state variable S from values of B1, B2 and B3 set by said counting and setting steps; accessing a knowledge base containing network problem determination recommendations which are accessible with said value of said data flow efficiency state variable S; outputting a problem determination recommendation for optimizing data flow efficiency in said network in response to accessing said knowledge base with said value of S. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
-
8. An expert system method for analyzing the window protocol-based data flow in a data communications network over which data packets are transmitted, said data packets including a data portion and a header portion, comprising:
-
setting a packet transmission window to have a maximum quantity of N packets which can be transmitted within an interval from a terminal in the network; setting a queued packet threshold value to a quantity of C packets which may be held in a queue during an interval at the terminal; defining a data flow efficiency state variable S as a binary number having at least three bits, with a first bit B1, a second bit B2 and a third bit B3; receiving at the terminal during a first interval, a plurality of Ml packets which is less than N packets from a source input; transmitting from the terminal during a second interval said M1 packets over said network to a destination; receiving at the terminal during said second interval, a plurality of M2 packets which is more than N packets from said source input; transmitting from said terminal during a third interval, N of said M1 packets over said network to said destination and queuing M2-N packets at said terminal; marking during said third interval an N+1st packet of said queued packets as being held in said queue; marking during said third interval said N+1st packet of the queued packets as being congested in said queue if there are more than C packets in said queue; counting the number of packets transmitted from the terminal during a measurement period including a plurality of intervals and setting B1 if the number of packets transmitted during an interval is equal to N; setting B2 if any packet is held in the queue during the measurement period; setting B3 if more than C packets are held in the queue during any interval in the measurement period; determining the value of said data flow efficiency state variable S from values of B1, B2 and B3 set by said counting and setting steps; accessing a knowledge base containing network problem determination recommendations which are accessible with said value of said data flow efficiency state variable S; outputting a problem determination recommendation for optimizing data flow efficiency in said network in response to accessing said knowledge base with said value of S. - View Dependent Claims (9, 10, 11, 12, 13, 14)
-
-
15. An expert system method for analysing the window protocol-based data flows in a data communications network over which plural data packets are transmitted during a transmission, said analyzing being performed over a measurement interval including a plurality of said transmission intervals, said data packets including a data portion and a header portion, comprising:
-
setting a packet transmission window to have a maximum quantity of N packets which can be transmitted within a transmission interval from a node in the network; setting a queued packet threshold value to a quantity of C packets which may be held in a queue during a transmission interval at the node; defining a data flow efficiency state variable S as a binary number having at least three bits, with a first bit B1, a second bit B2 and a third bit B3; counting the number of packets transmitted from the node during a measurement interval as a packet count and setting B1 if the number of packets transmitted in any transmission interval is equal to N; setting B2 if any packet is held in the queue during the measurement interval; setting B3 if more than C packets are held in the queue during any transmission interval in the measurement interval; determining an initial value of said data flow efficiency state variable S from values of B1, B2 and B3 set by said counting and setting steps; selectively modifying said value of said data flow efficiency state variable S to a modified value based on said packet count; accessing a knowledge base containing network problem determination recommendations which are accessible with said modified value of said data flow efficiency state variable S; outputting a problem determination recommendation for optimizing data flow efficiency in said network in response to accessing said knowledge base with said modified value of S. - View Dependent Claims (16, 17, 18, 19, 20, 21)
-
Specification