Sciweavers

128 search results - page 1 / 26
» Network Coding for Speedup in Switches
Sort
View
CORR
2008
Springer
133views Education» more  CORR 2008»
13 years 5 months ago
Network Coding for Speedup in Switches
We present a graph theoretic upper bound on speedup needed to achieve 100% throughput in a multicast switch using network coding. By bounding speedup, we show the equivalence betwe...
MinJi Kim, Jay Kumar Sundararajan, Muriel Mé...
CCR
2006
122views more  CCR 2006»
13 years 5 months ago
Low complexity, stable scheduling algorithms for networks of input queued switches with no or very low speed-up
The delay and throughput characteristics of a packet switch depend mainly on the queueing scheme and the scheduling algorithm deployed at the switch. Early research on scheduling ...
Claus Bauer
INFOCOM
2007
IEEE
13 years 11 months ago
Network Coding in a Multicast Switch
— We consider the problem of serving multicast flows in a crossbar switch. We show that linear network coding across packets of a flow can sustain traffic patterns that cannot...
Jay Kumar Sundararajan, Muriel Médard, MinJ...
TON
2010
107views more  TON 2010»
12 years 11 months ago
Rate Quantization and the Speedup Required to Achieve 100% Throughput for Multicast Over Crossbar Switches
Abstract-- The problem of providing quality of service guarantees for multicast traffic over crossbar switches has received a limited attention, despite the popularity of its count...
Can Emre Koksal
SPAA
2006
ACM
13 years 11 months ago
Packet-mode emulation of output-queued switches
Most common network protocols (e.g., the Internet Protocol) work with variable size packets, whereas contemporary switches still operate with fixed size cells, which are easier t...
Hagit Attiya, David Hay, Isaac Keslassy