A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
An Online Buffer Management Algorithm for QoS-Sensitive Multimedia Networks
2007
ETRI Journal
Preserved Fulltext
Sungwook Kim et al. 685 ABSTRACT⎯ In this letter, we propose a new online buffer management algorithm to simultaneously provide diverse multimedia traffic services and enhance network performance. ...
This approach can provide high buffer utilization and thereby improve packet loss performance at the time of congestion. ...
Unlike the CBQ algorithm, our proposed algorithm is an online queuing algorithm for a shared buffer. ...
doi:10.4218/etrij.07.0207.0097
fatcat:yghkafv2pfcwrpksdwtlaxkrni
Bounded Delay Packet Scheduling in a Bounded Buffer
[article]
2009
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Recently, for the case of a single buffer, a 3-competitive deterministic algorithm and a 2.618-competitive randomized algorithm was known (Li, INFOCOM'09). ...
We study the problem of buffer management in QoS-enabled network switches in the bounded delay model where each packet is associated with a weight and a deadline. ...
Improved online algorithms for multiplexing weighted packets in bounded buffers. ...
arXiv:0907.2741v1
fatcat:x2u7o5kn7bcelaadcktqvqkn4i
Learning-based Incast Performance Inference in Software-Defined Data Centers
2021
2021 24th Conference on Innovation in Clouds, Internet and Networks and Workshops (ICIN)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
This capability of predicting incast performance in the SDN-enabled environment may be useful for the following management tasks: smart adaptive buffer management, online global network optimization (e.g ...
Motivations Adaptive buffer management and online network optimization are needed to achieve efficient performance for data center workloads, especially incast traffic [10] , [13] . ...
doi:10.1109/icin51074.2021.9385546
fatcat:fhjjbfbkmbhixoj2b3yxvpgzgq
Orchestrated application quality and energy storage management in solar-powered embedded systems
2015
Sixteenth International Symposium on Quality Electronic Design
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
In this work, we propose an adaptive quality-aware energy management middleware framework for energy harvesting embedded systems. ...
and accordingly adapts the application quality of service (QoS). ...
We then propose semi-online algorithm for QoS re-adjustment at the beginning of each slot and an online charge and discharge controller. ...
doi:10.1109/isqed.2015.7085430
dblp:conf/isqed/DangTDVB15
fatcat:cqakoxwhoberhpzu4aebwizaoi
Packet Scheduling in a Size-Bounded Buffer
[article]
2010
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Other Versions
We first provide an optimal offline algorithm for this model. Then we present an alternative proof of the 2-competitive deterministic online algorithm (Fung. arXiv July 2009). ...
We consider algorithms to schedule packets with values and deadlines in a size-bounded buffer. At any time, the buffer can store at most B packets. Packets arrive over time. ...
Introduction In this paper, we study a model called the bounded buffer model for Quality-of-Service (QoS) buffer management. Time is discrete. Packets arrive over time. ...
arXiv:0909.3637v2
fatcat:ey54yhqehjb6hcwbmhohvw46cy
Launchpad: Learning to Schedule Using Offline and Online RL Methods
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Offline reinforcement learning presents the prospect of policy optimization from pre-recorded datasets without online environment interaction. ...
Such a framework is effective for pre-training from historical datasets and well suited to continuous improvement with online data collection. ...
For this experiment, we trained the agent for 50k Offline steps (pre-loading QoS transitions to the replay buffer) and 1 million online steps. ...
arXiv:2212.00639v2
fatcat:idngeanclvgqlelyxgxykdh5ze
Algorithms for Scheduling Weighted Packets with Deadlines in a Bounded Queue
[article]
2009
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Other Versions
Motivated by the Quality-of-Service (QoS) buffer management problem, we consider online scheduling of packets with hard deadlines in a finite capacity queue. ...
We use competitive analysis to measure an online algorithm's performance versus an unrealizable optimal offline algorithm who constructs the worst possible input based on the knowledge of the online algorithm ...
optimal solution of an input I, and r is the set of random variables flipped by a randomized online algorithm ON r . ...
arXiv:0807.2694v4
fatcat:yh2q2twkv5dlnjvo3rsai227im
Enhanced low latency queuing algorithm with active queue management for multimedia applications in wireless networks
2017
International Journal of High Performance Computing and Networking
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In this paper, an enhanced low latency queuing (ELLQ) algorithm is proposed in which an additional SPQ is introduced along with the existing SPQ. ...
Further, the QoS is improved by integrating congestion avoidance algorithm with ELLQ. ...
Acknowledgements We thank Riverbed for the OPNET Modeler 14.5, freeware released for academic research purpose. ...
doi:10.1504/ijhpcn.2017.083197
fatcat:5p4ayg6hzbb63ka2ikj4w4pbxe
Multi-Agent Deep Reinforcement Learning for Trajectory Design and Power Allocation in Multi-UAV Networks
2020
IEEE Access
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The MADDPG approach for the JTDPA issue is summarized in Algorithm 1. At the beginning of the MADDPG algorithm, the replay buffer B, the weights of actor and critic in each UAV are initialized. ...
For more information, see https://creativecommons.org/licenses/by/4.Initialize the replay buffer B. • Initialize online critic network and online actor network with weights θ i Q and θ i µ , respectively ...
doi:10.1109/access.2020.3012756
fatcat:v27rgk7q4fg6xfgvk64357wfti
Evolutionary Deep Reinforcement Learning for Dynamic Slice Management in O-RAN
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Other Versions
O-RAN slicing is being investigated as a critical strategy for ensuring network quality of service (QoS) in the face of changing circumstances. ...
To this end, the O-RAN slicing is represented as a Markov decision process (MDP) which is then solved optimally for resource allocation to meet service demand using the EDRL approach. ...
Furthermore, considering an exponential random variable with an average size of 10 Kb as packet length for URLLC slice and selecting maximum delay as a QoS criterion ensures the lowest possible value for ...
arXiv:2208.14394v2
fatcat:stwo46rjyzff3lz2eccceaiowe
Online learning approaches in maximizing weighted throughput
2010
International Performance Computing and Communications Conference
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
SICOMP 2004 which extensive competitive online algorithms have been developed for. ...
We conclude that no online learning algorithms have a constant regret. Our online learning algorithms outperform the competitive algorithms for algorithmic simplicity and running complexity. ...
Thus, an optimal offline scheduling algorithm is unrealistic and cannot be applied in real buffer management. ...
doi:10.1109/pccc.2010.5682309
dblp:conf/ipccc/ZhangLC10
fatcat:f27kw5uokrbxrk2fjkni2xzwui
Optimizing quality of service in packet switch scheduling
2004
2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
We present here certain randomized algorithms with analytic QoS. These are simple to implement and possess closed form expressions for various performance measures. ...
This allows cost and utility optimization, a feature which was not feasible under previously studied packet scheduling algorithms. ...
MWM is an online algorithm requiring (sometimes extensive) calculations in each timeslot. Stability alone is insufficient for several practical designs. ...
doi:10.1109/icc.2004.1312868
dblp:conf/icc/RossB04
fatcat:xj3mjfnc4fdtfn36h6nfqacbia
Reinforcement Learning for Delay-Constrained Energy-Aware Small Cells with Multi-Sleeping Control
2020
2020 IEEE International Conference on Communications Workshops (ICC Workshops)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We propose a distributed Q-learning algorithm controller for small cells that adapts the cell activity while taking into account the co-channel interference between the cells. ...
This will cause a drastic increase in the network energy consumption followed by a complex interference management. ...
online, the probability of visiting an unvisited state is minimized. ...
doi:10.1109/iccworkshops49005.2020.9145431
dblp:conf/icc/El-AmineDN20
fatcat:razgfbb375abhau2olxdathqry
Comparison-Based Buffer Management in QoS Switches
2017
Algorithmica
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
For a long time, it has been an open problem, whether a comparison-based online algorithm exists, in either model, with a competitive ratio below 2. ...
In this model, a buffer management algorithm can reject arriving packets and preempt buffered packets. ...
Comparison-based buffer management. In QoS networks, packet values are only an implementation of the concept of differentiated service. ...
doi:10.1007/s00453-017-0393-2
fatcat:yeetq2vybrhcxei3r3chajj7di
Nephele streaming: stream processing under QoS constraints at scale
2013
Cluster Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Second, we propose a highly distributed scheme which allows these frameworks to detect violations of user-defined QoS constraints and optimize the job execution without manual interaction. ...
As a proof of concept, we implemented our approach for our massively-parallel data processing framework Nephele and evaluated its effectiveness through a comparison with Hadoop Online. ...
To avoid bursts of reports, the QoS Reporter chooses a random offset for the reports of each QoS Manager. Each report contains the following data: 1. ...
doi:10.1007/s10586-013-0281-8
fatcat:ug24ib66b5dzvkchncphbpvsam
« Previous
Showing results 1 — 15 out of 3,698 results