Estimation of the most likely equilibrium traffic queueing pattern in a capacityconstrained network

Network equilibrium models have recently been enhanced by explicitly incorporating link capacity constraints, resulting in queueing network equilibrium traffic patterns. Unfortunately, queueing delays at equilibrium are not unique, and thus models suffer deficiencies that limit their applications in network traffic control and management. This article proposes an entropy‐maximizing method to determine the most likely equilibrium traffic queueing pattern in a capacity constrained network. Queue‐weighting factors or queueing probabilities are estimated based on the location of the saturated links in the network, and incorporated into an entropy‐maximizingmodel of the queueing distribution. The proposed method would significantly enhance the application of the current queueing network equilibrium models in the design and operation of congested traffic systems. Copyright Kluwer Academic Publishers 1999