Introduction
G(V,E).- Problem Overview O
(G(V,E)).- Mathematical Models and Properties of Queues
G(V).- Transportation and Loss Queues
G(E).- Open Queueing Network Algorithms
f(G(V,E)).- Closed Queueing Network Performance Models
f(G(V,E,N)).- Optimal Resource Allocation Problems (ORAP)
G(V*) in TND.- Optimal Routing Problems (ORTE)
G(E*) in TND.- Optimal Topology Problems (OTOP)
G(V,E)* in TND.- Final Coda.