Massive content delivery will become one of the most prominent tasks of future B5G/6G communication.However,various multimedia applications possess huge differences in terms of object oriented(i.e.,machine or user)and...Massive content delivery will become one of the most prominent tasks of future B5G/6G communication.However,various multimedia applications possess huge differences in terms of object oriented(i.e.,machine or user)and corresponding quality evaluation metric,which will significantly impact the design of encoding or decoding within content delivery strategy.To get over this dilemma,we firstly integrate the digital twin into the edge networks to accurately and timely capture Quality-of-Decision(QoD)or Quality-of-Experience(QoE)for the guidance of content delivery.Then,in terms of machinecentric communication,a QoD-driven compression mechanism is designed for video analytics via temporally lightweight frame classification and spatially uneven quality assignment,which can achieve a balance among decision-making,delivered content,and encoding latency.Finally,in terms of user-centric communication,by fully leveraging haptic physical properties and semantic correlations of heterogeneous streams,we develop a QoE-driven video enhancement scheme to supply high data fidelity.Numerical results demonstrate the remarkable performance improvement of massive content delivery.展开更多
The growing demand for low delay vehicular content has put tremendous strain on the backbone network.As a promising alternative,cooperative content caching among different cache nodes can reduce content access delay.H...The growing demand for low delay vehicular content has put tremendous strain on the backbone network.As a promising alternative,cooperative content caching among different cache nodes can reduce content access delay.However,heterogeneous cache nodes have different communication modes and limited caching capacities.In addition,the high mobility of vehicles renders the more complicated caching environment.Therefore,performing efficient cooperative caching becomes a key issue.In this paper,we propose a cross-tier cooperative caching architecture for all contents,which allows the distributed cache nodes to cooperate.Then,we devise the communication link and content caching model to facilitate timely content delivery.Aiming at minimizing transmission delay and cache cost,an optimization problem is formulated.Furthermore,we use a multi-agent deep reinforcement learning(MADRL)approach to model the decision-making process for caching among heterogeneous cache nodes,where each agent interacts with the environment collectively,receives observations yet a common reward,and learns its own optimal policy.Extensive simulations validate that the MADRL approach can enhance hit ratio while reducing transmission delay and cache cost.展开更多
The emergence of self-driving technologies implies that a future vehicle will likely become an entertainment center that demands personalized multimedia contents with very high quality. The surge of vehicular content ...The emergence of self-driving technologies implies that a future vehicle will likely become an entertainment center that demands personalized multimedia contents with very high quality. The surge of vehicular content demand brings significant challenges for the fifth generation(5G) cellular communication network. To cope with the challenge of massive content delivery, previous studies suggested that the 5G mobile edge network should be designed to integrate communication, computing, and cache(3C) resources to enable advanced functionalities such as proactive content delivery and in-network caching. However, the fundamental benefits achievable by computing and caching in mobile communications networks are not yet properly understood. This paper proposes a novel theoretical framework to characterize the tradeoff among computing, cache, and communication resources required by the mobile edge network to fulfill the task of content delivery. Analytical and numerical results are obtained to characterize the 3C resource tradeoff curve. These results reveal key insights into the fundamental benefits of computing and caching in vehicular mobile content delivery networks.展开更多
随着互联网技术的发展和普及,广播电视流媒体传输已经成为人们获取信息和娱乐的重要方式之一。然而由于网络环境的复杂性和不稳定性,如何保证流媒体传输的质量成一个重要的问题。内容分发网络(Content Distribution Network,CDN)作为一...随着互联网技术的发展和普及,广播电视流媒体传输已经成为人们获取信息和娱乐的重要方式之一。然而由于网络环境的复杂性和不稳定性,如何保证流媒体传输的质量成一个重要的问题。内容分发网络(Content Distribution Network,CDN)作为一种有效的解决方案被广泛应用于流媒体传输。为优化传输质量、提高用户体验,探讨基于CDN的广播电视流媒体传输质量优化方法。展开更多
Mobile broadcasting services provided by converged networks do aid in satisfying users' demands for popular multimedia content while unicasting services offer personalized experiences for users.We analyze hybrid b...Mobile broadcasting services provided by converged networks do aid in satisfying users' demands for popular multimedia content while unicasting services offer personalized experiences for users.We analyze hybrid broadcasting unicasting framework from the perspective of network economics,where content provider(CP) figures out the cooperation of broadcasting and unicasting services providers,as long as their pricing strategies.To this end,a contract-based content delivery scheme is proposed.The profit of CP depends on users' preference and satisfaction for unicasting and broadcasting transmission.CP provides different users with distinctive data packages.The intent is to maximize its own profit.By classifying users into different types,the optimal contract in close form is derived.Numerical results show that the proposed optimal contract is able to generate incentive for users to employ broadcasting transmission,which further benefits both the CP and users.展开更多
Recently the content centric networks(CCNs) have been advocated as a new solution to design future networks. In the CCNs, content and its interest are delivered over the content store and pending interest table, respe...Recently the content centric networks(CCNs) have been advocated as a new solution to design future networks. In the CCNs, content and its interest are delivered over the content store and pending interest table, respectively, where both have limited capacities. Therefore, how to design the corresponding algorithms to efficiently deliver content and inertest over them becomes an important issue. In this paper, based on the analysis of content distribution, status of content store, and pending interest, we propose a novel caching algorithm with which the resources of content store and pending interest table can be efficiently used. Simulation results prove that the proposal can outperform the conventional methods.展开更多
Calculating the most reliable maximum flow(MRMF)from the edge cache node to the requesting node can provide an important reference for selecting the best edge cache node in a content delivery network(CDN).However,SDBA...Calculating the most reliable maximum flow(MRMF)from the edge cache node to the requesting node can provide an important reference for selecting the best edge cache node in a content delivery network(CDN).However,SDBA,as the current state-of-the-art MRMF algorithm,is too complex to meet real-time computing needs.This paper proposes a set of MRMF algorithms:NWCD(Negative Weight Community Deletion),SCPDAT(Single-Cycle Preference Deletion Approximation algorithm with Time constraint)and SCPDAP(Single-Cycle Preference Deletion Approximation algorithm with Probability constraint).NWCD draws on the“flow-shifting”algorithm of minimum cost and maximum flow,and further defines the concept of negative weight community.This algorithm continuously deletes the negative weight communities,which can increase reliability while keeping the flow constant in the residual graph.It is proven that when all negative weight communities are deleted,the corresponding maximum flow is the MRMF.SCPDAT tries to approach the optimal solution to the greatest extent possible within the limited time,while SCPDAP tries to reach the probability threshold in the shortest amount of time.Both of these adopt the strategy of first deleting single-cycle communities(which contribute more to the reliability with lower time cost).Experiments show that,compared with SDBA,NWCD combined with the probabilistic pruning achieves an order of magnitude improvement in time cost,while SCPDAT and SCPDAP demonstrate better time performance and increased applicability.展开更多
基金partly supported by the National Natural Science Foundation of China (Grants No.62231017 and No.62071254)the Priority Academic Program Development of Jiangsu Higher Education Institutions。
文摘Massive content delivery will become one of the most prominent tasks of future B5G/6G communication.However,various multimedia applications possess huge differences in terms of object oriented(i.e.,machine or user)and corresponding quality evaluation metric,which will significantly impact the design of encoding or decoding within content delivery strategy.To get over this dilemma,we firstly integrate the digital twin into the edge networks to accurately and timely capture Quality-of-Decision(QoD)or Quality-of-Experience(QoE)for the guidance of content delivery.Then,in terms of machinecentric communication,a QoD-driven compression mechanism is designed for video analytics via temporally lightweight frame classification and spatially uneven quality assignment,which can achieve a balance among decision-making,delivered content,and encoding latency.Finally,in terms of user-centric communication,by fully leveraging haptic physical properties and semantic correlations of heterogeneous streams,we develop a QoE-driven video enhancement scheme to supply high data fidelity.Numerical results demonstrate the remarkable performance improvement of massive content delivery.
基金supported by the National Natural Science Foundation of China(62231020,62101401)the Youth Innovation Team of Shaanxi Universities。
文摘The growing demand for low delay vehicular content has put tremendous strain on the backbone network.As a promising alternative,cooperative content caching among different cache nodes can reduce content access delay.However,heterogeneous cache nodes have different communication modes and limited caching capacities.In addition,the high mobility of vehicles renders the more complicated caching environment.Therefore,performing efficient cooperative caching becomes a key issue.In this paper,we propose a cross-tier cooperative caching architecture for all contents,which allows the distributed cache nodes to cooperate.Then,we devise the communication link and content caching model to facilitate timely content delivery.Aiming at minimizing transmission delay and cache cost,an optimization problem is formulated.Furthermore,we use a multi-agent deep reinforcement learning(MADRL)approach to model the decision-making process for caching among heterogeneous cache nodes,where each agent interacts with the environment collectively,receives observations yet a common reward,and learns its own optimal policy.Extensive simulations validate that the MADRL approach can enhance hit ratio while reducing transmission delay and cache cost.
基金the support from the Natural Science Foundation of China (Grant No.61571378)
文摘The emergence of self-driving technologies implies that a future vehicle will likely become an entertainment center that demands personalized multimedia contents with very high quality. The surge of vehicular content demand brings significant challenges for the fifth generation(5G) cellular communication network. To cope with the challenge of massive content delivery, previous studies suggested that the 5G mobile edge network should be designed to integrate communication, computing, and cache(3C) resources to enable advanced functionalities such as proactive content delivery and in-network caching. However, the fundamental benefits achievable by computing and caching in mobile communications networks are not yet properly understood. This paper proposes a novel theoretical framework to characterize the tradeoff among computing, cache, and communication resources required by the mobile edge network to fulfill the task of content delivery. Analytical and numerical results are obtained to characterize the 3C resource tradeoff curve. These results reveal key insights into the fundamental benefits of computing and caching in vehicular mobile content delivery networks.
文摘随着互联网技术的发展和普及,广播电视流媒体传输已经成为人们获取信息和娱乐的重要方式之一。然而由于网络环境的复杂性和不稳定性,如何保证流媒体传输的质量成一个重要的问题。内容分发网络(Content Distribution Network,CDN)作为一种有效的解决方案被广泛应用于流媒体传输。为优化传输质量、提高用户体验,探讨基于CDN的广播电视流媒体传输质量优化方法。
基金partly supported by NSFC Grant (No.61672342,No.61671478,No.61572319,No.61532012,No.61325012,No.91438115)Science & Technology Innovation Program of Shanghai Grant (No.17511105103)+1 种基金National Key Scientif ic Research Project under Grant (No.2017YFB0803200)Natural Science Foundation of Shanghai under Grant (No.14ZR1427700)
文摘Mobile broadcasting services provided by converged networks do aid in satisfying users' demands for popular multimedia content while unicasting services offer personalized experiences for users.We analyze hybrid broadcasting unicasting framework from the perspective of network economics,where content provider(CP) figures out the cooperation of broadcasting and unicasting services providers,as long as their pricing strategies.To this end,a contract-based content delivery scheme is proposed.The profit of CP depends on users' preference and satisfaction for unicasting and broadcasting transmission.CP provides different users with distinctive data packages.The intent is to maximize its own profit.By classifying users into different types,the optimal contract in close form is derived.Numerical results show that the proposed optimal contract is able to generate incentive for users to employ broadcasting transmission,which further benefits both the CP and users.
基金supported in part by the fundamental key research project of Shanghai Municipal Science and Technology Commission under grant 12JC1404201the Ministry of Education Research Fund-China Mobile(2012) MCM20121032
文摘Recently the content centric networks(CCNs) have been advocated as a new solution to design future networks. In the CCNs, content and its interest are delivered over the content store and pending interest table, respectively, where both have limited capacities. Therefore, how to design the corresponding algorithms to efficiently deliver content and inertest over them becomes an important issue. In this paper, based on the analysis of content distribution, status of content store, and pending interest, we propose a novel caching algorithm with which the resources of content store and pending interest table can be efficiently used. Simulation results prove that the proposal can outperform the conventional methods.
基金partly supported by Open Research Fund from State Key Laboratory of Smart Grid Protection and Control,China(Zhang B,www.byqsc.net/com/nrjt/),Rapid Support Project(61406190120,Zhang B)the Fundamental Research Funds for the Central Universities(2242021k10011,Zhang B,www.seu.edu.cn)the National Key R&D Program of China(2018YFC0830200,Zhang B,www.most.gov.cn).
文摘Calculating the most reliable maximum flow(MRMF)from the edge cache node to the requesting node can provide an important reference for selecting the best edge cache node in a content delivery network(CDN).However,SDBA,as the current state-of-the-art MRMF algorithm,is too complex to meet real-time computing needs.This paper proposes a set of MRMF algorithms:NWCD(Negative Weight Community Deletion),SCPDAT(Single-Cycle Preference Deletion Approximation algorithm with Time constraint)and SCPDAP(Single-Cycle Preference Deletion Approximation algorithm with Probability constraint).NWCD draws on the“flow-shifting”algorithm of minimum cost and maximum flow,and further defines the concept of negative weight community.This algorithm continuously deletes the negative weight communities,which can increase reliability while keeping the flow constant in the residual graph.It is proven that when all negative weight communities are deleted,the corresponding maximum flow is the MRMF.SCPDAT tries to approach the optimal solution to the greatest extent possible within the limited time,while SCPDAP tries to reach the probability threshold in the shortest amount of time.Both of these adopt the strategy of first deleting single-cycle communities(which contribute more to the reliability with lower time cost).Experiments show that,compared with SDBA,NWCD combined with the probabilistic pruning achieves an order of magnitude improvement in time cost,while SCPDAT and SCPDAP demonstrate better time performance and increased applicability.