Kelly FP (1996). Modelling communication networks, present and future. Phil. Trans. R. Soc. Lond. A, 354, 437--463. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Rate Control for Communication Networks:Shadow Prices.. - Kelly, Tan (1998) (441 citations) (Correct)
....in end systems, acting on behalf of human users, is likely to lessen the distinction between engineering and economic issues and increase the importance of an interdisciplinary view. This general theme was the subject of the 1996 Blackett Memorial Lecture; further aspects are developed elsewhere [5]. There is a substantial literature on rate control algorithms, recently reviewed by Hernandez Valencia et al. 6] Key early papers of Jacobson [2] and Chiu and Jain [7] identified the advantages of adaptive schemes that either increase flows linearly or decrease flows multiplicatively, ....
Kelly FP (1996). Modelling communication networks, present and future. Phil. Trans. R. Soc. Lond. A, 354, 437--463.
Static and Dynamic Evaluation of QoS Properties - Pandurangan, Upfal (Correct)
....the error probabilities can be incorporated to improve network throughput. Practical ATM networks are essentially modeled as a complete graph G (of say, m edges and N terminals) Each edge can be thought of as a Virtual Path (VP) and connections are basically Virtual Circuits (VC s) 2] [5]) When establishing a VC so that a pair of terminals can communicate, a Incremental Algorithm (Q 0 is a parameter xed by QoS. Q is the current estimate of the network over ow probability. Q 0 is the new estimate after a connection is added or deleted. 1 Estimate the over ow ....
.... W Q 5 if Q 0 Q 0 then accept request else reject request Figure 2: Incremental Algorithm for determining QoS guarantee after a connection is added or deleted route consisting of a set of VP s is selected. Following the practices of dynamic routing in telephone networks ( 2] [5]) routes that consist of more than two hops are excluded. If a route consists of one VP, it is a direct route; otherwise, it is an alternative route. To provide QoS guarantees, we suppose that the fraction of cells (which are simply packets in ATM network terminology) lost is not permitted to ....
F.P. Kelly, Modelling Communication Networks, Present and Future, Proc. R. Soc. Lond. A (1995) 444, 1-20.
Chance-Constrained Stochastic Programming for Integrated Services .. - Medova (1998) (Correct)
.... the results are based on large deviation techniques, as recently reviewed in the excellent tutorial paper by Weiss [30] The definition of effective bandwidth depends on the network resource model used (unbuffered or buffered) the performance criterion and the traffic source models (see, e.g. [7, 14, 20, 21, 22, 29]) Also, it generally arises from formulating an acceptance policy [19] A recent paper of Hui [18] considers G, the GoS, as an abstract quantity similar to the notion of entropy in thermodynamics: G(C, N, B) where C is capacity, N represents the number of connections and B is the buffer size. ....
F. P. Kelly (1995). Modelling communication networks, present and future. Proc. R. Soc. Lon. A 444, 1-20.
Reducing Network Congestion and Blocking Probability Through.. - Luczak, Upfal (1999) (3 citations) (Correct)
No context found.
Kelly, F.P. (1995). Modelling Communication Networks, Present and Future. Proceedings of the Royal Society of London. Series A 444 1-20.
Traffic Characterisation and Effective Bandwidths for Broadband.. - Gibbens (1996) (8 citations) (Correct)
No context found.
Kelly, F. P. (1995). Modelling communication networks, present and future. The Clifford Patterson Lecture. Royal Society public lecture.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC