Isaac Keslassy

Orcid: 0000-0001-6103-6910

Affiliations:
  • Technion - Israel Institute of Technology, Haifa, Israel


According to our database1, Isaac Keslassy authored at least 88 papers between 2001 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
CloudPilot: Flow acceleration in the cloud.
Comput. Networks, April, 2023

Dragonfly: In-Flight CCA Identification.
Proceedings of the IFIP Networking Conference, 2023

QueuePilot: Reviving Small Buffers With a Learned AQM Policy.
Proceedings of the IEEE INFOCOM 2023, 2023

Beyond the Ring: Quantized Heterogeneous Consistent Hashing.
Proceedings of the 31st IEEE International Conference on Network Protocols, 2023

2022
Memento: Making Sliding Windows Efficient for Heavy Hitters.
IEEE/ACM Trans. Netw., 2022

2021
AnchorHash: A Scalable Consistent Hash.
IEEE/ACM Trans. Netw., 2021

RADE: resource-efficient supervised anomaly detection using decision tree-based ensemble methods.
Mach. Learn., 2021

Load balancing with JET: just enough tracking for connection consistency.
Proceedings of the CoNEXT '21: The 17th International Conference on emerging Networking EXperiments and Technologies, Virtual Event, Munich, Germany, December 7, 2021

2020
LSQ: Load Balancing in Large-Scale Heterogeneous Systems With Multiple Dispatchers.
IEEE/ACM Trans. Netw., 2020

Sequential Zeroing: Online Heavy-Hitter Detection on Programmable Hardware.
Proceedings of the 2020 IFIP Networking Conference, 2020

2019
Replicate to the shortest queues.
Queueing Syst. Theory Appl., 2019

Links as a Service (LaaS): Guaranteed Tenant Isolation in the Shared Cloud.
IEEE J. Sel. Areas Commun., 2019

Subdiffusive Load Balancing in Time-Varying Queueing Systems.
Oper. Res., 2019

RADE: Resource-Efficient Supervised Anomaly Detection Using Decision Tree-Based Ensemble Methods.
CoRR, 2019

Sizing router buffers (redux).
Comput. Commun. Rev., 2019

2018
Pied Piper: Rethinking Internet Data Delivery.
CoRR, 2018

2017
Minimizing Delay in Network Function Virtualization with Shared Pipelines.
IEEE Trans. Parallel Distributed Syst., 2017

No Packet Left Behind: Avoiding Starvation in Dynamic Topologies.
IEEE/ACM Trans. Netw., 2017

Channel Probing in Opportunistic Communication Systems.
IEEE Trans. Inf. Theory, 2017

dRMT: Disaggregated Programmable Switching.
Proceedings of the Conference of the ACM Special Interest Group on Data Communication, 2017

Stable user-defined priorities.
Proceedings of the 2017 IEEE Conference on Computer Communications, 2017

Routing Keys.
Proceedings of the 25th IEEE Annual Symposium on High-Performance Interconnects, 2017

Clove: Congestion-Aware Load Balancing at the Virtual Edge.
Proceedings of the 13th International Conference on emerging Networking EXperiments and Technologies, 2017

2016
Scaling Multi-Core Network Processors without the Reordering Bottleneck.
IEEE Trans. Parallel Distributed Syst., 2016

Optimal In/Out TCAM Encodings of Ranges.
IEEE/ACM Trans. Netw., 2016

Optics in Data Centers: Adapting to Diverse Modern Workloads.
Proceedings of the 9th ACM International on Systems and Storage Conference, 2016

Virtualized Congestion Control.
Proceedings of the ACM SIGCOMM 2016 Conference, Florianopolis, Brazil, August 22-26, 2016, 2016

CLOVE: How I learned to stop worrying about the core and love the edge.
Proceedings of the 15th ACM Workshop on Hot Topics in Networks, 2016

Composite-Path Switching.
Proceedings of the 12th International on Conference on emerging Networking EXperiments and Technologies, 2016

2015
On the Capacity of Bufferless Networks-on-Chip.
IEEE Trans. Parallel Distributed Syst., 2015

Maximizing the Throughput of Hash Tables in Network Devices with Combined SRAM/DRAM Memory.
IEEE Trans. Parallel Distributed Syst., 2015

The Bloom Paradox: When Not to Use a Bloom Filter.
IEEE/ACM Trans. Netw., 2015

Links as a Service (LaaS): Feeling Alone in the Shared Cloud.
CoRR, 2015

Tapping into the router's unutilized processing power.
Proceedings of the 2015 IEEE Conference on Computer Communications, 2015

2014
The Variable-Increment Counting Bloom Filter.
IEEE/ACM Trans. Netw., 2014

The Switch Reordering Contagion: Preventing a Few Late Packets from Ruining the Whole Party.
IEEE Trans. Computers, 2014

Distributed Adaptive Routing Convergence to Non-Blocking DCN Routing Assignments.
IEEE J. Sel. Areas Commun., 2014

Compressing Forwarding Tables for Datacenter Scalability.
IEEE J. Sel. Areas Commun., 2014

Quasi Fat Trees for HPC Clouds and Their Fault-Resilient Closed-Form Routing.
Proceedings of the 22nd IEEE Annual Symposium on High-Performance Interconnects, 2014

SAL: Scaling data centers using Smart Address Learning.
Proceedings of the 10th International Conference on Network and Service Management, 2014

2013
Exact Worst Case TCAM Rule Expansion.
IEEE Trans. Computers, 2013

Optimal Resource Allocation with MultiAmdahl.
Computer, 2013

Access-efficient Balanced Bloom Filters.
Comput. Commun., 2013

Compression for fixed-width memories.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Channel probing in communication systems: Myopic policies are not always optimal.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Compressing forwarding tables.
Proceedings of the IEEE INFOCOM 2013, Turin, Italy, April 14-19, 2013, 2013

On finding an optimal TCAM encoding scheme for packet classification.
Proceedings of the IEEE INFOCOM 2013, Turin, Italy, April 14-19, 2013, 2013

Palette: Distributing tables in software-defined networks.
Proceedings of the IEEE INFOCOM 2013, Turin, Italy, April 14-19, 2013, 2013

Minimizing Delay in Shared Pipelines.
Proceedings of the IEEE 21st Annual Symposium on High-Performance Interconnects, 2013

2012
Providing performance guarantees in multipass network processors.
IEEE/ACM Trans. Netw., 2012

A switch-based approach to throughput collapse and starvation in data centers.
Comput. Networks, 2012

Hash tables with finite buckets are less resistant to deletions.
Comput. Networks, 2012

MultiAmdahl: How Should I Divide My Heterogenous Chip?
IEEE Comput. Archit. Lett., 2012

Estimators also need shared values to grow together.
Proceedings of the IEEE INFOCOM 2012, Orlando, FL, USA, March 25-30, 2012, 2012

Distributed adaptive routing for big-data applications running on data center networks.
Proceedings of the Symposium on Architecture for Networking and Communications Systems, 2012

2011
Static timing analysis for modeling QoS in networks-on-chip.
J. Parallel Distributed Comput., 2011

Multi-Amdahl: Optimal Resource Sharing with Multiple Program Execution Segments
CoRR, 2011

Modeling the interactions of congestion control and switch scheduling.
Comput. Networks, 2011

2010
The Concurrent Matching Switch Architecture.
IEEE/ACM Trans. Netw., 2010

Statistical Approach to Networks-on-Chip.
IEEE Trans. Computers, 2010

Packet-Mode Emulation of Output-Queued Switches.
IEEE Trans. Computers, 2010

Maximum Bipartite Matching Size And Application to Cuckoo Hashing
CoRR, 2010

A switch-based approach to throughput collapse and starvation in data centers.
Proceedings of the 18th International Workshop on Quality of Service, 2010

On the code length of TCAM coding schemes.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Worst-Case TCAM Rule Expansion.
Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

2009
The interleaved matching switch architecture.
IEEE Trans. Commun., 2009

Small-buffer networks.
Comput. Networks, 2009

Packet-level static timing analysis for NoCs.
Proceedings of the Third International Symposium on Networks-on-Chips, 2009

Optimal Fast Hashing.
Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

The Crosspoint-Queued Switch.
Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

The Capacity Allocation Paradox.
Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

2008
Statistical Approach to NoC Design.
Proceedings of the Second International Symposium on Networks-on-Chips, 2008

Modeling TCP in Small-Buffer Networks.
Proceedings of the NETWORKING 2008, Ad Hoc and Sensor Networks, Wireless Networks, 2008

2007
Fundamental Complexity of Optical Systems.
Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

Optimal-Complexity Optical Router.
Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

Frame-aggregated concurrent matching switch.
Proceedings of the 2007 ACM/IEEE Symposium on Architecture for Networking and Communications Systems, 2007

2005
On guaranteed smooth scheduling for input-queued switches.
IEEE/ACM Trans. Netw., 2005

Using Hardware to Configure a Load-Balanced Switch.
IEEE Micro, 2005

Optimal load-balancing.
Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005

A Scalable Switch for Service Guarantees.
Proceedings of the 13th Annual IEEE Symposium on High Performance Interconnects (HOTIC 2005), 2005

2004
Sizing router buffers.
Proceedings of the ACM SIGCOMM 2004 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, August 30, 2004

A Load-Balanced Switch with an Arbitrary Number of Linecards.
Proceedings of the Proceedings IEEE INFOCOM 2004, 2004

Designing packet buffers with statistical guarantees.
Proceedings of the 12th Annual IEEE Symposium on High Performance Interconnects, 2004

Configuring a load-balanced switch in hardware.
Proceedings of the 12th Annual IEEE Symposium on High Performance Interconnects, 2004

2003
Maximum size matching is unstable for any packet switch.
IEEE Commun. Lett., 2003

Scaling internet routers using optics.
Proceedings of the ACM SIGCOMM 2003 Conference on Applications, 2003

2002
Maintaining Packet Order In Two-stage Switches.
Proceedings of the Proceedings IEEE INFOCOM 2002, 2002

2001
Classification of compound images based on transform coefficient likelihood.
Proceedings of the 2001 International Conference on Image Processing, 2001


  Loading...