WO2020259113A1

WO2020259113A1 - Network performance measurement device and method

Info

Publication number: WO2020259113A1
Application number: PCT/CN2020/090077
Authority: WO
Inventors: 周先涛
Original assignee: 中兴通讯股份有限公司
Priority date: 2019-06-27
Filing date: 2020-05-13
Publication date: 2020-12-30
Also published as: CN112152865A; CN112152865B

Abstract

Disclosed in embodiments of the present application are a network performance measurement device and method. One type of network performance measurement device comprises: a processor and 2N counters. The 2N counters comprise N counters count An and N counters Count Bn, N being an even multiple of 2 and n being a natural number ranging from 0 to N-1. There are N coloring markings for packets. One counter Count An and one counter Count Bn correspondingly calculate the number of packets with one coloring marking. A coloring period is T and a reading period is N*T. The processor is used for including the packets into the corresponding N Count An according to the coloring markings of the packets in an odd number of periods N*T, and for including the packets into the corresponding N Count Bn according to the coloring markings of the packets in an even number of periods N*T.

Description

Network performance measuring device and method

Cross references to related applications

This application is filed based on the Chinese patent application with the application number 201910564926.6 and the filing date on June 27, 2019, and claims the priority of the Chinese patent application. The entire content of the Chinese patent application is hereby incorporated into this application by way of introduction.

Technical field

The embodiments of this application relate to but are not limited to the field of PTN (Packet Transport Network)/IPRAN (IP Radio Access Network, IP radio access network), and more specifically to a network performance measurement device and method.

Background technique

Today, most service provider networks carry content that is highly sensitive to packet loss, delay, and jitter. In view of this situation, service providers need methods and tools to monitor and measure network performance to continuously improve customer experience. On the other hand, it provides useful information management for improving network quality (for example, isolating network problems, troubleshooting, etc.).

A large amount of work related to operation, management and maintenance (OAM, Operation Administration and Maintenance), including performance monitoring technology, is completed by the Standards Organization (SDO, Standards Organization). Among them, the IPPM (IP Performance Metrics) working group has been committed to the formulation of standards for network traffic measurement and analysis, and has proposed multiple RFCs (Request For Comments) and Internet drafts, involving all aspects of network traffic measurement and analysis. , Including connectivity, one-way delay and packet loss, two-way delay and packet loss, delay jitter, etc. The main focus of this working group is active measurement technology, which has some limitations in application. For example, one-way services, different paths between detection packets and actual services, and so on.

Among them, RFC8321 provides an alternate coloring method for passive performance monitoring. As shown in Figure 1, this method does not use additional probe messages and directly colorizes user messages periodically at the source node. The destination node resumes coloring, and the number of business packets sent and received can be monitored on the entire forwarding path. For each service packet loss performance, the router needs to provide two counters, Counter A and Counter B. Counter A counts the packets carrying color A, and Counter B counts the packets carrying color B. In the coloring cycle B, the stable count of the previous coloring Counter A can be read; while in the coloring A cycle, the stable count of the previous coloring Counter B can be read. By comparing the performance values of the source, sink, and intermediate nodes in the same cycle, the end-to-end packet loss performance or the packet loss performance of a certain segment of the forwarding path can be calculated.

However, based on the packet loss performance monitoring implemented by RFC8321, depending on the coloring, each router that needs to be monitored is allocated two counters Count A and Count B. In order to obtain a stable count, when reading the A cycle count, the Count A count needs to be stable, and it can only be read around the middle time point of the B cycle. The A cycle message may not be over too early, and the next A cycle too late The messages start counting again. For long periods, such as 10s, 30s or higher periods, stable counting time points are easier to obtain; but for shorter periods, such as 1s or millisecond monitoring periods, the counter stable interval is very short, which is difficult Obtain.

Among them, RFC8321 also provides a coloring scheme for delay measurement. The source node colorizes the first packet of each cycle, records the coloring time point, and restores coloring at the destination node. On the entire forwarding path, colored packets can be extracted and time points can be recorded. When all routers on the path are time synchronized, the end-to-end delay or the delay performance of a certain segment of the forwarding path can be calculated by comparing the time values of the source, sink, and intermediate nodes in the same cycle.

However, the delay performance monitoring based on RFC8321 also has the same problem of obtaining stable time points as the packet loss performance. In addition, for scenarios with severe packet loss, since there is only one colored delay packet per cycle, it is possible that colored delay packets in multiple cycles are discarded, resulting in no delay data for a long time. And for long-period monitoring scenarios, because the number of colored delay message samples is relatively small, performance data such as the maximum delay, minimum delay, average delay, and jitter obtained by statistics have large deviations from actual business conditions.

Summary of the invention

In view of this, an embodiment of the present application provides a network performance measurement device, including: a processor and 2N counters, the 2N counters include N counters Count An and N counters Count Bn, where N is 2. Even times, the value of n is a natural number from 0 to N-1; there are N kinds of coloring marks for the message, a counter Count An and a counter Count Bn corresponding to calculate the number of a kind of coloring mark message; the coloring cycle is T, read Take the cycle as N*T; the processor is used to count the corresponding N Count An according to the coloring mark of the message in an odd number of N*T cycles; in an even number of N*T cycles, according to the report The coloring marks of the text are counted in the corresponding N Count Bn in turn.

An embodiment of the present application also provides a network performance measurement device, including: a processor and 2N counters, the 2N counters include N counters Count An and N counters Count Bn, where N is an even multiple of 2. The value of n is a natural number from 0 to N-1; there are two types of coloring tags for the message: A and B; the coloring cycle is T, and the reading cycle is N*T; a counter Count An and a counter Count Bn are corresponding to a 2T The number of colored marking messages in a cycle; the processor is configured to count the messages colored as A in the period -T/2—3T/2 into the corresponding counter Count in an odd number of N*T cycles A0; the packets colored as B within T/2～5T/2 are counted into the corresponding counter Count A1; the packets colored as A within the time 3T/2～7T/2 count into the corresponding counter Count A2; 5T/ Packets colored as B within 2-9T/2 are counted into the corresponding counter Count A3; and so on until the end of the reading cycle; within an even number of N*T cycles, colored within -T/2-3T/2 The message that is A is counted in the corresponding counter Count B0; the message that is colored as B within T/2~5T/2 is counted into the corresponding counter Count B1; the message that is colored as A within 3T/2~7T/2 The message is counted into the corresponding counter Count B2; the message colored as B within 5T/2 to 9T/2 is counted into the corresponding counter Count B3; and so on until the end of the reading cycle.

An embodiment of the present application also provides a network performance measurement device, including: a processor and N counters, the coloring period is T, and the delay coloring packets within a period T are expanded to N; where N is 2 or 2. Even times; there are N kinds of coloring marks for the message; a counter Count corresponds to marking the coloring time of a coloring mark message; the processor is used for the first one at the beginning of every T/N cycle in the T period The message is colored, and the coloring time of the message is counted into the corresponding counter Count.

An embodiment of the present application also provides a network performance measurement device, including: a processor and N counters, the coloring period is T, and the delay coloring packets within a period T are expanded to N; where N is 2 or 2. Even times; there are N kinds of coloring marks for the message; a counter Count is arranged according to the period T in order to mark the receiving time of a coloring mark message; the processor is used for receiving when the coloring period is lower than the reading period When the receiving time of a colored message is written (receiving time/reading period)/coloring cycle, then round down to obtain the corresponding counter, and the receiving time of receiving the colored message is counted into the corresponding counter; When the coloring period is the same as the reading period, write the receiving time of a coloring message (receiving time/reading period)*N/coloring period, and then round down to get the corresponding counter, which will receive the The receiving time of the colored message is included in the corresponding counter.

The embodiment of the present application also provides a network performance measurement method, which is applied to a network performance measurement device. The network performance measurement device includes a processor and 2N counters. The 2N counters include N counters Count An and N counters. The counter Count Bn, the N is an even multiple of 2, and n is a natural number from 0 to N-1; there are N types of coloring tags for the message, and a counter Count An and a counter Count Bn respectively calculate a coloring tag report The number of messages; the coloring cycle is T, and the reading cycle is N*T; the processor counts the corresponding N Count An according to the coloring flag of the message in an odd number of N*T cycles; in an even number of N *In the T period, the corresponding N Count Bn are counted in sequence according to the coloring mark of the message.

The embodiment of the present application also provides a network performance measurement method, which is applied to a network performance measurement device. The network performance measurement device includes a processor and 2N counters. The 2N counters include N counters Count An and N counters. The counter Count Bn, the N is an even multiple of 2, and the value of n is a natural number from 0 to N-1; the coloring flag of the message has two types: A and B; the coloring period is T, and the reading period is N*T; A counter Count An and a counter Count Bn correspondingly calculate the number of a coloring flag message in a 2T cycle; the processor colorizes -T/2—3T/2 within an odd number of N*T cycles as The message of A is counted into the corresponding counter Count A0; the message colored as B within T/2～5T/2 counts into the corresponding counter Count A1; the message colored as A within 3T/2～7T/2 Count into the corresponding counter Count A2; messages colored as B within 5T/2 to 9T/2 are counted into the corresponding counter Count A3; and so on until the end of the reading cycle; in an even number of N*T cycles, the- The messages colored as A within T/2—3T/2 are counted into the corresponding counter Count B0; the messages colored as B within T/2~5T/2 are counted into the corresponding counter Count B1; 3T/2~ Messages colored as A within 7T/2 are counted into the corresponding counter Count B2; messages colored as B within 5T/2 to 9T/2 are counted into the corresponding counter Count B3; and so on until the end of the reading cycle.

The embodiment of the present application also provides a network performance measurement method, which is applied to a network performance measurement device,

The network performance measurement device includes: a processor and N counters, the coloring period is T, and the delay coloring message is expanded to N in a period T; the N is 2 or an even multiple of 2; a counter Count corresponds to a mark The coloring time of a coloring flag message; the processor colorizes the first message starting every T/N cycle within T cycles, and counts the coloring time of the message into the corresponding counter Count .

The embodiment of the present application also provides a network performance measurement method, which is applied to a network performance measurement device. The network performance measurement device includes a processor and N counters, the coloring period is T, and the coloring message is delayed within a period T. Expanded to N; the N is 2 or an even multiple of 2; a counter Count is arranged in sequence according to the period T to mark the receiving time of a coloring flag message; when the coloring period is lower than the reading period, the processor will The receiving time of receiving a coloring message is written (receiving time/reading period)/coloring period, and then rounding down to get the corresponding counter, and the receiving time of receiving the coloring message is counted into the corresponding counter ; When the coloring cycle is consistent with the read cycle, the processor writes the receiving time of a coloring message (receiving time/reading cycle)*N/coloring cycle, and then rounds down to get the corresponding counter Calculate the receiving time of receiving the colored message into the corresponding counter.

Other features and advantages of the present application will be described in the following description, and partly become obvious from the description, or understood by implementing the present application. The purpose and other advantages of the application can be realized and obtained through the structures specifically pointed out in the description, claims and drawings.

Description of the drawings

The accompanying drawings are used to provide a further understanding of the technical solution of the present application, and constitute a part of the specification. Together with the embodiments of the present application, they are used to explain the technical solution of the present application, and do not constitute a limitation to the technical solution of the present application.

Figure 1 is a schematic diagram of the existing RFC8321 alternate coloring;

2 is a schematic structural diagram of a network performance measurement device provided by an embodiment of this application;

3 is a schematic structural diagram of a network performance measurement device provided by another embodiment of this application;

4 is a schematic structural diagram of a network performance measurement system provided by an embodiment of this application;

5 is a schematic diagram of packet coloring in another embodiment of the application;

FIG. 6 is a schematic diagram of packet coloring in another embodiment of the application;

FIG. 7 is a schematic structural diagram of a network performance measurement device provided by an embodiment of this application;

FIG. 8 is a schematic structural diagram of a network performance measurement device provided by an embodiment of this application;

FIG. 9 is a schematic structural diagram of a network performance measurement system provided by an embodiment of this application;

10 is a schematic diagram of packet coloring in another embodiment of the application;

FIG. 11 is a schematic flowchart of a network performance measurement method provided by an embodiment of this application;

FIG. 12 is a schematic flowchart of a network performance measurement method provided by another embodiment of this application;

FIG. 13 is a schematic flowchart of a network performance measurement method provided by another embodiment of this application;

FIG. 14 is a schematic flowchart of a network performance measurement method provided by another embodiment of this application;

15 is a schematic flowchart of a method for measuring network performance according to another embodiment of this application;

FIG. 16 is a schematic flowchart of a method for measuring network performance according to another embodiment of this application.

Detailed ways

In order to make the purpose, technical solutions, and advantages of the present application clearer, the embodiments of the present application will be described in detail below in conjunction with the accompanying drawings. It should be noted that the embodiments in this application and the features in the embodiments can be combined with each other arbitrarily if there is no conflict.

The steps shown in the flowchart of the drawings may be executed in a computer system such as a set of computer-executable instructions. And, although a logical sequence is shown in the flowchart, in some cases, the steps shown or described may be performed in a different order than here.

The main idea of the embodiments of this application is to overcome the instability of short-period test counting in the prior art by expanding the number of coloring marks and the number of counters, and the insufficient number of long-period samples leads to large calculation deviations, etc., thereby improving the performance data based on RFC8321 Effectiveness and reliability.

FIG. 2 is a schematic structural diagram of a network performance measurement device provided by an embodiment of the application. As shown in FIG. 2, the network performance measurement device includes:

Processor and 2N counters, the 2N counters include N counters Count An and N counters Count Bn, where N is an even multiple of 2, and n is a natural number from 0 to N-1; coloring of packets There are N types of tags, a counter Count An and a counter Count Bn correspondingly calculate the number of a coloring tag message; the coloring cycle is T, and the reading cycle is N*T;

The processor is configured to sequentially count the corresponding N Count An according to the coloring mark of the message in an odd number of N*T cycles; and sequentially count the corresponding N Count An according to the coloring mark of the message in an even number of N*T cycles The corresponding N Count Bn.

Among them, the network performance measurement device can be set in routers, gateways, switches and other equipment.

FIG. 3 is a schematic structural diagram of a network performance measurement device provided by another embodiment of the application. As shown in FIG. 3, the network performance measurement device includes:

Processor and 2N counters, the 2N counters include N counters Count An and N counters Count Bn, where N is an even multiple of 2, and n is a natural number from 0 to N-1; coloring of packets There are two types of markers: A and B; the coloring cycle is T, and the reading cycle is N*T; a counter Count An and a counter Count Bn correspondingly count the number of a coloring tag message in a 2T cycle;

The processor is configured to count the packets colored as A within the period of -T/2—3T/2 into the corresponding counter Count A0 within an odd number of N*T cycles; within the period of T/2—5T/2 Messages colored as B are counted in the corresponding counter Count A1; messages colored as A within 3T/2～7T/2 are counted into the corresponding counter Count A2; messages colored as B within 5T/2～9T/2 The message is counted into the corresponding counter Count A3; and so on until the end of the reading cycle;

In an even number of N*T cycles, the packets colored as A within -T/2—3T/2 are counted into the corresponding counter Count B0; the packets colored as B within T/2~5T/2 are counted Enter the corresponding counter Count B1; the packets colored as A within 3T/2～7T/2 are counted into the corresponding counter Count B2; the packets colored as B within 5T/2～9T/2 are counted into the corresponding counter Count B3; and so on until the end of the read cycle.

Wherein, the mark A is 0, and the mark B is 1.

FIG. 4 is a schematic structural diagram of a network performance measurement system provided by an embodiment of the application. As shown in FIG. 4, the system includes:

The source node and sink node or intermediate node of network management and transmission message,

The source node includes: a first processor and 2N counters;

The sink node or intermediate node includes: a second processor and 2N counters;

The 2N counters include N counters Count An and N counters Count Bn, where N is an even multiple of 2, and n is a natural number from 0 to N-1; there are N types of coloring tags for packets, one counter Count An and a counter Count Bn respectively calculate the number of a coloring mark message; the coloring cycle is T, and the reading cycle is N*T;

The first processor is configured to color and send the message; in an odd number of N*T cycles, the corresponding N Count An are counted in sequence according to the coloring flag of the message; in an even number of N*T cycles , Count the corresponding N Count Bn in turn according to the coloring mark of the message;

The second processor is configured to receive a message; in an odd number of N*T cycles, the corresponding N Count An is counted in sequence according to the coloring flag of the message; in an even number of N*T cycles, according to the message The colored marks of are counted in the corresponding N Count Bn in turn;

The network management system is configured to read the counter data of the source node and the sink node or the intermediate node at an intermediate point of every N*T cycles, and calculate the packet loss rate.

Wherein, the network performance measurement device may be provided in the above-mentioned node.

FIG. 5 is a schematic diagram of packet coloring in another embodiment of the application. In this embodiment, the coloring period is T and the reading period is 4T. Each node that transmits data can be equipped with a network performance measurement device, and each network performance measurement device is provided with 8 counters (CountA0～CountA3, CountB0～ CountB3).

As shown in FIG. 5, in this embodiment, there are four kinds of colored marks: 0000, 1111, 2222, and 3333.

At the source node of the transmission data, the data block B (Block) 1-16 is colored according to the coloring cycle, for example, data block B1 is colored 0000, data block B2 is colored 1111, data block B3 is colored 2222, and data block B4 is colored It is 3333, and so on. Among them, in the odd number of 4T cycles, the message is put into Count A (CountA0～CountA3) according to the coloring; in the even number of 4T cycles, the message is put into Count B (CountB0～CountB3) according to the coloring.

Similarly, at the sink node or intermediate node that transmits data, in odd 4T cycles, packets are put into CountA (CountA0～CountA3) according to their coloring; in even 4T cycles, packets are put into CountB according to their coloring (CountB0～CountB3).

Specifically, for scenarios that support the expansion of the number of coloring, the coloring value of the message is (current time/read cycle)/coloring cycle, and then rounded down to determine the corresponding counter. The message is counted into the corresponding counter according to the coloring value and parity cycle. counter.

The network manager can read the last 4T performance data of each node in the transmission path at the intermediate time of the 4T cycle to calculate the packet loss rate. For example, the data in Count A (CountA0 ~ CountA3) in the source node can be one-to-one corresponding to the data in Count A (CountA0 ~ CountA3) in the sink node to obtain the number of lost packets in four groups, which can be the average, maximum, or The minimum value is used as the packet loss rate.

In another embodiment of the present application, on the basis of the previous embodiment, for a shorter coloring period T, the reading period ratio can be further expanded, such as 10T, 100T, etc., and the corresponding coloring mark number and counter The quantity needs to be expanded accordingly.

FIG. 6 is a schematic diagram of packet coloring in another embodiment of the application. In this embodiment, the coloring period is T and the reading period is 4T. Each node that transmits data can be equipped with a network performance measurement device, and each network performance measurement device is provided with 8 counters (CountA0～CountA3, CountB0～ CountB3).

Message coloring is mainly to mark certain specific fields of business messages, and the number of different business messages that can be marked is limited. In the extreme case, only 1 bit is available for marking and can only be colored as 0 and 1, which is the marking method provided by RFC8321. In this scenario, the solution for expanding the number of colored marks provided in the above embodiment is not feasible.

To this end, this embodiment provides an enhanced alternate coloring scheme. As shown in Figure 6, in this embodiment, there are two types of colored marks: 0000, 1111,

At the source node of the transmission data, the data block B (Block) 1-16 is colored according to the coloring cycle, for example, data block B1 is colored 0000, data block B2 is colored 1111, data block B3 is colored 0000, and data block B4 is colored 1111, and so on. Among them, in an odd number of 4T cycles, within -T/2~3T/2, packets colored as 0 are included in CountA0; within T/2~5T/2, packets colored as 1 are included in CountA1; Within 3T/2～7T/2, packets colored as 0 are counted as CountA2; within 5T/2～9T/2, packets colored as 1 are counted as CountA3. In an even number of 4T cycles, counting is similar to an odd number cycle, except that the message is counted into CountB0～CountB3.

Similarly, at the sink node or intermediate node that transmits data, within an odd number of 4T cycles, within -T/2~3T/2, packets colored as 0 are included in CountA0; within T/2~5T/2 , The message colored 1 is counted into CountA1; within 3T/2～7T/2, the message colored 0 is counted into CountA2; within 5T/2～9T/2, the message colored 1 is counted into CountA3 . In an even number of 4T cycles, counting is similar to an odd number cycle, except that the message is counted into CountB0～CountB3.

Specifically, for scenes that do not support the expansion of the number of coloring marks, packets in the range of T/2 before the start of the current coloring period T to T/2 after the end of the current coloring period T are counted in the counter corresponding to the period.

The network manager can read the last 4T performance data of each node on the transmission path at the intermediate time of the 4T cycle to calculate the packet loss rate. For example, the data in Count A (CountA0 ~ CountA3) in the source node can be one-to-one corresponding to the data in Count A (CountA0 ~ CountA3) in the sink node to obtain the number of lost packets in four groups, which can be the average, maximum, or The minimum value is used as the packet loss rate.

In another embodiment of the present application, based on the previous embodiment, for a shorter coloring period T, the reading period can also be enlarged by expanding the number of counters.

FIG. 7 is a schematic structural diagram of a network performance measurement device provided by an embodiment of the application. As shown in FIG. 7, the network performance measurement device includes:

The processor and N counters, the coloring period is T, and the delay coloring message within a period T is expanded to N; the N is 2 or an even multiple of 2; there are N kinds of coloring marks for the message; a counter Count corresponds Mark the coloring time of a coloring tag message;

The processor is configured to color the first message starting every T/N cycle in the T period, and count the coloring time of the message into the corresponding counter Count.

FIG. 8 is a schematic structural diagram of a network performance measurement device provided by an embodiment of the application. As shown in FIG. 8, the network performance measurement device includes:

Processors and N counters, the coloring cycle is T, and the delay coloring message in a cycle T is expanded to N; the N is 2 or an even multiple of 2; there are N kinds of coloring marks for the message; a counter Count according to The period T sequentially arranges the receiving time of correspondingly marked a colored marked message;

The processor is used to write the receiving time (receiving time/reading period)/coloring period of a coloring message when the coloring period is lower than the reading period, and then round down to obtain the corresponding counter , The receiving time of receiving the coloring message is counted into the corresponding counter; when the coloring period is consistent with the reading period, the receiving time of receiving a coloring message is written (receiving time/reading period)* N/coloring period, then round down to obtain a corresponding counter, and count the receiving time of receiving the coloring message into the corresponding counter.

Fig. 9 is a schematic structural diagram of a network performance measurement system provided by an embodiment of the application. As shown in Fig. 9, the system includes: a network management and a source node and a sink node or intermediate nodes for transmitting packets.

The source node includes: a first processor and N counters, and a counter Count in the router source node sequentially arranges the coloring time corresponding to a coloring flag packet according to the period T.

The sink node or intermediate node includes: a second processor and N counters, and a counter Count in the router sink node sequentially arranges the receiving time corresponding to a colored marking message according to the period T.

The coloring period is T, and the time-delay coloring message is expanded to N in a period T; there are N kinds of coloring marks for the message; the N is 2 or an even multiple of 2.

The first processor is configured to send a message, and in the T cycle, color the first message starting every T/N cycle, and count the coloring time of the message into the corresponding counter Count.

The second processor is configured to receive a message, and when the coloring period is lower than the reading period, write the receiving time of a coloring message into (receiving time/reading period)/coloring period, and then down Round to get the corresponding counter, and count the receiving time of the coloring message into the corresponding counter; when the coloring period is the same as the reading period, write the receiving time of a coloring message (receive time /Reading period)*N/coloring period, then round down to obtain the corresponding counter, and count the receiving time of receiving the coloring message into the corresponding counter.

The network management system is configured to read the counter data of the source node and the sink node or the intermediate node at an intermediate point of every T period, and calculate the network delay.

FIG. 5 is also a schematic diagram of packet coloring in another embodiment of the application. In this embodiment, the coloring period is T and the reading period is 4T. Each node that transmits data can be equipped with a network performance measurement device, and each network performance measurement device is provided with 8 counters (CountA0～CountA3, CountB0～ CountB3).

At the source node of the transmission data, the data block B (Block) 1-16 is colored according to the coloring cycle, for example, data block B1 is colored 0000, data block B2 is colored 1111, data block B3 is colored 2222, and data block B4 is colored It is 3333, and so on. Among them, in the odd number of 4T cycles, the coloring time of the message is included in Count A (CountA0～CountA3) according to the coloring; in the even number of 4T cycles, the coloring time of the message is included in the coloring time of the message. Count B (CountB0～CountB3).

Specifically, for scenarios that support the expansion of the number of coloring marks, the coloring value of the message is (current time/read cycle)/coloring cycle, then round down to determine the corresponding counter, and the coloring time of the message is included in the corresponding counter. For example, if the coloring cycle is lower than the reading cycle, write the coloring time of the message (receiving time/reading cycle)/coloring cycle, then round down to get the corresponding counter, and count the coloring time of the message The corresponding counter. In a scenario where the coloring cycle is consistent with the reading cycle, N delay coloring messages can be inserted in each cycle, that is, the first service message is delayed coloring every 1/N cycle.

Similarly, at the sink node or intermediate node that transmits data, in odd 4T cycles, the message counts the message reception time into Count A (CountA0～CountA3) according to the coloring; in even 4T cycles, the message According to the coloring, the receiving time of the message is counted into CountB (CountB0～CountB3).

Specifically, for scenarios where the coloring cycle is lower than the reading cycle, the time of receiving the message is written (current time/reading cycle)/coloring cycle, and then rounded down to get the corresponding counter. In the scenario where the coloring cycle is consistent with the reading cycle, the time of receiving the message is written (current time/coloring cycle)*N/coloring cycle, and then rounded down to get the corresponding counter. The message receiving time is counted into the corresponding counter.

The network manager can read the last 4T performance data of each node in the transmission path at the intermediate time of the 4T cycle to calculate the delay. For example, the data in Count A (CountA0～CountA3) in the source node can be one-to-one corresponding to the data in Count A (CountA0～CountA3) in the sink node to obtain four sets of times, which can be the average, maximum, or minimum. As the delay value.

FIG. 6 is also a schematic diagram of packet coloring in another embodiment of the application. In this embodiment, the coloring period is T and the reading period is 4T. Each node that transmits data can be equipped with a network performance measurement device, and each network performance measurement device is provided with 8 counters (CountA0～CountA3, CountB0～ CountB3).

At the source node of the transmission data, the data block B (Block) 1-16 is colored according to the coloring cycle, for example, data block B1 is colored 0000, data block B2 is colored 1111, data block B3 is colored 0000, and data block B4 is colored 1111, and so on. Among them, in an odd number of 4T cycles, within -T/2～3T/2, the coloring time of packets colored as 0 is included in CountA0; within T/2～5T/2, the coloring time of packets colored as 1 CountA1; within 3T/2～7T/2, the coloring time of the message colored 0 is included in CountA2; within 5T/2～9T/2, the coloring time of the message colored 1 is included in CountA3. In even 4T cycles, counting is similar to odd cycles, except that the message coloring time is included in CountB0～CountB3.

Similarly, at the sink node or intermediate node that transmits data, within an odd number of 4T cycles, within -T/2~3T/2, the packet reception time colored 0 is included in CountA0; T/2~5T/2 Within the time, the receiving time of the message colored 1 is counted into CountA1; within 3T/2～7T/2, the receiving time of the message colored 0 is counted into CountA2; within 5T/2～9T/2, the coloring is 1 The received time of the message is included in CountA3. In even 4T cycles, counting is similar to odd cycles, except that the message reception time is included in CountB0～CountB3.

Specifically, for scenes that do not support the expansion of the number of coloring marks, the coloring or receiving time of packets in the range of T/2 before the start of the current coloring period T to T/2 after the end of the current coloring period T is included in the counter corresponding to the period in.

The network manager can read the last 4T performance data of each node in the transmission path at the intermediate time of the 4T cycle to calculate the delay. For example, the data in Count A (CountA0～CountA3) in the source node can be one-to-one corresponding to the data in Count A (CountA0～CountA3) in the sink node to obtain four sets of times, which can be the average, maximum, or minimum. As a delay.

FIG. 10 is also a schematic diagram of packet coloring in another embodiment of the application. In this embodiment, the coloring period is T1, and the delayed coloring message is expanded to N. Each node that transmits data can be provided with a network performance measurement device, and each network performance measurement device is provided with N counters.

At the source node of the data transmission, the number of delay coloring can be increased during each week. The method provided by RFC8321 is to color the first message at the beginning of each cycle. However, in this embodiment, through counter expansion, the number of delay colored packets can be increased as needed according to actual conditions. For example, the coloring period is T, and the delayed coloring message is expanded to N. Color the first message at the beginning of every T/N cycle, and count the coloring time into the corresponding counter.

Similarly, at the sink node or intermediate node that transmits data, the coloring cycle is lower than the read cycle scenario, the time of receiving the coloring message is written (current time/read cycle)/coloring cycle, and then rounded down to get the corresponding When the coloring cycle is the same as the read cycle, the time of receiving the coloring message is written (current time/coloring cycle)*N/coloring cycle, and then rounded down to get the corresponding extended counter. Count the receiving time into the corresponding counter.

The network manager can read the N sets of performance data of the last T in each node on the transmission path at the intermediate time point of every T cycle, so as to calculate the time delay. For example, the data in the N counters in the source node can be one-to-one corresponding to the data in the N counters in the sink node to obtain N sets of time, and the average value, maximum value, or minimum value can be taken as the delay.

FIG. 11 is a schematic flowchart of a network performance measurement method provided by an embodiment of this application, and the method is applied to a network performance measurement device.

The network performance measurement device includes: a processor and 2N counters. The 2N counters include N counters CountAn and N counters CountBn, where N is an even multiple of 2, and n takes a value from 0 to N- A natural number of 1; there are N types of coloring tags for messages, a counter CountAn and a counter CountBn corresponding to calculate the number of a coloring tag message; the coloring cycle is T, and the reading cycle is N*T;

As shown in Figure 11, it includes:

Step 1101: The processor counts the corresponding N Count An in the odd number N*T cycles according to the coloring flag of the message; in the even N*T cycles, counts it sequentially according to the coloring tag of the message The corresponding N Count Bn.

FIG. 12 is a schematic flowchart of a network performance measurement method provided by another embodiment of this application, and the method is applied to a network performance measurement device.

The network performance measurement device includes: a processor and 2N counters. The 2N counters include N counters CountAn and N counters CountBn, where N is an even multiple of 2, and n takes a value from 0 to N- A natural number of 1; there are two types of coloring tags for the message: A and B; the coloring cycle is T, and the reading cycle is N*T; a counter Count An and a counter Count Bn correspond to a coloring tag message in a 2T cycle quantity;

As shown in Figure 12, it includes:

Step 1201: The processor counts the packets colored as A within the period of -T/2—3T/2 into the corresponding counter Count A0 within an odd number of N*T cycles; within the period of T/2—5T/2 Messages colored as B are counted in the corresponding counter Count A1; messages colored as A within 3T/2～7T/2 are counted into the corresponding counter Count A2; messages colored as B within 5T/2～9T/2 The message is counted into the corresponding counter Count A3; and so on until the end of the reading cycle;

Wherein, the mark A is 0, and the mark B is 1.

FIG. 13 is a schematic flowchart of a network performance measurement method according to another embodiment of the application. The method is applied to a network performance measurement system. The system includes: a network management system and a source node and a sink node or an intermediate node for transmitting packets;

The source node includes: a first processor and 2N counters;

As shown in Figure 13, including:

Step 1301: The first processor colorizes and sends the message; in the odd number of N*T cycles, count the corresponding N Count An according to the coloring flag of the message in turn; in the even number of N*T cycles , Count the corresponding N Count Bn in turn according to the coloring mark of the message;

Step 1302, the second processor receives the message; in the odd number of N*T cycles, count the corresponding N Count An according to the coloring flag of the message; in the even number of N*T cycles, according to the message The colored marks of are counted in the corresponding N Count Bn in turn;

Step 1303: The network manager reads the data of the counters in the source node and the sink node or the intermediate node at an intermediate point of every N*T cycles, and calculates the packet loss rate.

14 is a schematic flowchart of a network performance measurement method provided by another embodiment of the application. The method is applied to a network performance measurement device. The network performance measurement device includes a processor and N counters, and the coloring period is T. The delay coloring message is expanded to N in a period T; the N is 2 or an even multiple of 2; a counter Count corresponds to marking the coloring time of a coloring mark message;

As shown in Figure 14, including:

Step 1401: The processor colorizes the first message that starts every T/N cycle in T cycles, and counts the coloring time of the message into the corresponding counter Count.

15 is a schematic flow chart of a network performance measurement method provided by another embodiment of the application. The method is applied to a network performance measurement device. The network performance measurement device includes a processor and N counters, and the coloring period is T. In a period T, the delay coloring message is expanded to N; the N is 2 or an even multiple of 2; a counter Count is arranged in sequence according to the period T to mark the receiving time of a coloring mark message;

As shown in Figure 15, including:

Step 1501: When the coloring period is lower than the reading period, the processor writes (receiving time/reading period)/coloring period of the receiving time of a colored message received, and then rounds down to obtain the corresponding counter , The receiving time of receiving the colored message is counted into the corresponding counter; when the coloring period is consistent with the reading period, the processor writes the receiving time of a colored message (receiving time/reading Take period)*N/coloring period, then round down to obtain the corresponding counter, and count the receiving time of receiving the coloring message into the corresponding counter.

FIG. 16 is a schematic flowchart of a network performance measurement method provided by another embodiment of this application, and the method is applied to a network performance measurement system.

The network performance measurement system includes: a network management and a source node and a sink node or intermediate nodes for transmitting messages.

The sink node or the intermediate node includes: a second processor and N counters, and a counter Count in the router sink node sequentially arranges the receiving time of a colored marking message corresponding to the period T.

The coloring period is T, and the delayed coloring message is expanded to N in a period T; the N is 2 or an even multiple of 2.

As shown in Figure 16, the method includes:

Step 1601: The first processor sends a message, and in the T period, colorizes the first message that starts every T/N period, and counts the coloring time of the message into the corresponding counter Count;

Step 1602, the second processor receives the message, and when the coloring period is lower than the reading period, writes the receiving time of a coloring message into (receiving time/reading period)/coloring period, and then down Round to get the corresponding counter, and count the receiving time of the coloring message into the corresponding counter; when the coloring period is the same as the reading period, write the receiving time of a coloring message (receive time /Reading period)*N/coloring period, then round down to obtain the corresponding counter, and count the receiving time of receiving the coloring message into the corresponding counter;

Step 1603: The network manager reads the data of the counters in the source node and the sink node or the intermediate node at the intermediate point of every T cycles, and calculates the network delay.

A person of ordinary skill in the art can understand that all or some of the steps, functional modules/units in the system, and apparatus in the methods disclosed above can be implemented as software, firmware, hardware, and appropriate combinations thereof. In hardware implementations, the division between functional modules/units mentioned in the above description does not necessarily correspond to the division of physical components; for example, one physical component may have multiple functions, or one function or step may consist of several physical components. The components are executed cooperatively. Some or all components may be implemented as software executed by a processor, such as a digital signal processor or a microprocessor, or as hardware, or as an integrated circuit, such as an application specific integrated circuit. Such software may be distributed on a computer-readable medium, and the computer-readable medium may include a computer storage medium (or a non-transitory medium) and a communication medium (or a transitory medium). As is well known to those of ordinary skill in the art, the term computer storage medium includes volatile and non-volatile memory implemented in any method or technology for storing information (such as computer-readable instructions, data structures, program modules, or other data). Sexual, removable and non-removable media. Computer storage media include but are not limited to RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disk (DVD) or other optical disk storage, magnetic cassette, tape, magnetic disk storage or other magnetic storage device, or Any other medium used to store desired information and that can be accessed by a computer. In addition, as is well known to those of ordinary skill in the art, communication media usually contain computer-readable instructions, data structures, program modules, or other data in a modulated data signal such as carrier waves or other transmission mechanisms, and may include any information delivery media .

Claims

A network performance measurement device, including:

Processor and 2N counters, the 2N counters include N counters Count An and N counters Count Bn, where N is an even multiple of 2, and n is a natural number from 0 to N-1; coloring of packets There are N types of tags, a counter Count An and a counter Count Bn correspondingly calculate the number of a coloring tag message; the coloring cycle is T, and the reading cycle is N*T;

The processor is configured to sequentially count the corresponding N Count An according to the coloring mark of the message in an odd number of N*T cycles; and sequentially count the corresponding N Count An according to the coloring mark of the message in an even number of N*T cycles The corresponding N Count Bn.
A network performance measurement device, including:

Processor and 2N counters, the 2N counters include N counters Count An and N counters Count Bn, where N is an even multiple of 2, and n is a natural number from 0 to N-1; coloring of packets There are two types of markers: A and B; the coloring cycle is T, and the reading cycle is N*T; a counter Count An and a counter Count Bn correspondingly count the number of a coloring tag message in a 2T cycle;

The processor is configured to count the packets colored as A within the period of -T/2—3T/2 into the corresponding counter Count A0 within an odd number of N*T cycles; within the period of T/2—5T/2 Messages colored as B are counted in the corresponding counter Count A1; messages colored as A within 3T/2～7T/2 are counted into the corresponding counter Count A2; messages colored as B within 5T/2～9T/2 The message is counted into the corresponding counter Count A3; and so on until the end of the reading cycle;

In an even number of N*T cycles, the packets colored as A within -T/2—3T/2 are counted into the corresponding counter Count B0; the packets colored as B within T/2~5T/2 are counted Enter the corresponding counter Count B1; the packets colored as A within 3T/2～7T/2 are counted into the corresponding counter Count B2; the packets colored as B within 5T/2～9T/2 are counted into the corresponding counter Count B3; and so on until the end of the read cycle.
The network performance measurement device according to claim 2, wherein:

The mark A is 0, and the mark B is 1.
A network performance measurement device, including:

The processor and N counters, the coloring period is T, and the delay coloring message within a period T is expanded to N; the N is 2 or an even multiple of 2; there are N kinds of coloring marks for the message; a counter Count corresponds Mark the coloring time of a coloring tag message;

The processor is configured to color the first message starting every T/N cycle in the T period, and count the coloring time of the message into the corresponding counter Count.
A network performance measurement device, including:

Processors and N counters, the coloring cycle is T, and the delay coloring message in a cycle T is expanded to N; the N is 2 or an even multiple of 2; there are N kinds of coloring marks for the message; a counter Count according to The period T sequentially arranges the receiving time of correspondingly marked a colored marked message;

The processor is used to write the receiving time (receiving time/reading period)/coloring period of a coloring message when the coloring period is lower than the reading period, and then round down to obtain the corresponding counter , The receiving time of receiving the coloring message is counted into the corresponding counter; when the coloring period is consistent with the reading period, the receiving time of receiving a coloring message is written (receiving time/reading period)* N/coloring period, then round down to obtain a corresponding counter, and count the receiving time of receiving the coloring message into the corresponding counter.
A network performance measurement method, which is applied to a network performance measurement device,

The network performance measurement device includes: a processor and 2N counters. The 2N counters include N counters CountAn and N counters CountBn, where N is an even multiple of 2, and n takes a value from 0 to N- A natural number of 1; there are N types of coloring tags for messages, a counter CountAn and a counter CountBn corresponding to calculate the number of a coloring tag message; the coloring cycle is T, and the reading cycle is N*T;

In an odd number of N*T cycles, the processor sequentially counts the corresponding N Count An according to the coloring mark of the message; in an even number of N*T cycles, sequentially counts the corresponding N according to the coloring mark of the message Count Bn.
A network performance measurement method, which is applied to a network performance measurement device,

The network performance measurement device includes: a processor and 2N counters. The 2N counters include N counters CountAn and N counters CountBn, where N is an even multiple of 2, and n takes a value from 0 to N- A natural number of 1; there are two types of coloring tags for the message: A and B; the coloring cycle is T, and the reading cycle is N*T; a counter Count An and a counter Count Bn correspond to a coloring tag message in a 2T cycle quantity;

In an odd number of N*T cycles, the processor counts the packets colored as A within -T/2—3T/2 into the corresponding counter Count A0; within T/2 to 5T/2, colored as B The messages that are colored as A are counted in the corresponding counter Count A1; the messages that are colored as A within 3T/2 to 7T/2 are counted into the corresponding counter Count A2; the packets that are colored as B within 5T/2 to 9T/2 are counted Enter the corresponding counter Count A3; and so on until the end of the reading cycle;

In an even number of N*T cycles, the packets colored as A within -T/2—3T/2 are counted into the corresponding counter Count B0; the packets colored as B within T/2~5T/2 are counted Enter the corresponding counter Count B1; the packets colored as A within 3T/2～7T/2 are counted into the corresponding counter Count B2; the packets colored as B within 5T/2～9T/2 are counted into the corresponding counter Count B3; and so on until the end of the read cycle.
The method according to claim 7, wherein:

The mark A is 0, and the mark B is 1.
A network performance measurement method, which is applied to a network performance measurement device,

The network performance measurement device includes: a processor and N counters, the coloring period is T, and the delay coloring message is expanded to N in a period T; the N is 2 or an even multiple of 2; a counter Count corresponds to a mark The coloring time of a coloring tag message;

The processor colorizes the first message starting every T/N cycle in the T cycle, and counts the coloring time of the message into the corresponding counter Count.
A network performance measurement method, which is applied to a network performance measurement device,

The network performance measurement device includes: a processor and N counters, the coloring period is T, and the delay coloring message within a period T is expanded to N; the N is 2 or an even multiple of 2; a counter Count is in accordance with the cycle T sequentially arranges the receiving time corresponding to a colored tag message;

When the coloring period is lower than the reading period, the processor writes (receiving time/reading period)/coloring period of the receiving time of a colored message received, and then rounds down to get the corresponding counter, and will receive The receiving time of the colored message is counted into the corresponding counter; when the coloring period is consistent with the reading period, the processor writes the receiving time of a colored message received (receiving time/reading period) *N/coloring period, then round down to obtain the corresponding counter, and count the receiving time of receiving the coloring message into the corresponding counter.