Title :
Scheduling algorithms for burst reservations on wide area high speed networks
Author_Institution :
Delaware Univ., Newark, DE, USA
Abstract :
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
Keywords :
computer networks; scheduling; burst reservations; demand assignment; distributed reservation algorithm; network access; pathfinder algorithm; scheduling algorithms; switching; trailblazer algorithm; wide area high speed networks; Artificial satellites; Broadcasting; Communication switching; High-speed networks; Packet switching; Scheduling algorithm; Switches; Switching circuits; Synchronization; Wide area networks;
Conference_Titel :
INFOCOM '91. Proceedings. Tenth Annual Joint Conference of the IEEE Computer and Communications Societies. Networking in the 90s., IEEE
Conference_Location :
Bal Harbour, FL
Print_ISBN :
0-87942-694-2
DOI :
10.1109/INFCOM.1991.147558
