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.
In a cloud data center, it is common for a storage system to be shared by front-end, user-interacting applications and back-end, data-intensive applications running on different virtual machines (VMs). Although it is necessary to meet the latency requirements of I/O streams generated by the VMs that execute the front-end applications, this can be difficult because: (1) often their latency requirements...
Long Term Evolution (LTE) is a breakthrough in broadband technology which aims to support several high level quality and real time multimedia services for the mobile users. This paper proposes a resource block preserver (RBP) scheduling algorithm which optimizes the performance of the downlink transmission system in LTE network. The resource block preserver algorithm has two layers, upper and lower...
The current works about task scheduling with deadline-constraint in homogeneous environment rarely take the differences of Map and Reduce task and data locality into account in the same scheduler. To address this problem, we introduce a scheduling algorithm that Map and Reduce are regarded as two separated stages of scheduling problem in homogeneous environment. For the sake of realizing this algorithm,...
Integration of efficient scheduling policies in radio resource management (RRM) strategies is nowadays, of a paramount importance for the success deployment of wireless Long Term Evolution (LTE) systems. This is particularly effective for downlink where data rates are important and where scheduling decision should enable to allocate, in each Transmission Time Interval (TTI), appropriate resource blocks...
The Internet architecture provides a mechanism for protecting individual flows from congestion, by introducing queue management and scheduling algorithms in Input-Queued switches having finite queue size to improve the QoS performance in terms of throughput and delay. Queue management algorithms manage the length of packet queues by dropping packets when necessary or appropriate, while Scheduling...
Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known as Greedy Maximal Scheduling, or GMS) are guaranteed to achieve only a fraction of the maximum possible throughput (e.g., 50% throughput in switches). However, it was recently shown that in networks in which the Local Pooling...
Heterogeneous computing platforms such as Grid and Cloud computing are becoming prevalent and available online. As a result, resource management in these platforms is fundamentally critical to their global performance. Under the assumption of jobs comprised of subtasks forming DAG jobs, we focus on how to increase utilization and achieve near-optimal throughput performance on heterogeneous platforms...
To maximize the utilization of system resources with satisfying diverse quality of service (QoS) requirements, a novel multiple utility factors-based parallel (MUFP) packet scheduling algorithm is proposed for the broadcast base station (BBS) and cell base station (CBS) mixed mode of broadband wireless multimedia (BWM) systems. MUFP takes into consideration QoS requirements, queue dynamics and channel...
The end-to-end congestion control in intelligent optical networks(IONs) based on IP layer is studied. The queue scheduling algorithms are used to intelligent optical networks and two queue scheduling algorithms are analyzed and compared. The network's throughput are gotten for different queue scheduling algorithms by simulating different scenes. The scene is about a TCP flow and a no feedback UDP...
In the TD-HSDPA system, the PF(Proportional Fair) algorithm was invented to solve the fairness and throughput problems in the RR(Round Robin) and MAX C/I algorithms. Although it can obtain a compromise between RR and MAX C/I, a new type of “starving” phenomenon still happens when a new user enters the system. To solve this issue, we propose a modified algorithm of classic PF to shorten the period...
The method of network coding has been proven a promising solution to fanin conflict problems (traffic flows conflicting at input ports) in multicast switches in previous work. However, this approach is inefficient when applied to frame-based switches because of over-splitting with conventional algorithms. These algorithms do not support the benefits of network coding to be fully realized when ignoring...
Multihop networks are used in a variety of ways, that include ad-hoc networks, wireless sensor networks, and mesh networks. These networks consist of nodes that connect over a wireless channel, and communicate over multiple links by forwarding each other's messages. The throughput is determined by the contention among the nodes for the wireless resources. Thus routing algorithms, influence the level...
Due to the massive use of parallel and distributed operations of inputs and outputs, iterative scheduling algorithms are attractive in finding a maximal size matching for an input-queued switch. For constructing a large high-speed switch, a distributed multi-chip implementation of an iterative scheduling algorithm should be followed. Since different chips may locate on different switch linecards and...
Multicast is emerging as an important means of transmitting the same content to multiple receivers so as to efficiently utilize the overall network resource. We propose an opportunistic multicast scheduling algorithm that exploits time-varying channel conditions in time division multiplexing (TDM) cellular networks and maximizes the overall network throughput under certain resource fairness constraints...
In this paper, we propose a distributed throughput-optimal ad hoc wireless network scheduling algorithm, which is motivated by the celebrated simplex algorithm for solving linear programming (LP) problems. The scheduler stores a sparse set of basic schedules, and chooses the max-weight basic schedule for transmission in each time slot. At the same time, the scheduler tries to update the set of basic...
In this paper, we propose a multi-level round-robin multicast scheduling (MLRRMS) algorithm with look-ahead (LA) mechanism for N×N input-queued switches. Fan-out splitting is applied, where a multicast cell can be transferred to all its destinations over any number of cell times. The scheduler constructs the Traffic Matrix before each cell transmission based on the fan-out vectors of the cells in...
Interest in Broadband Wireless Access (BWA) has been growing due to its high speed data rate, wide area coverage and support for Quality of Service (QoS) requirement for different applications. There is a need for better scheduler to handle diversified QoS while increasing system efficiency. In this paper, we propose an Improvised-Modified Deficit Round Robin (I-MDRR) that not only meets the QoS requirements...
Qos provision is considered as the complex task due to the heterogeneous nature, diverse QoS requirements of emergent different applications. With the advent of high bandwidth 3G/4G technologies, like LTE, LTE-advanced, the necessity of QoS provision becomes even crucial. Uplink scheduling with QoS provision is considered here. The contribution of this work is uplink packet scheduling scheme maintaining...
IEEE 802.16 based Worldwide Interoperability for Microwave Access networks (WiMAX) are increasingly being deployed for last hop broadband wireless access. In order to provide the high speed access to information resources broadband technology like WiMAX is needed. In this paper we compared different uplink scheduling algorithms of WiMAX mainly maximum carrier to interference and noise (Max C/I) algorithm...
With the growing need of high rate data services, 3GPP standard has investigated ways to support multimedia services with multi-carrier transmissions. Supporting high data rate guaranteeing the quality of service (QoS) and fairness of users is an important issue and should be addressed in an advanced wireless system. This paper investigates packet scheduling considering QoS of real-time traffic and...
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.