Global warming and pressing concern about CO2emission along with increasing fuel and oil cost have brought about great challenges for energy companies and homeowners. In this regard, a potential candidate solution is ...
详细信息
We evaluate modern delay-based AQM algorithms in downstream DOCSIS 3.0 cable environments. Our focus is on fairness and application performance capabilities of two recently proposed delay-based AQM algorithms, CoDel a...
详细信息
While optimizing database performance, parallel query technology can significantly improve the throughput and resource utilization of the database server. Interactions among different queries which run concurrently ca...
详细信息
Recently, scheduling algorithm which is related to computing tasks and communication transactions is widely studied. In multi-core systems, adopting certain scheduling algorithm to execute schedule can decrease schedu...
详细信息
We use both theoretical analysis and simulations to study crosspoint-queued(CQ) buffer size's impact on CQ switch's throughput and delay performance under different traffic models, input loads, and scheduling ...
详细信息
Random access schemes are simple and inherently distributed, yet capable of matching the optimal throughput performance of centralized scheduling algorithms. The throughput optimality however has been established for ...
详细信息
Random access schemes are simple and inherently distributed, yet capable of matching the optimal throughput performance of centralized scheduling algorithms. The throughput optimality however has been established for activation rules that are relatively sluggish, and may yield excessive queues and delays. More aggressive/persistent access schemes have the potential to improve the delay performance, but it is not clear if they can offer any universal throughput optimality guarantees. In this paper, we identify a limit on the aggressiveness of nodes, beyond which instability is bound to occur in a broad class of networks.
Efficient spectrum use in wireless sensor networks through spatial reuse requires effective models of packet reception at the physical layer in the presence of interference. Despite recent progress in analytic and sim...
详细信息
ISBN:
(纸本)9781450330305
Efficient spectrum use in wireless sensor networks through spatial reuse requires effective models of packet reception at the physical layer in the presence of interference. Despite recent progress in analytic and simulations research into worst-case behavior from interference effects, these efforts generally assume geometric path loss and isotropic transmission, assumptions which have not been borne out in experiments. Copyright 2014 *** paper aims to provide a methodology for grounding theoretical results into wireless interference in experimental reality. We develop a new framework for wireless algorithms in which distancebased path loss is replaced by an arbitrary gain matrix, typically obtained by measurements of received signal strength (RSS). We experimentally evaluate the framework in two indoors testbeds with 20 and 60 motes, and confirm superior predictive performance in packet reception rate for a gain matrix model over a geometric distance-based *** the heart of our approach is a new parameter Ζ called metricity which indicates how close the gain matrix is to a distance metric, effectively measuring the complexity of the environment. A powerful theoretical feature of this parameter is that all known SINR scheduling algorithms that work in general metric spaces carry over to arbitrary gain matrices and achieve equivalent performance guarantees in terms of Ζ as previously obtained in terms of the path loss constant. Our experiments confirm the sensitivity of Ζ to the nature of the environment. Finally, we show analytically and empirically how multiple channels can be leveraged to improve metricity and thereby performance. We believe our contributions will facilitate experimental validation for recent advances in algorithms for physical wireless interference models.
Many altered versions of the Round Robin CPU scheduling algorithm have been created to fix the shortcomings of the Standard Round Robin algorithm. When these improved Round Robin algorithms are first created, they are...
详细信息
ISBN:
(纸本)9789881925275
Many altered versions of the Round Robin CPU scheduling algorithm have been created to fix the shortcomings of the Standard Round Robin algorithm. When these improved Round Robin algorithms are first created, they are always compared to the Standard Round Robin algorithm to ensure that they provide an improvement over it. Occasionally, they are compared to one other improved Round Robin algorithm for comparison as well, however little work has been done to compare several of these algorithms simultaneously to observe which ones make the greatest improvements over the Standard Round Robin algorithni. This research seeks to answer this query by comparing five improved Round Robin algorithms.
A fundamental issue of underwater acoustic (UWA) communications is large propagation delays due to water medium. A new direction to address this issue is to take advantage of large propagation delays rather than endur...
详细信息
Cloud computing is a paradigm shift in service delivery that promises a leap in efficiency and flexibility in using computing resources. As cloud infrastructures are widely deployed around the globe, many data- and co...
详细信息
暂无评论