Scheduling algorithms for burst reservations on wide area high speed networks

An examination is made of a new high speed wide area network architecture that reserves access to the network for bursts of data. The network is being designed for high speed bursty applications. Sources make reservation requests for each burst of information. Scheduling of network access and switching is accomplished by a distributed reservation algorithm. A detailed examination is made of two reservation algorithms that provide this type of demand assignment of network resources.<
>