Charles Knessl

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Charles Tier

> Home > Persons > Charles Knessl

Publications

2003
[j45]
- view
  authority control:
- export record
  dblp key:
  - journals/siamam/KnesslTC03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamam/KnesslTC03
Charles Knessl, Charles Tier, Doo Il Choi:
A Dynamic Priority Queue Model for Simultaneous Service of Two Traffic Types. SIAM J. Appl. Math. 63(2): 398-422 (2003)
2001
[j38]
- view
  authority control:
- export record
  dblp key:
  - journals/tac/KnesslT01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tac/KnesslT01
Charles Knessl, Charles Tier:
A simple fluid model for servicing priority traffic. IEEE Trans. Autom. Control. 46(6): 909-914 (2001)
1999
[j32]
- view
  authority control:
- export record
  dblp key:
  - journals/siamam/KnesslT99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamam/KnesslT99
Charles Knessl, Charles Tier:
Two Tandem Queues with General Renewal Input I: Diffusion Approximation and Integral Representations. SIAM J. Appl. Math. 59(6): 1917-1959 (1999)
[j31]
- view
  authority control:
- export record
  dblp key:
  - journals/siamam/KnesslT99a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamam/KnesslT99a
Charles Knessl, Charles Tier:
Two Tandem Queues with General Renewal Input II: Asymptotic Expansions for the Diffusion Model. SIAM J. Appl. Math. 59(6): 1960-1997 (1999)
1998
[j29]
- view
  authority control:
- export record
  dblp key:
  - journals/pe/KnesslT98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/pe/KnesslT98
Charles Knessl, Charles Tier:
Asymptotic Approximations and Bottleneck Analysis in Product Form Queueing Networks with Large Populations. Perform. Evaluation 33(4): 219-248 (1998)
[j27]
- view
  authority control:
- export record
  dblp key:
  - journals/siamam/KnesslT98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamam/KnesslT98
Charles Knessl, Charles Tier:
Heavy Traffic Analysis of a Markov-Modulated Queue with Finite Capacity and General Service Times. SIAM J. Appl. Math. 58(1): 257-323 (1998)
1994
[j19]
- view
  authority control:
- export record
  dblp key:
  - journals/siamam/KnesslT94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamam/KnesslT94
Charles Knessl, Charles Tier:
A Processor-Shared Queue that Models Switching Times: Heavy Usage Asymptotics. SIAM J. Appl. Math. 54(3): 854-875 (1994)
1992
[j11]
- view
  authority control:
- export record
  dblp key:
  - journals/tc/KnesslT92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tc/KnesslT92
Charles Knessl, Charles Tier:
Asymptotic Expansions for Large Closed Queueing Networks with Multiple Job Classes. IEEE Trans. Computers 41(4): 480-488 (1992)
1990
[j9]
- view
  authority control:
- export record
  dblp key:
  - journals/ior/KnesslMST90
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ior/KnesslMST90
Charles Knessl, Bernard J. Matkowsky, Zeev Schuss, Charles Tier:
An Integral Equation Approach to the M/G/2 Queue. Oper. Res. 38(3): 506-518 (1990)
[j7]
- view
  authority control:
- export record
  dblp key:
  - journals/jacm/KnesslT90
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jacm/KnesslT90
Charles Knessl, Charles Tier:
Asymptotic Expansions for Large Closed Queuing Networks. J. ACM 37(1): 144-174 (1990)
1987
[j6]
- view
  authority control:
- export record
  dblp key:
  - journals/questa/KnesslMST87
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/questa/KnesslMST87
Charles Knessl, B. J. Matkowsky, Zeev Schuss, Charles Tier:
Busy Period Distribution in State-Dependent Queues. Queueing Syst. Theory Appl. 2(3): 285-305 (1987)
[j5]
- view
  authority control:
- export record
  dblp key:
  - journals/siamcomp/KnesslMST87
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/KnesslMST87
Charles Knessl, B. J. Matkowsky, Zeev Schuss, Charles Tier:
Asymptotic Expansions for a Closed Multiple Access System. SIAM J. Comput. 16(2): 378-398 (1987)
[j4]
- view
  authority control:
- export record
  dblp key:
  - journals/tcom/KnesslMST87
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcom/KnesslMST87
Charles Knessl, Bernard J. Matkowsky, Zeev Schuss, Charles Tier:
Two Parallel M/G/1 Queues where Arrivals Join the System with the Smaller Buffer Content. IEEE Trans. Commun. 35(11): 1153-1158 (1987)
1986
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/questa/KnesslMST86
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/questa/KnesslMST86
Charles Knessl, B. J. Matkowsky, Zeev Schuss, Charles Tier:
A Markov-Modulated M/G/1 Queue I: Stationary Distribution. Queueing Syst. Theory Appl. 1(4): 355-374 (1986)
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/questa/KnesslMST86a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/questa/KnesslMST86a
Charles Knessl, B. J. Matkowsky, Zeev Schuss, Charles Tier:
A Markov-Modulated M/G/1 Queue II: Busy Period and Time for Buffer Overflow. Queueing Syst. Theory Appl. 1(4): 375-399 (1986)
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/tcom/KnesslMST86
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcom/KnesslMST86
Charles Knessl, Bernard J. Matkowsky, Zeev Schuss, Charles Tier:
Two Parallel Queues with Dynamic Routing. IEEE Trans. Commun. 34(12): 1170-1175 (1986)

a service of

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.