CN106550270A - A kind of user packet method and device for DASH video multicastings - Google Patents
A kind of user packet method and device for DASH video multicastings Download PDFInfo
- Publication number
- CN106550270A CN106550270A CN201610907838.8A CN201610907838A CN106550270A CN 106550270 A CN106550270 A CN 106550270A CN 201610907838 A CN201610907838 A CN 201610907838A CN 106550270 A CN106550270 A CN 106550270A
- Authority
- CN
- China
- Prior art keywords
- user
- grouping
- channel quality
- packet
- cluster
- 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
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
- H04N21/43—Processing of content or additional data, e.g. demultiplexing additional data from a digital video stream; Elementary client operations, e.g. monitoring of home network or synchronising decoder's clock; Client middleware
- H04N21/442—Monitoring of processes or resources, e.g. detecting the failure of a recording device, monitoring the downstream bandwidth, the number of times a movie has been viewed, the storage space available from the internal hard disk
- H04N21/44227—Monitoring of local network, e.g. connection or bandwidth variations; Detecting new devices in the local network
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/60—Network structure or processes for video distribution between server and client or between remote clients; Control signalling between clients, server and network components; Transmission of management data between server and client, e.g. sending from server to client commands for recording incoming content stream; Communication details between server and client
- H04N21/63—Control signaling related to video distribution between client, server and network components; Network processes for video distribution between server and clients or between remote clients, e.g. transmitting basic layer and enhancement layers over different transmission paths, setting up a peer-to-peer communication via Internet between remote STB's; Communication protocols; Addressing
- H04N21/64—Addressing
- H04N21/6405—Multicasting
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/60—Network structure or processes for video distribution between server and client or between remote clients; Control signalling between clients, server and network components; Transmission of management data between server and client, e.g. sending from server to client commands for recording incoming content stream; Communication details between server and client
- H04N21/63—Control signaling related to video distribution between client, server and network components; Network processes for video distribution between server and clients or between remote clients, e.g. transmitting basic layer and enhancement layers over different transmission paths, setting up a peer-to-peer communication via Internet between remote STB's; Communication protocols; Addressing
- H04N21/647—Control signaling between network components and server or clients; Network processes for video distribution between server and clients, e.g. controlling the quality of the video stream, by dropping packets, protecting content from unauthorised alteration within the network, monitoring of network load, bridging between two different networks, e.g. between IP and wireless
- H04N21/64723—Monitoring of network processes or resources, e.g. monitoring of network load
- H04N21/64738—Monitoring network characteristics, e.g. bandwidth, congestion level
Landscapes
- Engineering & Computer Science (AREA)
- Multimedia (AREA)
- Signal Processing (AREA)
- Computer Networks & Wireless Communication (AREA)
- Databases & Information Systems (AREA)
- Computer Security & Cryptography (AREA)
- Two-Way Televisions, Distribution Of Moving Picture Or The Like (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a kind of user packet method and device for DASH video multicastings, including：According to the channel quality information for treating grouping user for collecting, it is calculated cluster and divides distance threshold；Choose packet count of the maximum cluster centre difference less than cluster division distance threshold is met as user grouping quantity；By clustering algorithm, according to the user grouping quantity and the channel quality information for collecting, user grouping is completed.User packet method and device for DASH video multicastings that the present invention is provided, it is adaptable to DASH video traffic multicast scenes, have good performance at the aspect such as throughput of system and break feature.
Description
Technical field
The present invention relates to wireless communication technology field, particularly relates to a kind of user grouping for DASH video multicastings
Method and device.
Background technology
With being skyrocketed through for video traffic number of users, shadow of the diversity of channel quality to video quality between user
Sound also gradually increases.HTTP dynamic self-adapting Streaming Medias (DASH, Dynamic Adaptive Streaming over HTTP)
Agreement is a kind of transmission of video agreement for being capable of adaptively adjusting video code check, can be automatically updated according to the channel status of user
Video quality grade.DASH business is used for unicast scene, but network direct broadcasting business is hot in recent years, and a large number of users is often
Ask same video content simultaneously.If now still adopting unicast transmission mode, substantial amounts of bandwidth resources can be wasted, network is always gulped down
The amount of telling is relatively low.
In DASH multicast data transmission modes, ask same video content and select the user of same code check to share portion bandwidth
Resource, can greatly increase network can be while the number of users for servicing.But resource is based on the worst use of channel quality in group
Come what is distributed, in group, the video quality of all users can be restricted by the worst user of channel quality, the good use of channel quality at family
Family can only also receive the video compared with low bit- rate, certainly will sacrifice on video quality.
Therefore, how for the applicable multicastapackets scheme of DASH video multicastings design and how in reception video quality
An optimal balance point is tried to achieve and bandwidth availability ratio between, becomes problem demanding prompt solution.
The content of the invention
In view of this, it is an object of the invention to propose a kind of user packet method for DASH video multicastings and
Device, solves the equilibrium problem between video quality and bandwidth availability ratio in DASH video multicastings.
Based on above-mentioned purpose, the first aspect of the embodiment of the present invention provides a kind of use for DASH video multicastings
Family group technology, including：
According to the channel quality information for treating grouping user for collecting, it is calculated cluster and divides distance threshold；
Choose packet count of the maximum cluster centre difference less than cluster division distance threshold is met as user grouping number
Amount；
By clustering algorithm, according to the user grouping quantity and the channel quality information for collecting, user is completed
Packet.
A kind of second aspect of the embodiment of the present invention, there is provided user grouping device for DASH video multicastings,
Including：
Distance threshold computing module, for according to the channel quality information for treating grouping user for collecting, being calculated
Cluster divides distance threshold；
Number of packet chooses module, divides distance threshold less than the cluster for choosing the maximum cluster centre difference of satisfaction
Packet count is used as user grouping quantity；
Grouping module, for by clustering algorithm, according to the user grouping quantity and the channel quality for collecting
Information, completes user grouping.
From the above it can be seen that a kind of user for DASH video multicastings provided in an embodiment of the present invention point
Group method and device, by choose meet maximum cluster centre difference less than the packet count that the cluster divides distance threshold be used as with
Family number of packet, and grouping user is treated according to the user grouping quantity of the selection be grouped by clustering algorithm, Ke Yibao
Card obtains higher handling capacity on the premise of same band resource is consumed.
Description of the drawings
In order to be illustrated more clearly that the technical scheme of the embodiment of the present invention, below to be used needed for embodiment description
Accompanying drawing is briefly described.It should be evident that drawings in the following description are only some embodiments of the present invention, for ability
For the those of ordinary skill in domain, on the premise of not paying creative work, can be attached to obtain other according to these accompanying drawings
Figure.
The flow process of the one embodiment for the user packet method for DASH video multicastings that Fig. 1 is provided for the present invention
Schematic diagram；
The module of the one embodiment for the user grouping device for DASH video multicastings that Fig. 2 is provided for the present invention
Structural representation；
Fig. 3 is the structural representation of the DASH video multicasting system architectures that the embodiment of the present invention is proposed；
Fig. 4 is the multicastapackets scheme of user packet method provided in an embodiment of the present invention, the unicast scheme of prior art
And the user of prior art is grouped handling capacity CDF (cumulative distribution function, the cumulative distribution of scheme at random
Function) curve；
Fig. 5 is multicastapackets scheme using user packet method provided in an embodiment of the present invention, the unicast of prior art
The user of scheme and prior art is grouped the interruption times CDF curve of scheme at random；
Fig. 6 is multicastapackets scheme using user packet method provided in an embodiment of the present invention, the unicast of prior art
The user of scheme and prior art is grouped the interruption duration CDF curves of scheme at random；
Fig. 7 is multicastapackets scheme using user packet method provided in an embodiment of the present invention, the unicast of prior art
The user of scheme and prior art is grouped the initial delay CDF curves of scheme at random；
Fig. 8 is using the handling capacity CDF curve under different user number of packet during fixed packet scheme.
Specific embodiment
To make the object, technical solutions and advantages of the present invention become more apparent, below in conjunction with specific embodiment, and reference
Accompanying drawing, the present invention is described in more detail.
It should be noted that the statement of all uses " first " and " second " is for differentiation two in the embodiment of the present invention
The parameter of the entity or non-equal of individual same names non-equal, it is seen that the convenience of " first " " second " only for statement, should not
The restriction to the embodiment of the present invention is interpreted as, subsequent embodiment is no longer illustrated one by one to this.
The embodiment of the present invention considers towards the transmission plan of DASH video multicastings to design, wherein how to carry out to user
Packet, improves the focus that existing packet scheme is the embodiment of the present invention.For the multicast of video traffic, forefathers have pointed out one
A little user grouping schemes, but major part is the switching with regard to unicast with multicast both of which, and user can only be in two kinds of transmission modes
Between selected.And for DASH video multicastings, the video content that the user in a multicast group not only asks
Identical, the video code rate of selection also must be identical.If therefore selecting the video code rate that the user of same video content asks not
Together, it is also desirable to belong in different multicast groups, the selection for multicast group has now just been also related to.Generally speaking, use
Family grouping strategy is the core of the video multicast packet conceptual design towards DASH, wherein needing to consider two key issues：The
One, each user selects code check/multicast group according to what criterion；Second, all users of the same video content of request should
Be divided into how many multicast groups, i.e., offer how many kinds of code check is actually needed for same video content.By to two above problem
Solution, maximum throughput can be realized under given bandwidth condition.
The present invention provides a kind of user grouping scheme for DASH video multicastings.First, the channel matter according to user
Amount carries out cluster to divide multicast group, and the user that channel quality is close to divides in a group, as far as possible subscriber channel in reduction group
The difference of quality.Secondly, the present invention proposes a kind of side for automatically determining number of packet suitable for DASH video multicast scenes
Method, wherein not strict separating unicast and multicast user, but unicast is treated as a special case of multicast.The multicast user for being carried point
Prescription case can improve network throughput under same band consumption, reduce interruption times and interrupt duration, improve Consumer's Experience.
Based on above-mentioned purpose, the one side of the embodiment of the present invention, there is provided one kind can solve the problem that DASH video multicasts
The user packet method for DASH video multicastings of the equilibrium problem in business between video quality and bandwidth availability ratio.
As shown in figure 1, the flow process of the one embodiment for the user packet method for DASH video multicastings provided for the present invention
Schematic diagram.
As shown in figure 1, the user packet method for DASH video multicastings, optionally, poly- using k-means
Class algorithm specifically includes two parts being grouped：
Part I, automatically determines the k in k-means clustering algorithms, i.e. user grouping quantity.K-means clustering algorithms
Service condition be cluster number k, it is known that therefore k value size need predefine.For DASH video multicastings,
With increasing for multicast group quantity, in group, the diversity of user channel quality can be reduced, and channel condition good user can obtain
Higher video code rate, contributes to improving Consumer's Experience.But on the other hand, multicast group number increases and can increase total bandwidth money
Source consumes, and reduces spectrum efficiency.Therefore, the present invention proposes a kind of algorithm for automatically determining user grouping quantity k, makes these two aspects
An optimal equilibrium point can be reached.
Part I specifically may include following steps：
Step 101：According to collect treat grouping user channel quality information (be chosen as Signal to Interference plus Noise Ratio (SINR,
Signal to Interference plus Noise Ratio) as user channel quality information initial data), meter
Calculation obtains cluster and divides distance threshold；Wherein, the channel quality information can gather the data of relative users by base station end and obtain
Arrive, the SINR value of collection is designated as S={ s1,s2,…,sn, wherein n is the total number of users of request same video content in cell.
Specifically, the channel quality information that the basis is collected, be calculated cluster divide distance threshold the step of
101, can further include following steps：
Step 1011：Order treats that grouping user quantity is n, and the channel quality information for calculating each user for collecting (can
Elect user's SINR value as) difference two-by-two, obtain the matrix of n × n dimension：
Dn×n=d (si,sj) i, j=1,2 ..., n
Wherein, d (si,sj) represent two users channel quality information between difference, si、sjRespectively i-th, jth
The channel quality information of individual user；
Step 1012：Mean difference is calculated, because d is (xi,xi)=0, needs to remove when mean difference is calculated and often goes
0 value, obtain following mean difference：
Step 1013：Obtain cluster and divide distance threshold：
Wherein, minDn×nRepresent Distance matrix Dn×nMinima.
Step 102：Choose meet maximum cluster centre difference less than the cluster divide the packet count of distance threshold as with
Family number of packet.
Specifically, with the ergodic algorithm with end condition determining k value.Therefore, optionally, described selection meets maximum
Cluster centre difference divides the packet count of distance threshold as the step of user grouping quantity 102 less than the cluster, can also enter one
Step is comprised the following steps：
Step 1021：Choose initial packet number；In general, the division class number of cluster should not too more than treating grouping user number
The square root of amountTherefore, the selection initial packet number, it may include following steps：
Grouping user quantity is treated in acquisition；
The square root of grouping user quantity is treated described in calculating and the square root is carried out to round, obtain described initial point
Group number, i.e. take the initial value of k Round in expression.
First by the initial data S={ s of channel quality information1,s2,…,snIt is divided into k classes with k-means clustering algorithms, count
Calculate the cluster centre μ of each classi(i=1,2 ..., k), then calculate difference DELTA μ of cluster centre two-by-two=| μi-μj| (i, j=
1,2,…,k)。
Finally, judge whether maximum cluster centre difference divides distance less than cluster, i.e., whether following condition is set up：
Step 1022：If being based on the initial packet number, using the calculated maximum cluster centre difference of clustering algorithm
Distance threshold is divided less than the cluster, using the initial packet number as the user grouping quantity；
Step 1023：If the maximum cluster centre difference divides distance threshold not less than the cluster, based on less than institute
The new packet count (here, the new packet count can be using the value that k is reduced 1, i.e. k=k-1) of initial packet number is stated, with new
K be packet number, then carry out k-means clusters, and new maximum cluster centre difference be calculated using clustering algorithm, then
It is secondary to carry out above-mentioned judgement, until new maximum cluster centre difference divides distance threshold or new packet count for 1 (i.e. less than the cluster
K=1), loop termination, and using newest packet count once as the user grouping quantity.
Part II, is grouped to the user for asking same video content in cell using clustering algorithm, is specifically included
Following steps：
Step 103：By clustering algorithm, according to the user grouping quantity and the channel quality information for collecting,
Complete user grouping；Optionally, the clustering algorithm is k-means clustering algorithms.
All users in packet, with user's SINR value for collecting as sample data, to asking same video content
Multicastapackets are carried out, the user assigned in a multicast group will be using identical video code rate.Generally, it is all in group in order to ensure
User can normally watch video, and bandwidth resources are distributed on the basis of organizing the worst user of interior channel quality.Therefore, if group
The channel quality of interior user has big difference, then script channel condition is good, can receive the user of higher video quality can only select
Relatively low video code rate is selected, this can substantially reduce the viewing experience of user.Therefore, the packet criterion of embodiment of the present invention proposition is
Channel quality close user is divided into into one group as far as possible, the user channel quality difference in same group of diminution.
Here, using k-means clustering algorithms, clustered with the SINR (Signal to Interference plus Noise Ratio) of user as initial data.
Therefore, it is described by clustering algorithm, according to the user grouping quantity and the channel quality information for collecting,
The step of completing user grouping 103, can also be further comprising the steps：
Step 1031：Make the user grouping quantity be k, the channel quality information for collecting is divided into into k class, remember
For G={ G1,G2,…,Gk, wherein GkIn comprising being divided into all data of kth class；
Step 1032：The cluster target of k-means is to choose the packet scheme that minimize can following cost function (i.e.,
The channel quality information of which user is assigned in same class)：
Wherein, μiIt is GiThe average of the channel quality information of apoplexy due to endogenous wind, and cluster centre, sjFor the channel matter of j-th user
Amount information；
Step 1033：According to the packet scheme, will treat that grouping user is divided into k classes, each class is entered as a multicast group
Row DASH video traffic multicast transmissions.
From above-described embodiment as can be seen that the user grouping for DASH video multicastings provided in an embodiment of the present invention
Method, is used as user grouping number less than the packet count that the cluster divides distance threshold by choosing the maximum cluster centre difference of satisfaction
Measure, and grouping user is treated according to the user grouping quantity of the selection and be grouped by clustering algorithm, it is ensured that consuming
On the premise of same band resource, higher handling capacity is obtained.
It should be noted that above-described embodiment specifically employs k-means clustering algorithms being grouped, people in the art
Member other similar clustering algorithms can be grouped according to the conceptual choice based on common sense in the field, can also obtain essentially identical
Effect, therefore, protection scope of the present invention should not be limited on specific clustering algorithm in the above-described embodiments.
Based on above-mentioned purpose, second aspect of the embodiment of the present invention, additionally provide one kind and can solve the problem that DASH video groups
The user grouping for DASH video multicastings for broadcasting the equilibrium problem in business between video quality and bandwidth availability ratio is filled
Put.As shown in Fig. 2 the mould of the one embodiment for the user grouping device for DASH video multicastings provided for the present invention
Block structure schematic diagram.
The user grouping device for DASH video multicastings, including：
Distance threshold computing module 201, for (being chosen as according to the channel quality information for treating grouping user for collecting
Signal to Interference plus Noise Ratio (SINR, Signal to Interference plus Noise Ratio) is used as the channel quality information of user
Initial data), be calculated cluster divide distance threshold；Wherein, the channel quality information can be corresponding by base station end collection
The data of user and obtain, the SINR value of collection is designated as S={ s1,s2,…,sn, wherein n is to ask in same video in cell
The total number of users of appearance.
Optionally, the distance threshold computing module 201, can also be specifically for：
Order treats that grouping user quantity is n, calculates the difference two-by-two of the channel quality information of each user for collecting, obtains
To the matrix of n × n dimension：
Dn×n=d (si,sj) i, j=1,2 ..., n
Wherein, d (si,sj) represent two users channel quality information between difference, si、sjRespectively i-th, jth
The channel quality information of individual user；
It is calculated mean difference：
Obtain cluster and divide distance threshold：
Wherein, minDn×nRepresent Distance matrix Dn×nMinima.
Number of packet chooses module 202, divides apart from threshold less than the cluster for choosing the maximum cluster centre difference of satisfaction
The packet count of value is used as user grouping quantity；
Optionally, with the ergodic algorithm with end condition determining k value, the number of packet chooses module 202, may be used also
Specifically for：
Choose initial packet number；Wherein, the selection initial packet number is also specifically included：Grouping user quantity is treated in acquisition；
The square root of grouping user quantity is treated described in calculating and the square root is carried out to round, obtain the initial packet number, i.e.
Take the initial value of k[·]+Round in expression；
First by the initial data S={ s of channel quality information1,s2,…,snIt is divided into k classes with k-means clustering algorithms, count
Calculate the cluster centre μ of each classi(i=1,2 ..., k), then calculate difference DELTA μ of cluster centre two-by-two=| μi-μj| (i, j=
1,2,…,k)。
Finally, judge whether maximum cluster centre difference divides distance less than cluster, i.e., whether following condition is set up：
If being based on the initial packet number, the cluster is less than using the calculated maximum cluster centre difference of clustering algorithm
Distance threshold is divided, using the initial packet number as the user grouping quantity；
If the maximum cluster centre difference divides distance threshold not less than the cluster, based on less than the initial packet
Several new packet count (here, the new packet count can be using the value that k is reduced 1, i.e. k=k-1), with new k as packet
Number, then carry out k-means clusters, and new maximum cluster centre difference is calculated using clustering algorithm, until it is new most
It is 1 (i.e. k=1) that big cluster centre difference divides distance threshold or new packet count less than the cluster, and by newest packet once
Number is used as the user grouping quantity.
Grouping module 203, for by clustering algorithm, according to the user grouping quantity and the channel matter for collecting
Amount information, completes user grouping.
All users in packet, with user's SINR value for collecting as sample data, to asking same video content
Multicastapackets are carried out, the user assigned in a multicast group will be using identical video code rate.Generally, it is all in group in order to ensure
User can normally watch video, and bandwidth resources are distributed on the basis of organizing the worst user of interior channel quality.Therefore, if group
The channel quality of interior user has big difference, then script channel condition is good, can receive the user of higher video quality can only select
Relatively low video code rate is selected, this can substantially reduce the viewing experience of user.Therefore, the packet criterion of embodiment of the present invention proposition is
Channel quality close user is divided into into one group as far as possible, the user channel quality difference in same group of diminution.
Optionally, using k-means clustering algorithms, clustered with the SINR (Signal to Interference plus Noise Ratio) of user as initial data；
The grouping module 203, specifically for：
Make the user grouping quantity be k, the channel quality information for collecting is divided into into k class, G={ G are designated as1,
G2,…,Gk, wherein GkIn comprising being divided into all data of kth class；
Selection can make the packet scheme that following cost function is minimized：
Wherein, μiIt is GiThe average of the channel quality information of apoplexy due to endogenous wind, and cluster centre, sjFor the channel matter of j-th user
Amount information；
According to the packet scheme, will treat that grouping user is divided into k classes, each class carries out DASH and regards as a multicast group
Frequency business multicast transmission.
From above-described embodiment as can be seen that the user grouping for DASH video multicastings provided in an embodiment of the present invention
Device, is used as user grouping number less than the packet count that the cluster divides distance threshold by choosing the maximum cluster centre difference of satisfaction
Measure, and grouping user is treated according to the user grouping quantity of the selection and be grouped by clustering algorithm, it is ensured that consuming
On the premise of same band resource, higher handling capacity is obtained.
It should be noted that above-described embodiment specifically employs k-means clustering algorithms being grouped, people in the art
Member other similar clustering algorithms can be grouped according to the conceptual choice based on common sense in the field, can also obtain essentially identical
Effect, therefore, protection scope of the present invention should not be limited on specific clustering algorithm in the above-described embodiments.
3rd aspect of the embodiment of the present invention, there is provided a kind of using the above-mentioned user for DASH video multicastings
The DASH Video Multicast System frameworks of group technology.As shown in figure 3, being DASH Video Multicast Systems provided in an embodiment of the present invention
The structural representation of framework.
The DASH Video Multicast Systems framework is divided into three basic modules：DASH video source servers, multi-medium multi-packet broadcasting
Broadcast Service Center and multicast user.
1) DASH videos source server is responsible for producing original video stream, and source video is encoded to difference according to DASH agreements
The video version of code check.
2) multimedia multicast/broadcast service centre collects the channel quality information of user feedback first, in the embodiment of the present invention
Used in SINR as user channel quality information.Then, by being grouped submodule, (which can be above-mentioned for DASH video groups
Broadcast any embodiment of the user grouping device of business, use in above-mentioned any means embodiment for DASH video groups
Broadcast the user packet method of business) multicastapackets are carried out to user, and send grouping information to multimedia multicast/broadcast service
Center.Finally, multimedia multicast/broadcast service centre is taken from video source according to grouping information and user video quality feedback information
Suitable code check version is selected in business device, multicast user is transmitted to.
3) multicast user is responsible for feeding back the channel quality information and video quality information of oneself and takes to multimedia multicast/broadcast
Business center, so that multimedia multicast/broadcast service centre carries out user grouping.
Additionally, the technical scheme based on the embodiment of the present invention has carried out emulation experiment.The embodiment of the present invention adopts LTE system
Level emulation platform.LTE, as widely used wireless cellular technology, using OFDM space vocal imitation skill, can be DASH
The higher message transmission rate of video multicasting offer, and the system bandwidth of 1.4MHz to 20MHz is supported, with higher band
Wide motility.
Setting 20 users be randomly dispersed in whole cell, channel loss include macroscopical path loss, shadow fading and
Multipath fading, signal carrier frequency are 2GHz, system bandwidth about 5MHz, and sub-frame duration is 1ms, and the emulation persistent period is 50s.
Represent for convenience, the user grouping side for DASH video multicastings that will be proposed using the embodiment of the present invention
The multicastapackets scheme of method, is abbreviated as DASH multicasts justice (DMF) scheme.
Shown according to emulation, the user packet method for DASH video multicastings proposed using the embodiment of the present invention
Multicastapackets scheme most 20 users have been divided into 3 groups at last, see the table below 1.
The group result of the multicastapackets scheme that 1 embodiment of the present invention of table is proposed
| User | The group at place | User | The group at place |
| 1 | 2 | 11 | 2 |
| 2 | 1 | 12 | 1 |
| 3 | 1 | 13 | 2 |
| 4 | 2 | 14 | 3 |
| 5 | 1 | 15 | 2 |
| 6 | 2 | 16 | 1 |
| 7 | 3 | 17 | 3 |
| 8 | 1 | 18 | 2 |
| 9 | 1 | 19 | 2 |
| 10 | 2 | 20 | 2 |
Emulate the multicast of the user packet method for DASH video multicastings that will be proposed using the embodiment of the present invention
Packet scheme is contrasted based on the unicast scheme of equitable proportion (PF) dispatching algorithm with traditional, is as a result shown using this
The multicastapackets scheme of the user packet method for DASH video multicastings that bright embodiment is proposed is than traditional unicast scheme
Handling capacity improve 8 times (referring to Fig. 4).Meanwhile, emulation will be also proposed using the embodiment of the present invention for DASH video groups
The multicastapackets scheme for broadcasting the user packet method of business is contrasted with random packet (RAND) scheme.As a result show,
Under conditions of identical best packet number k, the user for DASH video multicastings proposed using the embodiment of the present invention
The multicastapackets scheme of group technology improves 2 times (referring to Fig. 4) than the handling capacity of traditional unicast scheme.Additionally, emulation will also
Other indexs such as interruption times of video user, interrupt duration and initial delay is contrasted under three circumstances, referring to Fig. 5
～Fig. 7.As a result show, the multicast of the user packet method for DASH video multicastings proposed using the embodiment of the present invention
Packet scheme is all optimal in these three indexs.Finally, in order to prove the embodiment of the present invention propose automatically determine user
The effectiveness of the algorithm of number of packet k, by the user for DASH video multicastings proposed using the embodiment of the present invention point
The multicastapackets scheme of prescription method is contrasted with fixed packet scheme, referring to accompanying drawing 8 and table 2 below.Multicast number is set to
1,2,3,4,5 emulates respectively, as a result shows, enough obtains highest handling capacity when number k=3 is grouped, and the precisely present invention is carried
Best packet number determined by the multicastapackets scheme for going out.
Table 2 is using the total throughout statistical table under the different user number of packet of fixed packet scheme
Those of ordinary skill in the art should be understood：The discussion of any of the above embodiment is exemplary only, not
It is intended to imply that the scope of the present disclosure (including claim) is limited to these examples；Under the thinking of the present invention, above example
Or can also be combined between the technical characteristic in different embodiments, step can be realized with random order, and is existed such as
Many other changes of the different aspect of the upper described present invention, for simple and clear their no offers in details.
In addition, to simplify explanation and discussing, and in order to obscure the invention, can in the accompanying drawing for being provided
To illustrate or can not illustrate that the known power ground with integrated circuit (IC) chip and other parts is connected.Furthermore, it is possible to
Device is shown in block diagram form, to avoid obscuring the invention, and this have also contemplated that following facts, i.e., with regard to this
The details of the embodiment of a little block diagram arrangements be depend highly on the platform that will implement the present invention (that is, these details should
It is completely in the range of the understanding of those skilled in the art).Elaborating detail (for example, circuit) to describe the present invention's
In the case of exemplary embodiment, it will be apparent to those skilled in the art that these details can not there is no
In the case of or implement the present invention in the case that these details are changed.Therefore, these descriptions are considered as explanation
It is property rather than restricted.
Although invention has been described to have been incorporated with specific embodiment of the invention, according to retouching above
State, many replacements of these embodiments, modification and modification will be apparent for those of ordinary skills.Example
Such as, other memory architectures (for example, dynamic ram (DRAM)) can use discussed embodiment.
Embodiments of the invention be intended to fall within the broad range of claims it is all such replace,
Modification and modification.Therefore, all any omissions within the spirit and principles in the present invention, made, modification, equivalent, improvement
Deng should be included within the scope of the present invention.
Claims (10)
1. a kind of user packet method for DASH video multicastings, it is characterised in that include：
According to the channel quality information for treating grouping user for collecting, it is calculated cluster and divides distance threshold；
Choose packet count of the maximum cluster centre difference less than cluster division distance threshold is met as user grouping quantity；
By clustering algorithm, according to the user grouping quantity and the channel quality information for collecting, user grouping is completed.
2. method according to claim 1, it is characterised in that the selection meets maximum cluster centre difference less than described
Cluster divides the packet count of distance threshold as user grouping quantity, including：
Choose initial packet number；
If being based on the initial packet number, divided less than the cluster using the calculated maximum cluster centre difference of clustering algorithm
Distance threshold, using the initial packet number as the user grouping quantity；
If the maximum cluster centre difference divides distance threshold not less than the cluster, based on less than the initial packet number
New packet count, is calculated new maximum cluster centre difference using clustering algorithm, until new maximum cluster centre difference is little
It is 1 that distance threshold or new packet count are divided in the cluster, and using newest packet count once as the user grouping quantity.
3. method according to claim 2, it is characterised in that the selection initial packet number, including：
Grouping user quantity is treated in acquisition；
The square root of grouping user quantity is treated described in calculating and the square root is carried out to round, obtain the initial packet
Number.
4. method according to claim 1, it is characterised in that the channel quality information that the basis is collected, calculates
Obtain cluster and divide distance threshold, including：
Order treats that grouping user quantity is n, calculates the difference two-by-two of the channel quality information of each user for collecting, obtains one
The matrix of individual n × n dimensions：
Dn×n=d (si,sj) i, j=1,2 ..., n
Wherein, d (si,sj) represent two users channel quality information between difference, si、sjRespectively i-th, j-th use
The channel quality information at family；
It is calculated mean difference：
Obtain cluster and divide distance threshold：
Wherein, minDn×nRepresent Distance matrix Dn×nMinima.
5. the method according to claim 1-4 any one, it is characterised in that the clustering algorithm is k-means clusters
Algorithm；
It is described by clustering algorithm, according to the user grouping quantity and the channel quality information for collecting, complete user
Packet, including：
Make the user grouping quantity be k, the channel quality information for collecting is divided into into k class, G={ G are designated as1,
G2,…,Gk, wherein GkIn comprising being divided into all data of kth class；
Selection can make the packet scheme that following cost function is minimized：
Wherein, μiIt is GiThe average of the channel quality information of apoplexy due to endogenous wind, and cluster centre, sjChannel quality for j-th user is believed
Breath；
According to the packet scheme, will treat that grouping user is divided into k classes, each class carries out DASH video industry as a multicast group
Business multicast transmission.
6. a kind of user grouping device for DASH video multicastings, it is characterised in that include：
Distance threshold computing module, draws for according to the channel quality information for treating grouping user for collecting, being calculated cluster
Divide distance threshold；
Number of packet chooses module, for choosing the packet for meeting that maximum cluster centre difference divides distance threshold less than the cluster
Number is used as user grouping quantity；
Grouping module, for by clustering algorithm, according to the user grouping quantity and the channel quality information for collecting,
Complete user grouping.
7. device according to claim 6, it is characterised in that the number of packet chooses module, specifically for：
Choose initial packet number；
If being based on the initial packet number, divided less than the cluster using the calculated maximum cluster centre difference of clustering algorithm
Distance threshold, using the initial packet number as the user grouping quantity；
If the maximum cluster centre difference divides distance threshold not less than the cluster, based on less than the initial packet number
New packet count, is calculated new maximum cluster centre difference using clustering algorithm, until new maximum cluster centre difference is little
It is 1 that distance threshold or new packet count are divided in the cluster, and using newest packet count once as the user grouping quantity.
8. device according to claim 7, it is characterised in that the number of packet chooses module, is additionally operable to：
Grouping user quantity is treated in acquisition；
The square root of grouping user quantity is treated described in calculating and the square root is carried out to round, obtain the initial packet
Number.
9. device according to claim 6, it is characterised in that the distance threshold computing module, specifically for：
Order treats that grouping user quantity is n, calculates the difference two-by-two of the channel quality information of each user for collecting, obtains one
The matrix of individual n × n dimensions：
Dn×n=d (si,sj) i, j=1,2 ..., n
Wherein, d (si,sj) represent two users channel quality information between difference, si、sjRespectively i-th, j-th use
The channel quality information at family；
It is calculated mean difference：
Obtain cluster and divide distance threshold：
Wherein, minDn×nRepresent Distance matrix Dn×nMinima.
10. the device according to claim 6-9 any one, it is characterised in that the clustering algorithm is k-means clusters
Algorithm；
The grouping module, specifically for：
Make the user grouping quantity be k, the channel quality information for collecting is divided into into k class, G={ G are designated as1,
G2,…,Gk, wherein GkIn comprising being divided into all data of kth class；
Selection can make the packet scheme that following cost function is minimized：
Wherein, μiIt is GiThe average of the channel quality information of apoplexy due to endogenous wind, and cluster centre, sjFor the channel quality of j-th user
Information；
According to the packet scheme, will treat that grouping user is divided into k classes, each class carries out DASH video industry as a multicast group
Business multicast transmission.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610907838.8A CN106550270B (en) | 2016-10-18 | 2016-10-18 | A kind of user packet method and device for DASH video multicasting |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610907838.8A CN106550270B (en) | 2016-10-18 | 2016-10-18 | A kind of user packet method and device for DASH video multicasting |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106550270A true CN106550270A (en) | 2017-03-29 |
| CN106550270B CN106550270B (en) | 2019-06-07 |
Family
ID=58369380
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610907838.8A Active CN106550270B (en) | 2016-10-18 | 2016-10-18 | A kind of user packet method and device for DASH video multicasting |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106550270B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2019084764A1 (en) * | 2017-10-31 | 2019-05-09 | Huizhou Tcl Mobile Communication Co., Ltd | Methods, apparatuses and readable storage medium for video multicasting |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2001055879A1 (en) * | 2000-01-28 | 2001-08-02 | Ibeam Broadcasting Corporation | A system and method for determining optimal server in a distributed network for serving content streams |
| EP1379054A1 (en) * | 2002-06-27 | 2004-01-07 | Sony International (Europe) GmbH | Data distribution system in a multiple network environment |
| CN104394440A (en) * | 2014-11-27 | 2015-03-04 | 北京邮电大学 | Dispatching method and device of HTTP video stream |
-
2016
- 2016-10-18 CN CN201610907838.8A patent/CN106550270B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2001055879A1 (en) * | 2000-01-28 | 2001-08-02 | Ibeam Broadcasting Corporation | A system and method for determining optimal server in a distributed network for serving content streams |
| EP1379054A1 (en) * | 2002-06-27 | 2004-01-07 | Sony International (Europe) GmbH | Data distribution system in a multiple network environment |
| CN104394440A (en) * | 2014-11-27 | 2015-03-04 | 北京邮电大学 | Dispatching method and device of HTTP video stream |
Non-Patent Citations (3)
| Title |
|---|
| 刘阳迁: "基于簇的组播接收端分组算法研究", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
| 吴文亮: "聚类分析中K-均值与K-中心点算法的研究", 《中国优秀硕士学位论文全文数据库信息科技辑》 * |
| 田森平; 吴文亮: "自动获取k-means聚类参数k值的算法", 《计算机工程与设计》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2019084764A1 (en) * | 2017-10-31 | 2019-05-09 | Huizhou Tcl Mobile Communication Co., Ltd | Methods, apparatuses and readable storage medium for video multicasting |
| CN111512636A (en) * | 2017-10-31 | 2020-08-07 | 惠州Tcl移动通信有限公司 | Video multicast method, device and readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106550270B (en) | 2019-06-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106937256B (en) | A kind of cooperation multicast transmission method based on non-orthogonal multiple access technology | |
| CN102752864B (en) | User experience-oriented resource allocation method in multi-user and multi-service system | |
| CN103249007A (en) | Method for establishing D2D multicast communication and allocating wireless source thereof in IMT-A system | |
| CN106937393A (en) | A kind of scheduling method for wireless resource based on priority | |
| CN105406945B (en) | The multicast resource distribution of telescopic video and transmission method in a kind of more base station systems | |
| CN107949061B (en) | Multi-user grouping method based on non-orthogonal multiple access system | |
| CN105187849A (en) | Scalable video multicast resource allocation method based on D2D and cellular network | |
| CN106658733A (en) | Handling capacity optimization method based on user fairness and QoS in multi-user MIMO-OFDM | |
| CN105898807A (en) | Access point selection and resource distribution combined self-healing method in ultra-dense network | |
| CN107343323A (en) | Differentiation back-off method based on user's classification in a kind of big connection Internet of Things of 5G | |
| CN107205280A (en) | The processing method and processing device of bandwidth resources | |
| CN106888510A (en) | Realize the method and system of resource allocation, and Centralized Controller and base station | |
| CN107979824A (en) | A kind of D2D multipath resource distribution methods under wireless network virtualization scene | |
| CN106792480B (en) | A kind of D2D communication resource allocation method based on cellular network | |
| CN104581918B (en) | Satellite layer-span combined optimization power distribution method based on non-cooperative game | |
| CN106411469A (en) | Multicast resource allocation and transmission method based on scalable video in multi-base station heterogeneous network | |
| CN102395158B (en) | Load balance optimization method considering user service quality requirements in mobile communication system | |
| CN103347299A (en) | Centralized resource management method based on genetic algorithm | |
| CN108012335A (en) | Multipath resource distribution method is virtualized under a kind of software defined network | |
| CN106793122B (en) | Method for safely allocating each bit minimized wireless resources of heterogeneous network | |
| CN102256301A (en) | User selection method for simultaneously meeting unicast and multicast services | |
| CN106550270A (en) | A kind of user packet method and device for DASH video multicastings | |
| CN103327541A (en) | Service unloading method based on different QoS | |
| CN114726431B (en) | Wave beam hopping multiple access method facing low orbit satellite constellation | |
| CN104684064B (en) | A kind of up and down power distribution method of multiple cell multi-user MIMO system |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |