| Techniques for avoiding the high memory overheads found on many modern shared-memory multiproces-sors are of increasing importance in the development of high-performance multiprocessor protocol implementations. One such technique is processor-cache aanity scheduling, which can signiicantly lower packet latency and substantially increase protocol processing throughput 30]. In this paper, we ev...

In this work we investigate virtual network performance using Xen. We perform experiments using scheduling parameters and static CPU allocation. Results indicate that the forwarding packet rate of each virtual router can be controlled by adjusting CPU scheduling parameters.

Techniques for avoiding the high memory overheads found on many modern shared-memory multiprocessors are of increasing importance in the development of high-performance multiprocessor protocol implementations. One such technique is processorcache affinity scheduling, which can significantly lower packet latency and substantially increase protocol processing throughput [20]. In this paper, we ev...

An important problem for the Internet is how to provide a guaranteed quality of service to users, in contrast to the current “best-effort” service. A key aspect of this problem is how routers should share network capacity between different classes of traffic. This decision needs to be made for each incoming packet, and is known as the packet scheduling problem. A major challenge in packet sched...

Traditional approach to the minimum length scheduling problem ignores the packet level details of transmission protocols, meaning that a packet transmission can be divided into several data chunks each of which is transmitted at different rate due to the difference in the set of concurrently transmitting nodes. This solution requires including packet headers for each data chunk resulting in bot...

In this paper, we define a class of generalized Guaranteed Rate (GR) scheduling algorithms that includes algorithms which allocate variable rate to packets of a flow. We define work-conserving generalized Virtual Clock, Packet-byPacket Generalized Processor Sharing, and Self-Clocked Fair Queuing scheduling algorithms that can allocate variable rate to the packets of a flow. We also define sched...

The increasing energy consumption driven by striking growths in the number of users and data usage has placed cost reduction and energy efficiency at the forefront of system design. As a step towards incorporating more energy friendly mobile platforms in future networks, 3GPP LTE-Advanced has adopted Coordinated Multi-Point (CoMP) transmission/reception due to its ability to mitigate and/or coo...

We consider traffic scheduling in an N×N packet switch with an optical switch fabric, where the fabric requires a reconfiguration overhead to change its switch configurations. To provide 100% throughput with bounded packet delay, a speedup in the switch fabric is necessary to compensate for both the reconfiguration overhead and the inefficiency of the scheduling algorithm. In order to reduce th...