Abstract
Real-time routing and flow control in circuit-switched networks is investigated. An algorithm which updates routing tables and flow-control parameters according to changing load conditions is derived. The network is described by means of stochastic difference equations. A control structure imposed by hardware requirements and realistic network status information patterns is considered. It is shown that the global objectives can be achieved by means of shortest-route algorithms with state-dependent route lengths. Implementation issues which are related to traffic estimation and prediction are discussed. The performance of a particular algorithm implementation is investigated by simulation.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
