Simple Packet Networks
Packet networks differ from loss system in that traffic is delayed in case of congestion rather than blocked and lost. In a general packet network we do consider any admission or flow control, and in most cases the buffers of the nodes are assumed to be infinitely large. Such networks can under some additional assumptions be analyzed by analytical methods.
Given a topology, resource allocation and flow assignment are tractable analytically for these types of networks. This allows for simultaneous flow and resource optimization as well. Two methods for local optimization of topology are discussed—the branch exchange and the cut saturation methods.
Open Jackson network
Flow deviation ...