CN106327559B - Communication means, data processing method and computing system - Google Patents

Communication means, data processing method and computing system Download PDF

Info

Publication number
CN106327559B
CN106327559B CN201610701196.6A CN201610701196A CN106327559B CN 106327559 B CN106327559 B CN 106327559B CN 201610701196 A CN201610701196 A CN 201610701196A CN 106327559 B CN106327559 B CN 106327559B
Authority
CN
China
Prior art keywords
data packet
priority
data
packet
communication stack
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
CN201610701196.6A
Other languages
Chinese (zh)
Other versions
CN106327559A (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.)
Suzhou Wei Zhuoaoke 3d Technology Co Ltd
Original Assignee
Suzhou Wei Zhuoaoke 3d Technology 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 Suzhou Wei Zhuoaoke 3d Technology Co Ltd filed Critical Suzhou Wei Zhuoaoke 3d Technology Co Ltd
Priority to CN201610701196.6A priority Critical patent/CN106327559B/en
Publication of CN106327559A publication Critical patent/CN106327559A/en
Application granted granted Critical
Publication of CN106327559B publication Critical patent/CN106327559B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06TIMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T15/003D [Three Dimensional] image rendering
    • G06T15/005General purpose rendering architectures
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L65/00Network arrangements, protocols or services for supporting real-time applications in data packet communication
    • H04L65/1066Session management
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L65/00Network arrangements, protocols or services for supporting real-time applications in data packet communication
    • H04L65/40Support for services or applications
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L65/00Network arrangements, protocols or services for supporting real-time applications in data packet communication
    • H04L65/40Support for services or applications
    • H04L65/401Support for services or applications wherein the services involve a main real-time session and one or more additional parallel real-time or time sensitive sessions, e.g. white board sharing or spawning of a subconference

Abstract

This application discloses a kind of communication means, data processing method and computing system, to solve the problems, such as in the prior art between terminal and server can not synchronous or communications feedback have pause or delay.Class label and priority tag are added by arrangement communication stack and when data packet generates for the communication means, data packet is before being pushed into communication stack, it can first look for whether having unlocked data packet identical with its class label, if it is, then its position being pushed into storehouse further can be judged according to its priority, and data packet identical with its class label in communication stack is deleted, data packet to be processed is all newest in guarantee communication stack, avoids sending the expired data packet bring wasting of resources.

Description

Communication means, data processing method and computing system
Technical field
This application involves Internet technical field more particularly to a kind of communication means, data processing method and computing system.
Background technique
Under typical terminal-server interactive environment, the two is generally established by network and is communicated.For example, terminal user It needs to carry out interactive operation to the three-dimensional stereo model rendered by server.User wishes it can be seen that oneself and threedimensional model Interaction, or the modification of threedimensional model can be showed in the man-machine interface of terminal in real time, to improve related application It is effective.
For example, it is contemplated that control converts the example of visual angle camera lens in a three-dimensional scenic, terminal user is man-machine by terminal Interface input tool rotates threedimensional model.During user operates terminal man-machine interface, it can generate several Hundred action events, each event correspond to a new camera lens visual angle.The data information at each new camera lens visual angle, for example mirror The X of head, Y, Z axis location information will be packaged into a communication bag and be sent to server end, and then require server end for this A new camera lens perspective data generates corresponding picture.
Referring to the clock frequency of terminal handler, operation of the user in man-machine interface be can be generated more than 100 each second A event.Rule of thumb, if it is assumed that it is 16 milliseconds that server, which renders a frame image to need time for spending, it is assumed that terminal is by one In second man-machine interface operate caused by 100 events be all sent to server end, then server end needs to spend in total 1.6 Second (16ms*100) renders the picture of the required generation of operation in man-machine interface in one second corresponding.In this way, 1 second in terminal Interface operation need 1.6 seconds image renderings of server end, it is clear that this by cause between terminal and server can not It is synchronous.
Usual result of the above problems is based on affirmation mechanism, and confirmation, expression pair are sent in terminal waiting for server end The rendered completion of the image of event request, can receive next event before answering, and before acknowledging receipt of, terminal stops hair Send new event request.The defect of this method be the image frame digit rate that terminal obtains will be limited directly by it and server it Between distance, terminal distance service device is remoter, communication bag transmission time it is longer, directly result in the pause of communications feedback, make end The frame number rate of end display is decreased obviously.
Summary of the invention
The embodiment of the present application provides a kind of communication means, data processing method and computing system, to solve the prior art Between middle terminal and server can not synchronous or communications feedback have pause or delay the problem of.
A kind of communication means provided by the embodiments of the present application, comprising:
The first data packet is received, first data packet includes class label, priority tag and data information;
Judge in communication stack with the presence or absence of second number identical and unlocked as the class label of first data packet According to packet, if it is, according to the priority tag of first data packet and second data packet, first data The priority of packet and second data packet;
If the priority of first data packet is less than or equal to the priority of second data packet, by first number Replace with the priority tag of second data packet according to the priority tag of packet, and with the after the replacement priority tag One data packet covers second data packet;
If the priority of first data packet is greater than the priority of second data packet, second data are deleted Packet, and first data packet is pushed into the communication stack after data packet of the first priority not less than it.
A kind of data processing method provided by the embodiments of the present application, comprising:
The first data packet is received, first data packet includes class label, priority tag and data information;
Judge in communication stack with the presence or absence of second number identical and unlocked as the class label of first data packet According to packet, if it is, according to the priority tag of first data packet and second data packet, first data The priority of packet and second data packet;
If the priority of first data packet is less than or equal to the priority of second data packet, by first number Replace with the priority tag of second data packet according to the priority tag of packet, and with the after the replacement priority tag One data packet covers second data packet;
If the priority of first data packet is greater than the priority of second data packet, second data are deleted Packet, and first data packet is pushed into the communication stack after data packet of the first priority not less than it;
Data processing is carried out to it when first data packet reaches the bottom of the communication stack.
A kind of computing system provided by the embodiments of the present application, comprising:
Packet-receiving module, for receiving the first data packet, first data packet includes class label, priority mark Label and data information;
Categorical match module, for judging in communication stack with the presence or absence of identical as the class label of first data packet And the second unlocked data packet, if it is, by priority determination module according to first data packet and described second The priority tag of data packet, the priority of first data packet and second data packet;
If the priority of first data packet is less than or equal to the priority of second data packet, by first number The priority tag of second data packet is replaced with according to the priority tag of packet, and preferential with the replacement by Queue module The first data packet after grade label covers second data packet;
If the priority of first data packet is greater than the priority of second data packet, second data are deleted Packet, and first data packet is pushed by the data packet that first priority in the communication stack is not less than it by Queue module Later.
A kind of computing system provided by the embodiments of the present application, comprising:
Packet-receiving module, for receiving the first data packet, first data packet includes class label, priority mark Label and data information;
Categorical match module, for judging in communication stack with the presence or absence of identical as the class label of first data packet And the second unlocked data packet, if it is, by priority determination module according to first data packet and described second The priority tag of data packet, the priority of first data packet and second data packet;
If the priority of first data packet is less than or equal to the priority of second data packet, replaced by data packet The priority tag of first data packet is replaced with the priority tag of second data packet by mold changing block, and is replaced described in The first data packet after changing priority tag covers second data packet;
If the priority of first data packet is greater than the priority of second data packet, deleted by Queue module Second data packet, and first data packet is pushed into the data packet that first priority in the communication stack is not less than it Later;
Stack processing module, for carrying out data to it when first data packet reaches the bottom of the communication stack Processing.
The embodiment of the present application provides a kind of communication means, data processing method and computing system, and this method is logical by arrangement Believe storehouse and class label and priority tag are added when data packet generates, data packet, can first before being pushed into communication stack Unlocked data packet identical with its class label is searched whether, if it is, further can judge it according to its priority Be pushed into storehouse in position, and by data packet identical with its class label in communication stack delete, guarantee communication stack in The data packet of processing be all it is newest, avoid sending the expired data packet bring wasting of resources.
Detailed description of the invention
The drawings described herein are used to provide a further understanding of the present application, constitutes part of this application, this Shen Illustrative embodiments and their description please are not constituted an undue limitation on the present application for explaining the application.In the accompanying drawings:
Fig. 1 is the system architecture diagram of one embodiment network environment remote access 3-dimensional image resource of the application;
Fig. 2 is equipment inner bay composition of the one embodiment communication network weapon of the application for operational capability;
Fig. 3 is the flow chart for the communication means that one embodiment of the application provides;
Fig. 4 is the system that one embodiment terminal device of the application interacts formula access to resource on server by network Architecture diagram;
Fig. 5 is the module diagram for the data packet that one embodiment of the application provides;
Fig. 6 a to 6m is the process flow architecture diagram for the communication means that each embodiment of the application provides;
Fig. 7 is the flow chart for the communication means that one embodiment of the application provides;
Fig. 8 is the system architecture diagram for the communication processing method that one embodiment of the application provides;
Fig. 9 is the flow chart for the data processing method that one embodiment of the application provides;
Figure 10 is the module map for the computing system that one embodiment of the application provides;
Figure 11 is the module map for the computing system that one embodiment of the application provides.
Specific embodiment
To keep the purposes, technical schemes and advantages of the application clearer, below in conjunction with the application specific embodiment and Technical scheme is clearly and completely described in corresponding attached drawing.Obviously, described embodiment is only the application one Section Example, instead of all the embodiments.Based on the embodiment in the application, those of ordinary skill in the art are not doing Every other embodiment obtained under the premise of creative work out, shall fall in the protection scope of this application.
In a typical application scenarios, technology disclosed by following embodiment can more efficiently pass through network reality When access remote rendering production 3-dimensional image resource, and real-time high-efficiency is provided and with these 3-dimensional image resources carries out interacting behaviour Work energy.
In communication stack disclosed by following embodiment, the processing sequence of data packet uses the original of FIFO (first in first out) Then, and always data packet is handled one by one since bottom of stack.
Join Fig. 1, an application scenarios of the application communication means embodiment, to pass through the logical of network remote renders three-dimensional image Letter system 100.Server 101 (such as 3-dimensional image data) by network 104 and N number of terminal device 1061,1062 ..., 106N is connected, these terminal devices can respectively by user 1081,1082 ..., 108N accesses or uses.These users 1081, 1082 ..., 108N can by terminal device 1061,1062 ..., the man-machine interface on 106N browse or use remote server The network-accessible resource 102 at end.Terminal device 1061,1062 ..., 106N include various possessing independent calculation processing ability Equipment, such as desktop personal computer, laptop, tablet computer, smart phone, set-top box, game machine, light client etc. Similar devices.Although mainly having used distributed system herein to describe the external environment of this method running, retouched here The main modular and technology stated also can be applied to the completely self-contained uniprocessor home environment not being connected to the network, in this way Environment in, network-accessible resource 102 described herein may not necessarily just be physically remote from the other systems module in system.
Ginseng Fig. 2 can be divided by function in a typical terminal device 106 as modularization framework 200.Terminal Equipment 106 may include one or more processing modules 2011 ..., 201N and memory module 202.Memory module 202 can wrap Containing impermanency or permanent memory, the fixation realized using any information storage technology and removable memory, such as count Calculate instruction, data structure, program module or other data.This kind of memory is including but not limited to random access memory RAM, read only memory ROM charge rewritable read-only memory EEPROM, flash memory or other memory technologies, CD-ROM, DVD or Other optical storages, tape, the magnetic storage devices such as magnetic card, RAID disk array storage system or any other can store Information data and the medium read by computer system.
Memory module 202 may include an operating system 205 for management terminal device 106 and multiple application programs 206, the hardware and software resource that can be used including web browser.Terminal device 106 can be equipped with one or more aobvious Show module 203 for showing threedimensional model image.In certain embodiments, application program 206 can provide a personal-machine interface To user, to carry out browsing and interactive operation to threedimensional model or other two dimensions, 3-D image.The application program 206 can Comprising a web browser, the embedded program module that can handle making language document, and can provide and visited by network 104 It asks, receives, send the similar operations such as information.Terminal device 106 may include other input/output modules 204, such as keyboard, mouse Mark, loudspeaker etc..
Memory module 202 can store program instruction.Program instruction or module are comprising regular, program, object, component, with And to complete special duty or realize specific abstract data type.The program referred here to may include one from network 104 The packet-receiving module 223 of reception data, the categorical match module 225 of a lookup matched data packet class label, one For substituting, the data packet replacement module 227 of covering or replacement data packet, a heap that bottom of stack data packet is handled one by one Stack processing module 220, one by network 104 send data packet processing result transmission module 222, one by data packet successively It is pushed into the Queue module 226 of storehouse, one generates the generation module 228 of data packet according to the input of terminal user or instruction, and one A priority block 230 that insertion stack position is judged according to packet priority.
It should be noted that the communication means of the application can be applied to the above-mentioned server end for showing framework and/ Or on terminal device.It below will be first by taking the communication means be applied to server end as an example, exemplarily to the skill of the application Art scheme is illustrated.
Join Fig. 3, introduces an embodiment of the application communication means.In the present embodiment, method includes the following steps:
S11, the first data packet is received, first data packet includes class label, priority tag and data information.
Data information is generated according to the input or instruction of user.As shown in figure 4, user 108 is by human-machine operation to resource Call request occurs, one new data packet stream 301 of terminal device 106 and then transmission arrives server 101.
As shown in figure 5, being packaged with class label 402, priority tag 403 and data information 404 in data packet 400.Number It is believed that breath 404 includes at least one of static image and animation, the class for the corresponding data information that data label 402 indicates Type includes: a frame still image, one section of animation, a lens location, a camera lens focus, a camera lens vector, a camera lens Zoom level, a lens zoom mode, a camera lens visual field, a shot cuts face, a lens moving time, a mirror Head trigger, a resolution of lens, a camera lens image quality, a Gaussian filter, a three dimensional lookup table, a column Figure, a model include visual field along some axial slice, a view refreshing instruction, a change visual field or layer level command Or hierarchical arrangement supplemental characteristic, an addition mark instruction, the coordinate information comprising mark, the setting that diffuses, one Visual field bookmark under ambient light setting, a high light settings, a close-up position, the three-dimensional comprising particular point in time are looked into Table, a model shearing instruction are looked for, the kerf information comprising cutting implement, grid export instruction, a video are raw At instruction, the operation information comprising camera motion path or other change threedimensional model morphologic localizations.
S12, judge in communication stack with the presence or absence of identical and unlocked with the class label of first data packet the Two data packets, if it is, according to the priority tag of first data packet and second data packet, more described first The priority of data packet and second data packet.
In server 101 include a communication stack 302, communication stack 302 pushed data packet 310 ..., 314.? In one embodiment, this method further includes locking 302 bottom of communication stack data packet 310 being processed, locked data Packet 310 has highest priority.
It will be locked by the data packet that server 101 is handled, after treatment, the data packet is unlocked, and is destroyed. Then next data packet is processed in storehouse, so recycles.System can support what multiple data packets can be locked simultaneously Situation does not influence whole normal operation.Technical detail description below in relation to data packet locking can equally be well applied to multiple data The case where packet locking.
In the embodiment that the application data processing method provides, data packet 310 here can be handled by transmission to be referred to It enables 304 to be transferred to processor 303 and carries out data processing, which can be, for example, rendering engine.
If the priority of S13, first data packet is less than or equal to the priority of second data packet, by described the The priority tag of one data packet replaces with the priority tag of second data packet, and with after the replacement priority tag The first data packet cover second data packet.
If the priority of S14, first data packet is greater than the priority of second data packet, described second is deleted Data packet, and first data packet is pushed into the communication stack after data packet of the first priority not less than it.
In the present embodiment, if there is no identical and not as the class label of first data packet in the communication stack First data packet is then pushed into the data that first priority in the communication stack is not less than it by the second data packet of locking After packet.
Some specific embodiments are given below, the above-mentioned steps of the application are better illustrated.Wherein, priority Label is used to indicate the priority of the request processing of data packet, and exemplarily, priority may include: that 0=highest (is located Reason, be locked in), 1=higher, 2=high, 3=is medium, and 4=is lower, and 5=is minimum, described certainly in actual application The priority level definition that priority tag includes can not only be included in this, can carry out priority etc. according to the actual needs The division of grade.
In Fig. 6 a, indicate that the data packet 502 of lens location class label reaches storehouse 500 with one.Storehouse 500 is empty , therefore data packet 502 is pushed directly into storehouse, is locked, priority becomes 0.
In Fig. 6 b, second data packet 504 reaches storehouse 500, it has the class label of lens location.Storehouse 500 is opened Begin to search the data packet for possessing same class label in matching haystack queue with data packet 504.Data packet 502 possesses and data packet 504 same labels, but because it has been locked, data packet 502 will not be replaced.Therefore, data packet 504 is pushed away Enter the top of storehouse 500.
Embodiment one
In Fig. 6 c, third data packet 506 reaches storehouse 500, it is with the class label for indicating resolution ratio, storehouse 500 Begin looking for the data packet for possessing same class label in matching haystack queue with data packet 506.Although in haystack queue Comprising data packet 502,504, but their class label and new data packets are inconsistent, so data packet 506 is pushed into storehouse Top.
In Fig. 6 d, fourth data packet 508 reaches storehouse 500, it has the class label of lens location, when storehouse 500 It begins looking in matching communication stack queue when possessing the data packet of same class label with data packet 508, data packet 502,504 Matched and searched condition, due to still locked, it will not be replaced data packet 502.Data packet 504 is because possess and new data packets Class label as 508, it will be replaced covering.
In Fig. 6 e, 6f, data packet 504 is replaced by new data packets 508.Data packet 504 is destroyed, and data packet 508 replaces Position of the data packet 504 in storehouse 500, data packet 508 wraps the top for being not driven into storehouse, or is added in storehouse Any other position.
Embodiment two
In Fig. 6 g, third data packet 506 reaches storehouse 500, it is with the class label for indicating resolution ratio, priority 2, storehouse 500 begins looking for the data packet for possessing same class label in matching haystack queue with data packet 506.Although storehouse team Included unlocked data packet 502,504 in column, but their class label and new data packets are inconsistent.By preferential Grade is searched, and the priority for comparing out data packet 504 is 3, is lower than data packet 506, and the priority of data packet 502 is 0, is higher than number It according to packet 506, and is locked, so data packet 506 is pushed into the position in storehouse 500 between data packet 504 and data packet 502 It sets.
Embodiment three
In Fig. 6 h, fourth data packet 508 reaches storehouse 500, its class label with lens location, priority 1, When storehouse 500, which is begun looking for, possesses the data packet of same class label with data packet 508 in matching haystack queue, data packet 502 and 504 matched and searched conditions, data packet 502 will not be replaced due to being still locked.Data packet 504 is due to possessing sum number According to the class label as packet 508, therefore data packet 504 will be replaced by data packet 508, and data packet 508 is after priority lookup It is pushed into the corresponding position in storehouse.
In Fig. 6 i and 6j, data packet 504 is deleted.Since the priority of data packet 508 is higher than data packet 504, so number 508 it will not be pushed into position of the data packet 504 in storehouse 500 according to packet, by priority lookup, data with existing packet in storehouse 502 and 506, and the priority of data packet 508 is higher than data packet 506 but is lower than data packet 502, so data packet 508 is pushed into Position into storehouse between data packet 502 and data packet 506.
Example IV
In Fig. 6 k, fourth data packet 509 reaches storehouse 500, its class label with resolution ratio, priority 4, when Storehouse 500 is begun looking in matching haystack queue when possessing the data packet of same class label with data packet 509, data packet 506 Matched and searched condition.Data packet 506 is as possessing the class label as data packet 509, therefore data packet 506 will be by data packet 509 replacements.
In Fig. 6 l and 6m, data packet 506 is deleted.Since the priority of data packet 509 is lower than data packet 506, so number The priority tag of data packet 506 is replaced by according to the priority tag of packet 509, and will replace the data after priority tag The 509 original data packet 506 of push-in of packet is in the position of storehouse 500, without passing through priority lookup again, to save computing resource. It should be noted that the priority tag of replacement data packet 509 mentioned here, which can be server, regenerates one and number It is replaced according to 506 identical priority tags of packet and for data packet 509 or directly by the priority tag extraction in data packet 506 And it is replaced for data packet 509.
Join Fig. 7, thus it is shown that the communication means of the application is applied to server 101 and terminal device 106 again simultaneously One embodiment.
Terminal device 106 and server 101 are owned by respective storehouse 606,618.The operating mode of storehouse 606 and 618 Similar to described in above-described embodiment, details are not described herein.If certain in the flow of event 604 that terminal input device 204 issues A data packet possess with data packet 608 ..., the class label as 614, then the data packet in storehouse 606 will be by flow of event New same label data packet is replaced in 604.Wherein, if the priority of new data packet is higher, new data packets will be by It is pushed into storehouse 606 after data packet of the first priority not less than it;It should if the priority of new data packet is less than or equal to Data packet, then new data packet is replaced by the priority tag with the data packet equal priority, while covering the data packet.
If server 101 from the data packet that network 104 receives include with data packet 620 in storehouse 618 ..., 626 phases Same class label, then the data packet in storehouse 618 will be substituted by the new label received from network 104.Wherein, if newly Data packet priority it is higher, then new data packets by be pushed into first priority in storehouse 618 not less than its data packet it Afterwards;If the priority of new data packet is less than or equal to the data packet, new data packet is replaced by identical as the data packet The priority tag of priority, while covering the data packet.
Data packet 616 and data packet 628 have highest priority, and will not be replaced due to being locked for handling, Same class label is surrounded by even if from the new data of flow of event 604 or network 104.Heap in this way on terminal device 106 Stack 606 can prevent expired data packet from being sent to server 101 by network 104, while guarantee that priority level is higher Data packet can be sent to server 101 by limited, to advanced optimize treatment effeciency.
In the embodiment that the application data processing method provides, it is used for when the data for including in data packet 628 are locked When processing, it can be processed to processing data packet 630, and be sent to processor 632, such as rendering engine, processor 632 will Rendering calculation processing is done using the data information carried in processing data packet 630.
Join Fig. 8, shows the process of a new data packets push-in storehouse in process 700.
Step 701, storehouse receives the new data packets for having class label.
Step 704, storehouse is retrieved and matches the data packet for possessing same label in existing data packet with new data packets.
Step 708, if finding matched data with existing packet, check whether the packet is locked.
Step 712, if the matched data packet is locked, which is retained, and is uncovered or is ignored, storehouse Search whether that there are other unlocked matching packets.
Step 720, if the matching packet be not locked out or step 712 in find in storehouse and have other unblocked Matched data packet then judges whether the priority of new data packets is higher than matched data packet.
Step 710, if the priority of new data packets is less than or equal to matched data packet, the excellent of matched data packet is integrated First grade, and same position covers matched data cladding in storehouse, substitution.
Step 714, if the priority of new data packets is higher than matched data packet, matched data packet is deleted.
Step 706, according to the priority of new data packets, since storehouse top or the position of current deleted data packet, The data packet that first priority is not less than it is searched downwards, and new data packets are inserted into position behind.Wherein, if step Matched data with existing packet is not found in 704, then new data packets are directly entered this step 706;If do not deposited in step 712 In other unlocked matching packets, then new data packets are directly entered this step 706.
Join Fig. 9, introduces an embodiment of the application data processing method.In the present embodiment, this method includes following step It is rapid:
S21, the first data packet is received, first data packet includes class label, priority tag and data information;
S22, judge in communication stack with the presence or absence of identical and unlocked with the class label of first data packet the Two data packets, if it is, according to the priority tag of first data packet and second data packet, more described first The priority of data packet and second data packet;
If the priority of S23, first data packet is less than or equal to the priority of second data packet, by described the The priority tag of one data packet replaces with the priority tag of second data packet, and with after the replacement priority tag The first data packet cover second data packet;
If the priority of S24, first data packet is greater than the priority of second data packet, described second is deleted Data packet, and first data packet is pushed into the communication stack after data packet of the first priority not less than it;
S25, data processing is carried out to it when first data packet reaches the bottom of the communication stack.
Join Figure 10, introduces an embodiment of the application computing system, which includes:
Packet-receiving module, for receiving the first data packet, first data packet includes class label, priority mark Label and data information;
Categorical match module, for judging in communication stack with the presence or absence of identical as the class label of first data packet And the second unlocked data packet, if it is, by priority determination module according to first data packet and described second The priority tag of data packet, the priority of first data packet and second data packet;
If the priority of first data packet is less than or equal to the priority of second data packet, replaced by data packet The priority tag of first data packet is replaced with the priority tag of second data packet by mold changing block, and is replaced described in The first data packet after changing priority tag covers second data packet;
If the priority of first data packet is greater than the priority of second data packet, deleted by Queue module Second data packet, and first data packet is pushed into the data packet that first priority in the communication stack is not less than it Later.
In one embodiment, if the categorical match module judges to be not present and first data packet in the communication stack Identical and unlocked the second data packet of class label, then the Queue module is also used to first data packet being pushed into institute It states in communication stack after data packet of the first priority not less than it.
In one embodiment, the computing system further includes locking module, for the communication stack bottom is being processed Data packet locking, the locked data packet have highest priority.
Join Figure 11, introduces an embodiment of the application computing system, which includes:
Packet-receiving module, for receiving the first data packet, first data packet includes class label, priority mark Label and data information;
Categorical match module, for judging in communication stack with the presence or absence of identical as the class label of first data packet And the second unlocked data packet, if it is, by priority determination module according to first data packet and described second The priority tag of data packet, the priority of first data packet and second data packet;
If the priority of first data packet is less than or equal to the priority of second data packet, replaced by data packet The priority tag of first data packet is replaced with the priority tag of second data packet by mold changing block, and is replaced described in The first data packet after changing priority tag covers second data packet;
If the priority of first data packet is greater than the priority of second data packet, deleted by Queue module Second data packet, and first data packet is pushed into the data packet that first priority in the communication stack is not less than it Later;
Stack processing module, for carrying out data to it when first data packet reaches the bottom of the communication stack Processing.
The embodiment of the present application provides a kind of communication means, data processing method and computing system, and this method is logical by arrangement Believe storehouse and class label and priority tag are added when data packet generates, data packet, can first before being pushed into communication stack Unlocked data packet identical with its class label is searched whether, if it is, further can judge it according to its priority Be pushed into storehouse in position, and by data packet identical with its class label in communication stack delete, guarantee communication stack in The data packet of processing be all it is newest, avoid sending the expired data packet bring wasting of resources.
The present invention referring to describing with equipment (system) according to the method for the embodiment of the present invention.It should be understood that can be by calculating Machine program instruction combining information sensing apparatus implementation flow chart and/or each flow and/or block and process in block diagram The combination of figure and/or the process in block diagram and/or box.Can provide these computer program instructions to general purpose computer, specially With the processor of computer, Embedded Processor or other programmable data processing devices to generate a machine, so that passing through The instruction cooperation information induction equipment that computer or the processor of other programmable data processing devices execute generate for realizing The device for the function of being specified in one or more flows of the flowchart and/or one or more blocks of the block diagram.
These computer program instructions, which may also be stored in, is able to guide computer or other programmable data processing devices with spy Determine in the computer-readable memory that mode works, so that it includes referring to that instruction stored in the computer readable memory, which generates, Enable the manufacture of device, the command device realize in one box of one or more flows of the flowchart and/or block diagram or The function of being specified in multiple boxes.
These computer program instructions also can be loaded onto a computer or other programmable data processing device, so that counting Series of operation steps are executed on calculation machine or other programmable devices to generate computer implemented processing, thus in computer or The instruction executed on other programmable devices is provided for realizing in one or more flows of the flowchart and/or block diagram one The step of function of being specified in a box or multiple boxes.
In a typical configuration, calculating equipment includes one or more processors (CPU), input/output interface, net Network interface and memory.
Memory may include the non-volatile memory in computer-readable medium, random access memory (RAM) and/or The forms such as Nonvolatile memory, such as read-only memory (ROM) or flash memory (flash RAM).Memory is computer-readable medium Example.
Computer-readable medium includes permanent and non-permanent, removable and non-removable media can be by any method Or technology come realize information store.Information can be computer readable instructions, data structure, the module of program or other data. The example of the storage medium of computer includes, but are not limited to phase change memory (PRAM), static random access memory (SRAM), moves State random access memory (DRAM), other kinds of random access memory (RAM), read-only memory (ROM), electric erasable Programmable read only memory (EEPROM), flash memory or other memory techniques, read-only disc read only memory (CD-ROM) (CD-ROM), Digital versatile disc (DVD) or other optical storage, magnetic cassettes, tape magnetic disk storage or other magnetic storage devices Or any other non-transmission medium, can be used for storage can be accessed by a computing device information.As defined in this article, it calculates Machine readable medium does not include temporary computer readable media (transitory media), such as the data-signal and carrier wave of modulation.
It should also be noted that, the terms "include", "comprise" or its any other variant are intended to nonexcludability It include so that the process, method, commodity or the equipment that include a series of elements not only include those elements, but also to wrap Include other elements that are not explicitly listed, or further include for this process, method, commodity or equipment intrinsic want Element.In the absence of more restrictions, the element limited by sentence "including a ...", it is not excluded that including described want There is also other identical elements in the process, method of element, commodity or equipment.
The above description is only an example of the present application, is not intended to limit this application.For those skilled in the art For, various changes and changes are possible in this application.All any modifications made within the spirit and principles of the present application are equal Replacement, improvement etc., should be included within the scope of the claims of this application.

Claims (10)

1. a kind of communication means characterized by comprising
The first data packet is received, first data packet includes class label, priority tag and data information;
Judge to whether there is second data packet identical and unlocked as the class label of first data packet in communication stack, If it is, according to the priority tag of first data packet and second data packet, first data packet with The priority of second data packet;
If the priority of first data packet is less than or equal to the priority of second data packet, by first data packet Priority tag replace with the priority tag of second data packet, and with the first number after the replacement priority tag Second data packet is covered according to cladding;
If the priority of first data packet is greater than the priority of second data packet, second data packet is deleted, And first data packet is pushed into the communication stack after data packet of the first priority not less than it.
2. the method as described in claim 1, which is characterized in that the method also includes:
If second data packet identical and unlocked as the class label of first data packet is not present in the communication stack, Then first data packet is pushed into the communication stack after data packet of the first priority not less than it.
3. the method as described in claim 1, which is characterized in that the method also includes:
By communication stack bottom data packet locking being processed, the locked data packet has highest priority.
4. the method as described in claim 1, which is characterized in that the data information is including at least its of static image and animation One of;And/or the data information is generated according to the input or instruction of user.
5. the method as described in claim 1, which is characterized in that the type of the corresponding data information of the class label instruction It include: a frame still image, one section of animation, a lens location, a camera lens focus, a camera lens vector, a camera lens contracting Put grade, a lens zoom mode, a camera lens visual field, a shot cuts face, a lens moving time, a camera lens Trigger, a resolution of lens, a camera lens image quality, a Gaussian filter, a three dimensional lookup table, a histogram, One model includes visual field or layer along some axial slice, a view refreshing instruction, a change visual field or layer level command Grade setup parameter data, an addition mark instruction, the coordinate information comprising mark, the setting that diffuses, an environment Visual field bookmark under lighting settings, a high light settings, a close-up position, the three-dimensional lookup comprising particular point in time Table, a model shearing instruction, the kerf information comprising cutting implement, grid export instruction, a video generate Instruction, the operation information comprising camera motion path or other change threedimensional model morphologic localizations.
6. a kind of data processing method characterized by comprising
The first data packet is received, first data packet includes class label, priority tag and data information;
Judge to whether there is second data packet identical and unlocked as the class label of first data packet in communication stack, If it is, according to the priority tag of first data packet and second data packet, first data packet with The priority of second data packet;
If the priority of first data packet is less than or equal to the priority of second data packet, by first data packet Priority tag replace with the priority tag of second data packet, and with the first number after the replacement priority tag Second data packet is covered according to cladding;
If the priority of first data packet is greater than the priority of second data packet, second data packet is deleted, And first data packet is pushed into the communication stack after data packet of the first priority not less than it;
Data processing is carried out to it when first data packet reaches the bottom of the communication stack.
7. a kind of computing system characterized by comprising
Packet-receiving module, for receive the first data packet, first data packet include class label, priority tag and Data information;
Categorical match module, for judging in communication stack with the presence or absence of identical and not as the class label of first data packet Second data packet of locking, if it is, by priority determination module according to first data packet and second data The priority tag of packet, the priority of first data packet and second data packet;
If the priority of first data packet is less than or equal to the priority of second data packet, mould is replaced by data packet The priority tag of first data packet is replaced with the priority tag of second data packet by block, and excellent with the replacement The first data packet after first grade label covers second data packet;
If the priority of first data packet is greater than the priority of second data packet, by described in Queue module deletion Second data packet, and by first data packet be pushed into first priority in the communication stack not less than its data packet it Afterwards.
8. computing system as claimed in claim 7, which is characterized in that if the categorical match module judges the communication stack In be not present second data packet identical and unlocked as the class label of first data packet, then the Queue module is also used After first data packet to be pushed into the data packet of first priority in the communication stack not less than it.
9. computing system as claimed in claim 7, which is characterized in that the computing system further includes locking module, and being used for will Communication stack bottom data packet locking being processed, the locked data packet have highest priority.
10. a kind of computing system characterized by comprising
Packet-receiving module, for receive the first data packet, first data packet include class label, priority tag and Data information;
Categorical match module, for judging in communication stack with the presence or absence of identical and not as the class label of first data packet Second data packet of locking, if it is, by priority determination module according to first data packet and second data The priority tag of packet, the priority of first data packet and second data packet;
If the priority of first data packet is less than or equal to the priority of second data packet, mould is replaced by data packet The priority tag of first data packet is replaced with the priority tag of second data packet by block, and excellent with the replacement The first data packet after first grade label covers second data packet;
If the priority of first data packet is greater than the priority of second data packet, by described in Queue module deletion Second data packet, and by first data packet be pushed into first priority in the communication stack not less than its data packet it Afterwards;
Stack processing module, for being carried out at data when first data packet reaches the bottom of the communication stack to it Reason.
CN201610701196.6A 2016-08-22 2016-08-22 Communication means, data processing method and computing system Active CN106327559B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610701196.6A CN106327559B (en) 2016-08-22 2016-08-22 Communication means, data processing method and computing system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610701196.6A CN106327559B (en) 2016-08-22 2016-08-22 Communication means, data processing method and computing system

Publications (2)

Publication Number Publication Date
CN106327559A CN106327559A (en) 2017-01-11
CN106327559B true CN106327559B (en) 2019-03-19

Family

ID=57741215

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610701196.6A Active CN106327559B (en) 2016-08-22 2016-08-22 Communication means, data processing method and computing system

Country Status (1)

Country Link
CN (1) CN106327559B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111104229B (en) * 2018-10-26 2023-09-29 伊姆西Ip控股有限责任公司 Method, apparatus and computer readable storage medium for data processing
CN110621028B (en) * 2019-06-06 2022-12-20 珠海全志科技股份有限公司 Network distribution method, network distribution device and electronic equipment

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2000354065A (en) * 1999-06-11 2000-12-19 Mitsubishi Electric Corp Communication controller
US6498865B1 (en) * 1999-02-11 2002-12-24 Packetvideo Corp,. Method and device for control and compatible delivery of digitally compressed visual data in a heterogeneous communication network
CN101136854A (en) * 2007-03-19 2008-03-05 中兴通讯股份有限公司 Method and apparatus for implementing data packet linear speed processing
CN104731758A (en) * 2013-12-20 2015-06-24 国际商业机器公司 Coherency overcommit

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6498865B1 (en) * 1999-02-11 2002-12-24 Packetvideo Corp,. Method and device for control and compatible delivery of digitally compressed visual data in a heterogeneous communication network
JP2000354065A (en) * 1999-06-11 2000-12-19 Mitsubishi Electric Corp Communication controller
CN101136854A (en) * 2007-03-19 2008-03-05 中兴通讯股份有限公司 Method and apparatus for implementing data packet linear speed processing
CN104731758A (en) * 2013-12-20 2015-06-24 国际商业机器公司 Coherency overcommit

Also Published As

Publication number Publication date
CN106327559A (en) 2017-01-11

Similar Documents

Publication Publication Date Title
CN102800065B (en) Based on the augmented reality Apparatus and method for of Quick Response Code recognition and tracking
CN102567138A (en) Method and system for prioritization of data items for backup in a computing environment
CN104765742B (en) A kind of method and device that information is shown
US11775576B2 (en) Container image size reduction via runtime analysis
CN107277594A (en) A kind of video and audio and barrage synchronous method and device
US20160224549A1 (en) Methods, systems and recording mediums for managing conversation contents in messenger
CN109725989A (en) A kind of method and device of task execution
CN103544245A (en) Ranking list generating method and server
WO2013055946A1 (en) Data classification
CN106327559B (en) Communication means, data processing method and computing system
CN109241033A (en) The method and apparatus for creating real-time data warehouse
CN106484726B (en) A kind of page display method and device
CN111381931A (en) Disaster recovery method, device and system
CN107077347B (en) View management architecture
CN106888264B (en) A kind of method for interchanging data and device
CN107835403A (en) A kind of method and device shown with 3D parallax effects
US20220342742A1 (en) Graphical management of big data pipelines
CN106211353A (en) Data capture method, device and system
CN107547607B (en) Cluster migration method and device
KR102528526B1 (en) Product processing process application system according to application of 3d modeling fbx automation transformation technology
CN111327941B (en) Offline video playing method, device, equipment and medium
CN109842498A (en) A kind of client terminal configuring method, server, client and electronic equipment
CN103826060A (en) Photographing method and terminal
CN110290202A (en) A kind of information of Service Gateway is attached to method, apparatus and relevant device
CN110502551A (en) Data read-write method, system and infrastructure component

Legal Events

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