نتایج جستجو برای: delay scheduling
تعداد نتایج: 194318 فیلتر نتایج به سال:
We consider “opportunistic” downlink scheduling of data traffic in a wireless network. In particular, we focus on the delay performance of such schedulers. First a channeldependent scheduling algorithm is considered which maximizes throughput by always transmitting to the user with the best channel conditions. The delay distribution of this scheduling rule is analyzed and asymptotic results are...
Most large-scale peer-to-peer (P2P) live streaming systems use mesh to organize peers and leverage pull scheduling to transmit packets for providing robustness in dynamic environment. The pull scheduling brings large packet delay. Network coding makes the push scheduling feasible in mesh P2P live streaming and improves the efficiency. However, it may also introduce some extra delays and coding ...
in this thesis, using concepts of wavelets theory some methods of the solving optimal control problems (ocps). governed by time-delay systems is investigated. this thesis contains two parts. first, the method of obtaining of the ocps in time delay systems by linear legendre multiwavelets is presented. the main advantage of the meth...
This paper focuses on energy-efficient packet transmission with individual packet delay constraints over a fading channel. The problem of optimal offline scheduling (vis-à-vis total transmission energy), assuming information of all packet arrivals and channel states before scheduling, is formulated as a convex optimization problem with linear constraints. The optimality conditions are analyzed....
packet and cell switched networks. We demonstrate that MCRR exhibits optimal worst-case latency property in a certain class of weighted round robin (WRR) approaches which are currently used for packet (cell) scheduling in high-speed networks, such as ATM networks. We further present a Hierarchical MCRR (HMCRR) mechanism to maximize the efficacy of MCRR in practice and be scalable to large numbe...
Most distributed computing applications require an effective scheduling algorithm to distribute and assign client’s tasks running on a set of processors. The existing algorithms assumed that the scheduled tasks can be simultaneously and ideally sent and received from the processors without any latent delay. However, this assumption is obviously impractical and unrealizable due to lack of consid...
Providing service differentiation in wireless networks has attracted much attention in recent research. Existing studies so far have focused on the design of MAC layer protocols to achieve distributed priority scheduling. While these works have been shown to achieve certain differentiation (higher throughput or lower delay for higher priority packets) at MAC layer, they did not consider the pro...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید