IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Generalized guaranteed rate scheduling algorithms: a framework
IEEE/ACM Transactions on Networking (TON)
Scheduling nonuniform traffic in a packet-switching system with small propagation delay
IEEE/ACM Transactions on Networking (TON)
The Mathematical Theory of Nonblocking Switching Networks
The Mathematical Theory of Nonblocking Switching Networks
Bounds on delays and queue lengths in input-queued cell switches
Journal of the ACM (JACM)
ATM Input-Buffered Switches with the Guaranteed-Rate Property
ISCC '98 Proceedings of the Third IEEE Symposium on Computers & Communications
Guaranteed scheduling for switches with configuration overhead
IEEE/ACM Transactions on Networking (TON)
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Open issues in router buffer sizing
ACM SIGCOMM Computer Communication Review
On guaranteed smooth scheduling for input-queued switches
IEEE/ACM Transactions on Networking (TON)
Update on buffer sizing in internet routers
ACM SIGCOMM Computer Communication Review
A critique of recently proposed buffer-sizing strategies
ACM SIGCOMM Computer Communication Review
Low jitter guaranteed-rate communications for cluster computing systems
International Journal of Communication Networks and Distributed Systems
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
Decomposition of Permutation Networks
IEEE Transactions on Computers
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
Nonblocking, repackable, and rearrangeable Clos networks: fifty years of the theory evolution
IEEE Communications Magazine
IEEE Communications Magazine
Matching output queueing with a combined input/output-queued switch
IEEE Journal on Selected Areas in Communications
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
IEEE Journal on Selected Areas in Communications
Sarnoff'10 Proceedings of the 33rd IEEE conference on Sarnoff
Future internet video multicasting with essentially perfect resource utilization and QoS guarantees
Proceedings of the Nineteenth International Workshop on Quality of Service
NEW2AN'11/ruSMART'11 Proceedings of the 11th international conference and 4th international conference on Smart spaces and next generation wired/wireless networking
| Hi-index | 0.00 |
A Guaranteed-Rate scheduling algorithm for packet-switched IP routers with rate, delay and jitter guarantees is proposed. The algorithm can be used to schedule traffic with 100% throughput in Input-Queued IP routers with unity speedup. The traffic is scheduled according to transmission frames of duration F time-slots. An NxN doubly stochastic traffic rate matrix specifies a traffic rate between each pair of IO ports. The matrix is quantized and recursively decomposed into a sequence of F permutations. Each permutation is used to configure the crossbar switch for one time-slot without requiring additional scheduling. The recursive fair stochastic matrix decomposition is based upon the routing of a permutation through a binary rearrangeable network. In the resulting transmission schedule, the expected Inter-Departure Time (IDT) of a cell equals the Ideal IDT (IIDT), and the maximum IDT and service lag of a cell are bounded by an integer number of IIDTs. The delay and delay jitter experienced along an end-to-end path in a packet-switched IP/MPLS network are therefore small and bounded by an integer number of IIDTs, and the buffer sizes within the IP routers are small and bounded. The proposed algorithm can be used to schedule Guaranteed-Rate traffic in packet-switched IP/MPLS networks, to provide near-optimal queueing delays and essentially-zero delay jitter along end-toend paths when playback buffers are employed.