Technical Report MSC-2011-04

TR#:MSC-2011-04
Class:MSC
Title: Dependent UFP On a Shared Channel With Application to a Network Centric Operation
Authors: Ilia Nudelman
Supervisors: Reuven Cohen
PDFMSC-2011-04.pdf
Abstract: In this thesis we generalize the well-known 0-1 Unsplittable Flow Problem (UFP) and show its applicability to the emerging Network Centric Operations (NCO) concept. While UFP's goal is to maximize the profitt gained by accommodating independent flows, our generalization considers dependent flows. In the generalized problem, referred to as the Dependent Unsplittable Flow Problem (D-UFP), the profit from delivering two flows is not necessarily equal to the sum of their profits. We show that in a single channel NCO, D-UFP can be approximated as the Quadratic Knapsack Problem (QKP).We present new algorithms for QKP, and examine their performance in typical NCO scenarios. Our simulation study shows that when the dependency between flows is taken into account, the performance of a typical NCO scenario can increase by 10-100%.
CopyrightThe above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information

Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/2011/MSC/MSC-2011-04), rather than to the URL of the PDF files directly. The latter URLs may change without notice.

To the list of the MSC technical reports of 2011
To the main CS technical reports page

Computer science department, Technion
admin