CN108429703B - DHCP client-side online method and device - Google Patents

DHCP client-side online method and device Download PDF

Info

Publication number
CN108429703B
CN108429703B CN201810200533.2A CN201810200533A CN108429703B CN 108429703 B CN108429703 B CN 108429703B CN 201810200533 A CN201810200533 A CN 201810200533A CN 108429703 B CN108429703 B CN 108429703B
Authority
CN
China
Prior art keywords
message
dhcp
priority queue
low
priority
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.)
Active
Application number
CN201810200533.2A
Other languages
Chinese (zh)
Other versions
CN108429703A (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.)
TP Link Technologies Co Ltd
Original Assignee
TP Link Technologies Co Ltd
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 TP Link Technologies Co Ltd filed Critical TP Link Technologies Co Ltd
Priority to CN201810200533.2A priority Critical patent/CN108429703B/en
Publication of CN108429703A publication Critical patent/CN108429703A/en
Application granted granted Critical
Publication of CN108429703B publication Critical patent/CN108429703B/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
    • H04L47/00Traffic control in data switching networks
    • H04L47/50Queue scheduling
    • H04L47/62Queue scheduling characterised by scheduling criteria
    • H04L47/6215Individual queue per QOS, rate or priority
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/50Queue scheduling
    • H04L47/62Queue scheduling characterised by scheduling criteria
    • H04L47/625Queue scheduling characterised by scheduling criteria for service slots or service orders
    • H04L47/6275Queue scheduling characterised by scheduling criteria for service slots or service orders based on priority
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L61/00Network arrangements, protocols or services for addressing or naming
    • H04L61/50Address allocation
    • H04L61/5007Internet protocol [IP] addresses
    • H04L61/5014Internet protocol [IP] addresses using dynamic host configuration protocol [DHCP] or bootstrap protocol [BOOTP]

Abstract

The invention is suitable for the technical field of network communication, and provides a DHCP client-side online method and a DHCP client-side online device, wherein the DHCP client-side online method comprises the following steps: receiving a Dynamic Host Configuration Protocol (DHCP) message; determining a priority queue to which the DHCP message is sent according to the type of the DHCP message, wherein the priority queue comprises a low priority queue and a high priority queue; searching the high priority queue; if no message exists in the high priority queue, processing the message in the low priority queue so as to enable a DHCP client corresponding to the message in the low priority queue to feed back a first message; and sending the first message to the high-priority queue, and processing the first message to perform online operation on the DHCP client corresponding to the message in the low-priority queue. The invention can solve the problem that the online can not be continuously realized due to the flow circulation congestion when a large number of DHCP clients are online simultaneously.

Description

DHCP client-side online method and device
Technical Field
The invention belongs to the technical field of network communication, and particularly relates to a DHCP client online method and a DHCP client online device.
Background
With the rise of internet of things, smart homes and wearable communication devices, the number of Dynamic Host Configuration Protocol (DHCP) clients in various environments is increased dramatically, and hundreds or even thousands of DHCP client devices in a topological environment become an increasingly common thing. The processing capacity of the server is limited, the current server can provide online service for 12-50 clients in one second, and it is common that the average waiting time of the clients exceeds 20 seconds. Due to mismatching between the number of the clients and the processing performance of the server, a retransmission mechanism of the clients is triggered, next round of flow impact is formed, and finally the situation of circular congestion of the DHCP message is caused. The interaction between the DHCP client and the server flows as follows: the client side firstly initiates a Discover message to Request IP, replies a Request message to select configuration after receiving the Offer message of the server, and finally completes an IP distribution process after receiving the ACK message, at the moment, the client side can be really on-line.
For example, when a call comes after a power failure in one cell, all the clients (say 400) are powered on at the same time to start a request, and a Discover message of the client enters a processing queue of the server. At this time, the messages in the queue are all Discover messages as shown in fig. 1 a. The server starts to process the messages according to the sequence of receiving the Discover message, sends an Offer message to the client and receives a Request message replied by the client, and the queue is as shown in fig. 1 b. Assuming that a server can process 20 Discover messages one second, 20 seconds have passed when the Request1 was processed. Client 1 considers the round of request to fail and initiates a new round of Discover1 after initialization, as shown in fig. 1 c. At this time, the server processes the Offer message and the returned ACK message is ignored by the client. At this time, the flow circulation congestion is formed, and no client can be on line.
Therefore, a new technical solution is needed to solve the above technical problems.
Disclosure of Invention
In view of this, embodiments of the present invention provide a DHCP client online method and apparatus, so as to solve the problem that when a large number of DHCP clients are online simultaneously, a flow is cyclically congested, and thus the DHCP clients cannot be online continuously.
A first aspect of an embodiment of the present invention provides a DHCP client online method, including:
receiving a Dynamic Host Configuration Protocol (DHCP) message;
determining a priority queue to which the DHCP message is sent according to the type of the DHCP message, wherein the priority queue comprises a low priority queue and a high priority queue;
searching the high priority queue;
if no message exists in the high priority queue, processing the message in the low priority queue so as to enable a DHCP client corresponding to the message in the low priority queue to feed back a first message;
and sending the first message to the high-priority queue, and processing the first message to perform online operation on the DHCP client corresponding to the message in the low-priority queue.
A second aspect of an embodiment of the present invention provides a DHCP client line loading apparatus, including:
the message receiving module is used for receiving a Dynamic Host Configuration Protocol (DHCP) message;
a queue determining module, configured to determine, according to the type of the DHCP packet, a priority queue to which the DHCP packet is sent, where the priority queue includes a low priority queue and a high priority queue;
a searching module for searching the high priority queue;
the first processing module is used for processing the messages in the low-priority queue if no message exists in the high-priority queue, so that the DHCP client corresponding to the messages in the low-priority queue feeds back the first message;
and the second processing module is used for sending the first message to the high-priority queue and processing the first message so as to upload the DHCP client corresponding to the message in the low-priority queue.
A third aspect of an embodiment of the present invention provides a DHCP client online apparatus, including a memory, a processor, and a computer program stored in the memory and executable on the processor, where the processor implements the steps of the DHCP client online method according to the first aspect when executing the computer program.
A fourth aspect of the embodiments of the present invention provides a computer-readable storage medium, where a computer program is stored, and when the computer program is executed by a processor, the computer program implements the steps of the DHCP client online method according to the first aspect.
Compared with the prior art, the embodiment of the invention has the following beneficial effects: when receiving a DHCP message, the embodiment of the invention judges whether the DHCP message is sent to a low priority queue or a high priority queue according to the message type, searches the high priority queue, and processes the message in the low priority queue when no message exists in the high priority queue, so that a DHCP client corresponding to the message feeds back a first message and processes the first message, thereby ensuring that the DHCP client is successfully on line. The embodiment of the invention can optimize the waiting time of the DHCP client by adopting a multi-queue mode to process the messages, so as to ensure that each client in a large number of DHCP clients can continuously complete the interactive process, and preferentially process the messages in the high-priority queue, thereby avoiding consuming CPU resources to process invalid messages, and the CPU can continuously provide effective online service, so that the request messages in the network topology are less and form convergence, and further avoiding the formation of cycle congestion.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings needed to be used in the embodiments or the prior art descriptions will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without inventive exercise.
FIG. 1a is an exemplary diagram of a large number of clients coming online at the same time; FIG. 1b is an exemplary diagram of a server processing Discover messages; FIG. 1c is an exemplary diagram of a Request1 message being out of time and a new Discover1 message arriving;
fig. 2 is a schematic flowchart illustrating an implementation procedure of a DHCP client online method according to an embodiment of the present invention;
FIG. 3a is an exemplary diagram of 400 DHCP client onlineup requests being received; FIG. 3b is an exemplary diagram of processing a first Discover message and receiving a Request message; FIG. 3c is an exemplary diagram of a first DHCP client going online and processing the remaining Discover messages; FIG. 3d is an exemplary diagram of a DHCP client initiating a retransmission after a first round of timeout; fig. 3e is an exemplary diagram of all DHCP clients going online and storing an overtime Discover message in a low-priority queue;
fig. 4 is a schematic diagram of a DHCP client line loading apparatus according to a second embodiment of the present invention;
fig. 5 is a schematic diagram of a DHCP client line loading apparatus according to a third embodiment of the present invention.
Detailed Description
In the following description, for purposes of explanation and not limitation, specific details are set forth, such as particular system structures, techniques, etc. in order to provide a thorough understanding of the embodiments of the invention. It will be apparent, however, to one skilled in the art that the present invention may be practiced in other embodiments that depart from these specific details. In other instances, detailed descriptions of well-known systems, devices, circuits, and methods are omitted so as not to obscure the description of the present invention with unnecessary detail.
It will be understood that the terms "comprises" and/or "comprising," when used in this specification and the appended claims, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.
It is also to be understood that the terminology used in the description of the invention herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used in the specification of the present invention and the appended claims, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise.
It should be further understood that the term "and/or" as used in this specification and the appended claims refers to and includes any and all possible combinations of one or more of the associated listed items.
As used in this specification and the appended claims, the term "if" may be interpreted contextually as "when", "upon" or "in response to a determination" or "in response to a detection". Similarly, the phrase "if it is determined" or "if a [ described condition or event ] is detected" may be interpreted contextually to mean "upon determining" or "in response to determining" or "upon detecting [ described condition or event ]" or "in response to detecting [ described condition or event ]".
It should be understood that, the sequence numbers of the steps in this embodiment do not mean the execution sequence, and the execution sequence of each process should be determined by the function and the inherent logic of the process, and should not constitute any limitation on the implementation process of the embodiment of the present invention.
In order to explain the technical means of the present invention, the following description will be given by way of specific examples.
Referring to fig. 2, which is a schematic diagram illustrating an implementation flow of a DHCP client online method according to an embodiment of the present invention, where the DHCP client online method is applied to a DHCP server, and as shown in the diagram, the DHCP client online method may include the following steps:
step S201, a DHCP message is received.
In the embodiment of the invention, the DHCP server receives the DHCP message sent by the DHCP client. The DHCP messages may be sent by a plurality of DHCP clients. For example, a DHCP client that needs to go online broadcasts a Discover message to a DHCP server. The DHCP client may refer to a device that requests to obtain network parameters such as an IP address through a DHCP protocol. The DHCP server may refer to a device responsible for allocating network parameters such as an IP address to the DHCP client.
Step S202, according to the type of the DHCP message, determining a priority queue to which the DHCP message is sent, wherein the priority queue comprises a low priority queue and a high priority queue.
In the embodiment of the present invention, "low" and "high" in the low-priority queue and the high-priority queue are only used to describe that the priority of the packet in the high-priority queue is higher than that of the packet in the low-priority queue, and may also be replaced by a first priority queue and a second priority queue, as long as the priority of the two priority queues is different, for example, the low-priority queue is replaced by the first priority queue, and the high-priority queue is replaced by the second priority queue, where the priority of the packet in the second priority queue is higher than that of the packet in the first priority queue, and is not limited herein.
Optionally, the determining, according to the type of the DHCP packet, a priority queue to which the DHCP packet is sent includes:
judging whether the DHCP message is a low-priority message or not;
if the DHCP message is a low-priority message, sending the DHCP message to a low-priority queue;
and if the DHCP message is not a low-priority message, determining that the DHCP message is a high-priority message, and sending the DHCP message to a high-priority queue.
In the embodiment of the invention, after receiving the DHCP message, the DHCP server can send the message which needs continuous service or consumes a large amount of CPU resource to the low priority queue by analyzing the message type, and other messages are sent to the high priority queue. Specifically, the Discover message may be set as a low-priority message and sent to a low-priority queue, and the messages such as Request, delete, Release, Information, and the like may be set as high-priority messages and sent to a high-priority queue. The Discover message is a very special message, which is a message in the first stage, and even if the Discover message is processed, the Request message sent by the Discover message is processed to be effective service after the Request message needs to be received. And the DHCP server processes the Discover message, not only needs to perform IP conflict check, but also needs to provide operations such as lease initialization, lease pre-allocation and the like, and is a larger message occupying DHCP server resources.
Step S203, searching the high priority queue.
Optionally, if there is a packet in the high-priority queue, the packet in the high-priority queue is processed.
In the embodiment of the invention, the DHCP server processes the high-priority message in the high-priority queue preferentially, and processes the low-priority message in the low-priority queue when the high-priority message does not exist.
Step S204, if no message exists in the high priority queue, the message in the low priority queue is processed, so that the DHCP client corresponding to the message in the low priority queue feeds back the first message.
Optionally, the low-priority queue adopts a last-in first-out stack mode.
Specifically, if no message exists in the high-priority queue, the DHCP server processes the Discover message in the low-priority queue, and replies an Offer message to a DHCP client corresponding to the Discover message (i.e., the client sending the Discover message), and the DHCP client broadcasts and sends a Request message after receiving the Offer message. The first message may be a Request message.
In the embodiment of the invention, if no high-priority message exists in the high-priority queue, the low-priority message which finally enters the low-priority queue is processed preferentially according to a last-in first-out stack mode. By adopting a last-in first-out stack mode in the low-priority queue, the problem that the processing time of a CPU is wasted when a client side initiates a retransmission request and a server processes a previous round of request message can be avoided.
Step S205, sending the first packet to the high priority queue, and processing the first packet to perform online operation on the DHCP client corresponding to the packet in the low priority queue.
Optionally, after processing the first packet, the method further includes:
and processing the residual messages in the low-priority queue.
In the embodiment of the invention, because a last-in first-out stack mode is adopted in the low-priority queue, the DHCP server only processes the latest Discover message currently received. And when the network does not initiate a new Discover session request again, processing the rest Discover messages in the low-priority queue. At this time, the DHCP server will keep silent or reply to the Offer message according to the message content, if the session of the Discover message is invalid, the DHCP client will ignore the reply, otherwise the DHCP client will continue to process the reply message and complete the subsequent online operation.
For example, suppose 400 DHCP clients come online at the same time, and the timeout period is 12 seconds. The DHCP server can process 20 Discover messages per second, and the performance of processing the Request messages is 30 messages per second. Fig. 3a is an exemplary diagram illustrating that 400 clients are on-line requests are instantaneously received by the DHCP server.
The DHCP server starts to search the high-priority queue at this time, finds that there is no message in the high-priority queue, and then starts to process the Discover message in the low-priority queue, and the DHCP client 400 (i.e., the client sending the Discover 400) receives the Offer message replied by the DHCP server and replies to the Request message corresponding to the DHCP server. FIG. 3b is an exemplary diagram illustrating processing a first Discover message and receiving a Request message.
According to the message priority, the Request message enters a high priority queue, and at this time, the DHCP server processes the Request 400 preferentially instead of the Discover 399 and replies ACK 400. And the DHCP client 400 receives the ACK message, formally completes the online, and does not initiate any request. Fig. 3c is an exemplary diagram of the first DHCP client going online and processing the remaining Discover messages.
According to the server performance analysis, the first round of timeout is 12 seconds, and a single DHCP client needs to occupy 1/12 DHCP server time (1/20+1/30), so that the online work completed by 144 DHCP clients of 12/(1/12) is handled in total, and retransmission is not initiated any more. And recording the retransmission message as New and the previous round as Old. Fig. 3d is an exemplary diagram of the DHCP client initiating a retransmission after the first timeout.
Because the DHCP server can not waste time to process the Old message, the performance of the DHCP server at the moment is still the same as that of the first round, the online service can be continuously provided for 144 clients in the overtime time of the next round, all DHCP clients can be completed through three rounds (about 30 s), and the DHCP flow is converged at the moment. Fig. 3e is an exemplary diagram of all DHCP clients going online and storing timeout Discover messages in a low-priority queue.
At this time, the DHCP server does not receive any new message and high-priority message any more, and starts to process the overtime Discover message. Because the Discover message is overtime, the DHCP server keeps silent or inquires the current distribution and replies the corresponding Offer message according to the Discover message, and because the Discover message is overtime, the reply is ignored by the DHCP client. At this time, after the message processing on the whole network and the DHCP server is finished, all the DHCP clients are on line, and the DHCP server waits for the arrival of the next DHCP message in an idle mode.
The embodiment of the invention can optimize the waiting time of the DHCP client by adopting a multi-queue mode to process the messages, so as to ensure that each client in a large number of DHCP clients can continuously complete the interactive process, and preferentially process the messages in the high-priority queue, thereby avoiding consuming CPU resources to process invalid messages, and the CPU can continuously provide effective online service, so that the request messages in the network topology are less and form convergence, and further avoiding the formation of cycle congestion.
Fig. 4 is a schematic diagram of a DHCP client line loading apparatus according to a second embodiment of the present invention, and only a part related to the second embodiment of the present invention is shown for convenience of description.
The DHCP client on-line device comprises:
a message receiving module 41, configured to receive a dynamic host configuration protocol DHCP message;
a queue determining module 42, configured to determine, according to the type of the DHCP packet, a priority queue to which the DHCP packet is sent, where the priority queue includes a low priority queue and a high priority queue;
a searching module 43, configured to search the high-priority queue;
a first processing module 44, configured to process the packet in the low-priority queue if no packet exists in the high-priority queue, so that a DHCP client corresponding to the packet in the low-priority queue feeds back a first packet;
and a second processing module 45, configured to send the first packet to the high-priority queue, and process the first packet, so as to perform online operation on a DHCP client corresponding to a packet in the low-priority queue.
Optionally, the low-priority queue adopts a last-in first-out stack mode.
Optionally, the method further includes:
a third processing module 46, configured to process the remaining packets in the low-priority queue after processing the first packet;
the queue determination module 42 includes:
the judging unit is used for judging whether the DHCP message is a low-priority message or not;
the first sending unit is used for sending the DHCP message to a low priority queue if the DHCP message is a low priority message;
and the second sending unit is used for determining that the DHCP message is a high-priority message if the DHCP message is not a low-priority message, and sending the DHCP message to a high-priority queue.
Optionally, the method further includes:
a fourth processing module 47, configured to process a packet in the high-priority queue if the packet exists in the high-priority queue.
The apparatus provided in the embodiment of the present invention may be applied to the first method embodiment, and for details, reference is made to the description of the first method embodiment, and details are not repeated here.
Fig. 5 is a schematic diagram of a DHCP client line loading apparatus according to a third embodiment of the present invention. As shown in fig. 5, the DHCP client line-up apparatus 5 of this embodiment includes: a processor 50, a memory 51 and a computer program 52 stored in said memory 51 and executable on said processor 50. The processor 50 executes the computer program 52 to implement the steps in the above-mentioned various DHCP client online method embodiments, such as steps S201 to S205 shown in fig. 2. Alternatively, the processor 50, when executing the computer program 52, implements the functions of the modules/units in the above-mentioned device embodiments, such as the functions of the modules 41 to 47 shown in fig. 4.
Illustratively, the computer program 52 may be partitioned into one or more modules/units that are stored in the memory 51 and executed by the processor 50 to implement the present invention. The one or more modules/units may be a series of computer program instruction segments capable of performing specific functions, which are used to describe the execution process of the computer program 52 in the online device 5 on the DHCP client. For example, the computer program 52 may be divided into a message receiving module, a queue determining module, a searching module, a first processing module, a second processing module, a third processing module, and a fourth processing module, and each module has the following specific functions:
the message receiving module is used for receiving a Dynamic Host Configuration Protocol (DHCP) message;
a queue determining module, configured to determine, according to the type of the DHCP packet, a priority queue to which the DHCP packet is sent, where the priority queue includes a low priority queue and a high priority queue;
a searching module for searching the high priority queue;
the first processing module is used for processing the messages in the low-priority queue if no message exists in the high-priority queue, so that the DHCP client corresponding to the messages in the low-priority queue feeds back the first message;
and the second processing module is used for sending the first message to the high-priority queue and processing the first message so as to upload the DHCP client corresponding to the message in the low-priority queue.
Optionally, the low-priority queue adopts a last-in first-out stack mode.
Optionally, the third processing module is configured to process remaining packets in the low-priority queue after processing the first packet;
the queue determination module includes:
the judging unit is used for judging whether the DHCP message is a low-priority message or not;
the first sending unit is used for sending the DHCP message to a low priority queue if the DHCP message is a low priority message;
and the second sending unit is used for determining that the DHCP message is a high-priority message if the DHCP message is not a low-priority message, and sending the DHCP message to a high-priority queue.
Optionally, the fourth processing module is configured to, if there is a packet in the high-priority queue, process the packet in the high-priority queue.
The DHCP client line up 5 may be a DHCP server. The DHCP client line-up apparatus may include, but is not limited to, a processor 50, a memory 51. Those skilled in the art will appreciate that fig. 5 is merely an example of a DHCP client on-line apparatus 5 and does not constitute a limitation on the DHCP client on-line apparatus 5 and may include more or less components than those shown, or combine some components, or different components, for example, the DHCP client on-line apparatus may also include input-output devices, network access devices, buses, etc.
It should be understood that, in the embodiment of the present invention, the Processor 50 may be a Central Processing Unit (CPU), and the Processor may also be other general purpose processors, Digital Signal Processors (DSPs), Application Specific Integrated Circuits (ASICs), Field Programmable Gate Arrays (FPGAs) or other Programmable logic devices, discrete Gate or transistor logic devices, discrete hardware components, etc. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
The memory 51 may be an internal storage unit of the DHCP client line-up 5, such as a hard disk or a memory of the DHCP client line-up 5. The memory 51 may also be an external storage device of the DHCP client line-loading device 5, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), or the like, provided on the DHCP client line-loading device 5. Further, the memory 51 may also include both an internal storage unit and an external storage device of the DHCP client line-up apparatus 5. The memory 51 is used for storing the computer program and other programs and data required by the on-line device of the DHCP client. The memory 51 may also be used to temporarily store data that has been output or is to be output.
It will be apparent to those skilled in the art that, for convenience and brevity of description, only the above-mentioned division of the functional units and modules is illustrated, and in practical applications, the above-mentioned function distribution may be performed by different functional units and modules according to needs, that is, the internal structure of the apparatus is divided into different functional units or modules to perform all or part of the above-mentioned functions. Each functional unit and module in the embodiments may be integrated in one processing unit, or each unit may exist alone physically, or two or more units are integrated in one unit, and the integrated unit may be implemented in a form of hardware, or in a form of software functional unit. In addition, specific names of the functional units and modules are only for convenience of distinguishing from each other, and are not used for limiting the protection scope of the present application. The specific working processes of the units and modules in the system may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the above embodiments, the descriptions of the respective embodiments have respective emphasis, and reference may be made to the related descriptions of other embodiments for parts that are not described or illustrated in a certain embodiment.
Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
In the embodiments provided in the present invention, it should be understood that the disclosed apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the modules or units is only one logical division, and there may be other divisions when actually implemented, for example, a plurality of units or components may be combined or may be integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated modules/units, if implemented in the form of software functional units and sold or used as separate products, may be stored in a computer readable storage medium. Based on such understanding, all or part of the flow of the method according to the embodiments of the present invention may also be implemented by a computer program, which may be stored in a computer-readable storage medium, and when the computer program is executed by a processor, the steps of the method embodiments may be implemented. Wherein the computer program comprises computer program code, which may be in the form of source code, object code, an executable file or some intermediate form, etc. The computer-readable medium may include: any entity or device capable of carrying the computer program code, recording medium, usb disk, removable hard disk, magnetic disk, optical disk, computer Memory, Read-Only Memory (ROM), Random Access Memory (RAM), electrical carrier wave signals, telecommunications signals, software distribution medium, and the like. It should be noted that the computer readable medium may contain content that is subject to appropriate increase or decrease as required by legislation and patent practice in jurisdictions, for example, in some jurisdictions, computer readable media does not include electrical carrier signals and telecommunications signals as is required by legislation and patent practice.
The above-mentioned embodiments are only used for illustrating the technical solutions of the present invention, and not for limiting the same; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; such modifications and substitutions do not substantially depart from the spirit and scope of the embodiments of the present invention, and are intended to be included within the scope of the present invention.

Claims (10)

1. A DHCP client-side online method is characterized by comprising the following steps:
receiving a Dynamic Host Configuration Protocol (DHCP) message;
determining a priority queue to which the DHCP message is sent according to the message type of the DHCP message, wherein the priority queue comprises a low priority queue and a high priority queue;
searching the high priority queue;
if no message exists in the high-priority queue, processing the message in the low-priority queue so as to enable a DHCP client corresponding to the message in the low-priority queue to feed back a first message, wherein the first message is a Request message;
and sending the first message to the high-priority queue, and processing the first message to perform online operation on the DHCP client corresponding to the message in the low-priority queue.
2. The DHCP client on-line method according to claim 1, wherein the low-priority queue adopts a last-in-first-out stack mode.
3. The DHCP client on-line method according to claim 1, further comprising, after processing the first packet:
and processing the residual messages in the low-priority queue.
4. The method as claimed in claim 1, wherein the determining the priority queue to which the DHCP message is sent according to the message type of the DHCP message comprises:
judging whether the DHCP message is a low-priority message or not according to the message type of the DHCP message;
if the DHCP message is a low-priority message, sending the DHCP message to a low-priority queue;
and if the DHCP message is not a low-priority message, determining that the DHCP message is a high-priority message, and sending the DHCP message to a high-priority queue.
5. The DHCP client on-line method according to any one of claims 1 to 4, further comprising:
and if the messages exist in the high-priority queue, processing the messages existing in the high-priority queue.
6. A DHCP client termination, comprising:
the message receiving module is used for receiving a Dynamic Host Configuration Protocol (DHCP) message;
the queue determining module is used for determining a priority queue to which the DHCP message is sent according to the message type of the DHCP message, wherein the priority queue comprises a low priority queue and a high priority queue;
a searching module for searching the high priority queue;
the first processing module is configured to process the messages in the low-priority queue if no message exists in the high-priority queue, so that a DHCP client corresponding to the messages in the low-priority queue feeds back a first message, where the first message is a Request message;
and the second processing module is used for sending the first message to the high-priority queue and processing the first message so as to upload the DHCP client corresponding to the message in the low-priority queue.
7. The DHCP client threading device of claim 6 wherein the low priority queue is in a last-in-first-out stack mode;
further comprising:
a third processing module, configured to process remaining packets in the low-priority queue after processing the first packet;
the queue determination module includes:
the judging unit is used for judging whether the DHCP message is a low-priority message or not;
the first sending unit is used for sending the DHCP message to a low priority queue if the DHCP message is a low priority message;
and the second sending unit is used for determining that the DHCP message is a high-priority message if the DHCP message is not a low-priority message, and sending the DHCP message to a high-priority queue.
8. The DHCP client line mount of claim 6 or 7, further comprising:
and the fourth processing module is used for processing the messages in the high-priority queue if the messages exist in the high-priority queue.
9. An on-line device of a DHCP client, comprising a memory, a processor and a computer program stored in the memory and executable on the processor, wherein the processor implements the steps of the on-line method of the DHCP client according to any one of claims 1 to 5 when executing the computer program.
10. A computer-readable storage medium, in which a computer program is stored, which, when being executed by a processor, carries out the steps of the DHCP client on-line method according to any one of claims 1 to 5.
CN201810200533.2A 2018-03-12 2018-03-12 DHCP client-side online method and device Active CN108429703B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810200533.2A CN108429703B (en) 2018-03-12 2018-03-12 DHCP client-side online method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810200533.2A CN108429703B (en) 2018-03-12 2018-03-12 DHCP client-side online method and device

Publications (2)

Publication Number Publication Date
CN108429703A CN108429703A (en) 2018-08-21
CN108429703B true CN108429703B (en) 2021-12-31

Family

ID=63158192

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810200533.2A Active CN108429703B (en) 2018-03-12 2018-03-12 DHCP client-side online method and device

Country Status (1)

Country Link
CN (1) CN108429703B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114448942B (en) * 2021-12-29 2023-08-29 苏州浪潮智能科技有限公司 DHCP message processing method and device, electronic equipment and storage medium
CN115603968A (en) * 2022-09-29 2023-01-13 苏州浪潮智能科技有限公司(Cn) Access control method, device, equipment and medium

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8782252B2 (en) * 2008-06-30 2014-07-15 Cisco Technology, Inc. Automatic mapping of human-meaningful parameters to network-meaningful parameters for traffic importance in home network
CN104954257A (en) * 2014-03-27 2015-09-30 苏州与或信息科技有限公司 Message forwarding system and method
CN107645570A (en) * 2016-07-22 2018-01-30 中兴通讯股份有限公司 Client loading method and device

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8782252B2 (en) * 2008-06-30 2014-07-15 Cisco Technology, Inc. Automatic mapping of human-meaningful parameters to network-meaningful parameters for traffic importance in home network
CN104954257A (en) * 2014-03-27 2015-09-30 苏州与或信息科技有限公司 Message forwarding system and method
CN107645570A (en) * 2016-07-22 2018-01-30 中兴通讯股份有限公司 Client loading method and device

Also Published As

Publication number Publication date
CN108429703A (en) 2018-08-21

Similar Documents

Publication Publication Date Title
CN108881448B (en) API request processing method and device
US10313247B2 (en) System, method, and device for network load balance processing
CN110633442A (en) Pushing method and device and electronic equipment
CN107872396B (en) Communication method with timeout control, processing device, terminal device and server
CN115004673B (en) Message pushing method, device, electronic equipment and computer readable medium
CN113485822A (en) Memory management method, system, client, server and storage medium
CN110471749B (en) Task processing method, device, computer readable storage medium and computer equipment
CN108933829A (en) A kind of load-balancing method and device
CN110162270B (en) Data storage method, storage node and medium based on distributed storage system
CN108055311B (en) HTTP asynchronous request method, device, server, terminal and storage medium
WO2014117584A1 (en) System and method for load balancing in a speech recognition system
US8539089B2 (en) System and method for vertical perimeter protection
CN108429703B (en) DHCP client-side online method and device
US8924481B2 (en) Apparatus for routing requests
CN110995817B (en) Request callback method and device and client equipment
CN106790632B (en) Streaming data concurrent transmission method and device
CN113596105B (en) Content acquisition method, edge node and computer readable storage medium
CN111526137B (en) Network accelerator compatible with server and client modes and data processing method
CN112422457B (en) Message processing method and device and computer storage medium
GB2504124A (en) Managing concurrent conversations over a communications link between a client computer and a server computer
CN113590284A (en) Cloud platform distributed component interaction task batch processing method, system and equipment
CN113032307A (en) Integrated device access request processing method and related assembly
CN111324438A (en) Request scheduling method and device, storage medium and electronic equipment
CN108111431B (en) Service data sending method, device, computing equipment and computer readable storage medium
CN110149281B (en) Message forwarding method, device 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