UNSPECIFIED (2002) Allocation of bandwidth and storage. IIE TRANSACTIONS, 34 (5). pp. 501-507. ISSN 0740-817X.

Research output not available from this repository.

Request-a-Copy directly from author or use local Library Get it For Me service.

Request Changes to record.

Abstract

We consider two allocation problems in this paper, namely, allocation of bandwidth and storage. In these problems, we face a number of independent requests, respectively, for reservation of bandwidth of a communication channel of fixed capacity and for storage of items into a space of fixed size. In both problems, a request is characterized by: (i) its required period of allocation; (ii) its required bandwidth (item width, respectively); and (iii) the profit of accepting the request. The problem is to decide which requests to accept so as to maximize the total profit. These problems in general are NP-hard. In this paper we provide polynomial-time algorithms for solving various special cases, and develop polynomial-time approximation algorithms for very general NP-hard cases with good performance guarantees.

Item Type:	Journal Article
Subjects:	T Technology H Social Sciences > HD Industries. Land use. Labor > HD28 Management. Industrial Management
Journal or Publication Title:	IIE TRANSACTIONS
Publisher:	TAYLOR & FRANCIS LTD
ISSN:	0740-817X
Official Date:	May 2002
Dates:	Date Event May 2002 UNSPECIFIED
Volume:	34
Number:	5
Number of Pages:	7
Page Range:	pp. 501-507
Publication Status:	Published

Data sourced from Thomson Reuters' Web of Knowledge

Request changes or add full text files to a record

Repository staff actions (login required)

View Item