- The Capacity Allocation Paradox Asaf Baron, Ran Ginosar and Isaac Keslassy
- TECHNICAL REPORT TR09-01, COMNET, TECHNION, ISRAEL 1 Worst-Case TCAM Rule Expansion
- 0.00% 10.00% 20.00% 30.00% 40.00% 50.00% 60.00% 70.00% 80.00% End-to-EndlatencyofflowX-LX[ps]
- Optimal-Complexity Optical Router Hadas Kogan, Isaac Keslassy
- 1330 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 18, NO. 4, AUGUST 2010 The Concurrent Matching Switch Architecture
- Designing Packet Buffers with Statistical Guarantees Gireesh Shrimali, Isaac Keslassy, Nick McKeown
- Efficient router architectures should have predictable throughput and scalable
- TECHNICAL REPORT TR08-04, COMNET, TECHNION, ISRAEL 1 The Crosspoint-Queued Switch
- 496 IEEE COMMUNICATIONS LETTERS, VOL. 7, NO. 10, OCTOBER 2003 Maximum Size Matching is Unstable
- BENCHMARKING SPACEWIRE NETWORKS Session: Networks & Protocols
- A Load-Balanced Switch with an Arbitrary Number of Linecards
- TECHNICAL REPORT TR09-02, COMNET, TECHNION, ISRAEL 1 Energy-Constrained Balancing
- TECHNICAL REPORT TR11-03, COMNET, TECHNION, ISRAEL 1 Multi-Amdahl: Optimal Resource Sharing with
- Modeling the Interactions of Congestion Control and Switch Scheduling
- Packet-Mode Emulation of Output-Queued Switches
- Statistical Approach to Networks-on-Chip Itamar Cohen, Ori Rottenstreich, and Isaac Keslassy, Member, IEEE.
- Worst-Case TCAM Rule Expansion Ori Rottenstreich and Isaac Keslassy
- IRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES
- Statistical Approach to NoC Design (Extended Version) Itamar Cohen, Ori Rottenstreich and Isaac Keslassy
- Frame-Aggregated Concurrent Matching Switch University of California, San Diego,
- TECHNICAL REPORT TR06-01, COMNET, TECHNION, ISRAEL 1 Constructing an Optical Router
- The Concurrent Matching Switch Architecture Bill Lin Isaac Keslassy
- 1364 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 13, NO. 6, DECEMBER 2005 On Guaranteed Smooth Scheduling for
- On Guaranteed Smooth Scheduling For Input-Queued Switches I. Keslassy Murali Kodialam T. V. Lakshman Dimitrios Stiliadis
- Scheduling Schemes for Delay Graphs with Applications to Optical Packet Networks
- Faster Algorithms for Minimum-Energy Scheduling of Wireless Data Transmissions
- STANFORD HPNG TECHNICAL REPORT TR03-HPNG-080102 1 A Load-Balanced Switch with an Arbitrary
- THE LOAD-BALANCED ROUTER a dissertation
- On the Code Length of TCAM Coding Schemes Ori Rottenstreich and Isaac Keslassy
- TECHNICAL REPORT TR11-01, COMNET, TECHNION, ISRAEL 1 Redefining Switch Reordering
- STANFORD HPNG TECHNICAL REPORT TR03-HPNG-080101 1 Scaling Internet Routers Using Optics
- Abstract --High performance packet switches frequently use a centralized scheduler (also known as an arbiter) to determine the
- IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 57, NO. 12, DECEMBER 2009 1 The Interleaved Matching Switch Architecture
- Hash Tables With Finite Buckets Are Less Resistant to Deletions Yossi Kanizo
- Fundamental Complexity of Optical Systems Hadas Kogan, Isaac Keslassy
- A Scalable Switch for Service Guarantees Bill Lin Isaac Keslassy
- TECHNICAL REPORT TR10-02, COMNET, TECHNION, ISRAEL 1 Providing Performance Guarantees in
- A Switch-Based Approach to Throughput Collapse and Starvation in Data Centers
- Providing Performance Guarantees in Multipass Network Processors
- Static Timing Analysis for Modeling QoS in Networks Evgeni Krimera,
- Scaling Internet Routers Using Optics Isaac Keslassy, Shang-Tse Chuang, Kyoungsik Yu,
- Modeling the Interactions of Congestion Control and Switch Scheduling
- Technical Report TR11-02, Comnet, Technion, Israel Maximum Bipartite Matching Size
- TECHNICAL REPORT TR10-03, COMNET, TECHNION, ISRAEL 1 The Variable-Increment Counting Bloom Filter
- Statistical Approach to NoC Design Itamar Cohen, Ori Rottenstreich and Isaac Keslassy
- Optimal Load-Balancing Isaac Keslassy1 Cheng-Shang Chang2 Nick McKeown3 Duan-Shin Lee2
- Sizing Router Buffers Guido Appenzeller
- Sizing Router Buffers Stanford HPNG Technical Report TR04-HPNG-06-08-00
- STANFORD HPNG TECHNICAL REPORT TR03-HPNG-030100 1 Maximum Size Matching Is Unstable for Any
- This work was supported by a Wakerly Stanford Graduate Fellowship and by the Powell Foundation. Abstract --Internet routers frequently use a crossbar switch to interconnect linecards.
- TECHNICAL REPORT TR08-05, COMNET, TECHNION, ISRAEL 1 Optimal Fast Hashing
- TECHNICAL REPORT TR08-03, COMNET, TECHNION, ISRAEL 1 Modeling the Interactions of Congestion Control
- Modeling TCP in Small-Buffer Networks Mark Shifrin and Isaac Keslassy
- SPACEWIRE HOT MODULES Session: SpaceWire Networks and Protocols
- TECHNICAL REPORT TR10-01, COMNET, TECHNION, ISRAEL 1 Hash Tables With Finite Buckets
- TECHNICAL REPORT TR09-03, COMNET, TECHNION, ISRAEL 1 Optimal Dynamic Hash Tables
- Small-Buffer Networks Mark Shifrin, Isaac Keslassy
- TECHNICAL REPORT TR06-02, COMNET, TECHNION, ISRAEL 1 Building Optical Constructions
- TECHNICAL REPORT TR11-05, COMNET, TECHNION, ISRAEL 1 The Variable-Increment Counting Bloom Filter
- TECHNICAL REPORT TR11-04, COMNET, TECHNION, ISRAEL 1 Estimators Also Need Shared Values
- TECHNICAL REPORT TR11-06, COMNET, TECHNION, ISRAEL 1 The Bloom Paradox
- TECHNICAL REPORT TR11-07, COMNET, TECHNION, ISRAEL 1 Access-Efficient Balanced Bloom Filters
- IEEE COMPUTER ARCHITECTURE LETTERS 1 1. INTRODUCTION
- Providing Performance Guarantees in Multipass Network Processors
- The Variable-Increment Counting Bloom Filter Ori Rottenstreich
- The Bloom Paradox: When not to Use a Bloom Filter?
- Access-Efficient Balanced Bloom Filters Yossi Kanizo
- Estimators Also Need Shared Values to Grow Together
