Computer Science – Networking and Internet Architecture
Scientific paper
2011-12-19
Computer Science
Networking and Internet Architecture
15 pages, 7 figures
Scientific paper
Given the rapid increase in traffic, greater demands have been put on research in high-speed switching systems. Such systems have to simultaneously meet several constraints, e.g., high throughput, low delay and low complexity. This makes it challenging to design an efficient scheduling algorithm, and has consequently drawn considerable research interest. However, previous results either cannot provide a 100% throughput guarantee without a speedup, or require a complex centralized scheduler. In this paper, we design a distributed 100% throughput algorithm for crosspoint buffered switches, called DISQUO, with very limited message passing. We prove that DISQUO can achieve 100% throughput for any admissible Bernoulli traffic, with a low time complexity of O(1) per port and a few bits message exchanging in every time slot. To the best of our knowledge, it is the first distributed algorithm that can provide a 100% throughput for a crosspoint buffered switch.
Panwar Shivendra
Shen Yanming
Ye Shunyuan
No associations
LandOfFree
A Distributed Scheduling Algorithm for High-Speed Switching Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Distributed Scheduling Algorithm for High-Speed Switching Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Distributed Scheduling Algorithm for High-Speed Switching Systems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-209818