The greedy algorithm is optimal for on-line edge coloring
Information Processing Letters
High-speed switch scheduling for local-area networks
ACM Transactions on Computer Systems (TOCS)
An upper bound on delay for the VirtualClock service discipline
IEEE/ACM Transactions on Networking (TON)
Scheduling nonuniform traffic in a packet-switching system with small propagation delay
IEEE/ACM Transactions on Networking (TON)
A reservation protocol for broadcast WDM networks and stability analysis
Computer Networks: The International Journal of Computer and Telecommunications Networking
Symmetric Crossbar Arbiters for VLSI Communication Switches
IEEE Transactions on Parallel and Distributed Systems
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)
SCHEDULING OF AN INPUT-QUEUED SWITCH TO ACHIEVE MAXIMAL THROUGHPUT
Probability in the Engineering and Informational Sciences
WF2Q: worst-case fair weighted fair queueing
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Scheduling reserved traffic in input-queued switches: new delay bounds via probabilistic techniques
IEEE Journal on Selected Areas in Communications
On the stability of local scheduling policies in networks of packet switches with input queues
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
Jitter regulation for multiple streams
ACM Transactions on Algorithms (TALG)
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
Sarnoff'10 Proceedings of the 33rd IEEE conference on Sarnoff
IEEE/ACM Transactions on Networking (TON)
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
Low latency energy efficient communications in global-scale cloud computing systems
Proceedings of the 2013 workshop on Energy efficient high performance parallel and distributed computing
| Hi-index | 0.00 |
Input-queued switches are used extensively in the design of high-speed routers. As switch speeds and sizes increase, the design of the switch scheduler becomes a primary challenge, because the time interval for the matching computations needed for determining switch configurations becomes very small. Possible alternatives in scheduler design include increasing the scheduling interval by using envelopes [19], and using a frame-based scheduler that guarantees fixed rates between input-output pairs. However, both these alternatives have significant jitter drawbacks: the jitter increases with the envelope size in the first alternative, and previously-known methods do not guarantee tight jitter bounds in the second.In this paper, we propose a hybrid approach to switch scheduling. Traffic with tight jitter constraints is first scheduled using a frame-based scheduler that achieves low jitter bounds. Jitter-insensitive traffic is later scheduled using an envelope-based scheduler. The main contribution of this paper is a scheduler design for generating low-jitter schedules. The scheduler uses a rate matrix decomposition designed for low jitter and different from the minimum-bandwidth Birkhoff-Von Neumann (BV) decomposition. In addition to generating low-jitter schedules, this decomposition in the worst case yields fewer switch configuration matrices (O(n)) than the BV decomposition (O(n2)), and so requires far less high-speed switch memory. We develop an efficient algorithm for decomposing the rate matrix and for scheduling the permutation matrices. We prove that our low-jitter algorithm has an O(logn) factor bound on its bandwidth consumption in comparison to the minimum-bandwidth BV decomposition. Experimentally, we find that the bandwidth increase in practice is much lower than the theoretical bound. We also prove several related performance bounds for our scheduler. Finally, we propose a practical algorithm for bandwidth-guaranteed algorithm, and show how our findings could even be extended to systems with large tuning time.