Optimal Routing Problems (ORTE) G(E∗) in TND

Abstract

This is the second chapter in our optimization finale. It concerns routing in queueing networks which is one of the most fundamental problems in topological network design. We illustrate optimal routing optimization in the design of queues, processes, and queueing networks where we examine blocking then transportation and loss networks. Figure 8.1 illustrates a general network topology where optimal routing is critical at many junctions. Access and egress problems are fundamental routing problems in most facilities and urban environments. We have already examined briefly the routing problem in product-form and non-product-form networks with infinite buffers in Chapters 5 and 6 We illustrate the problem with a number of applications and tie together the theory of queues and algorithms for the solution of a number of instances of optimal routing (ORTE) problems. Fig. 8.1