530 search results - page 14 / 106 » Universal randomized switching |
104
click to vote
QUESTA
2002
15 years 1 months ago
2002
Two random traffic streams are competing for the service time of a single server (multiplexer). The streams form two queues, primary (queue 1) and secondary (queue 0). The primary ...
74
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We consider a dynamic server control problem for two parallel queues with randomly varying connectivity and server switchover time between the queues. At each time slot the server...
123
click to vote
ALENEX
2010
15 years 3 months ago
2010
Previously [SODA'04] we devised the fastest known algorithm for 4-universal hashing. The hashing was based on small pre-computed 4-universal tables. This led to a five-fold i...
142
click to vote
FPGA
2000
ACM
15 years 5 months ago
2000
ACM
A method for evaluating and constructing sparse crossbars which are both area efficient and highly routable is presented. The evaluation method uses a network flow algorithm to ac...
INFOCOM
2002
IEEE
15 years 6 months ago
2002
IEEE
— High-aggregate bandwidth switches are those whose port count multiplied by the operating line rate is very high; for example, a 30 port switch operating at 40 Gbps or a 1000 po...