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.
The lacking of a thorough understanding on the capacity in mobile ad hoc networks (MANETs) has been stunting their applications in the last decade. Available capacity studies focus on exploring either the order sense capacity scaling laws, the closed-form capacity under some specific routing protocols, or the exact capacity without careful consideration of wireless interference issue in MANETs. In...
There are kinds of Internet applications such as VoIP, online gaming and video Conferencing which need quality of service guarantees making the performance analysis critical, and the traffic of such applications usually exhibits the properties of self-similarity and heavy tail. In this paper, we use the generalized Stochastically Bounded Burstiness model to characterize the network traffic with self-similar...
Long-term evolution (LTE) represents a promising technique for ubiquitous multimedia communication because of its significant enhancement to the data transmission rate. However, the hard hand-off (HO) procedure standardized in LTE is a menace to multimedia quality of service (QoS), due to the service interruption introduced by the procedure. Thus, one major challenge of such a system is to design...
In this paper, the scheduling problem of the network with limited bandwidth is considered. In order to improve the network quality of service and the quality of control simultaneously, an intelligent feedback scheduling method is proposed. The scheduler reschedules the priority, the sampling period, and the output threshold concurrently according to the control authority of each node, which is calculated...
In this paper, the fuzzy logic-based decision algorithm is proposed for queue scheduling. This algorithm is employed to determine the optimal values for achieving fairness control for each queue-type serviced. It takes into account the dynamic nature of the internet traffic as regards to its time-varying packet arrival process that affects the network states and performance. In order that the fairness...
Long Term Evolution-Advanced (LTE-A) is a new radio access technology that is expected to provide better experience among the mobile cellular users. It delivers multimedia services using packet switching technology. Therefore, intelligent design of packet scheduling for the LTE-A to provide Quality of Service (QoS) comparable to fixed line services becomes crucial. However, packet scheduling over...
A critical part of the IEEE 802.16e MAC layer specification is scheduling. The scheduling mechanism has a significant effect on the performance of WiMAX systems for use of bandwidth and radio resources. In this paper, we propose a self-adaptive fuzzy based scheduler, and call this approach SAFS which respectively, adjust priority and transmission Quantum to each connection by taking the packet head-of-line...
In this paper, we conduct performance analysis for a joint media access and appliance scheduling protocol devised for efficient information-management in smart appliances within a home-area network. This protocol enables appliances in-home to coordinate power usage so that total demand for the home is kept below a target value. In particular, from the system perspective, we model the evolution of...
In order to achieve higher data rates and more reliable QoS, coordinated multipoint transmission/ reception (CoMP) is raised in 3GPP release 10 and beyond. Cooperative transmission can effectively improve the performance of cell-edge users with the cost of exchange load between service eNodeB and cooperative eNodeB. Previous work of 3GPP release 11 has noticed the modeling of cooperative backhaul...
Decreasing the soaring energy cost is imperative in large data centers. Meanwhile, limited computational resources need to be fairly allocated among different organizations. Latency is another major concern for resource management. Nevertheless, energy cost, resource allocation fairness, and latency are important but often contradicting metrics on scheduling data center workloads. In this paper, we...
We propose a novel admission control policy for database queries. Our methodology uses system measurements of CPU utilization and query backlogs to determine interference between queries in execution on the same database server. Query interference may arise due to the concurrent access of hardware and software resources and can affect performance in positive and negative ways. Specifically our admission...
A large part of power dissipation in a system is generated by I/O devices. Increasingly these devices provide power saving mechanisms, inter alia to enhance battery life. While I/O device scheduling has been studied in the past for real-time systems, the use of energy resources by these scheduling algorithms may be improved. These approaches are crafted considering a very large overhead of device...
This work considers the scheduling problem for the packets with strict maximum tolerable delay (deadline) constraint. We discuss a multiuser scheduling scheme which schedules the users based on their instantaneous channel conditions, packet deadline and backlog of the buffered packets. The scheme is analyzed in large system limit for the single and multicell cases. The aim is to minimize the system...
Virtual Desktop Infrastructures (VDIs) are gaining popularity in cloud computing by allowing companies to deploy their office environments in a virtualized setting instead of relying on physical desktop machines. Consolidating many users into a VDI environment can significantly lower IT management expenses and enables new features such as “available-anywhere” desktops. However, barriers to broad adoption...
In Hadoop MapReduce, reduce tasks issue massive remote I/O operations to copy the intermediate results of map tasks. The operations cause massive remote data access delays which degrade the system performance. To Handle this problem, we propose an execution engine of reduce tasks. The engine partitions the execution of reduce tasks into two phases. In the first phase, the engine selects the nodes...
In this present work, we propose a scheduling approch for heterougeneous traffic over network. The proposed scheduling not only satiesfies the QoS requirements of the real time flows (class-1) but also continues providing best effort service to non real time flows (class-2). Many scheduling techniques have been proposed to respond to the temporal requirements of real-time jobs (flows). The technique...
This paper is focused on the research of instruction scheduling technology for clustered VLIW architecture. A novel scheduling technology is presented in this work, which exploits the tradeoff between the balancing of distribution of instructions amongst clusters and reduction of the amount of inter-cluster data communications, and guides the cluster assign and cycle schedule of instructions by estimating...
Distributed software transactional memory (D-STM) is an emerging, alternative concurrency control model for distributed systems that promises to alleviate the difficulties of lock-based distributed synchronization -- e.g., distributed deadlocks, live locks, and lock convoying. We consider Herlihy and Sun's dataflow D-STM model, where objects are migrated to invoking transactions, and the \emph{closed...
With the advent of deep sub micron era, design closure is becoming harder to achieve. In high-level synthesis, slack is a very effective means of tolerating uncertainties. Thus, several research efforts have been paid to study the slack-driven high-level synthesis problem. However, previous works cannot actually maximize the total slack value, because they are limited to either the operation scheduling...
Proportional fair (PF) scheduling provides efficient allocation of resource while it results in relatively high head-of-line delay for some users in heavily loaded network. In contrast, first-in-first-out (FIFO) scheduling guarantees minimum delay for all users whereas the resource is inefficiently allocated. In this paper, a new hybrid scheduling algorithm with reduced feedback, named Hybrid PF/FIFO...
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.