Resource Allocation in Bounded Degree Trees

13 years 8 months ago

Download www.eng.tau.ac.il

We study the bandwidth allocation problem (bap) in bounded degree trees. In this problem we are given a tree and a set of connection requests. Each request consists of a path in the tree, a bandwidth requirement, and a weight. Our goal is to find a maximum weight subset S of requests such that, for every edge e, the total bandwidth of requests in S

Reuven Bar-Yehuda, Michael Beder, Yuval Cohen, Dro

Real-time Traffic

Algorithms | Bandwidth Allocation Problem | Connection Requests | ESA 2006 | Maximum Weight Subset |

claim paper

» Resource allocation strategies for constructive innetwork stream processing

» The Recognition of Tolerance and Bounded Tolerance Graphs

» Optimal Resource Discovery Paths of Gnutella2

» Slack allocation techniques for intrapath load balancing

» Ring versus Tree Embedding for Realtime Group Multicast

» On the Efficiency of Markets with TwoSided Proportional Allocation Mechanisms

» Optimal Partition of QoS Requirements for ManytoMany Connections

» Analysis of Software Engineering Data Using Computational Intelligence Techniques

Post Info
More Details (n/a)

Added	22 Aug 2010
Updated	22 Aug 2010
Type	Conference
Year	2006
Where	ESA
Authors	Reuven Bar-Yehuda, Michael Beder, Yuval Cohen, Dror Rawitz

Comments (0)

Sciweavers

Resource Allocation in Bounded Degree Trees

Algorithms | Bandwidth Allocation Problem | Connection Requests | ESA 2006 | Maximum Weight Subset |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers