Throughput and QoS optimization in nonuniform multichannel wireless mesh networks
Proceedings of the 4th ACM symposium on QoS and security for wireless and mobile networks
Bounds on end-to-end delay and jitter in input-buffered and internally-buffered IP networks
SARNOFF'09 Proceedings of the 32nd international conference on Sarnoff symposium
A low-jitter guaranteed-rate scheduling algorithm for packet-switched IP routers
IEEE Transactions on Communications
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Low latency high bandwidth networks are key components in largescale computing systems. Existing systems use dynamic algorithmsfor routing and scheduling cell transmissions through switches. Dueto stringent time requirements, dynamic algorithms have suboptimalperformances, which limit throughputs to well below peak capacity.It is shown that Guaranteed-Rate communications can be supportedover switch-based networks with 100% throughput and very low delayjitter, provided that each switch has the capacity to buffer asmall number of cells per flow. An algorithm is used to reserveguaranteed bandwidth and buffer space in the switches, resulting inthe specification of a doubly stochastic traffic rate matrix foreach switch. Each switch schedules the Guaranteed-Rate traffic fortransmission according to a resource reservation algorithm based onRecursive Fair Stochastic Matrix Decomposition. Very low delayjitters can be achieved among all simultaneous flows whilesimultaneously achieving 100% throughput in each switch. Whenreceive buffers of bounded depth are used to filter residualnetwork jitter at the destinations, end-to-end traffic flows can bedelivered with essentially zero delay jitter. The algorithm issuitable for the switch-based networks found in commercialsupercomputing systems such as Fat Trees, and for siliconNetworks-on-a-Chip.