CN111211935A - High-efficiency application-level concurrent detection implementation method - Google Patents

High-efficiency application-level concurrent detection implementation method Download PDF

Info

Publication number
CN111211935A
CN111211935A CN201911365996.5A CN201911365996A CN111211935A CN 111211935 A CN111211935 A CN 111211935A CN 201911365996 A CN201911365996 A CN 201911365996A CN 111211935 A CN111211935 A CN 111211935A
Authority
CN
China
Prior art keywords
keep
alive
server
path
server group
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201911365996.5A
Other languages
Chinese (zh)
Other versions
CN111211935B (en
Inventor
李政
李瀚文
李高超
于贵智
王啸
吴伟雄
邹昕
贾有春
张伟
陈国贺
陈训逊
戴丽
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
NANJING SINOVATIO TECHNOLOGY CO LTD
National Computer Network and Information Security Management Center
Original Assignee
NANJING SINOVATIO TECHNOLOGY CO LTD
National Computer Network and Information Security Management Center
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by NANJING SINOVATIO TECHNOLOGY CO LTD, National Computer Network and Information Security Management Center filed Critical NANJING SINOVATIO TECHNOLOGY CO LTD
Priority to CN201911365996.5A priority Critical patent/CN111211935B/en
Publication of CN111211935A publication Critical patent/CN111211935A/en
Application granted granted Critical
Publication of CN111211935B publication Critical patent/CN111211935B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00Arrangements for monitoring or testing data switching networks
    • H04L43/12Network monitoring probes
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/02Topology update or discovery
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/74Address processing for routing
    • H04L45/745Address table lookup; Address filtering
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/01Protocols
    • H04L67/10Protocols in which an application is distributed across nodes in the network
    • H04L67/104Peer-to-peer [P2P] networks
    • H04L67/1044Group management mechanisms 

Abstract

The invention discloses a high-efficiency application level concurrent detection implementation method.A network processor receives a timing message of a keep-alive request; reading a keep-alive request packet to which server is to be sent; looking up a keep-alive table, wherein a key value is a keep-alive path identifier; if the server group is referred by the single service, the keep-alive path identification is uniquely determined by the server in the server group and the reference service; if the server group is invoked by multiple services, the keep-alive path identifier is only determined by the server; if the keep-alive table is not successfully matched, discarding the message; if the keep-alive table is successfully matched, updating the state of the keep-alive path; constructing a keep-alive packet corresponding to the server, filling a keep-alive path identifier, if the server group is referred by multiple services, adding a bitmap after the constructed keep-alive packet, and identifying all referred services by using the bitmap; and sending the keep-alive packet constructed in the previous step to a back-end server. The invention introduces the relation between the bitmap calibration server and the service reference, reduces the sending quantity of the detection message and improves the detection efficiency.

Description

High-efficiency application-level concurrent detection implementation method
Technical Field
The invention relates to the technical field of INTERNET management, in particular to a high-efficiency application level concurrency detection implementation method.
Background
The network flow control equipment is connected in series between the routers and used for forwarding the flow in the network to the background server group for data analysis, and the network flow control equipment needs to forward the flow according to the connection state of the background server group and needs to detect the connection state of the background server in real time; in addition, if the network flow control device forwards the traffic to the background server group according to the application service, state detection needs to be performed on the application service layer. When a plurality of server groups are configured on the device and are simultaneously referred to by a plurality of application services, the network flow control device needs to send and receive a large number of status detection messages and response messages, and the messages occupy a large amount of bandwidth, which results in that the bandwidth of effective flow is reduced.
Disclosure of Invention
The technical problem to be solved by the invention is to provide a method for realizing high-efficiency application-level concurrent detection, aiming at introducing a bitmap calibration server and a service reference relation when a server is referred by multiple services, so as to achieve application-level concurrent detection, reduce the sending quantity of detection messages and improve the detection efficiency.
In order to solve the technical problem, the invention provides a high-efficiency application-level concurrent detection implementation method, which comprises the following steps:
(1) the network processor receives the timing message of the keep-alive request;
(2) reading a keep-alive request packet to which server the keep-alive request packet is to be sent, wherein the keep-alive request packet is a request message of ICMP or BFD;
(3) searching a keep-alive table, wherein the keep-alive table is an entry storing a keep-alive path, one entry corresponds to one keep-alive path, the key value is a keep-alive path identifier, and the keep-alive table entries are matched through the keep-alive path identifier; if the server group is referred by the single service, the keep-alive path identification is uniquely determined by the server in the server group and the reference service, one server under each reference service is a keep-alive path, keep-alive path identifications are distributed in sequence, and corresponding table entry items are established in a keep-alive table; if the server group is invoked by multiple services, the keep-alive path identifier is only determined by the server; if the keep-alive table is not successfully matched, executing the step (4); if the keep-alive table is successfully matched, executing the step (5);
(4) discarding the message;
(5) updating the state of the keep-alive path;
(6) constructing a keep-alive request packet corresponding to a server, filling a keep-alive path identifier, if the server group is referred by multiple services, adding a bitmap after the constructed keep-alive request packet, and identifying all referred services by using the bitmap;
(7) and (4) sending the keep-alive request packet constructed in the step (6) to a back-end server.
The invention has the beneficial effects that: the invention flexibly sets whether the network flow control equipment uses the concurrent detection or not through the controllable configuration on the application layer, and when one server group is referred by a single application service, the efficiency of individually carrying out the state detection aiming at each application service is higher than the concurrent detection; when one server group is referred by a plurality of application services, the reference relation of the server group in the application services is calibrated according to the bitmap, and when concurrent detection is carried out, only one calibration bitmap and a detection message need to be sent for each server in the server group, and the detection message does not need to be sent for each service where the server is located, so that the sending quantity of the detection message can be effectively reduced, and further the overall detection efficiency of the method under different use scenes is optimal.
Drawings
FIG. 1 is a schematic flow chart of the method of the present invention.
Detailed Description
As shown in fig. 1, an implementation method of high-efficiency application-level concurrent probing includes the following steps:
(1) the network processor receives the timing message of the keep-alive request;
(2) reading a keep-alive request packet to which server the keep-alive request packet is to be sent, wherein the keep-alive request packet is a request message of ICMP or BFD;
(3) searching a keep-alive table, wherein the keep-alive table is an entry storing a keep-alive path, one entry corresponds to one keep-alive path, the key value is a keep-alive path identifier, and the keep-alive table entries are matched through the keep-alive path identifier; if the server group is referred by the single service, the keep-alive path identification is uniquely determined by the server in the server group and the reference service, one server under each reference service is a keep-alive path, keep-alive path identifications are distributed in sequence, and corresponding table entry items are established in a keep-alive table; if the server group is invoked by multiple services, the keep-alive path identifier is only determined by the server; if the keep-alive table is not successfully matched, executing the step (4); if the keep-alive table is successfully matched, executing the step (5);
(4) discarding the message;
(5) updating the state of the keep-alive path;
(6) constructing a keep-alive request packet corresponding to a server, filling a keep-alive path identifier, if the server group is referred by multiple services, adding a bitmap after the constructed keep-alive request packet, and identifying all referred services by using the bitmap;
(7) and (4) sending the keep-alive request packet constructed in the step (6) to a back-end server.
The present invention addresses the following two scenarios: 1) the server group only has a single application service reference; 2) the server cluster is quoted by a plurality of application services, and whether the network flow control equipment uses the concurrent detection or not is flexibly configured by adding controllable switch configuration on an application layer.
A. When a server group is referred by a single service, only a detection message needs to be sent to each server in the server group, and the reference relation between the server group and all application services does not need to be known.
B. When one server group is invoked by multiple services, the reference relationship between the server group and the application services is calibrated by using the bitmap, the calibration bitmap and the detection message are sent to each server in the server group during detection, the detection message does not need to be sent to each service where the server is located, and when the server group is invoked by multiple services, the sending quantity of the detection message can be effectively reduced.
The invention introduces the bitmap calibration server and the service reference relation when the server is referred by multiple services, thereby achieving the application-level concurrent detection, reducing the sending quantity of the detection message and improving the detection efficiency.

Claims (1)

1. An implementation method for efficient application-level concurrent detection is characterized by comprising the following steps:
(1) the network processor receives the timing message of the keep-alive request;
(2) reading a keep-alive request packet to which server the keep-alive request packet is to be sent, wherein the keep-alive request packet is a request message of ICMP or BFD;
(3) searching a keep-alive table, wherein the keep-alive table is an entry storing a keep-alive path, one entry corresponds to one keep-alive path, the key value is a keep-alive path identifier, and the keep-alive table entries are matched through the keep-alive path identifier; if the server group is referred by the single service, the keep-alive path identification is uniquely determined by the server in the server group and the reference service, one server under each reference service is a keep-alive path, keep-alive path identifications are distributed in sequence, and corresponding table entry items are established in a keep-alive table; if the server group is invoked by multiple services, the keep-alive path identifier is only determined by the server; if the keep-alive table is not successfully matched, executing the step (4); if the keep-alive table is successfully matched, executing the step (5);
(4) discarding the message;
(5) updating the state of the keep-alive path;
(6) constructing a keep-alive request packet corresponding to a server, filling a keep-alive path identifier, if the server group is referred by multiple services, adding a bitmap after the constructed keep-alive request packet, and identifying all referred services by using the bitmap;
(7) and (4) sending the keep-alive request packet constructed in the step (6) to a back-end server.
CN201911365996.5A 2019-12-26 2019-12-26 High-efficiency application-level concurrent detection implementation method Active CN111211935B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201911365996.5A CN111211935B (en) 2019-12-26 2019-12-26 High-efficiency application-level concurrent detection implementation method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201911365996.5A CN111211935B (en) 2019-12-26 2019-12-26 High-efficiency application-level concurrent detection implementation method

Publications (2)

Publication Number Publication Date
CN111211935A true CN111211935A (en) 2020-05-29
CN111211935B CN111211935B (en) 2021-06-25

Family

ID=70789348

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201911365996.5A Active CN111211935B (en) 2019-12-26 2019-12-26 High-efficiency application-level concurrent detection implementation method

Country Status (1)

Country Link
CN (1) CN111211935B (en)

Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080101314A1 (en) * 2006-10-27 2008-05-01 Alexander Bachmutsky Network-based reliability of mobility gateways
CN101512952A (en) * 2006-09-11 2009-08-19 高通股份有限公司 Method and apparatus for keep-alive bits transmission
CN101534205A (en) * 2008-03-11 2009-09-16 中国网通集团宽带业务应用国家工程实验室有限公司 Application layer multicast service realizing method, terminal and system thereof
CN102917412A (en) * 2011-03-31 2013-02-06 北京新岸线无线技术有限公司 Service flow management method and device
CN102957617A (en) * 2011-08-18 2013-03-06 盛科网络(苏州)有限公司 Method and device for superimposing multiple services
CN104350780A (en) * 2012-07-09 2015-02-11 英特尔公司 Methods and arrangements for traffic indication map segmentation in wireless networks
CN108650190A (en) * 2018-04-12 2018-10-12 国家计算机网络与信息安全管理中心 A kind of data distribution systems and data distributing method of multipath
EP3413636A1 (en) * 2017-06-09 2018-12-12 Apple Inc. Group wake-up and keep-alive indication
CN110113306A (en) * 2019-03-29 2019-08-09 华为技术有限公司 Distribute the method and the network equipment of data
CN110120897A (en) * 2019-04-22 2019-08-13 国家计算机网络与信息安全管理中心 Link detection method, apparatus, electronic equipment and machine readable storage medium

Patent Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101512952A (en) * 2006-09-11 2009-08-19 高通股份有限公司 Method and apparatus for keep-alive bits transmission
US20080101314A1 (en) * 2006-10-27 2008-05-01 Alexander Bachmutsky Network-based reliability of mobility gateways
CN101534205A (en) * 2008-03-11 2009-09-16 中国网通集团宽带业务应用国家工程实验室有限公司 Application layer multicast service realizing method, terminal and system thereof
CN102917412A (en) * 2011-03-31 2013-02-06 北京新岸线无线技术有限公司 Service flow management method and device
CN102957617A (en) * 2011-08-18 2013-03-06 盛科网络(苏州)有限公司 Method and device for superimposing multiple services
CN104350780A (en) * 2012-07-09 2015-02-11 英特尔公司 Methods and arrangements for traffic indication map segmentation in wireless networks
EP3413636A1 (en) * 2017-06-09 2018-12-12 Apple Inc. Group wake-up and keep-alive indication
CN108650190A (en) * 2018-04-12 2018-10-12 国家计算机网络与信息安全管理中心 A kind of data distribution systems and data distributing method of multipath
CN110113306A (en) * 2019-03-29 2019-08-09 华为技术有限公司 Distribute the method and the network equipment of data
CN110120897A (en) * 2019-04-22 2019-08-13 国家计算机网络与信息安全管理中心 Link detection method, apparatus, electronic equipment and machine readable storage medium

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
林振荣: "网络监测系统中ping功能的实现", 《计算机与现代化》 *

Also Published As

Publication number Publication date
CN111211935B (en) 2021-06-25

Similar Documents

Publication Publication Date Title
CN108377671B (en) Method and computer equipment for processing message
CN107197059B (en) DNS (Domain name Server) analysis method and device
CN111049859A (en) Attack traffic shunting and blocking method based on topology analysis
US11476977B2 (en) Data transmission method and related device
CN106921578B (en) Method and device for generating forwarding table item
CN102394944B (en) Method and equipment for correcting IP (Internet Protocol) address in Web access
CN105743687B (en) Method and device for judging node fault
CN107547346B (en) Message transmission method and device
CN108989204B (en) Link state determination method and device
CN111211935B (en) High-efficiency application-level concurrent detection implementation method
CN106789713B (en) Message forwarding method and device
CN107018088B (en) Transmission link selection method and device
CN109618015B (en) Data center-based de-stacking implementation method and device
WO2012174838A1 (en) Method and system of parallel transmitting network element messages
CN110536187B (en) Method for forwarding data and access stratum switching equipment
CN115037785B (en) Instant communication system and method
US20190036793A1 (en) Network service implementation method, service controller, and communications system
CN107682265B (en) Message routing method and device of payment system
CN115915098A (en) Method for realizing BMCA in 5G and TSN cross-domain PTP
CN112612670B (en) Session information statistical method, device, exchange equipment and storage medium
CN114079640B (en) Data processing method, user plane function and device
CN110868318B (en) Method and device for generating network access relation, electronic equipment and storage medium
US9967178B1 (en) Flow record size reduction
CN110300033B (en) Packet loss information recording method, network equipment and network system
CN110109933B (en) Information maintenance method, configuration management database system and storage medium

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant