Performance of packet-to-cell segmentation schemes in input buffered packet switches

  title={Performance of packet-to-cell segmentation schemes in input buffered packet switches},
  author={Kenneth J. Christensen and Kenji Yoshigoe and Allen Roginsky and Neil J. Gunther},
  journal={2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577)},
  pages={1097-1102 Vol.2}
Most input buffered packet switches internally segment variable-length packets into fixed-length cells. The last cell in a segmented packet contains overhead bytes if the packet length is not evenly divisible by the cell length. Switch speed-up is used to compensate for this overhead. In this paper, we develop an analytical model of a single-server queue where an input stream of packets is segmented into cells for service. Analytical models are developed for M/M/1, M/H/sub 2//1, and M/E/sub 2… 
Efficient Approach to Merge and Segment IP Packets
This paper proposes a framing approach called Bit Map Packet Framing (BMPF) to merge and segment IP packets efficiently and is superior to other conventional framing methods, such as PPP, HDLC and COBS.
DSAR: A New Segmentation Scheme for Input Buffered Switches
A new method of SAR for Input buffered switches using the queue information of switches and can adjust the segment size dynamically is proposed, which outperforms existing segmentation schemes in Input Buffered switches.
Design and evaluation of the combined input and crossbar queued (cicq) switch
This dissertation investigates a new combined input and crossbar queued (CICQ) switch architecture and proposes new methods for improving the performance, stability, and scalability of the CICQ switch.
Threshold-based Exhaustive Round-Robin for the CICQ Switch with Virtual Crosspoint Queues
  • K. Yoshigoe
  • Computer Science
    2007 IEEE International Conference on Communications
  • 2007
A threshold-based exhaustive round-robin (T-ERR) arbitration is employed to improve the throughput of the CICQ switch with VCQs and makes the scalable implementation of a distributed C ICQ switch practical.
Rate-based flow-control for the CICQ switch
  • K. Yoshigoe
  • Computer Science
    The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l
  • 2005
A distributed rate-based flow control internal to a CICQ switch is proposed that allocates bandwidth to each virtual output queue (VOQ) using simple counters, and a minimal CP buffer requirement can be achieved without packet loss.
New Round-Robin Scheduling Algorithm for Combined Input-Crosspoint Buffered Switch
The results show the advantage of the ERR-ERR CICQ switch as a competitor for the next generation of high-performance packet switches.
Variable length packet scheduler algorithm with QoS support
A novel variable length packet scheduling algorithm focused on real output queue reference architecture is presented in this paper. The main features of this packet scheduler development are the
Hardware implementation of a scheduler for high performance switches with quality of service (QoS) support
The hardware implementation of a scheduler with QoS support is presented, demonstrating it is a suitable design for high speed switches and described in Verilog HDL at RTL level.
A new adaptive two-stage maximum-likelihood decoding algorithm for linear block codes
This work presents a maximum-likelihood (ML) decoding algorithm for linear block codes that achieves optimal performance with a low average computational complexity and is extended to decode block turbo codes.


Packet-mode scheduling in input-queued cell-based switches
It is proved that input-queued switch architectures dealing at their interfaces with variable-size packets, but internally operating on fixed-size cells using packet-mode scheduling can achieve 100% throughput, and it is shown by simulation that, depending on the packet size distribution, packet- Mode scheduling may provide advantages over cell- mode scheduling.
The iSLIP scheduling algorithm for input-queued switches
This paper presents a scheduling algorithm called iSLIP, an iterative, round-robin algorithm that can achieve 100% throughput for uniform traffic, yet is simple to implement in hardware, and describes the implementation complexity of the algorithm.
An evolution to crossbar switches with virtual output queuing and buffered cross points
This tutorial article presents an overview of switch matrix scheduling for VOQ IQ switches with crossbar switch fabrics, and shows how CICQ switches have simple schedulers and result in lower delay than IQ switches, both of which have unstable regions.
FIRM: a class of distributed scheduling algorithms for high-speed ATM switches with multiple input queues
  • D. Serpanos, P. Antoniadis
  • Computer Science
    Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064)
  • 2000
A new distributed scheduling algorithm, FIRM, is introduced, which provides improved performance characteristics over alternative distributed algorithms and provides improved fairness and tighter service guarantee than others.
Queueing Systems
▶ Publishes research on theoretical problems in resource sharing dynamics (in a broad sense), with particular interests in probability and statistics ▶ Publishes rigorous applied probability
Queueing Systems: Volume I-Theory
The purpose of this document is to summarize the main points of the book written by Leonard Kleinrock, titled, ‘Queueing Systems’, which is about queueing systems.
Signals and systems
A report on the 2006 Keystone Conference on Signaling Networks, Vancouver, Canada, 30 January-4 February 2006.
The Practical Performance Analyst
From the Publisher: The Practical Performance Analyst teaches rapid application of performance predication for informed decisions.
An Evolution to Crossbar Switches with Buffered Cross Points,
  • IEEE Network,
  • 2003