The Clifford Paterson lecture, 1995 modelling communication networks, present and future

Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences

Volumn 354, Issue 1707, 1996, Pages 437-463

  Kelly, F P ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 3643058800     PISSN: 1364503X     EISSN: None     Source Type: Journal    
DOI: 10.1098/rsta.1996.0016     Document Type: Article

References (68)

1. Ackerley, R. G. 1987 Hysteresis-type behaviour in networks with extensive overflow. Br. Telecom Technol. J. 5, 42-50.
2. Ash, G. R. & Huang, B. D. 1994 Comparative evaluation of dynamic routing strategies for a worldwide intelligent network. In Labetoulle & Roberts (1994), pp. 677-686.
3. Bean, N. 1994 Effective bandwidths with different quality of service requirements. In IFIP Transactions, Integrated Broadband Communication Networks and Services (ed. V. B. Iverson), pp. 241-252.Amsterdam: Elsevier.
4. Botvich, D. D. & Duffield, N. 1994 Large deviations, the shape of the loss curve, and economies of scale in large multiplexers. Dublin Institute for Advanced Studies.
5. Brockmeyer, E., Halstrom, H. L. & Jensen, A. 1948 The life and works of A. K. Erlang. Copenhagen: Academy of Technical Sciences.
6. Chang, C.-S. 1994 Stability, queue length, and delay of deterministic and stochastic queueing networks. IEEE Trans. Automatic Control 39, 913-931.
7. Courcoubetis, C. & Weber, R. R. 1994 Buffer overflow asymptotics for a switch handling many traffic sources. University of Cambridge.
8. Crametz, J.-P. & Hunt, P. J. 1991 A limit result respecting graph structure for a fully connected loss network with alternative routing. Ann. Appl. Prob, 1, 436-444.
9. De Veciana, G. & Walrand, J. 1994 Effective bandwidths: call admission, traffic policing and filtering for ATM networks. Queueing Syst.
10. Elwalid, A. & Mitra, D. 1994 Analysis, approximations and admission control of a multi-service multiplexing system with priorities. AT&T Bell Laboratories.
11. Gibbens, R. J. 1988 Dynamic routing in crcuit-switched networks: the dynamic alternative routing strategy. Ph.D. thesis, University of Cambridge.
12. Gibbens, R. J. & Hunt, P. J. 1991 Effective bandwidths for the multi-type UAS channel. Queueing Syst. 9, 17-28.
13. Gibbens, R. J., Hunt, P. J. & Kelly, F. P. 1990 Bistability in communication networks. In Disorder in physical systems (ed. G. R. Grimmett & D. J. A. Welsh), pp. 113-128. Oxford University Press.
14. Gibbens, R. J. & Kelly, F. P. 1990 Dynamic routing in fully connected networks. IMA Jl Math. Cont. Information 7, 77-111.
15. Gibbens, R. J., Kelly, F. P., Cope, G. A. &: Whitehead, M. J. 1991 Coalitions in the international network. In Teletraffic and Data Traffic in a Period of Change: Proc. 13th Int. Teletraffic Congress (ed. Jensen & Iversen), pp. 93-98. Amsterdam: Elsevier.
16. Gibbens, R. J., Kelly, F. P. & Key, P. B. 1988 Dynamic alternative routing - modelling and behaviour. In Proc. 12th Int. Teletraffic Congress, Turin (ed. M. Bonatti). Amsterdam: Elsevier.
17. Gibbens, R. J., Kelly, F. P. & Key, P. 1995a Dynamic alternative routing. In Steenstrup (1995), pp. 13-47.
18. Gibbens, R. J., Kelly, F. P. & Turner, S. R. E. 1993 Dynamic routing in multi-parented networks. IEEE/ACM Trans. Networking 1, 261-270.
19. Graham, C. & Méléard, S. 1993 Propagation of chaos for a fully connected loss network with alternate routing. Stoch. Proc. Appl. 44, 159-180.
20. Guérin, R., Ahmadi, H. & Naghshineh, M. 1991 Equivalent capacity and its application to bandwidth allocation in high-speed networks. IEEE Jl Selected Areas Commun. 9, 968-981.
21. Hajek, B. 1987 Average case analysis of greedy algorithms for Kelly's triangle problem and the independent set problem. In 26th IEEE Conference on Decision and Control New York: IEEE.
22. Hajek, B. 1994 A queue with periodic arrivals and constant service rate. In Probability, statistics and optimization (ed. F. P. Kelly), pp. 147-157. Chichester: Wiley.
23. Harrison, J. M. 1985 Brownian motion and stochastic flow systems. Kreiger.
24. Houck, D. J., Meier-Hellstern, K. S., Saheban, F. & Skoog, R. A. 1994 Failure and congestion propagation through signalling controls. In Labetoulle &: Roberts (1994), pp. 367-385.
25. Hsu, I. & Walrand, J. 1995 Admission control for ATM networks. In Kelly & Williams (1995), pp. 411-427.
26. Hui, J. Y: 1988 Resource allocation for broadband networks. IEEE Jl Selected Areas Commun. 6, 1598-1608.
27. Hunt, P. J. & Laws, C. N. 1992 Least busy alternative routing in queueing and loss networks. Prob. Engng Inf. Sci. 6, 439-456.
28. Hunt, P. J. & Laws, C. N. 1993 Asymptotically optimal loss network control. Math. Oper. Res. 18, 880-900.
29. Jones, A. J. 1980 Game theory: mathematical models of conflict. Chichester: Wiley.
30. Kelly, F. P. 1985 Stochastic models of computer communication systems. J. R. Statist. Soc. B 47, 379-395.
31. Kelly, F. P. 1990 Routing and capacity allocation in networks with trunk reservation in networks with trunk reservation. Math. Oper. Res. 15, 771-793.
32. Kelly, F. P. 1991a Effective bandwidths at multi-class queues. Queueing Syst. 9, 5-16.
33. Kelly, F. P. 1991b Loss networks. Ann. Appl. Prob, 1, 319-378.
34. Kelly, F. P. 1991c Network routing. Phil. Trans. R. Soc. Lond. A 337, 343-367.
35. Kelly, F. P. 1994a Bounds on the performance of dynamic routing schemes for highly connected networks. Math. Oper. Res. 19, 1-20.
36. Kelly, F. P. 1994b On tariffs, policing and admission control of multiservice networks. Oper. Res. Lett. 15, 1-9.
37. Kelly, F. P. 1995 Charging and accounting for bursty connections. In Internet economics (ed. J. Bailey & L. McKnight). MIT Press.
38. Kelly, F. P. 1996 Notes on effective bandwidths. In Stochastic networks: theory and applications (ed. S. Zachary, I. B. Ziedins & F. P. Kelly). Oxford University Press.
39. Kelly, F. P. & Laws, C. N. 1993 Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling. Queueing Syst. 13, 47-86.
40. Kelly, F. P. & Williams, R. J. (eds) 1995 Stochastic networks. New York: Springer.
41. Kesidis, G., Walrand, J. & Chang, C. S. 1993 Effective bandwidths for multiclass Markov fluids and other ATM sources. IEEE/ACM Trans. Networking 1, 424-428.
42. Key, P. B. 1988 Implied cost methodology and software tools for a fully connected network with DAR and trunk reservation. British Telecom Technol. Jl 6, 52-66.
43. Key, P. 1990 Optimal control and trunk reservation in loss networks. Prob. Engng Inf. Sci. 4, 203-242.
44. Key, P. 1995 Connection admission control for ATM networks. British Telecom Technol. Jl 13, 52-66.
45. Key, P. B. & Whitehead, M. J. 1988 Cost-effective use of networks employing Dynamic Alternative Routing. In Proc. 12th Int. Teletraffic Congress, Turin (ed. M. Bonatti). Amsterdam: Elsevier.
46. Labetoulle, J. & Roberts, J. W. (eds) 1994 The Fundamental Role of Teletraffic in the Evolution of Telecommunication Networks: Proc. 14th Int. Teletraffic Congress. Amsterdam: Elsevier.
47. Laws, C. N. 1992 Resource pooling in queueing networks with dynamic routing. Adv. Appl. Prob. 24, 699-726.
48. Louth, G. M., Mitzenmacher, M. & Kelly, F. P. 1994 Computational complexity of loss networks. Theor. Computer Sci. 125, 45-59.
49. Mees, A. I. 1986 Simple is the best for dynamic routing of telecommunications. Nature, Lond. 323, 108.
50. Mitra, D. (ed.) 1995 Advances in the fundamentals of networking. IEEE Jl Selected Areas Commun. 13, 933-1362.
51. Mitra, D. & Seery, J. B. 1991 Comparative evaluations of randomized and dynamic routing strategies for circuit-switched networks. IEEE Trans. Commun. 39, 102-116.
52. Nakagome, Y. & Mori, H. 1973 Flexible routing in the global communication network. In Proc. 7th Int. Teletraffic Congress. Amsterdam: North-Holland.
53. Norros, I. 1994 A storage model with self-similar input. Queueing Syst. 16, 387-396.
54. Roberts, J. (ed.) 1992 Performance evaluation and design of multiservice networks. Luxembourg: Office for Official Publications of the European Communities.
55. Ross, K. W. 1995 Multiservice loss models for broadband telecommunications networks. London: Springer.
56. Ryde, J. W. 1949 Clifford Copland Paterson. Obituary Notices of Fellows of the Royal Society 6, 479-501.
57. Shubik, M. 1982 Game theory in the social sciences. MIT Press.
58. Simonian, A. & Guibert, J. 1994 Large deviations approximation for fluid sources fed by a large number of on/off sources. In Labetoulle & Roberts (1994), pp. 1013-1022.
59. Schmitt, J. A. & Watanabe, Y. 1991 Models and results for planning the evolution to worldwide intelligent network dynamic routing. In Labetoulle & Roberts (1994), pp. 687-698.
60. Songhurst, D. J. 1980 Protection against traffic overload in hierarchical networks employing alternative routing. In Telecommunications Network Planning Symp., Paris.
61. Stacey, R. R. & Songhurst, D. J. 1987 Dynamic Alternative Routing in the British Telecom trunk network. Int. Switching Symp., Phoenix, Arizona.
62. Steenstrup, M. (ed.) 1995 Routing in communication networks. New Jersey: Prentice-Hall,
63. van Golstein Brouwers, W. G. 1994 Cost reductions by coalitions in the international network. In Labetoulle & Roberts (1994), pp. 699-708.
64. Varian, H. R. 1992 Microeconomic analysis, 3rd edn. New York: Norton.
65. Whitt, W. 1993 Tail probabilities with statistical multiplexing and effective bandwidths in multiclass queues. Telecommun. Syst. 2, 71-167.
66. Willinger, W. 1995 Traffic modelling for high-speed networks: theory versus practice. In Kelly & Williams (1995), pp. 395-409.
67. Willinger, W., Taqqu, M. S., Leland, W. E. & Wilson, D. V. 1995 Self-similarity in high-speed packet traffic: analysis and modelling of ethernet traffic measurements. Statist. Sci. 10, 67-85.
68. Wroe, G. A., Cope, G. A. & Whitehead, M. J. 1990 Flexible routing in the BT international access network. In Proc. 7th UK Teletraffic Symp. London: IEE.