Abstract-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' job 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.
I. IntroductionIn today's communication networks, design and control of the network core and access are different, primarily because of the differences in scale in bandwidth and distance. Quite often the bottleneck is the access, rather than the core. This may happen because the access network is characterized by relatively low line speeds and the limited ability of users to buffer and shape traffic (think of the extreme case of a user with a wireless handset). Access control, supported by the use of feedback, is an important mechanism to address this problem. Since distances between users/clients and network access points are relatively short, feedback delay due to propagation is negligible, which contributes to the efficacy of feedback control. In this paper we investigate the problems of access control by introducing simple models and techniques for their evaluation, design and performance optimization. We make three main contributions. First, we present two simple models of network access. The models provide a framework for the joint design of feedback-based schemes for the adaptation of source rates and admission control. Second, we show how to compute the stationary behavior of the aforementioned feedback queues. We illustrate the use of these