CN108768886A - A kind of SaaS data access increased quality method - Google Patents
A kind of SaaS data access increased quality method Download PDFInfo
- Publication number
- CN108768886A CN108768886A CN201810537106.3A CN201810537106A CN108768886A CN 108768886 A CN108768886 A CN 108768886A CN 201810537106 A CN201810537106 A CN 201810537106A CN 108768886 A CN108768886 A CN 108768886A
- Authority
- CN
- China
- Prior art keywords
- request
- service
- queue
- grade
- data access
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/6215—Individual queue per QOS, rate or priority
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention proposes a kind of SaaS data access increased quality method, is related to computer network field, includes the following steps：S101：The rank to data access request is determined according to the processing capacity of the demand of SaaS data access, the access sequence of data packet and storage system；S201：According to determining data access request rank, storage request is split, and the method for request queue scheduling is determined after the completion of segmentation；S301：Schedulability verification is carried out to the method for determining request queue scheduling；S401：If verification result passes through, data dispatch is carried out according to the method that determining request queue is dispatched, if not passing through, repeatedly step S201, data dispatch is carried out after being verified according to the method that determining request queue is dispatched.The present invention can be directed to the characteristics of SaaS multi-user, and the performance of user is isolated with the method for request queue, using storage request segmentation and the multilevel queue scheduling based on grade of service classification, meet the QoS requirement of different brackets user.
Description
Technical field
The invention belongs to technical field of the computer network, more particularly to a kind of SaaS data access increased quality method.
Background technology
Currently, in computer network field, service quality is the probability that network meets business demand.In many internets
In interactive system and some worried applications, a kind of technology being used for solving the problems, such as network delay and network congestion is needed, is ensured
The bandwidth of data transmission and response time within the acceptable range, that is, ensure the QoS requirement of the service.
Towards the mass storage system (MSS) in SaaS applications, due to shared same set of hardware storage device and network between user
The access of other users is audible if certain user occupies a large amount of network bandwidths to the access of storage system in fine landscape by outlet,
In current data access system, the multi-user mode of SaaS is not considered.In SaaS applications, storage system is by more
The distributed file system of file server composition, client and application program are by network connection to file system, file
It is stored under different server and path.Every server has different network bandwidth and service ability, to meet each text
The QoS requirement of part has new challenge under distributed environment.In the prior art, a kind of solution is by pre-
The network transmission bandwidth for surveying internet node, copy dynamic creation method when using operation, realizes the guarantee of service quality；The
Two kinds of methods are to use to distribute network and storage resource in advance for user, bottleneck are searched when improving load, with breaking part
The form of user ensures the demand of service quality.But both methods has many inconvenience in practical operation, and such as first
There is the deviation of prediction result, so as to cause the bad situation of service quality then due to the unstability of network in kind method；And the
Two kinds of methods then influence whether the usage experience of user due to breaking part user.
Therefore, it in view of said program in actual fabrication and in place of implementing using upper missing, and corrected, improved, together
When in line with the spirit and theory asked, and by the knowledge of profession, the auxiliary of experience, and after multi-party clever thought, experiment, just found
Go out the present invention, spy provides a kind of SaaS data access increased quality method again, the characteristics of capable of being directed to SaaS multi-user, with request
The performance of user is isolated in the method for queue, using storage request segmentation and the multi-queue tune based on grade of service classification
Degree, meets the QoS requirement of different brackets user.
Invention content
The present invention proposes a kind of SaaS data access increased quality method, solves the problems of the prior art.
The technical proposal of the invention is realized in this way：SaaS data access increased quality methods, include the following steps：
S101：Processing capacity according to the demand of SaaS data access, the access sequence of data packet and storage system is true
The fixed rank to data access request；
S201：According to determining data access request rank, storage request is split, and is determined after the completion of segmentation
The method of request queue scheduling；
S301：Schedulability verification is carried out to the method for determining request queue scheduling；
S401：If verification result passes through, data dispatch is carried out according to the method that determining request queue is dispatched, if obstructed
It crosses, then repeatedly step S201, until carrying out data dispatch according to the method that determining request queue is dispatched after being verified.
Preferably, the rank to data access request in step S101, including file-level, session level and operation grade.
Preferably, determine that the rank of data access request is file-level, including in advance to each document definition service quality
Attribute, user quotient read the attribute value of this document, then meet quality of service attribute by storage system when accessing this document；
It determines that the rank of data access request is session level, is included in user terminal to the session of server-side, several files are read
Write operation realizes the covering to file-level service quality；When determining that the rank of data access request is operation grade, to each file
The restriction of corresponding transmission speed and response time are carried out, realizes the covering to session level service quality and file-level service quality.
Preferably, storage request is split in step S201, includes the size according to storage system and request
The request is partitioned into the relatively small of several sizes equalization by size when the size of a certain request is more than pre-set threshold value
Request.
Preferably, in step S201, the method that request queue scheduling is determined after the completion of segmentation is included in server end and builds
Vertical request buffering queue, the request from user terminal is deposited into request buffering queue, then will be asked in buffering queue not
It is referred to based on the grade of service in different rate sequences with request, is transferred from different rate sequences by request scheduling device
Storage system is sent to after request.Preferably, the different requests in buffering queue will be asked to be referred to difference based on the grade of service
Rate sequence in, each rate sequence includes
One triple, l={ nl,bl,tl, wherein nlIt is the title of the rate sequence, blIt is that the rate sequence is defined
Data transfer bandwidth；tlIt is that service response time defined in the rate sequence limits, L={ l1,l2,l 3……l nTable
Show the set of all rate sequences.Preferably, definition request buffering queue QRInclude from a series of of the different grades of service
Ask R={ r1,r2,r3……rn, the different brackets sequence Q sorted out based on the grade of serviceiIn comprising the grade of service be li's
Request, request buffering queue QR are configured to fixed value N on the server0, rate sequence QiLength it is variable, define Q0For demand
Elementary request queue removes Q0Multi-queue length summation be fixed value N, obtain：
Above formula (1).
Preferably, the different requests in buffering queue will be asked to be referred in different rate sequences based on the grade of service,
After request including sending first accesses, request is put into buffering queue QRIn, if there is idle position, root in multi-queue
The request in buffering queue will be asked to be taken into according to the grade of service and is put into its grade of service liCorresponding multi-queue QiIn, so
Request scheduling device chooses request according to grade of service strategy from multi-queue afterwards, gives at storage system and network system
Reason, wherein multi-queue are that grade is minimum and be not provided with maximum length, the sequence that can enter at any time of request.
Preferably, the multilevel queue scheduling method sorted out based on the grade of service, request are carried out according to following below scheme：Request is slow
Rush queue QRPeriodically statistical fractals grade is l0Number of requests, calculate QRIn grade of service l0Request strong point ratio e,
It is l to ask the grade of service of r0When, e0Value is pre-set for system, if e>e0, it is determined as the number of requests mistake of the low grade of service
Greatly, refuse r at this time, request r is otherwise put into Qr；If the grade of service of r is asked to be higher than l0When, it will be directed into QR, request classification
When by according to the processing speed to request of server, from QRAccording to first in first out take out in turn request r, be put into its correspondence
The grade of service queue QiIn.
Preferably, it defines in certain period of time T, it is R={ r to be sent to the request set on server by user1,
r2,……,rnIf request all in this time can meet QoS requirement, service quality schedulable in time T.
After using above-mentioned technical proposal, the beneficial effects of the invention are as follows：The characteristics of SaaS multi-user can be directed to, with asking
The performance of user is isolated in the method for asking queue, using storage request segmentation and the multi-queue based on grade of service classification
Scheduling, meets the QoS requirement of different brackets user, and verified after scheduling, is asked according to determining after being identified through
The method for seeking queue scheduling carries out data dispatch, further ensures the requirement of service quality.
Description of the drawings
In order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, to embodiment or will show below
There is attached drawing needed in technology description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only this
Some embodiments of invention without having to pay creative labor, may be used also for those of ordinary skill in the art
With obtain other attached drawings according to these attached drawings.
Fig. 1 is the flow diagram of the present invention.
Specific implementation mode
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete
Site preparation describes, it is clear that described embodiments are only a part of the embodiments of the present invention, instead of all the embodiments.It is based on
Embodiment in the present invention, those of ordinary skill in the art are obtained every other without creative efforts
Embodiment shall fall within the protection scope of the present invention.
As shown in Figure 1, this SaaS data access increased quality methods, include the following steps：
S101：Processing capacity according to the demand of SaaS data access, the access sequence of data packet and storage system is true
The fixed rank to data access request；
S201：According to determining data access request rank, storage request is split, and is determined after the completion of segmentation
The method of request queue scheduling；
S301：Schedulability verification is carried out to the method for determining request queue scheduling；
S401：If verification result passes through, data dispatch is carried out according to the method that determining request queue is dispatched, if obstructed
It crosses, then repeatedly step S201, until carrying out data dispatch according to the method that determining request queue is dispatched after being verified.
The rank to data access request in step S101, including file-level, session level and operation grade.
It determines that the rank of data access request is file-level, including each document definition quality of service attribute is used in advance
Family quotient reads the attribute value of this document, then meets quality of service attribute by storage system when accessing this document；Determine data
The rank of access request is session level, is included in user terminal to the session of server-side, operation is written and read to several files, real
Now to the covering of file-level service quality；When determining that the rank of data access request is operation grade, each file is carried out corresponding
The covering to session level service quality and file-level service quality is realized in the restriction of transmission speed and response time.
Storage request is split in step S201, includes the size of the size and request according to storage system, when
When the size of a certain request is more than pre-set threshold value, which is partitioned into the relatively small request of several sizes equalization.
In step S201, the method that request queue scheduling is determined after the completion of segmentation is included in server end and establishes request
Request from user terminal is deposited into request buffering queue by buffering queue, then the different requests that will be asked in buffering queue
It is referred to based on the grade of service in different rate sequences, by request scheduling device after transferring request in different rate sequences
It is sent to storage system.The different requests in buffering queue will be asked to be referred in different rate sequences based on the grade of service,
Each rate sequence includes a triple, l={ nl,bl,tl, wherein nlIt is the title of the rate sequence, blIt is the grade sequence
Data transfer bandwidth defined in row；tlIt is that service response time defined in the rate sequence limits, L={ l1,l2,
l3……lnIndicate the set of all rate sequences.Definition request buffering queue QRIt include the system from the different grades of service
Row request R={ r1,r2,r3……rn, the different brackets sequence Q sorted out based on the grade of serviceiIn comprising the grade of service be li
Request, request buffering queue QR be configured to fixed value N on the server0, rate sequence QiLength it is variable, define Q0To need
Elementary request queue is asked, Q is removed0Multi-queue length summation be fixed value N, obtain：
Above formula (1).
The different requests in buffering queue will be asked to be referred in different rate sequences based on the grade of service, including first
After the request access of transmission, request is put into buffering queue QRIn, if there is idle position in multi-queue, according to service etc.
Grade will ask the request in buffering queue to be taken into and be put into its grade of service liCorresponding multi-queue QiIn, then request is adjusted
Degree device chooses request according to grade of service strategy from multi-queue, gives storage system and network system is handled, wherein
Multi-queue is that grade is minimum and be not provided with maximum length, the sequence that can enter at any time of request.
Based on the multilevel queue scheduling method that the grade of service is sorted out, request is carried out according to following below scheme：Ask buffering queue
QRPeriodically statistical fractals grade is l0Number of requests, calculate QRIn grade of service l0Request strong point ratio e, ask r's
The grade of service is l0When, e0Value is pre-set for system, if e>e0, it is determined as that the number of requests of the low grade of service is excessive, at this time
Refuse r, request r is otherwise put into Qr；If the grade of service of r is asked to be higher than l0When, it will be directed into QR, request will be by when sorting out
According to the processing speed to request of server, from QRAccording to first in first out take out in turn request r, be put into its corresponding service
The queue Q of gradeiIn.
It defines in certain period of time T, it is R={ r to be sent to the request set on server by user1,r2,……,rnIf
All requests can meet QoS requirement in this time, then service quality schedulable in time T.
The SaaS data access increased quality methods, can be directed to SaaS multi-user the characteristics of, with the method for request queue
The performance of user is isolated, using storage request segmentation and the multilevel queue scheduling based on grade of service classification, is met not
The QoS requirement of ad eundem user.
The foregoing is merely illustrative of the preferred embodiments of the present invention, is not intended to limit the invention, all essences in the present invention
With within principle, any modification, equivalent replacement, improvement and so on should all be included in the protection scope of the present invention god.
Claims (10)
1. a kind of SaaS data access increased quality method, which is characterized in that include the following steps：
S101：According to the determination pair of the processing capacity of the demand of SaaS data access, the access sequence of data packet and storage system
The rank of data access request；
S201：According to determining data access request rank, storage request is split, and request is determined after the completion of segmentation
The method of queue scheduling；
S301：Schedulability verification is carried out to the method for determining request queue scheduling；
S401：If verification result passes through, data dispatch is carried out according to the method that determining request queue is dispatched, if not passing through,
Step S201 is then repeated, until carrying out data dispatch according to the method that determining request queue is dispatched after being verified.
2. SaaS data access increased quality method according to claim 1, which is characterized in that the logarithm in step S101
According to the rank of access request, including file-level, session level and operation grade.
3. SaaS data access increased quality method according to claim 2, which is characterized in that determine data access request
Rank be file-level, including in advance to each document definition quality of service attribute, user quotient reads this when accessing this document
The attribute value of file, then meets quality of service attribute by storage system；Determine that the rank of data access request is session level, packet
It includes in the session of user terminal to server-side, operation is written and read to several files, realizes the covering to file-level service quality；
When determining that the rank of data access request is operation grade, the restriction of corresponding transmission speed and response time are carried out to each file,
Realize the covering to session level service quality and file-level service quality.
4. SaaS data access increased quality method according to claim 3, which is characterized in that storage in step S201
Request is split, and includes the size of the size and request according to storage system, when the size of a certain request is more than default valve
When value, which is partitioned into the relatively small request of several sizes equalization.
5. SaaS data access increased quality method according to claim 4, which is characterized in that in step S201, dividing
The method that request queue scheduling is determined after the completion of cutting is included in server end and establishes request buffering queue, will be from user terminal
Request is deposited into request buffering queue, then that the different requests in buffering queue will be asked to be referred to based on the grade of service will be different
In rate sequence, storage system is sent to after transferring request in different rate sequences by request scheduling device.
6. SaaS data access increased quality method according to claim 5, which is characterized in that will be in request buffering queue
Different requests be referred to based on the grade of service in different rate sequences, each rate sequence includes a triple, l=
{nl,bl,tl, wherein nlIt is the title of the rate sequence, blIt is data transfer bandwidth defined in the rate sequence；tlIt is such
Service response time limitation, L={ l defined in grade sequence1,l2,l3……lnIndicate the set of all rate sequences.
7. SaaS data access increased quality method according to claim 6, which is characterized in that definition request buffering queue
QRInclude a series of request R={ r from the different grades of service1,r2,r3……rn,
The different brackets sequence Q sorted out based on the grade of serviceiIn comprising the grade of service be liRequest, request buffering queue QR exist
Fixed value N is configured on server0, rate sequence QiLength it is variable, define Q0For the request queue that demand levels are minimum, remove
Remove Q0Multi-queue length summation be fixed value N, obtain：
Above formula (1).
8. SaaS data access increased quality method according to claim 7, which is characterized in that will be in request buffering queue
Different requests be referred to based on the grade of service in different rate sequences, including after the request access sent first, will ask
It is put into buffering queue QRIn, if there is idle position in multi-queue, asking in buffering queue will be asked according to the grade of service
It seeks into and is put into its grade of service liCorresponding multi-queue QiIn, then request scheduling device according to grade of service strategy from
Request is chosen in multi-queue, storage system is given and network system is handled, and wherein multi-queue is that grade is minimum and not
Maximum length is set, the sequence that request can enter at any time.
9. SaaS data access increased quality method according to claim 8, which is characterized in that sorted out based on the grade of service
Multilevel queue scheduling method, request carried out according to following below scheme：Ask buffering queue QRPeriodically statistical fractals grade is l0
Number of requests, calculate QRIn grade of service l0Request strong point ratio e, ask r the grade of service be l0When, e0It is pre- for system
First setting value, if e>e0, it is determined as that the number of requests of the low grade of service is excessive, refuses r at this time, request r is otherwise put into Qr；
If the grade of service of r is asked to be higher than l0When, it will be directed into QR, will be according to the processing speed to request of server when request is sorted out
Degree, from QRAccording to first in first out take out in turn request r, be put into the queue Q of its corresponding grade of serviceiIn.
10. SaaS data access increased quality method according to claim 9, which is characterized in that define certain period of time T
Interior, it is R={ r to be sent to the request set on server by user1,r2,……,rnIf request all in this time is all
QoS requirement can be met, then service quality schedulable in time T.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810537106.3A CN108768886A (en) | 2018-05-30 | 2018-05-30 | A kind of SaaS data access increased quality method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810537106.3A CN108768886A (en) | 2018-05-30 | 2018-05-30 | A kind of SaaS data access increased quality method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108768886A true CN108768886A (en) | 2018-11-06 |
Family
ID=64004129
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810537106.3A Pending CN108768886A (en) | 2018-05-30 | 2018-05-30 | A kind of SaaS data access increased quality method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108768886A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109600432A (en) * | 2018-12-03 | 2019-04-09 | 上海科技大学 | Content center moves edge network user dynamic access method |
| CN114710498A (en) * | 2022-03-18 | 2022-07-05 | 深圳极联信息技术开发有限公司 | Load balancing method and system supporting high concurrent access |
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102170396A (en) * | 2011-05-06 | 2011-08-31 | 浙江大学 | QoS control method of cloud storage system based on differentiated service |
| CN102281202A (en) * | 2011-09-02 | 2011-12-14 | 苏州阔地网络科技有限公司 | Dispatching method, server and system |
| CN102467412A (en) * | 2010-11-16 | 2012-05-23 | 金蝶软件（中国）有限公司 | Method, device and business system for processing operation request |
| CN103929374A (en) * | 2014-03-31 | 2014-07-16 | 中国人民解放军91655部队 | Multilevel queue scheduling method based on service type |
| CN104219167A (en) * | 2013-05-31 | 2014-12-17 | 中国电信股份有限公司 | Network resource scheduling method and server |
| CN206195818U (en) * | 2016-11-30 | 2017-05-24 | 天津易遨在线科技有限公司 | Can promote news transmission speed's news formation system |
| CN107135241A (en) * | 2016-02-26 | 2017-09-05 | 新华三技术有限公司 | A kind of method and device for business processing |
| CN107241281A (en) * | 2017-05-27 | 2017-10-10 | 上海东土远景工业科技有限公司 | A kind of data processing method and its device |
| CN107634913A (en) * | 2017-08-22 | 2018-01-26 | 中国电子科技集团公司第五十四研究所 | A kind of service traffics control and the satellite borne equipment system of Differentiated Services |
| CN107688607A (en) * | 2017-07-26 | 2018-02-13 | 努比亚技术有限公司 | The method and mobile terminal of a kind of database access, computer-readable recording medium |
| US20180070261A1 (en) * | 2014-01-30 | 2018-03-08 | Shine Security Ltd. | Network traffic event management at the client terminal level |
| CN107896200A (en) * | 2017-11-08 | 2018-04-10 | 中国人民解放军国防科技大学 | Message scheduling method compatible with virtual link and packet switching mechanism |
-
2018
- 2018-05-30 CN CN201810537106.3A patent/CN108768886A/en active Pending
Patent Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102467412A (en) * | 2010-11-16 | 2012-05-23 | 金蝶软件（中国）有限公司 | Method, device and business system for processing operation request |
| CN102170396A (en) * | 2011-05-06 | 2011-08-31 | 浙江大学 | QoS control method of cloud storage system based on differentiated service |
| CN102281202A (en) * | 2011-09-02 | 2011-12-14 | 苏州阔地网络科技有限公司 | Dispatching method, server and system |
| CN104219167A (en) * | 2013-05-31 | 2014-12-17 | 中国电信股份有限公司 | Network resource scheduling method and server |
| US20180070261A1 (en) * | 2014-01-30 | 2018-03-08 | Shine Security Ltd. | Network traffic event management at the client terminal level |
| CN103929374A (en) * | 2014-03-31 | 2014-07-16 | 中国人民解放军91655部队 | Multilevel queue scheduling method based on service type |
| CN107135241A (en) * | 2016-02-26 | 2017-09-05 | 新华三技术有限公司 | A kind of method and device for business processing |
| CN206195818U (en) * | 2016-11-30 | 2017-05-24 | 天津易遨在线科技有限公司 | Can promote news transmission speed's news formation system |
| CN107241281A (en) * | 2017-05-27 | 2017-10-10 | 上海东土远景工业科技有限公司 | A kind of data processing method and its device |
| CN107688607A (en) * | 2017-07-26 | 2018-02-13 | 努比亚技术有限公司 | The method and mobile terminal of a kind of database access, computer-readable recording medium |
| CN107634913A (en) * | 2017-08-22 | 2018-01-26 | 中国电子科技集团公司第五十四研究所 | A kind of service traffics control and the satellite borne equipment system of Differentiated Services |
| CN107896200A (en) * | 2017-11-08 | 2018-04-10 | 中国人民解放军国防科技大学 | Message scheduling method compatible with virtual link and packet switching mechanism |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109600432A (en) * | 2018-12-03 | 2019-04-09 | 上海科技大学 | Content center moves edge network user dynamic access method |
| CN114710498A (en) * | 2022-03-18 | 2022-07-05 | 深圳极联信息技术开发有限公司 | Load balancing method and system supporting high concurrent access |
| CN114710498B (en) * | 2022-03-18 | 2024-03-01 | 深圳极联信息技术开发有限公司 | Load balancing method and system supporting high concurrency access |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| ParandehGheibi et al. | Avoiding interruptions—A QoE reliability function for streaming media applications | |
| US9660922B2 (en) | Network assisted rate shifting for adaptive bit rate streaming | |
| CN104717517B (en) | A kind of video code conversion method for scheduling task and device | |
| US10142405B2 (en) | Multi-CDN digital content streaming | |
| Welzl | Network congestion control: managing internet traffic | |
| CN108833996A (en) | Service node selection, update and code rate adaptive approach in distributed DASH system | |
| US20120278400A1 (en) | Effective Circuits in Packet-Switched Networks | |
| JP2006025408A (en) | Efficient one-to-many content distribution in peer-to-peer computer network | |
| CN101741884A (en) | Distributed storage method and device | |
| US20130018991A1 (en) | System and method for packetizing data stream in peer-to-peer (p2p) based streaming service | |
| US20130262625A1 (en) | Pipelining for parallel network connections to transmit a digital content stream | |
| CN108768886A (en) | A kind of SaaS data access increased quality method | |
| CN113099259B (en) | Multicast transmission method and device of streaming media, multicast server and medium | |
| Liebeherr et al. | Rate allocation and buffer management for differentiated services | |
| CN110753004A (en) | Dynamic current limiting method, system and device for data transmission and readable storage medium | |
| Mundur et al. | End-to-end analysis of distributed video-on-demand systems | |
| US20130311668A1 (en) | Methods And Systems For Providing Fairness And Stability To Video Streams | |
| El Marai et al. | Online server-side optimization approach for improving QoE of DASH clients | |
| Sani et al. | A bio-inspired HTTP-based adaptive streaming player | |
| Ou | Managing broadband networks: a policymaker’s guide | |
| CN112684988A (en) | QoS method and system based on distributed storage | |
| Nayfeh et al. | Design and analysis of scalable and interactive near video-on-demand systems | |
| CN108848533A (en) | A kind of adaptive load balancing method based on mobile terminal active feedback | |
| CN114968507B (en) | Image processing task scheduling method and device | |
| Lutfi et al. | Development of Adaptive Bandwidth Allocation Model Using PCQ for Network Performance Optimization |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB02 | Change of applicant information |
Address after: Room 1505, building C, Xidong chuangfong building, 88 Danshan Road, anzhen street, Xishan District, Wuxi City, Jiangsu Province, 214000 Applicant after: Jiangsu robins Technology Service Co.,Ltd. Address before: No. 155, Chunhui Road, economic development zone, Xishan District, Wuxi City, Jiangsu Province, 214000 Applicant before: WUXI ZHIGENGNIAO NETWORK TECHNOLOGY Co.,Ltd. |
|
| CB02 | Change of applicant information | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20181106 |
|
| WD01 | Invention patent application deemed withdrawn after publication |