By Topic

Scheduling algorithms for burst reservations on wide area high speed networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Schragger, P. ; Delaware Univ., Newark, DE, USA

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

Published in:

INFOCOM '91. Proceedings. Tenth Annual Joint Conference of the IEEE Computer and Communications Societies. Networking in the 90s., IEEE

Date of Conference:

7-11 Apr 1991