scispace - formally typeset
Search or ask a question
Patent

Measurement-based admission control for wireless packet data services

TL;DR: In this article, a call admission control technique is proposed for wireless systems providing real-time services over a shared downlink. But, the authors consider both multiplexing and multi-user diversity gain.
Abstract: A call admission control technique is described which is well-suited for wireless systems providing real-time services over a shared downlink. The call admission control technique considers both multiplexing and multi-user diversity gain. The technique accurately determines the multi-user diversity gain by measuring per-user resource allocation and advantageously maximizes user accommodations under quality-of-service (QoS) as well as location-dependent resource availability constraints. In a further aspect, the call admission control technique is combined with delay-based scheduling, which effectively balances between system efficiency (channel exploitation) and user expectation (e.g., QoS). A system embodying the described call admission control and scheduling techniques can advantageously deliver efficient real-time services and remain robust to different load scenarios that vary according to system dynamics and/or user mobility.
Citations
More filters
Patent
Anthony M. Fadell1
08 Jan 2009
TL;DR: In this article, the authors propose an administrator function which allows the network administrator to implement one or more resource allocation policies or rules, such as public versus private use, security level, user range from the access device, type of PHY or air interface.
Abstract: Methods and apparatus for allocating resources (such as communications bandwidth) using a network access device. In one embodiment, the network includes a wireless network (e.g., WiFi), and the access device includes a wireless router or gateway in communication with a plurality of wireless users. The device includes an administrator function which allows the network administrator to implement one or more resource allocation policies or rules. Using this approach, resources such as bandwidth can be allocated based on any number of different parameters or use classifications, including for example: (i) public versus private use; (ii) security level; (iii) user range from the access device; (iv) type of PHY or air interface; (v) type of channel coding; (vi) air interface mode or application (e.g., data versus voice). In one variant, the allocation policies are manually controlled by the administrator. In another variant, substantially automatic resource allocation is performed by the administrator program.

133 citations

Patent
Hang Zhang1, Peiying Zhu, Wen Tong2, Gamini Senarath, Derek Yu2, David Steer2 
14 Jul 2008
TL;DR: In this paper, a logical communication tunnel is established between the ingress and egress stations through any number of intermediate relay stations to handle session flows of PDUs, and the scheduling information added to the PDU by the inggress station bears on a QoS class associated with the PU, a deadline for the egress station to deliver the PU or a combination thereof.
Abstract: One or more relay stations may be employed along a wireless communication access path between an ingress station and an egress station. A logical communication tunnel is established between the ingress and egress stations through any number of intermediate relay stations to handle session flows of PDUs. As PDUs arrive, the ingress station may determine and add scheduling information to the PDUs before they are delivered to the downstream intermediate relay stations or egress stations. The scheduling information is used by the downstream stations to schedule the PDUs for further delivery. The scheduling information may also be used by the egress station to schedule the PDUs for delivery. The scheduling information added to the PDU by the ingress station bears on a QoS class associated with the PDU, a deadline for the egress station to deliver the PDU, or a combination thereof.

27 citations

Patent
30 Jun 2007
TL;DR: In this article, the authors proposed a method and apparatus for adjusting the transmit power of a base station based on rate metrics, such as average system throughput of the base station, aggregate cell capacity of the BS, and the like.
Abstract: The invention includes a method and apparatus for adjusting the transmit power of a base station. In one embodiment, the transmit power of a base station is adjusted using rate metrics. A method according to one embodiment includes adjusting a transmit power of a target base station based on a per-user rate metric associated with the target base station and at least one per-user rate metric associated with at least one other base station. The per-user rate metrics may be based on any base station metrics, such as average system throughput of the base station, aggregate cell capacity of the base station, and the like. The per-user rate metrics may be computed or estimated using feedback information from wireless user devices. In one embodiment, the transmit power of a base station is adjusted using other information, such as geographic distances between base station, signal strength measurements received at base stations from other base stations, and the like, as well as various combinations thereof. A method according to one embodiment includes obtaining non-feedback information and adjusting the transmit power of the base station using the non-feedback information.

27 citations

Proceedings ArticleDOI
26 Aug 2008
TL;DR: Simulation results show the proposed adaptive scheduling algorithm achieves near optimal performance compared to an optimal offline algorithm that knows the outcome of each transmission opportunity in the future.
Abstract: We consider the packet scheduling of video frames in the wireless last hop. At the time of network congestion and bad channel conditions, it is necessary to drop some (less important) frames in order to maintain the continuity of the video streaming. The decision on whether to drop and how many frames need to be dropped has to be based on the deadline, size, and importance/utility (in terms of the contribution to the video quality) of each frame. In this paper, we propose an adaptive scheduling algorithm that dynamically decides which frames need to be transmitted and which ones need to be dropped at any transmission opportunity based on the current channel conditions and on the characteristics of each video frame. Simulation results show our scheduling algorithm achieves near optimal performance compared to an optimal offline algorithm that knows the outcome of each transmission opportunity in the future.

22 citations

Patent
30 Oct 2008
TL;DR: In this article, an admission server of the core network receives resource indications indicative of an estimated resource usage for a given communication service and a given access point of an access network, and the admission server then determines whether to allow the communication session dependent on the resource availability for the access point and the estimated resource requirement for the communication service.
Abstract: A heterogeneous communication system comprises a plurality of heterogeneous access networks and a core network connecting the heterogeneous access networks. An admission server of the core network receives resource indications indicative of an estimated resource usage for a given communication service and a given access point of an access network. The admission server furthermore determines and stores current resource availability indications for access points. When a communication session request comprising a communication service indication and an access point identification is received, the admission server determines an estimated resource requirement for the communication sessions based on the resource indications. The admission server then determines whether to allow the communication session dependent on the resource availability for the access point and the estimated resource requirement for the communication service.

14 citations

References
More filters
Patent
09 Aug 1999
TL;DR: In this paper, a data transmission path is formed for routing data packets (DP) in multiple data flows to/from a mobile station (MS) in a mobile communications system (HPLMN, VPLMN).
Abstract: A method for transmitting data packets (DP) in multiple data flows to/from a mobile station (MS) in a mobile communications system (HPLMN, VPLMN). A data transmission path is formed for routing data packets (DP). Multiple profiles (Pr) are associated with the data transmission path, each profile (Pr) comprising at least one quality of service parameter, or QoS parameter. Each flow or data packet (DP) is provided with a profile tag (PrT) indicating one of the multiple profiles (Pr). Scheduling and policing the transmission of individual data packets (DP) is based on at least one QoS parameter of the profile (Pr) indicated by the profile tag (PrT) associated with the data flow in question.

158 citations

Patent
Danlu Zhang1, Rajesh K. Pankaj1
10 Sep 2004
TL;DR: An apparatus for a wireless communication system that includes means for determining available resources in the wireless communications system and means for deciding an admission of a flow is defined in this paper, where a flow admission is defined as the admission of an incoming flow.
Abstract: An apparatus for a wireless communication system that includes means for determining available resources in the wireless communication system and means for determining an admission of a flow.

42 citations

Patent
03 Dec 2001
TL;DR: In this paper, a scheduler permits efficient and flexible scheduling between simultaneous users of an air interface in a wireless communication networks in consideration of desired QoS parameters and class-based preferential scheduling.
Abstract: A scheduler permits efficient and flexible scheduling between simultaneous users of an air interface in a wireless communication networks in consideration of desired QoS parameters and class-based preferential scheduling. By appropriately defining the utility functions used by the scheduler in user scheduling, scheduling may, among other goals, be biased toward satisfaction of average or minimum throughput constraints, be biased toward meeting QoS delay constraints, or be biased based on combined considerations of these goals. Where QoS delay constraints are considered, the scheduler might adopt a dynamic approach to updating delay terms in the utility functions, such that users are not over-served or underserved relative to a desired quality of service.

41 citations