Scheduling nonuniform traffic in a packet switching system withsmall propagation delay

摘要

A new model of nonuniform traffic is introduced for a single-hoppacket switching system. This traffic model allows arbitrary trafficstreams subject only to a constraint on the number of data packets whichcan arrive at any individual source in the system or for any individualdestination in the system over time periods of specified length. Thenonuniform traffic model is flexible enough to cover integrated datanetworks carrying diverse classes of data. The system model is rathergeneral and includes passive optical star wavelength division networks.Transmission algorithms are introduced for a single-hop packet switchingsystem with such nonuniform traffic and with propagation delay that isnegligible relative to the packet length. The algorithms are based oncollision-free scheduling of packets using graph matching algorithms,since the global state of the system is known to all stations at anytime