CN103249006B - The pre-method for pushing of a kind of network data based on multicast - Google Patents

The pre-method for pushing of a kind of network data based on multicast Download PDF

Info

Publication number
CN103249006B
CN103249006B CN201310154258.2A CN201310154258A CN103249006B CN 103249006 B CN103249006 B CN 103249006B CN 201310154258 A CN201310154258 A CN 201310154258A CN 103249006 B CN103249006 B CN 103249006B
Authority
CN
China
Prior art keywords
terminal
data
multicast
network
network side
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
Application number
CN201310154258.2A
Other languages
Chinese (zh)
Other versions
CN103249006A (en
Inventor
钟晓峰
刘明录
周世东
赵明
王京
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Tsinghua University
Original Assignee
Tsinghua University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Tsinghua University filed Critical Tsinghua University
Priority to CN201310154258.2A priority Critical patent/CN103249006B/en
Publication of CN103249006A publication Critical patent/CN103249006A/en
Application granted granted Critical
Publication of CN103249006B publication Critical patent/CN103249006B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00Reducing energy consumption in communication networks
    • Y02D30/70Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

The network data that the present invention is based on multicast pushes transmission method in advance, belong to wireless network data transmission technique field, in wireless network data transmission, when there being a user to ask network data, by to the analysis of this service request and the channel status of current network, determine whether to there being the user of similar network use habit to use the mode of multicast to push this business in advance in its coverage and in adjacent cell by base station, by the prior probability function be accustomed to Web vector graphic the user accumulated before, the channel status of active user, calculate the alternative user scheme participating in multicast and push in advance, multi-cell synergetic transmission scheme, Modulation and Coding Scheme, calculate the expected revenus using multicast to obtain, and with traditional unicast Method compare, if obtain income than the threshold value being greater than setting, this method is then used to push, otherwise use traditional approach to push, this method can effectively heighten wireless frequency spectrum utilance, capacity usage ratio, optimized network transmission performance on the whole.

Description

The pre-method for pushing of a kind of network data based on multicast
Technical field
The present invention relates to the pre-method for pushing of a kind of network data based on multicast, belong to wireless network data transmission technique field.
Background technology
Along with smart mobile phone, the increase of hand-held mobile terminal number, future mobile communications network traffic data will increase substantially, and wherein the data traffic of the overwhelming majority will come from web-browsing and Internet video class business.In order under limited physical resource, meet the business demand of rapid growth, following mobile radio system must have higher transmission rate, the higher availability of frequency spectrum, lower energy consumption.
In traditional Wireless Data Transmission, the terminal of Network demand is had to obtain the general flow of serving as follows:
1. terminal reads network system information and random access resource
2. terminal Stochastic accessing, and again initiate when Stochastic accessing is competed unsuccessfully
3. connect with network base station
4. network carries out allocation of radio resources according to present load and adjacent cell disturbance regime
5. terminal carries out up-downgoing transfer of data with network
6. terminal is with network release connection, the transmission of finishing service data
Analyze display according to statistics, different user has certain correlation for the demand of Network, and the Internet resources of some focus may be required by different user.This correlation is with the content of business, and the behavioural characteristic of the online of user, the time of asset creation, the attributes such as user locations distribution all have certain contact.In traditional Network transfer process, do not consider the correlation of network service, different users asks to need to set up network separately according to above-mentioned steps respectively and connects, independently carry out the transmission of business, therefore there is the business of identical content, repeatedly may be repeated transmission, be caused the waste of physical resource.
Summary of the invention
In order to overcome the shortcoming of above-mentioned prior art, the object of the invention is to propose the pre-method for pushing of a kind of network data based on multicast, the Correlation properties of Network can be utilized, prior probability function Web vector graphic is accustomed to according to the user accumulated before and the channel status of active user, make full use of physical resource, improve efficiency of transmission, reduce power consumption.
For achieving the above object, the present invention takes following technical scheme:
The pre-method for pushing of a kind of network data based on multicast, the user behavior data of terminal in its covering is accumulated at network side, when a certain user terminal requests network data, network side is according to the business tine of these accumulation data and this request, if judge that covering all the other terminals interior are greater than for the probability of demand of this business tine the value preset, then use the pre-propelling data of the mode of multicast, while sending data to active user, complete the business demand in multiple terminal future.
When a user terminal requests network data, first according to the pre-propelling data buffer memory of content search of request, find whether certain moment have received the data content of this time asking by the pre-mode pushed before, if do not received, or this terminal needs upgrade and receive new data, this user terminal generates upstream data, and the information of the service request of oneself is put into upstream message, and adheres to a mark the need of the Flag marker bit receiving new data; After user terminal establishes the link with network side, send request data, network side detects request content, user terminal ID, utilizes request content more new business temperature database, upgrades user behavior data storehouse according to user behavior, detect Flag marker bit, if this user terminal does not need the data that please look for novelty, then this conversation end, disconnects network and connects; If this user terminal needs to carry out new data when sending, in network side carries out covering again, all the other terminals calculate for the probability of demand of this business tine.
Wherein network side is to covering the probability of demand P of all the other terminals interior for this business tine uEby following formulae discovery:
P UE=P(UE|UE_ID,UE_POS,TASK_CLASS,TASK_TIME,TASK_LIFE…)
Wherein, UE_ID represents user, and UE_POS represents customer location, and TASK_CLASS represents type of service, and TASK_TIME represents that business initiates the time, and TASK_LIFE represents business life, and ellipsis represents adeditive attribute.
Network side is according to business tine, and community, requested service terminal place and adjacent cell cover lower other terminal use custom, channel status, calculate cell scheduling strategy and terminal scheduling strategy, modulating-coding strategy is calculated according to channel status, extrapolate the transmission expected rate Rmax after using this method to optimize, do not use the clean culture transmission rate Rsingle of this method, and use the income Rmax/Rsingle after this method:
If when the prediction income that the mode of Web vector graphic multicast obtains is less than the expected revenus preset, the mode of traditional unicast is used to send data;
If when network side prediction uses multicast pre-propelling data acquisition income to be greater than the minimum expectation income preset, then the mode using multicast to push in advance sends data.
According to described optimisation strategy, selection scheduling participates in the alternative cell of multicast propelling movement and the alternative terminal in these communities, multicast sending out notice is sent to alternative cell by core net, notify that each alternative cell covers the interior alternative Termination ID participating in multicast and push, physical source distributing situation, modulation coding mode, by the alternative terminal in each alternative cell separately dispatching cell coverage.
May be in different conditions because network side covers interior terminal, the state therefore for them is divided into following situation to dispatch:
A) for being in connected state (connected), the terminal of state of activation/continuous accepting state (active), due to its lasting monitoring control channel message, therefore directly can notify that downlink data arrives on a control channel, downlink data physical resource position, the information such as modulating-coding strategy, and keep connected_active state;
B) for being in connected state, the terminal of discontinuous receiving state, due to the terminal only ability reading control signal channel when its discontinuous listening period arrives, therefore network side is when the discontinuous listening period of each terminal arrives, schedule information is sent at the control channel of terminal, activated terminals, makes it enter connected_active state;
C) for the terminal being in idle condition, need network side first to terminal, initiate paging, triggering terminal connects, and after terminal initial connection establishment completes, terminal directly enters connected_active state.
After the terminal of the pre-propelling data of full entry multicast enters connected_active state, each terminal monitors oneself control channel continuously, network side sends the physical resource position of multi-case data in control channel, modulation coding mode, after each terminal receives control signal, the physical resource position starting to specify at network side receives data.
According to terminal QoS demand, network side determines that terminal carries out HARQ and data re-transmission opportunity, and after data are sent, this time network data multicast has pushed in advance, middle connection breaking.
The present invention is based on the pre-method for pushing of network data of multicast, utilize the correlation of network data service, whenever a terminal request network data, network side is according to the user behavior data accumulated in the past, the business tine of this request, decision-making goes out current business and whether is applicable to multicast propelling movement.In conjunction with current network load situation, all the other terminal channel states in MPS process, network side dispatches suitable community and terminal, uses the pre-propelling data of mode of multicast.When a terminal successfully employs pre-propelling data, it can provide a feedback, in order to optimizing user behavioural analysis for network side.Multicast in the present invention pushes mode, make use of the redundancy of transfer of data in a network fully, the data that may be used by multiple user, other terminal this business being had to similar demands sent to by the mode of multicast when its first time is requested, by the consumption of a business transfer resource, complete the business demand in multiple terminal future.Instant invention overcomes in legacy network data business, the shortcoming that part hot spot service is repeatedly transmitted, under the condition of Terminal Service not affecting initiating business request, improve resource utilization ratio.
Accompanying drawing explanation
Fig. 1 is that in the present invention, user behavior data storehouse upgrades and business demand probability calculation FB(flow block).
Fig. 2 is the pre-method for pushing of the network data based on the multicast FB(flow block) that the present invention proposes.
Embodiment
Below in conjunction with drawings and Examples, the present invention is described further.
The pre-method for pushing of the network data based on multicast that the present invention proposes, its FB(flow block) as shown in Figure 1, comprises the following steps:
(1) when the terminal pushed in advance when network enabled data has a network data request, according to the pre-propelling data buffer memory of content search of request, find whether certain moment have received the data content of this time asking by the pre-mode pushed before.
(2) terminal of requested service generates upstream data, and the information of the service request of oneself is put into upstream message.Whether the business datum according to this request is successfully received by the pre-mode pushed, or this terminal needs more new data, by Terminal-decision the need of receiving new data, the result of decision is adhered to a Flag marker bit in upstream message, mark terminal is the need of reception new data.
(3) terminal establishes the link with network side, and network side receives customer service request.Because different user has correlation for the demand of business, the same user of this correlation (UE_ID), customer location (UE_POS), type of service (TASK_CLASS), business initiates the time (TASK_TIME), this business life (TASK_LIFE) and other possibility attribute are correlated with, and therefore user is the conditional probability relevant to these attributes for the probability of demand of business:
P UE=P(UE|UE_ID,UE_POS,TASK_CLASS,TASK_TIME,TASK_LIFE…)
For the service request received, network side can go out the demand of other user for this business by this formulae discovery, thus judges the possibility of other user for this business demand.The concrete operations flow process of step 3 is as follows:
A) network side receives customer service request.
B) time in analysis business, the attributes such as positional information, for calculating the conditions of demand of other user to this business, need the attribute in this business information to carry out discretization.The time that business is initiated first will as the starting point of this business hours attribute (TASK_TIME), and the business of the same hereinafter all needs the time attribute in this, as oneself.For temporal information, different time grades can be accurate to according to actual conditions, as using the different dates as different time attribute or the time attribute that is divided into every day initiating as business several time period.For the life duration (TASK_LIFE) of business, namely calculate current time (CUR_TASK_TIME), the time interval with initial time: TASK_LIFE=CUR_TASK_TIME-TASK_TIME, and as required discretization is carried out to it, such as: within 3 days, 3 days-6 days ...For the area attribute (UE_POS) of business, physical coordinates when can initiate business according to user as partitioning standards, or using community, place as partitioning standards, in order to reduce amount of calculation, can merge one or several areas and being regarded as identical area.For type of service (TASK_CLASS), classify according to business actual conditions, as sport category, the mode classifications such as amusement class.By analyzing the solicited message of this business, obtain the property set of this business:
S={UE_ID,UE_POS,TASK_CLASS,TASK_TIME,TASK_LIFE…}。
C) network side detects Flag marker bit, if this service needed initiates new transfer of data, enters step d), otherwise enters step e)
D) this community and the adjacent cell probability of demand for this business is calculated:
P UE=P(UE|UE_ID,UE_POS,TASK_CLASS,TASK_TIME,TASK_LIFE…)
Circular is as follows:
P UE = P ( UE | UE _ ID , UE _ POS , TASK _ CLASS , TASK _ TIME , TASK _ LIFE · · · )
= P ( UE | S )
= P ( UE , S ) P ( S )
= P ( S | UE ) P ( UE ) P ( S )
Suppose that total service request record number is N, wherein add up to COUNT (UE) by the business of UE demand, then P (UE) computing formula is in the past:
P ( UE ) = COUNT ( UE ) N
P (S|UE)=P (UE_ID, UE_POS, TASK_CLASS, TASK_TIME, TASK_LIFE ... | UE) suppose non-correlation between each attribute, then above formula can be expressed as:
P(S|UE)=P(UE_ID|UE)P(UE_POS|UE)P(TASK_CLASS|UE)...
Example is calculated as with P (UE_POS|UE):
COUNT (UE_POS, UE) is for this UE is at the sum of UE_POS place initiating business request
P ( UE _ POS | UE ) = COUNT ( UE _ POS , UE ) COUNT ( UE )
For P(S) be only relevant to an attribute variable, can suppose that it is steady state value, not participate in calculating.
E) fresh information that this business obtains is upgraded original legacy data storehouse, update method is as follows:
With this business (TASK_ID) for index adds a new tuple in database, the attribute of this tuple is the UE_ID of this time request, recalculate the correlation between UE, namely before again searching for, this TASK_ID is initiated to the UE of demand, symmetrical renewal two relevant UE:COUNT(UE_ID, UE)=COUTN (UE_ID, UE)+1, recalculates other association attributes simultaneously refreshing this UE:
For calculating P (UE), need to upgrade: N=N+1, COUNT (UE_ID)=COUNT (UE_ID+1);
For other conditional probability, need to upgrade: COUNT (UE_POS, UE_ID)=COUNT (UE_POS, UE_ID)+1
F) Flag marker bit is detected, if this business is only that then this time business stops, and disconnects once to the pre-reporting message pushing content and use.Otherwise proceed step 4.
(4) when detecting that terminal needs to carry out new data transmission, network side is according to business tine, and community, requested service terminal place and adjacent cell cover lower other terminal use custom, channel status, calculate cell scheduling strategy and terminal scheduling strategy, calculate modulating-coding strategy according to channel status, the send mode that optimization expected revenus is maximum, and make comparisons with the minimum expectation income that multicast sends.
The conditions of demand of different terminals for this business have been obtained by step 3, the UE maximum number supposing simultaneously to participate in multicast is Nmax, in multicast range, all UE number is Ncur, then this problem is a combinatorial optimization problem: from Ncur UE, namely select Nmax at the most make to send data total throughout expectation maximization.
This problem can be expressed as:
a)Rmax=max{min(R UE0,R UE1,...)*[1+Σf(P UEi)]}
B) s.t:UE ∈ Ncur, UE sum <Nmax
c)Power>max(POWER(UEi))
Wherein f (P uEi) be P uEimonotonic increasing function, span [0,1], as the weight coefficient of optimization object function.Power is base station maximum transmission power, max (POWER (UEi)) represents, in order to reach Rmax, the transmitting power required for maximum UEi being required to transmitted power, ensure that each Base Transmitter gross power is less than its maximum transmission power.
From Shannon channel capacity formula, the theoretical maximum velocity can supported for single terminal is:
Rsingle=w*log(1+SNR)[b/Hz]
Calculate comparatively simple for R signal to noise ratio (snr) when single subdistrict:
Suppose that cell transmit power is P, in bandwidth, noise power is P n, in single community, SNR is:
SNR = P P N
For using multiple cell coordination to send the situation of data to terminal, price i-th cell transmit power is P i, as the path loss position PL of his incoming terminal i, then its receiving terminal signal to noise ratio is:
SNR = &Sigma; i &Element; &Gamma; P i * PL i P N
By SNR computing formula being brought into optimization problem above, the Rmax of the problems referred to above optimal solution can be solved, by calculating judge, if be greater than setting threshold, then use multicast to push in advance, otherwise use traditional approach clean culture to send.
For real system, the transmission rate of network side final decision to be tabled look-up acquisition according to the SNR of terminal usually, and he corresponds to the modulation system of terminal, and code rate.Final transmission rate is set to R by unification here max.
(5) if when the prediction income that the mode of Web vector graphic multicast obtains is less than the expected revenus preset, the mode of traditional unicast is used to send data.If when network side prediction uses multicast pre-propelling data acquisition income to be greater than the minimum expectation income preset, then the mode using multicast to push in advance sends data.
(6) network side is according to the optimisation strategy in step (4), selection scheduling participates in the alternative cell of multicast propelling movement and the alternative terminal in these communities, multicast sending out notice is sent to alternative cell by core net, notify that each alternative cell covers the interior alternative Termination ID participating in multicast and push, physical source distributing situation, modulation coding mode, by the alternative terminal in each alternative cell separately dispatching cell coverage.
(7) because terminal in community may be in different conditions, the state therefore for them is divided into following situation to dispatch:
A) for being in connected state (connected), the terminal of state of activation/continuous accepting state (active), due to its lasting monitoring control channel message, therefore directly can notify that downlink data arrives on a control channel, downlink data physical resource position, the information such as modulating-coding strategy, and keep connected_active state.
B) for being in connected state, the terminal of discontinuous receiving state, due to the terminal only ability reading control signal channel when its discontinuous listening period arrives, therefore network side is when the discontinuous listening period of each terminal arrives, schedule information is sent at the control channel of terminal, activated terminals, makes it enter connected_active state.Because end is at connected state, therefore in the case, eliminate RRC link setup equal time, terminal can be transferred to continuous accepting state faster, and terminal monitoring moment computing formula is as follows:
Short period:
[(SFN*10)+subframe number]%(shortDRX_Cycle)=(drxStartOffset)%(shortDRX_Cycle)
Long period:
[(SFN*10)+subframe number]%(longDRX_Cycle)=(drxStartOffset)%(longDRX_Cycle)
Above parameter completes configuration by rrc layer
C) for the terminal being in idle condition, need network side first to terminal, initiate paging, triggering terminal connects, and after terminal initial connection establishment completes, terminal directly enters connected_active state.For the terminal being in Idle state, now connect without RRC and distributed to the specific resource of user, terminal needs monitoring seek channel and Broadcast Control Channel, the time cycle of now monitoring is controlled by NAS message, for LTE system, terminal monitoring paging channel moment computing formula is as follows:
Monitoring frame number calculates
SFN%T=(T/N)*(UE_ID%N)
Monitoring subframe calculates
T=min (acquiescence paging cycle is specified in Tc(community), Tue(terminal acquiescence paging cycle))
N=min (T, the number of sub frames ' T monitored in every frame)
Ns=max (1, the number of sub frames monitored in every frame)
Wherein the duration of T is 32-256 subframe, and whole paging may be introduced average delay and be less than 500ms.
Be connected need to initiate Stochastic accessing to set up RRC with network after terminal receives paging, for LTE system, each time slot can configure at most 64 random access resources, concrete permission Stochastic accessing number of times per second is relevant with system configuration frame format, wherein FDD frame format: 6400-64000 time, tdd frame form: 3200-38400 time.Known by emulating, altogether produce time delay <1s.
(8) after the terminal of the pre-propelling data of full entry multicast enters connected_active state, each terminal monitors oneself control channel continuously, network side sends the physical resource position of multi-case data in control channel, modulation coding mode, after each terminal receives control signal, the physical resource position starting to specify at network side receives data.
(9) according to terminal QoS demand, network side determines that terminal carries out HARQ and data re-transmission opportunity, retransmits and terminates rear continuation (8).
(10), after data are sent, this time network data multicast has pushed in advance, middle connection breaking.

Claims (7)

1. the pre-method for pushing of the network data based on multicast, the user behavior data of terminal in its covering is accumulated at network side, when a certain user terminal requests network data, network side is according to the business tine of these accumulation data and this request, if judge that covering all the other terminals interior are greater than for the probability of demand of this business tine the value preset, then use the pre-propelling data of the mode of multicast, while sending data to active user, complete the business demand in multiple terminal future, it is characterized in that, when a user terminal requests network data, first according to the pre-propelling data buffer memory of content search of request, find whether certain moment have received the data content of this time asking by the pre-mode pushed before, if do not received, or this terminal needs upgrade and receive new data, this user terminal generates upstream data, the information of the service request of oneself is put into upstream message, and adhere to a mark the need of the Flag marker bit receiving new data, after user terminal establishes the link with network side, send request data, network side detects request content, user terminal ID, utilizes request content more new business temperature database, upgrades user behavior data storehouse according to user behavior, detect Flag marker bit, if this user terminal does not need the data that please look for novelty, then this conversation end, disconnects network and connects, if this user terminal needs to carry out new data when sending, in network side carries out covering again, all the other terminals calculate for the probability of demand of this business tine.
2. according to claim 1 based on the pre-method for pushing of network data of multicast, it is characterized in that, network side is to covering the probability of demand P of all the other terminals interior for this business tine uEby following formulae discovery:
P UE=P(UE|UE_ID,UE_POS,TASK_CLASS,TASK_TIME,TASK_LIFE…)
Wherein, UE_ID represents user, and UE_POS represents customer location, and TASK_CLASS represents type of service, and TASK_TIME represents that business initiates the time, and TASK_LIFE represents business life, and ellipsis represents adeditive attribute.
3. according to claim 1 based on the pre-method for pushing of network data of multicast, it is characterized in that, network side is according to business tine, and community, requested service terminal place and adjacent cell cover lower other terminal use custom, channel status, calculate cell scheduling strategy and terminal scheduling strategy, modulating-coding strategy is calculated according to channel status, extrapolate the transmission expected rate Rmax after using this method to optimize, do not use the clean culture transmission rate Rsingle of this method, and the income Rmax/Rsingle after using we to send out:
If when the prediction income that the mode of Web vector graphic multicast obtains is less than the expected revenus preset, the mode of traditional unicast is used to send data;
If when network side prediction uses multicast pre-propelling data acquisition income to be greater than the minimum expectation income preset, then the mode using multicast to push in advance sends data.
4. according to claim 3 based on the pre-method for pushing of network data of multicast, it is characterized in that, according to described optimisation strategy, selection scheduling participates in the alternative cell of multicast propelling movement and the alternative terminal in these communities, send multicast sending out notice by core net to alternative cell, notify that each alternative cell covers the interior alternative Termination ID participating in multicast and push, physical source distributing situation, modulation coding mode, by the alternative terminal in each alternative cell separately dispatching cell coverage.
5. according to claim 3 based on the pre-method for pushing of network data of multicast, it is characterized in that, may be in different conditions because network side covers interior terminal, the state therefore for them is divided into following situation to dispatch:
A) for being in connected state (connected), the terminal of state of activation/continuous accepting state (active), due to its lasting monitoring control channel message, therefore directly can notify that downlink data arrives on a control channel, downlink data physical resource position, the information such as modulating-coding strategy, and keep connected_active state;
B) for being in connected state, the terminal of discontinuous receiving state, due to the terminal only ability reading control signal channel when its discontinuous listening period arrives, therefore network side is when the discontinuous listening period of each terminal arrives, schedule information is sent at the control channel of terminal, activated terminals, makes it enter connected_active state;
C) for the terminal being in idle condition, need network side first to terminal, initiate paging, triggering terminal connects, and after terminal initial connection establishment completes, terminal directly enters connected_active state.
6. according to claim 5 based on the pre-method for pushing of network data of multicast, it is characterized in that, after the terminal of the pre-propelling data of full entry multicast enters connected_active state, each terminal monitors oneself control channel continuously, network side sends the physical resource position of multi-case data in control channel, modulation coding mode, after each terminal receives control signal, the physical resource position starting to specify at network side receives data.
7., according to claim 5 based on the pre-method for pushing of network data of multicast, it is characterized in that, according to terminal QoS demand, network side determines that terminal carries out HARQ and data re-transmission opportunity, after data are sent, this time network data multicast has pushed in advance, middle connection breaking.
CN201310154258.2A 2013-04-28 2013-04-28 The pre-method for pushing of a kind of network data based on multicast Active CN103249006B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201310154258.2A CN103249006B (en) 2013-04-28 2013-04-28 The pre-method for pushing of a kind of network data based on multicast

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201310154258.2A CN103249006B (en) 2013-04-28 2013-04-28 The pre-method for pushing of a kind of network data based on multicast

Publications (2)

Publication Number Publication Date
CN103249006A CN103249006A (en) 2013-08-14
CN103249006B true CN103249006B (en) 2015-09-30

Family

ID=48928180

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201310154258.2A Active CN103249006B (en) 2013-04-28 2013-04-28 The pre-method for pushing of a kind of network data based on multicast

Country Status (1)

Country Link
CN (1) CN103249006B (en)

Families Citing this family (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104640224B (en) * 2013-11-12 2018-06-19 华为技术有限公司 A kind of network data transmission method, apparatus and system
JP6253129B2 (en) * 2014-02-22 2017-12-27 ホアウェイ・テクノロジーズ・カンパニー・リミテッド Video data transmission method and related device
CN105338549A (en) * 2014-08-11 2016-02-17 华为技术有限公司 Method and equipment for determining multimedia data sending mode
CN105516994B (en) * 2014-09-25 2018-12-25 华为技术有限公司 A kind of bandwidth allocation methods and equipment
CN105992155B (en) * 2015-01-30 2020-02-07 中国移动通信集团公司 Method, device and system for single multicast dynamic switching in network
CN109547944A (en) * 2017-09-21 2019-03-29 华为技术有限公司 The method and device of data transmission
CN109542207B (en) * 2018-11-30 2021-05-11 河南工学院 Method and device for pushing travel information
CN110267303B (en) * 2019-04-22 2021-01-01 北京邮电大学 Information pushing method and equipment
CN111200639B (en) * 2019-12-20 2023-04-07 上海淇玥信息技术有限公司 Information pushing method and device based on user operation behavior and electronic equipment

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2007005152A2 (en) * 2005-07-05 2007-01-11 Motorola, Inc. Method and system for multicasting data in a communication network
CN101399690A (en) * 2007-09-28 2009-04-01 中国科学院软件研究所 Multimedia data transmission method and system thereof
CN102325264A (en) * 2011-09-14 2012-01-18 华为技术有限公司 Method for distributing and ordering media content, set top box and system
CN102467553A (en) * 2010-11-18 2012-05-23 中兴通讯股份有限公司 Intelligent data pushing method and device

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2007005152A2 (en) * 2005-07-05 2007-01-11 Motorola, Inc. Method and system for multicasting data in a communication network
CN101399690A (en) * 2007-09-28 2009-04-01 中国科学院软件研究所 Multimedia data transmission method and system thereof
CN102467553A (en) * 2010-11-18 2012-05-23 中兴通讯股份有限公司 Intelligent data pushing method and device
CN102325264A (en) * 2011-09-14 2012-01-18 华为技术有限公司 Method for distributing and ordering media content, set top box and system

Also Published As

Publication number Publication date
CN103249006A (en) 2013-08-14

Similar Documents

Publication Publication Date Title
CN103249006B (en) The pre-method for pushing of a kind of network data based on multicast
Wang et al. Offloading mobile data traffic for QoS-aware service provision in vehicular cyber-physical systems
CN101366319B (en) Cognitive communications
CN101686497B (en) Cell load equalization method, and cell load evaluation method and device
CN103428642B (en) Based on relaying bunch in D2D multicasting method
CN101341681B (en) Distributed intelligent scheduling compensation optimizing system and method for wireless self-organizing network and personal domain network
Almowuena et al. Energy-aware and bandwidth-efficient hybrid video streaming over mobile networks
Zheng et al. Dynamic performance analysis of uplink transmission in cluster-based heterogeneous vehicular networks
JP2005525065A5 (en)
KR20110081724A (en) Method and apparatus of paging for high power saving reception mode m2m/mtc device communication in a mobile communication system
KR20130077815A (en) Method and apparatus for determining a cooperative terminal
CN104768201A (en) Method and system for data transmission in internet of things, internet of things device and terminal
CN102638872A (en) Relay selection method based on load balancing in cooperation relay network
CN103179628B (en) Based on the method for the clustering routing of wireless sensing net node middleware
CN103067977B (en) Data concurrence transmission method based on cross-layer optimization in wireless heterogeneous network system
CN105657837A (en) Virtual cell resource allocation method, device and system
Yao et al. Achieving high throughput with predictive resource allocation
CN102917465B (en) D2D (Dimension to Dimension) multicast opportunistic scheduling method for realizing throughput rate maximization for cellular network
Turcanu et al. Duplicate suppression for efficient floating car data collection in heterogeneous LTE-DSRC vehicular networks
Sefuba et al. Energy‐efficient medium access control and routing protocol for multihop wireless sensor networks
Huynh et al. Energy consumption optimization for green Device-to-Device multimedia communications
CN101877829B (en) Power control method for realizing load balance
Barik et al. DAMS: D2D-assisted multimedia streaming service with minimized BS transmit power in cellular networks
Huang et al. Multimedia over cognitive radio networks: Towards a cross-layer scheduling under Bayesian traffic learning
CN104301964A (en) Self-adaptive opportunity cooperative control method based on combined forecasting

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20190110

Address after: 102206 Room 502, 5th Floor, 8th Building, No. 4 Hospital, Life Garden Road, Changping District Science and Technology Park, Beijing

Patentee after: Beijing Intelsay Technology Co.,Ltd.

Address before: 100084 Beijing Haidian District 100084 box 82 box, Tsinghua University Patent Office

Patentee before: Tsinghua University

TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20240117

Address after: 100084 Tsinghua Yuan, Beijing, Haidian District

Patentee after: TSINGHUA University

Address before: 102206 Room 502, 5th Floor, 8th Building, No. 4 Hospital, Life Garden Road, Changping District Science and Technology Park, Beijing

Patentee before: Beijing Intelsay Technology Co.,Ltd.