This paper presents a discrete-time single-server finite buffer N threshold policy queue with renewal input and discreteMarkovian service process. The server terminates service whenever the system becomes empty, and recommencesservice as soon as the number of waiting customers in the queue is N. We obtain the system-length distributionsat pre-arrival and arbitrary epochs using the supplementary...

We develop Bellman equation based approach for infinite time horizon optimal impulsive control problems. Both discounted and time average criteria are considered. We establish very general and at the same time natural conditions under which a canonical control triplet produces an optimal feedback policy. Then, we apply our general results for Internet congestion control providing a convenient s...

Sensor network has occupied an important space in current research. Small size of the sensor nodes put constraint on the hardware capabilities and battery supported on it. In this paper we have discussed threshold policy for selecting a particular state of sensor node with fixed threshold policy. Threshold policies are needed whenever to choose the better one between two or many possibilities. ...

Motivated by various applications from Internet congestion control to power control in smart grids and electric vehicle charging, we study Generalized Additive Increase Multiplicative Decrease (G-AIMD) dynamics under impulsive control in continuous time with the time average alpha-fairness criterion. We first show that the control under relaxed constraints can be described by a threshold. Then,...

Online Social Networks (OSNs) offer access control mechanisms to protect users’ sensitive information from undesired accesses. Yet, their information is still vulnerable to disclosure when their friends assign conflicting privacy policies: a user prohibits everyone from accessing his own content or profile but his friends allow others to see it. OSNs tend to select Permit-Take-Precedence when r...

A network of social sensors estimate an unknown state of nature by performing Bayesian Social Learning, and myopically optimize individual reward functions. The decisions of the social sensors contain quantized information about the underlying state. How should a fusion center dynamically incentivize the social sensors for acquiring the information about the underlying state? This paper present...

Temporal logic and model-checking are useful theoretical tools for specifying complex goals at the task level and formally verifying the performance of control policies. We are interested in tasks that involve constraints on real-valued energy resources. In particular, autonomous gliding aircraft gain energy in the form of altitude by exploiting wind currents and must maintain altitude within s...

In this paper we study the preemptive assignment of a single server to two queues. Customers arrive at both queues according to Poisson processes, and all service times are exponential, but with rates depending on the queues. The costs to be minimized consist of both holding costs and switching costs. The limiting behavior of the switching curve is studied, resulting in a good threshold policy....

In this work we study the problem of asymptotically optimal control of a well known multi-class queuing network, referred to as the “crisscross network”, in heavy traffic. We consider exponential inter-arrival and service times, linear holding cost and an infinite horizon discounted cost criterion. In a suitable parameter regime, this problem has been studied in detail by Martins, Shreve and So...

As a model of make-to-order production, we consider an admission control problem for a multiclass, single-server queue. The production system serves multiple demand streams, each having a rigid due-date lead time. To meet the due-date constraints, a system manager may reject orders when a backlog of work is judged to be excessive, thereby incurring lost revenues. The system manager strives to m...