Allocation of bandwidth and storage
نویسندگان
چکیده
منابع مشابه
Allocation of bandwidth and storage
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 re...
متن کاملApproximation Algorithms for Bandwidth and Storage Allocation
We discuss two NP-hard allocation problems, the Bandwidth Allocation Problem (BAP) and the Storage Allocation Problem (SAP). In BAP we are given a set of requests, each of which is associated with a time interval, a bandwidth demand, and a profit. A feasible solution is a subset of requests such that at any given time the total bandwidth given to allocated requests does not exceed the available...
متن کاملJointly power and bandwidth allocation for a heterogeneous satellite network
Due to lack of resources such as transmission power and bandwidth in satellite systems, resource allocation problem is a very important challenge. Nowadays, new heterogeneous network includes one or more satellites besides terrestrial infrastructure, so that it is considered that each satellite has multi-beam to increase capacity. This type of structure is suitable for a new generation of commu...
متن کاملStudy of the Queueing Model of Storage and Transmission Bandwidth Allocation
In this paper, we study a queueing model of storage and transmission bandwidth allocation in computer and communication systems, so we are interested to the behavior of a network understanding a queue which contains a number infinite of items of size 1, 2, 3 and a bin of capacity C = N (N is finite). An analysis of the stability properties of the bandwidth allocation algorithm First Fit for the...
متن کاملOnline Bandwidth Allocation
The paper investigates a version of the resource allocation problem arising in the wireless networking, namely in the OVSF code reallocation process. In this setting a complete binary tree of a given height n is considered, together with a sequence of requests which have to be served in an online manner. The requests are of two types: an insertion request requires to allocate a complete subtree...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IIE Transactions
سال: 2002
ISSN: 0740-817X,1545-8830
DOI: 10.1080/07408170208928886