33 results on '"Keslassy, I."'
Search Results
2. Statistical approach to networks-on-chip
3. Exact Worst Case TCAM Rule Expansion
4. Optimal Fast Hashing
5. The Crosspoint-Queued Switch
6. The Capacity Allocation Paradox
7. Optimal-Complexity Optical Router
8. Fundamental Complexity of Optical Systems
9. The Concurrent Matching Switch Architecture
10. On guaranteed smooth scheduling for input-queued switches
11. Providing performance guarantees in multipass network processors.
12. Hash tables with finite buckets are less resistant to deletions.
13. Worst-Case TCAM Rule Expansion.
14. A switch-based approach to throughput collapse and starvation in data centers.
15. On the code length of TCAM coding schemes.
16. Modeling the interactions of congestion control and switch scheduling.
17. Statistical Approach to NoC Design.
18. A scalable switch for service guarantees.
19. Designing packet buffers with statistical guarantees.
20. Configuring a load-balanced switch in hardware.
21. Scheduling schemes for delay graphs with applications to optical packet networks.
22. Maximum size matching is unstable for any packet switch.
23. A Scalable Switch for Service Guarantees
24. Scheduling schemes for delay graphs with applications to optical packet networks
25. Classification of compound images based on transform coefficient likelihood
26. Designing packet buffers with statistical guarantees
27. Maintaining packet order in two-stage switches
28. Packet-level static timing analysis for NoCs.
29. Optimal load-balancing.
30. A load-balanced switch with an arbitrary number of linecards.
31. On guaranteed smooth scheduling for input-queued switches.
32. Maintaining packet order in two-stage switches.
33. Classification of compound images based on transform coefficient likelihood.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.