Efficient Variable Length Block Switching Mechanism

Jaidhar C.D., A.V Reddy

Abstract


Most popular and widely used packet switch architecture is the crossbar. Its attractive characteristics are simplicity, non-blocking and support for simultaneous multiple packet transmission across the switch. The special version of crossbar switch is Combined Input Crossbar Queue (CICQ) switch. It overcomes the limitations of un-buffered crossbar by employing buffers at each crosspoint in addition to buffering at each input port. Adoption of Crosspoint Buffer (CB) simplifies the scheduling complexity and adapts the distributed nature of scheduling. As a result, matching operation is not needed. Moreover, it supports variable length packets transmission without segmentation. Native switching of variable length packet transmission results in unfairness. To overcome this unfairness, Fixed Length Block Transfer mechanism has been proposed. It has the following drawbacks: (a) Fragmented packets are reassembled at the Crosspoint Buffer (CB). Hence, minimum buffer requirement at each crosspoint is twice the maximum size of the block. When number of ports are more, existence of such a switch is infeasible, due to the restricted memory available in switch core. (b) Reassembly circuit at each crosspoint adds the cost of the switch. (c) Packet is eligible to transfer from CB to output only when the entire packet arrives at the CB, which increases the latency of the fragmented packet in the switch. To overcome these drawbacks, this paper presents Variable Length Block Transfer mechanism. It does not require internal speedup, segmentation and reassembly circuits. Using simulation it is shown that proposed mechanism is superior to Fixed Length Block Transfer mechanism in terms of delay and throughput.

Keywords


Crossbar switch, Un-buffered Crossbar switch, Buffered Crossbar switch, Combined Input Crossbar Queue switch

Full Text:

PDF

References


M. J. Karol, M. G. Hluchyj and S. P. Morgan, Input Versus Output Queuing on a Space-Division Packet Switch, IEEE Transactions on Communications, Vol. 35, pp. 1347–1356, 1987.
http://dx.doi.org/10.1109/TCOM.1987.1096719

T. Anderson, S. Owicki, J. Saxe and C. Thacker, High Speed Switch Scheduling for Local Area Networks, ACM Transactions on Computer Systems, Vol. 11, pp. 319–352, 1993.
http://dx.doi.org/10.1145/161541.161736

N. McKeown, The iSLIP Scheduling Algorithm for Input-Queued Switches, IEEE/ACM Transactions on Networking, Vol. 7, pp. 188–201, 1999.
http://dx.doi.org/10.1109/90.769767

D. N. Serpanos and P. I. Antoniadis, FIRM: A Class of Distributed Scheduling Algorithms for High-Speed ATM Switches with Multiple Input Queues, Proceedings of the IEEE INFOCOM, pp. 548–555, 2000.
http://dx.doi.org/10.1109/infcom.2000.832228

H. J. Chao and J. S. Park, Centralized Contention Resolution Schemes for A Large-Capacity Optical ATM Switch, Proceedings of the IEEE ATM Workshop, 1998.
http://dx.doi.org/10.1109/atm.1998.675103

Y. L. S. Panwar and H. J. Chao, On the Performance of a Dual Round-Robin Switch, Proceedings of the IEEE INFOCOM, pp. 1688–1697, 2001.

N. McKeown, V. Anantharam and J. Walrand, Achieving 100% Throughput in an Input-Queued Switch, Proceedings of the IEEE INFOCOM, pp. 296–302, 1996.
http://dx.doi.org/10.1109/infcom.1996.497906

A. Mekkittikul and N. McKeown, A Starvation-free Algorithm for Achieving 100% Throughput in an Input-Queued Switch, Proceedings of the IEEE ICCCN, pp. 226–231, 1996.

G. Keridis and N. McKeown, Output-buffer ATM Packet Switching for Integrated Services Communication Networks, Proceedings of the IEEE International Conference on Communications, Montreal, Canada, 1997.

E. Rathgeb, T. Theimer and M.Huber, Buffering Concepts for ATM switching networks, Proceedings of the IEEE GLOBECOM, pp. 1277–1281, 1988.
http://dx.doi.org/10.1109/glocom.1988.26034

A. K. Gupta, L. O. Barbosa and N. D. Georganas, 16£16 Limited Intermediate Buffer Switch Module for ATM Networks, Proceedings of the EEE GLOBECOM, pp. 939-943, 1991.
http://dx.doi.org/10.1109/glocom.1991.188518

A. L. Gupta and N. D. Georganas, Analysis of a packet switch with input and output buffers and speed constraints, Proceedings of the IEEE INFOCOM, pp. 694–700, 1999.

A. K. Gupta, L. O. Barbosa and N. D. Georganas, Limited Intermediate Buffer Switch Modules and their Interconnection Networks for B-ISDN, Proceedings of the IEEE International Conference on Communications, pp. 1646–1650, 1992.
http://dx.doi.org/10.1109/icc.1992.268014

M. Lin and N. McKeown, The Throughput of a Buffered Crossbar Switch, IEEE communications Letters, Vol. 9, pp. 465–467, 2005.
http://dx.doi.org/10.1109/LCOMM.2005.1431173

M. Nabeshima, Performance Evaluation of a Combined Input and Crosspoint Queued Switch, IEICE Transactions on Communications, Vol. E83-B, pp. 737–741, 2000.

T. Javid, R. Magil and T. Hrabik, A High Throughput Scheduling Algorithm for a Buffered Crossbar Switch Fabric, Proceedings of the IEEE International Conference on Communications, pp. 1586– 1591, 2001.
http://dx.doi.org/10.1109/icc.2001.937187

R. R. Cessa, E. Oki, Z. Jing and H. J. Chao, CIXB-1 Combined Input-One Cell-Crosspoint-Buffered Switch, Proceedings of the IEEE Workshop on High Performance Switching and Routing, pp. 324– 329, 2001.

H. T. Kung and R. Morris, Credit-Based Flow Control for ATM Networks, IEEE Network Magazine, Vol. 9, pp. 40–48, 1995.
http://dx.doi.org/10.1109/65.372658

K. Yoshigoe and K.J. Christensen, An Evaluation to Crossbar Switches with Virtual Output Queuing and Buffered Cross points, IEEE Network, Vol. 17, pp. 48–56, 2003.
http://dx.doi.org/10.1109/MNET.2003.1233917




DOI: https://doi.org/10.15837/ijccc.2007.3.2359



Copyright (c) 2017 Jaidhar C.D., A.V Reddy

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

CC-BY-NC  License for Website User

Articles published in IJCCC user license are protected by copyright.

Users can access, download, copy, translate the IJCCC articles for non-commercial purposes provided that users, but cannot redistribute, display or adapt:

  • Cite the article using an appropriate bibliographic citation: author(s), article title, journal, volume, issue, page numbers, year of publication, DOI, and the link to the definitive published version on IJCCC website;
  • Maintain the integrity of the IJCCC article;
  • Retain the copyright notices and links to these terms and conditions so it is clear to other users what can and what cannot be done with the  article;
  • Ensure that, for any content in the IJCCC article that is identified as belonging to a third party, any re-use complies with the copyright policies of that third party;
  • Any translations must prominently display the statement: "This is an unofficial translation of an article that appeared in IJCCC. Agora University  has not endorsed this translation."

This is a non commercial license where the use of published articles for commercial purposes is forbiden. 

Commercial purposes include: 

  • Copying or downloading IJCCC articles, or linking to such postings, for further redistribution, sale or licensing, for a fee;
  • Copying, downloading or posting by a site or service that incorporates advertising with such content;
  • The inclusion or incorporation of article content in other works or services (other than normal quotations with an appropriate citation) that is then available for sale or licensing, for a fee;
  • Use of IJCCC articles or article content (other than normal quotations with appropriate citation) by for-profit organizations for promotional purposes, whether for a fee or otherwise;
  • Use for the purposes of monetary reward by means of sale, resale, license, loan, transfer or other form of commercial exploitation;

    The licensor cannot revoke these freedoms as long as you follow the license terms.

[End of CC-BY-NC  License for Website User]


INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL (IJCCC), With Emphasis on the Integration of Three Technologies (C & C & C),  ISSN 1841-9836.

IJCCC was founded in 2006,  at Agora University, by  Ioan DZITAC (Editor-in-Chief),  Florin Gheorghe FILIP (Editor-in-Chief), and  Misu-Jan MANOLESCU (Managing Editor).

Ethics: This journal is a member of, and subscribes to the principles of, the Committee on Publication Ethics (COPE).

Ioan  DZITAC (Editor-in-Chief) at COPE European Seminar, Bruxelles, 2015:

IJCCC is covered/indexed/abstracted in Science Citation Index Expanded (since vol.1(S),  2006); JCR2018: IF=1.585..

IJCCC is indexed in Scopus from 2008 (CiteScore2018 = 1.56):

Nomination by Elsevier for Journal Excellence Award Romania 2015 (SNIP2014 = 1.029): Elsevier/ Scopus

IJCCC was nominated by Elsevier for Journal Excellence Award - "Scopus Awards Romania 2015" (SNIP2014 = 1.029).

IJCCC is in Top 3 of 157 Romanian journals indexed by Scopus (in all fields) and No.1 in Computer Science field by Elsevier/ Scopus.

 

 Impact Factor in JCR2018 (Clarivate Analytics/SCI Expanded/ISI Web of Science): IF=1.585 (Q3). Scopus: CiteScore2018=1.56 (Q2); Editors-in-Chief: Ioan DZITAC & Florin Gheorghe FILIP.