default search action
Andreas Brandt 0001
Person information
- affiliation (PhD 1983): Humboldt University of Berlin, Unter den Linden, Germany
Other persons with the same name
- Andreas Brandt — disambiguation page
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1983
- [b1]Andreas Brandt:
Qualitative Untersuchungen der schwachen Lösungen und Stetigkeitssätze für das m-linige Wartesystem. Humboldt University of Berlin, Unter den Linden, Germany, 1983
Journal Articles
- 2013
- [j26]Andreas Brandt, Manfred Brandt:
Workload and busy period for M/GI/1 with a general impatience mechanism. Queueing Syst. Theory Appl. 75(2-4): 189-209 (2013) - 2012
- [j25]Manfred Brandt, Andreas Brandt:
Additive functionals with application to sojourn times in infinite-server and processor sharing systems. Queueing Syst. Theory Appl. 70(4): 369-409 (2012) - 2010
- [j24]Manfred Brandt, Andreas Brandt:
On sojourn times in M/GI systems under state-dependent processor sharing. Queueing Syst. Theory Appl. 64(2): 167-201 (2010) - 2008
- [j23]Andreas Brandt, Manfred Brandt:
Waiting times for M/M systems under state-dependent processor sharing. Queueing Syst. Theory Appl. 59(3-4): 297-319 (2008) - 2007
- [j22]Andreas Brandt, Manfred Brandt:
On the stability of the multi-queue multi-server processor sharing with limited service. Queueing Syst. Theory Appl. 56(1): 1-8 (2007) - 2006
- [j21]Andreas Brandt, Manfred Brandt:
A sample path relation for the sojourn times in G/G/1-PS systems and its applications. Queueing Syst. Theory Appl. 52(4): 281-286 (2006) - 2005
- [j20]Andreas Brandt, Manfred Brandt:
Individual Overflow and Freed Carried Traffics for a Link with Trunk Reservation. Telecommun. Syst. 29(4): 283-308 (2005) - 2004
- [j19]Andreas Brandt, Manfred Brandt:
On the Two-Class M/M/1 System under Preemptive Resume and Impatience of the Prioritized Customers. Queueing Syst. Theory Appl. 47(1-2): 147-168 (2004) - 2002
- [j18]Andreas Brandt, Manfred Brandt:
Asymptotic Results and a Markovian Approximation for the M(n)/M(n)/s+GI System. Queueing Syst. Theory Appl. 41(1-2): 73-94 (2002) - 2001
- [j17]Andreas Brandt, Manfred Brandt:
Approximation for overflow moments of a multiservice link with trunk reservation. Perform. Evaluation 43(4): 259-268 (2001) - 1999
- [j16]Andreas Brandt, Manfred Brandt:
On the M(n)/M(n)/s Queue with Impatient Calls. Perform. Evaluation 35(1-2): 1-18 (1999) - [j15]Andreas Brandt, Manfred Brandt:
A note on the stability of the many-queue head-of-the-line processor-sharing system with permanent customers. Queueing Syst. Theory Appl. 32(4): 363-381 (1999) - 1998
- [j14]Andreas Brandt, Manfred Brandt:
On the sojourn times for many-queue head-of-the-line Processor-sharing systems with permanent customers. Math. Methods Oper. Res. 47(2): 181-220 (1998) - 1996
- [j13]Andreas Brandt:
Individual blocking probabilities in the loss system GI + M|[(M)\vec]|N|0. Math. Methods Oper. Res. 44(1): 49-74 (1996) - 1994
- [j12]Andreas Brandt, Manfred Brandt:
On the distribution of the number of packets in the fluid flow approximation of packet arrival streams. Queueing Syst. Theory Appl. 17(1-2): 275-315 (1994) - 1990
- [j11]Andreas Brandt, Manfred Brandt, Hannelore Sulanke:
A Single Server Model for Packetwise Transmission of Messages. Queueing Syst. Theory Appl. 6(3): 287-310 (1990) - 1989
- [j10]Andreas Brandt:
On the GI/M/infty Service System with Batch Arrivals and Different Types of Service Distributions. Queueing Syst. Theory Appl. 4(4): 351-365 (1989) - 1988
- [j9]Andreas Brandt, Hannelore Sulanke:
Acknowledgement of Priority. Queueing Syst. Theory Appl. 3(2): 199 (1988) - 1987
- [j8]Andreas Brandt, Hannelore Sulanke:
On the GI/M/infinity Queue with Batch Arrivals of Constant Size and its Application to a Repairable Standby System. J. Inf. Process. Cybern. 23(6): 271 (1987) - [j7]Andreas Brandt, Hannelore Sulanke:
Reliability Analysis of a Standby System with Repairable Components. J. Inf. Process. Cybern. 23(6): 277-282 (1987) - [j6]Andreas Brandt, Hannelore Sulanke:
On the GI/M/infty Queue with Batch Arrivals of Constant Size. Queueing Syst. Theory Appl. 2(2): 187-200 (1987) - [j5]Andreas Brandt:
On Stationary Queue Length Distributions for G/M/s/r Queues. Queueing Syst. Theory Appl. 2(4): 321-332 (1987) - 1986
- [j4]Andreas Brandt, Hannelore Sulanke:
On the Calculation and Approximation of the Mean Time Between Failure of a System with Two and Three Component Subsystems. J. Inf. Process. Cybern. 22(12): 635-645 (1986) - 1985
- [j3]Andreas Brandt:
On Stationary Waiting Times and Limiting Behaviour of Queues with Many Servers I: The General G/G/m/infinity Case. J. Inf. Process. Cybern. 21(1/2): 47-64 (1985) - [j2]Andreas Brandt:
On Stationary Waiting Times and Limiting Behaviour of Queues with Many Servers II: The G/GI/m/infinity Case. J. Inf. Process. Cybern. 21(3): 151-162 (1985) - 1980
- [j1]Andreas Brandt, Bernd Lisek:
On the Approximation of GI/GI/m/0 by Means of GI/GI/infinity. J. Inf. Process. Cybern. 16(10-12): 597-600 (1980)
Conference and Workshop Papers
- 2005
- [c1]Andreas Brandt, Manfred Brandt, Stefan Rugel, Dietmar Weber:
Admission control for realtime traffic: improving performance of mobile networks by operating on actual throughput. WCNC 2005: 1266-1272
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-07-02 18:37 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: