EconPapers    
Economics at your fingertips  
 

Decentralized Adaptive Flow Control of High-Speed Connectionless Data Networks

Felisa J. Vázquez-Abad and Lorne G. Mason
Additional contact information
Felisa J. Vázquez-Abad: Department of Computer Science and Operations Research, University of Montreal, Montreal, Quebec H3C 3J7, Canada
Lorne G. Mason: INRS-Telecommunications, University of Québec

Operations Research, 1999, vol. 47, issue 6, 928-942

Abstract: We introduce a permit-based adaptive control scheme for regulating traffic admission in high-speed connectionless data networks, such as the internet. Permits are awarded to potential customers arriving from outside and travel with them towards their destinations, where the permits are assigned to the local controllers. The controllers randomly distribute the permits among the entry gates at the nodes. Customers from outside are not allowed to enter the network unless there are permits available at the entrance node, thus the model is that of a closed queueing network if we model the dynamics of the permits. The goal is to find the permit distribution strategy that maximizes network performance subject to the restrictions of the network topology. A traffic balance approach is used to establish nonuniqueness of the optimal distribution probabilities for the decentralized operation. We exploit nonuniqueness introducing the concept of the automata actions , focusing on two strategies for the actions. For each strategy, a learning automaton is implemented at the controllers using the Kuhn–Tucker conditions for optimality. Our first learning algorithm converges weakly to a unique limit point, which is optimal, while the limit behaviour of our second learning algorithm may be suboptimal. We illustrate our results using computer simulations in order to compare the two strategies for the same network.

Keywords: automatic control; applications; stochastic control using learning automata methods; telecommunications; optimal flow control; routing; queues; optimization; optimal routing in networks toward global equilibria (search for similar items in EconPapers)
Date: 1999
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.47.6.928 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:47:y:1999:i:6:p:928-942

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().

 
Page updated 2025-03-19
Handle: RePEc:inm:oropre:v:47:y:1999:i:6:p:928-942