Search results for "Scheduling"
showing 10 items of 275 documents
Improved route planning and scheduling of waste collection and transport
2006
The collection of waste is a highly visible and important municipal service that involves large expenditures. Waste collection problems are, however, one of the most difficult operational problems to solve. This paper describes the optimization of vehicle routes and schedules for collecting municipal solid waste in Eastern Finland. The solutions are generated by a recently developed guided variable neighborhood thresholding metaheuristic that is adapted to solve real-life waste collection problems. Several implementation approaches to speed up the method and cut down the memory usage are discussed. A case study on the waste collection in two regions of Eastern Finland demonstrates that sign…
Network Slicing Enabled Resource Management for Service-Oriented Ultra-Reliable and Low-Latency Vehicular Networks
2020
Network slicing has been considered as a promising candidate to provide customized services for vehicular applications that have extremely high requirements of latency and reliability. However, the high mobility of vehicles poses significant challenges to resource management in such a stochastic vehicular environment with time-varying service demands. In this paper, we develop an online network slicing scheduling strategy for joint resource block (RB) allocation and power control in vehicular networks. The long-term time-averaged total system capacity is maximized while guaranteeing strict ultra-reliable and low-latency requirements of vehicle communication links, subject to stability const…
Trade-Off between Increased Talk-Time and LTE Performance
2010
The purpose of this paper is to analyze the trade-off conditions between battery saving opportunities and long term evolution network performance. To achieve this goal voice over IP with discontinuous reception is studied. Analysis is conducted with vast amount of different settings, including on duration, inactivity and discontinuous reception cycle timers. The quality of service and battery saving opportunities with discontinuous reception are evaluated with a dynamic system simulator which enables detailed simulation of multiple users and cells with realistic assumptions. This paper indicates high battery saving, i.e., increased talk-time opportunities without compromising the performanc…
VoIP end-to-end performance in HSPA with packet age aided HSDPA scheduling
2008
In this paper, we present an enhanced VoIP scheduling for the high speed downlink packet access (HSDPA) in UMTS, which takes the age of the VoIP packet into account. The downlink capacity can be significantly improved by this way, especially for shorter uplink transmission delay. In order to quantify the achievable performance improvement, we present results obtained from extensive system-level uplink and downlink simulations. Inter alia, it is shown that using the proposed scheme can lead to an increase in the downlink cell capacity of up to 16%. By applying the proposed method, the downlink performance can be improved considerably while the uplink performance remains the same, which ensur…
Analysis of VoIP over HSDPA Performance with Discontinuous Reception Cycles
2009
The aim of this paper is to evaluate how Discontinuous Reception (DRX) cycles and related timers take effect to Voice over IP (VoIP) performance when High Speed Downlink Packet Access (HSDPA) networks are in question. DRX cycles limit the scheduling freedom of users and increase battery saving opportunities in the User Equipment (UE) by allowing it to turn its receiver circuitry off for some periods of time. Prior work has concentrated mainly on optimizing the usage of radio resources when small bit rate delay critical services, like VoIP, are considered. However, the battery life of small handheld devices might become a limiting factor in providing satisfactory user experience. Thus, this …
On solving single elevator-like problems using a learning automata-based paradigm
2020
This paper concentrates on a host of problems with characteristics similar to those that are related to moving elevators within a building. These are referred to as Elevator-like problems (ELPs), and their common phenomena will be expanded on in the body of the paper. We shall resolve ELPs using a subfield of AI, namely the field of learning automata (LA). Rather than working with the well-established mathematical formulations of the field, our intention is to use these tools to tackle ELPs, and in particular, those that deal with single “elevators” moving between “floors”. ELPs have not been tackled before using AI. In a simplified domain, the ELP involves the problem of optimizing the sch…
Simulation-Based Performance Study of e-Commerce Web Server System – Results for FIFO Scheduling
2013
The chapter concerns the issue of overloaded Web server performance evaluation using a simulation-based approach. We focus on a Business-to-Consumer (B2C) environment and consider server performance both from the perspective of computer system efficiency and e-business profitability. Results of simulation experiments for the Web server system under First-In-First-Out (FIFO) scheduling are discussed. Much attention has been paid to the analysis of the impact of a limited server system capacity on business-related performance metrics.
Web Server Support for e-Customer Loyalty through QoS Differentiation
2013
The paper deals with the problem of offering predictive service in e-commerce Web server systems under overload. Due to unpredictability of Web accesses, such systems often fail to effectively handle peak traffic, which results in long delays and incomplete transactions. As a consequence, online retailers miss an opportunity to attract new customers, retain the loyalty of regular customers, and increase profits. We propose a method for priority-based admission control and scheduling of requests at the Web server system in order to differentiate Quality of Service (QoS) with regard to user-perceived delays, i.e., Web page response times provided by the system (as opposed to HTTP request resp…
Link scheduling in sensor networks for asymmetric average consensus
2012
Wireless Sensor Networks constitute a recent technology where the nodes cooperate to obtain, in a totally distributed way, certain function of the sensed data. One example is the average consensus algorithm, which allows every node to converge to the global average. However, this algorithm presents two major drawbacks in practice. The first one is that instantaneous symmetric links are required, which are hard to ensure in practice because of the presence of wireless interferences. The second one is that all the nodes are required to communicate with all of their local neighbors in every iteration, which can lead to an unbounded delay. In order to solve these issues, we propose a novel link…
Ensuring the QoS requirements in 802.16 scheduling
2006
IEEE 802.16 standard defines the wireless broadband access network technology called WiMAX. WiMAX introduces several interesting advantages, and one of them is the support for QoS at the MAC level. For these purposes, the base station must allocate slots based on some algorithm. We propose a simple, yet efficient, solution for the WiMAX base station that is capable of allocating slots based on the QoS requirements, bandwidth request sizes, and the WiMAX network parameters. To test the proposed solution, we have implemented the WiMAX MAC layer in the NS-2 simulator. Several simulation scenarios are presented that demonstrate how the scheduling solution allocates resources in various cases. S…