Hans Daduna

According to our database1, Hans Daduna
  • authored at least 46 papers between 1976 and 2016.
  • has a "Dijkstra number"2 of five.



In proceedings 
PhD thesis 



On csauthors.net:


Monotonicity of base stock policies.
Oper. Res. Lett., 2016

Nonergodic Jackson networks with infinite supply-local stabilization and local equilibrium analysis.
J. Applied Probability, 2016

Moving Queue on a Network.
Proceedings of the Measurement, Modelling and Evaluation of Dependable Computer and Communication Systems, 2016

Loss systems in a random environment: steady state analysis.
Queueing Syst., 2015

The cyclic queue and the tandem queue.
Queueing Syst., 2014

Modeling and Performance Analysis of a Node in Fault Tolerant Wireless Sensor Networks.
Proceedings of the Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance, 2014

Weak Convergence Limits for Closed Cyclic Networks of Queues with Multiple Bottleneck Nodes.
J. Applied Probability, 2012

Availability in Large Networks: Global Characteristics from Local Unreliability Properties.
Proceedings of the Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance, 2012

Discrete time queueing networks with product form steady state. Availability and performance analysis in an integrated model.
Queueing Syst., 2010

On the behavior of stable subnetworks in non-ergodic networks with unreliable nodes.
Computer Networks, 2009

Throughput limits from the asymptotic profile of cyclic networks with state-dependent service rates.
Queueing Syst., 2008

Customer Oriented Performance Measures for Packet Transmission in a Ring Network with Blocking.
Proceedings of the Proceedings 14th GI/ITG Conference on Measurement, Modelling and Evaluation of Computer and Communication Systems (MMB 2008), March 31, 2008

M/M/1 Queueing systems with inventory.
Queueing Syst., 2006

Queueing systems with inventory management with random lead times and with backordering.
Math. Meth. of OR, 2006

Availability and performance analysis in a discrete-time tandem network with product-form steady state.
Proceedings of the Proceedings 13th GI/ITG Conference on Measuring, 2006

An invariance property of sojourn times in cyclic networks.
Oper. Res. Lett., 2005

Stochastic games for distributed players on graphs.
Math. Meth. of OR, 2004

Degradable Networks with General up and down Time Distributions.
Proceedings of the MMB & PGTS 2004, 2004

Dependence structure of sojourn times via partition separated ordering.
Oper. Res. Lett., 2003

Discrete time tandem networks of queues - Effects of different regulation schemes for simultaneous events.
Perform. Eval., 2002

Queueing Networks with Discrete Time Scale - Explicit Expressions for the Steady State Behavior of Discrete Time Stochastic Networks
Lecture Notes in Computer Science 2046, Springer, ISBN: 3-540-42357-5, 2001

On the correlation of sojourn times in open networks of exponential multiserver queues.
Queueing Syst., 2000

Individual customer's behaviour in networks with state-dependent arrival rates.
Queueing Syst., 1999

Optimal admission control for M/D/1/K queueing systems.
Math. Meth. of OR, 1999

The joint distribution of sojourn times for a customer traversing an overtake-free series of queues: The discrete time case.
Queueing Syst., 1997

Some Results for Steady-State and Sojourn Time Distributions in Open and Closed Linear Networks of Bernoulli Servers with State-Dependent Service and Arrival Rates.
Perform. Eval., 1997

Discrete Time Analysis of a State Dependent Tandem with Different Customer Types.
Proceedings of the Foundations of Computer Science: Potential - Theory, 1997

Book reviews.
Math. Meth. of OR, 1996

The cycle time distribution in a cycle of Bernoulli servers in discrete time.
Math. Meth. of OR, 1996

On the stability of queueing systems under precedence restrictions for the service of customers.
Queueing Syst., 1994

A concurrency control problem in a time-sharing system with different job types.
Kybernetika, 1991

Exchangeable Items in Repair Systems: Delay Times.
Operations Research, 1990

Simultaneous Busy Periods for Nodes in a Stochastic Network.
Perform. Eval., 1989

Mean Value Analysis for the Duration of Heavy Traffic Periods in Subnetworks of a Queueing Network.
Proceedings of the Messung, 1989

Busy periods for subnetworks in stochastic networks: mean value analysis.
J. ACM, 1988

Two-Stage Cyclic Queues with Nonexponential Servers: Steady-State and Cyclic Time.
Operations Research, 1986

Cycle Times in Two-Stage Closed Queueing Networks: Applications to Multiprogrammed Computer Systems with Virtual Memory.
Operations Research, 1986

The Distribution of Residence Times and Cycle Times in a Closed Tandem of Processor Sharing Queues.
Proceedings of the Messung, 1985

The Time for a Round Trip in a Cycle of Exponential Queues
J. ACM, January, 1983

Networks of queues in discrete time.
Zeitschr. für OR, 1983

On passage times in Jackson networks: Two-stations walk and overtake-free paths.
Zeitschr. für OR, 1983

A Discrete Time technique for Solving Closed Queueing Network Models of Computer Systems.
Proceedings of the Messung, 1983

On the Structure of General Stochastic Automata.
ITA, 1981

A Discrete-Time Round-Robin Queue with Bernoulli Input and General Arithmetic Service Time Distributions.
Acta Inf., 1981

Stochastic Algebras and Stochastic Automata over General Measurable Spaces: Algebraic Theory and a Decomposition Theory.
FCT, 1977

Stochastische Algebra über höchstens abzählbaren Mengen.
Elektronische Informationsverarbeitung und Kybernetik, 1976