CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

A Priority based SRM Algorithm for VOQ Packet Switch Architecture

by Harendra Singh, Prabhat Ranjan
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 55 - Number 12
Year of Publication: 2012
Authors: Harendra Singh, Prabhat Ranjan
10.5120/8811-3128

Harendra Singh, Prabhat Ranjan . A Priority based SRM Algorithm for VOQ Packet Switch Architecture. International Journal of Computer Applications. 55, 12 ( October 2012), 36-41. DOI=10.5120/8811-3128

@article{ 10.5120/8811-3128,
author = { Harendra Singh, Prabhat Ranjan },
title = { A Priority based SRM Algorithm for VOQ Packet Switch Architecture },
journal = { International Journal of Computer Applications },
issue_date = { October 2012 },
volume = { 55 },
number = { 12 },
month = { October },
year = { 2012 },
issn = { 0975-8887 },
pages = { 36-41 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume55/number12/8811-3128/ },
doi = { 10.5120/8811-3128 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:57:15.810497+05:30
%A Harendra Singh
%A Prabhat Ranjan
%T A Priority based SRM Algorithm for VOQ Packet Switch Architecture
%J International Journal of Computer Applications
%@ 0975-8887
%V 55
%N 12
%P 36-41
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Virtual Output Queuing (VOQ) is used to overcome the head-of-line (HoL) blocking problem in input-queued (IQ) packet switches. There are a lot of research has been devoted to design iterative arbitration algorithms to find maximum throughput of this architecture. In this paper approximating maximum size matching (MSM) algorithm called Selective Request Matching (SRM) has been proposed, which performs extremely well under various traffic models and easy to implement in hardware.

References
  1. M. Karol, M. Hluchyj, "Queuing in High-performance Packet-switching", IEEE J. Select. Area Communication, Vol. 6, pp. 1587-1597, Dec 1988.
  2. N. McKeown, "Scheduling Cells in an Input-Queued Switch," PhD thesis, University of California at Berkeley, May 1995.
  3. N. McKeown, V. Ananthram and J. Walrand, "Achieving 100% throughput in an input-queued switch", IEEE INFOCOM '96, pp. 296-302.
  4. N. McKeown, A. Mekkittikul, V. Ananthram and J. Walrand, "Achieving 100% throughput in an input-queued switch", IEEE Trans. Communications, Vol. 47, No. 8, pp. 1260-1267, Aug. 1999.
  5. Anderson T. ; Owicki S. ; Saxe J. ; and Thacker C. "High speed switch scheduling for local area networks. " ACM Trans. on Computer Systems. Nov. 1993 pp. 319-352.
  6. Karol M. ; Eng K. ; Obara H. "Improving the performance of input-queued ATM packet switches" Proc. of IEEE INFOCOM '92, pp. 110-115.
  7. P. Krishna, N. S. Patel, A. charny and R. Simcoe, "On the speedup required for work-conserving crossbar switches", IWQOS'98, May 1998.
  8. A. Mekkittikul and N. McKeown, "A practical scheduling algorithm to achieve 100% throughput in input-queued switches", IEEE INFOCOM 98, Vol. 2, pp. 792-799, April 1998.
  9. N. McKeown, "Scheduling algorithms for input-queued cell switches," Ph. D. dissertation, Dept. Elect. Computer Science, Univ. California at Berkeley, Berkeley CA, 1995.
  10. D. N. Serpanos, and P. I. Antoniadis, "FIRM: A Class of Distributed Scheduling Algorithms for High-speed ATM Switches with Multiple Input Queues," PROC. IEEE INFOCOM 2000, pp. 548-555. 2000.
  11. H. J. Chao, J. S. Park, "Centralized Contention Resolution Schemes for a large-capacity Optical ATM Switche," IEEE ATM Workshop 1998, pp. 11-16, May 2001.
  12. Y. Li, S. Panwar, H. J. Chao, "The Dual Round-robin Matching Switch with Exhaustive Service," IEEE HPSR 2002, pp. 58-63 2002.
  13. Dong Lin, Ying Jiang and Mounir Hamadi, "Selective Request Round Robin Scheduling for VOQ Packet Switch Architeture" Proc. IEEE ICC 2011.
  14. M. J. Karol, M. G. Hluchyj, S. P. Morgan, "Input Verses Output Queuing on a Space-Division Packet Switch", IEEE Transactions on Communications, 35:1347-56, 1987.
  15. N. Mckeown, and T. E. Anderson, "A Quantitative Comparison of Iterative Scheduling Algorithms for Input-Queued Switches," Computer Networks and ISDN systems, vol. 30, pp. 2309-2326, 1997.
  16. Y. Li, S. Panwar, H. J. Chao, "On the performance of a Dual Round-Robin switch," IEEE INFOCOM 2001, vol. 3, pp. 1688-1697, April 2001.
  17. Y. Li, S. Panwar, H. J. Chao, " Performance analysis of an Exhaustive Service Dual Round-Robin scheduling slgorithm," CATT Technical Report, Nov. 2001.
Index Terms

Computer Science
Information Sciences

Keywords

Selective request matching highest priority pointer transmission request grant

Powered by PhDFocusTM