Year-end Sale % OFF 
Abstract
In this paper, we consider a dynamic routing problem in a store-and-forward computer-communication network which consists of l parallel channels connected between the source and the destination. We prove that if messages arrive at the network in accordance with a Poisson process and all nodes have an exponential service rate, then the routing strategy that minimizes the total expected time in transmitting all messages that arrive before T>0 is to route the arriving message to the channel along which the sum of all queue sizes is minimum. Techniques of martingale and dynamic programming are used in obtaining the result.
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.
