Sciweavers

Share
ICN
2005
Springer

Scheduling Algorithms for Input Queued Switches Using Local Search Technique

8 years 9 months ago
Scheduling Algorithms for Input Queued Switches Using Local Search Technique
Input Queued switches have been very well studied in the recent past. The Maximum Weight Matching (MWM) algorithm is known to deliver 100% throughput under any admissible traffic. However, MWM is not practical for its high computational complexity O(N3 ). In this paper, we study a class of approximations to MWM from the point of view of local search. Firstly, we propose a greedy scheduling algorithm called GSA. It has the following features: (a) It is very simple to compute the weight of a neighbor matching. GSA only needs to compute the weight of two swapped edges instead of the weight of all the edges. (b) The computational complexity of GSA is O(c_max), where c_max denotes the maximum number of iterations. Hence we can adjust the value of c_max to achieve low computational complexity. Secondly, we observe that: (a) Local search is well suitable for parallel computing. (b) Each line card of high performance router has at least one processor. Based on the two important observations, w...
Yanfeng Zheng, Simin He, Shutao Sun, Wen Gao
Added 29 Jun 2010
Updated 29 Jun 2010
Type Conference
Year 2005
Where ICN
Authors Yanfeng Zheng, Simin He, Shutao Sun, Wen Gao
Comments (0)
books