Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

Zeev Schuss

dblp:36/1378 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 2013
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2Graphics, computer vision, multimedia, augmented reality and games · 1Theory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
3 papers
Performance modeling and evaluation · 90% Interconnection networks and networks-on-chip · 10%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Performance modeling and evaluation
queueing models
0.031987
Two Parallel M/G/1 Queues where Arrivals Join the System with the Smaller Buffer Content · IEEE Trans. Commun. 1987
Asymptotic Expansions for a Closed Multiple Access System · SIAM J. Comput. 1987
Two Parallel Queues with Dynamic Routing · IEEE Trans. Commun. 1986
Performance modeling and evaluation › queueing models
parallel queues
0.021987
Two Parallel M/G/1 Queues where Arrivals Join the System with the Smaller Buffer Content · IEEE Trans. Commun. 1987
Two Parallel Queues with Dynamic Routing · IEEE Trans. Commun. 1986
Performance modeling and evaluation › queueing models › closed queueing networks
finite-source queueing
0.011987
Asymptotic Expansions for a Closed Multiple Access System · SIAM J. Comput. 1987
Performance modeling and evaluation › queueing models › single server queue
m/g/1 queue
0.011987
Two Parallel M/G/1 Queues where Arrivals Join the System with the Smaller Buffer Content · IEEE Trans. Commun. 1987
Interconnection networks and networks-on-chip › routing algorithms
adaptive routing
0.011986
Two Parallel Queues with Dynamic Routing · IEEE Trans. Commun. 1986
Performance modeling and evaluation › queueing models › single server queue
m/m/1 queue
0.011986
Two Parallel Queues with Dynamic Routing · IEEE Trans. Commun. 1986

Methods — techniques the papers use, named apart from their topics

steady-state analysis · 0.0matched asymptotic expansions · 0.0light-traffic analysis · 0.0heavy-traffic analysis · 0.0asymptotic expansion · 0.0asymptotic approximation · 0.0
YearPublicationVenuePosition
2013 Reconstruction of Surface and Stochastic Dynamics from a Planar Projection of Trajectories
abstract
We show how to reconstruct a two-dimensional surface, the drift field, and the diffusion tensor from a planar projection of trajectories of a diffusion process on the surface. The reconstruction is based on the stochastic differential equations of the projected motion, whose drift and diffusion tensor depend on the local curvature of the surface. The reconstruction process requires the solution of new partial differential equations that we derive. Our analysis can be used to distinguish between the effective drift due to local curvature and that of the stochastic differential equation on the surface. We provide numerical examples of reconstruction from statistical estimates of the drift field and diffusion tensor of the projections.
N. Hoze, Zeev Schuss, David Holcman
SIAM J. Imaging Sci.2
1987 Asymptotic Expansions for a Closed Multiple Access System
abstract
A closed multiple access system composed of M sources and a single service facility is analyzed. The closed network is modeled as a finite source ${M / G / 1}$ queueing system. We consider systems with a large number of sources (i.e. $M \gg 1$) and we assume that the mean time required to process an individual request is short $(O({1 / M}))$. We then construct asymptotic approximations to the stationary distribution of the number of requests in the service facility by using the method of matched asymptotic expansions. We give formulas for the first and second moments of the number of requests, for all traffic intensities.
Charles Knessl, Bernard J. Matkowsky, Zeev Schuss, Charles Tier
SIAM J. Comput.3
1987 Two Parallel M/G/1 Queues where Arrivals Join the System with the Smaller Buffer Content
abstract
We consider two parallel, infinite capacity,M/G/1queues characterized by (U_{1}(t), U_{2}(t)) withU_{j}(t)denoting the unfinished work (buffer content) in queuej. A new arrival is assigned to the queue with the smaller buffer content. We construct formal (as opposed to rigorous) asymptotic approximations to the Joint stationary distribution of the Markov process (U_{1}(t), U_{2}(t)), treating separately the asymptotic limits of heavy traffic, light traffic, and large buffer contents. In heavy traffic, the stochastic processesU_{1}(t) + U_{2}(t)andU_{2}(t) - U_{1}(t)become independent, with the distribution ofU_{1}(t) + U_{2}(t)identical to the heavy traffic waiting time distribution in the standardM/G/2queue, and the distribution ofU_{2}(t) - U_{1}(t)closely related to the tail of the service time density. In light traffic, we obtain a formal expansion of the stationary distribution in powers of the arrival rate.
Charles Knessl, Bernard J. Matkowsky, Zeev Schuss, Charles Tier
IEEE Trans. Commun.3
1986 Two Parallel Queues with Dynamic Routing
abstract
We consider two parallelM/M/1queueing systems where a new arrival (customer, job, message) joins the shorter of the two queues. Such problems arise naturally in computer communications and packet switched data networks. An asymptotic approach is developed to obtain approximations to the steady-state joint distribution of the number of customers in the two systems. We first analyze the case where the two queueing systems are identical and then consider the case when the two servers work at different rates. Our results are shown to agree with the expansions of known exact solutions, when such solutions are available, and to yield new approximations when such solutions are not available.
Charles Knessl, Bernard J. Matkowsky, Zeev Schuss, Charles Tier
IEEE Trans. Commun.3