scispace - formally typeset
Search or ask a question
Proceedings ArticleDOI

Admission and flow control for multimedia CDMA

30 Jul 2000-Vol. 3, pp 1265-1268
TL;DR: This paper analyzes the scenario of a single-cell DS-CDMA system carrying both voice and WWW users and proposes a new admission control that adaptively modifies the admission threshold at each time slot based on new average load measurements.
Abstract: QoS guarantees for an integrated CDMA system can be provided by a combination of admission and flow control The admission control restricts the number of users in the system such that QoS requirements for all calls can be met The flow control balances the system interference on a slot-by-slot basis such that bit error rate requirements are met for all users and the real-time users are given the highest priority In this paper, we analyze the scenario of a single-cell DS-CDMA system carrying both voice and WWW users A new admission control is proposed and analyzed for Web browsing sessions The challenge in designing admission control for Web users is due to the fact that the Web traffic description is based on heavy tailed distributions Thus, an accurate estimate for the average offered rate for a Web session is hard to compute Our proposed admission scheme adaptively modifies the admission threshold at each time slot based on new average load measurements The admission threshold is computed such that the probability of session dropping is maintained below a prescribed value The flow control mechanism is an extension of the one proposed by C Comaniciu et al (2000), who used the residual capacity from voice users to allocate resources for WWW users
Citations
More filters
Proceedings ArticleDOI
01 Dec 2003
TL;DR: A model of users' satisfaction is developed, in which both requested quality of service and price paid are taken into account, which enables the model to investigate how resource allocation dynamics affect operator revenues and to derive some useful insights.
Abstract: Over the years, radio resource management has been benchmarked mostly by its technical merits. A service provider, however, must also reckon with economics. When the financial needs of the provider and the satisfaction of the users are considered, common objectives in radio resource management, like maximising throughput or meeting various quality constraints, may no longer be sufficient. We analyse next generation communication systems by including models of economics, which have been presented in the literature, and reasonable considerations to depict the users/provider relationship in a generalised multimedia environment. In particular, we develop a model of users' satisfaction, in which both requested quality of service and price paid are taken into account. The model enables us to investigate how resource allocation dynamics affect operator revenues and to derive some useful insights. Radio resource management can be shown to be highly dependent on economic considerations. The provider's task to determine the best usage of the network capacity is heavily affected by the users' service demand and their reactions to the pricing policy. Thus, the economic scenario needs to be taken into account to exploit the constrained radio resource efficiently. The model is applied to a CDMA cellular system.

89 citations


Cites background from "Admission and flow control for mult..."

  • ...The tariff for each user can be described as a continuous function in a similar way [5]....

    [...]

Proceedings ArticleDOI
07 Aug 2002
TL;DR: Simulations indicate that the admission control operates satisfactorily in different traffic situations with a universal parameter setting, and the reporting overhead with periodical measurements can be avoided, since handover event-driven measurements yield roughly the same performance.
Abstract: When operating a cellular radio system at nearly full capacity, admitting yet another user may jeopardize the stability of the system as well as the performance of the individual users. Therefore, proper admission control is crucial. Prior art includes algorithms which limit the number of users or the uplink interference per cell. Both are known to yield roughly the same performance, but the former is difficult to configure, and the latter is based on a quantity which is hard to measure accurately. The core idea in this work is to predict the relative load of the system directly, given that a user is admitted. Then, the user will be admitted if the predicted load in the specific cell, and in its neighbors, is below some threshold. The proposed uplink relative load estimate is focused on WCDMA. It utilizes measurements readily available in that system, either periodically scheduled or from handover events. Multi-services are naturally handled, and availability of high data-rate services are automatically limited with respect to coverage, compared to services of lower data-rate. Simulations indicate that the admission control operates satisfactorily in different traffic situations with a universal parameter setting. Furthermore, the reporting overhead with periodical measurements can be avoided, since handover event-driven measurements yield roughly the same performance.

67 citations


Cites background from "Admission and flow control for mult..."

  • ...Admission control for multimedia tra ffic is the main issue in [12], [13], [14], [15]....

    [...]

01 Jan 2003
TL;DR: In this paper, the connection between radio resource management and economic parameters, whose application in multimedia communication system is a challenging task, is studied, in which a real network is considered.
Abstract: In this paper, we study the connection between Radio Resource Management and economic parameters, whose application in multimedia communication system is a challenging task. In fact, a real network ...

52 citations

Journal ArticleDOI
TL;DR: A model of users' satisfaction is presented, which considers the effects of both users' request and price paid, and it is possible to investigate the relationship between the radio resource allocation and the provider revenue.

49 citations


Cites methods from "Admission and flow control for mult..."

  • ...The same model is used also for the price, that is indeed a continuous quantity [8] that could be adjusted by the provider, according to a pricing policy known to the users and in general defined a priori....

    [...]

Proceedings ArticleDOI
01 Dec 2000
TL;DR: A unified framework for access control in third generation (3G) CDMA systems that delivers the QoS guarantees by scheduling the available resources among the real time and non-real time users is proposed and compared.
Abstract: We propose a unified framework for access control in third generation (3G) CDMA systems. It is implemented as a two level control: at a call arrival time scale (admission control) and at a time slot (frame duration) scale (flow control). The admission control guarantees that QoS requirements in terms of bit error rates and delays can be met for all types of calls in the system: voice, video, Poisson data and Web browsing sessions. The flow control mechanism delivers the QoS guarantees by scheduling the available resources among the real time and non-real time users. Three different approaches for implementing the flow control mechanism are proposed and compared. The impact of non-real time traffic specifications and of real time traffic burstiness on the system capacity is discussed.

37 citations

References
More filters
Journal ArticleDOI
TL;DR: It is demonstrated that Ethernet LAN traffic is statistically self-similar, that none of the commonly used traffic models is able to capture this fractal-like behavior, and that such behavior has serious implications for the design, control, and analysis of high-speed, cell-based networks.
Abstract: Demonstrates that Ethernet LAN traffic is statistically self-similar, that none of the commonly used traffic models is able to capture this fractal-like behavior, that such behavior has serious implications for the design, control, and analysis of high-speed, cell-based networks, and that aggregating streams of such traffic typically intensifies the self-similarity ("burstiness") instead of smoothing it. These conclusions are supported by a rigorous statistical analysis of hundreds of millions of high quality Ethernet traffic measurements collected between 1989 and 1992, coupled with a discussion of the underlying mathematical and statistical properties of self-similarity and their relationship with actual network behavior. The authors also present traffic models based on self-similar stochastic processes that provide simple, accurate, and realistic descriptions of traffic scenarios expected during B-ISDN deployment. >

5,567 citations

Journal ArticleDOI
TL;DR: It is shown that the self-similarity in WWW traffic can be explained based on the underlying distributions of WWW document sizes, the effects of caching and user preference in file transfer, the effect of user "think time", and the superimposition of many such transfers in a local-area network.
Abstract: The notion of self-similarity has been shown to apply to wide-area and local-area network traffic. We show evidence that the subset of network traffic that is due to World Wide Web (WWW) transfers can show characteristics that are consistent with self-similarity, and we present a hypothesized explanation for that self-similarity. Using a set of traces of actual user executions of NCSA Mosaic, we examine the dependence structure of WWW traffic. First, we show evidence that WWW traffic exhibits behavior that is consistent with self-similar traffic models. Then we show that the self-similarity in such traffic can be explained based on the underlying distributions of WWW document sizes, the effects of caching and user preference in file transfer, the effect of user "think time", and the superimposition of many such transfers in a local-area network. To do this, we rely on empirically measured distributions both from client traces and from data independently collected at WWW servers.

2,608 citations


"Admission and flow control for mult..." refers background in this paper

  • ...There is a large amount of work in ATM networks that models Ethernet and WAN traffic as self-similar processes [5] [6]....

    [...]

  • ...The self-similar traffic is obtained as a result of multiplexing many on/off sources with heavy-tailed On and/or Off period lengths [6]....

    [...]

Journal ArticleDOI
15 May 1996
TL;DR: It is shown that the self-similarity in WWW traffic can be explained based on the underlying distributions of WWW document sizes, the effects of caching and user preference in file transfer, the effect of user "think time", and the superimposition of many such transfers in a local area network.
Abstract: Recently the notion of self-similarity has been shown to apply to wide-area and local-area network traffic. In this paper we examine the mechanisms that give rise to the self-similarity of network traffic. We present a hypothesized explanation for the possible self-similarity of traffic by using a particular subset of wide area traffic: traffic due to the World Wide Web (WWW). Using an extensive set of traces of actual user executions of NCSA Mosaic, reflecting over half a million requests for WWW documents, we examine the dependence structure of WWW traffic. While our measurements are not conclusive, we show evidence that WWW traffic exhibits behavior that is consistent with self-similar traffic models. Then we show that the self-similarity in such traffic can be explained based on the underlying distributions of WWW document sizes, the effects of caching and user preference in file transfer, the effect of user "think time", and the superimposition of many such transfers in a local area network. To do this we rely on empirically measured distributions both from our traces and from data independently collected at over thirty WWW sites.

2,332 citations


"Admission and flow control for mult..." refers background in this paper

  • ...There is a large amount of work in ATM networks that models Ethernet and WAN traffic as self-similar processes [5] [6]....

    [...]

  • ...The self-similar traffic is obtained as a result of multiplexing many on/off sources with heavy-tailed On and/or Off period lengths [6]....

    [...]

Journal ArticleDOI
TL;DR: This work presents an approach to the evaluation of the reverse link capacity of a code-division multiple access (CDMA) cellular voice system which employs power control and a variable rate vocoder based on voice activity.
Abstract: This work presents an approach to the evaluation of the reverse link capacity of a code-division multiple access (CDMA) cellular voice system which employs power control and a variable rate vocoder based on voice activity. It is shown that the Erlang capacity of CDMA is many times that of conventional analog systems and several times that of other digital multiple access systems. >

804 citations

Journal ArticleDOI
TL;DR: It is demonstrated empirically that, beyond its statistical significance in traffic measurements, long-range dependence has considerable impact on queueing performance, and is a dominant characteristic for a number of packet traffic engineering problems.
Abstract: Traffic measurement studies from a wide range of working packet networks have convincingly established the presence of significant statistical features that are characteristic of fractal traffic processes, in the sense that these features span many time scales. Of particular interest in packet traffic modeling is a property called long-range dependence (LRD), which is marked by the presence of correlations that can extend over many time scales. We demonstrate empirically that, beyond its statistical significance in traffic measurements, long-range dependence has considerable impact on queueing performance, and is a dominant characteristic for a number of packet traffic engineering problems. In addition, we give conditions under which the use of compact and simple traffic models that incorporate long-range dependence in a parsimonious manner (e.g., fractional Brownian motion) is justified and can lead to new insights into the traffic management of high speed networks.

797 citations


"Admission and flow control for mult..." refers background in this paper

  • ...This model is valid if the traffic is aggregated from a large number of sources and also if the effect of flow control on any user is negligible [8]....

    [...]