CN105224379B - A kind of image processing method of the many-one access based on virtual machine - Google Patents
A kind of image processing method of the many-one access based on virtual machine Download PDFInfo
- Publication number
- CN105224379B CN105224379B CN201410225466.1A CN201410225466A CN105224379B CN 105224379 B CN105224379 B CN 105224379B CN 201410225466 A CN201410225466 A CN 201410225466A CN 105224379 B CN105224379 B CN 105224379B
- Authority
- CN
- China
- Prior art keywords
- subgraph
- virtual machine
- client
- uniform service
- service distributor
- 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.)
- Expired - Fee Related
Links
Landscapes
- Information Transfer Between Computers (AREA)
Abstract
The present invention provides a kind of image processing method of the many-one access based on virtual machine, including：On the server, simulator and virtual machine uniform service distributor, several client access of virtual machine uniform service distributors are created；Virtual machine uniform service distributor establishes buffering area I for the client of each access, for storing the subgraph ID number for being issued to corresponding client；Meanwhile buffering area h is locally created in each client, for storing the subgraph received, by cache maintenance mechanism, ensures that the ID number stored in buffering area I and the subgraph stored in buffering area h are completely corresponding；When needing to issue subgraph C to client, judge whether such as exist there are the figure ID number in buffering area I, then figure ID number need to be only issued, without subgraph C is issued；Client can obtain the figure ID number by searching for buffering area h and correspond to subgraph, and be shown to screen correspondence position, so as to save network traffic flow, improve the speed that subgraph issues.
Description
Technical field
The invention belongs to technical field of the computer network, and in particular to a kind of image of the many-one access based on virtual machine
Processing method.
Background technology
With the popularization that virtual machine is applied, the demand that multiple client connects same virtual machine also occurs therewith, such as：
Monitoring, playing lantern slides play film etc..
By taking playing lantern slides as an example, for example, 5 clients are connected to same virtual machine, if necessary to play in order
100 lantern slides, the processing method used for：While virtual machine plays the 1st lantern slide, by the 1st lantern slide point
5 clients are not issued to by network, then 5 clients show the image of the 1st lantern slide respectively；Then, in virtual machine
While playing the 2nd lantern slide, the 2nd lantern slide is issued to 5 clients by network respectively, then 5 clients point
Not Xian Shi the 2nd lantern slide image；The rest may be inferred, unreal by the 100th while virtual machine plays the 100th lantern slide
Lamp piece is issued to 5 clients by network respectively, then 5 clients show the image of the 100th lantern slide respectively.Thus may be used
See, virtual machine needs to issue 100 lantern slides respectively to 5 clients by network, could realize that 5 client viewings are virtual
Machine sowing is put virtual machine as a result, with the problem of volume of transmitted data is big, network bandwidth occupancy is serious；Moreover, because screen map
As generally taking up the problem of bandwidth is larger, and also transmission speed is slower in a network with screen picture, and then influence client
Viewing experience.
The content of the invention
In view of the defects existing in the prior art, the present invention provides a kind of image procossing of the many-one access based on virtual machine
Method, to solve the above problems.
The technical solution adopted by the present invention is as follows：
The present invention provides a kind of image processing method of the many-one access based on virtual machine, comprises the following steps：
S1 on the server, by simulator QEMU virtualizing operating systems, generates a virtual machine；
On the server, virtual machine uniform service distributor VueServer is also created, several clients access institute
State virtual machine uniform service distributor；
S2, after initialization, when the simulator receives the 1st screen picture A, screen described in the simulator cutting
Image A obtains several subgraphs C, is then sent to the coordinate value of each Zhang Zitu C and each Zhang Zitu C on the screen
The virtual machine uniform service distributor；In subsequent process, when the simulator receives n-th screen picture Y, the mould
Intend device and know update parts of n-th screen picture Y compared with (n-1)th screen picture Z, and the update section is allocated as son
Scheme C, the coordinate value of subgraph C and subgraph C on the screen is then sent to the virtual machine uniform service distributor；Its
In, n >=2；The screen picture is the image shown on entire screen；
S3, the virtual machine uniform service distributor are based on preset algorithm and generate and the unique corresponding figure ID of the subgraph C
Number；Wherein, the figure ID number is related to figure attribute；
In server end, a unique corresponding buffer area is established for each client by S4；Each client sheet
Ground is also configured with a buffer area；
The virtual machine uniform service distributor handles each buffer area according to the following steps：
S41, for client I, if the virtual machine uniform service distributor is corresponding with client I in server end foundation
Buffer area I, the client I be locally also configured with buffer area h；
During initialization, the buffer area h is sky, and the client I uploads institute to the virtual machine uniform service distributor
State total spatial cache value of buffer area h；The virtual machine uniform service distributor sets remaining cache space variable K, and makes change
The initial value for measuring K is total spatial cache value of buffer area h；
The virtual machine uniform service distributor reads the buffer area I, judges to whether there is in the buffer area I and S3
In the identical ID number of the figure ID number that is calculated, if it is present performing S42-S43；If it does not exist, then perform S44；
S42, the virtual machine uniform service distributor send more new command to the client I, wherein, the more new command
It carries newer figure ID number in need and needs the coordinate w of newer figure on the screen；Meanwhile the virtual machine uniform service
Distributor not more new variables K values；
When S43, the client I receive the more new command, the caching of itself configuration is searched based on the figure ID number
Area h obtains subgraph C corresponding with the figure ID number, and is subgraph C by the screen coordinate w location updatings currently shown；
S44, the virtual machine uniform service distributor read variable K values；Then whether judgment variable K values are more than the son
Scheme the byte number of C；If it is greater, then perform S45-S46；If it is less, perform S47；
S45, the virtual machine uniform service distributor store the figure ID number of the subgraph C to the buffer area I；Its
In, each figure ID number binds the byte number of corresponding subgraph C；Then, the virtual machine uniform service distributor is to described
Client I sends more new command and cache instruction；Wherein, which, which carries, needs newer subgraph C and needs
The coordinate w of newer subgraph C on the screen；The cache instruction refers to：Notify subgraph C described in the client I local caches；
Meanwhile the virtual machine uniform service distributor more new variables K values, updated variable K values subtract subgraph for current variable K values
The byte number of C；
When S46, the client I receive the more new command and cache instruction, subgraph C storages are arrived itself
The buffer area h of configuration, and be subgraph C by the screen coordinate w location updatings currently shown；
S47, the virtual machine uniform service distributor determine whether that the buffer area h of client I itself configurations is
No is dummy status, if it is judged that being yes, then sends more new command and without cache instruction to the client I；Its
In, which, which carries, needs the coordinate w of newer subgraph C and the newer subgraph C of needs on the screen；It is described not into
Row cache instruction refers to：The local cache h of the client I does not cache the subgraph C；Meanwhile the virtual machine uniform service
Distributor not more new variables K values；
The client I receives the more new command and during without cache instruction, the subgraph C storages is not arrived
The buffer area h of itself configuration；Meanwhile by the screen coordinate w location updatings currently shown be subgraph C；
If it is judged that it is no, the virtual machine uniform service distributor is read currently least from the buffer area I
Then active figure ID number sends to the client I and deletes subgraph corresponding with most sluggish figure ID number in buffer area h,
Make the memory space of the client I release buffer areas h；Meanwhile the virtual machine uniform service distributor more new variables K values,
Updated variable K values add the byte number of the corresponding subgraph of most sluggish figure ID number for current variable K values；
After the client I receives the instruction, subgraph corresponding with most sluggish figure ID number in buffer area h is deleted；
The virtual machine uniform service distributor replaces variable K values in S44 with updated variable K values, and Xun Huan performs
S44-S47。
Preferably, in S2, when the simulator receives the 1st screen picture A, the simulator is based on default cut
Screen picture A described in dividing tactful cutting, obtains several subgraphs C；Wherein, the cutting strategy is each Zhang Zitu that cutting obtains
Byte number shared by C is between default maximum and default minimum.
Preferably, in S3, the preset algorithm is Message Digest 5 MD5；By using the Message Digest 5, phase
With subgraph C will generate identical figure ID number；And different subgraph C will generate different figure ID number.
Beneficial effects of the present invention are as follows：
The image processing method of many-one access provided by the invention based on virtual machine, can effectively improve screen picture
Downloading speed, improve client viewing screen picture Experience Degree.
Description of the drawings
Fig. 1 is the flow diagram of the image processing method of the many-one access provided by the invention based on virtual machine.
Specific embodiment
Below in conjunction with attached drawing, the present invention is described in detail：
As shown in Figure 1, the present invention provides a kind of image processing method of the many-one access based on virtual machine, including following
Step：
S1 on the server, by simulator QEMU virtualizing operating systems, generates a virtual machine；
On the server, virtual machine uniform service distributor VueServer is also created, several clients access institute
State virtual machine uniform service distributor；
S2, after initialization, when the simulator receives the 1st screen picture A, screen described in the simulator cutting
Image A obtains several subgraphs C, and byte number shared by each Zhang Zitu C that cutting strategy obtains for cutting is in default maximum and in advance
If between minimum.Then the coordinate value of each Zhang Zitu C and each Zhang Zitu C on the screen is sent to the virtual machine
Uniform service distributor；In subsequent process, when the simulator receives n-th screen picture Y, the simulator knows
The update section and is allocated as subgraph C, then by n screen picture Y compared with the update part of (n-1)th screen picture Z
The coordinate value of subgraph C and subgraph C on the screen is sent to the virtual machine uniform service distributor；Wherein, n >=2；Institute
It is the image shown on entire screen to state screen picture；
S3, the virtual machine uniform service distributor are based on preset algorithm and generate and the unique corresponding figure ID of the subgraph C
Number；Wherein, the figure ID number is related to figure attribute；For example, preset algorithm is Message Digest 5 MD5；It is plucked by using message
Algorithm is wanted, identical subgraph C will generate identical figure ID number；And different subgraph C will generate different figure ID number.Thus
It realizes and the whether identical purposes of several subgraphs C is identified by figure ID number.
In server end, a unique corresponding buffer area is established for each client by S4；Each client sheet
Ground is also configured with a buffer area；
The virtual machine uniform service distributor handles each buffer area according to the following steps：
S41, for client I, if the virtual machine uniform service distributor is corresponding with client I in server end foundation
Buffer area I, the client I be locally also configured with buffer area h；
During initialization, the buffer area h is sky, and the client I uploads institute to the virtual machine uniform service distributor
State total spatial cache value of buffer area h；The virtual machine uniform service distributor sets remaining cache space variable K, and makes change
The initial value for measuring K is total spatial cache value of buffer area h；
The virtual machine uniform service distributor reads the buffer area I, judges to whether there is in the buffer area I and S3
In the identical ID number of the figure ID number that is calculated, if it is present performing S42-S43；If it does not exist, then perform S44；
S42, the virtual machine uniform service distributor send more new command to the client I, wherein, the more new command
It carries newer figure ID number in need and needs the coordinate w of newer figure on the screen；Meanwhile the virtual machine uniform service
Distributor not more new variables K values；
When S43, the client I receive the more new command, the caching of itself configuration is searched based on the figure ID number
Area h obtains subgraph C corresponding with the figure ID number, and is subgraph C by the screen coordinate w location updatings currently shown；
S44, the virtual machine uniform service distributor read variable K values；Then whether judgment variable K values are more than the son
Scheme the byte number of C；If it is greater, then perform S45-S46；If it is less, perform S47；
S45, the virtual machine uniform service distributor store the figure ID number of the subgraph C to the buffer area I；Its
In, each figure ID number binds the byte number of corresponding subgraph C；Then, the virtual machine uniform service distributor is to described
Client I sends more new command and cache instruction；Wherein, which, which carries, needs newer subgraph C and needs
The coordinate w of newer subgraph C on the screen；The cache instruction refers to：Notify subgraph C described in the client I local caches；
Meanwhile the virtual machine uniform service distributor more new variables K values, updated variable K values subtract subgraph for current variable K values
The byte number of C；
When S46, the client I receive the more new command and cache instruction, subgraph C storages are arrived itself
The buffer area h of configuration, and be subgraph C by the screen coordinate w location updatings currently shown；
S47, the virtual machine uniform service distributor determine whether that the buffer area h of client I itself configurations is
No is dummy status, if it is judged that being yes, then sends more new command and without cache instruction to the client I；Its
In, which, which carries, needs the coordinate w of newer subgraph C and the newer subgraph C of needs on the screen；It is described not into
Row cache instruction refers to：The local cache h of the client I does not cache the subgraph C；Meanwhile the virtual machine uniform service
Distributor not more new variables K values；The client I receives the more new command and during without cache instruction, not by institute
Subgraph C storages are stated to the buffer area h of itself configuration；Meanwhile by the screen coordinate w location updatings currently shown be subgraph C；
If it is judged that it is no, the virtual machine uniform service distributor is read currently least from the buffer area I
Then active figure ID number sends to the client I and deletes subgraph corresponding with most sluggish figure ID number in buffer area h,
Make the memory space of the client I release buffer areas h；Meanwhile the virtual machine uniform service distributor more new variables K values,
Updated variable K values add the byte number of the corresponding subgraph of most sluggish figure ID number for current variable K values；The client
After I receives the instruction, subgraph corresponding with most sluggish figure ID number in buffer area h is deleted；The virtual machine uniform service
Distributor replaces variable K values in S44 with updated variable K values, and Xun Huan performs S44-S47.
The image processing method of many-one access provided by the invention based on virtual machine, has the following advantages：
(1) the subgraph C for updating part is transmitted directly to virtual machine uniform service distributor by simulator, in simulator and void
Caching need not be set between plan machine uniform service distributor, due to being used between simulator and virtual machine uniform service distributor
The machine communicates, and therefore, has larger data throughout, virtual machine uniform service distributor is enable quickly to receive simulator
The subgraph C of transmission；
(2) more client access of virtual machine uniform service distributors, also, virtual machine uniform service distributor is each
The client of a access establishes independent buffering area I, separately maintains these buffering areas, and buffering area I is issued to for storing
The ID number of the subgraph of corresponding client；Meanwhile each client locally also establishes a buffering area h, is received for storing
Subgraph, by cache maintenance mechanism, can ensure that the ID number stored in buffering area I and the subgraph stored in buffering area h are complete
In correspondence；Therefore, when needing to issue subgraph C to client, first by searching for buffering area I, judge whether in buffering area I
There are the figure ID number, if it is present only needing to issue figure ID number, without subgraph C is issued；Client is by looking into
It looks for buffering area h that can obtain the corresponding subgraph of figure ID number, and is shown to screen correspondence position, so as to save network transmission stream
Amount, improves the speed that subgraph issues.
(3) in the prior art, QEMU Server itself configure a spatial cache, safeguard a caching mechanism, can only
Realize one-to-one access, i.e.,：One QEMU Server only has access a client, has the deficiency of the wasting of resources.The present invention
In, a middleware VueServer is created, it is innovative that caching mechanism is moved on into VueServer ends by QEMU Server ends,
And pass through innovation caching mechanism, i.e.,：Independent buffering area is established for the client of each access, realizes VueServer branch
Hold the effect of multi-client connection.
The above is only the preferred embodiment of the present invention, it is noted that for the ordinary skill people of the art
For member, various improvements and modifications may be made without departing from the principle of the present invention, these improvements and modifications also should
Depending on protection scope of the present invention.
Claims (3)
1. a kind of image processing method of the many-one access based on virtual machine, which is characterized in that comprise the following steps：
S1 on the server, by simulator QEMU virtualizing operating systems, generates a virtual machine；
On the server, virtual machine uniform service distributor VueServer is also created, several clients access the void
Plan machine uniform service distributor；
S2, after initialization, when the simulator receives the 1st screen picture A, screen picture described in the simulator cutting
A obtains several subgraphs C, is then sent to the coordinate value of each Zhang Zitu C and each Zhang Zitu C on the screen described
Virtual machine uniform service distributor；In subsequent process, when the simulator receives n-th screen picture Y, the simulator
Know update parts of n-th screen picture Y compared with (n-1)th screen picture Z, and the update section be allocated as subgraph C,
Then the coordinate value of subgraph C and subgraph C on the screen is sent to the virtual machine uniform service distributor；Wherein, n
≥2；The screen picture is the image shown on entire screen；
S3, the virtual machine uniform service distributor are based on preset algorithm and generate and the unique corresponding figure ID numbers of the subgraph C；Its
In, the figure ID number is related to figure attribute；
In server end, a unique corresponding buffer area is established for each client by S4；Each client is local
There are one buffer areas for configuration；
The virtual machine uniform service distributor handles each buffer area according to the following steps：
S41, for client I, if the virtual machine uniform service distributor establishes delay corresponding with client I in server end
Area I is deposited, the client I is locally also configured with buffer area h；
During initialization, the buffer area h is sky, and the client I uploads described slow to the virtual machine uniform service distributor
Deposit total spatial cache value of area h；The virtual machine uniform service distributor sets remaining cache space variable K, and makes variable K's
Initial value is total spatial cache value of buffer area h；
The virtual machine uniform service distributor reads the buffer area I, judges to whether there is in the buffer area I and fall into a trap with S3
The identical ID number of obtained figure ID number, if it is present performing S42-S43；If it does not exist, then perform S44；
S42, the virtual machine uniform service distributor send more new command to the client I, wherein, which carries
The coordinate w of newer figure ID number in need and the newer figure of needs on the screen；Meanwhile the virtual machine uniform service distribution
Device not more new variables K values；
When S43, the client I receive the more new command, the buffer area h of itself configuration is searched based on the figure ID number,
Subgraph C corresponding with the figure ID number is obtained, and is subgraph C by the screen coordinate w location updatings currently shown；
S44, the virtual machine uniform service distributor read variable K values；Then whether judgment variable K values are more than the subgraph C
Byte number；If it is greater, then perform S45-S46；If it is less, perform S47；
S45, the virtual machine uniform service distributor store the figure ID number of the subgraph C to the buffer area I；Wherein, often
One figure ID number binds the byte number of corresponding subgraph C；Then, the virtual machine uniform service distributor is to the client
I sends more new command and cache instruction；Wherein, which, which carries, needs newer subgraph C and needs newer
The coordinate w of subgraph C on the screen；The cache instruction refers to：Notify subgraph C described in the client I local caches；Meanwhile
The virtual machine uniform service distributor more new variables K values, updated variable K values subtract the word of subgraph C for current variable K values
Joint number；
When S46, the client I receive the more new command and cache instruction, subgraph C storages are configured to itself
Buffer area h, and by the screen coordinate w location updatings currently shown be subgraph C；
S47, the virtual machine uniform service distributor determine whether the client I itself configuration buffer area h whether be
Dummy status if it is judged that being yes, then sends more new command and without cache instruction to the client I；Wherein, should
More new command, which carries, needs the coordinate w of newer subgraph C and the newer subgraph C of needs on the screen；It is described without slow
Instruction is deposited to refer to：The local cache h of the client I does not cache the subgraph C；Meanwhile the virtual machine uniform service distribution
Device not more new variables K values；The client I receives the more new command and during without cache instruction, not by the son
C storages are schemed to the buffer area h of itself configuration；Meanwhile by the screen coordinate w location updatings currently shown be subgraph C；
If it is judged that it is no, the virtual machine uniform service distributor reads current least active from the buffer area I
Figure ID number, then sent to the client I and delete subgraph corresponding with most sluggish figure ID number in buffer area h, make institute
State the memory space of client I release buffer areas h；Meanwhile the virtual machine uniform service distributor more new variables K values, update
Variable K values afterwards add the byte number of the corresponding subgraph of most sluggish figure ID number for current variable K values；The client I connects
After receiving the instruction, subgraph corresponding with most sluggish figure ID number in buffer area h is deleted；The virtual machine uniform service distribution
Device replaces variable K values in S44 with updated variable K values, and Xun Huan performs S44-S47.
2. the image processing method of the many-one access according to claim 1 based on virtual machine, which is characterized in that S2
In, when the simulator receives the 1st screen picture A, the simulator is based on screen described in default cutting strategy cutting
Curtain image A, obtains several subgraphs C；Wherein, byte number is pre- shared by each Zhang Zitu C that the cutting strategy obtains for cutting
If between maximum and default minimum.
3. the image processing method of the many-one access according to claim 1 based on virtual machine, which is characterized in that S3
In, the preset algorithm is Message Digest 5 MD5；By using the Message Digest 5, identical subgraph C will generate phase
Same figure ID number；And different subgraph C will generate different figure ID number.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410225466.1A CN105224379B (en) | 2014-05-26 | 2014-05-26 | A kind of image processing method of the many-one access based on virtual machine |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410225466.1A CN105224379B (en) | 2014-05-26 | 2014-05-26 | A kind of image processing method of the many-one access based on virtual machine |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105224379A CN105224379A (en) | 2016-01-06 |
| CN105224379B true CN105224379B (en) | 2018-05-18 |
Family
ID=54993371
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410225466.1A Expired - Fee Related CN105224379B (en) | 2014-05-26 | 2014-05-26 | A kind of image processing method of the many-one access based on virtual machine |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105224379B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113971070B (en) * | 2021-10-28 | 2024-05-28 | 上海交通大学 | Method and system suitable for multi-virtual machine on-screen display |
| CN116841660A (en) * | 2022-03-23 | 2023-10-03 | 中兴通讯股份有限公司 | Data transmission method, cloud desktop virtual machine, cloud terminal and readable storage medium |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102713848A (en) * | 2009-11-25 | 2012-10-03 | 弗雷姆霍克公司 | Methods for interfacing with a virtualized computing service over a network using a lightweight client |
| CN103810021A (en) * | 2014-02-19 | 2014-05-21 | 福建升腾资讯有限公司 | Virtual desktop displaying method based on host machine under VDI and system thereof |
-
2014
- 2014-05-26 CN CN201410225466.1A patent/CN105224379B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102713848A (en) * | 2009-11-25 | 2012-10-03 | 弗雷姆霍克公司 | Methods for interfacing with a virtualized computing service over a network using a lightweight client |
| CN103810021A (en) * | 2014-02-19 | 2014-05-21 | 福建升腾资讯有限公司 | Virtual desktop displaying method based on host machine under VDI and system thereof |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105224379A (en) | 2016-01-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20240001230A1 (en) | Memory management in gaming rendering | |
| CN105245912B (en) | A kind of method and device of buffered video data and reading video data | |
| US10834191B2 (en) | Collaboration data proxy system in cloud computing platforms | |
| US20130132504A1 (en) | Adaptive network content delivery system | |
| TWI606340B (en) | Method, computer readable storage medium and system for data caching | |
| US9832277B2 (en) | Systems and methods for adaptive partitioning in distributed cache memories | |
| CN104537119B (en) | A kind of data cached update method, data use end and system | |
| US9819985B2 (en) | System and method to manage switching between devices | |
| US20140025723A1 (en) | Cloud storage system and data storage and sharing method based on the system | |
| CN105224379B (en) | A kind of image processing method of the many-one access based on virtual machine | |
| CN106940696B (en) | Information query method and system for SDN multi-layer controller | |
| CN104281539B (en) | A kind of buffer memory management method and device | |
| EP3207457B1 (en) | Hierarchical caching for online media | |
| CN106921734A (en) | It is a kind of to be cached based on selectivity and synchronous client and server data exchange method | |
| KR20170127881A (en) | Apparatus and method for distributed storage having a high performance | |
| US20170208108A1 (en) | Streaming media with a server identified at runtime | |
| CN116614559B (en) | Data transmission method, device, system and storage medium | |
| US20140362858A1 (en) | Efficient Management of Linked-Lists Traversed by Multiple Processes | |
| JP6901262B2 (en) | Content distribution system transfer devices and programs | |
| CN105302905B (en) | A kind of information storage means and device | |
| JP2014021955A (en) | Information sharing system, server device of information sharing system, program executed by server device, and information sharing method | |
| US9002931B2 (en) | High-speed low-latency method for streaming real-time interactive images | |
| JP2011081827A (en) | Method and apparatus for calculating degree of importance for resources | |
| JP2007018108A (en) | Download list preparation method and download list preparation device by optimal division download system and its program | |
| WO2015081745A1 (en) | Method and apparatus for processing data |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20180518 Termination date: 20190526 |