- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j43 |      | Udi Ben-Porat, Anat Bremler-Barr, Hanoch Levy: Vulnerability of Network Mechanisms to Sophisticated DDoS Attacks. IEEE Trans. Computers 62(5): 1031-1043 (2013) |
| 2012 | ||
| j42 | | Yuval Rochman, Hanoch Levy, Eli Brosh: Efficient replication in multi-regional peer-supported VoD systems. SIGMETRICS Performance Evaluation Review 40(3): 68-70 (2012) |
| c32 | | 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 |
| c31 | | Yuval Rochman, Hanoch Levy, Eli Brosh: Max Percentile Replication for Optimal Performance in Multi-regional P2P VoD Systems. QEST 2012: 238-248 |
| 2011 | ||
| c30 | | 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 |
| c29 | | Anat Bremler-Barr, Omer Dekel, Ran Goldschmidt, Hanoch Levy: Controlling P2P Applications via Address Harvesting: The Skype Story. IPDPS Workshops 2011: 1579-1586 |
| c28 | | 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 | ||
| j41 | | David Raz, Hanoch Levy, Benjamin Avi-Itzhak: Class prioritization and server dedication in queueing systems: Discrimination and fairness aspects. Perform. Eval. 67(4): 235-247 (2010) |
| 2009 | ||
| c27 | | Simon Heimlicher, Merkourios Karaliopoulos, Hanoch Levy, Thrasyvoulos Spyropoulos: On Leveraging Partial Paths in Partially-Connected Networks. INFOCOM 2009: 55-63 |
| c26 | | 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 | ||
| j40 | | David Raz, Hanoch Levy, Benjamin Avi-Itzhak: On the twin measure and queueing systems predictability. Perform. Eval. 65(11-12): 839-853 (2008) |
| c25 | | Haim Zlatokrilov, Hanoch Levy: Area Avoidance Routing in Distance-Vector Networks. INFOCOM 2008: 475-483 |
| c24 | | Udi Ben-Porat, Anat Bremler-Barr, Hanoch Levy: Evaluating the Vulnerability of Network Mechanisms to Sophisticated DDoS Attacks. INFOCOM 2008: 2297-2305 |
| 2007 | ||
| j39 | | Anat Bremler-Barr, Nir Halachmi, Hanoch Levy: Protecting bursty applications against traffic aggressiveness. Computer Networks 51(13): 3864-3877 (2007) |
| j38 | | 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) |
| j37 | | Benjamin Avi-Itzhak, Eli Brosh, Hanoch Levy: SQF: A slowdown queueing fairness measure. Perform. Eval. 64(9-12): 1121-1136 (2007) |
| j36 | | Benjamin Avi-Itzhak, Hanoch Levy, David Raz: A resource allocation queueing fairness measure: properties and bounds. Queueing Syst. 56(2): 65-71 (2007) |
| c23 | | Simon Heimlicher, Merkourios Karaliopoulos, Hanoch Levy, Martin May: End-to-end vs. hop-by-hop transport under intermittent connectivity. Autonomics 2007: 20 |
| c22 | | Haim Zlatokrilov, Hanoch Levy: Navigation in Distance Vector Spaces and Its Use for Node Avoidance Routing. INFOCOM 2007: 1253-1261 |
| c21 | | David Raz, Hanoch Levy, Benjamin Avi-Itzhak: The twin measure for queueing system predictability. VALUETOOLS 2007: 47 |
| 2006 | ||
| j35 | | Joseph Levy, Hanoch Levy, Yaron Kahana: Top percentile network pricing and the economics of multi-homing. Annals OR 146(1): 153-167 (2006) |
| j34 | | David Raz, Hanoch Levy, Benjamin Avi-Itzhak: On the twin measure and system predictability and fairness. SIGMETRICS Performance Evaluation Review 34(3): 15-17 (2006) |
| j33 | | Hanoch Levy, Haim Zlatokrilov: The effect of packet dispersion on voice applications in IP networks. IEEE/ACM Trans. Netw. 14(2): 277-288 (2006) |
| c20 | | |
| c19 | | Anat Bremler-Barr, Hanoch Levy, Nir Halachmi: Protecting Bursty Applications Against Traffic Aggressiveness. IWQoS 2006: 272-273 |
| c18 | | David Raz, Benjamin Avi-Itzhak, Hanoch Levy: Fairness considerations of scheduling in multi-server and multi-queue systems. VALUETOOLS 2006: 39 |
| 2005 | ||
| j32 | | David Raz, Benjamin Avi-Itzhak, Hanoch Levy: Locality of reference and the use of sojourn time variance for measuring queue unfairness: extended abstract. SIGMETRICS Performance Evaluation Review 33(2): 39-41 (2005) |
| c17 | | |
| c16 | | |
| c15 | | David Raz, Benjamin Avi-Itzhak, Hanoch Levy: Fair operation of multi-server and multi-queue systems. SIGMETRICS 2005: 382-383 |
| 2004 | ||
| j31 | | Aner Armon, Hanoch Levy: Cache satellite distribution systems: modeling, analysis, and efficient operation. IEEE Journal on Selected Areas in Communications 22(2): 218-228 (2004) |
| j30 | | David Raz, Benjamin Avi-Itzhak, Hanoch Levy: How fair is queue prioritization? SIGMETRICS Performance Evaluation Review 32(2): 14-16 (2004) |
| j29 | | Hanoch Levy, Tsippy Mendelson, Gilad Goren: Dynamic allocation of resources to virtual path agents. IEEE/ACM Trans. Netw. 12(4): 746-758 (2004) |
| c14 | | Haim Zlatokrilov, Hanoch Levy: Packet Dispersion and the Quality of Voice over IP Applications in IP networks. INFOCOM 2004 |
| c13 | | |
| c12 | | David Raz, Hanoch Levy, Benjamin Avi-Itzhak: A resource-allocation queueing fairness measure. SIGMETRICS 2004: 130-141 |
| 2003 | ||
| j28 | | Zohar Naor, Hanoch Levy: Announced dynamic access probability protocol for next generation wireless networks. Computer Networks 41(4): 527-544 (2003) |
| j27 | | Marik Marshak, Hanoch Levy: Evaluating web user perceived latency using server side measurements. Computer Communications 26(8): 872-887 (2003) |
| c11 | | |
| 2002 | ||
| j26 | | Zohar Naor, Hanoch Levy, Uri Zwick: Cell Identification Codes for Tracking Mobile Users. Wireless Networks 8(1): 73-84 (2002) |
| 2001 | ||
| j25 | | 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) |
| c10 | | Zohar Naor, Hanoch Levy: A Centralized Dynamic Access Probability Protocol for next Genreration Wireless Networks. INFOCOM 2001: 767-775 |
| 2000 | ||
| c9 | | Hanoch Levy, Tsippy Mendelson, Gilad Goren: Optimal Use of Virtual Paths for Connection Setup Reduction: The Single Link Problem. INFOCOM 2000: 688-696 |
| 1999 | ||
| j24 | | Zohar Naor, Hanoch Levy: LATS: a load-adaptive threshold scheme for tracking mobile users. IEEE/ACM Trans. Netw. 7(6): 808-817 (1999) |
| j23 | | 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) |
| j22 | | Hanoch Levy, Zohar Naor: Active tracking: Locating mobile users in personal communication service networks. Wireless Networks 5(6): 467-477 (1999) |
| c8 |  | |
| 1998 | ||
| c7 | | Zohar Naor, Hanoch Levy: Minimizing the Wireless Cost of Tracking Mobile Users: An Adaptive Threshold Scheme. INFOCOM 1998: 720-727 |
| c6 | | Hanoch Levy, Tzippi Mendelson, Moshe Sidi, Joseph Keren-Zvi: Sizing Exit Buffers in ATM Networks under CBR Traffic. INFOCOM 1998: 1309-1316 |
| 1997 | ||
| j21 | | Robert D. van der Mei, Hanoch Levy: Polling systems in heavy traffic: Exhaustiveness of service policies. Queueing Syst. 27(3-4): 227-250 (1997) |
| 1996 | ||
| j20 | | Hanoch Levy, Robert J. T. Morris: Should Caches be Split or Shared? Analysis Using the Superposition of Bursty Stack Depth Processes. Perform. Eval. 27/28(4): 175-188 (1996) |
| j19 | | Alan G. Konheim, Hanoch Levy, Mandyam M. Srinivasan: Corrections to "Descendant Set: An Efficient Approach for the Analysis of Polling Systems". IEEE Transactions on Communications 44(7): 776 (1996) |
| j18 | | 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 | ||
| j17 | | 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) |
| j16 | | 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 | ||
| j15 | | 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. 16(1-2): 193 (1994) |
| j14 | | Alan G. Konheim, Hanoch Levy, Mandyam M. Srinivasan: Descendant set: an efficient approach for the analysis of polling systems. IEEE Transactions on Communications 42(234): 1245-1253 (1994) |
| 1993 | ||
| j13 | | Onno J. Boxma, Hanoch Levy, Jan A. Weststrate: Efficient Visit Orders for Polling Systems. Perform. Eval. 18(2): 103-123 (1993) |
| c5 | | Offer Fabian, Hanoch Levy: Polling System Optimization through Dynamic Routing Policies. INFOCOM 1993: 194-200 |
| 1992 | ||
| j12 | | Moshe Sidi, Hanoch Levy, Steve W. Fuhrmann: A queueing network with a single cyclically roving server. Queueing Syst. 11(1-2): 121-144 (1992) |
| j11 | | 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 | | |
| 1991 | ||
| j10 | | Hanoch Levy, Leonard Kleinrock: Polling Systems with Zero Switch-Over Periods: A General Method for Analyzing the Expected Delay. Perform. Eval. 13(2): 97-107 (1991) |
| j9 | | Onno J. Boxma, Hanoch Levy, Jan A. Weststrate: Efficient Visit Frequencies for Polling Tables: Minimization of Waiting Cost. Queueing Syst. 9(1-2): 133-162 (1991) |
| j8 | | Hanoch Levy, Moshe Sidi: Polling systems with simultaneous arrivals. IEEE Transactions on Communications 39(6): 823-827 (1991) |
| j7 | | Hanoch Levy: Binomial-gated service: a method for effective operation and optimization of polling systems. IEEE Transactions on Communications 39(9): 1341-1350 (1991) |
| 1990 | ||
| j6 | | Hanoch Levy, Moshe Sidi, Onno J. Boxma: Dominance Relations in Polling Systems. Queueing Syst. 6(2): 155-171 (1990) |
| j5 | | Hanoch Levy, Moshe Sidi: Polling systems: applications, modeling, and optimization. IEEE Transactions on Communications 38(10): 1750-1760 (1990) |
| j4 | | Leonard Kleinrock, Hanoch Levy: On the behavior of a very fast bidirectional bus network. IEEE Transactions on Communications 38(10): 1854-1862 (1990) |
| c3 | | |
| c2 | | Onno J. Boxma, Hanoch Levy, Jan A. Weststrate: Optimization of Polling Systems. Performance 1990: 349-361 |
| 1989 | ||
| j3 | | Hanoch Levy: Delay Computation and Dynamic Behavior of Non-Symmetric Polling Systems. Perform. Eval. 10(1): 35-51 (1989) |
| j2 | | Rodolfo A. Milito, Hanoch Levy: Modeling and dynamic scheduling of a queueing system with blocking and starvation. IEEE Transactions on Communications 37(12): 1318-1329 (1989) |
| c1 | | |
| 1988 | ||
| j1 | | Hanoch Levy, David W. Low: A Contraction Algorithm for Finding Small Cycle Cutsets. J. Algorithms 9(4): 470-493 (1988) |
Colors in the list of coauthors
Last update Sun May 19 17:36:46 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page