Load balancing algorithms for Jacksonian networks with acknowledgement delays

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...

Full description

Saved in:
Bibliographic Details
Published inConference on Computer Communications pp. 749 - 757 vol.2
Main Authors Bovopoulos, A.D., Lazar, A.A.
Format Conference Proceeding
LanguageEnglish
Published IEEE Comput. Soc. Press 1989
Subjects
Communication system traffic control
Delay effects
Electronic mail
Load management
Monitoring
Optimal control
Packet switching
Routing
Throughput
Upper bound
Online AccessGet full text
ISBN0818619201
9780818619205
DOI10.1109/INFCOM.1989.101523

Cover

More Information
Summary: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.< >
ISBN:0818619201
9780818619205
DOI:10.1109/INFCOM.1989.101523