The following pages link to Hanoch Levy (Q749056):
Displayed 34 items.
- Dominance relations in polling systems (Q749057) (← links)
- Lock and no-lock mortgage plans: Is it only a matter of risk shifting? (Q811315) (← links)
- Top percentile network pricing and the economics of multi-homing (Q863579) (← links)
- (Q1176442) (redirect page) (← links)
- Efficient visit frequencies for polling tables: Minimization of waiting cost (Q1176444) (← links)
- A note on the complexity of Swartz's method for calculating the expected delay in non-symmetric cyclic polling systems (Q1180845) (← links)
- A queueing network with a single cyclically roving server (Q1193790) (← links)
- Cyclic reservation schemes for efficient operation of multiple-queue single-server systems (Q1197756) (← links)
- Pseudo-cyclic policies for multi-queue single server systems (Q1315338) (← links)
- Correction to equation (5.6) in the paper: A queueing network with a single cyclically roving server (Q1324158) (← links)
- Announced dynamic access probability protocol for next generation wireless networks. (Q1398872) (← links)
- Cell identification codes for tracking mobile users (Q1859455) (← links)
- On fairness in polling systems (Q2095201) (← links)
- Admit or preserve? Addressing server failures in cloud computing task management (Q2308282) (← links)
- Locality of reference and the use of sojourn time variance for measuring queue unfairness (Q2467469) (← links)
- A resource allocation queueing fairness measure: properties and bounds (Q2643009) (← links)
- Protecting bursty applications against traffic aggressiveness (Q2643236) (← links)
- Modeling and dynamic scheduling of a queueing system with blocking and starvation (Q3032052) (← links)
- Customer delay in very large multi-queue single-server systems (Q3122381) (← links)
- Should caches be split or shared? Analysis using the superposition of bursty stack depth processes (Q3122410) (← links)
- QUANTIFYING FAIRNESS IN QUEUING SYSTEMS (Q3540999) (← links)
- A Queue with Starter and a Queue with Vacations: Delay Analysis by Decomposition (Q3750760) (← links)
- A contraction algorithm for finding small cycle cutsets (Q3813312) (← links)
- The Analysis of Random Polling Systems (Q3814523) (← links)
- Polling systems with zero switch-over periods: a general method for analyzing the expected delay (Q3994060) (← links)
- Efficient visit orders for polling systems (Q4272460) (← links)
- Queueing in space (Q4322095) (← links)
- (Q4630482) (← links)
- On measuring fairness in queues (Q4662245) (← links)
- A Sequence of Servers with Arbitrary Input and Regular Service Times Revisited (Q4896408) (← links)
- Vulnerability of Network Mechanisms to Sophisticated DDoS Attacks (Q5274406) (← links)
- The individual station technique for the analysis of cyclic polling systems (Q5687899) (← links)
- Buffer Requirements and Server Ordering in a Tandem Queue with Correlated Service Times (Q5704044) (← links)
- Stochastic epidemic spreading: not all super-spreading processes are born equal, neither all lockdown strategies (Q6192220) (← links)