Technical Report Number
Load balancing algorithms for Jacksonian networks are derived. The state of the network is represented by the total number of packets for which the source has not yet received an acknowledgement, The networks studied are subject to the state independent routing and, state dependent and state independent flow control. The objective is to maximize the throughput of the network so that the end-to-end expected packet time delay does not exceed an upper bound. The optimal flow control is shown to be a window type, while the routing policy balances the traffic inside the network. Several load balancing algorithms are evaluated.
Bovopoulos, Andreas D. and Lazar, Aurel A., "Load Balancing Algorithms for Jacksonian Networks with Acknowledgement Delays" Report Number: WUCS-89-04 (1989). All Computer Science and Engineering Research.
Permanent URL: http://dx.doi.org/10.7936/K7Q23XMT