Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Scheduling Traffic Matrices On General Switch Fabrics Xiang Wu Amit Prakash Marghoob Mohiyuddin Adnan Aziz
 

Summary: Scheduling Traffic Matrices On General Switch Fabrics
Xiang Wu Amit Prakash Marghoob Mohiyuddin Adnan Aziz
AMD Microsoft UC Berkeley UT Austin
Abstract
A traffic matrix is an |S| |T | matrix M, where Mij is a
non-negative integer encoding the number of packets to be
transferred from source i to sink j. Chang et al. [2] have
shown how to efficiently compute an optimum schedule for
transferring packets from sources to sinks when the sources
and sinks are connected via a rearrangeable fabric such as
crossbar. We address the same problem when the switch
fabric is not rearrangeable. Specifically, we (1.) prove that
the optimum scheduling problem is NP-hard for general
switch fabrics, (2.) identify a sub-class of fabrics for which
the problem is polynomial-time solvable, and (3.) develop a
heuristic for the general case.
1 Context
A switch fabric is an ensemble of links and pro-
grammable crosspoints that connect a set of source nodes
S to set of sink nodes T [9]. A traffic matrix is an |S| |T |

  

Source: Aziz, Adnan - Department of Electrical and Computer Engineering, University of Texas at Austin

 

Collections: Computer Technologies and Information Sciences