Permuted Diagonal Maximum Weight Matching (PDMWM) Scheme for Cell Scheduling in Fixed Length Packet Switches
S.N. Kore, Ajinkya Biradar, Sayali Kore · 2012
Explosive growth in internet is demanding very fast switching fabric in internet routers and switches. Packets need to be buffered at input or output or on both sides of crossbar switching fabric. Crossbar switches are used for switching because of no bandwidth limitation & high scalability. Its well-known fact that buffering of packets on outside of switch demands switching fabric to be „N‟ time faster whereas buffering packets on input side limits throughput to 58%. Combined input output queued (CIOQ) switch demands that switch fabric to run at speed up of 2. Hence VOQ (Virtual output Queue) i.e. „N‟ queues per input port i.e. total N 2 queues on input side are suggested to resolve problem of throughput limitation of 58% in input queued switches. In VOQ throughput achieved is 100%. Selection of packets is key issue in VOQ various schemes like, MWM, MSM and maximal matching, are suggested by researchers in last two decades to improve the performance in terms of throughput and delay. We are addressing Permuted Diagonal Maximum Weight Matching (PDMWM) Scheme which provides 100% instantaneous throughput in each slot under heavy traffic conditions & improves delay performance. Our scheme PDMWM is computationally complex for large size switches but it outperforms at lower size switches and provides optimal