The optimal rate control problem in networks with unicast and multiratemulticast sessions is investigated. A penalty function approach is used to solve a convex programformulation of this problem, and then a heuristic...The optimal rate control problem in networks with unicast and multiratemulticast sessions is investigated. A penalty function approach is used to solve a convex programformulation of this problem, and then a heuristic rate control algorithm is derived. The algorithmis distributed, and suitable both for source-driven unicast sessions and receiver-driven multicastsessions. To obtain practical viability, the computational burden on core routers as well asend-hosts is kept very low, also is the overhead of network congestion feedback. Simulation resultsshow that the algorithm guarantees TCP (Transmission Control Protocol)-based unicast sessionscoexisting with multirate multicast sessions in a fair and friendly manner. It is also shown thatvarious fairness criteria of resource allocation could be achieved by choosing appropriate utilityfunctions, and resource-utilizing efficiencies would be likewise different.展开更多
We propose two rate control schemes for multi-antenna multicast in OFDM systems, which aim to maximize the minimum average rate over all users in a multicast group. In our system, we do not require all multicast users...We propose two rate control schemes for multi-antenna multicast in OFDM systems, which aim to maximize the minimum average rate over all users in a multicast group. In our system, we do not require all multicast users to successfully recover the signals received on each subcarrier. In contrast, we allow certain loss for multicast users, such that the multicast transmission rate can be increased. We assume that the loss-repairing can be completed at upper protocol layers via advanced fountain codes. Following this principle, we formulate the rate control problem via beamforming in multi-antenna multicast to optimize the minimum achievable rate for all multicast users. While the computation complexity to solve for the optimal beamformer is prohibitively high, we propose a suboptimal iterative rate control scheme. Moreover, we modify the above optimization problem by selecting a ?xed proportion of users on each subcarrier. The beamformer searching process will then be performed only based on the selected users on each subcarrier, such that the complexity can be further reduced. We also solve this new problem with a low complexity approach. Theoretical analyses and simulation results show that our proposed two rate control schemes can have higher minimum average rate than the baseline scheme without rate control, while achieving low complexity.展开更多
Fong et al.analyzed variable-rate linear network coding for linear broadcast.However,the authors didn't investigate it for the other three types of linear network codes.In this paper,by simple and clear proofs,it ...Fong et al.analyzed variable-rate linear network coding for linear broadcast.However,the authors didn't investigate it for the other three types of linear network codes.In this paper,by simple and clear proofs,it is found that there are similar results for variable-rate linear generic and linear dispersion if the field size is large enough.It means that linear generics and linear dispersions of different dimensions can be implemented on the same network,while each non-source node is required to store only one copy of the local encoding kernel within a session.Moreover,an example is given to show that there isn't a similar result for linear multicast.展开更多
为缓解基站的视频流量过载,本文针对时延敏感的实时视频业务,设计一种D2D协作视频多播传输方案。该方案采用可伸缩视频编码(Scalable Video Coding, SVC)对视频流进行编码处理,利用SVC流的分层结构特征来应对多播信道间的差异性。在SVC...为缓解基站的视频流量过载,本文针对时延敏感的实时视频业务,设计一种D2D协作视频多播传输方案。该方案采用可伸缩视频编码(Scalable Video Coding, SVC)对视频流进行编码处理,利用SVC流的分层结构特征来应对多播信道间的差异性。在SVC编码的基础上,为了改善用户观看体验及提升用户所接收的视频质量,所提出的协作式视频传输方案引入有效吞吐量这一概念,在一定时延约束下,根据信道反馈信息灵活地对不同信道上的不同SVC视频层进行码率调整。仿真结果表明,所提出的方案能够有效地减小端到端时延,有效丢失率,提高有效吞吐量。展开更多
使用分布式哈希表(distributed hash table,简称DHT)的应用系统必须在O(1)发现算法和O(logN)发现算法系列中选择适应的DHT协议.但是,不同网络波动程度的应用场景要求理想的DHT协议根据网络波动率能够自适应地调整.提出一种发现算法ROAD(...使用分布式哈希表(distributed hash table,简称DHT)的应用系统必须在O(1)发现算法和O(logN)发现算法系列中选择适应的DHT协议.但是,不同网络波动程度的应用场景要求理想的DHT协议根据网络波动率能够自适应地调整.提出一种发现算法ROAD(routing on active and demand),在延时和波动率之间自适应地调整以提供更好的性能.设计ROAD的关键挑战是构建路由表和降低延时的算法.通过构建加速路由表,加快发现服务的速度,降低消息转发的延时,并通过幂次序组播算法改善对超级点的依赖性.模拟实验显示,与现有DHT算法相比,ROAD维护了一种高效发现延时与波动率的折衷.选择不同质量类型的超级点,ROAD可以扩展成满足不同服务需要的发现机制.展开更多
文摘The optimal rate control problem in networks with unicast and multiratemulticast sessions is investigated. A penalty function approach is used to solve a convex programformulation of this problem, and then a heuristic rate control algorithm is derived. The algorithmis distributed, and suitable both for source-driven unicast sessions and receiver-driven multicastsessions. To obtain practical viability, the computational burden on core routers as well asend-hosts is kept very low, also is the overhead of network congestion feedback. Simulation resultsshow that the algorithm guarantees TCP (Transmission Control Protocol)-based unicast sessionscoexisting with multirate multicast sessions in a fair and friendly manner. It is also shown thatvarious fairness criteria of resource allocation could be achieved by choosing appropriate utilityfunctions, and resource-utilizing efficiencies would be likewise different.
文摘We propose two rate control schemes for multi-antenna multicast in OFDM systems, which aim to maximize the minimum average rate over all users in a multicast group. In our system, we do not require all multicast users to successfully recover the signals received on each subcarrier. In contrast, we allow certain loss for multicast users, such that the multicast transmission rate can be increased. We assume that the loss-repairing can be completed at upper protocol layers via advanced fountain codes. Following this principle, we formulate the rate control problem via beamforming in multi-antenna multicast to optimize the minimum achievable rate for all multicast users. While the computation complexity to solve for the optimal beamformer is prohibitively high, we propose a suboptimal iterative rate control scheme. Moreover, we modify the above optimization problem by selecting a ?xed proportion of users on each subcarrier. The beamformer searching process will then be performed only based on the selected users on each subcarrier, such that the complexity can be further reduced. We also solve this new problem with a low complexity approach. Theoretical analyses and simulation results show that our proposed two rate control schemes can have higher minimum average rate than the baseline scheme without rate control, while achieving low complexity.
基金Sponsored by the National Natural Science Foundation of China and the Research Grants Council of Hong Kong Joint Research Scheme(Grant No.60731160626)the National Natural Science Foundation of China(Grant No.60821001and61003287)+1 种基金the 111 Project(Grant No.B08004)the Fundamental Research Funds for the Central Universities(Grant No.BUPT2009RC0220)
文摘Fong et al.analyzed variable-rate linear network coding for linear broadcast.However,the authors didn't investigate it for the other three types of linear network codes.In this paper,by simple and clear proofs,it is found that there are similar results for variable-rate linear generic and linear dispersion if the field size is large enough.It means that linear generics and linear dispersions of different dimensions can be implemented on the same network,while each non-source node is required to store only one copy of the local encoding kernel within a session.Moreover,an example is given to show that there isn't a similar result for linear multicast.
文摘为缓解基站的视频流量过载,本文针对时延敏感的实时视频业务,设计一种D2D协作视频多播传输方案。该方案采用可伸缩视频编码(Scalable Video Coding, SVC)对视频流进行编码处理,利用SVC流的分层结构特征来应对多播信道间的差异性。在SVC编码的基础上,为了改善用户观看体验及提升用户所接收的视频质量,所提出的协作式视频传输方案引入有效吞吐量这一概念,在一定时延约束下,根据信道反馈信息灵活地对不同信道上的不同SVC视频层进行码率调整。仿真结果表明,所提出的方案能够有效地减小端到端时延,有效丢失率,提高有效吞吐量。
基金Supported by the National Natural Science Foundation of China under Grant Nos.60433040 60603070 (国家自然科学基金)the China Postdoctoral Science Foundation under Grant No.2005038064 (中国博士后基金)
文摘使用分布式哈希表(distributed hash table,简称DHT)的应用系统必须在O(1)发现算法和O(logN)发现算法系列中选择适应的DHT协议.但是,不同网络波动程度的应用场景要求理想的DHT协议根据网络波动率能够自适应地调整.提出一种发现算法ROAD(routing on active and demand),在延时和波动率之间自适应地调整以提供更好的性能.设计ROAD的关键挑战是构建路由表和降低延时的算法.通过构建加速路由表,加快发现服务的速度,降低消息转发的延时,并通过幂次序组播算法改善对超级点的依赖性.模拟实验显示,与现有DHT算法相比,ROAD维护了一种高效发现延时与波动率的折衷.选择不同质量类型的超级点,ROAD可以扩展成满足不同服务需要的发现机制.
