CN111541778B - Active pushing method for on-site operation and maintenance information of power communication network - Google Patents

Active pushing method for on-site operation and maintenance information of power communication network Download PDF

Info

Publication number
CN111541778B
CN111541778B CN202010449571.9A CN202010449571A CN111541778B CN 111541778 B CN111541778 B CN 111541778B CN 202010449571 A CN202010449571 A CN 202010449571A CN 111541778 B CN111541778 B CN 111541778B
Authority
CN
China
Prior art keywords
user
content file
content
average
request
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
CN202010449571.9A
Other languages
Chinese (zh)
Other versions
CN111541778A (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.)
Guangdong Power Grid Co Ltd
Dongguan Power Supply Bureau of Guangdong Power Grid Co Ltd
Original Assignee
Guangdong Power Grid Co Ltd
Dongguan Power Supply Bureau of Guangdong Power Grid Co Ltd
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 Guangdong Power Grid Co Ltd, Dongguan Power Supply Bureau of Guangdong Power Grid Co Ltd filed Critical Guangdong Power Grid Co Ltd
Priority to CN202010449571.9A priority Critical patent/CN111541778B/en
Publication of CN111541778A publication Critical patent/CN111541778A/en
Application granted granted Critical
Publication of CN111541778B publication Critical patent/CN111541778B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/50—Network services
    • H04L67/55—Push-based network services
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/50—Network services
    • H04L67/56—Provisioning of proxy services
    • H04L67/568—Storing data temporarily at an intermediate stage, e.g. caching
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/50—Network services
    • H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
    • H04L67/62—Establishing a time schedule for servicing the requests
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/10—Flow control between communication endpoints
    • H04W28/14—Flow control between communication endpoints using intermediate storage
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/12—Messaging; Mailboxes; Announcements
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
    • H04W52/04—TPC
    • H04W52/30—TPC using constraints in the total amount of available transmission power
    • H04W52/36—TPC using constraints in the total amount of available transmission power with a discrete range or set of values, e.g. step size, ramping or offsets

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The embodiment of the invention discloses an active pushing method of on-site operation and maintenance information of an electric power communication network, which comprises the following steps: the server is set to generate a content file composed of B nats when t=0, the content file is pushed to a user through a wireless link, and the user which enables caching stores the pushed content file in a local buffer area of the user; the user requests the content file with a set probability α, and requests the content file after a random delay from t=0; the invention derives the user request probability threshold based on the average energy consumption of the pushing system and considering the network average delay constraint, when the user request probability is lower than the threshold, the system does not need to push information to the corresponding user so as to reduce unnecessary energy consumption, and simultaneously, in order to improve the energy efficiency, an optimal strategy is adopted to solve the problem of minimizing the energy consumption when the content is pushed and the transmission power is distributed, and the strategy obviously improves the energy efficiency of the system along with the increase of the content request probability.

Description

Active pushing method for on-site operation and maintenance information of power communication network
Technical Field
The embodiment of the invention relates to the technical field, in particular to an active pushing method for on-site operation and maintenance information of an electric power communication network.
Background
The problems of field link missing and inconvenient interaction of operation and maintenance information exist in the decision-making and execution processes of the electric power communication operation and maintenance operation, and the problems of incapability of realizing automation, flow and intellectualization of the field operation and maintenance operation due to the lack of real-time scene perception, operation adaptation and interaction of guide information of the field operation and maintenance operation, and the problems of field operation and maintenance efficiency and completion effect exist, so that the automatic execution technology of the interactive field operation and maintenance operation based on scene perception needs to be researched. Therefore, aiming at the problems of complexity, information interaction time, uncertainty of content and the like of the on-site operation and maintenance scene, how to realize accurate remote operation matching according to various real-time perception information, how to reasonably push operation and maintenance information according to the operation and real-time perception information of complex operation and maintenance personnel, give clear operation and maintenance operation guidance and feed back in real time aiming at on-site operation and maintenance results, further realize automatic execution of interactive on-site operation and maintenance operation, and become a challenge in the on-site operation and maintenance intelligent process.
The rapid popularity of mobile devices and multimedia applications has stimulated an increasing demand for wireless data services. Currently, more and more people access multimedia contents through various wireless terminals, and a heavy burden is imposed on a mobile network. While efforts are made to increase the capacity of wireless links, traditional mobile networks still have difficulty coping with the exponential increase in traffic demand due to the limitations of the radio spectrum. As a promising 5G network solution, active push and cache technologies may utilize free spectrum to increase system capacity during off-peak hours, recently drawing significant attention in academia and industry. Since a large number of users frequently access a small number of popular content, pushing and buffering is expected to reduce the content access delay and outage probability and improve the throughput of the network. However, if the user does not need to push the content, pushing and caching may result in energy waste, and thus energy efficiency is an interesting issue for push networks.
Disclosure of Invention
Therefore, the embodiment of the invention provides an active pushing method for on-site operation and maintenance information of an electric power communication network, which aims to solve the problem that energy waste possibly exists in pushing and caching in the prior art.
In order to achieve the above object, the embodiments of the present invention provide the following technical solutions:
an active pushing method of on-site operation and maintenance information of an electric power communication network comprises the following steps:
the server is set to generate a content file composed of B nats when t=0, the content file is pushed to a user through a wireless link, and the user which enables caching stores the pushed content file in a local buffer area of the user;
the user requests the content file with a set probability α, the user requests the content file after a random delay from t=0, the random delay being determined by a probability density function f X The non-negative random variable X of (y), where y is the user request time.
As a preferable mode of the present invention, the period duration of the server transmitting the content file is set to T.
As a preferred aspect of the present invention, the user requesting the content file includes two phases: a push phase before the user request and a delivery phase after the user request.
As a preferred embodiment of the present invention, the push phase server uses power P 1 Transmitting the content file to the user, and setting t max Is the maximum push time of the content file composed of B nats;
if the request for a content file is at time t max After that, the content file is pushed by the server before the user request arrives, the user accesses the required content file locally, and no content is transmitted in the delivery stage;
otherwise, the server performs the transfer of the transfer phase from the beginning of the next time period after the arrival of the user request.
As a preferred embodiment of the present invention, random variables L and D are set as integers, the number of time periods consumed in the push stage and the transfer stage being represented by pL (L) and pD (D), respectively, where L and D are realizations of L and D, respectively;
if the user requests a request greater than the time point t max Early arrival, then a total of need in the push phaseDelivering content files for a period of time, the server using power P during the delivery phase 2 The transmission of the remainder of the content file is completed for the duration of D time periods.
As a preferred solution of the present invention, before pushing the content file according to the actual requirement, the user needs to wait only if the required content is not found in the local storage, and taking the time consumed by the delivery phase as the delay measure, the average delay constraint E [ D ] limiting the average user waiting time of the delivery phase is expressed as:
wherein τ a Is the upper bound of the average delay.
As a preferred embodiment of the present invention, the power P is used by optimizing 1 And P 2 To minimize average energy consumption, considering different delay constraints at the delivery phase of the content file, objective functions and constraints represent:
mim(E(P 1 ,P 2 ))
wherein min (E (P) 1 ，P 2 ) As an objective function to minimize average energy consumption, s.t. as a constraint.
As a preferred solution of the present invention, when a content file is pushed, the rest of the content file must be transmitted to the user within a given average delay, which is calculated by:
for a given power of use P 1 And P 2 The average delay of the channel is:
wherein:E 1 (. Cndot.) is of the form->Is a function of the exponential integral of (a).
As a preferred embodiment of the present invention, the transmission energy consumption includes the energy consumption before the content request and the energy consumption after the user request, for a given usage power P 1 And P 2 The average energy consumed in the channel is:
wherein, the liquid crystal display device comprises a liquid crystal display device,setting the use power P 1 ＝e q1 And P 2 ＝e q2 The average energy consumed in the channel is optimized as:
wherein delta>0 and small enough to ensure e q 1=0 or e q The continuity of the function at 2=0, the optimal power allocation of the channel is obtained by solving the average energy optimization result.
Embodiments of the present invention have the following advantages:
the invention derives the user request probability threshold based on the average energy consumption of the pushing system and considering the average delay constraint of the network, when the user request probability is lower than the threshold, the system does not need to push information to the corresponding user so as to reduce unnecessary energy consumption;
and meanwhile, in order to improve the energy efficiency, the problem of minimizing the energy consumption is solved by adopting an optimal strategy when the content is pushed and the transmission power is distributed, and the strategy obviously improves the energy efficiency of the system along with the increase of the probability of the content request.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below. It will be apparent to those of ordinary skill in the art that the drawings in the following description are exemplary only and that other implementations can be obtained from the extensions of the drawings provided without inventive effort.
FIG. 1 is a block diagram of a push model of a content file in an embodiment of the present invention;
FIG. 2 is a graph of average energy consumption versus λ in an embodiment of the present invention;
FIG. 3 is a graph of average energy consumption versus request probability α in an embodiment of the present invention;
FIG. 4 is a graph of average energy consumption versus average delay constraint in an embodiment of the present invention.
Detailed Description
Other advantages and advantages of the present invention will become apparent to those skilled in the art from the following detailed description, which, by way of illustration, is to be read in connection with certain specific embodiments, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
As shown in fig. 1, the invention provides an active pushing method of on-site operation and maintenance information of an electric power communication network, which aims to actively push information to a user by using idle frequency spectrum in off-peak time through analysis of the user, wherein a user terminal stores received information in a local cache, and when the user needs related information, the user terminal can directly search in the local cache, so that the throughput of the network is improved, and the time delay is reduced.
The invention mainly considers the average delay constraint, and when the user does not need to push the content, the transmission energy consumption is wasted. In order to reduce the energy wasted by pushing, the invention designs an optimal strategy for distributing transmission power for the fading channel with average delay constraint in the content pushing and on-demand delivery phases, and simultaneously deduces a threshold value of the probability of user request, and when the threshold value is lower than the threshold value, the system does not need to push information to the corresponding user.
The method specifically comprises the following steps:
as shown in fig. 2, the setting server generates a content file composed of B nats at t=0, pushes the content file to the user through a wireless link, and the user enabling the caching stores the pushed content file in the local buffer of the user;
the user requests the content file with a set probability α, the user requests the content file after a random delay from t=0, the random delay being determined by a probability density function f X The non-negative random variable X of (y), where y is the user request time. The period duration of the server transmitting the content file is set to be T.
Conventional communication systems only send content files to the requested user when the server is requested, whereas the system contemplated by the present invention is capable of pushing content files to the user prior to actual demand. Therefore, the time delay can be reduced to a certain extent, and even the real-time requirement can be possibly met. The entire content transmission consists of two phases: a push phase before the user request and a delivery phase after the user request.
As a preferred embodiment of the present invention, the push phase server uses power P 1 Transmitting the content file to the user, and setting t max Is the maximum push time of the content file composed of B nats;
if the request for a content file is at time t max (i.e. y>t max ) After that, the content file is pushed by the server before the user request arrives, the user accesses the required content file locally, and no content is transmitted in the delivery stage;
otherwise, the server performs the transfer of the transfer phase from the beginning of the next time period after the arrival of the user request.
For example, if the server receives a user request at the kth time slot, i.e., time interval [ kT, (k+1) T ], then the content file is sent to the user at time (k+1) T.
Setting random variables L and D, wherein L and D are integers and respectively represent the number of time periods consumed in a pushing stage and a conveying stage, and probability density functions of the random variables L and D are represented by pL (L) and pD (D), wherein L and D are respectively the realization of L and D;
if the user requests a request greater than the time point t max Early arrival, then a total of need in the push phaseDelivering content files for a period of time, the server using power P during the delivery phase 2 The transmission of the remainder of the content file is completed for the duration of D time periods.
The communication model can be set as follows:
in the case of a wireless communication environment, we consider a block fading channel, where the wireless channel remains constant at each time slot and varies independently between different time slots. Let h k Representing the channel gain for the kth time period. Furthermore, we consider rayleigh fading of the wireless channel, so |h k | 2 Is an exponentially distributed random variable and unit mean. For a user of the server, the received data rate for the kth time period is expressed as:
where W is the channel bandwidth, σ, of the server 2 Representing the power of the additive white gaussian noise.
The delay constraint model may be set as follows:
to comprehensively consider quality of service guarantees, the proposed system is evaluated taking into account an average delay constraint model. For the system under consideration, where the user only needs to wait if the desired content is not found in the local memory before pushing the content file according to the actual need. Therefore, before pushing the content file according to the actual demand, the user needs to wait only if the desired content is not found in the local storage, and taking the time consumed by the delivery phase as a delay measure, the average delay constraint E [ D ] that limits the average user waiting time of the delivery phase is expressed as:
wherein τ a Is the upper bound of the average delay.
For the proposed system, the goal is to use the power P by optimizing it 1 And P 2 To minimize average energy consumption, considering different delay constraints at the delivery phase of the content file, objective functions and constraints represent:
mim(E(P 1 ,P 2 ))
wherein min (E (P) 1 ，P 2 ) As an objective function to minimize average energy consumption, s.t. as a constraint.
In order to calculate the energy consumption of the channel, it is necessary to obtain a delay in the content delivery phase. In channels, the average delay constraint is considered for QoS guarantees, since it is not feasible to meet a fixed delay. In other words, if requested while pushing a content file, the rest of the content file must be delivered to the user within a given average delay, which is calculated specifically by:
for a given power of use P 1 And P 2 The average delay of the channel is:
wherein:E 1 (. Cndot.) is of the form->Is a function of the exponential integral of (a).
The transmission energy consumption comprises the energy consumption before the content request and the energy consumption after the user request, and the power P is used for a given use 1 And P 2 The average energy consumed in the channel is:
wherein, the liquid crystal display device comprises a liquid crystal display device,setting the use power P 1 ＝e q1 And P 2 ＝e q2 The average energy consumed in the channel is optimized as:
wherein delta>0 and small enough to ensure e q1 =0 or e q2 The continuity of the function at =0, the optimal power allocation of the channel is obtained by solving the average energy optimization result.
From the above formula, it can be found that: pushing the content file before the user request may reduce the energy efficiency of the system under consideration if it is requested with a low probability, in order to achieve a time-delay-limited average power-saving transmission over a fading channel, a threshold for active pushing is further given.
When content request probability:
the optimal strategy in the fading channel for the content file is reduced to an on-demand scheme, i.e. no active pushing of information, which is only pushed to the user when the server receives the user's content request.
Based on the foregoing, the proposed solution of the present invention proposes numerical results to verify the performance of the proposed system, compared to the baseline solution where the server transmits the content file only after the user requests (i.e., on-demand system). In the simulation, the content size is set to b=120 Mnat, the duration T of the slot t=10 ms, and the channel bandwidth w=1 MHz. Without loss of generality, the noise power sigma is set 2 =1. To contain the delay break probability constraint, we set the average delay bound τ a =120s. Furthermore, we assume that the content request delay X obeys a variable having a parameter λ (λ>0) I.e. Is an exponential distribution of (c). These simulation settings are adopted by default unless otherwise stated.
FIG. 2 shows the average energy consumption E and the content request delay parameter λ, where the average delay constraint τ a Is set to 120s. It can be seen that the simulation result matches theorem 3 and the corresponding theoretical result. When the content request probability α satisfies a condition (e.g., α=0.4) in the content request probability, the content file will not be pushed before the user request. In this case, the proposed system is reduced to the on-demand mode. For content files of higher popularity, the average energy consumption of the proposed system approaches that of the on-demand scheme as λ increases. This is because the larger the parameter lambda, the less time is available to push the content file.
When lambda tends to zero, the average energy consumption approaches
FIG. 3 shows the average energy consumption E versus content request probability α, where the average delay constraintIs set to 120s. As a increases, the average energy consumption of the proposed system increases first linearly and then experiences small fluctuations. This is because content files with low request probability are not pushed until needed, i.e. the proposed system operates in request-response mode. After the content request probability α exceeds a certain threshold, pushing the content file is more energy efficient than the baseline. This shows that the simulation curves can also provide a policy for the server to decide whether to push or not based on the popularity of the content file and the statistical nature of the content request delay. When α=0.9, at λ= -30dB (i.e. 10 -3 ) When the average energy consumption of the proposed system is below 42% of the baseline.
In fig. 4, we illustrate the effect of the average delay constraint on the transmission energy consumption E, where the content request delay parameter λ is set to λ=10 -3 . From simulation, more energy is saved when the system is adopted. As the increase increases, the gap between the proposed and reference plans decreases. The reason for this is that pushing content files may result in users never requiring wasted energy, while the average latency requirements become more relaxed to achieve energy efficient on-demand delivery. Pushing the content may save more energy due to the extended duration of the transfer when a more stringent average delay is imposed on the transfer of the content, especially when the content file has a high popularity.
The invention derives the user request probability threshold based on the average energy consumption of the pushing system and considering the average delay constraint of the network, when the user request probability is lower than the threshold, the system does not need to push information to the corresponding user so as to reduce unnecessary energy consumption;
and meanwhile, in order to improve the energy efficiency, the problem of minimizing the energy consumption is solved by adopting an optimal strategy when the content is pushed and the transmission power is distributed, and the strategy obviously improves the energy efficiency of the system along with the increase of the probability of the content request.
While the invention has been described in detail in the foregoing general description and specific examples, it will be apparent to those skilled in the art that modifications and improvements can be made thereto. Accordingly, such modifications or improvements may be made without departing from the spirit of the invention and are intended to be within the scope of the invention as claimed.

Claims (3)

1. An active pushing method of on-site operation and maintenance information of an electric power communication network is characterized by comprising the following steps:
the server is set to generate a content file composed of B nats when t=0, the content file is pushed to a user through a wireless link, and the user which enables caching stores the pushed content file in a local buffer area of the user; wherein B is the size of the content file;
the user requests the content file with a set probability α, the user requests the content file after a random delay from t=0, the random delay being determined by a probability density function f X A non-negative random variable X representation of (y), wherein y is a user request time;
the period duration of the server for transmitting the content file is set to be T;
the user requesting a content file includes two phases: a push phase before the user request and a delivery phase after the user request;
the push phase server uses power P 1 Transmitting the content file to the user, and setting t max Is the maximum push time of the content file composed of B nats;
if the request for a content file is at time t max After that, the content file is pushed by the server before the user request arrives, the user accesses the required content file locally, and no content is transmitted in the delivery stage;
otherwise, the server performs transmission of the transmission phase from the beginning of the next time period after the arrival of the user request;
setting random variables L and D, wherein L and D are integers and respectively represent the number of time periods consumed in a pushing stage and a conveying stage, and probability density functions of the random variables L and D are represented by pL (L) and pD (D), wherein L and D are respectively the realization of L and D;
if the user requests a request greater than the time point t max Early arrival, then a total of need in the push phaseDelivering content files for a period of time, the server using power P during the delivery phase 2 Completing the transmission of the remainder of the content file for a duration of D time periods;
before pushing the content file according to the actual demand, the user needs to wait only if the required content is not found in the local memory, and the time consumed by the delivery phase is taken as a delay measure, and the average delay constraint E D limiting the average user waiting time of the delivery phase is expressed as:
wherein τ a Is the upper bound of the average delay;
by optimizing the use of power P 1 And P 2 To minimize average energy consumption, considering different delay constraints at the delivery phase of the content file, objective functions and constraints represent:
min(E(P 1 ,P 2 ))
wherein min (E (P) 1 ，P 2 ) For minimizing the average energy consumption, s.t. as constraint, T as the period duration of the transmission of the content file by the server, E [ D ]]Representing an average delay constraint that limits the average user latency at the delivery phase.
2. An active pushing method for on-site operation and maintenance information of an electric power communication network according to claim 1, wherein when the content file is pushed, the rest of the content file must be transmitted to the user within a given average delay, and the specific calculation method of the average delay is:
for a given power of use P 1 And P 2 The average delay of the channel is:
wherein: b is the size of the content file and,E 1 (. Cndot.) is of the form->W is the channel bandwidth of the server, σ 2 Representing the power of additive white gaussian noise, f X (y) represents a probability density function.
3. The method for active pushing of on-site operation and maintenance information of an electric power communication network according to claim 2, wherein the transmission energy consumption includes the energy consumption before the request of the content and the energy consumption after the request of the user, for a given usage power P 1 And P 2 The average energy consumed in the channel is:
where alpha is the probability of content request,setting the power to be used +.>And->The average energy consumed in the channel is optimized as:
wherein delta>0 and small enough to ensureOr->And (3) obtaining the optimal power distribution of the channel by solving the average energy optimization result through the continuity of the time function.
CN202010449571.9A 2020-05-25 2020-05-25 Active pushing method for on-site operation and maintenance information of power communication network Active CN111541778B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010449571.9A CN111541778B (en) 2020-05-25 2020-05-25 Active pushing method for on-site operation and maintenance information of power communication network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010449571.9A CN111541778B (en) 2020-05-25 2020-05-25 Active pushing method for on-site operation and maintenance information of power communication network

Publications (2)

Publication Number Publication Date
CN111541778A CN111541778A (en) 2020-08-14
CN111541778B true CN111541778B (en) 2023-09-22

Family

ID=71977964

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010449571.9A Active CN111541778B (en) 2020-05-25 2020-05-25 Active pushing method for on-site operation and maintenance information of power communication network

Country Status (1)

Country Link
CN (1) CN111541778B (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105656997A (en) * 2015-12-25 2016-06-08 中国科学院信息工程研究所 Hotness cache content active pushing method based on mobile user relationship
WO2017097368A1 (en) * 2015-12-11 2017-06-15 Huawei Technologies Co., Ltd. System and method for efficient caching in the access network
CN108737507A (en) * 2018-04-27 2018-11-02 西安交通大学 A kind of wireless caching methods of D2D
CN110035415A (en) * 2019-04-03 2019-07-19 西安交通大学 A kind of D2D network-caching method for down loading of latency model
CN110290507A (en) * 2019-05-28 2019-09-27 南京邮电大学 A kind of cache policy and frequency spectrum distributing method of D2D communication assistant edge caching system

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2017097368A1 (en) * 2015-12-11 2017-06-15 Huawei Technologies Co., Ltd. System and method for efficient caching in the access network
CN105656997A (en) * 2015-12-25 2016-06-08 中国科学院信息工程研究所 Hotness cache content active pushing method based on mobile user relationship
CN108737507A (en) * 2018-04-27 2018-11-02 西安交通大学 A kind of wireless caching methods of D2D
CN110035415A (en) * 2019-04-03 2019-07-19 西安交通大学 A kind of D2D network-caching method for down loading of latency model
CN110290507A (en) * 2019-05-28 2019-09-27 南京邮电大学 A kind of cache policy and frequency spectrum distributing method of D2D communication assistant edge caching system

Also Published As

Publication number Publication date
CN111541778A (en) 2020-08-14

Similar Documents

Publication Publication Date Title
Sen et al. Optimal patching schemes for efficient multimedia streaming
US8811379B2 (en) Control apparatus and control method
CN100411458C (en) Quality of service differentiation in wireless networks
Poellabauer et al. Energy-aware traffic shaping for wireless real-time applications
CN101800731B (en) Network transmission management server, network transmission management method and network transmission system
Wang et al. On the design of relay caching in cellular networks for energy efficiency
WO2005112301A2 (en) Method for indicating buffer status in a wlan access point
Güngör et al. Proactive wireless caching at mobile user devices for energy efficiency
CN106888257A (en) The storage resource distribution method of mist node in radio communication
CN104363635A (en) Rapid energy consumption optimization stream medium application bandwidth resource allocation method
CN108322352B (en) Honeycomb heterogeneous caching method based on inter-group cooperation
JP2007060637A (en) Method of controlling communication with mobile station via wireless network
CN111328136B (en) Data transmission control method and device based on eMBMS and electronic equipment
CN110049507B (en) Halter strap theory-based optimal buffer resource allocation method in wireless content distribution network
CN101998599B (en) Service transmission method and controller in sleeping mode
CN111541778B (en) Active pushing method for on-site operation and maintenance information of power communication network
CN101645932B (en) P2P stream media heuristic data scheduling method
Toorchi et al. Fast and low-complexity reinforcement learning for delay-sensitive energy harvesting wireless visual sensing systems
Anastasi et al. A power-aware multimedia streaming protocol for mobile users
CN113949417B (en) Power grid data transmission method and device based on hybrid communication
CN109474664A (en) A kind of active pre-cache method and device in heterogeneous wireless network
CN110913468B (en) Energy saving transmission method based on pre-caching
CN111885641B (en) Buffer resource allocation method in buffer auxiliary relay network
CN102970153A (en) Multicast message processing method, device and system
Kim et al. Segment scheduling scheme for efficient bandwidth utilization of HTTP adaptive streaming in multipath environments

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