CN107800789A - The distribution method and system of task manager in distributed reptile system - Google Patents
The distribution method and system of task manager in distributed reptile system Download PDFInfo
- Publication number
- CN107800789A CN107800789A CN201711000607.XA CN201711000607A CN107800789A CN 107800789 A CN107800789 A CN 107800789A CN 201711000607 A CN201711000607 A CN 201711000607A CN 107800789 A CN107800789 A CN 107800789A
- Authority
- CN
- China
- Prior art keywords
- time delay
- distributed
- task manager
- distributed apparatus
- equipment
- 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.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
- H04L67/1004—Server selection for load balancing
- H04L67/101—Server selection for load balancing based on network conditions
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/06—Management of faults, events, alarms or notifications
- H04L41/0654—Management of faults, events, alarms or notifications using network fault recovery
- H04L41/0663—Performing the actions predefined by failover planning, e.g. switching to standby network elements
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/951—Indexing; Web crawling techniques
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a kind of distribution method of task manager in distributed reptile system, methods described comprises the following steps:Distributed apparatus receives or initiated assignment messages, and the assignment messages are used to distribute task manager from distributed reptile system;Device parameter by the other equipment in broadcast to distributed reptile system, is received the broadcast message that other equipment is sent, the first optimal distributed apparatus of extraction equipment parameter from broadcast message by distributed apparatus;Distributed apparatus receives the ballot message that other equipment is sent, and the ballot message includes:Poll and the distributed apparatus of ballot, the most distributed apparatus of poll is defined as task manager;If distributed apparatus is task manager, the reptile task of processing locality is distributed into other distributed apparatus.Technical scheme provided by the invention has the advantages of efficiency high.
Description
Technical field
The present invention relates to a kind of distribution side of task manager in data processing field, more particularly to distributed reptile system
Method and system.
Background technology
(be otherwise known as web crawlers webpage spider, network robot, and among FOAF communities, more frequent is referred to as webpage
Follower), it is a kind of program or script according to certain rule, automatically crawl web message.Other is seldom
The name used also has ant, automatic indexing, simulation program or worm.
Web crawlers is really a kind of application program of network information crawl, and existing web crawlers crawl data volume is big,
The task manager of the distribution of task is randomly assigned, and it may influence the efficiency of task distribution, influences the efficiency of reptile.
The content of the invention
The application provides a kind of distribution method of task manager in distributed reptile system.It solves the skill of prior art
The shortcomings that art scheme efficiency is low.
On the one hand, there is provided a kind of distributed reptile method for allocating tasks, methods described comprise the following steps:
Distributed apparatus receives or initiated assignment messages, and the assignment messages are used to distribute from distributed reptile system
Task manager;N number of packet is sent to other M equipment of distributed apparatus by distributed apparatus successively;Distributed apparatus
M time delay of N number of packet that M equipment of statistics returns with seek the average value of the M time delay sum;Distributed apparatus receives it
The M assignment messages that his M equipment is sent obtain M time delay and average value, the time delay and be averaged that the assignment messages include the machine
Value;Distributed apparatus selects time delay and minimum equipment as task manager from M+1 time delay and average value.
Optionally, methods described also includes:
Time delay and time few distributed apparatus are defined as standby task manager, reduce the task of standby task manager
Handle threshold value.
Optionally, methods described also includes:
Such as task manager failure, start task manager of the standby task manager as distributed system.
Second aspect, there is provided a kind of distributed reptile task distribution system, the system include:Multiple distributed apparatus,
The multiple distributed apparatus includes the first distributed apparatus and other N number of distributed apparatus;
First distributed apparatus, for receiving or initiating assignment messages, the assignment messages are used for from distributed reptile system
Task manager is distributed in system;N number of packet is sent to other M equipment of distributed apparatus successively;Count M equipment
M time delay of the N number of packet returned with seek the average value of the M time delay sum;Receive the M distribution that other M equipment is sent
Message obtains M time delay and average value, and the assignment messages include the time delay and average value of the machine;From M+1 time delay and average value
Middle selection time delay and minimum equipment are as task manager;
Other N number of distributed apparatus, for obtaining local time delay and by the local time delay and being carried in assignment messages
It is sent to the first distributed apparatus.
Optionally, the distributed apparatus, it is additionally operable to time delay and time few distributed apparatus being defined as standby task pipe
Device is managed, reduces the task processing threshold value of standby task manager.
Optionally, the distributed apparatus, be additionally operable to such as task manager failure, start standby task manager as point
The task manager of cloth system.
The third aspect, there is provided a kind of distributed apparatus, including:Processor, wireless transceiver, memory and bus, it is described
Processor, wireless transceiver, memory are connected by bus,
The wireless transceiver, for receiving or initiating assignment messages, the assignment messages are used for from distributed reptile system
Task manager is distributed in system;
The processor, for N number of packet to be sent to other M equipment of distributed apparatus successively;Statistics M is set
M time delay of the standby N number of packet returned with seek the average value of the M time delay sum;Receive M points that other M equipment is sent
M time delay and average value are obtained with message, the assignment messages include the time delay and average value of the machine;From M+1 time delay and averagely
Time delay and minimum equipment are selected in value as task manager.
Optionally, the processor, it is defined as standby task manager for time delay and time few distributed apparatus, reduces
The task processing threshold value of standby task manager.
Optionally, the processor, for such as task manager failure, start standby task manager is as distributed
The task manager of system.
Fourth aspect, there is provided a kind of computer-readable recording medium, it stores the computer journey for electronic data interchange
Sequence, wherein, the computer program causes computer to perform the method that first aspect provides.
It is optimal that technical scheme provided by the invention by the method for distribution distributes parameter from multiple distributed apparatus
Equipment does not handle reptile task as task manager is done when as task manager, and the reptile of processing locality is appointed
Other distributed apparatus are distributed in business, are achieved in that the quick distribution to reptile task, improve efficiency.
Brief description of the drawings
In order to illustrate the technical solution of the embodiments of the present invention more clearly, required use in being described below to embodiment
Accompanying drawing be briefly described, it should be apparent that, drawings in the following description are some embodiments of the present invention, for this area
For those of ordinary skill, on the premise of not paying creative work, other accompanying drawings can also be obtained according to these accompanying drawings.
Fig. 1 is the distribution of task manager in a kind of distributed reptile system that the first better embodiment of the invention provides
The flow chart of method;
Fig. 2 is the distribution of task manager in a kind of distributed reptile system that the second better embodiment of the invention provides
The structure chart of system.
Fig. 3 is a kind of hardware structure diagram for distributed apparatus that the second better embodiment of the invention provides.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the present invention, the technical scheme in the embodiment of the present invention is carried out clear, complete
Site preparation describes, it is clear that described embodiment is part of the embodiment of the present invention, rather than whole embodiments.Based on this hair
Embodiment in bright, the every other implementation that those of ordinary skill in the art are obtained under the premise of creative work is not made
Example, belongs to the scope of protection of the invention.
Fig. 1 is refer to, Fig. 1 is task pipe in a kind of distributed reptile system that the first better embodiment of the invention proposes
The distribution method of device is managed, this method is as shown in figure 1, comprise the following steps:
Step S101, distributed apparatus receives or initiated assignment messages, and the assignment messages are used for from distributed reptile system
Task manager is distributed in system.
Step S102, N number of packet is sent to other M equipment of distributed apparatus by distributed apparatus successively.
Above-mentioned steps S102 implementation method can be:
Distributed apparatus obtains the size (i.e. capacity, how many individual MB or multiple KB) for the packet that history is shared;Extraction is gone through
The big minizone of history packet, by the size interval division into N number of subinterval, distributed apparatus virtually N number of packet, wherein N
The size of m-th packet in individual packet is the intermediate value in m-th subinterval in N number of section, and distributed apparatus is by N number of data
Bag is sent to M other distributed apparatus successively, and UE counts N number of packet of each access point in other M distributed apparatus
Time delay and, obtain M time delay with.
Calculation of the feedback parameter as time sum is illustrated using the example of a reality below;
Here the size of packet can specifically include:6MB, 5MB, 4MB, 3MB, 2MB, 1MB, what is divided here is N number of
Section is by taking 2 sections as an example, and specific 2 sections may range from, section 1【6MB, 4MB】;Section 2【3MB, 1MB】, that
Distributed apparatus fictionalizes 2 packets, for convenience of explanation, represents first interval virtual data bag here with packet A,
Packet B represents second interval virtual data bag, and packet A size is 5MB, and packet B size is 2MB, by packet A
And packet B is sent to M other equipment successively, (here by taking three AP as an example, respectively AP1, AP2 and AP3), AP1
ACK (1a) can be returned to later by receiving packet A, and the reception time is tACK(1a), the packet A transmission time is t1a, AP1 receptions
ACK (1b) can be returned to after to packet B, it can be t to receive the timeACK(1b), the packet B transmission time is t1b;So AP1
Time and TAP1=(tACK(1a)-t1a)+(tACK(1b)-t1b).T can similarly be calculatedAP2、TAP3Value, Ta (time delays and average
Value)=(TAP1+TAP2+TAP3)/3。
The above method, which can also obtain device parameter, to be included:Device hardware parameter, for example, internal memory, CPU, memory
Parameter, some variable elements can also be included certainly, for example, reptile task quantity, memory usage, CPU usage etc..
Step S103, distributed apparatus count N number of packet of M equipment return M time delay and, seek the M time delay
The average value of sum.
Step S104, distributed apparatus receives the M assignment messages that other M equipment is sent and obtains M time delay and be averaged
Value, the assignment messages include the time delay and average value of the machine.
Step S105, distributed apparatus selects the equipment of time delay and minimum as task from M+1 time delay and average value
Manager.
Technical scheme provided by the invention selects time delay and minimum by the method for distribution from multiple distributed apparatus
Equipment does not handle reptile task, by the reptile task of processing locality as task manager when as task manager
Other distributed apparatus are distributed to, are achieved in that the quick distribution to reptile task, improve efficiency.
Optionally, the above method can also include:
Time delay and time few distributed apparatus are defined as standby task manager, reduce the task of standby task manager
Handle threshold value.
Optionally, the above method can also include:
Such as task manager failure, start task manager of the standby task manager as distributed system.
This mode avoids repeated dispensing from influencing the course.
Fig. 2 is refer to, Fig. 2 is that a kind of distributed reptile that the second better embodiment of the invention proposes realizes system, should
System as shown in Fig. 2 including:First distributed apparatus 201 and other N number of distributed apparatus 201, the task manager with
Equipment connects;
First distributed apparatus, for receiving or initiating assignment messages, the assignment messages are used for from distributed reptile system
Task manager is distributed in system;N number of packet is sent to other M equipment of distributed apparatus successively;Count M equipment
M time delay of the N number of packet returned with seek the average value of the M time delay sum;Receive the M distribution that other M equipment is sent
Message obtains M time delay and average value, and the assignment messages include the time delay and average value of the machine;From M+1 time delay and average value
Middle selection time delay and minimum equipment are as task manager;
Other N number of distributed apparatus, for obtaining local time delay and by the local time delay and being carried in assignment messages
It is sent to the first distributed apparatus.
Optionally, first distributed apparatus 201, it is additionally operable to time delay and time few distributed apparatus being defined as standby
Task manager, reduce the task processing threshold value of standby task manager.
Optionally, first distributed apparatus 201, it is additionally operable to such as task manager failure, start standby task management
Task manager of the device as distributed system.
Refering to Fig. 3, Fig. 3 is a kind of distributed apparatus 30, including:Processor 301, wireless transceiver 302, memory 303
With bus 304, wireless transceiver 302 is used for the transceiving data between external equipment.The quantity of processor 301 can be one or
It is multiple.In some embodiments of the present application, processor 301, memory 302 and transceiver 303 can pass through bus 304 or its other party
Formula connects.The step of server 30 can be used for performing Fig. 1.The implication for the term being related on the present embodiment and citing, can
With the embodiment with reference to corresponding to figure 1.Here is omitted.
Wireless transceiver 302, for obtaining the reptile task, obtain the distance of the equipment being connected with the task manager with
And reptile task quantity.
Wherein, store program codes in memory 303.Processor 901 is used to call the program generation stored in memory 903
Code, for performing following operation:
Processor 301, for according to other M equipment that N number of packet is sent to distributed apparatus successively;Count M
M time delay of N number of packet that individual equipment returns with seek the average value of the M time delay sum;Receive the M that other M equipment is sent
Individual assignment messages obtain M time delay and average value, and the assignment messages include the time delay and average value of the machine;From M+1 time delay and
Time delay and minimum equipment are selected in average value as task manager.
It should be noted that processor 301 here can be a treatment element or multiple treatment elements
It is referred to as.For example, the treatment element can be central processing unit (Central Processing Unit, CPU) or spy
Determine integrated circuit (Application Specific Integrated Circuit, ASIC), or be arranged to implement this
Apply for one or more integrated circuits of embodiment, such as:One or more microprocessors (digital singnal
Processor, DSP), or, one or more field programmable gate array (Field Programmable Gate Array,
FPGA)。
Memory 303 can be the general designation of a storage device or multiple memory elements, and for storing and can hold
Parameter, data etc. required for line program code or the operation of application program running gear.And memory 303 can include random storage
Device (RAM), nonvolatile memory (non-volatile memory), such as magnetic disk storage, flash memory can also be included
(Flash) etc..
Bus 304 can be that industry standard architecture (Industry Standard Architecture, ISA) is total
Line, external equipment interconnection (Peripheral Component, PCI) bus or extended industry-standard architecture (Extended
Industry Standard Architecture, EISA) bus etc..The bus can be divided into address bus, data/address bus, control
Bus processed etc..For ease of representing, only represented in Fig. 3 with a thick line, it is not intended that an only bus or a type of
Bus.
The terminal can also include input/output unit, be connected to bus 304, with by bus and the grade of processor 301 its
Its part connects.The input/output unit can provide an inputting interface for operating personnel, so that operating personnel pass through the input
Interface selects item of deploying to ensure effective monitoring and control of illegal activities, and can also be other interfaces, can pass through the external miscellaneous equipment of the interface.
It should be noted that for foregoing each embodiment of the method, in order to be briefly described, therefore it is all expressed as to a system
The combination of actions of row, but those skilled in the art should know, the present invention is not limited by described sequence of movement, because
For according to the present invention, certain some step can use other orders or carry out simultaneously.Secondly, those skilled in the art also should
Know, embodiment described in this description belongs to preferred embodiment, involved action and module not necessarily this hair
Necessary to bright.
In the above-described embodiments, the description to each embodiment all emphasizes particularly on different fields, and is not described in some embodiment
Part, may refer to the associated description of other embodiment.
One of ordinary skill in the art will appreciate that all or part of step in the various methods of above-described embodiment is can
To instruct the hardware of correlation to complete by program, the program can be stored in a computer-readable recording medium, storage
Medium can include:Flash disk, read-only storage (English:Read-Only Memory, referred to as:ROM), random access device (English
Text:Random Access Memory, referred to as:RAM), disk or CD etc..
The content download method and relevant device that are there is provided above the embodiment of the present invention, system are described in detail,
Specific case used herein is set forth to the principle and embodiment of the present invention, and the explanation of above example is simply used
Understand the method and its core concept of the present invention in help;Meanwhile for those of ordinary skill in the art, according to the present invention's
Thought, there will be changes in specific embodiments and applications, in summary, this specification content should not be construed as
Limitation of the present invention.
Claims (10)
1. the distribution method of task manager in a kind of distributed reptile system, it is characterised in that methods described includes following step
Suddenly:
Distributed apparatus receives or initiated assignment messages, and the assignment messages are used to distribute from distributed reptile system to go out on missions
Manager;
N number of packet is sent to other M equipment of distributed apparatus by distributed apparatus successively;
Distributed apparatus counts M time delay of N number of packet that M equipment returns and seeks the average value of the M time delay sum;
Distributed apparatus receives the M assignment messages that other M equipment is sent and obtains M time delay and average value, the assignment messages
Time delay and average value comprising the machine;
Distributed apparatus selects time delay and minimum equipment as task manager from M+1 time delay and average value.
2. according to the method for claim 1, it is characterised in that methods described also includes:
Time delay and time few distributed apparatus are defined as standby task manager, reduce the task processing of standby task manager
Threshold value.
3. according to the method for claim 1, it is characterised in that methods described also includes:
Such as task manager failure, start task manager of the standby task manager as distributed system.
4. a kind of distributed reptile task distribution system, it is characterised in that the system includes:Multiple distributed apparatus, it is described
Multiple distributed apparatus include the first distributed apparatus and other N number of distributed apparatus;
First distributed apparatus, for receiving or initiating assignment messages, the assignment messages are used for from distributed reptile system
Distribute task manager;N number of packet is sent to other M equipment of distributed apparatus successively;M equipment of statistics returns
N number of packet M time delay and, seek the average value of the M time delay sum;Receive the M assignment messages that other M equipment is sent
M time delay and average value are obtained, the assignment messages include the time delay and average value of the machine;Selected from M+1 time delay and average value
Time delay and minimum equipment are selected as task manager;
Other N number of distributed apparatus, for obtain local time delay and, the local time delay and being carried in assignment messages is sent
To the first distributed apparatus.
5. system according to claim 4, it is characterised in that
First distributed apparatus, it is additionally operable to time delay and time few distributed apparatus being defined as standby task manager, drops
The task processing threshold value of low standby task manager.
6. according to the method for claim 4, it is characterised in that
First distributed apparatus, it is additionally operable to such as task manager failure, start standby task manager is as distributed
The task manager of system.
7. a kind of distributed apparatus, including:Processor, wireless transceiver, memory and bus, the processor, wireless receiving and dispatching
Device, memory are connected by bus, it is characterised in that
The wireless transceiver, for receiving or initiating assignment messages, the assignment messages are used for from distributed reptile system
Distribute task manager;
The processor, for N number of packet to be sent to other M equipment of distributed apparatus successively;M equipment of statistics is returned
M time delay of the N number of packet returned with seek the average value of the M time delay sum;The M distribution that other M equipment is sent is received to disappear
Breath obtains M time delay and average value, and the assignment messages include the time delay and average value of the machine;From M+1 time delay and average value
Time delay and minimum equipment are selected as task manager.
8. server according to claim 7, it is characterised in that the processor, for time delay and secondary few distribution
Equipment is defined as standby task manager, reduces the task processing threshold value of standby task manager.
9. server according to claim 7, it is characterised in that the processor, for such as task manager failure, open
Move task manager of the standby task manager as distributed system.
A kind of 10. computer-readable recording medium, it is characterised in that it stores the computer program for electronic data interchange,
Wherein, the computer program causes computer to perform the method as described in claim any one of 1-3.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201711000607.XA CN107800789A (en) | 2017-10-24 | 2017-10-24 | The distribution method and system of task manager in distributed reptile system |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201711000607.XA CN107800789A (en) | 2017-10-24 | 2017-10-24 | The distribution method and system of task manager in distributed reptile system |
Publications (1)
Publication Number | Publication Date |
---|---|
CN107800789A true CN107800789A (en) | 2018-03-13 |
Family
ID=61533635
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201711000607.XA Pending CN107800789A (en) | 2017-10-24 | 2017-10-24 | The distribution method and system of task manager in distributed reptile system |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN107800789A (en) |
Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102340543A (en) * | 2011-10-18 | 2012-02-01 | 华为技术有限公司 | Method and equipment for selecting master node of system |
EP2447893A2 (en) * | 2010-10-29 | 2012-05-02 | Fujitsu Limited | Technique for stateless distributed parallel crawling of interactive client-server applications |
CN103425519A (en) * | 2012-05-16 | 2013-12-04 | 富士通株式会社 | Distributed computing method and distributed computing system |
CN105447097A (en) * | 2015-11-10 | 2016-03-30 | 北京北信源软件股份有限公司 | Data acquisition method and system |
CN105447081A (en) * | 2015-11-04 | 2016-03-30 | 国云科技股份有限公司 | Cloud platform-oriented government affair and public opinion monitoring method |
CN107066569A (en) * | 2017-04-07 | 2017-08-18 | 武汉大学 | A kind of method of distributed network crawler system and information crawler |
-
2017
- 2017-10-24 CN CN201711000607.XA patent/CN107800789A/en active Pending
Patent Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP2447893A2 (en) * | 2010-10-29 | 2012-05-02 | Fujitsu Limited | Technique for stateless distributed parallel crawling of interactive client-server applications |
CN102340543A (en) * | 2011-10-18 | 2012-02-01 | 华为技术有限公司 | Method and equipment for selecting master node of system |
CN103425519A (en) * | 2012-05-16 | 2013-12-04 | 富士通株式会社 | Distributed computing method and distributed computing system |
CN105447081A (en) * | 2015-11-04 | 2016-03-30 | 国云科技股份有限公司 | Cloud platform-oriented government affair and public opinion monitoring method |
CN105447097A (en) * | 2015-11-10 | 2016-03-30 | 北京北信源软件股份有限公司 | Data acquisition method and system |
CN107066569A (en) * | 2017-04-07 | 2017-08-18 | 武汉大学 | A kind of method of distributed network crawler system and information crawler |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN106934027A (en) | Distributed reptile realization method and system | |
CN109218352A (en) | The common recognition confirmation method and device of Transaction Information in a kind of block chain network | |
CN109947795A (en) | The acquisition methods and device of target data | |
DE112006003087T5 (en) | Handheld content delivery system for wide area networks and method of using the same | |
CN106445473A (en) | Container deployment method and apparatus | |
CN108121511A (en) | Data processing method, device and equipment in a kind of distributed edge storage system | |
CN105264930A (en) | Transmission node and method for reporting buffer status thereof | |
CN103250382B (en) | Distribution method, apparatus and system | |
CN107705838A (en) | A kind of transmission method of medical image, device, server, medium and system | |
CN105656794B (en) | Data distributing method, device and computer readable storage medium | |
CN104582011A (en) | Method and device for mobile terminal networking | |
CN106899558A (en) | The treating method and apparatus of access request | |
CN110851275B (en) | Load transfer method and device of routing node | |
CN107786412A (en) | A kind of communication means and Related product of game virtual dedicated network | |
CN109753012A (en) | A kind of processing machine long-range control method, apparatus and system based on cloud platform | |
CN107679233A (en) | Distributed reptile method for allocating tasks and system | |
CN107589991A (en) | The webpage distribution method and system of distributed system | |
CN107800789A (en) | The distribution method and system of task manager in distributed reptile system | |
CN106952207A (en) | Monitor the electoral machinery and system of cloud platform distributed system | |
CN107766522A (en) | The distribution method and system of task manager in distributed reptile system | |
CN107729153A (en) | Web retrieval method for allocating tasks and system | |
CN107707673A (en) | Realization method and system based on webpage task | |
CN107679243A (en) | Task distributes the application process and system in distributed system | |
CN107784116A (en) | Task distributes the realization method and system in distributed system | |
CN107734504A (en) | To the realization method and system of mobile device MAC Address collection in a kind of WIFI |
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 | ||
RJ01 | Rejection of invention patent application after publication | ||
RJ01 | Rejection of invention patent application after publication |
Application publication date: 20180313 |