Journal ArticleDOI
Markov decision algorithms for dynamic routing (telephone networks)
Reads0
Chats0
TLDR
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.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
Citations
More filters
Journal ArticleDOI
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.
Proceedings ArticleDOI
LLR routing in homogeneous VP-based ATM networks
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.
Journal ArticleDOI
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.
Journal ArticleDOI
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.
A Management System for Load Balancing through Adaptive Routing in Multi-Service ATM Networks
P. Georgatsos,David Griffin +1 more
TL;DR: In this article, a hierarchical approach to the routing issue in ATM-based broadband multi-service networks is proposed, where distributed route selection algorithms embedded within network nodes may be managed by a TMN system, by virtue of a management service called load balancing, to increase their adaptivity to network wide conditions.
References
More filters
Journal ArticleDOI
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.
Proceedings ArticleDOI
State-dependent routing for telephone traffic: Theory and results
K. Krishnan,T. Ott +1 more
TL;DR: An analytical model is constructed for state-dependent routing schemes which select a route for a call on the basis of the network 'state' at the time of call-arrival in the framework of Markov decision processes, and derives a simple state- dependent routing scheme called 'separable' routing.