Journal Article10.1109/35.60368
Markov decision algorithms for dynamic routing (telephone networks)
28
TL;DR: The nature of the traffic-routing problem is described, and early studies of state-dependent routing are noted; how the relative costs can be determined for the case of direct routing is shown.
read more
Abstract: The nature of the traffic-routing problem is described, and early studies of state-dependent routing are noted. A state-dependent scheme seeks to route each call so as to minimize the risk of blocking future calls, and thus responds to the current state of the network on the basis of certain assumptions about future traffic demands. State-dependent routing is considered as a Markov decision process. How the relative costs can be determined for the case of direct routing is shown. >
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Adaptive call admission control under quality of service constraints: a reinforcement learning solution
Hui Tong,Timothy X. Brown +1 more
TL;DR: This work solves the adaptive call admission control (CAC) problem in multimedia networks via reinforcement learning (RL) and is able to earn significantly higher revenues than alternative heuristics.
97
Intelligent Joint Network Slicing and Routing via GCN-Powered Multi-Task Deep Reinforcement Learning
Tianjian Dong,Zirui Zhuang,Qi Qi,Jing Wang,Haifeng Sun,F. Richard Yu,Cheng Zhou,Jianxin Liao +7 more
TL;DR: A joint network slicing and routing mechanism, which combines the network management and control framework to provide a fine-grained, real-time and dynamic resource allocation, and is robust to diverse network environments.
52
LLR routing in homogeneous VP-based ATM networks
Ren-Hung Hwang
- 02 Apr 1995
TL;DR: This paper studies the routing problem in homogeneous VP-based ATM networks in which VP's are used for traffic segregation such that all VC's in a VP have the same traffic characteristics and QOS requirement.
32
M/M/1-PS queue and size-aware task assignment
TL;DR: Numerically, it is shown that for the exponentially distributed job sizes the myopic approach, ignoring the future arrivals, yields an efficient and robust policy when compared to other heuristics, however, in the case of highly asymmetric service rates, an FPI based policy outperforms it.
32
A localized adaptive proportioning approach to QoS routing
Srihari Nelakuditi,Zhi-Li Zhang +1 more
TL;DR: It is demonstrated that proportional routing schemes can achieve higher throughput with lower overhead than best path routing schemes and it is shown that it is possible to compute near-optimal proportions using only locally collected information.
References
Design and optimization of networks with dynamic routing
TL;DR: An efficient heuristic optimization method is introduced for solution of the LP routing problems, which greatly improves computational speed with minimal loss of accuracy and project computational requirements for a 200-node design problem, which is the estimated size of the intercity Bell System dynamic routing network in the 1990s.
270