default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHanoch Levy
Person information
- affiliation: Tel Aviv University, Blavatnik School of Computer Science, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c46]Anat Bremler-Barr, Michael Czeizler, Hanoch Levy, Jhonatan Tavori:
Exploiting Miscoordination of Microservices in Tandem for Effective DDoS Attacks. INFOCOM 2024: 231-240- 2023
- [j62]Jhonatan Tavori
, Hanoch Levy:
On the Convexity of the Effective Reproduction Number. J. Comput. Biol. 30(7): 783-795 (2023) - [c45]Jhonatan Tavori, Anat Bremler-Barr, Hanoch Levy:
The Cost of Retrying: Exploiting Retry-Mechanisms in Cloud Applications by DDoS Attacks. CoNEXT (Companion) 2023: 67-68 - [c44]Jhonatan Tavori, Hanoch Levy:
How to Attack and Congest a Network? Worst-Case Link-Targeted DDoS Attacks. CoNEXT (Companion) 2023: 69-70 - [c43]Jhonatan Tavori, Hanoch Levy:
How to Attack and Congest Delay-Sensitive Applications on the Cloud. INFOCOM 2023: 1-10 - [c42]Jhonatan Tavori, Hanoch Levy:
Resilience of Networks to Spreading Computer Viruses: Optimal Anti-Virus Deployment. NOMS 2023: 1-5 - 2022
- [j61]Gil Shapira, Hanoch Levy:
On fairness in polling systems. Ann. Oper. Res. 317(1): 253-285 (2022) - [j60]Jhonatan Tavori, Hanoch Levy:
Continual Versus Occasional Spreading In Networks: Modeling Spreading Thresholds In Epidemic Processes. SIGMETRICS Perform. Evaluation Rev. 49(2): 9-11 (2022) - [j59]Jhonatan Tavori, Hanoch Levy:
Queueing-Network Based Applications Under Worst-case Attacks. SIGMETRICS Perform. Evaluation Rev. 50(2): 15-17 (2022) - [c41]Jhonatan Tavori, Hanoch Levy:
Greedy and speedy: optimal vaccination strategies in multi-region heterogeneous networks. BCB 2022: 67:1 - [i3]Jhonatan Tavori, Hanoch Levy:
On The Convexity Of The Effective Reproduction Number. CoRR abs/2207.11802 (2022) - 2021
- [c40]Jhonatan Tavori, Hanoch Levy:
Tornadoes In The Cloud: Worst-Case Attacks on Distributed Resources Systems. INFOCOM 2021: 1-10 - [c39]Ran Levy, Hanoch Levy:
Call Admission and Assignment in Cellular Networks with Vehicular Relay Nodes. VTC Fall 2021: 1-5 - [i2]Jhonatan Tavori, Hanoch Levy:
Super-Spreaders Out, Super-Spreading In: The Effects of Infectiousness Heterogeneity and Lockdowns on Herd Immunity. CoRR abs/2101.09188 (2021) - 2020
- [j58]Eliran Sherzer, Hanoch Levy:
Resource allocation in the cloud with unreliable resources. Perform. Evaluation 137 (2020) - [j57]Nadav Lavi, Hanoch Levy:
Admit or preserve? Addressing server failures in cloud computing task management. Queueing Syst. Theory Appl. 94(3-4): 279-325 (2020) - [j56]Hanoch Levy, Jhonatan Tavori:
Worst Case Attacks on Distributed Resources Systems. SIGMETRICS Perform. Evaluation Rev. 48(2): 9-11 (2020) - [c38]Nadav Lavi, Eliran Sherzer, Hanoch Levy:
Deployment Planning in Vehicular Supported Cellular Networks. VALUETOOLS 2020: 64-71
2010 – 2019
- 2019
- [j55]Nadav Lavi, Hanoch Levy, Yuval Shavitt:
Cellular Networks With Vehicular Relay Nodes: Capacity, Coverage, and Scalability. IEEE Trans. Veh. Technol. 68(9): 9074-9087 (2019) - 2017
- [j54]Yuval Rochman, Hanoch Levy, Eli Brosh:
Dynamic placement of resources in cloud computing and network applications. Perform. Evaluation 115: 1-37 (2017) - [c37]Eliran Sherzer, Gail Gilboa-Freedman, Hanoch Levy:
Resource allocation in a cloud under virus attacks. VALUETOOLS 2017: 223-224 - [c36]Nadav Lavi, Hanoch Levy:
On the Value of Vehicular Relay Nodes in Cellular Networks. VTC Fall 2017: 1-5 - 2015
- [j53]Nadav Lavi, Hanoch Levy:
Admit or Reject? Preserve or Drop?: Operational Dilemmas upon Server Failures on the Cloud. SIGMETRICS Perform. Evaluation Rev. 43(3): 25-29 (2015) - 2014
- [j52]Udi Ben-Porat, Anat Bremler-Barr, Hanoch Levy:
Computer and network performance: Graduating from the "Age of Innocence". Comput. Networks 66: 68-81 (2014) - [j51]Yuval Rochman, Hanoch Levy, Eli Brosh:
Efficient resource placement in cloud computing and network applications. SIGMETRICS Perform. Evaluation Rev. 42(2): 49-51 (2014) - 2013
- [j50]Udi Ben-Porat, Anat Bremler-Barr, Hanoch Levy:
On the exploitation of CDF based wireless scheduling. Comput. Networks 57(10): 2193-2205 (2013) - [j49]Udi Ben-Porat, Anat Bremler-Barr, Hanoch Levy:
Vulnerability of Network Mechanisms to Sophisticated DDoS Attacks. IEEE Trans. Computers 62(5): 1031-1043 (2013) - [c35]Yuval Rochman, Hanoch Levy, Eli Brosh:
Resource placement and assignment in distributed network topologies. INFOCOM 2013: 1914-1922 - 2012
- [j48]Yuval Rochman, Hanoch Levy, Eli Brosh:
Efficient replication in multi-regional peer-supported VoD systems. SIGMETRICS Perform. Evaluation Rev. 40(3): 68-70 (2012) - [c34]Udi Ben-Porat, Anat Bremler-Barr, Hanoch Levy, Bernhard Plattner:
On the Vulnerability of Hardware Hash Tables to Sophisticated Attacks. Networking (1) 2012: 135-148 - [c33]Yuval Rochman, Hanoch Levy, Eli Brosh:
Max Percentile Replication for Optimal Performance in Multi-regional P2P VoD Systems. QEST 2012: 238-248 - 2011
- [c32]Udi Ben-Porat, Anat Bremler-Barr, Hanoch Levy, Bernhard Plattner:
On the vulnerability of the proportional fairness scheduler to retransmission attacks. INFOCOM 2011: 1431-1439 - [c31]Anat Bremler-Barr, Omer Dekel, Ran Goldschmidt, Hanoch Levy:
Controlling P2P Applications via Address Harvesting: The Skype Story. IPDPS Workshops 2011: 1579-1586 - [c30]Udi Ben-Porat, Anat Bremler-Barr, Hanoch Levy:
Network and computer performance in malicious environments: The good, the bad and the ugly. NetGCoop 2011: 1-5 - [p1]Hanoch Levy, Benjamin Avi-Itzhak, David Raz:
Principles of Fairness Quantification in Queueing Systems. Network Performance Engineering 2011: 284-300 - 2010
- [j47]David Raz, Hanoch Levy, Benjamin Avi-Itzhak:
Class prioritization and server dedication in queueing systems: Discrimination and fairness aspects. Perform. Evaluation 67(4): 235-247 (2010)
2000 – 2009
- 2009
- [c29]Simon Heimlicher, Merkourios Karaliopoulos, Hanoch Levy, Thrasyvoulos Spyropoulos:
On Leveraging Partial Paths in Partially-Connected Networks. INFOCOM 2009: 55-63 - [c28]Udi Ben-Porat, Anat Bremler-Barr, Hanoch Levy:
On the Exploitation of CDF Based Wireless Scheduling. INFOCOM 2009: 2821-2825 - [i1]Simon Heimlicher, Merkourios Karaliopoulos, Hanoch Levy, Thrasyvoulos Spyropoulos:
On Leveraging Partial Paths in Partially-Connected Networks. CoRR abs/0901.3257 (2009) - 2008
- [j46]David Raz, Hanoch Levy, Benjamin Avi-Itzhak:
On the twin measure and queueing systems predictability. Perform. Evaluation 65(11-12): 839-853 (2008) - [c27]Haim Zlatokrilov, Hanoch Levy:
Area Avoidance Routing in Distance-Vector Networks. INFOCOM 2008: 475-483 - [c26]Udi Ben-Porat, Anat Bremler-Barr, Hanoch Levy:
Evaluating the Vulnerability of Network Mechanisms to Sophisticated DDoS Attacks. INFOCOM 2008: 2297-2305 - [c25]David Raz, Hanoch Levy, Benjamin Avi-Itzhak:
Class treatment in queueing systems: discrimination and fairness aspects. VALUETOOLS 2008: 65 - 2007
- [j45]Anat Bremler-Barr, Nir Halachmi, Hanoch Levy:
Protecting bursty applications against traffic aggressiveness. Comput. Networks 51(13): 3864-3877 (2007) - [j44]Hanoch Levy, David Raz, Benjamin Avi-Itzhak:
Locality of reference and the use of sojourn time variance for measuring queue unfairness. Oper. Res. Lett. 35(3): 311-318 (2007) - [j43]Benjamin Avi-Itzhak, Eli Brosh, Hanoch Levy:
SQF: A slowdown queueing fairness measure. Perform. Evaluation 64(9-12): 1121-1136 (2007) - [j42]Benjamin Avi-Itzhak, Hanoch Levy, David Raz:
A resource allocation queueing fairness measure: properties and bounds. Queueing Syst. Theory Appl. 56(2): 65-71 (2007) - [c24]Simon Heimlicher, Merkourios Karaliopoulos, Hanoch Levy, Martin May:
End-to-end vs. hop-by-hop transport under intermittent connectivity. Autonomics 2007: 20 - [c23]Haim Zlatokrilov, Hanoch Levy:
Navigation in Distance Vector Spaces and Its Use for Node Avoidance Routing. INFOCOM 2007: 1253-1261 - [c22]David Raz, Hanoch Levy, Benjamin Avi-Itzhak:
The twin measure for queueing system predictability. VALUETOOLS 2007: 47 - 2006
- [j41]Joseph Levy, Hanoch Levy, Yaron Kahana:
Top percentile network pricing and the economics of multi-homing. Ann. Oper. Res. 146(1): 153-167 (2006) - [j40]David Raz, Hanoch Levy, Benjamin Avi-Itzhak:
On the twin measure and system predictability and fairness. SIGMETRICS Perform. Evaluation Rev. 34(3): 15-17 (2006) - [j39]Hanoch Levy, Haim Zlatokrilov:
The effect of packet dispersion on voice applications in IP networks. IEEE/ACM Trans. Netw. 14(2): 277-288 (2006) - [c21]Haim Zlatokrilov, Hanoch Levy:
Session Privacy Enhancement by Traffic Dispersion. INFOCOM 2006 - [c20]Anat Bremler-Barr, Hanoch Levy, Nir Halachmi:
Protecting Bursty Applications Against Traffic Aggressiveness. IWQoS 2006: 272-273 - [c19]David Raz, Benjamin Avi-Itzhak, Hanoch Levy:
Fairness considerations of scheduling in multi-server and multi-queue systems. VALUETOOLS 2006: 39 - 2005
- [j38]David Raz, Benjamin Avi-Itzhak, Hanoch Levy:
Locality of reference and the use of sojourn time variance for measuring queue unfairness: extended abstract. SIGMETRICS Perform. Evaluation Rev. 33(2): 39-41 (2005) - [c18]Anat Bremler-Barr, Hanoch Levy:
Spoofing prevention method. INFOCOM 2005: 536-547 - [c17]Haim Zlatokrilov, Hanoch Levy:
Privacy and Reliability by Dispersive Routing. IWQoS 2005: 362-365 - [c16]David Raz, Benjamin Avi-Itzhak, Hanoch Levy:
Fair operation of multi-server and multi-queue systems. SIGMETRICS 2005: 382-383 - 2004
- [j37]Aner Armon, Hanoch Levy:
Cache satellite distribution systems: modeling, analysis, and efficient operation. IEEE J. Sel. Areas Commun. 22(2): 218-228 (2004) - [j36]David Raz, Benjamin Avi-Itzhak, Hanoch Levy:
How fair is queue prioritization? SIGMETRICS Perform. Evaluation Rev. 32(2): 14-16 (2004) - [j35]Hanoch Levy, Tsippy Mendelson, Gilad Goren:
Dynamic allocation of resources to virtual path agents. IEEE/ACM Trans. Netw. 12(4): 746-758 (2004) - [c15]Haim Zlatokrilov, Hanoch Levy:
Packet Dispersion and the Quality of Voice over IP Applications in IP networks. INFOCOM 2004: 1170-1180 - [c14]Anat Bremler-Barr, Hanoch Levy:
Brief announcement: spoofing prevention method. PODC 2004: 375 - [c13]David Raz, Hanoch Levy, Benjamin Avi-Itzhak:
A resource-allocation queueing fairness measure. SIGMETRICS 2004: 130-141 - 2003
- [j34]Zohar Naor, Hanoch Levy:
Announced dynamic access probability protocol for next generation wireless networks. Comput. Networks 41(4): 527-544 (2003) - [j33]Marik Marshak, Hanoch Levy:
Evaluating web user perceived latency using server side measurements. Comput. Commun. 26(8): 872-887 (2003) - [c12]Aner Armon, Hanoch Levy:
Cache Satellite Distribution Systems: Modeling and Analysis. INFOCOM 2003: 240-250 - 2002
- [j32]Zohar Naor, Hanoch Levy, Uri Zwick:
Cell Identification Codes for Tracking Mobile Users. Wirel. Networks 8(1): 73-84 (2002) - 2001
- [j31]Benjamin Avi-Itzhak, Hanoch Levy:
Buffer Requirements and Server Ordering in a Tandem Queue with Correlated Service Times. Math. Oper. Res. 26(2): 358-374 (2001) - [c11]Zohar Naor, Hanoch Levy:
A Centralized Dynamic Access Probability Protocol for next Genreration Wireless Networks. INFOCOM 2001: 767-775 - 2000
- [c10]Hanoch Levy, Tsippy Mendelson, Gilad Goren:
Optimal Use of Virtual Paths for Connection Setup Reduction: The Single Link Problem. INFOCOM 2000: 688-696
1990 – 1999
- 1999
- [j30]Zohar Naor, Hanoch Levy:
LATS: a load-adaptive threshold scheme for tracking mobile users. IEEE/ACM Trans. Netw. 7(6): 808-817 (1999) - [j29]Hanoch Levy, Tzippi Mendelson, Moshe Sidi, Joseph Keren-Zvi:
Sizing exit buffers in ATM networks: an intriguing coexistence of instability and tiny cell loss rates. IEEE/ACM Trans. Netw. 7(6): 926-936 (1999) - [j28]Hanoch Levy, Zohar Naor:
Active tracking: Locating mobile users in personal communication service networks. Wirel. Networks 5(6): 467-477 (1999) - [c9]Zohar Naor, Hanoch Levy:
Cell Identification Codes for Tracking Mobile Users. INFOCOM 1999: 28-35 - 1998
- [c8]Zohar Naor, Hanoch Levy:
Minimizing the Wireless Cost of Tracking Mobile Users: An Adaptive Threshold Scheme. INFOCOM 1998: 720-727 - [c7]Hanoch Levy, Tzippi Mendelson, Moshe Sidi, Joseph Keren-Zvi:
Sizing Exit Buffers in ATM Networks under CBR Traffic. INFOCOM 1998: 1309-1316 - 1997
- [j27]Robert D. van der Mei, Hanoch Levy:
Polling systems in heavy traffic: Exhaustiveness of service policies. Queueing Syst. Theory Appl. 27(3-4): 227-250 (1997) - 1996
- [j26]Hanoch Levy, Robert J. T. Morris:
Should Caches be Split or Shared? Analysis Using the Superposition of Bursty Stack Depth Processes. Perform. Evaluation 27/28(4): 175-188 (1996) - [j25]Alan G. Konheim, Hanoch Levy, Mandyam M. Srinivasan:
Corrections to "Descendant Set: An Efficient Approach for the Analysis of Polling Systems". IEEE Trans. Commun. 44(7): 776 (1996) - [j24]Hanoch Levy, Ted Messinger, Robert J. T. Morris:
The Cache Assignment Problem and Its Application to Database Buffer Management. IEEE Trans. Software Eng. 22(11): 827-838 (1996) - 1995
- [j23]Sem C. Borst, Onno J. Boxma, Hanoch Levy:
The use of service limits for efficient operation of multistation single-medium communication systems. IEEE/ACM Trans. Netw. 3(5): 602-612 (1995) - [j22]Hanoch Levy, Robert J. T. Morris:
Exact Analysis of Bernoulli Superposition of Streams Into a Least Recently Used Cache. IEEE Trans. Software Eng. 21(8): 682-687 (1995) - 1994
- [j21]Offer Fabian, Hanoch Levy:
Pseudo-cyclic policies for multi-queue single server systems. Ann. Oper. Res. 48(1): 127-152 (1994) - [j20]Moshe Sidi, Hanoch Levy, Steve W. Fuhrmann:
Correction to equation (5.6) in the paper: A queueing network with a single cyclically roving server. Queueing Syst. Theory Appl. 16(1-2): 193 (1994) - [j19]Alan G. Konheim, Hanoch Levy, Mandyam M. Srinivasan:
Descendant set: an efficient approach for the analysis of polling systems. IEEE Trans. Commun. 42(234): 1245-1253 (1994) - [c6]Hanoch Levy, Gilad Mahalal, Moshe Sidi:
Multi-token rings and multi-server polling systems: the bang-bang policy. CAMAD 1994 - 1993
- [j18]Onno J. Boxma, Hanoch Levy, Jan A. Weststrate:
Efficient Visit Orders for Polling Systems. Perform. Evaluation 18(2): 103-123 (1993) - [c5]Offer Fabian, Hanoch Levy:
Polling System Optimization through Dynamic Routing Policies. INFOCOM 1993: 194-200 - 1992
- [j17]Onno J. Boxma, Hanoch Levy, Uri Yechiali:
Cyclic reservation schemes for efficient operation of multiple-queue single-server systems. Ann. Oper. Res. 35(3): 187-208 (1992) - [j16]Moshe Sidi, Hanoch Levy, Steve W. Fuhrmann:
A queueing network with a single cyclically roving server. Queueing Syst. Theory Appl. 11(1-2): 121-144 (1992) - [j15]Wim P. Groenendijk, Hanoch Levy:
Performance Analysis of Transaction Driven Computer Systems via Queueing Analysis of Polling Models. IEEE Trans. Computers 41(4): 455-466 (1992) - [c4]Alan G. Konheim, Hanoch Levy:
Efficient Analysis of Polling Systems. INFOCOM 1992: 2325-2331 - 1991
- [j14]Anat Levy, Hanoch Levy:
Lock and no-lock mortgage plans: Is it only a matter of risk shifting? Oper. Res. Lett. 10(4): 233-240 (1991) - [j13]Hanoch Levy:
A note on the complexity of Swartz's method for calculating the expected delay in non-symmetric cyclic polling systems. Oper. Res. Lett. 10(6): 363-368 (1991) - [j12]Hanoch Levy, Leonard Kleinrock:
Polling Systems with Zero Switch-Over Periods: A General Method for Analyzing the Expected Delay. Perform. Evaluation 13(2): 97-107 (1991) - [j11]Onno J. Boxma, Hanoch Levy, Jan A. Weststrate:
Efficient Visit Frequencies for Polling Tables: Minimization of Waiting Cost. Queueing Syst. Theory Appl. 9(1-2): 133-162 (1991) - [j10]Hanoch Levy, Moshe Sidi:
Polling systems with simultaneous arrivals. IEEE Trans. Commun. 39(6): 823-827 (1991) - [j9]Hanoch Levy:
Binomial-gated service: a method for effective operation and optimization of polling systems. IEEE Trans. Commun. 39(9): 1341-1350 (1991) - 1990
- [j8]Hanoch Levy, Moshe Sidi, Onno J. Boxma:
Dominance Relations in Polling Systems. Queueing Syst. Theory Appl. 6(2): 155-171 (1990) - [j7]Hanoch Levy, Moshe Sidi:
Polling systems: applications, modeling, and optimization. IEEE Trans. Commun. 38(10): 1750-1760 (1990) - [j6]Leonard Kleinrock, Hanoch Levy:
On the behavior of a very fast bidirectional bus network. IEEE Trans. Commun. 38(10): 1854-1862 (1990) - [c3]Moshe Sidi, Hanoch Levy:
Customer Routing on Polling Systems. Performance 1990: 319-331 - [c2]Onno J. Boxma, Hanoch Levy, Jan A. Weststrate:
Optimization of Polling Systems. Performance 1990: 349-361
1980 – 1989
- 1989
- [j5]Hanoch Levy:
Delay Computation and Dynamic Behavior of Non-Symmetric Polling Systems. Perform. Evaluation 10(1): 35-51 (1989) - [j4]Rodolfo A. Milito, Hanoch Levy:
Modeling and dynamic scheduling of a queueing system with blocking and starvation. IEEE Trans. Commun. 37(12): 1318-1329 (1989) - [c1]Hanoch Levy, Moshe Sidi:
Polling Systems with Correlated Arrivals. INFOCOM 1989: 907-913 - 1988
- [j3]Leonard Kleinrock, Hanoch Levy:
The Analysis of Random Polling Systems. Oper. Res. 36(5): 716-732 (1988) - [j2]Hanoch Levy, David W. Low:
A Contraction Algorithm for Finding Small Cycle Cutsets. J. Algorithms 9(4): 470-493 (1988) - 1986
- [j1]Hanoch Levy, Leonard Kleinrock:
A Queue with Starter and a Queue with Vacations: Delay Analysis by Decomposition. Oper. Res. 34(3): 426-436 (1986)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-21 20:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
