The following pages link to F. P. Kelly (Q580827):
Displaying 50 items.
- One-dimensional circuit-switched networks (Q580828) (← links)
- Blocking, reordering, and the throughput of a series of servers (Q793448) (← links)
- Asymptotic stationarity of queues in series and the heavy traffic approximation (Q804097) (← links)
- The number of packets transmitted by collision detect random access schemes (Q1093270) (← links)
- On a class of approximations for closed queueing networks (Q1115026) (← links)
- Multi-armed bandits with discount factor near one: The Bernoulli case (Q1161450) (← links)
- How a group reaches agreement: A stochastic model (Q1161694) (← links)
- Eigenvalue inequalities for products of matrix exponentials (Q1166594) (← links)
- On optimal search with unknown detection probabilities (Q1167066) (← links)
- Loss networks (Q1175966) (← links)
- Effective bandwidths at multi-class queues (Q1176436) (← links)
- (Q1318714) (redirect page) (← links)
- Computational complexity of loss networks (Q1318715) (← links)
- On tariffs, policing and admission control for multiservice networks (Q1331887) (← links)
- Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling (Q1801806) (← links)
- Resource pricing and the evolution of congestion control (Q1818694) (← links)
- A study of simple usage-based charging schemes for broadband networks (Q1865090) (← links)
- Fluid model for a network operating under a fair bandwidth-sharing policy. (Q1879902) (← links)
- Resource pooling in electricity grids: wind, storage and transmission (Q2146423) (← links)
- A fluid model of a traffic network with information feedback and onramp controls (Q2238956) (← links)
- Resource pooling in congested networks: Proportional fairness and product form (Q2269490) (← links)
- Fairness and stability of end-to-end congestion control (Q2512278) (← links)
- (Q2760077) (← links)
- (Q2762135) (← links)
- Efficient Advert Assignment (Q2830760) (← links)
- Stochastic Networks (Q2849821) (← links)
- (Q3019883) (← links)
- Heavy traffic on a controlled motorway (Q3078003) (← links)
- A Contract and Balancing Mechanism for Sharing Capacity in a Communication Network (Q3115953) (← links)
- Erratum—A Contract and Balancing Mechanism for Sharing Capacity in a Communication Network (Q3116118) (← links)
- A Combinatorial Auction with Multiple Winners for Universal Service (Q3116752) (← links)
- Rate control for communication networks: shadow prices, proportional fairness and stability (Q3157669) (← links)
- On critically loaded loss networks (Q3197112) (← links)
- (Q3355962) (← links)
- Limit theorems for loss networks with diverse routing (Q3473928) (← links)
- Dynamic Routing in Fully Connected Networks (Q3475212) (← links)
- Nonlinear growth generates age changes in the moments of the frequency distribution: the example of height in puberty (Q3634580) (← links)
- Sojourn times in closed queueing networks (Q3662409) (← links)
- (Q3682209) (← links)
- Segregating the Input to a Series of Buffers (Q3682213) (← links)
- (Q3711414) (← links)
- (Q3721805) (← links)
- (Q3727101) (← links)
- Blocking probabilities in large circuit-switched networks (Q3730764) (← links)
- (Q3734819) (← links)
- The Product Form for Sojourn Time Distributions in Cyclic Exponential Queues (Q3784950) (← links)
- Routing in circuit-switched networks: optimization, shadow prices and decentralization (Q3787260) (← links)
- (Q3793474) (← links)
- (Q3834828) (← links)
- The Clifford Paterson Lecture, 1995 Modelling communication networks, present and future (Q3837461) (← links)
