Concatenating Packets in Variable-Length Input-Queued Packet Switches with Cell-Based and Packet-Based Scheduling

Internet data is transmitted in variable-size packets to provide flexibility for different applications. There has been a growing interest in developing the design of Internet routers based variable-length packets to improve performance and reduce the amount of re-assembly memory. However, most of variable-length designs follow a time-slotted approach, which make them similar to routers that switch fixed-length packets. The use of slotted timing makes padding necessary when packet sizes are not proportional to the time-slot length. In this paper, we investigate the impact of concatenating packets to reduce the amount of padding in variable-length packet switches. This approach increases the utilization of interconnection bandwidth and overall throughput performance. Performance evaluation in an input-queued packet switch using packet concatenation is presented.

[1]  Devavrat Shah,et al.  Cell switching versus packet switching in input-queued switches , 2005, IEEE/ACM Transactions on Networking.

[2]  Hung-Hsiang Jonathan Chao,et al.  Centralized contention resolution schemes for a large-capacity optical ATM switch , 1998, 1998 IEEE ATM Workshop Proceedings. 'Meeting the Challenges of Deploying the Global Broadband Network Infrastructure' (Cat. No.98EX164).

[3]  Marco Ajmone Marsan,et al.  Packet scheduling in input-queued cell-based switches , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[4]  Ying Jiang,et al.  A fully desynchronized round-robin matching scheduler for a VOQ packet switch architecture , 2001, 2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552).

[5]  Paolo Giaccone,et al.  Randomized scheduling algorithms for high-aggregate bandwidth switches , 2003, IEEE J. Sel. Areas Commun..

[6]  Mark J. Karol,et al.  Queueing in high-performance packet switching , 1988, IEEE J. Sel. Areas Commun..

[7]  Shivendra S. Panwar,et al.  The dual round robin matching switch with exhaustive service , 2002, Workshop on High Performance Switching and Routing, Merging Optical and IP Technologie.

[8]  Nick McKeown,et al.  The iSLIP scheduling algorithm for input-queued switches , 1999, TNET.

[9]  Andrea Bianco,et al.  Frame-based matching algorithms for input-queued switches , 2002, Workshop on High Performance Switching and Routing, Merging Optical and IP Technologie.

[10]  Eiji Oki,et al.  PMM: a pipelined maximal-sized matching scheduling approach for input-buffered switches , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[11]  Thomas E. Anderson,et al.  High speed switch scheduling for local area networks , 1992, ASPLOS V.

[12]  Kiseon Kim,et al.  A packet-based scheduling algorithm for high-speed switches , 2001, Proceedings of IEEE Region 10 International Conference on Electrical and Electronic Technology. TENCON 2001 (Cat. No.01CH37239).

[13]  Cheng-Shang Chang,et al.  Load balanced Birkhoff-von Neumann switches , 2001, 2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552).

[14]  Nick McKeown,et al.  A Starvation-free Algorithm For Achieving 100% Throughput in an Input- Queued Switch , 1999 .

[15]  Leandros Tassiulas,et al.  Linear complexity algorithms for maximum throughput in radio networks and input queued switches , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[16]  Nick McKeown,et al.  Scheduling algorithms for input-queued cell switches , 1996 .

[17]  Roberto Rojas-Cessa,et al.  Captured-frame matching schemes for scalable input-queued packet switches , 2007, Comput. Commun..

[18]  Xuefei Chen,et al.  Fixed-length switching vs. variable-length switching in input-queued IP switches , 2004, 2004 IEEE International Workshop on IP Operations and Management.

[19]  Roberto Rojas-Cessa,et al.  Captured-frame eligibility and round-robin matching for input-queued packet switches , 2004, IEEE Communications Letters.