Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Kelly, F. P.
and
Laws, C. N.
1993.
Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling.
Queueing Systems,
Vol. 13,
Issue. 1-3,
p.
47.
Fendick, K.W.
and
Rodrigues, M.A.
1994.
Asymptotic analysis of adaptive rate control for diverse sources with delayed feedback.
IEEE Transactions on Information Theory,
Vol. 40,
Issue. 6,
p.
2008.
Kelly, F. P.
1995.
Stochastic Networks.
Vol. 71,
Issue. ,
p.
169.
Gibbens, R.J.
and
Kelly, F.P.
1995.
Network programming methods for loss networks.
IEEE Journal on Selected Areas in Communications,
Vol. 13,
Issue. 7,
p.
1189.
Martins, L. F.
Shreve, S. E.
and
Soner, H. M.
1996.
Heavy Traffic Convergence of a Controlled, Multiclass Queueing System.
SIAM Journal on Control and Optimization,
Vol. 34,
Issue. 6,
p.
2133.
1996.
The Clifford Paterson Lecture, 1995 Modelling communication networks, present and future.
Philosophical Transactions of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences,
Vol. 354,
Issue. 1707,
p.
437.
Harrison, J. Michael
and
Van Mieghem, Jan A.
1997.
Dynamic control of Brownian networks: state space collapse and equivalent workload formulations.
The Annals of Applied Probability,
Vol. 7,
Issue. 3,
Mithal, S.
1998.
Bounds on end-to-end performance via greedy, multi-path routing in integrated services networks.
Vol. 1,
Issue. ,
p.
19.
Mandelbaum, Avishai
and
Reiman, Martin I.
1998.
On Pooling in Queueing Networks.
Management Science,
Vol. 44,
Issue. 7,
p.
971.
Hjalmtysson, G.
and
Whitt, W.
1998.
Approximations for periodic load balancing.
Vol. 1,
Issue. ,
p.
35.
Bell, S.L.
and
Williams, R.J.
1999.
Dynamic scheduling of a system with two parallel servers: asymptotic policy in heavy traffic.
Vol. 3,
Issue. ,
p.
2255.
Harrison, J. Michael
2000.
Brownian models of open processing networks: canonical representation of workload.
The Annals of Applied Probability,
Vol. 10,
Issue. 1,
Bramson, M.
and
Williams, R.J.
2000.
On dynamic scheduling of stochastic networks in heavy traffic and some new results for the workload process.
Vol. 1,
Issue. ,
p.
516.
Kushner, Harold J.
2001.
Applied and Computational Control, Signals, and Circuits.
p.
31.
Bell, S. L.
and
Williams, R. J.
2001.
Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: asymptotic optimality of a threshold policy.
The Annals of Applied Probability,
Vol. 11,
Issue. 3,
Nam, Ick-Hyun
2001.
Dynamic Scheduling for a Flexible Processing Network.
Operations Research,
Vol. 49,
Issue. 2,
p.
305.
Squillante, M.S.
Xia, C.H.
Yao, D.D.
and
Li Zhang
2001.
Threshold-based priority policies for parallel-server systems with affinity scheduling.
p.
2992.
Chen, Hong
Shen, Xinyang
and
Yao, David D.
2002.
Brownian Approximations of Multiclass Open-Queueing Networks.
Operations Research,
Vol. 50,
Issue. 6,
p.
1032.
Andradóttir, Sigrún
Ayhan, Hayriye
and
Down, Douglas G.
2003.
Dynamic Server Allocation for Queueing Networks with Flexible Servers.
Operations Research,
Vol. 51,
Issue. 6,
p.
952.
Gurumurthi, Suri
and
Benjaafar, Saif
2004.
Modeling and analysis of flexible queueing systems.
Naval Research Logistics (NRL),
Vol. 51,
Issue. 5,
p.
755.