Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Parallel switching in connection-oriented networks James Anderson Sanjoy Baruah Kevin Je ay
 

Summary: Parallel switching in connection-oriented networks
James Anderson Sanjoy Baruah Kevin Je ay
The University of North Carolina at Chapel Hill
Abstract
Packet switching in connection-oriented networks
that may have multiple parallel links between pairs of
switches is considered. An e cient packet-scheduling
algorithm that guarantees a deterministic quality of
service to connections with real-time constraints is pro-
posed { this algorithm is a generalization of some recent
multiprocessor scheduling algorithms, and o ers real-
time performance guarantees similar to those o ered
by earlier fair-scheduling strategies such as Weighted
Fair Queueing and proportional-share schemes.
1. Introduction
Asynchronous Transfer Mode (ATM) networking
technology is centered around the concept of switching
53-byte cells, where the cell is the basic unit of data
transfer. One of the major reasons behind this design
choice is that it is possible to build parallel switches,

  

Source: Anderson, James - Department of Computer Science, University of North Carolina at Chapel Hill
Baruah, Sanjoy - Department of Computer Science, University of North Carolina at Chapel Hill

 

Collections: Computer Technologies and Information Sciences