Concatenating packets in variable-length input-queued packet switches with cell-based and packet-based scheduling

被引:0
|
作者
Al-Saber, Nabeel A. [1 ]
Oberoi, Saurabh [1 ]
Pedasanaganti, Taraka [1 ]
Rojas-Cessa, Roberto [1 ]
Ziavras, Sotirios G. [1 ]
机构
[1] New Jersey Inst Technol, Dept Elect & Comp Engn, Newark, NJ 07102 USA
关键词
packet scheduling; input-queued switch; variable length packet; cell switching; packet-based scheduling; packet concatenation;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
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-lenght 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.
引用
收藏
页码:155 / 159
页数:5
相关论文
共 50 条
  • [31] Module matching schemes for input-queued Clos-network packet switches
    Lin, Chuan-Bi
    Rojas-Cessa, Roberto
    IEEE COMMUNICATIONS LETTERS, 2007, 11 (02) : 194 - 196
  • [32] A parallel packet switch supporting variable-length packets
    Zhong, HS
    Xu, D
    Zhu, ZY
    2005 INTERNATIONAL CONFERENCE ON COMMUNICATIONS, CIRCUITS AND SYSTEMS, VOLS 1 AND 2, PROCEEDINGS: VOL 1: COMMUNICATION THEORY AND SYSTEMS, 2005, : 613 - 617
  • [33] Captured-frame matching schemes for scalable input-queued packet switches
    Rojas-Cessa, Roberto
    Lin, Chuan-Bi
    COMPUTER COMMUNICATIONS, 2007, 30 (10) : 2149 - 2161
  • [34] PERFORMANCE COMPARISON OF CELL-BASED AND PACKET-BASED SWITCHING SCHEMES FOR SHARED MEMORY SWITCHES
    Xi Kang Ge Ning Feng Chongxi(Department of Electronic Engineering
    Journal of Electronics(China), 2004, (01) : 55 - 63
  • [35] PERFORMANCE COMPARISON OF CELL-BASED AND PACKET-BASED SWITCHING SCHEMES FOR SHARED MEMORY SWITCHES
    Xi Kang Ge Ning Feng ChongxiDepartment of Electronic Engineering Tsinghua University Beijing
    Journal of Electronics, 2004, (01) : 55 - 63
  • [36] Variable-length packet scheduling algorithm PDMCRR
    National Digital Switching System Eng. and Technology R and D Center, Zhengzhou 450002, China
    不详
    Xi Tong Cheng Yu Dian Zi Ji Shu/Syst Eng Electron, 2006, 2 (293-296):
  • [37] Traffic Classification and Packet Scheduling Strategy with Deadline Constraints for Input-Queued Switches in Time-Sensitive Networking
    Zheng, Ling
    Wei, Guodong
    Zhang, Keyao
    Chu, Hongyun
    ELECTRONICS, 2024, 13 (03)
  • [38] A packet-based scheduling algorithm for high-speed switches
    Kim, H
    Son, J
    Kim, K
    IEEE REGION 10 INTERNATIONAL CONFERENCE ON ELECTRICAL AND ELECTRONIC TECHNOLOGY, VOLS 1 AND 2, 2001, : 117 - 121
  • [39] Packet scheduling in input - queued switches with a speedup of less than two
    Bauer, C
    ICON 2003: 11TH IEEE INTERNATIONAL CONFERENCE ON NETWORKS, 2003, : 431 - 436
  • [40] Learning-automata-based scheduling algorithms for input-queued ATM switches
    Papadimitriou, GI
    Pomportsis, AS
    NEUROCOMPUTING, 2000, 31 (1-4) : 191 - 195