SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
A golden ratio control policy for a multiple-access channel
1 references·9 citing·48 second hop
A golden ratio control policy for a multiple-access channel (1984)A golden ratio control policy for a multi…Service in a Loop System (1972)Service in a Loop SystemOptimal admission, routing and service assignment control: the case of single buffer queues (2002)Optimal admission, routing an…Applications of Markov Decision Processes in Communication Networks (2002)Applications of Markov Decisi…SCHEDULING OF AN INPUT-QUEUED SWITCH TO ACHIEVE MAXIMAL THROUGHPUT (2000)SCHEDULING OF AN INPUT-QUEUED…Scheduling policies using marked/phantom slot algorithms (1995)Scheduling policies using mar…Optimization of static traffic allocation policies (1994)Optimization of static traffi…Efficient visit orders for polling systems (1993)Efficient visit orders for po…Optimal scheduling in some multiqueue single-server systems (1992)Optimal scheduling in some mu…Algorithms for generalized round robin routing (1992)Algorithms for generalized ro…The design of teletext broadcast cycles (1985)The design of teletext broadc…The Regulation of Queue Size by Levying Tolls (1969)Bandit Processes and Dynamic Allocation Indices (1979)Annals of operations research (1989)Dynamic admission control for loss systems with batch arrivals (2005)Optimal control of a production‐inventory system with both backorders and lost sales (2010)Optimal Workflow Decisions for Investigators in Systems with Interruptions (2013)Human behavior and the principle of least effort (1949)Human Behaviour and the Principle of Least Effort. (1950)Response Time Performance of Videotex Systems (1986)Comparison Methods for Queues and Other Stochastic Models. (1986)New results on the single server queue with a batch markovian arrival process (1991)Structured Stochastic Matrices of M/G/1 Type and Their Applications. (1991)Insensitive load balancing (2004)Outsourcing warranty repairs: Dynamic allocation (2005)Optimal routing in parallel, non-observable queues and the price of anarchy revisited (2010)Multi-Armed Bandits and the Gittins Index (1980)Introduction to Queueing Networks (1987)Stochastic Scheduling in in-Forest Networks (1994)The Israeli queue with retrials (2014)The Israeli Queue with a general group-joining policy (2015)The theory of queues with a single server (1952)On Queueing Processes with Bulk Service (1954)A Proof for the Queuing Formula: L = λ W (1961)Message Delays in FDMA and TDMA Communication Channels (1979)The Analysis of a Statistical Multiplexer with Nonindependent Arrivals and Errors (1980)Message delay analysis for TDMA schemes using contiguous-slot assignments (1992)A Stochastic Approximation Method (1951)Stochastic Estimation of the Maximum of a Regression Function (1952)Stochastic Approximation Methods for Constrained and Unconstrained Systems (1978)Centralized and decentralized asynchronous optimization of stochastic discrete-event systems (1998)Optimization over discrete sets via SPSA (1999)Gradient estimation for discrete-event systems by measure-valued differentiation (2010)Extremal Splittings of Point Processes (1985)Proc symp on congestion theory (1990)Periodic routing to parallel queues and billiard sequences (2004)The price of forgetting in parallel and non-observable queues (2011)On Round-Robin routing with FCFS and LCFS scheduling (2016)The stability of a queue with non-independent inter-arrival and service times (1962)Input Versus Output Queueing on a Space-Division Packet Switch (1987)Elements of Queueing Theory (2003)Balanced sequences and optimal routing (2000)Multimodularity, Convexity, and Optimization Properties (2000)Communication Nets: Stochastic Message Flow and Delay (1966)Analysis of polling systems (1985)Stochastic analysis of computer and communication systems (1990)Fluid polling systems (2009)Fairness and efficiency for polling models with the -gated service discipline (2012)On ergodicity conditions in a polling model with Markov modulated input and state-dependent routing (2014)
this work references cited by second hop

References

  • 1972Service in a Loop System82 cited

Cited by

  • 1985The design of teletext broadcast cycles150 cited
  • 2002Applications of Markov Decision Processes in Communication Networks70 cited
  • 1994Optimization of static traffic allocation policies49 cited
  • 1992Algorithms for generalized round robin routing30 cited
  • 1993Efficient visit orders for polling systems27 cited
  • 1995Scheduling policies using marked/phantom slot algorithms26 cited
  • 1992Optimal scheduling in some multiqueue single-server systems23 cited
  • 2002Optimal admission, routing and service assignment control: the case of single buffer queues20 cited
  • 2000SCHEDULING OF AN INPUT-QUEUED SWITCH TO ACHIEVE MAXIMAL THROUGHPUT12 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work