2,464 Hits in 4.9 sec

Near optimal control of queueing networks over a finite time horizon

Yoni Nazarathy, Gideon Weiss
2008 Annals of Operations Research  
We propose a novel approach for controlling queueing networks that minimizes weighted holding costs over a finite time horizon.  ...  The solution consists of piecewise constant allocations of the activities, with a finite number of breakpoints over the time horizon.  ...  In many situations one is interested in control of the network over a finite time horizon that attempts to minimize costs and maximize utility.  ... 
doi:10.1007/s10479-008-0443-x fatcat:hx3dysxxevekbd5pqinacy27ge

A rolling-horizon quadratic-programming approach to the signal control problem in large-scale congested urban road networks

K. Aboudolas, M. Papageorgiou, A. Kouvelas, E. Kosmatopoulos
2010 Transportation Research Part C: Emerging Technologies  
For the application of the proposed methodology in real time, the corresponding optimization algorithm is embedded in a rolling-horizon (modelpredictive) control scheme.  ...  well as with optimized fixed-control settings via their simulation-based application to the road network of the city centre of Chania, Greece, under a number of different demand scenarios.  ...  Acknowledgement This paper is part of the 03ED898 research project, implemented within the framework  ... 
doi:10.1016/j.trc.2009.06.003 fatcat:nv6j775qx5hx5ho3zyoe75coq4

Resource Management and Scheduling in WSNs Powered by Ambient Energy Harvesting [chapter]

Neyre Tekbiyik, Elif Uysal-Biyikoglu
2013 Industrial Electronics  
throughput over a finite time horizon, in a sensor network with energy replenishment.  ...  over a long period of time.  ... 
doi:10.1201/b14072-6 fatcat:gz3fmmhebjdgjanml7ixvesez4

Blind Dynamic Resource Allocation in Closed Networks via Mirror Backpressure [article]

Yash Kanoria, Pengyu Qian
2022 arXiv   pre-print
We study the problem of maximizing payoff generated over a period of time in a general class of closed queueing networks with a finite, fixed number of supply units which circulate in the system.  ...  number of customers over the time horizon, and η is the demand process' average rate of change per customer arrival.  ...  control policy is near-optimal in a certain asymptotic regime.  ... 
arXiv:1903.02764v4 fatcat:n2ihry57wbah3naktwo7aspbty

A Reinforcement Learning Based Algorithm for Finite Horizon Markov Decision Processes

Shalabh Bhatnagar, Mohammed Shahid Abdulla
2006 Proceedings of the 45th IEEE Conference on Decision and Control  
We develop a simulation based algorithm for finite horizon Markov decision processes with finite state and finite action space.  ...  Illustrative numerical experiments with the proposed algorithm are shown for problems in flow control of communication networks and capacity switching in semiconductor fabrication.  ...  SR/S3/EE/43/2002-SERC-Engg from the Department of Science and Technology, Government of India.  ... 
doi:10.1109/cdc.2006.377190 dblp:conf/cdc/BhatnagarA06 fatcat:zkyk5jbkfngt5fsts2a3jdr74q

Optimal Policies for Status Update Generation in a Wireless System with Heterogeneous Traffic [article]

George Stamatakis, Nikolaos Pappas, Apostolos Traganitis
2018 arXiv   pre-print
for a variety of network configurations.  ...  We consider the problem of optimally controlling the status update generation process for a system with a source-destination pair that communicates via a wireless link, whereby the source node is comprised  ...  In this work we consider the problem of minimizing the expected value of the additive cost function over an infinite time horizon.  ... 
arXiv:1810.03201v1 fatcat:wuf4tfsllnaaxpzfnjg7hvbzae

Universal Scheduling for Networks with Arbitrary Traffic, Channels, and Mobility [article]

Michael J. Neely
2010 arXiv   pre-print
Our analysis uses a sample path version of Lyapunov drift and provides a methodology for optimizing time averages in general time-varying optimization problems.  ...  We develop a simple non-anticipating algorithm that provides network throughput-utility that is arbitrarily close to (or better than) that of the T-slot lookahead policy, with a tradeoff in the worst case  ...  The above problem is stated in terms of a finite horizon of size t end .  ... 
arXiv:1001.0960v1 fatcat:5rjy5gaqxfb6xmhetznlkbtqkm

Integration of Model-Based Signal Control and Queue Spillover Control for Urban Oversaturated Signalized Intersection

Haitao Xu, Jing Chen, Jie Xu
2019 Mathematical Problems in Engineering  
The experiment is performed on a simulated road network.  ...  First of all, according to the real-time traffic flow data, the green time splits for all intersections will be solved online by the model-based signal control controller whose optimization model is based  ...  Acknowledgments This work was financially supported by Chinese National Science Foundation (61572165) and Projects of Zhejiang Province (LGF18F030006).  ... 
doi:10.1155/2019/3149275 fatcat:tqwkta45bfgbniykgx4k2hqsbe

A simple heuristic for load balancing in parallel processing networks with highly variable service time distributions

Luz A. Caudillo-Fuentes, David L. Kaufman, Mark E. Lewis
2009 Queueing systems  
At any point in time, a decision-maker may decide to move, at a cost, some number of jobs in one queue to the other. The goals of this paper are twofold.  ...  To this end, we consider a two-station proxy for the original system, where the service times are assumed to be exponential, but of one of two classes with different rates.  ...  control a system of two M/M/1 queues.  ... 
doi:10.1007/s11134-009-9155-4 fatcat:5cguya5lzrcepbmenzyitpclru

Page 5015 of Mathematical Reviews Vol. , Issue 95h [page]

1995 Mathematical Reviews  
queueing network: optimal policies and heuristics.  ...  The control policy for this latter system is appropriately converted into a near optimal solution for the original problem.  ... 

Discrete-review policies for scheduling stochastic networks: trajectory tracking and fluid-scale asymptotic optimality

Constantinos Maglaras
2000 The Annals of Applied Probability  
The proposed policy reviews system status at discrete points in time, and at each such point the controller formulates a processing plan for the next review period, based on the queue length vector observed  ...  This paper describes a general approach for dynamic control of stochastic networks based on fluid model analysis, where in broad terms, the stochastic network is approximated by its fluid analog, an associated  ...  In particular, the general articulation of the fluid-scale asymptotic optimality criterion follows one of their earlier suggestions, and the simplified version of DR policies that does not involve the  ... 
doi:10.1214/aoap/1019487513 fatcat:vlr63wzfm5dchlmbgabfn3mjl4

Learning to Entangle Radio Resources in Vehicular Communications: An Oblivious Game-Theoretic Perspective [article]

Xianfu Chen and Celimuge Wu and Mehdi Bennis and Zhifeng Zhao and Zhu Han
2018 arXiv   pre-print
By defining a partitioned control policy, we transform the stochastic game into an equivalent game with a global queue state space of finite size.  ...  Due to the lack of a priori knowledge of network dynamics, we derive an online algorithm to learn the OE policies.  ...  WIVE is a part of 5G Test Network Finland (5GTNF).  ... 
arXiv:1809.00317v1 fatcat:zgh6dtq32ndthnxwuhc2mseszi

Linear-Quadratic Model Predictive Control for Urban Traffic Networks

Tung Le, Hai L. Vu, Yoni Nazarathy, Bao Vo, Serge Hoogendoorn
2013 Procedia - Social and Behavioral Sciences  
The end result is a central control scheme that may be realized for large urban networks containing thousands of sensors and actuators.  ...  We show that using a central scheme such as ours may reduce the congestion inside the network by up to half while still achieving better throughput compared to that of other conventional control schemes  ...  In each time instance, the optimal control problem is solved online based on the measured (estimated) current state (at time n = n 0 ) and the predictive demands over a N step finite horizon (at time n  ... 
doi:10.1016/j.sbspro.2013.05.028 fatcat:sqcmxxv53nc4xhvykr7um5ys2q

Parallel Rollout for Online Solution of Partially Observable Markov Decision Processes

Hyeong Soo Chang, Robert Givan, Edwin K. P. Chong
2004 Discrete event dynamic systems  
In particular, the parallel rollout approach aims at the class of problems where we have multiple heuristic policies available such that each policy performs near-optimal for a different set of system  ...  Our approach generalizes the rollout algorithm of Bertsekas and Castanon (1999) by rolling out a set of multiple heuristic policies rather than a single policy.  ...  near-optimal for a different set of system paths.  ... 
doi:10.1023/b:disc.0000028199.78776.c4 fatcat:h3ksxagqtbbp7asuvjsil5kjra

Multipath Transmission Scheduling in Millimeter Wave Cloud Radio Access Networks [article]

Xianfu Chen and Pei Liu and Hang Liu and Celimuge Wu and Yusheng Ji
2018 arXiv   pre-print
to the time-varying network statistics, such that a MU experiences the minimum queueing delay and packet drops.  ...  Due to the problem size, a low-complexity online learning scheme is put forward, which requires no a priori statistic information of network dynamics.  ...  The next subsection thereby focuses on developing a practically efficient scheme with low-complexity to achieve a near optimal control policy. B.  ... 
arXiv:1807.09332v1 fatcat:2s4gpbrjfjftveohtjzz3qqwom
« Previous Showing results 1 — 15 out of 2,464 results