High-speed switch scheduling for local-area networks
ACM Transactions on Computer Systems (TOCS)
Consistent overhead Byte stuffing
IEEE/ACM Transactions on Networking (TON)
Packet-mode scheduling in input-queued cell-based switches
IEEE/ACM Transactions on Networking (TON)
Tiny Tera: A Packet Switch Core
IEEE Micro
Scaling internet routers using optics
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Design and Implementation of a 320 Gb/s Switch Fabric
ICCNMC '03 Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing
Scheduling algorithms for optical packet fabrics
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
Variable-size IP packets are generally segmented into fixed-size cells for switching and scheduling in scalable input queueing switches. While switch bandwidth loss occurs when packets' sizes are not integral times of the cell size, and the speedup of at least two is required to achieve full line rate. This paper proposes a framing approach called Bit Map Packet Framing (BMPF) to merge and segment IP packets efficiently. In BMPF, the partially filled cell can carry some bytes from the following packet. Thus switch bandwidth loss is avoided and the required speedup is greatly lowered to 1.17 . BMPF is superior to other conventional framing methods, such as PPP, HDLC and COBS. Furthermore, BMPF can be also deployed to merge IP packets in optical packet switches.