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.
Malleable tasks are jobs that can be scheduled with preemptions on a varying number of resources. We focus on the special case of work-preserving malleable tasks, for which the area of the allocated resources does not depend on the allocation and is equal to the sequential processing time. Moreover, we assume that the number of resources allocated to each task at each time instant is limited. We consider...
In current high bandwidth-delay-product networks, traditional end-to-end network protocols cannot guarantee the fair allocation of network resources (i.e., a rogue source that sends at an uncontrolled rate can seize a large fraction of the buffers at an intermediate router which results in dropped packets for other connections). Fair-queuing (FQ) algorithms were proposed to overcome this drawback...
In OFDMA systems, reducing the inter-cell interference among adjacent cells is a very important issue especially for the cell-edge users. In this paper, we propose a distributed algorithm that maximizing the system total throughput considering proportional fairness. In our proposed algorithm, the frequency resources in each cell is divided into high and low power regions. The bandwidth allocations...
In this paper, we propose a radio resource scheduling algorithm for a scheduler in IEEE 802.16 orthogonal frequency division multiple access (OFDMA) specification. The scheduler dynamically allocates slots considering wireless channel conditions of subscriber stations to improve radio resource utilization efficiency. The results show that with the proposed algorithm, smaller radio resources are used...
This paper proposes a novel dynamic bandwidth allocation method based on a new switch technology named Ethernet-oriented physical frame timeslot switching (EPFTS). Based on the features of EPFTS, the bandwidth allocation is changed to quota allocation for manageable quality of service (QoS). The proposed method is composed of a quota allocation strategy and a dynamic quota scheduling policy called...
In this paper, we investigate scheduling for information management and dissemination in a multi-mission network. Dynamic network resource scheduling plays a crucial role in tracking critical engagement in battlefield and thus is highly demanded in multi-mission systems. Our focus is on how to resolve bandwidth contention in a heavily loaded network where mission requests surpass available bandwidth...
We investigate the problem of finding minimum-distortion policies for streaming delay-sensitive but distortion-tolerant data. We consider cross-layer approaches which exploit the coupling between presentation and transport layers. We make the natural assumption that the distortion function is convex and decreasing. We focus on a single source-destination pair and analytically find the optimum transmission...
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...
In this paper, a novel resource allocation algorithm (CPFAH) for future wideband mobile communication systems is proposed. The basic idea is to schedule mobile stations according to their respective retransmission times. Thus the retransmission delay can be reduced and user fairness can be maintained. The algorithm takes the advantage of conventional performance-enhancing methods, e.g. frequency hopping,...
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.