A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is
As the current generation of mobile smartphones become more powerful, they are being used to perform more resource intensive tasks making battery lifetime a major bottleneck. In this paper, we present a technique called dynamic AoV lookahead for reducing wireless interface power consumption upto 50% while playing a popular, yet resource intensive, mobile multiplayer games.doi:10.1109/infcom.2012.6195687 dblp:conf/infocom/ThirugnanamASKABC12 fatcat:hklcvwvatbhurotkxc2engzs6a
Packet schedulers traditionally focus on the prioritized transmission of packets. Scheduling is often realized through coarse-grained queue-level priorities, as in today's switches, or through fine-grained packet-level priorities, as in recent proposals such as PIFO. Unfortunately, fixed packet priorities determined when a packet is received by the traffic manager are not sufficient to support a broad class of scheduling algorithms that require the priorities of packets to change as a functiondblp:conf/nsdi/SharmaZLKKKS20 fatcat:bclqmq5iarhbxhlqt5mrh55nk4
more »... f the time it has spent inside the network. In this paper, we revisit the Calendar Queue abstraction and show that it is an appropriate fit for scheduling algorithms that not only require prioritization but also perform dynamic escalation of packet priorities. We show that the calendar queue abstraction can be realized using either dataplane primitives or control-plane commands that dynamically modify the scheduling status of queues. Further, when paired with programmable switch pipelines, we can realize programmable calendar queues that can emulate a diverse set of scheduling policies. We demonstrate the power of this abstraction using three case studies that implement variants of LSTF, Fair Queueing, and pFabric in order to provide stronger delay guarantees, burst-friendly fairness, and starvation-free prioritization of short flows, respectively. We evaluate the benefits associated with these scheduling policies using both a custom simulator and a small-scale testbed.
For each pixel, we compute its brightness as a function of the pixel's Red (R), Blue (B), and Green (G) colour values. This is a common calculation, shown in Equation 3.7, used in image processing. ...doi:10.1145/1999995.2000002 dblp:conf/mobisys/AnandTSKACB11 fatcat:wconpfkwevdini6vaqhhndmpgi
Proceedings of the ACM International Workshop on Security in Software Defined Networks & Network Function Virtualization - SDN-NFVSec '17
A high-level architecture of the testbed is shown in 1 x 1 G 2-4 x 1 G 10 G 160 G 160 G 10 G 10 G 40 G 10 G 10 G 10 G 10 G 10 G 10 G 10 G 10 G 10 G 10 G 40 G 20 G 20 G ... Control Switch Expt Switch SDN Switch 2 x 1 G 2 x 10 G 1 x 1 G 2 x 1 G 2 x 10 G 1 x 1 G 2 x 10 G 2 x 40 G 1 x 10 G 2 x 10 G 2 x 40 G 1 x 10 G 4 x 40 G 2 x 10 G Figure 2: Architecture ...fatcat:dvotvxre7vcztflaeo3blhlsne
For instance, suppose 15KHz and 15.05KHz are two consecutive frequencies in F , then G is 50Hz. 4. ... Guard band,G: When two frequencies that are adjacent to each other are transmitted, interference can result in ambiguity at the receiver. ...doi:10.1145/2426656.2426673 dblp:conf/sensys/KannanSCAP12 fatcat:xtcjjsajejfobio5azdeyzk6cy