Analysis and Adaptive Control of a Discrete-Time Single-Server Network with Random Routing

Abstract

This paper considers a discrete-time system composed of K infinite capacity queues that compete for the use of a single server. Customers arrive in i.i,d batches and are served according to a server allocation policy. Upon completing service, customers either leave the system or are routed instantaneously to another queue according to some random mechanism. As an alternative to simply randomized strategies, a policy based on a stochastic approximation algorithm is proposed to drive a long-run average cost to a given value. The underlying motivation can be traced back to implementation issues associated with constrained optimal strategies.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1989
Accession Number
ADA452634

Entities

People

  • Adam Shwartz
  • Armand M. Makowski

Organizations

  • University of Maryland

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Availability
  • Classification
  • Contracts
  • Information Operations
  • Instructions
  • Maryland
  • Monitoring
  • Motivation
  • Organizational Structure
  • Security
  • Standards
  • Universities

Fields of Study

  • Computer science

Readers

  • Computer Networking
  • Mathematical Modeling and Probability Theory.
  • Theoretical Analysis.