IEEE/ACM Transactions on Networking · 2008 · 25 citations · 23 references
BusinessComputer EngineeringComputer ScienceComputer NetworksQueuing TheorySchedulingPacket SwitchingQueueing NetworksQueueing ProcessesQueueing SystemsQueueing TheoryScheduling TheoryPacket SchedulingQueueing Network DesignQueueing Theory OptimizationSwitch SchedulingSwitching Algorithm DesignSwitching AlgorithmsSwitching ThroughputThroughput-aware Scheduling
We study the (generalized) packet switch scheduling problem, where service configurations are dynamically chosen in response to queue backlogs, so as to maximize the throughput without any knowledge of the long term traffic load. Service configurations and traffic traces are arbitrary.
23
<i>Manifolds, Tensor Analysis, and Applications</i>
Ralph Abraham, J. Marsden, Tudor S. Raţiu et al. · Physics Today · 1984 · 1.2K citations
Achieving 100% throughput in an input-queued switch
Nick McKeown, A. Mekkittikul, V. Anantharam et al. · IEEE Transactions on Communications · 1999 · 855 citations