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

Hai Yang and S.C. Wong

Annals of Operations Research, 1999, vol. 87, issue 0, 73-85

Abstract: 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

Date: 1999
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018961809406 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:87:y:1999:i:0:p:73-85:10.1023/a:1018961809406

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018961809406

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().