Simple models of network access, with applications to the design of joint rate and admission control
Mandjes, Michel and Mitra, Debasis and Scheinhardt, Werner (2003) Simple models of network access, with applications to the design of joint rate and admission control. Computer Networks, 41 (4). pp. 489-504. ISSN 1389-1286
Restricted to UT campus only: Request a copy
|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.
|Copyright:||© 2003 Elsevier|
Electrical Engineering, Mathematics and Computer Science (EEMCS)
|Link to this item:||http://purl.utwente.nl/publications/70868|
|Export this item as:||BibTeX|
Daily downloads in the past month
Monthly downloads in the past 12 months
Repository Staff Only: item control page