Multi-tree multicast with a backpressure algorithm
CDC(2010)
摘要
This paper addresses the problem of utility maximization of multicast sessions with multiple trees over static infrastructure networks. The utility functions are general concave functions. Inspired by the derivation of the unicast backpressure algorithms, we introduce a problem formulation with tree-flow conservation constraints and derive a multicast backpressure algorithm. The algorithm is much more distributed and local than previous algorithms. We provide a rigorous analysis of the performance including the primal optimality and the bound on real queue sizes using the Lyapunov optimization technique and the convex optimization techniques together.
更多查看译文
关键词
utility theory,real queue size,trees (mathematics),utility maximization,multitree multicast backpressure algorithm,lyapunov optimization technique,utility function,static infrastructure network,unicast backpressure algorithm,convex optimization techniques,tree-flow conservation constraint,concave programming,concave function,convex functions,optimization,convex optimization,algorithm design and analysis,unicast,resource management
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要