Une bibliographie sur les réseaux et files d'attente

Cette bibliographie est également disponible sous forme d'un fichier BibTeX

[1]

Joseph Abate and Ward Whitt. Modeling service-time distributions with non-exponential tails: beta mixtures of exponentials. Comm. Statist. Stochastic Models, 15(3):517-546, 1999.

[2]

Cedric Adjih, Philippe Jacquet, and Philippe Robert. Differentiated admission control in large networks. In INFOCOM (3), pages 1455-1460, 2000.

[3]

Larissa G. Afanassieva, Guy Fayolle, and Leonid V. Nazarov. Preliminary models for moving servers networks. Rapport de Recherche 2469, INRIA, Rocquencourt BP 105 -- 78153 Le Chesnay -- France, January 1995.

[4]

Larissa G. Afanassieva, Guy Fayolle, and Serguei Yu. Popov. Models for transportation networks. Rapport de Recherche 2834, INRIA, Rocquencourt BP 105 -- 78153 Le Chesnay -- France, March 1996.

[5]

L. G. Afanassieva, F. Delcoigne, and G. Fayolle. On polling systems where servers wait for customers. Markov Process. Related Fields, 3(4):527-545, 1997. Statistical mechanics of large networks (Rocquencourt, 1996).

[6]

Marianne Akian, Jean-Pierre Quadrat, and Michel Viot. Duality between probability and optimization. In J. Gunawardena, editor, Idempotency. Cambridge Univ. press, 1996.

[7]

Venkat Anantharam and M. Benchekroun. A technique for computing sojourn times in large networks of interacting queues. Probability in the Engineering and Informational Sciences, 7:441-464, 1993.

[8]

Venkat Anantharam and Takis Konstantopoulos. A functional central limit theorem for the jump counts of Markov processes with an application to Jackson networks. Adv. in Appl. Probab., 27(2):476-509, 1995.

[9]

V. Anantharam. A mean field limit for a lattice caricature of dynamic routing in circuit switched networks. Ann. Appl. Probab., 1(4):481-503, 1991.

[10]

B. D. O. Anderson and T. Kailath. Forwards and backwards models for finite-state Markov processes. Adv. in Appl. Probab., 11(1):118-133, 1979.

[11]

H. Arsham, A. Feuerverger, D. L. McLeish, J. Kreimer, and R. Y. Rubinstein. Sensitivity analysis and the what if problem in simulation analysis. Mathl Comput. Modelling, 12(2):193-219, 1989.

[12]

Ambalavanar Arulambalam, Xiaoqiang Chen, and Nirwan Ansari. Allocating fair rates for available bit rate service in ATM networks. IEEE Communication Magazine, November 1996.

[13]

Søren Asmussen and Reuven Y. Rubinstein. Performance evaluation for the score function method in sensitivity analysis and stochastic optimization. Preprint, February 1991.

[14]

Søren Asmussen and Reuven Y. Rubinstein. The efficiency and heavy traffic properties of the score function method in sensitivity analysis of queueing models. Advances in Applied Probability, 24:172-201, 1992.

[15]

Søren Asmussen, Andreas Frey, Tomasz Rolski, and Volker Schmidt. Does Markov-modulation increase the risk? Astin Bulletin, 25(1):49-65, 1995.

[16]

Søren Asmussen. Light traffic equivalence in single server queues. Preprint, 1991.

[17]

Sanjar Aspandiiarov and Roudolf Iasnogorodski. Three-dimensional reflected driftless random walks in troughs: new asymptotic behavior. Ann. Inst. H. Poincaré Probab. Statist., 35(1):49-83, 1999.

[18]

Sanjar Aspandjiarov, Roudolf Iasnogorodski, and Michael Menshikov. Passage-time moments for nonnegative stochastic processes and an application to reflected random walks in a quadrant. Annals of Probability, 24(2):932-960, 1996.

[19]

I. M. Asymont, G. Fayolle, and M. V. Menshikov. Random walks in a quarter plane with zero drifts: Transience amd recurrence. Journal of Applied Probability, 32:941-955, 1995.

[20]

Krishna B. Athreya and Peter Ney. A renewal approach to the Perron-Frobenius theory of nonnegative kernels on general state spaces. Math. Z., 179(4):507-529, 1982.

[21]

François Baccelli and Pierre Brémaud. Palm Probabilities and Stationary Queues, volume 41 of Lecture Notes in Statistics. Springer-Verlag, 1987.

[22]

François Baccelli and Pierre Brémaud. Virtual customers in sensitivity and light traffic analysis. Preprint, March 1991.

[23]

François Baccelli and Serguei Foss. On the saturation rule for the stability of queues. rapport de recherche 2015, INRIA, September 1993.

[24]

François Baccelli and Serguei Foss. Ergodicity of Jackson-type queueing networks. Queueing Systems Theory Appl., 17(1-2):5-72, 1994.

[25]

François Baccelli and Gérard Hebuterne. On queues with impatient customers. Rapport de Recherche 94, INRIA, Rocquencourt BP 105 -- 78153 Le Chesnay -- France, 1981.

[26]

François Baccelli, P. Boyer, and Gérard Hebuterne. Single-server queues with impatient customers. Advances in Applied Probability, 16:887-905, 1984.

[27]

F. Baccelli, F. I. Karpelevich, M. Ya. Kel'bert, A. A. Puhalskii, A. N. Rybko, and Yu. M. Suhov. A mean-field limit for a class of queueing networks. J. Statist. Phys., 66(3-4):803-825, 1992.

[28]

François Baccelli, William A. Massey, and Paul E. Wright. Determining the exit time distribution for a closed cyclic network. Theoret. Comput. Sci., 125(1):149-165, 1994.

[29]

Joseph E. Baker and Izhak Rubin. Polling with a general-service order table. IEEE Transactions on Computers, 35(3):283-288, 1987.

[30]

Gang Bao and Christos G. Cassandras. First and second derivative estimators of a closed queueing network throughput using perturbation analysis techniques. Preprint, feb 1992.

[31]

A. D. Barbour and Timothy C. Brown. The Stein-Chen method, point processes and compensators. Ann. Probab., 20(3):1504-1527, 1992.

[32]

A. D. Barbour and Timothy C. Brown. Approximate versions of Melamed's theorem. J. Appl. Probab., 33(2):472-489, 1996.

[33]

A. D. Barbour and V. Cekanavicius. Total variation asymptotics for sums of independent integer random variables. Ann. Probab., 30(2):509-545, 2002.

[34]

A. D. Barbour and G. K. Eagleson. Poisson approximation for some statistics based on exchangeable trials. Adv. in Appl. Probab., 15(3):585-600, 1983.

[35]

N. G. Bean, R. J. Gibbens, and S. Zachary. The performance of single resource loss systems in multiservice networks. Technical Report 93-10, Statistical Laboratory, University of Cambridge, 1993.

[36]

Dimitri Bertsekas and Robert Gallager. Data Networks. Prentice-Hall International, 2nd edition, 1992.

[37]

Partha P. Bhattacharya and Anthony Ephremides. Stochastic monotonicity properties of multiserver queues with impatient customers. Journal of Applied Probability, 28:673-682, 1991.

[38]

J. D. Biggins and D. R. Grey. A note on the growth of random trees. Statist. Probab. Lett., 32(4):339-342, 1997.

[39]

N. H. Bingham, C. M. Goldie, and J. L. Teugels. Regular variation. Cambridge University Press, Cambridge, 1987.

[40]

Alexander Birman and Yaakov Kogan. Asymptotic evaluation of closed queueing networks with many stations. Communications in Statistics--Stochastic Models, 8(3):543-563, 1992.

[41]

Alexander Birman and Yaakov Kogan. Error bounds for asymptotic approximations of the partition function. Queueing Systems Theory Appl., 23(1-4):217-234, 1996.

[42]

Leonid Boguslavski, Albert G. Greenberg, Philippe Jacquet, Clyde P. Krustal, and Alexandre Stolyar. Models of memory interference in multiprocessors. Rapport de Recherche 1469, INRIA, June 1991.

[43]

Jean-Chrysostome Bolot and A. Udaya Shankar. Analysis of a fluid approximation to flow control dynamics. In Proceedings of INFOCOM'92, pages 2398-2407, 1992.

[44]

A.A. Borovkov and O.J. Boxma. On large deviation probabilities for random walks with heavy tails. Technical Report 2001-027, EURANDOM, 2001.

[45]

A. A. Borovkov and R. Schassberger. Ergodicity of a Jackson network with batch arrivals. Journal of Applied Probability, 31(3):847-853, 1994.

[46]

A. A. Borovkov and R. Schassberger. Ergodicity of a polling network. Stochastic Processes and their Applications, 50(2):253-262, 1994.

[47]

Sem C. Borst, Onno J. Boxma, and Predrag R. Jelenkovic. Indiced burstiness in generalized processor sharing queues with long-tailed traffic flows. Technical Report PNA-R0004, CWI, 2000.

[48]

Sem C. Borst, Onno J. Boxma, J. A. Morrisson, and R. Núñez Queija. The equivalence between processor sharing and service in random order. SPOR Report 2002-01, Technische universiteit Eindhoven, January 2002.

[49]

Sem C. Borst, Onno J. Boxma, and R. Núñez Queija. Heavy tails: The effect of the service discipline. In T. Field, P.G. Harrison, J. Bradley, and U. Harder, editors, Computer Performance Evaluation, Modelling Techniques and Tools 12th International Conference, TOOLS 2002, number 2324 in Lecture Notes in Computer Science, pages 1-30. Springer, 2002.

[50]

D. D. Botvich and A. A. Zamyatin. On fluid approximations for conservative networks. Markov Process. Related Fields, 1(1):113-140, 1995.

[51]

Richard J. Boucherie. Product forms based on backward traffic equations. J. Appl. Probab., 32(2):508-518, 1995.

[52]

O. J. Boxma and J. W. Cohen. Heavy-traffic analysis for the GI/G/1 queue with heavy-tailed distributions. Technical Report PNA-R9710, CWI, July 1997.

[53]

O. J. Boxma and J. W. Cohen. The single server queue: Heavy tails and heavy traffic. In K. Park and W. Willinger, editors, Self-similar Network Traffic and Performance Evaluation, pages 143-169. Wiley, New-York, 2000.

[54]

Onno J. Boxma and Vincent Dumas. Fluid queues with long-tailed activity period distributions. Technical Report PNA-R9705, CWI - Centrum voor Wiskunde en Informatica, April 1997.

[55]

O. J. Boxma and W. P. Groenendijk. Pseudoconservation laws in cyclic-service systems. J. Appl. Probab., 24(4):949-964, 1987.

[56]

Onno J. Boxma and Wim P. Groenendijk. Waiting times in discrete-time cyclic-service systems. IEEE Trans. Comm., 36(2):164-170, 1988.

[57]

O. J. Boxma and I. A. Kurkova. The M/M/1 queue in a heavy-tailed random environment. Statist. Neerlandica, 54(2):221-236, 2000. Stochastic operations research.

[58]

O. J. Boxma and I. A. Kurkova. The M/G/1 queue with two service speeds. Adv. in Appl. Probab., 33(2):520-540, 2001.

[59]

Onno J. Boxma and J. A. Weststrate. Waiting time in polling systems with Markovian server routing. In Messung, Modellierung und Bewertung von Rechensysteme, pages 89-104, Berlin, 1989. Proc. Conference Braunschweig, Springer-Verlag.

[60]

O. J. Boxma, W. P. Groenendijk, and J. A. Weststrate. A pseudoconservation law for service systems with a polling table. IEEE trans. on commun., COM-38, 10:1865-1870, 1990.

[61]

Onno J. Boxma, H. Levy, and J. A. Westrate. Efficient visit frequencies for polling tables: Minimization of waiting cost. Queueing Systems, Theory and Applications, 9:133-162, 1991.

[62]

Onno J. Boxma, H. Levy, and J. A. Westrate. Efficient visit orders for polling systems. Performance Evaluation, 2(18):103-123, 1993.

[63]

Onno J. Boxma, J. A. Weststrate, and U. Yechiali. A globally gated system with server interruptions, and applications to the repairman problem. Probability in the Engineering and Informational Sciences, 7:187-208, 1993.

[64]

O. J. Boxma, Q. Deng, and J. A. C. Resing. Polling systems with regularly varying services and/or switchover times. Technical Report Memorandum COSOR 99-10, Eindhoven University of Technology, 1999.

[65]

O. J. Boxma, S. G. Foss, J.-M. Lasgouttes, and R. Núñez Queija. Waiting time asymptotics in the single server queue with service in random order. Technical Report 2003-02, EURANDOM, 2003.

[66]

O. J. Boxma, S. G. Foss, J.-M. Lasgouttes, and R. Núñez Queija. Waiting time asymptotics in the single server queue with service in random order. Queueing Systems, Theory and Applications, 46(1):35-74, 2004. (Gzipped PostScript, 36 pages, 251822 bytes) (PDF, 323777 bytes)

[67]

Onno J. Boxma. Static optimization of queueing systems. In Recent trends in optimization theory and applications, pages 1-16. World Sci. Publishing, River Edge, NJ, 1995.

[68]

Hugh S. Bradlow and Houston F. Byrd. Mean waiting time evaluation of packet switches for centrally controlled PBX's. Performance Evaluation, 7(4):309-327, 1987.

[69]

Pierre Brémaud and Wei-Bo Gong. Derivatives of likelihood ratios and smoothed perturbation analysis for the routing problem. Rapport de Recherche 1495, INRIA, Rocquencourt BP 105 -- 78153 Le Chesnay -- France, September 1991.

[70]

Pierre Brémaud and J. Jacod. Processus ponctuels et martingales : résultats récents sur la modélisation et le filtrage. Advances in Applied Probability, 9:362-416, 1977.

[71]

Pierre Brémaud and Jean-Marc Lasgouttes. Stationary IPA estimates for non-smooth functions of the GI/G/1/ infty workload. Rapport de Recherche 1677, INRIA, Rocquencourt BP 105 -- 78153 Le Chesnay -- France, May 1992. (Gzipped PostScript, 32 pages, 94733 bytes)

[72]

Pierre Brémaud and Jean-Marc Lasgouttes. Stationary IPA estimates for non-smooth G/G/1/ infty functionals via Palm inversion and level-crossing analysis. Discrete Event Dynamic Systems: Theory and Applications, 3(4):347-374, 1993. (Gzipped PostScript, 24 pages, 126197 bytes)

[73]

Pierre Brémaud and Laurent Massoulié. Maximal coupling rare perturbation analysis with a random horizon. to appear, 1993.

[74]

Pierre Brémaud and Felisa J. Vázquez-Abad. On the pathwise computation of derivatives with respect to the rate of a point process: the phantom RPA method. Queueing Systems, Theory and Applications, 10(3):249-270, 1992.

[75]

Pierre Brémaud, Raghavan Kannurpatti, and Ravi Mazumdar. Event and time averages: a review. Preprint, January 1990.

[76]

Pierre Brémaud. Point Processes and Queues -- A Martingale Approach. Springer Verlag, New-York, 1981.

[77]

Pierre Brémaud. An elementary proof of Sengupta's invariance relation and a remark on Miyazawa's conservation principle. Journal of Applied Probability, 28:950-954, 1991.

[78]

Pierre Brémaud. Maximal coupling and rare perturbation analysis. Queueing Systems, Theory and Applications, 11(4):307-333, 1992.

[79]

Pierre Brémaud. A Swiss Army formula of Palm calculus. Journal of Applied Probability, 30:40-51, 1993.

[80]

François Brichet, Laurent Massoulié, and James W. Roberts. Stochastic ordering and the notion of negligible cdv. preprint, September 1996.

[81]

Timothy C. Brown and Darryl Greig. Correction to: ``Stein's method and point process approximation'' [Stochastic Process. Appl. 43 (1992), no. 1, 9-31; MR 93k:60120] by A. D. Barbour and Brown. Stochastic Process. Appl., 54(2):291-296, 1994.

[82]

Timothy C. Brown and Darryl Greig. Poisson approximation for point processes via monotone couplings. Ann. Appl. Probab., 6(2):545-560, 1996.

[83]

T. C. Brown and P. K. Pollett. Some distributional approximations in Markovian queueing networks. Adv. in Appl. Probab., 14(3):654-671, 1982.

[84]

T. C. Brown and P. K. Pollett. Poisson approximations for telecommunications networks. J. Austral. Math. Soc. Ser. B, 32(3):348-364, 1991.

[85]

M. A. Brun and G. Fayolle. The distribution of the transaction processing time in a simple fork-join system. In Computer performance and reliability (Rome, 1987), pages 203-212. North-Holland, Amsterdam, 1988.

[86]

Xi-Ren Cao and Dye-Jyun Ma. New performance sensitivity formulae for a class of product-form queueing networks. Discrete Event Dynamic Systems: Theory and Applications, 1:289-313, 1992.

[87]

Xi-Ren Cao, Wei-Bo Gong, and Yorai Wardi. Nondifferentiable performance functions of queueing systems with discrete random service times. Submitted to Queueing Systems, June 1990.

[88]

Xi-Ren Cao. Convergence of parameter sensitivity estimates in a stochastic experiment. IEEE Transactions on Automatic Control, 30(9):834-843, 1985.

[89]

Xi-Ren Cao. Realization probability in closed Jackson queueing networks and its application. Advances in Applied Probability, 19:708-738, 1987.

[90]

Xi-Ren Cao. System representation and performance sensitivity estimates of discrete event systems. Mathematics and Computers in Simulation, 31:113-122, 1989.

[91]

Xi-Ren Cao. Some linear algebraic formulas of the performance sensitivities of queueing networks. In Proceedings of American Control Conference, pages 1011-1016, 1990.

[92]

Xi-Ren Cao. Perturbation analysis of closed queueing networks with general service time distributions. IEEE Transactions on Automatic Control, 36(11):1327-1331, 1991.

[93]

Xi-Ren Cao. A new method of performance sensitivity analysis for non-Markovian queueing networks. Queueing Systems, Theory and Applications, 10:313-350, 1992.

[94]

John S. Carson and Averill M. Law. Conservation equations and variance reduction in queueing simulation. Operations Research, 28(3):535-546, 1980.

[95]

Christos G. Cassandras, Wei-Bo Gong, and J. I. Lee. Robustness of perturbation analysis estimators for queueing systems with unknown distributions. Journal of Optimization Theory and Applications, 70(3):491-519, 1991.

[96]

Cheng-Shang Chang and Randolph Nelson. Perturbation analysis of the M/M/1 queue in a Markovian environment via the matrix-geometric method. Comm. Statist. Stochastic Models, 9(2):233-246, 1993.

[97]

Cheng-Shang Chang. Stability, queue length and delay, part i: Deterministic queueing networks. Technical Report 77962, IBM Research Division, 1992.

[98]

Kow C. Chang. Stability conditions for a pipeline polling scheme in satellite communications. Queueing Systems, Theory and Applications, 14:339-348, 1993.

[99]

Xiulu Chao, Masakiyo Miyazawa, and Michael Pinedo. Queueing Networks: Customers, Signals and Product Form Solutions. Wiley, 1999.

[100]

Claudine Chaouiya, Sophie Lefebvre-Barbaroux, and Alain Jean-Marie. Real-time scheduling of periodic tasks. In Scheduling theory and its applications, pages 167-191. Wiley, Chichester, 1995.

[101]

A. Charny, D. D. Clark, and R. Jain. Congestion control with explicit rate indication. In IEEE, editor, ICC'95: IEEE International Conference on Communications (1995 : Seattle, WA, USA), pages 1954-1963. IEEE Computer Society Press, June 1995.

[102]

Anna Charny, K. K. Ramakrishnan, and Anthony Lauck. Time scale analysis scalability issues for explicit rate allocation in ATM networks. IEEE/ACM Transactions on Networking, 4(4):569-581, August 1996.

[103]

Edwin K. P. Chong and Peter J. Ramadge. Convergence of recursive optimization algorithms using infinitesimal perturbation analysis estimates. Discrete Event Dynamic Systems: Theory and Applications, 1:339-372, 1992.

[104]

E. G. Coffman, Jr. and E. N. Gilbert. A continuous polling system with constant service times. IEEE Trans. Inf. Th., IT-32:584-591, 1986.

[105]

E. G. Coffman, Jr. and A. L. Stolyar. Continuous polling on graphs. Probability in the Engineering and Informational Sciences, 7:209-226, 1993.

[106]

J. W. Cohen. The Single Server Queue. North-Holland, 1982.

[107]

J. W. Cohen. Heavy-traffic limit theorems for the heavy-tailed GI/G/1 queue. Technical Report PNA-R9719, CWI, December 1997.

[108]

J. W. Cohen. Heavy-traffic theory for the heavy-tailed M/G/1 queue and nu-stable Lévy noise traffic. Technical Report PNA-R9805, CWI, July 1998.

[109]

J. W. Cohen. On Regenerative Processes in Queueing Theory, volume 121 of Lecture Notes in Economics and Mathematical Systems. Springer Verlag, 1999.

[110]

R. M. Corless, G. H. Gonnet, D. E. G. Hare, D. J. Jeffrey, and D. E. Knuth. On the Lambert W function. Adv. Comput. Math., 5(4):329-359, 1996.

[111]

A. J. Coyle, W. Henderson, C. E. M. Pearce, and P. G. Taylor. A general formulation for mean-value analysis in product-form batch-movement queueing networks. Queueing Systems, Theory and Applications, 16:363-372, 1994.

[112]

Peggy Cénac, Guy Fayolle, and Jean-Marc Lasgouttes. Dynamical systems in the analysis of biological sequences. Rapport de Recherche 5351, INRIA, October 2004. (Gzipped PostScript, 50 pages, 389409 bytes)

[113]

Carlos F. Daganzo. Some properties of polling systems. Queueing Systems, Theory and Applications, 6(2):137-154, 1990.

[114]

L. Dai and Yu-Chi Ho. Structural infinitesimal perturbation analysis (SIPA) for derivative estimation in discrete event dynamic systems. Preprint, 1992.

[115]

Jim Dai and Sean Meyn. Stability and convergence of moments for multiclass queueing networks via fluid limit models. IEEE Transactions on Automatic Control, 40(11):1889-1904, 1995.

[116]

D. J. Daley and T. Rolski. Light traffic approximations in general stationary single-server queues. Preprint, 1990.

[117]

D. J. Daley and T. Rolski. Light traffic approximations in many-server queues. Preprint, 1990.

[118]

D. J. Daley and T. Rolski. Light traffic approximations in queues. Mathematics of Operations Research, 14, 1990.

[119]

Jean-François Dantzer and Philippe Robert. Fluid limits on string valued Markov processes. Advances in Applied Probability, 12(3):860-889, 2002.

[120]

A. de La Fortelle and G. Fayolle. Large deviation principle for a Markov chain with a countable state space. Technical Report 3503, INRIA, 1998.

[121]

Arnaud de La Fortelle, Cyril Furtlehner, and Jean-Marc Lasgouttes. Statistical physics algorithms for traffic reconstruction. ERCIM News, 67:34-35, January 2007.

[122]

A. De Meyer and J. L. Teugels. On the asymptotic behaviour of the distributions of the busy period and service time in M/G/1. J. Appl. Probab., 17(3):802-813, 1980.

[123]

L. Decreusefond. Perturbation analysis and Malliavin calculus. Ann. Appl. Probab., 8(2):496-523, 1998.

[124]

Franck Delcoigne and Arnaud de La Fortelle. Large deviations problems for star networks: the min policy -- part i: Finite time. Technical Report 4143, INRIA, 2001.

[125]

Franck Delcoigne and Guy Fayolle. Thermodynamical limit and propagation of chaos in polling systems. Markov Processes and Related Fields, 5(1):89-124, 1999.

[126]

L. Devroye. Branching processes in the analysis of the heights of trees. Acta Inform., 24(3):277-298, 1987.

[127]

Luc Devroye. Coupled samples in simulation. Operations Research, 38(1):115-126, 1990.

[128]

V. Dumas and A. Simonian. Asymptotic bounds for the fluid queue fed by sub-exponential on/off sources. Adv. in Appl. Probab., 32(1):244-255, 2000.

[129]

Vincent Dumas. Harris ergodicity of a multiclass queuing network via its associated fluid limit model. Technical Report RR-2177, INRIA, 1993.

[130]

Vincent Dumas. A multiclass network with non-linear, non-convex, non-monotonic stability conditions. Queueing Systems Theory Appl., 25(1-4):1-43, 1997.

[131]

Martin Eisenberg. Queues with periodic service and changeover time. Operations Res., 20:440-451, 1972.

[132]

Robert J. Elliott and Allanus H. Tsoi. Integration by parts for Poisson processes. Preprint, 1991.

[133]

Richard S. Ellis. Large deviations for a general class of random vectors. Annals of Probability, 12(1):1-12, 1984.

[134]

Guy Fayolle and Roudolf Iasnogorodski. Two coupled processors: the reduction to a Riemann-Hilbert problem. Z. Wahrsch. Verw. Gebiete, 47(3):325-351, 1979.

[135]

Guy Fayolle and Maxim Krikun. Growth rate and ergodicity conditions for a class of random trees. In Mathematics and Computer Science II: Algorithms, Trees, Combinatorics and Probabilities, Trends in Mathematics, pages 381-391. Birkhaüser, 2002.

[136]

Guy Fayolle and Jean-Marc Lasgouttes. A state-dependent polling model with Markovian routing. Rapport de Recherche 2279, INRIA, Rocquencourt BP 105 -- 78153 Le Chesnay -- France, June 1994. (Gzipped PostScript, 31 pages, 1079224 bytes)

[137]

Guy Fayolle and Jean-Marc Lasgouttes. Asymptotics and scalings for large closed product-form networks via the Central Limit Theorem. Rapport de Recherche 2754, INRIA, December 1995. (Gzipped PostScript, 43 pages, 149573 bytes)

[138]

Guy Fayolle and Jean-Marc Lasgouttes. Limit laws for large product-form networks: connections with the Central Limit Theorem. Rapport de Recherche 2513, INRIA, March 1995. (Gzipped PostScript, 29 pages, 804542 bytes)

[139]

Guy Fayolle and Jean-Marc Lasgouttes. A state-dependent polling model with Markovian routing. In Frank P. Kelly and Ruth R. Williams, editors, The IMA Volumes in Mathematics and its Applications, volume 71 of Stochastic Networks, pages 283-312. Springer-Verlag, 1995. (Gzipped PostScript, 29 pages, 119110 bytes)

[140]

Guy Fayolle and Jean-Marc Lasgouttes. Asymptotics and scalings for large closed product-form networks via the Central Limit Theorem. Markov Processes and Related Fields, 2(2):317-348, 1996. (Gzipped PostScript, 34 pages, 149306 bytes)

[141]

Guy Fayolle and Jean-Marc Lasgouttes, editors. Special Issue on Statistical Mechanics of Large Networks, volume 3 of Markov Processes and Related Fields, 1997.

[142]

G. Fayolle and J.-M. Lasgouttes. A nonlinear integral operator encountered in the bandwidth sharing of a star-shaped network. In Mathematics and Computer Science: Algorithms, Trees, Combinatorics and Probabilities, Trends in Mathematics, pages 231-242. Birkhaüser, 2000. (Gzipped PostScript, 12 pages, 80761 bytes)

[143]

G. Fayolle and J.-M. Lasgouttes. Partage de bande passante dans un réseau : approches probabilistes. Rapport de Recherche 4202, INRIA, 2001. (Gzipped PostScript, 75 pages, 327747 bytes)

[144]

Guy Fayolle and A. A. Zamyatin. Controlled random walks in Z^N_+ and their applications to queueing networks. Preprint, 1993. To appear.

[145]

G. Fayolle, I. Mitrani, and R. Iasnogorodski. Sharing a processor among many job classes. J. Assoc. Comput. Mach., 27(3):519-532, 1980.

[146]

Guy Fayolle, Philippe Flajolet, Micha Hofri, and Philippe Jacquet. Analysis of a stack algorithm for random multiple-access communication. IEEE Trans. Inform. Theory, 31(2):244-254, 1985.

[147]

Guy Fayolle, Roudolf Iasnogorodski, and Vadim Malyshev. Algebraic generating functions for two-dimendional random walks. Rapport de Recherche 1184, INRIA, 1990.

[148]

Guy Fayolle, Stéphane Grumbach, and Christophe Tollu. Asymptotic probabilities of languages with generalized quantifiers. In Eighth Annual IEEE Symposium on Logic in Computer Science (Montreal, PQ, 1993), pages 199-207. IEEE Comput. Soc. Press, Los Alamitos, CA, 1993.

[149]

Guy Fayolle, Vadim A. Malyshev, and M. V. Menshikov. Topics in the Constructive Theory of Countable Markov Chains. Cambridge University Press, 1995.

[150]

Guy Fayolle, Arnaud de La Fortelle, Jean-Marc Lasgouttes, Laurent Massoulié, and James Roberts. Best-effort networks: modeling and performance analysis via large networks asymptotics. In Proceedings of IEEE INFOCOM 2001, pages 709-716, 2001. (Gzipped PostScript, 8 pages, 88632 bytes) (PDF, 98541 bytes)

[151]

Guy Fayolle, Maxim Krikun, and Jean-Marc Lasgouttes. Birth and death processes on certain random trees: Classification and stationary laws. Technical Report 4380, INRIA, Rocquencourt BP 105 -- 78153 Le Chesnay -- France, February 2002. (Gzipped PostScript, 31 pages, 160046 bytes)

[152]

Guy Fayolle, Maxim Krikun, and Jean-Marc Lasgouttes. Birth and death processes on certain random trees: Classification and stationary laws. Probability Theory and Related Fields, 128(3):386-418, 2004. Digital Object Identifier: 10.1007/s00440-003-0311-1.

[153]

Guy Fayolle. On random walks arising in queueing systems: ergodicity and transience via quadratic forms as Lyapounov functions. I. Queueing Systems Theory Appl., 5(1-3):167-183, 1989. Mathematical theory of queueing systems (Ithaca, NY, 1988).

[154]

William Feller. On the Berry-Esseen theorem. Zeitschrift für Wahrscheinlichkeitstheorie und verw. Geb., 10:261-268, 1968.

[155]

William Feller. An Introduction to Probability Theory and its Applications, Vol. II. John Wiley & Sons, 2 edition, 1971.

[156]

Kerry W. Fendick and Manoel A. Rodrigues. Asymptotic analysis of adaptative rate control for diverse sources with delayed feedback. IEEE Transactions on Information Theory, 40(6):2008-2025, 1994.

[157]

Michael J. Ferguson. Mean waiting time for a token ring with station dependent overheads. In R. L. Pickholtz, editor, Local Area & Multiple Access Networks, chapter 3, pages 43-67. Computer Science Press, Rockville, Maryland, 1986.

[158]

S. G. Foss. Some properties of open queueing networks. Problemy Peredachi Informatsii, 25(3):90-97, 1989.

[159]

Jean-Michel Fourneau and Dominique Verchère. G-networks with triggered batch state-dependent movement. presented at IEEE MASCOT'95 conference, 1995.

[160]

Bennett L. Fox and Paul Glasserman. Estimating derivatives via Poisson equation. Probability in the Engineering and Informational Sciences, 5(4):415-428, 1991.

[161]

Christine Fricker and M. R. Jaïbi. Monotonicity and stability of periodic polling models. Queueing Systems, Theory and Applications, 15:211-238, 1994.

[162]

Christine Fricker and M. R. Jaïbi. Stability of a polling model with a Markovian scheme. Rapport de Recherche 2278, INRIA, Rocquencourt BP 105 -- 78153 Le Chesnay -- France, May 1994.

[163]

Christine Fricker, Philippe Robert, Ellen Saada, and Danielle Tibi. Analysis of some networks with interaction. Ann. Appl. Probab., 4(4):1112-1128, 1994.

[164]

Christine Fricker, Philippe Robert, and Danielle Tibi. On the rates of convergence of Erlang's model. J. Appl. Probab., 36(4):1167-1184, 1999.

[165]

Michael C. Fu and Jian-Qiang Hu. On choosing the characterization for smoothed perturbation analysis. IEEE Transactions on Automatic Control, 36(11):1331-1336, 1991.

[166]

Michael C. Fu and Jian-Qiang Hu. Extensions and generalizations of smoothed perturbation analysis in a generalized semi-Markov process framework. IEEE Transactions on Automatic Control, 37(10):1483-1500, 1992.

[167]

Michael C. Fu. Convergence of a stochastic approximation algorithm for the GI/G/1 queue using perturbation analysis. Journal of Optimization Theory and Applications, 65(1):149-160, 1990.

[168]

S. W. Fuhrmann and Robert B. Cooper. Stochastic decompositions in the M/G/1 queue with generalized vacations. Oper. Res., 33(5):1117-1129, 1985.

[169]

Cyril Furtlehner and Jean-Marc Lasgouttes. Belief propagation inference with a prescribed fixed point. Preprint, 2007.

[170]

Cyril Furtlehner and Jean-Marc Lasgouttes. A queueing theory approach for a multi-speed exclusion process. In Cécile Appert-Rolland et al., editors, Traffic and Granular Flow '07, pages 129-138. Springer, 2009.

[171]

Cyril Furtlehner, Arnaud de La Fortelle, and Jean-Marc Lasgouttes. Belief-propagation algorithm for a traffic prediction system based on probe vehicles. Rapport de Recherche 5807, INRIA, January 2006. (Gzipped PostScript, 26 pages, 509825 bytes) (PDF, 596372 bytes)

[172]

Cyril Furtlehner, Jean-Marc Lasgouttes, and Arnaud de La Fortelle. Belief propagation and Bethe approximation for traffic prediction. Rapport de Recherche 6144, INRIA, March 2007. (Gzipped PostScript, 32 pages, 220104 bytes) (PDF, 353794 bytes)

[173]

Cyril Furtlehner, Jean-Marc Lasgouttes, and Arnaud de La Fortelle. A belief propagation approach to traffic prediction using probe vehicles. In Intelligent Transportation Systems Conference, ITSC'07, pages 1022-1027, 2007. (PDF, 162947 bytes)

[174]

Cyril Furtlehner, Jean-Marc Lasgouttes, and Anne Auger. Learning multiple belief propagation fixed points for real time inference. Physica A: Statistical Mechanics and its Applications, 389(1):149-163, 2010.

[175]

H. R. Gail, S. L. Hantler, and B. A. Taylor. Spectral analysis of M/G/1 and G/M/1 type Markov chains. Adv. in Appl. Probab., 28(1):114-165, 1996.

[176]

Alexei A. Gaivoronski, Leyuan Y. Shi, and Ramavarapu S. Sreenivas. Augmented infinitesimal perturbation analysis: an alternate explanation. Discrete Event Dynamic Systems: Theory and Applications, 2:121-138, 1992.

[177]

A. S. Gajrat, A. Hordijk, V. A. Malyshev, and F. M. Spieksma. Fluid approximations of Markov decision chains. Markov Process. Related Fields, 3(1):129-150, 1997.

[178]

Pawel Gazdzicki, Ioannis Lambadaris, and Ravi R. Mazumdar. Blocking probabilities for large multirate Erlang loss systems. Advances in Applied Probability, 25(4):997-1009, 1993.

[179]

L. Georgiadis and Wojtek Szpankowski. Stability of token passing rings. Queueing Systems, Theory and Applications, 11(1-2):7-33, 1992.

[180]

R. J. Gibbens and F.P. Kelly. Distributed connection acceptance control for a connectionless network. In P. Key and D. Smith, editors, Teletraffic Engineering in a Competitive World, pages 941-952, Amsterdam, 1999. ITC 16, Elsevier.

[181]

R. J. Gibbens and F.P. Kelly. Resource pricing and the evolution of congestion control. Automatica, 35(12):1969-1985, December 1999.

[182]

Paul Glasserman and Wei-Bo Gong. Smoothed perturbation analysis for a class of discrete event systems. IEEE Transactions on Automatic Control, 35(11):1218-1230, 1991.

[183]

Paul Glasserman and Wei-Bo Gong. Time-changing and truncating K-capacity queues from one K to another. Journal of Applied Probability, 28(3):647-655, 1991.

[184]

Paul Glasserman and David Yao. Some guidelines and guarantees for common random numbers. Management Science, 38(6):884-908, 1992.

[185]

Paul Glasserman, Jian-Qiang Hu, and Stephen G. Strickland. Strongly consistent steady-state derivative estimates. Probability in the Engineering and Informational Sciences, 5(4):391-413, 1991.

[186]

Paul Glasserman. Smoothing complements and randomized score functions. Preprint, 1990.

[187]

Paul Glasserman. Stochastic monotonicity and conditional Monte Carlo for likelihood ratio. Preprint, October 1990.

[188]

Paul Glasserman. Filtered Monte Carlo. Preprint, April 1991.

[189]

Paul Glasserman. Gradient Estimation via Perturbation Analysis. Kluwer Academic Publishers, Norwell, Massachusetts, 1991.

[190]

Paul Glasserman. Structural conditions for perturbation analysis of queueing systems. Journal of the ACM, 38(4):1005-1025, 1991.

[191]

Paul Glasserman. Derivative estimates from simulation of continuous-time Markov chains. Operations Research, 40(2):292-308, 1992.

[192]

Paul Glasserman. Processes with associated increments. Journal of Applied Probability, 29(2):313-333, 1992.

[193]

Paul Glasserman. Stationary waiting time derivatives. Queueing Systems, Theory and Applications, 12(4):369-390, 1992.

[194]

Peter W. Glynn and Ward Whitt. Ordinary CLT and WLLN versions of L= lambda W. Mathematics of Operations Research, 13(4):674-692, 1988.

[195]

Peter W. Glynn and Ward Whitt. Indirect estimation via L= lambda W. Operations Research, 37(1):82-103, 1989.

[196]

Peter W. Glynn, Benjamin Melamed, and Ward Whitt. Estimating customer and time averages. Preprint, November 1991.

[197]

Peter W. Glynn. A GSMP formalism for discrete event systems. Proceedings of the IEEE, 77(1):14-23, 1989.

[198]

Peter W. Glynn. Likelihood ratio gradient estimation for stochastic systems. Communications of the ACM, 33(10):76-84, 1990.

[199]

Peter W. Glynn. Pathwise convexity and its relation to convergence of time-average derivatives. Management Science, 38(9):1360-1366, 1992.

[200]

Charles M. Goldie and Claudia Klüppelberg. Subexponential distributions. In A practical guide to heavy tails (Santa Barbara, CA, 1995), pages 435-459. Birkhäuser Boston, Boston, MA, 1998.

[201]

Wei-Bo Gong and Yu-Chi Ho. Smoothed (conditional) perturbation analysis of discrete event dynamical systems. IEEE Transactions on Automatic Control, 32(10):858-866, 1987.

[202]

Wei-Bo Gong and Jian-Qiang Hu. The MacLaurin series for the GI/G/1 queue. Preprint, August 1990.

[203]

Wei-Bo Gong, Soracha Nananukul, and Anlu Yan. Padé approximation for stochastic discrete-event systems. IEEE Trans. Automat. Control, 40(8):1349-1358, 1995.

[204]

Wei-Bo Gong. Smoothed perturbation analysis algorithm for a G/G/1 routing problem. In M. Abrams, P. Haigs, and J. Comfort, editors, Proceedings of the 1988 Winter Simulation Conference, pages 525-531, 1988.

[205]

Carl Graham and Sylvie Méléard. Propagation of chaos for a fully connected loss network with alternate routing. Stochastic Process. Appl., 44(1):159-180, 1993.

[206]

Carl Graham and Sylvie Méléard. Chaos hypothesis for a system interacting through shared resources. Probab. Theory Related Fields, 100(2):157-173, 1994.

[207]

Carl Graham and Sylvie Méléard. Dynamic asymptotic results for a generalized star-shaped loss network. Ann. Appl. Probab., 5(3):666-680, 1995.

[208]

Carl Graham and Neil O'Connell. Large deviations at equilibrium for a large star-shaped loss network. Ann. Appl. Probab., 10(1):104-122, 2000.

[209]

Carl Graham. A statistical physics approach to large networks. In Probabilistic models for nonlinear partial differential equations (Montecatini Terme, 1995), pages 127-147. Springer, Berlin, 1996.

[210]

Jan Grandell. Point processes and random measures. Advances in Applied Probability, 9:502-526, 1977.

[211]

A. Greenberg, V. A. Malyshev, and S. Yu. Popov. Stochastic model of massively parallel computation. Markov Processes and Related Fields, 1(4):473-490, 1995.

[212]

Ellen L. Hahne. Round-robin scheduling for max-min fairness in data networks. IEEE Journal on Selected Areas in Communications, 9(7):1024-1039, 1991.

[213]

Philip Heidelberg, Xi-Ren Cao, Michael A. Zazanis, and Rajan Suri. Convergence properties of infinitesimal perturbation analysis estimates. Management Science, 34(11):1281-1302, 1988.

[214]

Bernd Heidergott and Felisa J. Vázquez-Abad. Measure valued differentiation for stochastic processes: the finite horizon case. Technical Report 2000-033, Eurandom, 2000.

[215]

Bernd Heidergott and Felisa J. Vázquez-Abad. Measure valued differentiation for stochastic processes: the random horizon case. Technical Report G-2001-18, GERAD, 2001.

[216]

Yu-Chi Ho and Xi-Ren Cao. Optimization and perturbation analysis of queueing networks. Journal of Optimization Theory and Applications, 40:559-582, 1983.

[217]

Yu-Chi Ho and Xi-Ren Cao. Perturbation Analysis of Discrete Event Dynamic Systems. Kluwer Academic Publishers, 1991.

[218]

Yu-Chi Ho, M. A. Eyler, and T. T. Chien. A gradient technique for general buffer storage design in a serial production line. International Journal of Production Research, 17(6):557-580, 1979.

[219]

Yu-Chi Ho, Leyuan Shi, Liyi Dai, and Wei-Bo Gong. Optimizing discrete event dynamic systems via the gradient surface method. In Proceedings of the 30th Conference on Decision and Control, pages 104-109, 1991.

[220]

Yu-Chi Ho, R. S. Sreenivas, and P. Vakili. Ordinal optimization of DEDS. Discrete Event Dynamic Systems: Theory and Applications, 2:61-88, 1992.

[221]

Micha Hofri and Yaakov Kogan. Asymptotic analysis of product-form distributions related to large interconnection networks. Theoretical Computer Science, 125:61-90, 1994.

[222]

Roger A. Horn and Charles R. Johnson. Topics in matrix analysis. Cambridge University Press, Cambridge, 1991.

[223]

Jian-Qiang Hu. Consistency of infinitesimal perturbation analysis estimators with rates. Queueing Systems, Theory and Applications, 8:265-278, 1991.

[224]

Jian-Qiang Hu. Convexity of sample path performance and strong consistency of infinitesimal perturbation analysis estimates. IEEE Transactions on Automatic Control, 37(2):258-262, 1992.

[225]

Oliver C. Ibe and Xian Cheng. Performance analysis of asymmetric single-buffer polling systems. Performance Evaluation, 10(1):1-14, 1989.

[226]

Irina Ignatyuk and Vadim Malyshev. Classification of random walks in bf z sp 4 sb +. Selecta Math. Soviet., 12(2):129-194, 1993. Selected translations.

[227]

Marius Iosifescu. A very simple proof of a generalization of the Gauss-Kuzmin-Lévy theorem on continued fractions, and related questions. Preprint, 1992.

[228]

Alain Jean-Marie and Philippe Robert. On the transient behavior of the processor sharing queue. Queueing Systems Theory Appl., 17(1-2):129-136, 1994.

[229]

William B. Jones and Arne Magnus. Application of Stieltjes fractions to birth-death processes. In Padé and rational approximation (Proc. Internat. Sympos., Univ. South Florida, Tampa, Fla., 1976), pages 173-179, New York, 1977. Academic Press.

[230]

D. Jungreis, F. Kochman, V. Miller, A. L. Puha, and R. Sedgewick. A birth-death process in binary trees. preprint, April 1998.

[231]

Yu. M. Kabanov and R. Sh. Liptser. On convergence in variation of the distributions of multivariate point processes. Z. Wahrsch. Verw. Gebiete, 63(4):475-485, 1983.

[232]

Alan F. Karr. Palm distributions of point processes and their applications to statistical inference. Contemporary Mathematics, 80:331-358, 1988.

[233]

M. Ya. Kel'bert and Yu. M. Suhov. Circuit-switching networks with FIFO plus justifying blockout service on infinite graphs. Queueing Systems Theory Appl., 4(2):157-169, 1989.

[234]

M. Ya. Kel'bert and Yu. M. Suhov. A Poisson limit theorem for hybrid star networks: mean field approximation. Problemy Peredachi Informatsii, 25(1):78-87, 1989.

[235]

M. Ya. Kel'bert and Yu. M. Suhov. On a class of packet-switching networks on an infinite graph. Queueing Systems Theory Appl., 6(4):391-403, 1990.

[236]

M. Ya. Kel'bert, R. P. Kopeika, and R. N. Shamsiev. On a class of hybrid switching networks with small transit flows. Technical Report 269/87, University of Bielefeld, 1987.

[237]

F. P. Kelly, A. K. Maulloo, and D. K. H. Tan. Rate control for communication networks: shadow prices, proportional fairness and stability. Journal of the Operational Research Society, 49(3):237-252, 1998.

[238]

Frank P. Kelly. Reversibility and Stochastic Networks. Wiley, 1979.

[239]

F.P. Kelly. The Clifford Paterson lecture, 1995 modelling communication networks, present and future. Phil. Trans. R. Soc. Lond. A, 354:437-463, 1996.

[240]

Peter Key and Derek McAulay. Differential qos and pricing in networks: Where flow control meets game theory. IEE Proceedings - Software, 146(1):39-43, February 1999.

[241]

J. F. C. Kingman. On queues in heavy traffic. J. Roy. Statist. Soc. Ser. B, 24:383-392, 1962.

[242]

J. F. C. Kingman. On queues in which customers are served in random order. Proc. Cambridge Philos. Soc., 58:79-91, 1962.

[243]

C. Kipnis and Ph. Robert. A dynamic storage process. Stochastic Process. Appl., 34(1):155-169, 1990.

[244]

Andrzej Kl opotowski and Wojciech Niemiro. Théorèmes limite pour des sommes de vecteurs indépendants qui ne sont pas uniformément négligeables. Technical Report 92-14, Laboratoire analyse, géometrie et applications, Université Paris-Nord, 1992.

[245]

Andrzej Kl opotowski. Limit Theorems for Sums of Dependent Random Vectors in R^d. PWN, Warszawa, 1977.

[246]

Leonard Kleinrock and Hanoch Levy. The analysis of random polling systems. Operations Research, 36(5):716-732, 1988.

[247]

Charles Knessl and Charles Tier. Asymptotic expansions for large closed queueing networks. Journal of the ACM, 37(1):144-174, 1990.

[248]

Yaakov Kogan and Alexander Birman. Asymptotic analysis of closed queueing networks with bottlenecks. In T. Hasegawa, H. Takagi, and Y. Takahashi, editors, Proceedings of the International Conference on Performance of Distributed Systems and Integrated Communication Networks, pages 237-252, Kyoto, 1991.

[249]

Yaakov Kogan and Robert Sh. Lipster. Limit non-stationary behavior of large closed queueing networks with bottlenecks. Queueing Systems, Theory and Applications, 14(1-2):33-55, 1993.

[250]

Yaakov Kogan. Another approach to asymptotic expansions for large closed queueing networks. Operations Research Letters, 11:317-321, 1992.

[251]

Alan G. Konheim and Bernd Meister. Waiting lines and times in a system with polling. Journal of the ACM, 21(3):470-490, 1974.

[252]

Panagiotis Konstantopoulos and Michael Zazanis. Sensitivity analysis for stationary and ergodic queues. Advances in Applied Probability, 24(3):738-750, 1992.

[253]

Panagiotis Konstantopoulos and Michael Zazanis. Sensitivity analysis for stationary and ergodic queues: Additional results. Advances in Applied Probability, 26:556-560, 1994.

[254]

M. Kramer. Stationary distributions in a queueing system with vacation times and limited service. Queueing Systems Theory Appl., 4(1):57-68, 1989.

[255]

Dirk P. Kroese and Volker Schmidt. A continuous polling system with general service times. Advances in Applied Probability, 2(4):906-927, 1992.

[256]

Dirk P. Kroese and Volker Schmidt. Queueing systems on a circle. ZOR -- Methods and Models of Operations Research, 37:303-331, 1993.

[257]

Dirk P. Kroese and Volker Schmidt. Single-server queues with spatially distributed arrivals. Queueing Systems, Theory and Applications, 17:317-345, 1994.

[258]

J. Kuelbs and T. Kurtz. Berry-Esseen estimates in Hilbert space and an application to the law of the iterated logarithm. Annals of Probability, 2:387-407, 1974.

[259]

H. T. Kung, T. Blackwell, and A. Chapman. Credit-based flow control for ATM networks: credit update protocol, adaptative credit allocation, and statistical multiplexing. In Proceedings of SIGCOMM'94, volume 24 of Computer Communication Preview, pages 101-114, 1994.

[260]

Harold J. Kushner and Jichuan Yang. A Monte Carlo method for sensitivity analysis and parametric optimization of nonlinear stochastic systems: the ergodic case. SIAM Journal on Control and Optimization, 30(2):440-464, 1992.

[261]

Jean-Marc Lasgouttes. Crazy maze. Hebdogiciel 21, May 1985.

[262]

Jean-Marc Lasgouttes. Introduction à l'analyse de perturbations infinitésimales. Rapport de DEA, École Polytechnique, 1991.

[263]

Jean-Marc Lasgouttes. Contribution à l'analyse de réseaux stochastiques et application aux systèmes de transport. Thèse de doctorat, École Polytechnique, 1995. (Gzipped PostScript, 99 pages, 284008 bytes)

[264]

Jean-Marc Lasgouttes. Modélisation probabiliste de grands systèmes Praxitèle. INRIA, Mar 1997. Manuel d'utilisation de BigNet 2.00. (Gzipped PostScript, 18 pages, 83877 bytes)

[265]

Jean-Marc Lasgouttes. On allocation of bandwidth in cable access networks. In preparation, 2002.

[266]

J. B. Lasserre. Exact formula for sensitivity analysis of Markov chains. Preprint, 1991.

[267]

Stephen S. Lavenberg. Computer Performance Modelling Handbook. Academic Press, 1983.

[268]

M. Lavrentiev and B. Chabat. Méthodes de la théorie des fonctions d'une variable complexe. Éditions MIR, 1977.

[269]

Pierre l'Ecuyer and Gaétan Perron. On the convergence rates of IPA and FDC derivative estimators for finite horizon stochastic simulations. Les Cahier du GERAD G-90-61, HEC, December 1990.

[270]

Pierre l'Ecuyer, N. Giroux, and Peter W. Glynn. Stochastic optimization by simulation: Some experiments with a simple steady-state queue. Preprint, April 1990.

[271]

Pierre l'Ecuyer. Convergence rates for steady-state derivative estimators. Les Cahier du GERAD G-90-55, HEC, 1990.

[272]

Pierre l'Ecuyer. A unified view of the IPA, SF and LR gradient estimation techniques. Management Science, 36(11):1364-1383, 1990.

[273]

Pierre l'Ecuyer. A note on the interchange of derivative and expectation for LR gradient techniques. Preprint, June 1991.

[274]

Hanoch Levy and Leonard Kleinrock. A queue with starter and a queue with vacations: delay analysis by decomposition. Oper. Res., 34(3):426-436, 1986.

[275]

Hanoch Levy and Leonard Kleinrock. Polling systems with zero switch-over periods: a general method for analyzing the expected delay. Performance Evaluation, 13(2):97-107, 1991.

[276]

Hanoch Levy and Moshe Sidi. Polling systems: Applications, modeling and optimization. IEEE Transactions on Communications, 38(10):1750-1760, 1990.

[277]

Yonatan Levy and Uri Yechiali. Utilization of idle time in an M/G/1 queueing system. Management Science, 22(2):202-211, 1975.

[278]

Yonatan Levy and Uri Yechiali. An M/M/s queue with servers' vacations. INFOR-Canad. J. Operational Res. and Information Processing, 14(2):153-163, 1976.

[279]

Hanoch Levy, Moshe Sidi, and Onno J. Boxma. Dominance relations in polling systems. Queueing Systems, Theory and Applications, 6:155-172, 1990.

[280]

Hanoch Levy. Delay computation and dynamic behavior of nonsymmetric polling systems. Performance Evaluation, 10(1):35-51, 1989.

[281]

Thomas M. Liggett. Interacting particle systems. Springer-Verlag, New York, 1985.

[282]

Thomas M. Liggett. Stochastic models of interacting systems. Annals of Probability, 25(1):1-29, 1997.

[283]

Thomas M. Liggett. Monotonicity of conditional distributions and growth models on trees. Ann. Probab., 28(4):1645-1665, 2000.

[284]

Torgny Lindvall. Stochastic monotonicities in Jackson queueing networks. Probab. Engrg. Inform. Sci., 11(1):1-9, 1997.

[285]

Zhen Liu, Philippe Nain, and Don Towsley. Sample path methods in the control of queues. Queueing Systems Theory Appl., 21(3-4):293-335, 1995.

[286]

Zhen Liu, Philippe Nain, and Don Towsley. Exponential bounds with applications to call admission. J. ACM, 44(3):366-394, 1997.

[287]

Michel Loève. Probability Theory. D. Van Nostrand Company, fourth edition, 1977.

[288]

Joseph B. Logsdon and Jeffrey W. Gluck. Fixed utilization perturbation analysis. In Proceedings of the 30th Conference on Decision and Control, pages 116-117, 1991.

[289]

Vadim A. Malyshev and M. V. Menshikov. Ergodicity, continuity and analyticity of countable Markov chains. Trans. Moscow. Math. Soc., 39:3-48, 1979.

[290]

Vadim Malyshev and Philippe Robert. Phase transition in a loss load sharing loss model. Annals of Applied Probability, 4(4):1161-1176, 1994.

[291]

Vadim Malyshev and Andrei Yakovlev. Condensation in large closed Jackson networks. Annals of Applied Probability, 6(1):92-115, 1996.

[292]

Avi Mandelbaum and William A. Massey. Strong approximations for time-dependent queues. Math. Oper. Res., 20(1):33-64, 1995.

[293]

J. Martin. Stochastic bounds for fast Jackson networks. draft.

[294]

J. B. Martin and Yu. M. Suhov. Fast Jackson networks. Ann. Appl. Probab., 9(3):854-870, 1999.

[295]

James B. Martin. Point processes in fast Jackson networks. Ann. Appl. Probab., 11(3):650-663, 2001.

[296]

Laurent Massoulié and J. W. Roberts. Heuristiques pour le débit moyen per c cu par des flots élastiques. preprint.

[297]

Laurent Massoulié and J. W. Roberts. Models for the dimensioning of ABR. slides.

[298]

Laurent Massoulié and J. W. Roberts. Fairness and quality of service for elastic traffic. preprint, February 1998.

[299]

Laurent Massoulié and J. W. Roberts. Arguments in favour of admission control for tcp flows. In Proc, ITC 16, Edinbourg, June 1999.

[300]

Laurent Massoulié. Stability of non-Markovian polling systems. Queueing Systems Theory Appl., 21(1-2):67-95, 1995.

[301]

Laurent Massoulié. Point process models of neuron networks: Stability results. preprint, October 1996.

[302]

Laurent Massoulié. Réseau en étoile partagé. short note, July 1998.

[303]

Laurent Massoulié. Mean field equations for elastic flows with rerouting. short note, June 1999.

[304]

Peter Mathys and Philippe Flajolet. Q-ary collision resolution algorithms in random-access systems with free or blocked channel access. IEEE Trans. Inform. Theory, 31(2):217-243, 1985.

[305]

Ravi R. Mazumdar, Fabrice Guillemin, Vivek Badrinath, and Raghavan Kannurpatti. On pathwise behaviour of queues. Operations Research Letters, 12:263-270, 1992.

[306]

Ravi R. Mazumdar, Vivek Badrinath, Fabrice Guillemin, and Catherine Rosenberg. A note on the pathwise version of Little's formula. orl, 14:19-24, 1993.

[307]

Ravi R. Mazumdar, Vivek Badrinath, Fabrice Guillemin, and Catherine Rosenberg. On pathwise rate conservation for a class of semi-martigales. Stochastic Processes and their Applications, 47:119-130, 1993.

[308]

J. McKenna and D. Mitra. Integral representations and asymptotic expansions for closed Markovian queueing networks: Normal usage. Bell System Technical Journal, 61:661-683, 1982.

[309]

J. McKenna and D. Mitra. Asymptotic expansions and integral representations of moments of queue lengths in closed Markovian networks. Journal of the ACM, 31:346-360, 1984.

[310]

J. McKenna, D. Mitra, and K. G. Ramakrishnan. A class of closed Markovian queueing networks: Integral representations, asymptotic expansions and generalizations. Technical report, AT&T Bell Laboratories, 1990.

[311]

Sean P. Meyn. Transience of multiclass queueing networks via fluid limit models. Annals of Applied Probability, 5(4):946-957, 1995.

[312]

Debasis Mitra and J. McKenna. Asymptotic expansions for closed Markovian networks with state-dependent service rates. J. Assoc. Comput. Mach., 33(3):568-592, 1986.

[313]

Jacques Neveu. Sur les mesures de Palm de deux processus ponctuels stationnaires. Zeitschrift für Wahrscheinlichkeitstheorie und verw. Geb., 34:199-203, 1976.

[314]

E. Oublagha, L. Massoulié, and A. Simonian. Delay analysis of a credit-based control for ABR transfer. In IEEE ATM'97 Workshop, 1997.

[315]

M. S. Pinsker and V. V. Prelov. The information creation rate in stationary Gaussian channels in the case of transmission with weak signals. Problemy Peredachi Informatsii, 30(4):3-11, 1994.

[316]

M. S. Pinsker and V. V. Prelov. Optimal filtering of a Gaussian signal under almost Gaussian noise. Problemy Peredachi Informatsii, 31(4):3-21, 1995.

[317]

M. S. Pinsker and V. V. Prelov. On error-free filtering of some stationary processes. Uspekhi Mat. Nauk, 52(2(314)):109-118, 1997.

[318]

M. S. Pinsker, V. V. Prelov, and S. Verdú. Sensitivity of channel capacity.

[319]

Boris Pittel. Note on the heights of random recursive trees and random m-ary search trees. Random Structures Algorithms, 5(2):337-347, 1994.

[320]

Amber Puha. A reversible nearest particle system on the homogeneous tree. Journal of Theoretical Probability, 12(1):217-253, 1999.

[321]

Amber Puha. Critical exponents for a reversible nearest particle system on the binary tree. Annals of Applied Probability, 28(1):395-415, 2000.

[322]

Austin. Queuing Models for Polled Multiqueues, November 1975.

[323]

Martin I. Reiman and Burton Simon. Light traffic limits of sojourn time distributions in Markovian queueing networks. Communications in Statistics--Stochastic Models, 4(2):191-233, 1988.

[324]

Martin I. Reiman and Burton Simon. Open queueing systems in light traffic. Mathematics of Operations Research, 14(1):26-59, 1989.

[325]

Martin I. Reiman and Alan Weiss. Light traffic derivatives via likelihood ratios. IEEE Transactions on Information Theory, 35(3):648-654, 1989.

[326]

Martin I. Reiman and Alan Weiss. Sensitivity analysis for simulations via likelihood ratios. Operations Research, 37(5):830-844, 1989.

[327]

M. Reiser and S. S. Lavenberg. Corrigendum: ``Mean-value analysis of closed multichain queuing networks'' [J. Assoc. Comput. Mach. 27 (1980), no. 2, 313-322; MR 81d:60107]. J. Assoc. Comput. Mach., 27(2):629, 1980.

[328]

Emmanuel Rio. About the lindeberg method for strongly mixing sequences. ESAIM: Probability and Statistics, 1:35-61, December 1995.

[329]

Emmanuel Rio. Sur le théorème de berry-esseen pour les suites faiblement dépendantes. Probability Theory and Related Fields, 104(2):255-282, 1996.

[330]

H. Robbins and S. Monro. A stochastic approximation method. Annals of Mathematical Statistics, 22:400-407, 1951.

[331]

C. Roche and N. T. Plotkin. The converging flows problem: An analytical study. In Proceedings of the 14th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'95), pages 32-39, Los Alamitos, CA, USA, April 1995. IEEE Computer Society Press.

[332]

Keith W. Ross, Danny H. K. Tsang, and Jie Wang. Monte Carlo summation and integration applied to multichain queueing networks. Journal of the ACM, 41(6):1110-1135, 1994.

[333]

Keith W. Ross, Danny H. K. Tsang, and Jie Wang. Monte Carlo summation and integration applied to multiclass queueing networks. J. Assoc. Comput. Mach., 41(6):1110-1135, 1994.

[334]

Reuven Y. Rubinstein. Sensitivity analysis and performance extrapolation for computer simulation models. Operations Research, 37(1):72-81, 1989.

[335]

Reuven Y. Rubinstein. How to optimize discrete-event systems from a single sample path by the score function method. Annals of Operations Research, 27:175-212, 1991.

[336]

John S. Sadowsky and James A. Bucklew. On large deviations theory and asymptotically efficient Monte Carlo estimation. IEEE Transactions on Information Theory, 36(3):579-588, 1990.

[337]

Issac Saias and Nancy Lynch. An analysis of Rabin's probabilistic algorithm for mutual exclusion. draft, 1991.

[338]

R. Schassberger. Ergodicity of a polling ring. Preprint, 1991.

[339]

R. Schassberger. Stability of polling networks with state-dependent server routing. Probab. Engrg. Inform. Sci., 9(4):539-550, 1995.

[340]

Roberto H. Schonmann and Senya B. Shlosman. Wulff droplets and the metastable relaxation of kinetic Ising models. Comm. Math. Phys., 194(2):389-462, 1998.

[341]

Richard F. Serfozo. Compositions, inverses and thinnings of random measures. Z. Wahrscheinlichkeitstheorie und Verw. Gebiete, 37(3):253-265, 1976/77.

[342]

Richard F. Serfozo. Compositions, inverse and thinnings of random measures. Zeitschrift für Wahrscheinlichkeitstheorie und verw. Geb., 37:253-265, 1977.

[343]

Richard F. Serfozo. Markovian network processes: Congestion-dependent routing and processing. Queueing Systems, Theory and Applications, 5:5-36, 1989.

[344]

L. D. Servi. Average delay approximation of M/G/1 cyclic service queues with Bernoulli schedules. IEEE Journal on Selected Areas in Communications, SAC-4(6):813-822, 1986. Correction in Vol. Sac-5, No. 3, p. 547, 1987.

[345]

J. Georges Shanthikumar and David D. Yao. The effect of increasing services rates in a closed queueing network. Journal of Applied Probability, 23:474-483, 1986.

[346]

J. George Shanthikumar and David D. Yao. Stochastic monotonicity in general queueing networks. J. Appl. Probab., 26(2):413-417, 1989.

[347]

Vinod Sharma. Stability and continuity of polling systems. Queueing Systems, Theory and Applications, 16:115-137, 1994.

[348]

Leyuan Shi. Discontinuous perturbation analysis of discrete event dynamic systems. Preprint, February 1992.

[349]

Cheng Shihong. Weak convergence for exchangeable random variables. Technical Report 28, Institute of Mathematics, University of Peking, 1990.

[350]

Adam Shwartz and Alan Weiss. Induced rare events: analysis via large deviations and time reversal. Adv. in Appl. Probab., 25(3):667-689, 1993.

[351]

Karl Sigman. Light traffic for workload in queues. Queueing Systems, Theory and Applications, 11(4):429-442, 1992.

[352]

Burton Simon. A new estimator of sensitivity measures for simulations based on light traffic theory. ORSA Journal on Computing, 1(3):172-180, 1989.

[353]

Panayotis D. Sparaggis and Christos G. Cassandras. Monotonicity properties of cost functions in queueing networks. Discrete Event Dynamic Systems: Theory and Applications, 1:315-327, 1992.

[354]

Mandyam M. Srinivasan. Nondeterministic polling systems. Management Science, 37(6):667-681, 1991.

[355]

A. L. Stolyar. The asymptotics of stationary distribution for a closed queueing system. Problemy Peredachi Informatsii, 25(4):80-92, 1989.

[356]

Rajan Suri and Michael Zazanis. Perturbation analysis gives strongly consistent sensitivity estimates for the M/G/1 queue. Management Science, 34(1):39-64, 1988.

[357]

Rajan Suri. Implementation of sensitivity calculations on a Monte Carlo experiment. Journal of Optimization Theory and Applications, 40(4):625-630, 1983.

[358]

Rajan Suri. Infinitesimal perturbation analysis of general discret event systems. Journal of the ACM, 34(3):686-717, 1987.

[359]

Rajan Suri. Perturbation analysis: the state of the art and research issues explained via the GI/G/1 queue. Proceedings of the IEEE, 77(1):114-137, 1989.

[360]

Hideaki Takagi. On the analysis of a symmetric polling system with single-message buffers. Performance Evaluation, 5(3):149-157, 1985.

[361]

Hideaki Takagi. Analysis of Polling Systems. The MIT Press, Cambridge, Massachussets, 1986.

[362]

Hideaki Takagi. Queueing analysis of polling models: an update. In Hideaki Takagi, editor, Stochastic Analysis of Computer and Communication Systems, pages 267-318. North Holland, Amsterdam, 1990.

[363]

Tetsuya Takine, Hideaki Takagi, Yutaka Takahashi, and Toshiharu Hasegawa. Analysis of asymmetric single-buffer polling and priority systems without switchover times. Performance Evaluation, 11(4):253-264, 1990.

[364]

Qian-Yu Tang and Han-Fu Chen. Convergence of perturbation analysis based optimization algorithm with fixed number of customer period. Discrete Event Dynamic Systems: Theory and Applications, 4(4):359-375, 1994.

[365]

E. C. Titchmarsh. The Theory of Functions. Oxford University Press, 2nd edition, 1939.

[366]

Don Towsley. Queueing network models with state-dependant routing. Journal of the ACM, 27(2):323-337, 1980.

[367]

Pantelis Tsoucas and Jean Walrand. Monotonicity of throughput in non-Markovian networks. Journal of Applied Probability, 26:134-141, 1989.

[368]

Felisa J. Vázquez-Abad and Harold J. Kushner. A surrogate estimation approach for adaptative routing in communication networks. Technical Report LCDS/CCS #90-2, Division of Applied Mathematics, Brown University, Providence, R.I. 02912, May 1990.

[369]

Felisa J. Vázquez-Abad and Harold J. Kushner. Estimation of the derivative of a stationary measure with respect to a control parameter. Journal of Applied Probability, 29(2):343-352, 1992.

[370]

Felisa J. Vázquez-Abad. Stochastic Recursive Algorithms for Optimal Routing in Queueing Networks. PhD thesis, Brown University, Providence, R.I. 02912, 1989.

[371]

G. De Veciana, T.-J. Lee, and T. Konstantopoulos. Stability and performance analysis of networks supporting services with rate control -- could the internet be unstable? In Proceedings of IEEE INFOCOM 1999, pages 802-810, 1999.

[372]

N. D. Vvedenskaya, R. L. Dobrushin, and F. I. Karpelevich. A queueing system with a choice of the shorter of two queues--an asymptotic approach. Problemy Peredachi Informatsii, 32(1):20-34, 1996.

[373]

Zi-Qin Wang, Wen-Zhong Song, and Chun-Bo Feng. Full-state perturbation analysis of discrete event dynamic systems. Discrete Event Dynamic Systems: Theory and Applications, 1:249-270, 1992.

[374]

Yorai Wardi and K. Lee. Application of descent algorithms with Armijo stepsizes to simulation-based optimization of queueing networks. In Proceedings of the 30th Conference on Decision and Control, pages 110-115, 1991.

[375]

Yorai Wardi, Michael A. Zazanis, and M. Luo. Constistency of perturbation analysis for a queue with finite buffer space and loss policy. Journal of Optimization Theory and Applications, 68(1):181-202, 1991.

[376]

Yorai Wardi, Wei-Bo Gong, Christos G. Cassandras, and M. H. Kallmes. Smoothed perturbation analysis for a class of piecewise constant sample performance functions. Discrete Event Dynamic Systems: Theory and Applications, 1:393-414, 1992.

[377]

Ward Whitt. Bivariate distributions with given marginals. Annals of Statistics, 4(6):1280-1289, 1976.

[378]

Ward Whitt. Continuity of generalized semi-Markov processes. Mathematics of Operations Research, 5(4):494-501, 1980.

[379]

Peter Whittle. Systems in Stochastic Equilibrium. Wiley, 1986.

[380]

R. J. Williams. Semimartingale reflecting Brownian motions in the orthant. In Stochastic networks, volume 71 of IMA Vol. Math. Appl., pages 125-137. Springer, New York, 1995.

[381]

Helmut Willie. Individual blocking probabilities in the loss system G₁+ cdots +G_N/M/1/0. Queueing Systems, Theory and Applications, 6(1):109-112, 1990.

[382]

Helmut Willie. Steady state of loss systems with a superposition of inputs. Queueing Systems, Theory and Applications, 9(4):441-460, 1991.

[383]

David D. Yao and J. A. Buzacott. Modeling a class of flexible manufacturing systems with reversible routing. Operations Research, 35(1):87-93, 1987.

[384]

Michael A. Zazanis and Rajan Suri. Estimating first and second derivatives of response time for G/G/1 queues from a single sample path. Technical report, Division of Applied Sciences, Harvard University, Cambridge, MA, 1985.

[385]

Michael A. Zazanis and Rajan Suri. Comparison of perturbation analysis with conventional sensitivity estimates for stochastic systems. Preprint, November 1988.

[386]

Michael A. Zazanis and Rajan Suri. Perturbation analysis of the GI/GI/1 queue. Queueing Systems, Theory and Applications, 18:199-248, 1994.

[387]

Michael A. Zazanis. Infinitesimal perturbation analysis estimates for moments of the system time of an M/M/1 queue. Operations Research, 38(2):364-369, 1990.

[388]

Michael A. Zazanis. Analyticity of Poisson driven stochastic systems. Advances in Applied Probability, 24(3):532-541, 1992.

[389]

Michael A. Zazanis. Sample path analysis of level crossings for the workload process. Queueing Systems, Theory and Applications, 11(4):419-428, 1992.

[390]

Bin Zhang and Yu-Chi Ho. Variance reduction for the likelihood ratio method. In Proceedings of the 28th Conference on Decision and Control, pages 145-150, 1989.

[391]

Bin Zhang and Yu-Chi Ho. Performance gradient estimation for very large finite Markov chains. IEEE Transactions on Automatic Control, 36(11):1218-1227, 1991.

[392]

Bin Zhang and Yu-Chi Ho. Improvements in the likelihood ratio method for steady-state sensitivity analysis and simulation. Performance Evaluation, 15:177-194, 1992.