Online Multi-Commodity Flow with High Demands

Computer Science – Data Structures and Algorithms

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

This paper deals with the problem of computing, in an online fashion, a maximum benefit multi-commodity flow (\ONMCF), where the flow demands may be bigger than the edge capacities of the network. We present an online, deterministic, centralized, all-or-nothing, bi-criteria algorithm. The competitive ratio of the algorithm is constant, and the algorithm augments the capacities by at most a logarithmic factor. The algorithm can handle two types of flow requests: (i) low demand requests that must be routed along a path, and (ii) high demand requests that may be routed using a multi-path flow. Two extensions are discussed: requests with known durations and machine scheduling.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Online Multi-Commodity Flow with High Demands does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Online Multi-Commodity Flow with High Demands, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Online Multi-Commodity Flow with High Demands will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-107347

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.