CN106550270B - A kind of user packet method and device for DASH video multicasting - Google Patents
A kind of user packet method and device for DASH video multicasting Download PDFInfo
- Publication number
- CN106550270B CN106550270B CN201610907838.8A CN201610907838A CN106550270B CN 106550270 B CN106550270 B CN 106550270B CN 201610907838 A CN201610907838 A CN 201610907838A CN 106550270 B CN106550270 B CN 106550270B
- Authority
- CN
- China
- Prior art keywords
- user
- grouping
- channel quality
- cluster
- quality information
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
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 methods and device for DASH video multicasting, comprising: according to the channel quality information to grouping user collected, cluster is calculated and divides distance threshold；It chooses and meets packet count of the maximum cluster centre difference less than cluster division distance threshold as user grouping quantity；User grouping is completed according to the user grouping quantity and the channel quality information collected by clustering algorithm.User packet method and device provided by the invention for DASH video multicasting, be suitable for DASH video traffic multicast scene, throughput of system and in terms of it is with good performance.
Description
Technical field
The present invention relates to wireless communication technology fields, particularly relate to a kind of user grouping for DASH video multicasting
Method and device.
Background technique
With being skyrocketed through for video traffic number of users, shadow of the otherness of channel quality to video quality between user
Sound is also gradually increased.HTTP dynamic self-adapting Streaming Media (DASH, Dynamic Adaptive Streaming over HTTP)
Agreement is a kind of transmission of video agreement for capableing of adaptively adjusting video code rate, can be automatically updated according to the channel status of user
Video quality grade.DASH business is chiefly used in unicast scene, but network direct broadcasting business is hot in recent years, and a large number of users is often
Same video content is requested simultaneously.If still using unicast transmission mode at this time, a large amount of bandwidth resources can be wasted, network always gulps down
The amount of spitting is lower.
In DASH multicast data transmission mode, the user of same video content and the same code rate of selection is requested to share a bandwidth
Resource can greatly increase the number of users that network can service simultaneously.But resource is the use worst based on channel quality in organizing
Come what is distributed, the video quality for organizing interior all users will receive the restriction of the worst user of channel quality, the use that channel quality is good at family
Family can only also receive the video compared with low bit- rate, certainly will be sacrificed on video quality.
Therefore, how for the applicable multicastapackets scheme of DASH video multicasting design and how in reception video quality
An optimal balance point is acquired between bandwidth availability ratio, becomes urgent problem to be solved.
Summary 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 multicasting and
Device solves the equilibrium problem in DASH video multicasting between video quality and bandwidth availability ratio.
Based on above-mentioned purpose, the first aspect of the embodiment of the present invention provides a kind of use for DASH video multicasting
Family group technology, comprising:
According to the channel quality information to grouping user collected, cluster is calculated and divides distance threshold；
It chooses and meets packet count of the maximum cluster centre difference less than cluster division distance threshold as user grouping number
Amount；
User is completed according to the user grouping quantity and the channel quality information collected by clustering algorithm
Grouping.
The second aspect of the embodiment of the present invention provides a kind of user grouping device for DASH video multicasting,
Include:
Distance threshold computing module, for being calculated according to the channel quality information to grouping user collected
Cluster divides distance threshold；
Number of packet chooses module, meets maximum cluster centre difference less than cluster division distance threshold for choosing
Packet count is as user grouping quantity；
Grouping module, for passing through clustering algorithm, according to the user grouping quantity and the channel quality collected
Information completes user grouping.
From the above it can be seen that a kind of user for DASH video multicasting provided in an embodiment of the present invention point
Group method and device divides the packet count of distance threshold as use less than the cluster by choosing the maximum cluster centre difference of satisfaction
Family number of packet, and grouping user is treated according to the user grouping quantity of the selection and is grouped by clustering algorithm, Ke Yibao
Card obtains higher handling capacity under the premise of consuming same band resource.
Detailed description of the invention
In order to illustrate the technical solution of the embodiments of the present invention more clearly, below to needed in embodiment description
Attached drawing is briefly described.It should be evident that drawings in the following description are only some embodiments of the invention, for ability
For the those of ordinary skill in domain, without creative efforts, it is attached to can also be obtained according to these attached drawings other
Figure.
Fig. 1 is the process of one embodiment of the user packet method provided by the invention for DASH video multicasting
Schematic diagram；
Fig. 2 is the module of one embodiment of the user grouping device provided by the invention for DASH video multicasting
Structural schematic diagram；
Fig. 3 is the structural schematic diagram for the DASH video multicasting system architecture that the embodiment of the present invention proposes；
Fig. 4 is multicastapackets scheme, the unicast scheme of the prior art of user packet method provided in an embodiment of the present invention
And the user of the prior art is grouped handling capacity CDF (cumulative distribution function, the cumulative distribution of scheme at random
Function) curve；
Fig. 5 is the unicast using the multicastapackets scheme, the prior art of user packet method provided in an embodiment of the present invention
The user of scheme and the prior art is grouped the interruption times CDF curve of scheme at random；
Fig. 6 is the unicast using the multicastapackets scheme, the prior art of user packet method provided in an embodiment of the present invention
The user of scheme and the prior art is grouped the interruption duration CDF curve of scheme at random；
Fig. 7 is the unicast using the multicastapackets scheme, the prior art of user packet method provided in an embodiment of the present invention
The user of scheme and the prior art is grouped the initial delay CDF curve of scheme at random；
The handling capacity CDF curve under different user number of packet when Fig. 8 is using fixed grouping scheme.
Specific embodiment
To make the objectives, technical solutions, and advantages of the present invention clearer, below in conjunction with specific embodiment, and reference
Attached drawing, the present invention is described in more detail.
It should be noted that all statements for using " first " and " second " are for differentiation two in the embodiment of the present invention
The non-equal entity of a same names or non-equal parameter, it is seen that " first " " second " only for the convenience of statement, does not answer
It is interpreted as the restriction to the embodiment of the present invention, subsequent embodiment no longer illustrates this one by one.
The embodiment of the present invention considers the transmission plan design towards DASH video multicasting, wherein how to carry out to user
Grouping, improves the focus that existing grouping scheme is the embodiment of the present invention.For the multicast of video traffic, forefathers have proposed one
A little user grouping schemes, but major part is the switching about unicast and multicast both of which, and user can only be in two kinds of transmission modes
Between selected.And for DASH video multicasting, video content that the user in a multicast group not only requests
Identical, the video code rate of selection also must be identical.If the video code rate for therefore user of same video content being selected to request is not
Together, it is also desirable to belong in different multicast groups, just also relate to the selection for multicast group at this time.Generally speaking, it uses
Family grouping strategy is the core of the video multicast grouping conceptual design towards DASH, wherein needing to consider two critical issues: the
One, each user selects code rate/multicast group according to what criterion；Second, request all users of same video content should
It is divided into how many a multicast groups, i.e., provides how many kinds of code rate for same video content actual needs.By to two above problem
Solution, can realize maximum throughput under given bandwidth condition.
The present invention provides a kind of user grouping scheme for DASH video multicasting.Firstly, according to the channel matter of user
Amount is clustered to divide multicast group, by the close user of channel quality point in a group, minimizes subscriber channel in group
The difference of quality.Secondly, the invention proposes a kind of sides for automatically determining number of packet suitable for DASH video multicast scene
Method, wherein not stringent separating unicast and multicast user, but unicast is treated as a special case of multicast.The multicast user mentioned point
Group scheme can improve network throughput under same band consumption, reduce interruption times and interrupt duration, improve user experience.
Based on above-mentioned purpose, the first aspect of the embodiment of the present invention provides one kind and is able to solve DASH video multicast
The user packet method for DASH video multicasting of equilibrium problem in business between video quality and bandwidth availability ratio.
As shown in Figure 1, the process of one embodiment for the user packet method provided by the invention for DASH video multicasting
Schematic diagram.
As shown in Figure 1, the user packet method for DASH video multicasting, optionally, poly- using k-means
Class algorithm is grouped, and specifically includes two parts:
First part automatically determines the k in k-means clustering algorithm, i.e. user grouping quantity.K-means clustering algorithm
Service condition be cluster number k it is known that therefore k value size need predefine.For DASH video multicasting,
With increasing for multicast group quantity, the otherness for organizing interior user channel quality can be reduced, and the good user of channel condition can obtain
Higher video code rate helps to improve user experience.But on the other hand, multicast group number increases and will increase total bandwidth money
Source consumption, 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 equalization point can be reached.
First part specifically can comprise the following steps that
Step 101: according to collect to 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 data that the channel quality information can acquire relative users by base station end obtain
It arrives, the SINR value of acquisition is denoted as S={ s1,s2,…,sn, wherein n is the total number of users of request same video content in cell.
Specifically, the step of cluster divides distance threshold is calculated in the channel quality information that the basis collects
101, it can further include following steps:
Step 1011: enabling to grouping user quantity is n, and the channel quality information for calculating each user collected (can
Be selected as user's SINR value) difference two-by-two, obtain a n × n dimension matrix:
Dn×n=d (si,sj) i, j=1,2 ..., n
Wherein, d (si,sj) indicate two users channel quality information between difference, si、sjRespectively i-th, jth
The channel quality information of a user；
Step 1012: mean difference is calculated, because of d (si,si)=0 needs to remove every row when calculating mean difference
0 value, obtain following mean difference:
Step 1013: it obtains cluster and divides distance threshold:
Wherein, minDn×nIndicate Distance matrix Dn×nMinimum value.
Step 102: choosing the maximum cluster centre difference of satisfaction and be less than the packet count of cluster division distance threshold as use
Family number of packet.
Specifically, k value is determined with the ergodic algorithm with termination condition.Therefore, optionally, the selection meets maximum
Cluster centre difference is less than the cluster and divides step 102 of the packet count of distance threshold as user grouping quantity, can also be into one
Step the following steps are included:
Step 1021: choosing initial packet number；In general, the division class number of cluster should not too be greater than to grouping user number
The square root of amountTherefore, the selection initial packet number, it may include following steps:
It obtains to grouping user quantity；
It calculates the square root to grouping user quantity and upper rounding is carried out to the square root, obtain described initial point
Group number, that is, take the initial value of k[·]+It is rounded in expression.
First by the initial data S={ s of channel quality information1,s2,…,snWith k-means clustering algorithm it is divided into k class, it counts
Calculate the cluster centre μ of every one kindi(i=1,2 ..., k), then calculate the difference DELTA μ of cluster centre two-by-two=| μi-μj| (i, j=
1,2,…,k)。
Finally, judging whether maximum cluster centre difference is less than cluster and divides distance, i.e. whether the following conditions are true:
Step 1022: if being based on the initial packet number, the maximum cluster centre difference being calculated using 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 to 1, i.e. k=k-1) of initial packet number is stated, with new
K be grouping number, then carry out k-means cluster, and new maximum cluster centre difference is calculated using clustering algorithm, then
Secondary to carry out above-mentioned judgement, until new maximum cluster centre difference is less than, the cluster divides distance threshold or new packet count is 1 (i.e.
K=1), loop termination, and using newest primary packet count as the user grouping quantity.
Second part is requested the user of same video content to be grouped, is specifically included using clustering algorithm in cell
Following steps:
Step 103: by clustering algorithm, according to the user grouping quantity and the channel quality information collected,
Complete user grouping；Optionally, the clustering algorithm is k-means clustering algorithm.
In grouping, using collected user's SINR value as sample data, to all users of request same video content
Multicastapackets are carried out, identical video code rate will be used by assigning to the user in a multicast group.In general, all in group in order to guarantee
User can normally watch video, and bandwidth resources are distributed on the basis of being the user that channel quality is worst in organizing.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 to select
Lower video code rate is selected, this will be greatly reduced the viewing experience of user.Therefore, the grouping criterion of proposition of the embodiment of the present invention is
User similar in channel quality is divided into one group as far as possible, reduces the user channel quality difference in same group.
It here, is that initial data clusters with the SINR (Signal to Interference plus Noise Ratio) of user using k-means clustering algorithm.
Therefore, described by clustering algorithm, according to the user grouping quantity and the channel quality information collected,
The step 103 for completing user grouping, can also further include steps of
Step 1031: enabling the user grouping quantity is k, and the channel quality information collected is divided into k class, is remembered
For G={ G1,G2,…,Gk, wherein GkIn comprising being divided into all data of kth class；
The cluster target of step 1032:k-means be choose following cost function can be made to minimize grouping scheme (that is,
The channel quality information of which user is assigned in same class):
Wherein, μiIt is GiThe mean value and cluster centre of channel quality information in class, sjFor the channel matter of j-th of user
Measure information；
Step 1033: according to the grouping scheme, k class will be divided into grouping user, every one kind is used as a multicast group, into
Row DASH video traffic multicast transmission.
From above-described embodiment as can be seen that the user grouping provided in an embodiment of the present invention for DASH video multicasting
Method meets packet count of the maximum cluster centre difference less than cluster division distance threshold as user grouping number by choosing
Amount, and grouping user is treated according to the user grouping quantity of the selection and is grouped by clustering algorithm, it is ensured that it is consuming
Under the premise of same band resource, higher handling capacity is obtained.
It is grouped it should be noted that above-described embodiment specifically uses k-means clustering algorithm, those skilled in the art
Member can be grouped based on common sense in the field according to the other similar clustering algorithm of the conceptual choice, can also be obtained 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, the second aspect of the embodiment of the present invention additionally provides one kind and is able to solve DASH video group
The user grouping for DASH video multicasting for broadcasting the equilibrium problem in business between video quality and bandwidth availability ratio fills
It sets.As shown in Fig. 2, the mould of one embodiment for the user grouping device provided by the invention for DASH video multicasting
Block structure schematic diagram.
The user grouping device for DASH video multicasting, comprising:
Distance threshold computing module 201, for (being chosen as according to the channel quality information to grouping user collected
Channel quality information of the Signal to Interference plus Noise Ratio (SINR, Signal to Interference plus Noise Ratio) as user
Initial data), be calculated cluster divide distance threshold；Wherein, the channel quality information can be acquired corresponding by base station end
The data of user and obtain, the SINR value of acquisition is denoted as S={ s1,s2,…,sn, wherein n is to request in same video in cell
The total number of users of appearance.
Optionally, the distance threshold computing module 201, can also be specifically used for:
Enabling to grouping user quantity is n, calculates the difference two-by-two of the channel quality information of each user collected, obtains
The matrix tieed up to a n × n:
Dn×n=d (si,sj) i, j=1,2 ..., n
Wherein, d (si,sj) indicate two users channel quality information between difference, si、sjRespectively i-th, jth
The channel quality information of a user；
Mean difference is calculated:
It obtains cluster and divides distance threshold:
Wherein, minDn×nIndicate Distance matrix Dn×nMinimum value.
Number of packet chooses module 202, is less than the cluster for the maximum cluster centre difference of selection satisfaction and divides apart from threshold
The packet count of value is as user grouping quantity；
Optionally, k value is determined with the ergodic algorithm with termination condition, the number of packet chooses module 202, may be used also
It is specifically used for:
Choose initial packet number；Wherein, the selection initial packet number also specifically includes: obtaining to grouping user quantity；
It calculates the square root to grouping user quantity and upper rounding is carried out to the square root, obtain the initial packet number, that is,
Take the initial value of k[·]+It is rounded in expression；
First by the initial data S={ s of channel quality information1,s2,…,snWith k-means clustering algorithm it is divided into k class, it counts
Calculate the cluster centre μ of every one kindi(i=1,2 ..., k), then calculate the difference DELTA μ of cluster centre two-by-two=| μi-μj| (i, j=
1,2,…,k)。
Finally, judging whether maximum cluster centre difference is less than cluster and divides distance, i.e. whether the following conditions are true:
If being based on the initial packet number, the cluster is less than using the maximum cluster centre difference that clustering algorithm is calculated
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 counts (here, the new packet count can be using the value that k is reduced to 1, i.e. k=k-1), is grouping with new k
Number, then k-means cluster is carried out, and new maximum cluster centre difference is calculated using clustering algorithm, until newly most
Big cluster centre difference is less than that the cluster divides distance threshold or new packet count is 1 (i.e. k=1), and by newest primary grouping
Number is used as the user grouping quantity.
Grouping module 203, for passing through clustering algorithm, according to the user grouping quantity and the channel matter collected
Information is measured, user grouping is completed.
In grouping, using collected user's SINR value as sample data, to all users of request same video content
Multicastapackets are carried out, identical video code rate will be used by assigning to the user in a multicast group.In general, all in group in order to guarantee
User can normally watch video, and bandwidth resources are distributed on the basis of being the user that channel quality is worst in organizing.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 to select
Lower video code rate is selected, this will be greatly reduced the viewing experience of user.Therefore, the grouping criterion of proposition of the embodiment of the present invention is
User similar in channel quality is divided into one group as far as possible, reduces the user channel quality difference in same group.
It optionally, is that initial data clusters with the SINR (Signal to Interference plus Noise Ratio) of user using k-means clustering algorithm；
The grouping module 203, is specifically used for:
Enabling the user grouping quantity is k, and the channel quality information collected is divided into k class, is denoted as G={ G1,
G2,…,Gk, wherein GkIn comprising being divided into all data of kth class；
Choose the grouping scheme that following cost function can be made to minimize:
Wherein, μiIt is GiThe mean value and cluster centre of channel quality information in class, sjFor the channel matter of j-th of user
Measure information；
According to the grouping scheme, k class will be divided into grouping user, it is every a kind of as a multicast group, carry out DASH view
Frequency business multicast transmission.
From above-described embodiment as can be seen that the user grouping provided in an embodiment of the present invention for DASH video multicasting
Device meets packet count of the maximum cluster centre difference less than cluster division distance threshold as user grouping number by choosing
Amount, and grouping user is treated according to the user grouping quantity of the selection and is grouped by clustering algorithm, it is ensured that it is consuming
Under the premise of same band resource, higher handling capacity is obtained.
It is grouped it should be noted that above-described embodiment specifically uses k-means clustering algorithm, those skilled in the art
Member can be grouped based on common sense in the field according to the other similar clustering algorithm of the conceptual choice, can also be obtained essentially identical
Effect therefore protection scope of the present invention should not be limited on specific clustering algorithm in the above-described embodiments.
In terms of the third of the embodiment of the present invention, provide a kind of using the above-mentioned user for DASH video multicasting
The DASH Video Multicast System framework of group technology.As shown in figure 3, being DASH Video Multicast System provided in an embodiment of the present invention
The structural schematic diagram of framework.
The DASH Video Multicast System framework is divided into three basic modules: DASH video source server, multi-medium multi-packet broadcasting
Broadcast Service Center and multicast user.
1) DASH video source server is responsible for generating original video stream, and source video is encoded to difference according to DASH agreement
The video version of code rate.
2) channel quality information of user feedback is collected first by multimedia multicast/broadcast service centre, in the embodiment of the present invention
It is middle to use SINR as user channel quality information.Then, by grouping submodule, (it can be directed to DASH video group for above-mentioned
Any embodiment for broadcasting the user grouping device of business is directed to DASH video group using in above-mentioned any means embodiment
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 takes according to grouping information and user video quality feedback information from video source
Suitable code rate version is selected in business device, is transmitted to multicast user.
3) multicast user is responsible for feeding back the channel quality information of oneself and video quality information and gives multimedia multicast/broadcast clothes
Business center, so that multimedia multicast/broadcast service centre carries out user grouping.
In addition, the technical solution based on the embodiment of the present invention has carried out emulation experiment.The embodiment of the present invention uses LTE system
Grade emulation platform.LTE can be DASH using OFDM space vocal imitation skill as widely used wireless cellular technology
Video multicasting provides higher message transmission rate, and supports the system bandwidth of 1.4MHz to 20MHz, band with higher
Wide flexibility.
20 users are set to be randomly dispersed in entire cell, channel loss include macroscopical path loss, shadow fading and
Multipath fading, signal carrier frequency are 2GHz, and system bandwidth about 5MHz, sub-frame duration 1ms, the emulation duration is 50s.
In order to facilitate expression, the user grouping side for DASH video multicasting that will be proposed using the embodiment of the present invention
The multicastapackets scheme of method is abbreviated as fair (DMF) scheme of DASH multicast.
It is shown according to emulation, the user packet method for DASH video multicasting proposed using the embodiment of the present invention
Multicastapackets scheme 20 users have finally been divided into 3 groups, see the table below 1.
The group result for the multicastapackets scheme that 1 embodiment of the present invention of table proposes
| 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 |
Emulation will be using the multicast of the user packet method for DASH video multicasting of proposition of the embodiment of the present invention
Grouping scheme and traditional unicast scheme based on fair (PF) dispatching algorithm of ratio are compared, the results showed that use this hair
The multicastapackets scheme for the user packet method for DASH video multicasting that bright embodiment proposes is than traditional unicast scheme
Handling capacity improve 8 times (referring to fig. 4).Meanwhile emulation is also directed to DASH video group for what is proposed using the embodiment of the present invention
The multicastapackets scheme and random grouping (RAND) scheme for broadcasting the user packet method of business are compared.The result shows that
Under conditions of identical best packet number k, using the user for DASH video multicasting of proposition of 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.In addition, emulation will also
Other indexs such as interruption times, interruption duration and the initial delay of video user are compared under three circumstances, referring to Fig. 5
~Fig. 7.The result shows that the multicast of the user packet method for DASH video multicasting proposed using the embodiment of the present invention
Grouping scheme is all optimal in these three indexs.Finally, in order to prove the embodiment of the present invention propose automatically determine user
The validity of the algorithm of number of packet k, the user for DASH video multicasting point that will be proposed using the embodiment of the present invention
The multicastapackets scheme of group method is compared with fixed grouping scheme, referring to attached drawing 8 and the following table 2.Multicast number is set as
1,2,3,4,5 emulates respectively, the results showed that, highest handling capacity is enough obtained when being grouped number k=3, the precisely present invention mentions
Best packet number determined by multicastapackets scheme out.
Table 2 is using the total throughout statistical form under the different user number of packet of fixed grouping scheme
It should be understood by those ordinary skilled in the art that: 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 thinking of the invention, above embodiments
Or can also be combined between the technical characteristic in different embodiments, step can be realized with random order, and be existed such as
Many other variations of the upper different aspect of the invention, for simplicity, they are not provided in details.
In addition, to simplify explanation and discussing, and in order not to obscure the invention, it can in provided attached drawing
It is connect with showing or can not show with the well known power ground of integrated circuit (IC) chip and other components.Furthermore, it is possible to
Device is shown in block diagram form, to avoid obscuring the invention, and this has also contemplated following facts, i.e., about this
The details of the embodiment of a little block diagram arrangements be height depend on will implementing platform of the invention (that is, these details should
It is completely within the scope of the understanding of those skilled in the art).Elaborating that detail (for example, circuit) is of the invention to describe
In the case where exemplary embodiment, it will be apparent to those skilled in the art that can be in these no details
In the case where or implement the present invention in the case that these details change.Therefore, these descriptions should be considered as explanation
Property rather than it is restrictive.
Although having been incorporated with specific embodiments of the present invention, invention has been described, according to retouching for front
It states, many replacements of these embodiments, modifications and variations will be apparent for those of ordinary skills.Example
Such as, discussed embodiment can be used in other memory architectures (for example, dynamic ram (DRAM)).
The embodiment of the present invention be intended to cover fall into all such replacements within the broad range of appended claims,
Modifications and variations.Therefore, all within the spirits and principles of the present invention, any omission, modification, equivalent replacement, the improvement made
Deng should all be included in the protection scope of the present invention.
Claims (4)
1. a kind of user packet method for DASH video multicasting characterized by comprising
According to the channel quality information to grouping user collected, cluster is calculated and divides distance threshold；
It chooses and meets packet count of the maximum cluster centre difference less than cluster division distance threshold as user grouping quantity；
User grouping is completed according to the user grouping quantity and the channel quality information collected by clustering algorithm；
Wherein, described choose meets packet count of the maximum cluster centre difference less than cluster division distance threshold as user point
Group quantity, comprising:
Choose initial packet number；
If being based on the initial packet number, divided using the maximum cluster centre difference that clustering algorithm is calculated less than the cluster
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 maximum cluster centre difference is calculated using clustering algorithm for new packet count, until new maximum cluster centre difference is small
Distance threshold is divided in the cluster or new packet count is 1, and using newest primary packet count as the user grouping quantity；
The selection initial packet number, comprising:
It obtains to grouping user quantity；
It calculates the square root to grouping user quantity and upper rounding is carried out to the square root, obtain the initial packet
Number；
The channel quality information that the basis collects is calculated cluster and divides distance threshold, comprising:
Enabling to grouping user quantity is n, calculates the difference two-by-two of the channel quality information of each user collected, obtains one
The matrix of a n × n dimension:
Dn×n=d (si,sj) i, j=1,2 ..., n
Wherein, d (si,sj) indicate two users channel quality information between difference, si、sjRespectively i-th, j-th of use
The channel quality information at family；
Mean difference is calculated:
It obtains cluster and divides distance threshold:
Wherein, minDn×nIndicate Distance matrix Dn×nMinimum value.
2. the method according to claim 1, wherein the clustering algorithm is k-means clustering algorithm；
It is described that user is completed according to the user grouping quantity and the channel quality information collected by clustering algorithm
Grouping, comprising:
Enabling the user grouping quantity is k, and the channel quality information collected is divided into k class, is denoted as G={ G1,
G2,…,Gk, wherein GkIn comprising being divided into all data of kth class；
Choose the grouping scheme that following cost function can be made to minimize:
Wherein, μiIt is GiThe mean value and cluster centre of channel quality information in class, sjFor the channel quality letter of j-th of user
Breath；
According to the grouping scheme, k class will be divided into grouping user, it is every a kind of as a multicast group, carry out DASH video industry
Business multicast transmission.
3. a kind of user grouping device for DASH video multicasting characterized by comprising
Distance threshold computing module, for cluster being calculated and draws according to the channel quality information to grouping user collected
Divide distance threshold；
Number of packet chooses module, for choosing the grouping for meeting maximum cluster centre difference and being less than cluster division distance threshold
Number is used as user grouping quantity；
Grouping module, for by clustering algorithm, according to the user grouping quantity and the channel quality information collected,
Complete user grouping；
Wherein, the number of packet chooses module, is specifically used for:
Choose initial packet number；
If being based on the initial packet number, divided using the maximum cluster centre difference that clustering algorithm is calculated less than the cluster
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 maximum cluster centre difference is calculated using clustering algorithm for new packet count, until new maximum cluster centre difference is small
Distance threshold is divided in the cluster or new packet count is 1, and using newest primary packet count as the user grouping quantity；
The number of packet chooses module, is also used to:
It obtains to grouping user quantity；
It calculates the square root to grouping user quantity and upper rounding is carried out to the square root, obtain the initial packet
Number；
The distance threshold computing module, is specifically used for:
Enabling to grouping user quantity is n, calculates the difference two-by-two of the channel quality information of each user collected, obtains one
The matrix of a n × n dimension:
Dn×n=d (si,sj) i, j=1,2 ..., n
Wherein, d (si,sj) indicate two users channel quality information between difference, si、sjRespectively i-th, j-th of use
The channel quality information at family；
Mean difference is calculated:
It obtains cluster and divides distance threshold:
Wherein, minDn×nIndicate Distance matrix Dn×nMinimum value.
4. device according to claim 3, which is characterized in that the clustering algorithm is k-means clustering algorithm；
The grouping module, is specifically used for:
Enabling the user grouping quantity is k, and the channel quality information collected is divided into k class, is denoted as G={ G1,
G2,…,Gk, wherein GkIn comprising being divided into all data of kth class；
Choose the grouping scheme that following cost function can be made to minimize:
Wherein, μiIt is GiThe mean value and cluster centre of channel quality information in class, sjFor the channel quality letter of j-th of user
Breath；
According to the grouping scheme, k class will be divided into grouping user, it is every a kind of as a multicast group, carry out DASH video industry
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 CN106550270A (en) | 2017-03-29 |
| CN106550270B true 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) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111512636A (en) * | 2017-10-31 | 2020-08-07 | 惠州Tcl移动通信有限公司 | Video multicast method, device and readable storage medium |
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 |
|---|
| 基于簇的组播接收端分组算法研究;刘阳迁;《中国优秀硕士学位论文全文数据库 信息科技辑》;20120315;全文 |
| 聚类分析中K-均值与K-中心点算法的研究;吴文亮;《中国优秀硕士学位论文全文数据库信息科技辑》;20111215;全文 |
| 自动获取k-means聚类参数k值的算法;田森平; 吴文亮;《计算机工程与设计》;20110116;全文 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106550270A (en) | 2017-03-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Araniti et al. | Adaptive resource allocation to multicast services in LTE systems | |
| Condoluci et al. | Multicast resource allocation enhanced by channel state feedbacks for multiple scalable video coding streams in LTE networks | |
| US11671852B2 (en) | Dynamic wireless broadcast system and method for operating the same | |
| Zhou et al. | Low complexity cross-layer design with packet dependent scheduling for heterogeneous traffic in multiuser OFDM systems | |
| CN103796244B (en) | A kind of many net access selection methods of the wireless isomer of equally loaded | |
| CN101790205B (en) | Collaborative management method and system of wireless resources under multiple services | |
| CN107547184A (en) | A kind of dynamic pilot allocation method in extensive mimo system | |
| CN102448147A (en) | Method and device for accessing wireless service | |
| CN107979824B (en) | D2D multicast resource allocation method in wireless network virtualization scene | |
| Rinaldi et al. | A novel approach for MBSFN area formation aided by D2D communications for eMBB service delivery in 5G NR systems | |
| CN106658733A (en) | Handling capacity optimization method based on user fairness and QoS in multi-user MIMO-OFDM | |
| CN106550270B (en) | A kind of user packet method and device for DASH video multicasting | |
| CN102256301B (en) | User selection method for simultaneously meeting unicast and multicast services | |
| WO2014094191A1 (en) | Method and apparatus for coordinated multipoint transmission | |
| CN107071919B (en) | LTE downlink real-time service scheduling improvement method based on packet loss rate | |
| CN106793122B (en) | Method for safely allocating each bit minimized wireless resources of heterogeneous network | |
| CN108012335A (en) | Multipath resource distribution method is virtualized under a kind of software defined network | |
| CN106332153A (en) | Method and device for controlling bandwidth in WLAN (wireless local area network) | |
| CN102572844B (en) | Method and device for distributing cell resources | |
| CN101778433B (en) | Method and device for scheduling radio resources | |
| CN104969644B (en) | Resource allocation methods and device | |
| Almowuena et al. | Mobile video streaming over dynamic single-frequency networks | |
| Ghandri et al. | A low-complexity scheduling for joint unicast and multicast transmissions in LTE-A network | |
| Hou et al. | Cognitive radio spectrum allocation strategy based on improved genetic algorithm | |
| CN103327636B (en) | A kind of resource regulating method for big data rate traffic |
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 |