Scheduling nonuniform traffic in a packet switching system with small propagation delay

A new model of nonuniform traffic is introduced for a single-hop packet switching system. This traffic model allows arbitrary traffic streams subject only to a constraint on the number of data packets which can arrive at any individual source in the system or for any individual destination in the system over time periods of specified length. The nonuniform traffic model is flexible enough to cover integrated data networks carrying diverse classes of data. The system model is rather general and includes passive optical star wavelength division networks. Transmission algorithms are introduced for a single-hop packet switching system with such nonuniform traffic and with propagation delay that is negligible relative to the packet length. The algorithms are based on collision-free scheduling of packets using graph matching algorithms, since the global state of the system is known to all stations at any time.<<ETX>>

[1]  Thomas G. Robertazzi.  Stochastic Models for ATM Switching Networks , 1993 .

[2]  Bruce Hajek,et al.  Scheduling nonuniform traffic in a packet switching system with large propagation delay , 1995, IEEE Trans. Inf. Theory.

[3]  Chak-Kuen Wong,et al.  Minimizing the Number of Switchings in an SS/TDMA System , 1985, IEEE Trans. Commun..

[4]  T. Inukai,et al.  An Efficient SS/TDMA Time Slot Assignment Algorithm , 1979, IEEE Trans. Commun..

[5]  Harold N. Gabow,et al.  Algorithms for Edge Coloring Bipartite Graphs and Multigraphs , 1982, SIAM J. Comput..

[6]  Leslie G. Valiant,et al.  Universal schemes for parallel communication , 1981, STOC '81.

[7]  James F. Kurose,et al.  On computing per-session performance bounds in high-speed multi-hop computer networks , 1992, SIGMETRICS '92/PERFORMANCE '92.

[8]  R. Ramaswami,et al.  Multiwavelength lightwave networks for computer communication , 1993, IEEE Communications Magazine.

[9]  Samuel P. Morgan,et al.  Input Versus Output Queueing on a Space-Division Packet Switch , 1987, IEEE Trans. Commun..

[10]  Minghua Chen,et al.  A conflict-free protocol for optical WDMA networks , 1991, IEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record.

[11]  Rajiv Ramaswami,et al.  A Wavelength Division Multiple Access Network for Computer Communication , 1990, IEEE J. Sel. Areas Commun..

[12]  Rene L. Cruz,et al.  A calculus for network delay, Part I: Network elements in isolation , 1991, IEEE Trans. Inf. Theory.

[13]  Mark J. Karol,et al.  A growable packet (ATM) switch architecture: design principles and applications , 1989, IEEE Global Telecommunications Conference, 1989, and Exhibition. 'Communications Technology for the 1990s and Beyond.

[14]  G. Bongiovanni,et al.  An Optimum Time Slot Assignment Algorithm for an SS/TDMA System with Variable Number of Transponders , 1981, IEEE Trans. Commun..

[15]  Kai Y. Eng,et al.  A growable packet (ATM) switch architecture: design principles and application , 1992, IEEE Trans. Commun..

[16]  Leonard Kleinrock,et al.  On the performance of wavelength division multiple access networks , 1992, [Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications.

[17]  Lixia Zhang,et al.  A new architecture for packet switching network protocols , 1989 .

[18]  Rajiv Ramaswami,et al.  A Media-Access Protocol for Packet-Switched Wavelength Division Multiaccess Metropolitan Area Networks , 1990, IEEE J. Sel. Areas Commun..