Queueing Systems: Theory and Applications
Broadband integrated networks
Conditioned asymptotics for tail probabilities in large multiplexers
Performance Evaluation
Self-Similar Network Traffic and Performance Evaluation
Self-Similar Network Traffic and Performance Evaluation
Analysis of a single-server queue interacting with a fluid reservoir
Queueing Systems: Theory and Applications
Optimal trajectory to overflow in a queue fed by a large number of sources
Queueing Systems: Theory and Applications
Large Deviations for Small Buffers: An Insensitivity Result
Queueing Systems: Theory and Applications
IEEE Journal on Selected Areas in Communications
Large deviations approximation for fluid queues fed by a large number of on/off sources
IEEE Journal on Selected Areas in Communications
Feedback-based flow control of B-ISDN/ATM networks
IEEE Journal on Selected Areas in Communications
Simple models of network access, with applications to the design of joint rate and admission control
Computer Networks: The International Journal of Computer and Telecommunications Networking
Bicriteria Optimization of a Queue with a Controlled Input Stream
Queueing Systems: Theory and Applications
On/off Storage Systems with State-Dependent Input, Output, and Switching Rates
Probability in the Engineering and Informational Sciences
Exact analysis of offset-based service differentiation in single-channel multi-class OBS
IEEE Communications Letters
Performance analysis of differentiated resource-sharing in a wireless ad-hoc network
Performance Evaluation
Continuous feedback fluid queues
Operations Research Letters
Loss rates for stochastic fluid models
Performance Evaluation
The workload-dependent MAP/PH/1 queue with infinite/finite workload capacity
Performance Evaluation
Energy-efficient scheduling in multi-core servers
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
At the access to networks, in contrast to the core, distances and feedback delays, as well as link capacities are small, which has network engineering implications that are investigated in this paper. We consider a single point in the access network which multiplexes several bursty users. The users adapt their sending rates based on feedback from the access multiplexer. Important parameters are the user's peak transmission rate p, which is the access line speed, the user's guaranteed minimum rate r, and the bound ϵ on the fraction of lost data. Two feedback schemes are proposed. In both schemes the users are allowed to send at rate p if the system is relatively lightly loaded, at rate r during periods of congestion, and at a rate between r and p, in an intermediate region. For both feedback schemes we present an exact analysis, under the assumption that the users' file sizes and think times have exponential distributions. We use our techniques to design the schemes jointly with admission control, i.e., the selection of the number of admissible users, to maximize throughput for given p, r and ϵ. Next we consider the case in which the number of users is large. Under a specific scaling, we derive explicit large deviations asymptotics for both models. We discuss the extension to general distributions of user data and think times.