A Reinforcement Learning Scheme for Adaptive Link Allocation in ATM Networks
نویسندگان
چکیده
This paper presents an adaptive scheme for a sub-function in Asynchronous Transfer Mode (ATM) network routing, called link allocation. The scheme adapts the link allocation policy to the offered Poisson call traffic such that the long-term revenue in maximized. It decomposes the link allocation task into a set of link admission control (LAC) tasks, formulated as semi-Markov Decision Problems (SMDPs). The LAC policies are directly adapted by reinforcement learning. Simulations show that the direct adaptive SMDP scheme outperforms static methods, which maximize the short-term revenue. It also yields a long-term revenue comparable to an indirect adaptive SMDP method.
منابع مشابه
Reinforcement Learning in Neural Networks: A Survey
In recent years, researches on reinforcement learning (RL) have focused on bridging the gap between adaptive optimal control and bio-inspired learning techniques. Neural network reinforcement learning (NNRL) is among the most popular algorithms in the RL framework. The advantage of using neural networks enables the RL to search for optimal policies more efficiently in several real-life applicat...
متن کاملReinforcement Learning in Neural Networks: A Survey
In recent years, researches on reinforcement learning (RL) have focused on bridging the gap between adaptive optimal control and bio-inspired learning techniques. Neural network reinforcement learning (NNRL) is among the most popular algorithms in the RL framework. The advantage of using neural networks enables the RL to search for optimal policies more efficiently in several real-life applicat...
متن کاملReceiver-Oriented Adaptive Buffer Allocation in Credit-Based Flow Control for ATM Networks
In credit-based flow control for ATM networks, buffer is jirst allocated to each VC (virtual circuit) and then credit control is applied to the VC for avoiding possible buffer overjow. Receiveroriented, adaptive buffer allocation allows a receiver to allocate its buffer dynamically, to VCs from multiple upstream nodes based on their bandwidth usage. This paper describes, in detail, such an adap...
متن کاملAsymptotic Close to Optimal Resource Allocation in Centralized Multi-band Wireless Networks
This paper concerns sub-channel allocation in multi-user wireless networks with a view to increasing the network throughput. It is assumed there are some sub-channels to be equally divided among active links, such that the total sum rate increases, where it is assumed each link is subject to a maximum transmit power constraint. This problem is found to be a non-convex optimization problem and i...
متن کاملM1, M2, ..., Mk/G1, G2,..., Gk/l/N Queue with Buffer Division and Push-Out Schemes for ATM Networks (RESEARCH NOTE)
In this paper, loss probabilities and steady state probabilities of data packets for an asynchronous transfer mode (ATM) network are investigated under the buffer division and push-out schemes. Data packets are classified in classes k which arrive in Poisson fashion to the service facility and are served with general service rate under buffer division scheme, finite buffer space N is divided in...
متن کامل