Separable routing: A scheme for state-dependent routing of circuit switched telephone traffic

DOI10.1007/BF02023090MaRDI QIDQ1197750zbMATH OpenOpenAlexFDO

Authors Teunis J. Ott, K. Krishnan

Publication date 16 January 1993

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02023090

zbMATH Keywords

circuit switched telephone trafficseparable routingsimulation

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Transportation, logistics and supply chain management (90B06) Communication networks in operations research (90B18) Markov and semi-Markov decision processes (90C40)

Recommendations

• scientific article; zbMATH DE number 3918060
• Sequencial Routing Optimization for Circuit Switched Networks
• scientific article; zbMATH DE number 3883906
• Routing in circuit-switched networks: optimization, shadow prices and decentralization
• Loss circuit switched communication network -- performance analysis and dynamic routing

Cites work

• scientific article; zbMATH DE number 3148886 (Why is no real title available?)
• scientific article; zbMATH DE number 3764811 (Why is no real title available?)
• scientific article; zbMATH DE number 3338194 (Why is no real title available?)
• scientific article; zbMATH DE number 3361677 (Why is no real title available?)
• scientific article; zbMATH DE number 3361678 (Why is no real title available?)
• Optimal Control and Trunk Reservation in Loss Networks
• Optimal Routing in Connecting Networks Over Finite Time Intervals
• Programming and Control Problems Arising from Optimal Routing in Telephone Networks*

Cited in

(16)

• Approximate receding horizon approach for Markov decision processes: average reward case
• On the scheduling of operations in a chat contact center
• Exponential penalty function control of loss networks
• An effective numerical method for controlled routing in large trunk line networks
• A numerical method for reflected diffusions: Control of the reflection directions and applications
• Dynamic repositioning strategy in a bike-sharing system; how to prioritize and how to rebalance a bike station
• Dispatching to parallel servers. Solutions of Poisson's equation for first-policy improvement
• Dispatching fire trucks under stochastic driving times
• Waiting time based routing policies to parallel queues with percentiles objectives
• On the optimal control of a two-queue polling model
• On the value function of the M/Cox(r)/1 queue
• On the control of a queueing system with aging state information
• An approximate dynamic programing approach to the development of heuristics for the scheduling of impatient jobs in a clearing system
• DYNAMIC ROUTING POLICIES FOR MULTISKILL CALL CENTERS
• On the structure of value functions for threshold policies in queueing models
• Workload minimization in re-entrant lines

This page was built for publication: Separable routing: A scheme for state-dependent routing of circuit switched telephone traffic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1197750)