Traffic flow information for minimum cost routing procedures

✍ Scribed by B. Yaged Jr.

• Publisher: Elsevier Science
• Year: 1969
• Tongue: English
• Weight: 520 KB
• Volume: 5
• Category: Article
• ISSN: 0005-1098
• DOI: 10.1016/0005-1098(69)90010-7

✦ Synopsis

For networks in which traffic flows are routed for minimum cost, an efficient technique is presented which provides detailed understanding of traffic flow patterns.

Summary--For a two-way communications network in which each link is assigned a cost per traffic unit, a minimum cost routing policy (MCR) routes the required traffic between two nodes along the path with least cost. This paper describes a new technique for computing the Composite Flow Requirement between any two nodes. This is the sum of the traffic requirement between the two nodes and all other traffic requirements whose paths pass through both of the nodes. Knowing the Composite Flow Requirement between any two nodes gives vital planning information about the traffic flow patterns in the network. The technique of this paper brings practical utility to the concept of Composite Flow Requirement by substantially reducing computation effort.