IEEE/ACM Transactions on Networking (TON)
The iSLIP scheduling algorithm for input-queued switches
IEEE/ACM Transactions on Networking (TON)
Packet reordering is not pathological network behavior
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
Preferential Treatment of Acknowledgment Packets in a Differentiated Services Network
IWQoS '01 Proceedings of the 9th International Workshop on Quality of Service
Variability in TCP round-trip times
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Probability, Statistics, and Queueing Theory with Computer Science Applications
Probability, Statistics, and Queueing Theory with Computer Science Applications
SPF: to improve the performance of packet-mode scheduling
Computer Communications
Saturn: a terabit packet switch using dual round robin
IEEE Communications Magazine
Transport-aware IP routers: a built-in protection mechanism to counter DDoS attacks
IEEE Transactions on Parallel and Distributed Systems
Wide-area Internet traffic patterns and characteristics
IEEE Network: The Magazine of Global Internetworking
Packet-level traffic measurements from the Sprint IP backbone
IEEE Network: The Magazine of Global Internetworking
Size-based scheduling to improve the performance of short TCP flows
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
Recent Internet traffic measurements show that 60% of the total packets are short packets, which include TCP acknowledgment and control segments. These short packets make a great impact on the performance of TCP. Unfortunately, short packets suffer from large delay due to serving long data packets in switches running in the packet mode, i.e. a packet is switched in its entirety. To optimize TCP performance, we apply a cross-layer approach to the design of switching architectures and scheduling algorithms. Specifically, we propose a preemptive packet-mode scheduling architecture and an algorithm called preemptive short packets first (P-SPF). Analysis and simulation results demonstrate that compared to existing packet-mode schedulers, P-SPF significantly reduces the waiting time for short packets while achieving a high overall throughput when the traffic load is heavy. Moreover, with a relatively low speedup, P-SPF performs better than existing packet-mode schedulers under any traffic load.