The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Some communication applications, like multimedia, deliver data of different importance classes allowing unequal error protection (UEP) levels. In this paper, a multiple-input multiple-output (MIMO) system using orthogonal frequency division multiplexing (OFDM) is considered with a new UEP bit-loading algorithm based on the non-UEP algorithm by Chow, Cioffi, and Bingham. In the proposed bit-loading...
Three applications in wireless networks where model-free stochastic learning is applicable, are discussed. The learning based optimization problems are formulated and simulation results are presented. Some open issues are also discussed.
As Grid networks grows, the complexity of resource management in Grid networks dramatically increases. To manage the Grid resources efficiently, policy based resource management system is suitable. However, the policy which made at a moment could not be appropriate to other time because the condition of the grid resources with time space changes. Thus, in this paper, we propose asynchronous policy-based...
The next generation of wireless networks (4G) will use OFDMA (Orthogonal Frequency Division Multiple Access) in the reverse link. In OFDMA, the reverse link resources assigned to a user are called tiles each of which consists of a subset of consecutive subcarriers. Since at most one user is assigned to each of these tiles then reverse link transmissions within a sector are orthogonal. However, the...
Unequal error protection is the key to future transport of multimedia data. The paper presents an overview of some new approaches realizing UEP properties in physical transport, especially multicarrier modulation, or with LDPC and turbo codes. For multicarrier modulation, a UEP bit-loading method is described allowing for an arbitrary number of classes, arbitrary SNR margins between the classes and...
Processor Allocation schemes play a significant role in obtaining high performance in parallel computing paradigms. Finding available processors for incoming task with the constriction of minimizing overhead is the chief objective of task allocation. Various processor allocation schemes have been proposed with series of performance measures and complexities of space and time. Optimality of allocation...
We introduce a new primitive, the Resource Controller, which abstracts the problem of controlling the total amount of resources consumed by a distributed algorithm. We present an efficient distributed algorithm to implement this abstraction. The message complexity of our algorithm per participating node is polylogarithmic in the size of the network, compared to the linear cost per node of the naive...
In this paper we introduce a model of Hierarchical Memory with Block Transfer (BT for short). It is like a random access machine, except that access to location x takes time f(x), and a block of consecutive locations can be copied from memory to memory, taking one unit of time per element after the initial access time. We first study the model with f(x) = xα for 0 ≪ α ≪ 1. A tight bound of θ(n log...
For all d ≥ 1 and all e ≫ d, every deterministic multihead e-dimensional Turing machine of time complexity T(n) can be simulated on-line by a deterministic multihead d-dimensional Turing machine in time O(T(n)1+1/d-1/e(log T(n))O(1)). This simulation almost achieves the known lower bound Ω(T(n)1+1/d-1/e) on the time required. Furthermore, there is a deterministic d-dimensional machine with just two...
A combinatorial problem related to storage allocation is analyzed. The problem falls into a class of NP-complete, one-dimensional bin-packing problems. We propose an iterative approximation algorithm and show that it is superior to an earlier heuristic presented for this problem. The bulk of the paper is devoted to the proof of a worst-case performance bound.
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.