Andreas Brandt

Affiliations:
  • Humboldt University of Berlin, Unter den Linden, Germany (PhD 1983)


According to our database1, Andreas Brandt authored at least 28 papers between 1980 and 2013.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2013
Workload and busy period for M/GI/1 with a general impatience mechanism.
Queueing Syst. Theory Appl., 2013

2012
Additive functionals with application to sojourn times in infinite-server and processor sharing systems.
Queueing Syst. Theory Appl., 2012

2010
On sojourn times in <i>M</i>/<i>GI</i> systems under state-dependent processor sharing.
Queueing Syst. Theory Appl., 2010

2008
Waiting times for <i>M</i>/<i>M</i> systems under state-dependent processor sharing.
Queueing Syst. Theory Appl., 2008

2007
On the stability of the multi-queue multi-server processor sharing with limited service.
Queueing Syst. Theory Appl., 2007

2006
A sample path relation for the sojourn times in <i>G</i>/<i>G</i>/1-<i>PS</i> systems and its applications.
Queueing Syst. Theory Appl., 2006

2005
Individual Overflow and Freed Carried Traffics for a Link with Trunk Reservation.
Telecommun. Syst., 2005

Admission control for realtime traffic: improving performance of mobile networks by operating on actual throughput.
Proceedings of the IEEE Wireless Communications and Networking Conference, 2005

2004
On the Two-Class M/M/1 System under Preemptive Resume and Impatience of the Prioritized Customers.
Queueing Syst. Theory Appl., 2004

2002
Asymptotic Results and a Markovian Approximation for the M(n)/M(n)/s+GI System.
Queueing Syst. Theory Appl., 2002

2001
Approximation for overflow moments of a multiservice link with trunk reservation.
Perform. Evaluation, 2001

1999
A note on the stability of the many-queue head-of-the-line processor-sharing system with permanent customers.
Queueing Syst. Theory Appl., 1999

On the <i>M(n)/M(n)/s</i> Queue with Impatient Calls.
Perform. Evaluation, 1999

1998
On the sojourn times for many-queue head-of-the-line Processor-sharing systems with permanent customers.
Math. Methods Oper. Res., 1998

1996
Individual blocking probabilities in the loss system <i>GI</i> + <i>M</i>|[(<i>M</i>)\vec]|<i>N</i>|0.
Math. Methods Oper. Res., 1996

1994
On the distribution of the number of packets in the fluid flow approximation of packet arrival streams.
Queueing Syst. Theory Appl., 1994

1990
A Single Server Model for Packetwise Transmission of Messages.
Queueing Syst. Theory Appl., 1990

1989
On the GI/M/infty Service System with Batch Arrivals and Different Types of Service Distributions.
Queueing Syst. Theory Appl., 1989

1988
Acknowledgement of Priority.
Queueing Syst. Theory Appl., 1988

1987
On the GI/M/infty Queue with Batch Arrivals of Constant Size.
Queueing Syst. Theory Appl., 1987

On Stationary Queue Length Distributions for G/M/s/r Queues.
Queueing Syst. Theory Appl., 1987

Reliability Analysis of a Standby System with Repairable Components.
J. Inf. Process. Cybern., 1987

On the GI/M/infinity Queue with Batch Arrivals of Constant Size and its Application to a Repairable Standby System.
J. Inf. Process. Cybern., 1987

1986
On the Calculation and Approximation of the Mean Time Between Failure of a System with Two and Three Component Subsystems.
J. Inf. Process. Cybern., 1986

1985
On Stationary Waiting Times and Limiting Behaviour of Queues with Many Servers II: The G/GI/m/infinity Case.
J. Inf. Process. Cybern., 1985

On Stationary Waiting Times and Limiting Behaviour of Queues with Many Servers I: The General G/G/m/infinity Case.
J. Inf. Process. Cybern., 1985

1983
Qualitative Untersuchungen der schwachen Lösungen und Stetigkeitssätze für das m-linige Wartesystem.
PhD thesis, 1983

1980
On the Approximation of GI/GI/m/0 by Means of GI/GI/infinity.
J. Inf. Process. Cybern., 1980


  Loading...