Partial List of Publications for Yehuda Afek

List of publication areas

  • Distributed Computing
  • Networking
  • Self-Stabilization
  • Patents
  • NANOG/DDoS presentations
  • Distributed Computing

  • A King in every two consecutive tournaments Yehuda Afek, Eli Gafni, and Nati Linial, March 2012.
  • Towards Consistency Oblivious Programming Yehuda Afek, Hillel Avni, and Nir Shavit, OPODIS. 2011.
  • Fast and Scalable Rendezvousing (BEST STUDENT PAPER) Yehuda Afek, Michael Hakimi, Adam Morrison, Proceedings 25th International Symposium on Distributed Computing (DISC'11)}, Rome, Italy, 20-22 Sep. 2011.
  • Scalable Concurrent Search Tree Using Lazy Splaying Yehuda Afek, Boris Korenfeld, Adam Morrison, To be submitted. Version: May 2011.
  • Oblivious collaboration. Yehuda Afek, Yakov Babichenko, Uriel Feige, Eli Gafni, Nati Linial, Benny Sudakov. Proceedings 25th International Symposium on Distributed Computing (DISC'11)}, Rome, Italy, 20-22 Sep. 2011.
  • Beeping a Maximal Independent Set, Afek Y., Alon N., Bar-Joseph Z., Cornejo A., Haeupler B., and Kuhn F. Proceedings 25th International Symposium on Distributed Computing (DISC'11)}, Rome, Italy, 20-22 Sep. 2011.
  • A biological solution to a fundamental distributed computing problem Yehuda Afek, Noga Alon, Omer Barad, Eran Hornstein, Naama Barkai, Ziv Bar-Joseph, Science, 331(6014):183-5, 2011 Supporting Online Material.
  • From Bounded to Unbounded Concurrency Objects and Back. Yehuda Afek, Adam Morrison, Guy Wertheim, PODC 2011: Proceedings of the thirties annual ACM symposium on Principles of distributed computing, San-Jose, California, June 2011.
  • Cache Index Aware Memory Allocation. Yehuda Afek, Dave Dice, Adam Morrison, ISMM 2011: Proceedings of the International Symposium on Memory Management 2011, San-Jose, California, June 4-5, 2011.
  • Coping with Context Switches in Lock-based Software Transactional Memory. Yehuda Afek, Yoav Cohen, Adam Morrison, SYSTOR 2011: 11 The 4th Annual International Systems and Storage Conference May 30 - June 1, 2011, Haifa.
  • Quasi-Linearizability: Relaxed Consistency for Improved Concurrency. (slides) Yehuda Afek, Guy Korland, Eytan Yanovsky, OPODIS 2010: Principles of Distributed Systems, 14th International Conference: Tozeur Tunisia. Proceedings Springer, LNCS: 395-410.
  • Efficient Lock Free Privatization. Yehuda Afek, Hillel Avni, Dave Dice, Nir Shavit, OPODIS 2010: Principles of Distributed Systems, 14th International Conference: Tozeur Tunisia. Proceedings Springer, LNCS: 333-347.
  • Scalable Producer-Consumer Pools Based on Elimination-Diffraction Trees. Yehuda Afek, Guy Korland, Maria Natanzon, Nir Shavit, Euro-Par 2010: Ischia, Naples, Italy, Aug/31-Sep/3 2010: 151-162
  • Lowering STM Overhead with Static Analysis. Yehuda Afek, Guy Korland, Arie Zilberstein, LCPC 2010: The 23rd International Workshop on Languages and Compilers for Parallel Computing Proceedings Springer-Verlag (LNCS), October 7 - 9, 2010, Rice University, Houston, Texas, USA
  • Brief announcement: View transactions: Transactional model with relaxed consistency checks. Yehuda Afek, Adam Morrison, Moran Tzafrir, PODC 2010, Proceedings of the twenty-ninth annual ACM symposium on Principles of distributed computing 2010, Zurich, Switzerland, July 2010, 65-66
  • Tight Group Renaming on Groups of Size g Is Equivalent to g-Consensus. Yehuda Afek, Eli Gafni, Opher Lieber: DISC 2009: 111-126
  • Interrupting Snapshots and the Java Size() Method. Yehuda Afek, Nir Shavit, Moran Tzafrir: DISC 2009: 78-92
  • Group Renaming. Yehuda Afek, Iftah Gamzu, Irit Levy, Michael Merritt, Gadi Taubenfeld OPODIS 2008: 58-72
  • Failure detectors in loosely named systems. Yehuda Afek, Israel Nir, PODC-08: 65-74
  • Common2 extended to stacks and unbounded concurrency. Yehuda Afek, Eli Gafni, Adam Morrison: Distributed Computing 20(4): 239-252 (2007) (PODC-06)
  • Efficient adaptive collect algorithms. Yehuda Afek, Yaron De Levie: Distributed Computing 20(3): 221-238 (2007) (DISC-05 Best Paper award)
  • Less Is More: Consensus Gaps Between Restricted and Unrestricted Objects. Yehuda Afek, Eran Shalom: DISC-06: 209-223
  • Simultaneous Consensus Tasks: A Tighter Characterization of Set-Consensus. Yehuda Afek, Eli Gafni, Sergio Rajsbaum, Michel Raynal, Corentin Travers: Distributed Computing (Accepted) ICDCN 2006: 331-341
  • Long lived adaptive splitter and applications. Yehuda Afek, Gideon Stupp, Dan Touitou: Distributed Computing 15(2): 67-86 (2002)
  • Long-lived and adaptive atomic snapshot and immediate snapshot Yehuda Afek, Gideon Stupp, Dan Touitou: PODC-2000, 71-80 Aug. 2000.
  • Bounds in the shared memory requirements for Long-Lived & Adaptive objects by Y. Afek, P. Boxer, and D. Touitou PODC-2000, 81-89 Aug. 2000.
  • Long-lived Adaptive Collect with Applications by Y. Afek, G. Stupp, and D. Touitou FOCS-99, October 1999.
  • Long-Lived Renaming Made Adaptive by Y. Afek, H. Attiya, A. Fouren, G. Stupp, and D. Touitou 18 PODC, March 1999.
  • The Instancy of Snapshots and Commuting Objects by Y. Afek and E. Weisberger, Journal Algorithms 30(1): 68-105 (1999)
  • Adaptive Long-Lived Renaming Using bounded Memory by Y. Afek, H. Attiya, A. Fouren, G. Stupp, and D. Touitou Manuscript. March 1999
  • Fast, Wait-Free (2k-1)-Renaming. Yehuda Afek, Michael Merritt: PODC, 105-112 Proc. 18th ACM Symposium on Principles of Distributed Computing, 1999.
  • Adaptive algorithms utilyzing collect and snapshot by Y. Afek, E. Gafni, and M. Merritt Submitted for journal publication.
  • Optimal Time-Space Tradeoff for Shared Memory Leader Election. Yehuda Afek, Gideon Stupp: Journal Algorithms 25(1): 95-117 (1997)
  • Slide-The Key to Polynomial End-to-End Communication. Yehuda Afek, Baruch Awerbuch, Eli Gafni, Yishay Mansour, Adi Ros.n, Nir Shavit, J. Algorithms 22(1): 158-186 (1997) Based on The Slide Mechanism with Applications in Dynamic Networks by Y. Afek, E. Gafni, and A. Rosen, In (PODC-92), Pages 35-46, Vancouver, Canada.
  • Disentangling Multi-object Operations by Y. Afek, M. Merritt, G. Taubenfeld, and D. Touitou PODC-97, 111-120.
  • The Power of Multi-objects by Y. Afek, M. Merritt, and G. Taubenfeld, PODC-96, 213-222.
  • Wait-free Made Fast. by Yehuda Afek Dalia Dauber and Dan Touitou, In STOC-95.
  • Delimiting the power of bounded size synchronization objects. , by Yehuda Afek and Gideon Stupp, In PODC-94, 42-51.
  • Synchronization power depends on the register size. , by Yehuda Afek and Gideon Stupp, In FOCS-93 , 196-205.
  • The Bit Complexity of the Predecessor Problem. , by Yehuda Afek, Menashe Cohen, and Eyal Haalman, Information Processing Letters 63 (1997) 109-112.
  • Benign Failure Models for Shared Memory by Y. Afek, M. Merritt, and G. Taubenfeld, WDAG-93 (DISC), Lausanne, Switzerland.
  • A completeness theorem for a class of synchronization objects by Y. Afek, E. Weisberger, and H. Weisman, PODC-93, 159-170, Ithaca, New-York.
  • On the complexity of global computation in the presence of link failures: The general case by Y. Afek and D. Hendler, In Distributed Computing Journal, 8, 115-120, 1995.
  • Sparser: A paradigm for running distributed algorithms by Y. Afek and M. Ricklin, In Journal of Algorithms, volume 14, Pg. 316-328, 1993. (WDAG, DISC-92, 1-10)
  • Distributed Agorithms for Unidirectional Networks, by Y. Afek and E. Gafni In Siam J. on Computing, 23:6 (1994), 1152-1178. (PODC-84)
  • Time and Message bounds for Election in Synchronous and Asynchronous Complete Networks by Y. Afek and E. Gafni Siam J. on Computing, 20:2 (1991), 376-394. (PODC-85)
  • Local Management of a Global Resource in a Communication Network, Y. Afek, B. Awerbuch, S. Plotkin, M. Saks, In JACM 43:1 (1996), 1-19. (FOCS-87)
  • Wait-Free Test and Set by Y. Afek, E. Gafni, Tromp, and P. Vitanyi, WDAG-92 (DISC) Haifa, Israel.
  • Computing with Faulty Shared Memory by Y. Afek, D. Greenberg, M. Merritt, and G. Taubenfeld, JACM 42(6): 1231-1274 (1995) Preliminary version (PODC-95), 47-58, Vancouver, Canada.
  • Reliable Communication Over Unreliable Channels. Yehuda Afek, Hagit Attiya, Alan Fekete, Michael J. Fischer, Nancy A. Lynch, Yishay Mansour, Da-Wei Wang, Lenore D. Zuck: JACM 41(6): 1267-1297 (1994)
  • A Bounded First-In, First-Enabled Solution to the L-Exclusion Problem by Y. Afek, D. Dolev, E. Gafni, M. Merritt, and N. Shavit, In ACM Trans. on Programming Languages ans Systems, (TOPLAS) 16:3 939-953, 1994. Also (WDAG, DISC-90) , 422-431.
  • Atomic Snapshots by Y. Afek, H. Attiya, D. Dolev, E. Gafni, M. Merritt, and N. Shavit, In JACM 40:4, 873-890, 1993 (Also PODC90).
  • Bootstrap Network Resynchronization: An efficient Technique for End-to-end Communication Y. Afek, and E. Gafni (PODC 91), 295-307, Montreal, Canada.
  • Upper and Lower Bounds for Routing Schemes in Dynamic Networks Y. Afek, E. Gafni, and M. Ricklin, In Proc. of 30'th IEEE Annual Symposium on Foundations of Computer Science (FOCS-89), 370-375, October 1989.
  • Elections in Anonymous Networks Y. Afek and Y. Matias Info. and Computation Journal 113(2), 312-330, 1994. (WDAG-89: 183-194)
  • The Power of Multimedia: Combining Point-to-Point and Multiaccess Networks Yehuda Afek, Gad M. Landau, Baruch Schieber, Moti Yung: Inf. Comput. 84(1): 97-118 (1990)
  • Lazy Caching Y. Afek, G. M. Brown, and M. Merritt, In ACM Transactions on Programming Languages and Systems (ACM-TOPLAS), 15(1), 182-205, January 1993. Alos In 1st SPAA-89, Santa Fe, New Mexico, June 18-21.
  • End-to-End Communication in Unreliable Networks. Eli Gafni, Yehuda Afek In (PODC 88), 131-148
  • Applying Static Network Protocols to Dynamic Networks Yehuda Afek, Baruch Awerbuch, Eli Gafni: In FOCS 1987: 358-370
  • Detecting Global Termination Conditions in the Face of Uncertainty. Yehuda Afek, Michael E. Saks: (PODC 87), 109-124

    Networking

  • Efficient Processing of Multi-Connection Compressed Web Traffic, , by Yehuda Afek, Anat Bremler-Barr, Yaron Koral, Networking 2011, The 10th International Conferences on Networking. May 9 - 13, 2011, Valencia, Spain.
  • Improved BGP convergence via ghost flushing. , by Yehuda Afek, Anat Bremler-Barr, Shemer Schwarz, IEEE Journal on Selected Areas in Communications 22(10): 1933-1948 (2004)
  • Restoration by Path Concatenation: Fast Recovery of MPLS Paths , by Yehuda Afek, Anat Bremler-Barr, Haim Kaplan, Edith Cohen, and Michael Merritt. Distributed Computing 15(4): 273-283 (2002)
  • On the structure and application of BGP policy atoms. , by Yehuda Afek, Omer Ben-Shalom, Anat Bremler-Barr: ACM SIGCOMM Internet Measurement Workshop 2002: 209-214
  • Trainet: A new label switching scheme , by Yehuda Afek and, Anat Bremler-Barr INFOCOM-2000, 874-883.
  • Routing with a clue , by Yehuda Afek, Anat Bremler-Barr, and Sariel Har-Peled IEEE/ACM Trans. Netw. 9(6): 693-705 (2001) A preliminary version of this paper was presented in ACM SIGCOMM-99, Harvard University, Cambridge MA, (Aug, 1999).
  • Phantom: A Simple and Effective Flow Control Scheme , by Yehuda Afek, Yishay Mansour and Zvi Ostfeld COMPUTER NETWORS 2000, Elsevier. A preliminary version of this paper was presented in ACM SIGCOMM-96, Stanford University, CA, (Aug, 1996) 169-182.
  • Space Efficient Fair Queuing by Stochastic Memory Multiplexing , by Yehuda Afek, Yishay Mansour and Zvi Ostfeld Submitted for publication. Technical Report 322/97, Dept. of Computer Science, Tel-Aviv University, August 1997.
  • Dynamic Bandwidth Allocation Policies. , by Yehuda Afek, Menashe Cohen, Eyal Haalman, and Yishay Mansour, INFOCOM 1996.
  • A generic web-based network management application , by Yehuda Afek, and Yoram Cohen Proceedings of 7th IFIP//IEEE International Workshop on Distributed Systems Operations and Management (DSOM-96), Oct. 1996.
  • Remote Object Oriented Programming with Quality of Service or Java's RMI over ATM , by Yehuda Afek, Michael Merrit, and Gideon Stupp. MASCOT January 1996, Eilat, Israel.
  • Distributed Synchronization Protocols for SDH Networks , by Yehuda Afek, and Tal Lev. Manuscript, submitted for publication, January 1996, Israel.
  • Virtual-Credit: Efficient End-to-End Credit Based Flow Control , by Yehuda Afek, Yishay Mansour and Zvi Ostfeld Submitted for publication.
  • Convergence Complexity of Optimistic Rate Based Flow Control Algorithms , by Yehuda Afek, Yishay Mansour and Zvi Ostfeld, J. Algorithms 30(1): 106-143 (1999) A preliminary version of this paper was presented in The 28th Annual ACM Symposium on Theory of Computing (STOC) Philadelphia, PA (May, 1996), 89-98.
  • Self-Stabilization

  • Self-Stabilizing Unidirectional Network Algorithms by Power-Supply , by Yehuda Afek, and Anat Bremler Chicago Journal of Theoretical Computer Science . preliminary version of this paper was presented in Symposium on Discrete Algorithms (SODA) January 1997.
  • Local Stabilizer , by Y. Afek, S. Dolev J. Parallel Distrib. Comput. 62(5): 745-765 (2002), previous version , Proceedings of the 5th Israeli Symposium on Theory of Computing and Systems (ISTCS97), Bar-Ilan, Israel (June 1997) 74-84.
  • The Local Detection Paradigm and its Applications to Self-Stabilization by Y. Afek, S. Kutten, and M. Yung, In Springer-Verlag Proceedings, 4th International Workshop on Distributed Algorithms, Pages 15-28, Serra Alimini, Italy September 1990
  • Self-Stabilization Over Unreliable Communication Media by Yehuda Afek and Geoffrey M. Brown, Distributed Computing Journal, 7, 27-34, 1993.
  • Patents and Inventions

  • {1995} Shared Memory with Benign Failure Modes, US number: 5,430,868 (Yehuda Afek, M. Merritt and G. Taubenfeld).
  • {1998} Flow Control Algorithm for High Speed Networks, US number: 5,748,901 (Yehuda Afek, Y. Mansour and Z. Ostfeld).
  • {1999} Phantom Flow Control Method and Apparatus, US number: 5,956,322 (Yehuda Afek, Y. Mansour and Z. Ostfeld).
  • {1999} Space Efficient Fair Queuing by Stochastic Memory Multiplexing, US number: 5,956,340 (Yehuda Afek, Y. Mansour and Z. Ostfeld).
  • {1999} A Method for Fast Multi-Dimensional Packet Classification, filed May 1999 (Yehuda Afek, A. Bremler-Barr and S. Harpeled).
  • {1999} A Method for Routing with a Clue, filed in May 1999 (Yehuda Afek, A. Bremler-Barr and S. Harpeled).
  • {2001} Methods and apparatus for protecting against overload conditions on nodes of a distributed network (Yehuda Afek, A. Bremler-Barr, D. Touitou). Assignee: Wanwall Inc A Delaware Corporation (USPTO) Number: 20020083175
  • {2002} Weighted fair queuing-based methods and apparatus for protecting against overload conditions on nodes of a distributed network, (Yehuda Afek, A. Bremler-Barr, Keren Horvitz, Dan Touitou, Rafi Tzadikario). (USPTO) Number: 20030076848
  • {2001} Protecting against spoofed DNS messages, (Yehuda Afek, Guy Pazi, Dan Touitou, Alon Golan). (USPTO) Number: 6907525
  • {2001} Protecting against malicious traffic, (Yehuda Afek, Anat Bremler-Bar, Touitou Dan, Rafi Zadikario). (USPTO) Number: 20060212572
  • {2003} Method and device for filtering and analyzing communication traffic based on packet Afek Yehuda; Zadikario Rafi; Touitou Dan; Bremler Bar Anat (SIPO) Number: 200810080902
  • NANOG/DDoS presentations

  • NANOG-23 Conference Oakland, California, "Diversion and Sieving Techniques to Defeat DDoS", October 22, 2001.
  • RIPE-41 Conference Amsterdam 1/2002, DDOS Tutorial [PDF - 2.2MB], with Hank Nussbacher
  • NANOG-28 Conference Salt Lake City, Utah, "MPLS-Based Synchronous Traffic Shunt", June 3, 2003.
  • VLSI

  • Chips and Boards Through MOSIS. Yehuda Afek, Ronald F. Ayres, David Booth, Danny Cohen, Kathie Fry, Rick Gillespie, Joel Goldberg, Joe Green, David Hollenberg, George Lewicki, Terri Lewis, Lee Richardson, Barden Smith, Victoria Svoboda, Vance Tyree, Jasmin Witthoft, COMPCON-1985: 184-186