CN106327559A - Communication method, data processing method and calculating system - Google Patents

Communication method, data processing method and calculating system Download PDF

Info

Publication number
CN106327559A
CN106327559A CN201610701196.6A CN201610701196A CN106327559A CN 106327559 A CN106327559 A CN 106327559A CN 201610701196 A CN201610701196 A CN 201610701196A CN 106327559 A CN106327559 A CN 106327559A
Authority
CN
China
Prior art keywords
packet
priority
communication stack
class label
tag
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201610701196.6A
Other languages
Chinese (zh)
Other versions
CN106327559B (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

The invention discloses a communication method, a data processing method and a calculating system, and is to solve the problem that a terminal and a server cannot realize synchronization or communication feedback has the problem of pause or delay in the prior art. The communication method is characterized by arranging a communication stack and adding class labels and priority labels when the data packets are generated; before a data packet is pushed in the communication stack, searching whether having an unlocked the packet, the class label of which is same with the class label of the data packet; and if so, judging the position of the data packet in the communication stack according to the priority thereof, and deleting the data packet, the class label of which is same with the class label of the packet, in the communication stack, thereby ensuring the data packet to be processed in the communication stack is the newest, and preventing resource waste due to sending of the outdated data packet.

Description

Communication means, data processing method and calculating system
Technical field
The application relates to Internet technical field, particularly relates to a kind of communication means, data processing method and calculating system.
Background technology
Under typical terminal-server interactive environment, both typically set up communication by network.Such as, terminal use Need the three-dimensional stereo model rendered by server is carried out interactive operation.User wishes it can be seen that oneself is with threedimensional model Interaction, or the amendment to threedimensional model can present, in real time to improve related application in the man machine interface of terminal Effective.
For example, it is contemplated that control the example of conversion visual angle camera lens in a three-dimensional scenic, terminal use is man-machine by terminal Threedimensional model is rotated by interface input tool.During terminal man machine interface is operated by user, can generate several Hundred Action Events, each event correspond to a new camera lens visual angle.The data message at each new camera lens visual angle, such as mirror The X of head, Y, Z axis positional information, a communication bag will be packaged into and be sent to server end, and then require that server end is for this Individual new camera lens perspective data generates corresponding picture.
With reference to the clock frequency of terminal handler, user's operation in man machine interface can generate more than 100 each second Individual event.Rule of thumb, the time spent is needed to be 16 milliseconds if it is assumed that server renders a two field picture, it is assumed that terminal is by one In second, man machine interface operates produced 100 events and is all sent to server end, then server end needs to spend altogether 1.6 Second (16ms*100) renders the picture that correspondence generated required by operation in man machine interface in a second.So, terminal upper 1 second Interface operation need the server end image rendering of 1.6 seconds, it is clear that this will result between terminal and server cannot Synchronize.
Generally result of the above problems is based on affirmation mechanism, and terminal waiting for server end is sent confirmation, represented right Before should, the image of event request be the most rendered completes, and can receive next event, and before acknowledging receipt of, terminal stops sending out Send new event request.The defect of this method be the image frame digit rate that terminal obtains will be limited directly by it with server it Between distance, terminal distance service device is the most remote, communication bag transmission time the longest, 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 calculating system, in order to solve prior art Synchronize or communications feedback pause or the problem of time delay cannot be had between middle terminal and server.
A kind of communication means that the embodiment of the present application provides, including:
Receiving the first packet, described first packet includes class label, priority tag and data message;
Judge whether communication stack exists and second number of non-locking identical with the class label of described first packet According to bag, if it is, according to the priority tag of described first packet Yu described second packet, relatively described first data Bag and the priority of described second packet;
If the priority of described first packet is less than or equal to the priority of described second packet, then by described first number The priority tag of described second packet is replaced with according to the priority tag of bag, and with the after described replacement priority tag One packet covers described second packet;
If the priority of described first packet is more than the priority of described second packet, then delete described second data Bag, and described first packet is pushed after in described communication stack, first priority is not less than its packet.
A kind of data processing method that the embodiment of the present application provides, including:
Receiving the first packet, described first packet includes class label, priority tag and data message;
Judge whether communication stack exists and second number of non-locking identical with the class label of described first packet According to bag, if it is, according to the priority tag of described first packet Yu described second packet, relatively described first data Bag and the priority of described second packet;
If the priority of described first packet is less than or equal to the priority of described second packet, then by described first number The priority tag of described second packet is replaced with according to the priority tag of bag, and with the after described replacement priority tag One packet covers described second packet;
If the priority of described first packet is more than the priority of described second packet, then delete described second data Bag, and described first packet is pushed after in described communication stack, first priority is not less than its packet;
When described first packet arrives the bottom of described communication stack, it is carried out data process.
A kind of calculating system that the embodiment of the present application provides, including:
Packet-receiving module, for receiving the first packet, described first packet includes class label, priority mark Sign and data message;
Whether categorical match module is identical with the class label of described first packet for judging to exist in communication stack And the second packet of non-locking, if it is, by priority determination module according to described first packet and described second The priority tag of packet, relatively described first packet and the priority of described second packet;
If the priority of described first packet is less than or equal to the priority of described second packet, then by described first number The priority tag of described second packet is replaced with according to the priority tag of bag, and preferential with described replacement by Queue module The first packet after level label covers described second packet;
If the priority of described first packet is more than the priority of described second packet, then delete described second data Bag, and by Queue module, described first packet is pushed first priority in described communication stack and be not less than its packet Afterwards.
A kind of calculating system that the embodiment of the present application provides, including:
Packet-receiving module, for receiving the first packet, described first packet includes class label, priority mark Sign and data message;
Whether categorical match module is identical with the class label of described first packet for judging to exist in communication stack And the second packet of non-locking, if it is, by priority determination module according to described first packet and described second The priority tag of packet, relatively described first packet and the priority of described second packet;
If the priority of described first packet is less than or equal to the priority of described second packet, then replaced by packet The priority tag of described first packet is replaced with the priority tag of described second packet by die change block, and replaces with described Change the first packet after priority tag and cover described second packet;
If the priority of described first packet is more than the priority of described second packet, then deleted by Queue module Described second packet, and described first packet is pushed first priority in described communication stack be not less than its packet Afterwards;
Stack processing module, carries out data to it during for arriving the bottom of described communication stack at described first packet Process.
The embodiment of the present application provides a kind of communication means, data processing method and calculating system, and the method is logical by arranging Believing storehouse and add class label and priority tag when packet generates, packet, can first before pushing communication stack Search whether the non-locking packet identical with its class label, if it is, it can be judged according to its priority further Push the position in storehouse, and packet identical with its class label in communication stack is deleted, it is ensured that communication stack is treated The packet processed is all up-to-date, it is to avoid send the wasting of resources that expired packet brings.
Accompanying drawing explanation
Accompanying drawing described herein is used for providing further understanding of the present application, constitutes the part of the application, this Shen Schematic description and description please is used for explaining the application, is not intended that the improper restriction to the application.In the accompanying drawings:
Fig. 1 is the system architecture diagram of the application one embodiment network environment remote access 3-dimensional image resource;
Fig. 2 is the application one embodiment communication network weapon device interior Organization Chart for operational capability;
The flow chart of the communication means that Fig. 3 provides for the application one embodiment;
Fig. 4 is the system that the application one embodiment terminal unit interacts formula access by network to resource on server Organization Chart;
The module diagram of the packet that Fig. 5 provides for the application one embodiment;
The handling process Organization Chart of the communication means that Fig. 6 a to 6m provides for each embodiment of the application;
The flow chart of the communication means that Fig. 7 provides for the application one embodiment;
The system architecture diagram of the communication processing method that Fig. 8 provides for the application one embodiment;
The flow chart of the data processing method that Fig. 9 provides for the application one embodiment;
The module map of the calculating system that Figure 10 provides for the application one embodiment;
The module map of the calculating system that Figure 11 provides for the application one embodiment.
Detailed description of the invention
For making the purpose of the application, technical scheme and advantage clearer, below in conjunction with the application specific embodiment and Technical scheme is clearly and completely described by corresponding accompanying drawing.Obviously, described embodiment is only the application one Section Example rather than whole embodiments.Based on the embodiment in the application, those of ordinary skill in the art are not doing Go out the every other embodiment obtained under creative work premise, broadly fall into the scope of the application protection.
In a typical application scenarios, the technology disclosed by following example can be more efficiently real by network Time access the 3-dimensional image resource that remote rendering produces, and real-time high-efficiency is provided carry out interactive behaviour with these 3-dimensional image resources Work energy.
In communication stack disclosed by following example, the processing sequence of packet uses that FIFO's (first in first out) is former Then, and all the time from bottom of stack start to process one by one packet.
Ginseng Fig. 1, an application scenarios of the application communication means embodiment, for leading to by network remote renders three-dimensional image Communication system 100.Server 101 (such as 3-dimensional image data) by network 104 and N number of terminal unit 1061,1062 ..., 106N is connected, and these terminal units can be accessed by user 1081,1082 ..., 108N or use respectively.These users 1081, 1082 ..., 108N can browse by the man machine interface on terminal unit 1061,1062 ..., 106N or be used remote server The network-accessible resource 102 of end.Terminal unit 1061,1062 ..., 106N include that various having independently calculates disposal ability Equipment, such as desktop personal computer, notebook computer, panel computer, smart mobile phone, Set Top Box, game machine, light client etc. Similar devices.Although mainly employ distributed system to describe this method running external environment condition, retouched here The main modular stated and technology can also be applied to the completely self-contained uniprocessor home environment not having network to connect, so Environment in, network-accessible resource 102 described herein just may not necessarily be physically remote from the other system module in system.
Ginseng Fig. 2, in a typical terminal unit 106, can be divided by function as modularity framework 200.Terminal Equipment 106 can comprise one or more processing module 2011 ..., 201N and memory module 202.Memory module 202 can be wrapped Containing impermanency or permanent memory, use the fixing and removable memory that any information storage technology realizes, such as, count Calculate instruction, data structure, program module or other data.This kind of memorizer is including but not limited to, random access memory RAM, read only memory ROM, charged EROM EEPROM, flash memory or other memory technologies, CD-ROM, DVD or Other optical storage, tape, the magnetic storage apparatus such as magnetic card, RAID disk array storage system, or any other can store Information data the medium read by computer system.
Memory module 202 can comprise an operating system 205 for management terminal device 106 and multiple application program 206, the hardware and software resource that can use including web browser.Terminal unit 106 can be equipped with one or more aobvious Show that module 203 is for showing threedimensional model image.In certain embodiments, application program 206 can provide a personal-machine interface To user, in order to threedimensional model, or other two dimensions, 3-D view carries out browsing and interactive operation.This application program 206 can Comprise a web browser, the embedded program module that can process making language document, and can provide and visited by network 104 Ask, receive, the similar operations such as transmission information.Terminal unit 106 can comprise other input/output modules 204, such as keyboard, Mus Mark, microphone etc..
Memory module 202 can store programmed instruction.Programmed instruction or module comprise rule, program, object, parts, with And in order to complete special duty or to realize specific abstract data type.The program referred here to can comprise one from network 104 The packet-receiving module 223 of reception data, a categorical match module 225 searching matched data bag class label, one For substituting, cover or the packet replacement module 227 of replacement data bag, a heap that bottom of stack packet is processed one by one Stack processing module 220, a transport module 222 being sent processing data packets result by network 104, one by packet successively Pushing the Queue module 226 of storehouse, an input according to terminal use or instruction generate the generation module 228 of packet, and one The individual priority block 230 judging insertion stack position according to packet priority.
It should be noted that the communication means of the application can be applied to the above-mentioned server end illustrating framework and/ Or on terminal unit.Below will be first as a example by this communication means be applied to server end, the exemplarily skill to the application Art scheme is illustrated.
Ginseng Fig. 3, introduces an embodiment of the application communication means.In the present embodiment, the method comprises the following steps:
S11, receiving the first packet, described first packet includes class label, priority tag and data message.
Data message generates according to input or the instruction of user.As shown in Figure 4, user 108 passes through human-machine operation to resource The data packet stream 301 occurring call request, terminal unit 106 and then transmission one new arrives server 101.
As it is shown in figure 5, packet 400 is packaged with class label 402, priority tag 403 and data message 404.Number It is believed that breath 404 at least includes one of them of rest image and animation, the class of the corresponding data message of data label 402 instruction Type includes: a frame still image, one section of animation, lens location, camera lens focus, camera lens vector, camera lens Zoom level, lens zoom pattern, the camera lens visual field, shot cuts face, lens moving time, a mirror Head trigger, resolution of lens, camera lens image quality, Gaussian filter, three dimensional lookup table, a column Figure, a model, along certain axial section, a view refreshing instruction, a change visual field or layer level command, comprise visual field Or hierarchical arrangement supplemental characteristic, one add mark instruction, comprise the coordinate information of mark, setting that diffuses, one Visual field bookmark under ambient light setting, high light settings, a close-up position, the three-dimensional comprising particular point in time is looked into Look for table, a model to shear instruction, comprise the kerf information of cutting implement, grid derivation instruction, a video life Become instruction, comprise camera motion path or the operation information of other change threedimensional model morphologic localizations.
S12, judge whether communication stack exists identical with the class label of described first packet and the of non-locking Two packets, if it is, according to the priority tag of described first packet Yu described second packet, relatively described first Packet and the priority of described second packet.
Server 101 includes a communication stack 302, communication stack 302 pushed data bag 310 ..., 314.? In one embodiment, the method also includes locking packet 310 being processed bottom communication stack 302, locked data Bag 310 has limit priority.
The packet processed by server 101 will be locked, and after process terminates, this packet is unlocked, and destroys. Then in storehouse, next packet is processed, and so circulates.System can support what multiple packet can be locked simultaneously Situation, does not affect overall properly functioning.Ins and outs description below in relation to packet locking can equally be well applied to multiple data The situation of bag locking.
In the embodiment that the application data processing method provides, packet 310 here can be processed by transmission and refer to Making 304 to be transferred to processor 303 and carry out data process, this processor 303 can for example, rendering engine.
If the priority of described first packet of S13 is less than or equal to the priority of described second packet, then by described the The priority tag of one packet replaces with the priority tag of described second packet, and with after described replacement priority tag First packet cover described second packet.
If the priority of described first packet of S14 is more than the priority of described second packet, then delete described second Packet, and described first packet is pushed after in described communication stack, first priority is not less than its packet.
In the present embodiment, if described communication stack not existing identical with the class label of described first packet and not Second packet of locking, then push first priority in described communication stack by described first packet and be not less than its data After bag.
Specific embodiments more given below, better illustrate the above-mentioned steps of the application.Wherein, priority The priority that label processes for the request representing packet, exemplarily, priority may include that 0=is the highest and (located Reason, in being locked), 1=is higher, and 2=is high, and 3=is medium, and 4=is relatively low, and 5=is minimum, certainly in actual application, described 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 level.
In Fig. 6 a, arrive storehouse 500 with a packet 502 representing lens location class label.Storehouse 500 is empty , therefore packet 502 is pushed directly into storehouse, and locked, priority becomes 0.
In Fig. 6 b, second packet 504 arrives storehouse 500, and it is with the class label of lens location.Storehouse 500 is opened Begin to search in coupling haystack queue with packet 504 has the packet of same class label.Packet 502 has and packet 504 same labels, but be because it and be locked, packet 502 will not be replaced.Therefore, packet 504 is pushed away Enter the top of storehouse 500.
Embodiment one
In Fig. 6 c, the 3rd packet 506 arrives storehouse 500, and it is with the class label of expression resolution, storehouse 500 Begin look for mating in haystack queue with packet 506 has the packet of same class label.Although in haystack queue Comprise packet 502,504, but their class label is inconsistent with new data packets, so packet 506 is pushed into storehouse Top.
In Fig. 6 d, fourth data bag 508 arrives storehouse 500, and it is with the class label of lens location, when storehouse 500 Begin look for mating in communication stack queue with packet 508 have the packet of same class label time, packet 502,504 Matched and searched condition, packet 502 is owing to being still locked, and it will not be replaced.Packet 504 is because having and new data packets 508 the same class labels, it will be replaced covering.
Fig. 6 e, in 6f, packet 504 is replaced by new data packets 508.Packet 504 is destroyed, packet 508 replacement The packet 504 position in storehouse 500, packet 508 bag is not driven into the top of storehouse, or joins in storehouse Any other position.
Embodiment two
In Fig. 6 g, the 3rd packet 506 arrives storehouse 500, and it is with the class label of expression resolution, and priority is 2, storehouse 500 begins look for mating in haystack queue with packet 506 has the packet of same class label.Although storehouse team Row comprise the packet 502,504 of non-locking, but their class label is inconsistent with new data packets.By preferentially Level is searched, and it is 3 that comparison goes out the priority of packet 504, and less than packet 506, and the priority of packet 502 is 0, higher than number According to bag 506, and locked, so packet 506 is pushed into the position in storehouse 500 between packet 504 and packet 502 Put.
Embodiment three
In Fig. 6 h, fourth data bag 508 arrives storehouse 500, and it is with the class label of lens location, and priority is 1, When storehouse 500 begins look for mating and has the packet of same class label with packet 508 in haystack queue, packet 502 and 504 matched and searched conditions, packet 502, owing to being still locked, will not be replaced.Packet 504 is owing to having sum According to the same class label of bag 508, therefore packet 504 will be replaced by packet 508, and packet 508 is after priority lookup The relevant position being pushed in storehouse.
In Fig. 6 i and 6j, packet 504 is deleted.Owing to the priority of packet 508 is higher than packet 504, so number The packet 504 position in storehouse 500, by priority lookup, data with existing bag in storehouse will not be pushed into according to bag 508 502 and 506, and the priority of packet 508 is higher than packet 506 but less than packet 502, so packet 508 is pushed into Position between packet 502 and packet 506 in storehouse.
Embodiment four
In Fig. 6 k, fourth data bag 509 arrives storehouse 500, and it is with the class label of resolution, and priority is 4, when Storehouse 500 begin look for mating in haystack queue with packet 509 have the packet of same class label time, packet 506 Matched and searched condition.Packet 506 is owing to having the class label the same with packet 509, therefore packet 506 will be by packet 509 replace.
In Fig. 6 l and 6m, packet 506 is deleted.Owing to the priority of packet 509 is less than packet 506, so number It is replaced by the priority tag of packet 506 according to the priority tag of bag 509, and the data after priority tag will be replaced Bag 509 pushes original packet 506 in the position of storehouse 500, and without again by priority lookup, calculates resource to save. One and number is regenerated it should be noted that the priority tag of replacement data bag 509 mentioned here can be server According to wrapping 506 identical priority tags and replacing for packet 509 or directly by the priority tag extraction in packet 506 And replace for packet 509.
Ginseng Fig. 7, thus it is shown that the communication means of the application is applied simultaneously to server 101 and terminal unit 106 again One embodiment.
Terminal unit 106 and server 101 are owned by respective storehouse 606,618.The mode of operation of storehouse 606 and 618 To above-described embodiment described in similar, do not repeat them here.If in the flow of event 604 that terminal input device 204 sends certain Individual packet has and packet 608 ..., 614 the same class labels, then this packet in storehouse 606 will be by flow of event Same label packet new in 604 is replaced.Wherein, if the priority of new packet is higher, then new data packets will be by Push after in storehouse 606, first priority is not less than its packet;If the priority of new packet is less than or equal to being somebody's turn to do Packet, the newest packet is replaced by and the priority tag of this packet equal priority, covers this packet simultaneously.
If server 101 comprises and packet 620 ..., 626 phases storehouse 618 from the packet that network 104 receives Same class label, then this packet in storehouse 618 will be substituted by the new label received from network 104.Wherein, if newly The priority of packet higher, then new data packets by be pushed into first priority in storehouse 618 be not less than its packet it After;If the priority of new packet is less than or equal to this packet, the newest packet is replaced by identical with this packet The priority tag of priority, covers this packet simultaneously.
Packet 616 and packet 628, owing to being locked for processing, have the highest priority, and will not be replaced, New data even if from flow of event 604 or network 104 is surrounded by same class label.So heap on terminal unit 106 Stack 606 can stop expired packet to be sent to server 101 by network 104, ensures that priority level is higher simultaneously Packet can be mail to server 101 by limited, to optimize treatment effeciency further.
The application data processing method provide embodiment in, when the data comprised in packet 628 be locked for During process, it can be processed to process packet 630, and is sent to processor 632, such as rendering engine, and processor 632 will The data message that use is carried in processing packet 630 renders calculating and processes.
Ginseng Fig. 8, it is shown that in flow process 700, a new data packets is pushed the process of storehouse.
Step 701, storehouse receives a new data packets with class label.
Step 704, storehouse is retrieved and mates the packet having same label in existing packet with new data packets.
Step 708, if finding the data with existing bag of coupling, checks whether this bag is locked.
Step 712, if the packet of this coupling is locked, then this packet is retained, and is uncovered or ignores, storehouse Search whether to exist the coupling bag of other non-lockings.
Step 720, if this coupling bag is not locked out, or finds in step 712 in storehouse and has other unblocked Matched data bag, then judge that the priority of new data packets is higher than matched data bag.
Step 710, if the priority of new data packets is less than or equal to matched data bag, the most integrated matched data bag excellent First level, and same position, by matched data cladding lid, substitutes in storehouse.
Step 714, if the priority of new data packets is higher than matched data bag, then deletes matched data bag.
Step 706, according to the priority of new data packets, from the beginning of storehouse top or the current position being deleted packet, First priority of downward search is not less than its packet, and new data packets is inserted in position behind.Wherein, if step Do not find the data with existing bag of coupling in 704, then new data packets is directly entered this step 706;Without not depositing in step 712 At the coupling bag of other non-lockings, then new data packets is directly entered this step 706.
Ginseng Fig. 9, introduces an embodiment of the application data processing method.In the present embodiment, the method includes following step Rapid:
S21, receiving the first packet, described first packet includes class label, priority tag and data message;
S22, judge whether communication stack exists identical with the class label of described first packet and the of non-locking Two packets, if it is, according to the priority tag of described first packet Yu described second packet, relatively described first Packet and the priority of described second packet;
If the priority of described first packet of S23 is less than or equal to the priority of described second packet, then by described the The priority tag of one packet replaces with the priority tag of described second packet, and with after described replacement priority tag First packet cover described second packet;
If the priority of described first packet of S24 is more than the priority of described second packet, then delete described second Packet, and described first packet is pushed after in described communication stack, first priority is not less than its packet;
S25, described first packet arrive described communication stack bottom time it is carried out data process.
Ginseng Figure 10, introduces the application and calculates an embodiment of system, and this calculating system includes:
Packet-receiving module, for receiving the first packet, described first packet includes class label, priority mark Sign and data message;
Whether categorical match module is identical with the class label of described first packet for judging to exist in communication stack And the second packet of non-locking, if it is, by priority determination module according to described first packet and described second The priority tag of packet, relatively described first packet and the priority of described second packet;
If the priority of described first packet is less than or equal to the priority of described second packet, then replaced by packet The priority tag of described first packet is replaced with the priority tag of described second packet by die change block, and replaces with described Change the first packet after priority tag and cover described second packet;
If the priority of described first packet is more than the priority of described second packet, then deleted by Queue module Described second packet, and described first packet is pushed first priority in described communication stack be not less than its packet Afterwards.
In one embodiment, if described categorical match module judges not exist in described communication stack and described first packet Class label is identical and the second packet of non-locking, the most described Queue module is additionally operable to described first packet is pushed institute State after in communication stack, first priority is not less than its packet.
In one embodiment, described calculating system also includes locking module, for by being processed bottom described communication stack Packet locking, described locked packet has limit priority.
Ginseng Figure 11, introduces the application and calculates an embodiment of system, and this calculating system includes:
Packet-receiving module, for receiving the first packet, described first packet includes class label, priority mark Sign and data message;
Whether categorical match module is identical with the class label of described first packet for judging to exist in communication stack And the second packet of non-locking, if it is, by priority determination module according to described first packet and described second The priority tag of packet, relatively described first packet and the priority of described second packet;
If the priority of described first packet is less than or equal to the priority of described second packet, then replaced by packet The priority tag of described first packet is replaced with the priority tag of described second packet by die change block, and replaces with described Change the first packet after priority tag and cover described second packet;
If the priority of described first packet is more than the priority of described second packet, then deleted by Queue module Described second packet, and described first packet is pushed first priority in described communication stack be not less than its packet Afterwards;
Stack processing module, carries out data to it during for arriving the bottom of described communication stack at described first packet Process.
The embodiment of the present application provides a kind of communication means, data processing method and calculating system, and the method is logical by arranging Believing storehouse and add class label and priority tag when packet generates, packet, can first before pushing communication stack Search whether the non-locking packet identical with its class label, if it is, it can be judged according to its priority further Push the position in storehouse, and packet identical with its class label in communication stack is deleted, it is ensured that communication stack is treated The packet processed is all up-to-date, it is to avoid send the wasting of resources that expired packet brings.
The present invention is to describe with reference to method and apparatus (system) according to embodiments of the present invention.It should be understood that can be by calculating Each flow process in machine programmed instruction combining information sensing apparatus flowchart and/or block diagram and/or square frame and flow process Flow process in figure and/or block diagram and/or the combination of square frame.These computer program instructions can be provided to general purpose computer, specially With the processor of computer, Embedded Processor or other programmable data processing device to produce a machine so that pass through The instruction that the processor of computer or other programmable data processing device performs coordinates the generation of information induction equipment to be used for realizing The device of the function specified in one flow process of flow chart or multiple flow process and/or one square frame of block diagram or multiple square frame.
These computer program instructions may be alternatively stored in and computer or other programmable data processing device can be guided with spy Determine in the computer-readable memory that mode works so that the instruction being stored in this computer-readable memory produces and includes referring to Make the manufacture of device, this command device realize at one flow process of flow chart or multiple flow process and/or one square frame of block diagram or The function specified in multiple square frames.
These computer program instructions also can be loaded in computer or other programmable data processing device so that at meter Perform sequence of operations step on calculation machine or other programmable devices to produce computer implemented process, thus at computer or The instruction performed on other programmable devices provides for realizing at one flow process of flow chart or multiple flow process and/or block diagram one The step of the function specified in individual square frame or multiple square frame.
In a typical configuration, calculating equipment includes one or more processor (CPU), input/output interface, net Network interface and internal memory.
Internal memory potentially includes the 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).Internal memory is computer-readable medium Example.
Computer-readable medium includes that removable media permanent and non-permanent, removable and non-can be by any method Or technology realizes information storage.Information can be computer-readable instruction, data structure, the module of program or other data. The example of the storage medium of computer includes, but are not limited to phase transition internal memory (PRAM), static RAM (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), fast flash memory bank or other memory techniques, read-only optical disc read only memory (CD-ROM), Digital versatile disc (DVD) or other optical storage, magnetic cassette tape, the storage of tape magnetic rigid disk or other magnetic storage apparatus Or any other non-transmission medium, can be used for the information that storage can be accessed by a computing device.According to defining herein, calculate Machine computer-readable recording medium does not include temporary computer readable media (transitory media), such as data signal and the carrier wave of modulation.
Also, it should be noted term " includes ", " comprising " or its any other variant are intended to nonexcludability Comprise, so that include that the process of a series of key element, method, commodity or equipment not only include those key elements, but also wrap Include other key elements being not expressly set out, or also include want intrinsic for this process, method, commodity or equipment Element.In the case of there is no more restriction, statement " including ... " key element limited, it is not excluded that including described wanting Process, method, commodity or the equipment of element there is also other identical element.
The foregoing is only embodiments herein, be not limited to the application.For those skilled in the art For, the application can have various modifications and variations.All made within spirit herein and principle any amendment, equivalent Replacement, improvement etc., within the scope of should be included in claims hereof.

Claims (10)

1. a communication means, it is characterised in that including:
Receiving the first packet, described first packet includes class label, priority tag and data message;
Judge whether communication stack exists and second packet of non-locking identical with the class label of described first packet, If it is, according to the priority tag of described first packet Yu described second packet, relatively described first packet with The priority of described second packet;
If the priority of described first packet is less than or equal to the priority of described second packet, then by described first packet Priority tag replace with the priority tag of described second packet, and with the first number after described replacement priority tag Described second packet is covered according to cladding;
If the priority of described first packet is more than the priority of described second packet, then delete described second packet, And described first packet pushed after in described communication stack, first priority is not less than its packet.
2. the method for claim 1, it is characterised in that described method also includes:
If described communication stack does not exist and second packet of non-locking identical with the class label of described first packet, Then described first packet is pushed after in described communication stack, first priority is not less than its packet.
3. the method for claim 1, it is characterised in that described method also includes:
By packet locking being processed bottom described communication stack, described locked packet has limit priority.
4. the method for claim 1, it is characterised in that described data message at least includes its of rest image and animation One of;And/or described data message generates according to input or the instruction of user.
5. the method for claim 1, it is characterised in that the type of the corresponding data message of described data label instruction Including: a frame still image, one section of animation, lens location, camera lens focus, camera lens vector, camera lens contracting Put grade, lens zoom pattern, the camera lens visual field, shot cuts face, lens moving time, a camera lens Trigger, resolution of lens, camera lens image quality, Gaussian filter, three dimensional lookup table, block diagram, One model, along certain axial section, a view refreshing instruction, a change visual field or layer level command, comprises visual field or layer Level setup parameter data, an interpolation mark instruction, comprise the coordinate information of mark, the setting that diffuses, an environment Visual field bookmark under lighting settings, high light settings, a close-up position, comprises the three-dimensional lookup of particular point in time Instruction sheared by table, a model, comprises the kerf information of cutting implement, grid derivation instruction, a video generation Instruction, comprises camera motion path or the operation information of other change threedimensional model morphologic localizations.
6. a data processing method, it is characterised in that including:
Receiving the first packet, described first packet includes class label, priority tag and data message;
Judge whether communication stack exists and second packet of non-locking identical with the class label of described first packet, If it is, according to the priority tag of described first packet Yu described second packet, relatively described first packet with The priority of described second packet;
If the priority of described first packet is less than or equal to the priority of described second packet, then by described first packet Priority tag replace with the priority tag of described second packet, and with the first number after described replacement priority tag Described second packet is covered according to cladding;
If the priority of described first packet is more than the priority of described second packet, then delete described second packet, And described first packet pushed after in described communication stack, first priority is not less than its packet;
When described first packet arrives the bottom of described communication stack, it is carried out data process.
7. one kind calculates system, it is characterised in that including:
Packet-receiving module, for receive the first packet, described first packet include class label, priority tag and Data message;
Whether categorical match module is identical with the class label of described first packet and not for judging to exist in communication stack Second packet of locking, if it is, by priority determination module according to described first packet and described second data The priority tag of bag, relatively described first packet and the priority of described second packet;
If the priority of described first packet is less than or equal to the priority of described second packet, then replace mould by packet The priority tag of described first packet is replaced with the priority tag of described second packet by block, and excellent with described replacement The first packet after first level label covers described second packet;
If the priority of described first packet is more than the priority of described second packet, then deleted described by Queue module Second packet, and described first packet is pushed first priority in described communication stack be not less than its packet it After.
Calculate system the most as claimed in claim 1, it is characterised in that if described categorical match module judges described communication stack In there is not and second packet of non-locking identical with the class label of described first packet, the most described Queue module is also used In described first packet being pushed after in described communication stack, first priority is not less than its packet.
Calculate system the most as claimed in claim 1, it is characterised in that described calculating system also includes locking module, and being used for will Packet locking being processed bottom described communication stack, described locked packet has limit priority.
10. one kind calculates system, it is characterised in that including:
Packet-receiving module, for receive the first packet, described first packet include class label, priority tag and Data message;
Whether categorical match module is identical with the class label of described first packet and not for judging to exist in communication stack Second packet of locking, if it is, by priority determination module according to described first packet and described second data The priority tag of bag, relatively described first packet and the priority of described second packet;
If the priority of described first packet is less than or equal to the priority of described second packet, then replace mould by packet The priority tag of described first packet is replaced with the priority tag of described second packet by block, and excellent with described replacement The first packet after first level label covers described second packet;
If the priority of described first packet is more than the priority of described second packet, then deleted described by Queue module Second packet, and described first packet is pushed first priority in described communication stack be not less than its packet it After;
Stack processing module, is carried out at data it during for arriving the bottom of described communication stack at described first packet 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 true CN106327559A (en) 2017-01-11
CN106327559B 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)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110621028A (en) * 2019-06-06 2019-12-27 珠海全志科技股份有限公司 Network distribution method, network distribution device and electronic equipment
CN111104229A (en) * 2018-10-26 2020-05-05 伊姆西Ip控股有限责任公司 Method, apparatus and computer program product for data processing

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

Cited By (4)

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

Also Published As

Publication number Publication date
CN106327559B (en) 2019-03-19

Similar Documents

Publication Publication Date Title
CN102800065A (en) Augmented reality equipment and method based on two-dimensional code identification and tracking
CN105812660A (en) Video processing method based on geographic position
CN101980152A (en) Mobile middleware system and implementation method thereof
US20160224549A1 (en) Methods, systems and recording mediums for managing conversation contents in messenger
WO2015105971A1 (en) Methods for generating an activity stream
CN109582452A (en) A kind of container dispatching method, dispatching device and electronic equipment
WO2013055946A1 (en) Data classification
CN109241033A (en) The method and apparatus for creating real-time data warehouse
CN110457334A (en) Information-pushing method, device, electronic equipment and readable storage medium storing program for executing
CN102724403A (en) Method for determining shooting sheet number and shooting device
CN106327559A (en) Communication method, data processing method and calculating system
CN106209931A (en) The update method of the information of a kind of resource, device and system
CN105279431A (en) Method, device, and system for recording operation information in mobile device
CN107403012A (en) A kind of method for interchanging data and device
CN109857449A (en) Code administration method, apparatus, terminal and readable storage medium storing program for executing based on Intranet
CN109976832A (en) It is a kind of that the method and apparatus of boarding program is provided
CN113626002A (en) Service execution method and device
CN106649728B (en) Film and video media asset management system and method
CN104572926B (en) Browse the method and mobile terminal of webpage
CN106327542A (en) Picture layer synthesis method and system, client and server
CN103645896B (en) Method and device for achieving application function based on HTML5
CN106557530B (en) Operation system, data recovery method and device
CN108681492A (en) Data processing method and device
CN109582406A (en) Use the safety survey based on drama of tabulating equipment frame
CN113835827A (en) Application deployment method and device based on container Docker and electronic equipment

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