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.
Constellation networking is the prominent technology for the next generation satellite systems. The communication schedule is a key problem for constellation maintenance. However, the traditional SRS (Satellite Range Scheduling) model do not use inter-satellite links. In this paper, a communication scheduling model is proposed, in which the ISLs (Inter Satellite Links) is built. And the NP complicity...
Grid scheduling is one of optimally assigning jobs to resources to achieve maximizing the utilization of resources. We propose a distributed ant colony algorithm based on cross-entropy for multi-constraints scheduling. This is an extremely robust rare event simulation technique which may be employed to solve difficult combinatorial optimization problems. We tailor the CE-ANT method for the requirements...
In this paper we propose an adaptive scheduling algorithm for IEEE 802.16j based wireless broadband networks. Computation of an optimal schedule for prioritized traffic in OFDMA based IEEE 802.16 wireless network is an NP-Hard problem. Hence, we propose a scheduling heuristic for an OFDMA based WiMAX relay network. The ORS (OFDMA Relay Scheduler) heuristic computes the zone boundaries (relay and access)...
Grid scheduling is one of the most crucial issue in a grid environment because it strongly affects the performance of the whole system. Taking into account that the issue of allocating jobs on resources is a combinatorial optimization problem, a NP-complete problem, several heuristics have been proposed to provide good performance. In this paper, the proposed approach considers a stochastic optimization...
Scheduling task graphs under hard (end-to-end) timing constraints is an extensively studied NP-hard problem of critical importance for predictable software mapping on Multiprocessor System-on-chip (MPSoC) platforms. In this work we focus on an off-line (design-time) version of this problem, where the target task graph is known before execution time. We address the issue of scheduling robustness, i...
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.
We consider streaming pre-encoded and packetized media over best-effort networks in the presence of acknowledgment feedbacks. We first review a rate-distortion (RD) optimization framework that can be employed in such scenarios. As part of the framework, a scheduling algorithm selects the data to send over the network at any given time, so as to minimize the end-to-end distortion, given an estimate...
In this paper, the authors propose a scheme of multilevel parallel scheduling and traffic balancing, based on multiple constraints of packet switch network. By linear mapping tiny subsets of route space to network links, we obtain the single solution and quantization formulation of split scheduling algorithm according to non-cooperative route scheduling strategy at single node. Furthermore, we also...
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.