Load balancing algorithms for Jacksonian networks with acknowledgement delays

Author

Bovopoulos, Andreas D. ; Lazar, Aurel A.

Author_Institution

Dept. of Comput. Sci., Washington Univ., St. Louis, MO, USA

fYear

1989

fDate

23-27 Apr 1989

Firstpage

749

Abstract

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 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 of a window type, while the routing policy balances the traffic inside the network. Several load-balancing algorithms are evaluated

Keywords

packet switching; queueing theory; Jacksonian networks; acknowledgement delays; flow control; load-balancing algorithms; packet switching; queueing theory; routing; Communication system traffic control; Delay effects; Electronic mail; Load management; Monitoring; Optimal control; Packet switching; Routing; Throughput; Upper bound;

fLanguage

English

Publisher

ieee

Conference_Titel

INFOCOM '89. Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies. Technology: Emerging or Converging, IEEE

Conference_Location

Ottawa, Ont.

Print_ISBN

0-8186-1920-1

Type

conf

DOI

10.1109/INFCOM.1989.101523

Filename

101523