Követés
Isaac Keslassy
Isaac Keslassy
Technion
E-mail megerősítve itt: technion.ac.il - Kezdőlap
Cím
Hivatkozott rá
Hivatkozott rá
Év
Sizing router buffers
G Appenzeller, I Keslassy, N McKeown
ACM SIGCOMM Computer Communication Review 34 (4), 281-292, 2004
11602004
Scaling internet routers using optics
I Keslassy, ST Chuang, K Yu, D Miller, M Horowitz, O Solgaard, ...
ACM SIGCOMM (2003 conference on Applications, technologies, architectures …, 2003
3382003
Palette: Distributing tables in software-defined networks
Y Kanizo, D Hay, I Keslassy
2013 Proceedings IEEE INFOCOM, 545-549, 2013
3052013
dRMT: Disaggregated programmable switching
S Chole, A Fingerhut, S Ma, A Sivaraman, S Vargaftik, A Berger, ...
ACM SIGCOMM (Conference of the ACM Special Interest Group on Data …, 2017
2022017
Maintaining packet order in two-stage switches
I Keslassy, N McKeown
IEEE INFOCOM (Twenty-First Annual Joint Conference of the IEEE Computer and …, 2002
1842002
The variable-increment counting Bloom filter
O Rottenstreich, Y Kanizo, I Keslassy
IEEE/ACM Transactions on Networking 22 (4), 1092-1105, 2014
1652014
Clove: Congestion-aware load balancing at the virtual edge
N Katta, A Ghag, M Hira, I Keslassy, A Bergman, C Kim, J Rexford
ACM CoNEXT, 323-335, 2017
1292017
Virtualized congestion control
B Cronkite-Ratcliff, A Bergman, S Vargaftik, M Ravi, N McKeown, ...
Proceedings of the 2016 ACM SIGCOMM Conference, 230-243, 2016
1152016
On guaranteed smooth scheduling for input-queued switches
I Keslassy, M Kodialam, TV Lakshman, D Stiliadis
IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE …, 2003
1052003
Virtual tunnel endpoints for congestion-aware load balancing
M Hira, N Katta, I Keslassy, G Aditi
US Patent 10,320,681, 2019
1002019
Analysis of scheduling algorithms that provide 100% throughput in input-queued switches
I Keslassy, N McKeown
Proceedings of the Annual Allerton Conference on Communication Control and …, 2001
992001
The Bloom paradox: When not to use a Bloom filter
O Rottenstreich, I Keslassy
IEEE/ACM Transactions on Networking 23 (3), 703-716, 2014
942014
The crosspoint-queued switch
Y Kanizo, D Hay, I Keslassy
IEEE INFOCOM 2009, 729-737, 2009
832009
Optimal load-balancing
I Keslassy, CS Chang, N McKeown, DS Lee
IEEE INFOCOM (24th Annual Joint Conference of the IEEE Computer and …, 2005
832005
CLOVE: How I learned to stop worrying about the core and love the edge
N Katta, M Hira, A Ghag, C Kim, I Keslassy, J Rexford
ACM HotNets (15th Workshop on Hot Topics in Networks), 155-161, 2016
672016
The load-balanced router
I Keslassy
Stanford University, 2004
662004
Exact worst case TCAM rule expansion
O Rottenstreich, R Cohen, D Raz, I Keslassy
IEEE Transactions on Computers 62 (6), 1127-1140, 2012
632012
The concurrent matching switch architecture
B Lin, I Keslassy
IEEE/ACM Transactions on Networking 18 (4), 1330-1343, 2010
522010
Memento: Making sliding windows efficient for heavy hitters
RB Basat, G Einziger, I Keslassy, A Orda, S Vargaftik, E Waisbard
ACM CoNEXT, 254-266, 2018
512018
On finding an optimal TCAM encoding scheme for packet classification
O Rottenstreich, I Keslassy, A Hassidim, H Kaplan, E Porat
2013 Proceedings IEEE INFOCOM, 2049-2057, 2013
482013
A rendszer jelenleg nem tudja elvégezni a műveletet. Próbálkozzon újra később.
Cikkek 1–20