text:
Advances in applied mathematics and global optimization : in honor of Gilbert Strang (電子書籍, 2009) [WorldCat.org]
タイトル： Advances in applied mathematics and global optimization : in honor of Gilbert Strang
出版社： New York, N.Y. ; London : Springer, ©2009.
タグを追加 ： "Advances in applied mathematics and global optimization : in honor of Gilbert Strang".
<http://www.worldcat.org/oclc/405546130>library:oclcnum"405546130"library:placeOfPublication<http://experiment.worldcat.org/entity/work/data/959322189#Place/new_york_n_y>rdf:typeschema:Placeschema:name"New York, N.Y."library:placeOfPublication<http://id.loc.gov/vocabulary/countries/nyu>dcterms:identifier"nyu"rdf:typeschema:Placelibrary:placeOfPublication<http://dbpedia.org/resource/London>rdf:typeschema:Placeschema:name"London"owl:sameAs<info:oclcnum/405546130>rdf:typeschema:Bookschema:about<http://experiment.worldcat.org/entity/work/data/959322189#Topic/electronic_books>rdf:typeschema:Intangibleschema:name"Electronic books."@enschema:about<http://experiment.worldcat.org/entity/work/data/959322189#Topic/science_physics>rdf:typeschema:Intangibleschema:name"Science: Physics."@enschema:about<http://id.loc.gov/authorities/subjects/sh85082767>rdf:typeschema:Intangibleschema:name"Mechanics--Mathematics"@enschema:name"Mechanics"@enschema:about<http://experiment.worldcat.org/entity/work/data/959322189#Topic/science_mechanics_general>rdf:typeschema:Intangibleschema:name"SCIENCE--Mechanics--General."@enschema:about<http://experiment.worldcat.org/entity/work/data/959322189#Topic/science>rdf:typeschema:Intangibleschema:name"Science."@enschema:about<http://id.worldcat.org/fast/1013446>rdf:typeschema:Intangibleschema:name"Mechanics"@enschema:name"Mechanics."@enschema:about<http://dewey.info/class/531/e22/>rdf:typeschema:Intangibleschema:about<http://experiment.worldcat.org/entity/work/data/959322189#Topic/science_mechanics_solids>rdf:typeschema:Intangibleschema:name"SCIENCE--Mechanics--Solids."@enschema:about<http://experiment.worldcat.org/entity/work/data/959322189#Topic/mechanics_mathematics>rdf:typeschema:Intangibleschema:name"Mechanics--Mathematics."@enschema:about<http://id.worldcat.org/fast/1013460>rdf:typeschema:Intangibleschema:name"Mechanics--Mathematics"@enschema:name"Mechanics--Mathematics."@enschema:about<http://experiment.worldcat.org/entity/work/data/959322189#Topic/mechanics>rdf:typeschema:Intangibleschema:name"Mechanics."@enschema:bookFormatschema:EBookschema:contributor<http://viaf.org/viaf/108500696>rdf:typeschema:Personschema:familyName"Strang"schema:givenName"Gilbert"schema:name"Strang, Gilbert."schema:contributor<http://viaf.org/viaf/263980289>rdf:typeschema:Personschema:birthDate"1943"schema:familyName"Ogden"schema:givenName"R. W."schema:name"Ogden, R. W., 1943-"schema:contributor<http://viaf.org/viaf/49520589>rdf:typeschema:Personschema:familyName"Gao"schema:givenName"David Yang"schema:name"Gao, David Yang."schema:copyrightYear"2009"schema:creator<http://experiment.worldcat.org/entity/work/data/959322189#Meeting/international_conference_on_complementarity_duality_and_global_optimization_1st_2005_blacksburg_va>rdf:typej.2:Meetingrdf:typeschema:Eventschema:location<http://experiment.worldcat.org/entity/work/data/959322189#Place/blacksburg_va>rdf:typeschema:Placeschema:name"Blacksburg, Va.)"schema:name"International Conference on Complementarity, Duality and Global Optimization (1st : 2005 : Blacksburg, Va.)"schema:datePublished"2009"schema:exampleOfWork<http://worldcat.org/entity/work/id/959322189>schema:genre"Conference proceedings"@enschema:genre"Electronic books."@enschema:genre"Conference proceedings."@enschema:inLanguage"en"schema:name"Advances in applied mathematics and global optimization in honor of Gilbert Strang"@enschema:publisher<http://experiment.worldcat.org/entity/work/data/959322189#Agent/springer>rdf:typej.0:Agentschema:name"Springer"schema:url<http://public.eblib.com/choice/publicfullrecord.aspx?p=438061>schema:url<http://www.worldcat.org/title/-/oclc/405546130>rdf:typej.1:InformationResourcerdf:typej.1:ContentTypeGenericResourceschema:about<http://www.worldcat.org/oclc/405546130>void:inDataset<http://purl.oclc.org/dataset/WorldCat>schema:url<http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=276985>schema:url<http://site.ebrary.com/id/10501475>schema:url<http://dx.doi.org/10.1007/978-0-387-75714-8>schema:url<http://site.ebrary.com/id/10289729>schema:workExample<http://worldcat.org/isbn/9780387757131>rdf:typeschema:ProductModelschema:isbn"0387757139"schema:isbn"9780387757131"schema:sameAs<urn:isbn:0387757139>schema:sameAs<urn:isbn:9780387757131>schema:workExample<http://worldcat.org/isbn/9780387757148>rdf:typeschema:ProductModelschema:isbn"0387757147"schema:isbn"9780387757148"schema:sameAs<urn:isbn:0387757147>schema:sameAs<urn:isbn:9780387757148>Content-negotiable representationsTurtle (text/turtle)JSON-LD (application/ld+json)RDF/XML (application/rdf+xml)N-TRIPLES (text/plain)HTML+RDFa (text/html)

value: This website is a union catalog that itemizes the collections of 15,637 libraries in 107 countries that participate in the OCLC global cooperative. It is operated by OCLC, Inc.


text: Translations English (1) Russian (1) License OSI-Approved Open Source (1) GNU General Public License version 3.0 (1) Programming Language Free Pascal (1) Status 4 - Beta (1) OS Grouping and Descriptive Categories (1) All 32-bit MS Windows (1) Modern (1) WinXP (1) Windows 7 (1) Windows (1) Editors Software

type: global

value: This website is a web service that offers software consumers a centralized online location to control and manage open-source software projects and research business software. It provides source code repository hosting, bug tracking, mirroring of downloads for load balancing, a wiki for documentation, developer and user mailing lists, user-support forums, user-written reviews and ratings, a news bulletin, micro-blog for publishing project updates, and other features.


text:
A Soviet Ant Takes a Walk by Okhotsimsky, D. I.; Platonov, A. K. Published 1975
californialightandsound, Artificial intelligence, Robotics Source: 1 Reel of 1: Film: 16mmCollection: Stanford University, Department of Computer Science, films, 1968-1977Call Number: F0110.07Rights: Copyrighted. Rights are owned by Stanford University Libraries. All Rights Reserved. This includes all rights now in existence or which may hereafter come into existence in the Stanford University, Department of Computer Science, films, 1968-1977 Collection, including but not limited to print, audio, electronic, video, CD ROM, photographic, digital and film, and all revenues deriving from copyright exploitation. This work is protected by copyright law. No part of the materials may be derived, copied, photocopied, reproduced, translated or reduced to any electronic medium or machine readable form, in whole or in part, without specific permission from the copyright holder. For permission requests, please contact the Public Services Librarian at Stanford University Libraries, speccollref@stanford.edu.

value: This website is an American digital library with the stated mission of "universal access to all knowledge". It provides free public access to collections of digitized materials, including websites, software applications/games, music, movies/videos, moving images, and millions of books.


text:
Imagen De Copa Mundial 2014 | eBay
Refine your search for Imagen De Copa Mundial 2014
0 results for Imagen De Copa Mundial 2014
Save Imagen De Copa Mundial 2014 to get e-mail alerts and updates on your eBay Feed.
Unfollow Imagen De Copa Mundial 2014 to stop getting updates on your eBay Feed.
Imagen De Copa Mundial 2014:
Album Copa Mundial de Futbol Brasil 2014 - COMPLETE
Mexico 1985 Copa Mundial de Futbol Silver Coin $100 86 World Cup Soccer - AJ792
See more like thisCopa mundial de la FIFA Brasil 2014: Expediente oficial (Spanish Edition)
Mexico 1985 Copa Mundial de Futbol Silver Coin $100 86 World Cup Keychain #NT-E4
MEXICO 1986 World Cup Copa Mundial de la FIFA pennant vintage 80's
Copa mundial de la FIFA Brasil 2014: Guía oficial (Spanish Edition) Fifa Paperb
See more like thisCopa mundial de la FIFA Brasil 2014: Guía oficial (Spanish Edition) Fifa Paperb
Copa mundial de la FIFA Brasil 2014: GuÃ;a oficial
See more like thisCopa mundial de la FIFA Brasil 2014: GuÃa oficial
MEXICAN SILVER MEDAL COPA MUNDIAL DE FUTBOL MEXICO 1970 !
See more like thisFifa Fever: Copa Mundial De La Fifa: 100 DVD
Fifa Fever: Copa Mundial De La Fifa: 100 Anos de Clasicos
See more like thisFifa Fever: Copa Mundial De La Fifa: 100 Anos de Clasicos
COPA MUNDIAL DE FUTBOL SPAIN 1982 BKLT OF 4
1986 Mexican $200 Pesos Copa Mundial De Futbol Collectable
Collectible Vintage Mexico $200 Pesos Coin 1986 Copa Mundial De Futbol SOCCER
BRAZIL WORLD CHAMPIONSHIP COPA JULES RIMET IX 9TH CAMPEONATO MUNDIAL DE FUT-BOL
1986 Mexico 200 Peso Coin - Copa Mundial De Futbol - SOCCER - Brilliant AU
Copa Mundial De Futbol 1985 Mexico86 $50 Pesos Coin
Mexico 86 Copa Mundial De Fútbol Plata Ley 0.720 Silver $100 Coin
COPA MUNDIAL DE FUTBOL SPAIN 1982 [Estadio SANTIAGO BERNABEU ] BKLT OF 6
Collectible Vintage Mexico $200 Pesos Coin 1986 Copa Mundial De Futbol
USED (GD) Copa mundial de la FIFA Brasil 2014: Expediente oficial (Spanish Editi
2009 Coca Cola can from Mexico,el Tour del Trofeo Copa Mundial de la FIFA
Vintage 1986 Mexico World Cup Sunglasses Copa Mundial De Futbol,Ships Free
See more like thisFifa Fever: Copa Mundial De La Fifa: 100 Anos de Clasicos 2006 by Kamp, Oliver
ESPANA Copa Mundial de Fútbol de 1982 PATCH SPORT FOOTBALL SPAIN WORLD CUP FIFA
COPA JULES RIMET IX 9TH CAMPEONATO MUNDIAL DE FUT-BOL Sterling Medal
Sahara OCC RASD Copa Mundial De Futebol Francia 1998-MNH sheet
F-EX3356 LAO LAOS 1985 MNH WORLD SOCCER CUP MEXICO. COPA MUNDIAL DE FUTBOL.
See more like thisNEW - Fifa Fever: Copa Mundial De La Fifa: 100 Anos de Clasicos
New! Copa Mundial De Futbol Espana Collectible Stamps
Francia copa Mundial de Futbol Sahara OCC- soccer stamp MNH no gum
See more like thisFifa Fever: Copa Mundial De La Fifa: 100 Anos de Clasicos by Kamp, Oliver
Copa Mundial de futbol 1982 Aerogramme unused Soccer fussbal
MUNDIAL FIFA SOCCER FOOTBALL COUPE DU MONDE COPA MUNDIAL DE FUTBOL CONGO 1982
This page was last updated: Sep-21 11:51. Number of bids and bid amounts may be slightly out of date. See each listing for international shipping options and costs.

value: This website is an American multinational e-commerce corporation based in San Jose, California, that facilitates consumer-to-consumer and business-to-consumer sales through its website.


text:
5 used & new from £6.92 See All Buying Options
£7.99 Amazon Prime Rien Ne Va Plus [DVD]
£6.05 Amazon Prime Blood Relatives [DVD]
£15.73 Product details
Amazon Bestsellers Rank: 300,991 in DVD & Blu-ray (See Top 100 in DVD & Blu-ray)
#19067 in DVD & Blu-ray > Crime, Thrillers & Mystery
#38187 in DVD & Blu-ray > Drama
DVD£5.29 Mademoiselle [DVD] (2001)
Sandrine BonnaireDVD£20.69 Amazon Prime Poulet au Vinaigre [DVD]
DVD£6.05 Amazon Prime La Cérémonie [DVD]
DVD£4.99 Amazon Prime Au coeur du mensonge
DVD£26.00 Next
2 of 2 people found the following review helpfulstays in the mind
1 of 1 people found the following review helpfulA curious non-event from Claude Chabrol

value: This website is an American multinational technology company which focuses on e-commerce, cloud computing, digital streaming, and artificial intelligence.


text:
Patent US20020061007 - System for allocating resources in a communication system - Google PatentsSearch Images Maps Play YouTube News Gmail Drive More »Sign inPatentsA method and apparatus for allocating and using a finite resource to transmit wireless information signals to a plurality of subscriber units is disclosed. Individual subscriber units transmit data rate requests to serving base stations. The data rate requests and weight values associated with each subscriber...http://www.google.com/patents/US20020061007?utm_source=gb-gplus-sharePatent US20020061007 - System for allocating resources in a communication systemAdvanced Patent SearchTry the new Google Patents, with machine-classified Google Scholar results, and Japanese and South Korean patents.Publication numberUS20020061007 A1Publication typeApplicationApplication numberUS 10/007,297Publication dateMay 23, 2002Filing dateNov 8, 2001Priority dateJan 13, 1999Also published asCN1247043C, CN1408193A, CN1819701A, DE60104812D1, DE60104812T2, EP1245127A1, EP1245127B1, EP1475987A1, EP2309696A1, US6393012, US6993006, WO2001052588A1Publication number007297, 10007297, US 2002/0061007 A1, US 2002/061007 A1, US 20020061007 A1, US 20020061007A1, US 2002061007 A1, US 2002061007A1, US-A1-20020061007, US-A1-2002061007, US2002/0061007A1, US2002/061007A1, US20020061007 A1, US20020061007A1, US2002061007 A1, US2002061007A1InventorsRajesh PankajOriginal AssigneePankaj Rajesh K.Export CitationBiBTeX, EndNote, RefManPatent Citations (5), Referenced by (48), Classifications (41), Legal Events (2) External Links: USPTO, USPTO Assignment, EspacenetSystem for allocating resources in a communication system
US 20020061007 A1Abstract
A method and apparatus for allocating and using a finite resource to transmit wireless information signals to a plurality of subscriber units is disclosed. Individual subscriber units transmit data rate requests to serving base stations. The data rate requests and weight values associated with each subscriber unit are compared in order to select a subscriber unit as the recipient of data transmitted through the finite resource at any given time. To maximize throughput without starving any single subscriber unit, the method includes calculation and comparison of a desirability metric in choosing a subscriber unit from among a subset of the plurality of subscriber units having comparable weight values. Images(20) Claims(12)
What is claimed is: 1. A method of allocating resources in a communication system, comprising: maintaining a set of weights corresponding to each of a plurality of remote stations; identifying a group of the remote stations having weights within a first range of values; determining a desirability metric value for each remote station in the group; and if any remote station in the group has pending data: selecting from the group a most desired recipient having the greatest desirability metric value and pending data; and transmitting data to the most desired recipient. 2. The method of claim 1 further comprising: determining the first range of values as a function of a minimum weight of the set of weights. 3. The method of claim 2 wherein determining the first range further comprises: defining the first range of values as weights falling with in an offset K of the minimum weight. 4. The method of claim 1 wherein if no remote station in the group has pending data: selecting a first recipient having a minimum weight of the set of weights; and transmitting data to the first recipient. 5. A wireless apparatus for allocating resources in a communication system, comprising: means for maintaining a set of weights corresponding to each of a plurality of remote stations; means for identifying a group of the remote stations having weights within a first range of values; means for determining a desirability metric value for each remote station in the group; means for determining if any remote station in the group has pending data; means for selecting from the group a most desired recipient having the greatest desirability metric value and pending data if any remote station in the group has pending data; and means for transmitting data to the most desired recipient. 6. The apparatus as in claim 5 further comprising: means for selecting a first recipient having a minimum weight of the set of weights; and means for transmitting data to the first recipient. 7. A processing apparatus to schedule data transmissions to remote stations in a communication system, comprising: a memory storage unit; a processor coupled to the memory storage unit and adapted for: maintaining a set of weights corresponding to each of a plurality of remote stations; identifying a group of the remote stations having weights within a first range of values; determining a desirability metric value for each remote station in the group; and if any remote station in the group has pending data: selecting from the group a most desired recipient having the greatest desirability metric value and pending data; and transmitting data to the most desired recipient. 8. The apparatus as in claim 7, wherein the processor is further adapted for: selecting a first recipient having a minimum weight of the set of weights; and transmitting data to the first recipient. 9. A computer program stored on a computer-readable medium, comprising instructions and commands for scheduling data transmissions in a communication system by: maintaining a set of weights corresponding to each of a plurality of receivers in a communication system; identifying a group of the remote stations having weights within a first range of values; determining a desirability metric value for each remote station in the group; determining if any remote station in the group has pending data: selecting from the group a most desired recipient having the greatest desirability metric value and pending data if any remote station in the group has pending data; and transmitting data to the most desired recipient. 10. The computer program as in claim 9, further comprising instructions for: selecting a first recipient having a minimum weight of the set of weights; and transmitting data to the first recipient. 11. An infrastructure element in a communication system, comprising: a plurality of data queues, wherein each data queue is associated with a receiver in the communication system; a scheduler for selecting a first queue of the plurality of data queues by: maintaining a set of weights corresponding to each of the plurality of receivers; identifying a group of the receivers having weights within a first range of values; determining a desirability metric value for each receiver in the group; and if any receiver in the group has pending data: selecting from the group a most desired recipient having the greatest desirability metric value and pending data; and transmitting data to the most desired recipient. 12. The infrastructure element as in claim 11 wherein the scheduler is further adapted for: selecting a first recipient having a minimum weight of the set of weights; and transmitting data to the first recipient.
CROSS REFERENCE [0001] This application is a continuation application of co-pending application Ser. No. 09/479,735, filed Jan. 7, 2000, entitled “SYSTEM FOR ALLOCATING RESOURCES IN A COMMUNICATION SYSTEM,” now allowed and currently assigned to the assignee of the present application, and which is a continuation-in-part of U.S. Pat. No. 6,229,795, entitled “SYSTEM FOR ALLOCATING RESOURCES IN A COMMUNICATION SYSTEM,” issued May 8, 2001, also assigned to the assignee of the present application and which is expressly incorporated by reference herein.
BACKGROUND [0002] 1. Field of the Invention [0003] The present application relates to communication systems. Particularly, these embodiments are directed to allocating communication resources among the plurality of subscribers to a communication system. [0004] 2. Related Art [0005] Several solutions have been presented to address the problem of allocating limited communication resources provided by a single node in a communication system among a plurality of subscribers. It is an objective of such systems to provide sufficient resources at the nodes to satisfy the requirements of all subscribers while minimizing costs. Accordingly, such systems are typically designed with the objective of efficient allocation of resources among the various subscribers. [0006] Various systems have implemented a frequency division multiple access (FDMA) scheme, which allocates resources to each of the subscribers concurrently. A communication node in such systems typically has a limited bandwidth for either transmitting information to or receiving information from each subscriber in the network at any point in time. This scheme typically involves allocating distinct portions of the total bandwidth to the individual subscribers. While such a scheme may be effective for systems in which subscribers require uninterrupted communication with the communication node, better utilization of the total bandwidth may be achieved when such constant, uninterrupted communication is not required. [0007] Other schemes for allocating communication resources of a single communication node among a plurality of subscribers includes time division multiple access (TDMA) schemes. These TDMA schemes are particularly effective in allocating the limited bandwidth resources of a single communication node among a plurality of subscribers which do not require constant, uninterrupted communication with the single communication node. TDMA schemes typically dedicate the entire bandwidth of the single communication node to each of the subscribers at designated time intervals. In a wireless communication system which employs a code division multiple access (CDMA) scheme, this may be accomplished by assigning to each of the subscriber units all code channels at the designated time intervals on a time multiplexed basis. The communication node implements the unique carrier frequency or channel code associated with the subscriber to enable exclusive communication with the subscriber. TDMA schemes may also be implemented in land line systems using physical contact relay switching or packet switching. [0008] TDMA systems typically allocate equal time intervals to each subscriber in a round robin fashion. This may result in an under utilization of certain time intervals by certain subscribers. Similarly, other subscribers may have communication resource requirements, which exceed the allocated time interval, leaving these subscribers under served. The system operator then has the choice of either incurring the cost of increasing the bandwidth of the node to ensure that none of the subscribers are under served, or allowing the under served subscribers to continue to be under served. [0009] Accordingly, there is a need to provide a system and method of allocating communication resources among subscribers to a communication network efficiently and fairly according to a network policy of allocating the communication resources among the subscribers. SUMMARY [0010] An object of an embodiment of the present invention is to provide a system and method for allocating a finite resource of a communication system among a plurality of subscribers. [0011] Another object of an embodiment of the present invention is to provide a system and method for allocating data transmission resources among a plurality of subscribers which have varying capacities to receive data. [0012] It is another object of an embodiment of the present invention to provide a system and method for optimally allocating data transmission resources among a plurality of subscribers subject to a fairness criteria according to a network policy. [0013] It is another object of an embodiment of the present invention to provide a system and method for allocating data transmission resources of a base station among a plurality of remote stations in a wireless communication network. [0014] It is yet another object of an embodiment of the present invention to provide a system and method for enhancing the efficiency of transmitting data to a plurality of subscribers in a variable rate data transmission network by allocating transmission resources to each individual subscriber based upon the rate at which the subscriber can receive transmitted data. [0015] Briefly, an embodiment of the present invention is directed to a resource scheduler in a communication system which includes a common node and a plurality of customer nodes associated with the common node. The common node, at any particular service interval, is capable of providing a finite resource to be seized by one or more engaging customer nodes to the exclusion of any remaining customer nodes. The resource scheduler includes logic for maintaining a weight or score associated with each of the customer nodes, logic for selecting one or more of the remaining customer nodes to seize the finite resource in a subsequent service interval based upon a comparison of the weight associated with each of the selected customer nodes and the respective weights associated with the other remaining customer nodes, and logic for changing the weights associated with the customer nodes to cause an optimal allocation of the finite resource subject to a fairness criteria. [0016] The resource scheduler may maintain the weights associated with each customer node based upon the instantaneous rate at which the customer node can receive data from the common node. The resource scheduler may then favor transmission to the customer nodes having the higher rates of receiving data. By maintaining a weight associated with each of the customer nodes, and selecting individual customer nodes to seize the common node, the scheduler can optimally allocate resources to the customer nodes subject to a fairness criteria. [0017] In the embodiment where the common node provides data transmission resources to the customer nodes, for example, the scheduler may apply weights to the individual customer nodes so as to favor those customer nodes capable of receiving data at higher rates. Such a weighting tends to enhance the overall data throughput of the common node. In another embodiment, the weights are applied in a manner so that the scheduler also complies with the fairness criteria. [0018] In one aspect of the invention, a method of allocating a finite resource in a communication system is provided, the communication system including a common node and a plurality of customer nodes associated with the common node, each of the customer nodes having a requested data rate, wherein during any particular service interval the common node allocates the finite resource to one of the customer nodes to the exclusion of any remaining customer nodes, the method comprising the steps of: maintaining a set of weights having one weight corresponding to each of the customer nodes; identifying a minimum weight M from said set of weights; identifying a subset of said customer nodes having weights less than or equal to the sum of M and an offset K; determining a desirability metric value for each customer node in said subset; selecting, from said subset, a most desired customer node having the greatest desirability metric value; exchanging data between the common node and said most desired customer node through the finite resource and at the data rate associated with said most desired customer node; and changing said set of weights based on said most desired customer node and the data rate associated with said most desired customer node. [0019] In anther aspect of the invention, a wireless transmitter apparatus is provided, comprising: at least one antenna for receiving requested data rate signals from each of a plurality of customer nodes and for directing information signals to said plurality of customer nodes; a channel element for modulating a data signal for transmission through said at least one antenna to each of said plurality of customer nodes; and a channel scheduler for maintaining a set of weights corresponding to each of the customer nodes, identifying a minimum weight M from said set of weights, identifying a subset of said customer nodes having weights less than or equal to the sum of M and an offset K, determining a desirability metric value for each customer node in the subset, selecting from the subset a most desired customer node having the greatest desirability metric value, providing information corresponding to the most desired customer node to said channel element, and updating the set of weights. [0020] While the embodiments disclosed herein are directed to methods and systems for allocating data transmission resources to subscribers through a forward channel in a data service network, the underlying principles have even broader applications to the allocation of resources among elements in a communication system generally. The disclosed embodiments are therefore intended to be exemplary and not limiting the scope of the claims. For example, principles described herein are applicable to communication networks in which the customer nodes compete for the ability to transmit data to a common node through a limited reverse transmission channel.
BRIEF DESCRIPTION OF THE FIGURES [0021] [0021]FIG. 1 shows a communication network according to an embodiment of the present invention. [0022] [0022]FIG. 2a shows a block diagram of a base station controller and base station apparatus configured in accordance with an embodiment of the present invention. [0023] [0023]FIG. 2b shows a block diagram of a remote station apparatus configured in accordance with an embodiment of the present invention. [0024] [0024]FIG. 3 shows a flow diagram illustrating the execution of a scheduling algorithm in an embodiment of the channel scheduler shown in FIG. 2. [0025] [0025]FIG. 4 shows a diagram illustrating the timing of the execution of an embodiment of the scheduling algorithm shown in FIG. 3. [0026] [0026]FIG. 5 shows a flow diagram illustrating an embodiment of the process for updating the weights for a selected queue in the embodiment identified in FIG. 3. [0027] [0027]FIGS. 6a through 6 c show a flow diagram illustrating a first embodiment of the process for selecting a queue to receive data transmission in a service interval identified in FIG. 3. [0028] [0028]FIGS. 7a through 7 d show a flow diagram illustrating a second embodiment of the process for selecting a queue to receive data transmission in a service interval identified in FIG. 3. [0029] [0029]FIGS. 8a and 8 b show a flow diagram illustrating a third embodiment of the process for selecting a queue to receive data transmission in a service interval identified in FIG. 3. [0030] [0030]FIG. 9 shows a high level flow diagram illustrating an alternate process for updating the weights for a selected queue in the embodiment identified in FIG. 3. [0031] [0031]FIG. 10 shows a detailed flow diagram of an embodiment of the process shown in FIG. 9. [0032] [0032]FIGS. 11a-11 b are block diagrams of the exemplary forward link architecture of the present invention.
DETAILED DESCRIPTION [0033] Embodiments of the present invention are directed to a system and apparatus for allocating resources among a plurality of subscribers to a communication network which are serviced by a single communication node. At individual discrete transmission intervals, or “service intervals,” individual subscribers seize a finite resource of the communication node to the exclusion of all other subscribers. The individual subscribers are selected to seize the finite resource based upon a weight or score associated with the individual subscribers. Changes in a weight associated with an individual subscriber are preferably based upon an instantaneous rate at which the individual subscriber is capable of consuming the finite resource. [0034] Referring to the figures, FIG. 1 represents an exemplary variable rate communication system. One such system is described in the U.S. patent application Ser. No. 08/963,386, entitled “METHOD AND APPARATUS FOR HIGH RATE PACKET DATA TRANSMISSION,” filed on Nov. 3, 1997, assigned to Qualcomm, Inc. and incorporated herein by reference. The variable rate communication system comprises multiple cells 2 a-2 g. Each cell 2 is serviced by a corresponding base station 4. Various remote stations 6 are dispersed throughout the communication system. In the exemplary embodiment, each of remote stations 6 communicates with at most one base station 4 on a forward link at any data transmission interval. For example, base station 4 a transmits data exclusively to remote station 6 a, base station 4 b transmits data exclusively to remote station 6 b, and base station 4 c transmits data exclusively to remote station 6 c on the forward link at time slot n. As shown by FIG. 1, each base station 4 preferably transmits data to one remote station 6 at any given moment. In other embodiments, the base station 4 may communicate with more than one remote station 6 at a particular data transmission interval to the exclusion of all other remote stations 6 associated with the base station 4. In addition, the data rate is variable and is dependent on the carrier-to-interference ratio (C/I) as measured by the receiving remote station 6 and the required energy-per-bit-to-noise ratio (Eb/No). The reverse link from remote stations 6 to base stations 4 is not shown in FIG. 1 for simplicity. According to an embodiment, the remote stations 6 are mobile units with wireless transceivers operated by wireless data service subscribers. [0035] A block diagram illustrating the basic subsystems of an exemplary variable rate communication system is shown in FIGS. 2a-2 b. Base station controller 10 interfaces with packet network interface 24, public switched telephone network (PSTN) 30, and all base stations 4 in the communication system (only one base station 4 is shown in FIG. 2 for simplicity). Base station controller 10 coordinates the communication between remote stations 6 in the communication system and other users connected to packet network interface 24 and PSTN 30. PSTN 30 interfaces with users through a standard telephone network (not shown in FIG. 2). [0036] Base station controller 10 contains many selector elements 14, although only one is shown in FIG. 2 for simplicity. Each selector element 14 is assigned to control communication between one or more base stations 4 and one remote station 6. If selector element 14 has not been assigned to remote station 6, call control processor 16 is informed of the need to page remote station 6. Call control processor 16 then directs base station 4 to page remote station 6. [0037] Data source 20 contains a quantity of data which is to be transmitted to the remote station 6. Data source 20 provides the data to packet network interface 24. Packet network interface 24 receives the data and routes the data to the selector element 14. Selector element 14 transmits the data to each base station 4 in communication with remote station 6. In the exemplary embodiment, each base station 4 maintains a data queue 40 which stores the data to be transmitted to the remote station 6. [0038] The data is transmitted in data packets from data queue 40 to channel element 42. In the exemplary embodiment, on the forward link, a “data packet” refers to a quantity of data which is the maximum of 1024 bits and a quantity of data to be transmitted to a destination remote station 6 within a “time slot” (such as≈1.667 msec) . For each data packet, channel element 42 inserts the necessary control fields. In the exemplary embodiment, channel element 42 CRC encodes the data packet and control fields and inserts a set of code tail bits. The data packet, control fields, CRC parity bits, and code tail bits comprise a formatted packet. In the exemplary embodiment, channel element 42 then encodes the formatted packet and interleaves (or reorders) the symbols within the encoded packet. In the exemplary embodiment, the interleaved packet is covered with a Walsh code, and spread with the short PNI and PNQ codes. The spread data is provided to RF unit 44 which quadrature modulates, filters, and amplifies the signal. The forward link signal is transmitted over the air through antenna 46 on forward link 50. [0039] At remote station 6, the forward link signal is received by antenna 60 and routed to a receiver within front end 62. The receiver filters, amplifies, quadrature demodulates, and quantizes the signal. The digitized signal is provided to demodulator (DEMOD) 64 where it is despread with the short PNI and PNQ codes and decovered with the Walsh cover. The demodulated data is provided to decoder 66 which performs the inverse of the signal processing functions done at base station 4, specifically the de-interleaving, decoding, and CRC check functions. The decoded data is provided to data sink 68. [0040] The hardware, as pointed out above, supports variable rate transmissions of data, messaging, voice, video, and other communications over the forward link. The rate of data transmitted from the data queue 40 varies to accommodate changes in signal strength and the noise environment at the remote station 6. Each of the remote stations 6 preferably transmits a data rate control (DRC) signal to an associated base station 4 at each time slot. The DRC signal provides information to the base station 4 which includes the identity of the remote station 6 and the rate at which the remote station 6 is to receive data from its associated data queue. Accordingly, circuitry at the remote station 6 measures the signal strength and estimates the noise environment at the remote station 6 to determine the rate information to be transmitted in the DRC signal. [0041] The DRC signal transmitted by each remote station 6 travels through reverse link channel 52 and is received at base station 4 through antenna 46 and RF unit 44. In the exemplary embodiment, the DRC information is demodulated in channel element 42 and provided to a channel scheduler 12 a located in the base station controller 10 or to a channel scheduler 12 b located in the base station 4. In a first exemplary embodiment, the channel scheduler 12 b is located in the base station 4. In an alternate embodiment, the channel scheduler 12 a is located in the base station controller 10, and connects to all selector elements 14 within the base station controller 10. [0042] In the first-mentioned exemplary embodiment, channel scheduler 12 b receives information from data queue 40 indicating the amount of data queued up for each remote station, also called queue size. Channel scheduler 12 b then performs scheduling based on DRC information and queue size for each remote station serviced by base station 4. If queue size is required for a scheduling algorithm used in the alternate embodiment, channel scheduler 12 a may receive queue size information from selector element 14. [0043] Embodiments of the present invention are applicable to other hardware architectures which can support variable rate transmissions. The present invention can be readily extended to cover variable rate transmissions on the reverse link. For example, instead of determining the rate of receiving data at the base station 4 based upon a DRC signal from remote stations 6, the base station 4 measures the strength of the signal received from the remote stations 6 and estimates the noise environment to determine a rate of receiving data from the remote station 6. The base station 4 then transmits to each associated remote station 6 the rate at which data is to be transmitted in the reverse link from the remote station 6. The base station 4 may then schedule transmissions on the reverse link based upon the different data rates on the reverse link in a manner similar to that described herein for the forward link. [0044] Also, a base station 4 of the embodiment discussed above transmits to a selected one, or selected ones, of the remote stations 6 to the exclusion of the remaining remote stations associated with the base station 4 using a code division multiple access (CDMA) scheme. At any particular time, the base station 4 transmits to the selected one, or selected ones, of the remote station 6 by using a code which is assigned to the receiving base station(s) 4. However, the present invention is also applicable to other systems employing different time division multiple access (TDMA) methods for providing data to select base station(s) 4, to the exclusion of the other base stations 4, for allocating transmission resources optimally. [0045] The channel scheduler 12 schedules the variable rate transmissions on the forward link. The channel scheduler 12 receives the queue size, which is indicative of the amount of data to transmit to remote station 6, and messages from remote stations 6. The channel scheduler 12 preferably schedules data transmissions to achieve the system goal of maximum data throughput while conforming to a fairness constraint. [0046] As shown in FIG. 1, remote stations 6 are dispersed throughout the communication system and can be in communication with zero or one base station 4 on the forward link. In the exemplary embodiment, channel scheduler 12 coordinates the forward link data transmissions over the entire communication system. A scheduling method and apparatus for high speed data transmission are described in detail in U.S. patent application Ser. No. 08/798,951, entitled “METHOD AND APPARATUS FOR FORWARD LINK RATE SCHEDULING,” filed Feb. 11, 1997, assigned to the assignee of the present invention and incorporated by reference herein. [0047] According to an embodiment, the channel scheduler 12 is implemented in a computer system which includes a processor, random access memory (RAM) and a program memory for storing instructions to be executed by the processor (not shown). The processor, RAM and program memory may be dedicated to the functions of the channel scheduler 12. In other embodiments, the processor, RAM and program memory may be part of a shared computing resource for performing additional functions at the base station controller 10. [0048] [0048]FIG. 3 shows an embodiment of a scheduling algorithm which controls the channel scheduler 12 to schedule transmissions from the base station 4 to the remote stations 6. As discussed above, a data queue 40 is associated with each remote station 6. The channel scheduler 12 associates each of the data queues 40 with a “weight” which is evaluated at a step 110 for selecting the particular remote station 6 associated with the base station 4 to receive data in a subsequent service interval. The channel scheduler 12 selects individual remote stations 6 to receive a data transmission in discrete service intervals. At step 102, the channel scheduler initializes the weight for each queue associated with the base station 4. [0049] A channel scheduler 12 cycles through steps 104 through 112 at transmission intervals or service intervals. At step 104, the channel scheduler 12 determines whether there are any additional queues to be added due to the association of an additional remote station 6 with the base station 4 detected in the previous service interval. The channel scheduler 12 also initializes the weights associated with the new queues at step 104. As discussed above, the base station 4 receives the DRC signal from each remote station 6 associated therewith at regular intervals such as time slots. [0050] This DRC signal also provides the information which the channel scheduler uses at step 106 to determine the instantaneous rate for consuming information (or receiving transmitted data) for each of the remote stations associated with each queue. According to an embodiment, a DRC signal transmitted from any remote station 6 indicates that the remote station 6 is capable of receiving data at any one of eleven effective data rates shown in Table 1. Such a variable rate transmission system is described in detail in U.S. Pat. No. 6,064,678, entitled “METHOD FOR ASSIGNING OPTIMAL PACKET LENGTHS IN A VARIABLE RATE COMMUNICATION SYSTEM,” issued May 16, 2000, assigned to the assignee of the present invention and incorporated by reference herein. TABLE 1 Data Transmitted in Service Interval (Data_Size Length/Transmission Time Effective Data (Li)) of Service Interval (Li) Rate (Ri) (bits) (time slots ≈ 1.667 msec) 38.4 kbps 1024 16 76.8 kbps 1024 8 102.4 kbps 1024 6 153.6 kbps 1024 4 204.8 kbps 1024 3 307.2 kbps 1024 2 614.4 kbps 1024 1 921.6 kbps 1536 1 1228.8 kbps 2048 1 1843.2 kbps 3072 1 2457.6 kbps 4096 1 [0051] The channel scheduler 12 at step 108 determines the length of a service interval during which data is to be transmitted to any particular remote station 6 based upon the remote station's associated instantaneous rate for receiving data (as indicated in the most recently received DRC signal). According to an embodiment, the instantaneous rate of receiving data Ri determines the service interval length Li associated with a particular data queue at step 106. Table 1 summarizes the Li values for each of the eleven possible rates for receiving data at a remote station 6. [0052] The channel scheduler 12 at step 110 selects the particular data queue for transmission. The associated quantity of data to be transmitted is then retrieved from a data queue 40 and then provided to the channel element 42 for transmission to the remote station 6 associated with the data queue 40. As discussed below, the channel scheduler 12 at step 110 selects the queue for providing the data which is transmitted in a following service interval using information including the weight associated with each of the queues. The weight associated with the transmitted queue is then updated at step 112. [0053] [0053]FIG. 4 shows a diagram illustrating the timing of the channel scheduler 12 and data transmission in service intervals. FIG. 4 shows three discrete service intervals during transmission at time intervals S−1, S0 and S1. As steps 104 through 112 of the scheduling algorithm of FIG. 4 are executed during service intervals 202, the scheduling algorithm executing during the interval S0 preferably determines which queue is to be transmitted at the interval S1. Also, as discussed below, the execution of steps 104 through 112 relies on information in the DRC signals received from the remote stations 6. This information is preferably extracted from the most recently received DRC signals. Accordingly, the steps 104 through 110 are preferably executed and completed during the last time slot of the service intervals. This ensures that the decisions for allocating the subsequent service interval are based upon the most recent DRC signals (i.e., those DRC signals which are in the time slot immediately preceding the execution of the steps 104 through 110). [0054] Steps 104 and 110 are preferably completed within a time slot while providing sufficient time for the channel scheduler 12 to schedule the transmissions for the subsequent service interval. Thus the processor and RAM employed in the channel scheduler 12 are preferably capable of performing the steps 104 through 112 within the time constraints illustrated in FIG. 4. That is, the processor and RAM are preferably sufficient to execute steps 104 through 110, starting at the beginning of a time slot and completing steps 104 through 110, within sufficient time before the end of the time slot for the channel scheduler 12 to schedule transmissions in a subsequent service interval. [0055] One skilled in the art will appreciate that channel scheduler 12 may be implemented using a variety of approaches without departing from the present invention. For example, channel scheduler 12 may be implemented using a computer system including a processor, random access memory (RAM) and a program memory for storing instructions to be executed by the processor (not shown). In other embodiments, the functions of channel scheduler 12 may be incorporated into a shared computing resource also used to perform additional functions at the base station 4 or the base station controller 10. In addition, the processor used to perform channel scheduler functions may be a general-purpose microprocessor, digital signal processor (DSP), programmable logic device, application specific integrated circuit (ASIC), or other device capable of performing the algorithms described herein, without departing from the present invention. [0056] [0056]FIG. 5 shows an embodiment of the process for updating the weights at step 112 (FIG. 3). Step 302 computes a rate threshold “C” which is an average of all of the instantaneous rates associated with queues having data. The instantaneous rates associated with queues which do not include data are preferably eliminated for this calculation. Step 304 compares the instantaneous rate associated with the Selected_Queue selected at step 110. If an instantaneous rate associated with a Selected_Queue exceeds the threshold C, step 306 increments the weight associated with this Selected_Queue by a lower value which is preferably a number representing the quantity of data to be transmitted during the subsequent service interval from the Selected_Queue in units such as bits, bytes or megabytes. If the instantaneous rate associated with the Selected_Queue does not exceed the threshold calculated at step 302, step 308 increments the weight of the Selected_Queue by a higher value which is preferably a multiple “G” of the quantity of data which is to be transmitted during the subsequent service interval from the Selected_Queue such as bits, bytes or megabyte quantities. [0057] The selection of G is preferably based upon a fairness criteria which favors the allocation of service intervals to remote stations 6 having the capacity to receive data at higher rates. The system designer selects the size of G based upon the extent to which remote stations 6 receiving data at the higher rates are to be favored over the slower receiving remote stations 6. The larger the value of G, the more efficiently the forward link of the base station 4 is utilized. This efficiency, however, comes at the cost of depriving the subscribers of the slower receiving remote station 6 of the transmission resources of the forward link. The system designer therefore preferably selects the value of G in a manner which balances the two competing objectives of 1) enhancing the overall efficiency of the forward link and 2) preventing acute deprivation of the slower receiving remote stations 6. [0058] Steps 304, 306 and 308 illustrate that selected queues having a faster associated instantaneous data rate (i.e., exceeding the threshold C) will tend to have the associated weight incremented by only a small amount, while selected queues having a lower data rate (i.e., not exceeding the threshold C) will have its associated weight incremented by a significantly greater amount. As discussed below in connection with the algorithm performed at step 110 of FIG. 3, this implementation tends to favor servicing remote stations which receive data at relatively faster rates over those remote stations receiving data at lower data rates. [0059] This tendency enhances the throughput efficiency of the base station 4 in transmitting data in the forward link. However, as the weights associated with the often selected queues associated with the remote stations having the higher rates of receiving data (i.e., exceeding the threshold C) continue to be incremented, these weights eventually approach the weights of the queues associated with the less often selected queues associated with the remote stations having the slower rates of receiving data (i.e., not exceeding the threshold). The selection process at step 110 will then begin to favor the slower receiving remote stations as the weights of the faster receiving remote stations begin to exceed the weights of the slower receiving remote stations. This imposes a fairness restraint on the selection process at step 110 by preventing the faster receiving remote stations from dominating the forward link transmission resources of the base station to the exclusion of the slower receiving remote stations. [0060] It is an objective of the present embodiment to ensure that queues having no data to transmit are not given an unfair preference for transmission over those queues having data. At steps 102 and 104, all new queues are initialized with a weight of zero. Without being selected, such queues will continue to maintain the weight of zero provided that the queue is not selected. Therefore, step 310 in FIG. 5 decrements the weight of all queues, to a value no less than zero, by the minimum weight of any queue with data (determined at step 309). This is illustrated in detail below in an example shown in Table 2. TABLE 2 Remote Remote Weights at the End of the Station Station Amount by Service Interval Selected in Serviced in Which Service Remote Remote Remote Service Service Weights are Interval Station 1 Station 2 Station 3 Interval Interval Decremented 0 0 0 0 N/A N/A N/A 1 1 0 0 1 N/A 0 2 1 1 0 2 1 0 3 0 0 7 3 2 1 4 1 0 7 1 3 0 5 0 0 6 2 1 1 6 1 0 6 1 2 0 7 0 0 5 2 1 1 [0061] This example has three remote stations each associated with a queue of data to be transmitted from a base station. The example assumes that remote station 1 has the highest data rate, remote station 2 has the next highest data and remote station 3 has the lowest data rate. For simplicity, it is assumed these data rates do not change over the service intervals 1 through 7. It is assumed that the data rates at remote station 1 and remote station 2 each exceed the threshold C at step 304, and that the data rate associated with remote station 3 does not exceed this threshold. It is further assumed that step 306 will increment the weight of the Selected_Queue by one if the Selected_Queue is associated with the remote station 1 or remote station 2, and that step 308 will increment the weight of the Selected_Queue by eight if the Selected_Queue is associated with the remote station 3. [0062] At service interval 1, the channel scheduler 12 selects the remote station 1 to receive data in the subsequent service interval, since, while it has the lowest weight along with remote stations 2 and 3, remote station 1 has a higher rate of receiving data. Data is then transmitted to remote station 1 during service interval 2 and the weight associated with the remote station 1 is incremented by one at the end of service interval 1. The channel scheduler 12 then selects remote station 2 to receive data in service interval 3 (since remote station 2 has the lowest weight and a faster rate of receiving data than does remote station 3). As shown in Table 2, the weight of remote station 2 is incremented by 1 by the end of the service interval 2. [0063] At the beginning of service interval 3, remote station 3 has the lowest weight. The channel scheduler 12 selects remote station 3 to receive data at the service interval 4. The state at the end of interval 3 reflects that weight of the remote station 3 was incremented from zero to eight to reflect the selection of the remote station 3. The weights at the remote stations 1, 2 and 3 are then decremented by one which is consistent with step 310 (FIG. 5) as indicated in Table 2. At service interval 4, the channel scheduler 12 selects remote station 1 to receive data in service interval 4 since the queue associated with remote station 1 has the lowest weight and the highest rate for receiving data. [0064] The channel scheduler 12 at service interval 5 selects remote station 2 to receive data during service interval 6. The weight associated with the remote station 2 is first incremented at step 306 and the weights of all of the remote stations are decremented by one as reflected in the weights at the end of the service interval 5 as shown in Table 2. Remote station 1, having the lowest weight, is then selected again in service interval 6 for receiving data in service interval 7. [0065] As shown in the embodiment of FIG. 1, the remote stations 6 are mobile and capable of changing associations among the different base stations 4. For example, a remote station 6 f is initially receiving data transmissions from the base station 4 f. The remote station 6 f may then move out of the cell of the base station 4 f and into the cell of the base station 4 g. The remote station 6 f can then start transmitting its DRC signal to alert the base station 4 g instead of the base station 4 f. By not receiving a DRC signal from the remote station 6 f, logic at the base station 4 f deduces that the remote station 6 f has disengaged and is no longer to receive data transmissions. The data queue associated with the remote station 6 f may then be transmitted to the base station 4 g via a land line or RF communication link. [0066] According to an embodiment of the present invention, the channel scheduler 12 at a base station 4 assigns a weight to a queue of a remote station 6 which has disengaged and re-engaged the base station 4. Rather than simply assigning a weight of zero to the re-engaging remote station 6, the base station 4 preferably assigns a weight which does not give the re-engaging remote station an unfair advantage for receiving data transmissions from the base station 4. In one embodiment, the channel scheduler 12 randomly assigns a weight to the queue of the re-engaging remote station 6 according to a uniform distribution between zero and the highest weight of any queue currently serviced by the channel scheduler 12. In another embodiment, the base station 4 receives the weight of the re-engaging remote station 6 from the last base station associated with the remote station 6 via a land line transmission. [0067] In an alternative embodiment, the channel scheduler 12 gives a re-engaging remote station 6 “partial credit” for having a past association with the base station 4. The channel scheduler 12 determines the number of time slots that the previous service interval spans “n,” and maintains a history of the number of time slots [0068] “mi” during the previous service interval that the base station 4 received a DRC from the remote station i. The weight of the queue associated with the remote station i is then decremented at step 310 as follows: W i=W i−m i /n x W min [0069] where: [0070] Wi=the weight of queue i [0071] Wmin=the minimum weight of any queue with data to transmit to a remote station [0072] mi =the number of time slots during the previous service interval that the base station received a DRC from the remote station i [0073] n=the number of time slots that the previous service interval spans [0074] [0074]FIGS. 6a through 6 c show a flow diagram illustrating the logic performed at step 110 (FIG. 3) according to an embodiment. Step 402 initializes the identity of the Selected_Queue as being the first data queue having data for transmission to an associated remote station 6. At steps 402 through 422, the channel scheduler 12 determines whether this initial queue or a different data queue having data should be selected for transmission to its associated remote station 6. The Next_Queue is then retrieved at step 406 and step 408 determines whether this Next_Queue has data. If the Next_Queue does not have data, execution returns to step 406 to select a subsequent data queue. Otherwise, if this Next_Queue has data, the identity of the Current_Queue is assigned the Next_Queue. If the weight of the Current_Queue exceeds the weight of the Selected_Queue, step 412 returns execution to step 406 to retrieve a subsequent Next_Queue. Otherwise, step 414 determines whether the weight of the Current_Queue is less than the weight of the Selected_Queue. If the weight of the Current_Queue is less than the weight of the Selected_Queue, step 414 moves execution to step 420 to assign the identity of the Current_Queue to the Selected_Queue. [0075] Otherwise, the logic at steps 412 and 414 dictate that if execution reaches step 416, the weights of the Current_Queue and the Selected_Queue are equal. Step 424 assigns the Current_Queue as the Selected_Queue when the following conditions are met: [0076] 1) the instantaneous rate of receiving data associated with the Current_Queue exceeds the instantaneous rate of receiving data associated with the Selected_Queue (step 416); and [0077] 2) if the service interval assigned to the Current_Queue would exhaust all of the data stored in the Current_Queue, leaving a fractional remainder of data in the service interval assigned to the Current_Queue, such a fractional remainder would not exceed any such fractional remainder of data in the Selected_Queue in the service interval assigned to the Selected_Queue (steps 418 through 422). [0078] Otherwise, execution returns to step 406 to select the Next_Queue. [0079] [0079]FIGS. 7a through 7 d show a flow diagram illustrating a second embodiment of the logic performed at the step 110 for selecting a queue for transmission to an associated remote station 6. In this embodiment, it is assumed that each base station 4 periodically transmits a control signal to all associated remote stations 6 having a fixed duration (such as eight to sixteen time slots). According to an embodiment, the base station 4 transmits this control signal once every 400 msec. During this control transmission, no data from any data queue 40 (FIG. 2) may be transmitted to an associated remote station 6. An objective of the embodiment shown at FIGS. 7a and 7 b is to select only those data queues which may completely transmit for a service interval having a length determined at step 108 before the beginning of the next control signal transmission. [0080] Steps 499 through 507 filter all of the queues to determine which queues are candidates for completion before the beginning of the next control signal transmission. Step 499 determines the time “T” until the next control signal transmission by, for example, subtracting the scheduled time of the beginning of the next control signal transmission by the beginning of the next scheduled service interval. Step 501 determines whether the length of service interval associated with each queue determined at step 108 can be transmitted within the time T based upon the instantaneous rate of transmission for the remote unit 6 associated with the queue determined at step 106. According to an embodiment, step 501 compares the service interval length with T. Step 502 then determines whether the Next_Queue includes any data. If the Next_Queue satisfies the conditions at steps 501 and 502, the identity of the Next_Queue is assigned to the Selected_Queue. [0081] Steps 504 through 508 examine the remaining data queues to determine the data queues having associated service interval (determined at step 108) which may be completely transmitted prior to the beginning of the next control signal transmission. Upon meeting the criteria set forth at steps 507 and 508, the Current_Queue is assigned as the Next_Queue. Steps 512 through 526 then perform a selection process according to queue weights in a manner similar to that discussed above in connection with steps 412 through 426 in FIGS. 6a through 6 c. However, in the embodiment of FIGS. 7a through 7 d, only those data queues having an assigned packet length which may be completed prior to the beginning of the next control signal transmission may be candidates for selection based upon the associated queue weight. [0082] [0082]FIGS. 8a and 8 b show a flow diagram illustrating a third embodiment of the logic executed at step 110 at FIG. 3 for selecting a queue for transmission. In this embodiment, subscribers of select remote units 6 are guaranteed a minimum average rate of data transmission. For each such premium remote unit, the channel scheduler 12 maintains a timer which alerts the channel scheduler 12 to schedule a transmission to its premium queue, regardless of the weights associated with the remaining queues. The time interval for the particular timer is determined based upon the average data rates guaranteed to the customer, the service interval assigned to that data queue at step 108 (see center column of Table 1), and any instantaneous data rate for receiving data determined at step 106. Thus, the time interval associated with the premium queue timer is dynamic with respect to these values. According to an embodiment, the timer interval is determined whenever the timer is reset as follows: T j = Data_Size  ( L j ) r j [0083] where: [0084] Ti=timer interval for premium queue j [0085] Data_Size (Lj)=quantity of data to be transmitted in service interval assigned to the premium queue j [0086] ri=average data transmission rate guaranteed to the premium subscriber associated with the premium queue j [0087] The timer is reset at either of two events. The first event initiating a reset of the timer is an expiration of the timer interval. The second event for initiating a reset of the timer is a selection of the associated premium data queue based upon its associated weight in a manner discussed above with reference to FIGS. 6a through 6 c. [0088] Steps 606 through 610 determine whether the Next_Queue is a premium queue entitled to a minimum average rate of receiving data and, if so, whether the timer associated with that premium queue has expired. If the timer has expired, step 612 assigns the identity of the Next_Queue to the Selected_Queue and execution at step 110 completes. The weight of the selected queue is then updated at step 112 as discussed above. If there are no premium queues with an expired timer, step 614 initiates the selection of the queue for transmission in the subsequent service interval at step 616 based upon the weights of the queues in a manner discussed above with references to FIGS. 6a through 6 c. If the queue selected at step 616 is a premium queue having an associated timer, step 618 initiates a reset of the timer associated with the selected queue at step 620. [0089] As outlined above, the timer associated with any particular premium data queue is reset following its selection based upon the associated weight at step 620. The associated timer is also reset when it expires before selection of the data queue. The timer thus alerts the channel scheduler 12 to override the logic directed to selecting data queues based upon weights to ensure that this subscriber is associated with the premium data queues receive a guaranteed minimum average rate of receiving data. [0090] [0090]FIG. 9 shows an alternate embodiment of the process for updating the weights at step 110 (FIG. 3). This alternate embodiment allows the selection of a queue that does not have the smallest weight. Volatility in transmission rates makes it advantageous to sometimes select a queue that does not have the smallest weight. For example, a queue might have the lowest weight during a time slot when its requested rate is temporarily low. If the rate increases in a subsequent time slot, then transmission can then take place at the higher rate. Waiting a few time slots may allow transmission from that low-weight queue at a higher requested rate. [0091] The alternate embodiment begins with step 702 by determining the sum of the values M and K. M is the minimum weight of all queues, including those with no data to send or with invalid DRC values. K is an offset used to define a range of weight values within which a queue is selected based on a Desirability Metric. [0092] After determining the sum of M and K, a decision is made in step 704 about whether or not to use the Desirability Metric for queue selection. The Desirability Metric is only used to choose among queues having weights less than or equal to (M+K) as well as having valid DRC's and data to send. [0093] First, all queues having valid DRC's and data to send are evaluated to determine how many also have a weight greater than the sum (M+K). If all queues having valid DRC's and data to send also have weights greater than the sum (M+K), then the lowest-weight queue among them is selected in step 706. If one or more queues with valid DRC's and data to send have a weight less than or equal to (M+C), then one of those queues is selected in step 708 according to the Desirability Metric. [0094] Once a queue is selected in either step 706 or step 708, then queue selection is complete (shown as step 710), and processing continues from step 110 to 112 as in FIG. 3. [0095] [0095]FIG. 10 is a more detailed flow chart depicting an exemplary embodiment of the queue selection method depicted in FIG. 9. In FIG. 10, after determining in step 702 the sum (M+K), each queue that has a valid DRC and data to send is evaluated and one queue is selected and returned from step 110. [0096] In the exemplary embodiment, the first step 702 is again to determine the sum (M+K). If there are no queues having data and a valid DRC, then no queue is selected and the method proceeds to step 772 (return to the flow of FIG. 3). If there is only one queue in the list having data and a valid DRC, that queue is returned. Otherwise, QSEL and QCUR are assigned in steps 754 and 756 from the two or more queues having data and a valid DRC. QSEL represents the currently selected queue, and QCUR represents the current queue being compared with QSEL. Each queue having data and a valid DRC is compared with QSEL, and if certain selection criteria are met, that queue replaces the current QSEL. After all queues have been evaluated, the QSEL remaining is the selected queue for transmission and is returned at step 772. [0097] At step 758, the weight of the selected queue QSEL is compared to (M+K). If the weight of QSEL is greater than (M+K), then the decision in step 762 of whether to replace QSEL with QCUR in step 764 is based solely on which queue has the lower weight. If at step 758 the weight of selected queue QSEL is less than or equal to (M+K), then the weight of current queue QCUR is compared to (M+K) at step 760. If only QSEL is less than or equal to (M+K), then QCUR is not selected and the method proceeds to step 770. If the weights of both QSEL and QCUR are less than or equal to (M+K), then in step 766 the queues are evaluated according to a Desirability Metric. If QCUR is deemed more desirable than QSEL according to the Desirability Metric, then QCUR becomes the new selected queue QSEL in step 764). [0098] After each queue is evaluated, step 770 checks for queues having data to send and a valid DRC that remain to be evaluated. If more such queues remain to be evaluated, then one is selected in step 768 as the next QCUR, and is evaluated beginning at step 758. If no more queues remain to be evaluated, then the selected queue QSEL is returned at step 772. [0099] Several alternate embodiments of the present invention vary in the method used to determine K. In some embodiments, K is simply a constant. In other embodiments, K is calculated at the beginning of each round of queue selections. Some alternate embodiments also differ in the Desirability Metric used. Any methods of determining K or Desirability Metrics may be used without departing from the present invention. [0100] In a particular embodiment using a “Modified Grade of Service (GOS)” algorithm, K is a constant that does not depend on the number of remote stations in the system. A filtered average throughput is maintained for each user and associated queue according to the following equation: Average_Throughput=[(11/TC)*Old Average_Throughput]+(1/TC*Rate) (1) [0101] where Average_Throughput is the average throughput for each queue used in calculating the Desirability Metric value of the queue, TC is a time constant, Old_Average_Throughput is the previous value of Average_Throughput, and Rate is the bit rate used to transmit from the queue in each time slot. The Average_Throughput is updated for each queue for every transmission time slot. For all queues except the selected queue in each time slot, the Rate will be zero. The Desirability Metric value of any queues evaluated at steps 708 or 766 are determined according to the following equation: Desirability_Metric=Current_Requested_Rate-Average_Throughput(2) [0102] where Current_Requested_Rate is the DRC rate of the queue and Average_Throughput is as calculated in Equation (1). [0103] One skilled in the art will appreciate that other formulas may be used to determine the Desirability Metric and the updated average throughput. For example, the formula for updating the average throughput may take into account more values of requested rate than the current value, such as the previous two requested rate values. Additionally, TC may vary over time based on the number of active users in the system or based on the variability of previous requested rates. Some of the alternate formulas that can be used to compute the Desirability Metric are described below. [0104] The Modified GOS algorithm is advantageous in that it allows optimization of queue selection in an environment where DRC rates are changing over time. So, although one queue has the lowest weight during a particular time slot, that queue might not be selected if it is experiencing a transient decrease in its requested DRC rate. The Modified GOS algorithm permits a limited delay in transmission to such a queue in anticipation that the rate will increase for one of the subsequent time slots. [0105] In an alternate embodiment using a “Modified GOS High DRC” algorithm, the Desirability Metric value is equal to the average throughput computed according to Equation (1). This algorithm results in slightly lower overall throughput, but requires less computational complexity. The Modified GOS High DRC algorithm does not require maintenance of a filtered average throughput value for each queue. [0106] In another alternate embodiment using a “Hybrid” algorithm, the Desirability Metric value is equal to the Rate divided by Average_Throughput. The Hybrid algorithm sacrifices throughput to achieve a greater degree of “fairness” in selecting a queue for transmission by selecting a queue based on the percentage by which the requested rate exceeds the average rate. For example, the algorithm selects a first user having a requested Rate of 76.8K and an Average_Throughput of 30K instead of a second user having a requested Rate of 1228.8K and an Average_Throughput of 900K. Although greater overall throughput can be achieved by taking advantage of the rate spike of the second user, the Hybrid algorithm chooses the first user because the first user has a current rate that is more than twice his or her average throughput. [0107] In a suboptimal embodiment, the Hybrid algorithm is modified by varying K according to the number of users to create a “Modified Hybrid” algorithm. In the Modified Hybrid algorithm, K is inversely proportional to the number of users, and the Desirability Metric value is equal to the Rate divided by Average_Throughput. By varying K according to the number of users to modify the Modified GOS and Modified GOS High DRC algorithms, similar alternate suboptimal embodiments are created. [0108] In an alternate suboptimal embodiment, the Hybrid algorithm is modified by varying K according to the number of users to create a “Modified Hybrid” algorithm. The Modified Hybrid algorithm seeks to impose an additional degree of “fairness” at the expense of throughput. [0109] [0109]FIG. 11a is a block diagram of a forward link architecture configured in accordance with an exemplary embodiment of the present invention. The data is partitioned into data packets and provided to CRC encoder 712. For each data packet, CRC encoder 712 generates frame check bits (e.g., the CRC parity bits) and inserts code tail bits. The formatted packet from CRC encoder 712 comprises the data, the frame check and code tail bits, and other overhead bits described below. In the exemplary embodiment, encoder 714 encodes the formatted packet in accordance with the encoding format disclosed in U.S. Pat. No. 5,933,462, entitled “SOFT DECISION OUTPUT DECODER FOR DECODING CONVOLUTIONALLY ENCODED CODEWORDS”, issued Aug. 3, 1999, assigned to the assignee of the present invention and incorporated by reference herein. One skilled in the art will appreciate that other well known encoding formats can also be used and are within the scope of the present invention. The encoded packet from encoder 714 is provided to interleaver 716, which reorders the code symbols in the packet. The interleaved packet is provided to frame puncture element 718, which removes a fraction of the packet in a manner described below. The punctured packet is provided to multiplier 720, which scrambles the data with the scrambling sequence from scrambler 722. Puncture element 718 and scrambler 722 are described in detail in the aforementioned U.S. patent application Ser. No. 08/963,386. The output from multiplier 720 comprises the scrambled packet. [0110] The scrambled packet is provided to variable rate controller 730, which demultiplexes the packet into K parallel inphase and quadrature channels, where K is dependent on the data rate. In the exemplary embodiment, the scrambled packet is first demultiplexed into the inphase (I) and quadrature (Q) streams. In the exemplary embodiment, the I stream comprises even-indexed symbols and the Q stream comprises odd-indexed symbols. Each stream is further demultiplexed into K parallel channels such that the symbol rate of each channel is fixed for all data rates. The K channels of each stream are provided to Walsh cover element 732, which covers each channel with a Walsh function to provide orthogonal channels. The orthogonal channel data are provided to gain element 734 which scales the data to maintain a constant total-energy-per-chip (and hence constant output power) for all data rates. The scaled data from gain element 734 is provided to multiplexer (MUX) 760, which multiplexes the data with the preamble. The preamble is discussed in detail in the aforementioned U.S. patent application Ser. No. 08/963,386. The output from MUX 760 is provided to multiplexer (MUX) 762, which multiplexes the traffic data, the power control bits, and the pilot data. The output of MUX 762 comprises the I Walsh channels and the Q Walsh channels. [0111] In the exemplary embodiment, a forward link pilot channel provides a pilot signal that is used by remote stations 6 for initial acquisition, phase recovery, timing recovery, and ratio combining. These uses are similar to those in CDMA communication systems conforming to the IS-95 standard. In the exemplary embodiment, the pilot signal is also used by remote stations 6 to perform the C/I measurement. [0112] The block diagram of the forward link pilot channel of the exemplary embodiment is also shown in FIG. 11A. In the exemplary embodiment, the pilot data comprises a sequence of all zeros (or all ones) which is provided to multiplier 756. Multiplier 756 covers the pilot data with Walsh code W0. Since Walsh code W0 is a sequence of all zeros, the output of multiplier 756 is the pilot data. The pilot data is time multiplexed by MUX 762 and provided to the I Walsh channel which is spread by the short PN1 code within complex multiplier 814 (see FIG. 11B). [0113] The exemplary block diagram of the power control channel is also shown in FIG. 11A. The Reverse Power Control (RPC) bits are provided to symbol repeater 750, which repeats each RPC bit a predetermined number of times. The repeated RPC bits are provided to Walsh cover element 752, which covers the bits with the Walsh covers corresponding to the RPC indices. The covered bits are provided to gain element 754, which scales the bits prior to modulation to maintain a constant total transmit power. In the exemplary embodiment, the gains of the RPC Walsh channels are normalized so that the total RPC channel power is equal to the total available transmit power. The gains of the Walsh channels can be varied as a function of time for efficient utilization of the total base station transmit power while maintaining reliable RPC transmission to all active remote stations 6. In the exemplary embodiment, the Walsh channel gains of inactive remote stations 6 are set to zero. Automatic power control of the RPC Walsh channels is possible using estimates of the forward link quality measurement from the corresponding DRC channel from remote stations 6. The scaled RPC bits from gain element 754 are provided to MUX 762. [0114] A block diagram of the exemplary modulator used to modulate the data is illustrated in FIG. 11 B. The I Walsh channels and Q Walsh channels are provided to summers 812 a and 812 b, respectively, which sum the K Walsh channels to provide the signals Isum and Qsum, respectively. The Isum and Qsum signals are provided to complex multiplier 814. Complex multiplier 814 also receives short PNI and PNQ sequences from short code generator 838, and multiplies the two complex inputs in accordance with the following equation: (Imult+jQmult)=(Isum+jQsum)*(PN_I+jPN_Q) (3) =(Isum*PN_I−Qsum*PN_Q)+j(Isum*PN_Q+Qsum*PN_I), [0115] where Imult and Qmult are the outputs from complex multiplier 814 and j is the complex representation. The Imult and Qmult signals are provided to filters 816 a and 816 b, respectively, which filter the signals. The filtered signals from filters 816 a and 816 b are provided to multipliers 818 a and 818 b, respectively, which multiply the signals with the inphase sinusoid COS(wct) and the quadrature sinusoid SIN(wct), respectively. The I modulated and Q modulated signals are provided to summer 820 which sums the signals to provide the forward modulated waveform S(t). [0116] The block diagram of the exemplary traffic channel shown in FIGS. 3A and 3B is one of numerous architectures that support data encoding and modulation on the forward link. Other architectures, such as the architecture for the forward link traffic channel in the CDMA system conforming to the IS-95 standard, can also be utilized and are within the scope of the present invention. [0117] For example, one skilled in the art will appreciate that complex multiplier 814 and short code generator 838 can be replaced by a pseudonoise (PN) spreader that performs simple multiplication of signals by PN short codes instead of complex multiplication. In addition, encoder 714 may use any of several forward error correction techniques including turbo-coding, convolutional coding, or other forms of soft decision or block coding. Also, interleaver 716 may utilize any of a number of interleaving techniques, including block interleaving, e.g., bit reversal interleaving, or pseudo-random interleaving.. [0118] While there has been illustrated and described what are presently considered to be the preferred embodiments of the present invention, it will be understood by those skilled in the art that various other modifications may be made, and equivalents may be substituted, without departing from the true scope of the invention. Additionally, many modifications may be made to adapt a particular situation to the teachings of the present invention without departing from the central inventive concept described herein. Therefore, it is intended that the present invention not be limited to the particular embodiments disclosed, but that the invention include all embodiments falling within the scope of the appended claims.
Patent CitationsCited PatentFiling datePublication dateApplicantTitleUS5859835 *Apr 15, 1996Jan 12, 1999The Regents Of The University Of CaliforniaTraffic scheduling system and method for packet-switched networksUS5923650 *Aug 20, 1997Jul 13, 1999Qualcomm IncorporatedMethod and apparatus for reverse link rate schedulingUS5982758 *Feb 13, 1997Nov 9, 1999Hamdy; Walid M.Method and apparatus for merging neighbor lists in a CDMA mobile telephone systemUS6028852 *Mar 13, 1997Feb 22, 2000Matsushita Electric Industrial Co., Ltd.CDMA cellular radio transmission systemUS6031827 *Feb 19, 1997Feb 29, 2000Nokia Mobile Phones LimitedMethod for radio resource control* Cited by examinerReferenced byCiting PatentFiling datePublication dateApplicantTitleUS7272113 *Dec 3, 2002Sep 18, 2007Nokia CorporationApparatus, and associated method, for communicating frame-formatted data at a selected QoS level in a radio communication systemUS7349338Apr 15, 2003Mar 25, 2008Lucent Technologies IncScheduler and method for scheduling transmissions in a communication networkUS7406098 *Apr 28, 2003Jul 29, 2008Qualcomm IncorporatedResource allocation in a communication system supporting application flows having quality of service requirementsUS7453801Apr 28, 2003Nov 18, 2008Qualcomm IncorporatedAdmission control and resource allocation in a communication system supporting application flows having quality of service requirementsUS7586990 *Nov 22, 2005Sep 8, 2009Motorola, Inc.Method and system for allocating subcarriers to subscriber devicesUS7660280Oct 1, 2004Feb 9, 2010Fujitsu LimitedVirtually centralized uplink schedulingUS7680475Jun 7, 2005Mar 16, 2010Qualcomm IncorporatedDynamic ASBR schedulerUS7830857 *Jun 29, 2006Nov 9, 2010Agere Systems Inc.Credit-based wireless network schedulingUS8032145Aug 12, 2005Oct 4, 2011Qualcomm IncorporatedRestrictive reuse set management algorithm for equal grade of service on FL transmissionUS8054794Dec 23, 2009Nov 8, 2011Fujitsu LimitedVirtually centralized uplink schedulingUS8059589Jun 8, 2005Nov 15, 2011Qualcomm IncorporatedDynamic restrictive reuse schedulerUS8059596Dec 23, 2009Nov 15, 2011Fujitsu LimitedVirtually centralized uplink schedulingUS8098708 *Jul 18, 2008Jan 17, 2012Harris CorporationSystem and method for communicating data using constant envelope orthogonal Walsh modulation with channelizationUS8160005Dec 23, 2009Apr 17, 2012Fujitsu LimitedVirtually centralized uplink schedulingUS8184583Dec 23, 2009May 22, 2012Fujitsu LimitedVirtually centralized uplink schedulingUS8228920 *May 1, 2006Jul 24, 2012Agere Systems Inc.High-throughput scheduler with guaranteed fairness for wireless networks and other applicationsUS8483691Jun 18, 2008Jul 9, 2013Qualcomm IncorporatedRestrictive reuse for a wireless communication systemUS8526963Jun 18, 2004Sep 3, 2013Qualcomm IncorporatedRestrictive reuse for a wireless communication systemUS8675509Jun 3, 2009Mar 18, 2014Qualcomm IncorporatedFeedback to support restrictive reuseUS20030133408 *Dec 3, 2002Jul 17, 2003Cheng Mark W.Apparatus, and associated method, for communicating frame-formatted data at a selected QoS level in a radio communication systemUS20030198204 *Apr 28, 2003Oct 23, 2003Mukesh TanejaResource allocation in a communication system supporting application flows having quality of service requirementsUS20040208183 *Apr 15, 2003Oct 21, 2004Krishna BalachandranScheduler and method for scheduling transmissions in a communication networkUS20050096062 *Jun 18, 2004May 5, 2005Ji TingfangRestrictive reuse for a wireless communication systemUS20060002360 *Jun 8, 2005Jan 5, 2006Ji TingfangDynamic restrictive reuse schedulerUS20060013245 *Jul 15, 2005Jan 19, 2006Saied AbediPacket schedulingUS20060182022 *Oct 1, 2004Aug 17, 2006Saied AbediVirtually centralized uplink schedulingUS20060205424 *Oct 30, 2002Sep 14, 2006Marina DupcinovMethod for use in an ad-hoc wlan systemUS20070004419 *Jun 7, 2005Jan 4, 2007Ji TingfangDynamic ASBR schedulerUS20070116139 *Nov 22, 2005May 24, 2007Subramanian Vijay GMethod and system for allocating subcarriers to subscriber devicesUS20070253375 *May 1, 2006Nov 1, 2007Hamilton Christopher WHigh-throughput scheduler with guaranteed fairness for wireless networks and other applicationsUS20080002582 *Jun 29, 2006Jan 3, 2008Jinhui LiCredit-Based Wireless Network SchedulingUS20080253319 *Jun 18, 2008Oct 16, 2008Qualcomm IncorporatedRestrictive reuse for a wireless communication systemUS20090245185 *Dec 8, 2006Oct 1, 2009Thomas Malcolm ChapmanMethod of Scheduling Groups of Mobile UsersUS20100002597 *Jun 3, 2009Jan 7, 2010Qualcomm IncorporatedFeedback to support restrictive reuseUS20100014559 *Jul 18, 2008Jan 21, 2010Harris CorporationSystem and method for communicating data using constant envelope orthogonal walsh modulation with channelizationUS20100098017 *Dec 23, 2009Apr 22, 2010Fujitsu LimitedVirtually Centralized Uplink SchedulingUS20100098018 *Dec 23, 2009Apr 22, 2010Fujitsu LimitedVirtually Centralized Uplink SchedulingUS20100099427 *Dec 23, 2009Apr 22, 2010Fujitsu LimitedVirtually Centralized Uplink SchedulingUS20100142469 *Dec 23, 2009Jun 10, 2010Fujitsu LimitedVirtually Centralized Uplink SchedulingUS20110200017 *Apr 22, 2011Aug 18, 2011Ipr Licensing, Inc.Grade of service and fairness policy for bandwidth reservation systemEP1469641A2 *Mar 30, 2004Oct 20, 2004Lucent Technologies Inc.Scheduler and method for scheduling transmissions in a communication networkEP1853016A1Feb 2, 2007Nov 7, 2007Agere Systems, Inc.High-throughput scheduler with guaranteed fairness for wireless networks and other applicationsWO2004084509A2 *Mar 17, 2004Sep 30, 2004Qualcomm IncorporatedAdmission control and resource allocation in a communication system supporting quality of serviceWO2004084509A3 *Mar 17, 2004Jan 6, 2005Rajesh PankajAdmission control and resource allocation in a communication system supporting quality of serviceWO2005034444A1 *Oct 1, 2004Apr 14, 2005Fujitsu LimitedVirtually centralized uplink schedulingWO2005125263A1 *Jun 8, 2005Dec 29, 2005Qualcomm IncorporatedDynamic restrictive reuse schedulerWO2006130021A2 *Jun 2, 2006Dec 7, 2006Telenor AsaMethod and device for administration of traffic in communication system using a contention based access controlWO2006133023A2 *Jun 2, 2006Dec 14, 2006Qualcomm IncorporatedDynamic restrictive reuse scheduler* Cited by examinerClassifications U.S. Classification370/342, 370/335, 375/130International ClassificationH04J3/16, H04J13/04, H04W28/18, H04W12/10, H04W28/22, H04W72/12, H04L12/56, H04L12/28, H04W72/06Cooperative ClassificationH04L47/15, H04W28/22, H04L47/6285, H04L47/562, H04W28/18, H04W72/1252, H04W72/04, H04W72/0413, H04W72/10, H04L47/6255, H04L12/5693, H04L47/621, H04L47/6265, H04L47/522, H04L47/623, H04L47/14, H04W12/10European ClassificationH04L12/56K, H04L47/14, H04W28/18, H04L47/56A, H04L47/62H, H04L47/62G1, H04L47/62G3, H04L47/62B, H04W72/12B10, H04L47/52B, H04L47/62D2, H04W72/10Legal EventsDateCodeEventDescriptionJun 22, 2009FPAYFee paymentYear of fee payment: 4Mar 18, 2013FPAYFee paymentYear of fee payment: 8RotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services

value: This website is a search engine provided by Google. Handling over 3.5 billion searches per day, it has a 92% share of the global search engine market.


text:
What it takes to succeed as a college tight end - College Football - ESPN
What it takes to succeed as a college tight end
The following is a breakdown of the eight categories (size excluded) we use when evaluating college tight ends. Also included in each category are, in my opinion, the top three examples from college football today. To continue reading this article you must be an Insider Insider

value: This website is the official website of ESPN. It is owned by ESPN Internet Ventures, a division of ESPN Inc.


text:
Toshiba 75014846 Main Board for 40XU640U,46XV640U | eBay
Details about Toshiba 75014846 Main Board for 40XU640U,46XV640U
Toshiba 75014846 Main Board for 40XU640U,46XV640U
“We are a TV repair shop and purchased this board, but never used it. It tested fine.”
barney1128 (1571 )
SAMSUNG LJ97-02091A INVERTER BOARD FOR TOSHIBA 46XV640U AND OTHER MODELS
AUO 55.46T09.C10 T-CON BOARD FOR TOSHIBA 46XV640U AND OTHER MODELS
Toshiba 75012468 Main Board For 46XV540U
Orginal Inverter Board SS1460_16A01 Rev0.4 for Toshiba 46XV640U 46G310U
75015755 Main Board From Toshiba 46XV645U- DEFECTIVE; FOR PARTS ONLY
Toshiba 40XV640U 431C1851L02 (461C1851L02) Main Board (AS IS / BAD BOARD)
TOSHIBA 75015755 / PE0748A MAIN BOARD FOR 40XV645U / 46XV645U AND OTHER MODELS
Toshiba PE0748 MAIN BOARD for 40XV645U
TOSHIBA 75013106 / PE0634B MAIN BOARD FOR TOSHIBA 46XV545U AND OTHER MODELS
330977035951
Board Number: 461C1851L12431C1851L12TT46TSTT40T VTV-L4010 Compatible Brand: Toshiba
Type: Main Board Compatible Model: 40XU640U,46XV640U


text: and this kid is out there in the middle of nowhere with 400 taliban and in the middle east and he's tremendously courageous and tremendously brave and taking them on saving not only fellow soldiers, but ultimately saving database. ask about bravery and courage go on often every day in a war zone and i just think it's difficult to think that everybody who performs in that kind of fashion that somehow we have to establish, you know, a separate fund to try to assist them. the reality is that men and women in uniform put their lives on the line every day. it's a sacrifice for this country. and i think the great thing about this country is that there are those that are willing to do that and not worry about whether or not they're going to get an award for additional pay, but they just do it because they love this country. >> secretary, why did you, general dempsey and secretary clinton recommend that the u.s. provide weapons to the rebel forces in syria? were you disappointed the white house turned that down? and do you think is the result of that that this war could go on endlessly? > Search Results 0 to 4 of about 5


text:
Book Terracaribe Hotel Cancun, Mexico : Agoda.com
Terracaribe Hotel Av. Lopez Portillo # 70 Esquina Av. Bonampak, Cancun Downtown, Cancun, Mexico 77524
Based on 30 reviews See all 29 photos
This recently renovated hotel comes highly recommended by travelers who choose to stay away from Cancun's commercialized Hotel Zone. The Terracaribe is located downtown, perfect for observing local Mexican life and enjoying a completely different Cancun experience. Complimentary transportation is offered to the beach club and Hotel Zone, where the beaches are breathtaking and there is plenty of shopping, dining, and entertainment options. Guests can choose to indulge in a romantic dinner in the room or dine on international dishes at Los Caracoles. Sip cocktails over conversation at Arrecifes Bar. The Terracibe perfectly suits the hip traveler, offering stylish accommodations in a great part of town, all with an affordable price tag.
Jungsik P.
reasonable hotel for traveling friendly clean It was nice. For a traveller, it might be great.
The room was clean. Everything was organized.
However, a bit far from central bus station in Cancun. (taking a taxi. took 10mins)
Also the connection of wifi was not good. Because of the weather, the room was a little bit humid. Antony S.
A great downtown hotel Price, staff and pool.
A nice clean hotel close to the R1 bus stop and a few local restaurants.
no complaints about this hotel. rooms are very basic but clean. staff is friendly. pool area is clean but basic. location is a little out of the way but buses are very convenient to get into downtown cancun.
clean, swimming pool, helpful staffs
I really liked this hotel. location is just a bit away from downtown but you can take a bus less than 1$ and I actually walked to the downtown. It takes about 20~25 mins walk from the bus station to hotel. They have a swimming pool. Staffs are very helpful and they clean everyday. 24 hrs hot shower, fan, A/C, TV and fridge in the room. I would definately come again. Thanks TANIESHA C.
nice boutique hotel with pool and jacuzzi. close to the downtown area. clean comfortable rooms but small. adequate facilities for a budget hotel. we stayed there 6 nights in total and used it as a base hotel for day trips. TANIESHA C.
Room facilities convenient location
nice boutique hotel. close to the downtown area. clean comfortable rooms but small. adequate facilities for a budget hotel. we stayed there 6 nights in total and used it as a base hotel for day trips. TANIESHA C.
Clean boutique hotel. We stayed 4 nights using it as a base hotel. Very accessible and excellent location. Great for city stay, 20 minutes walk to the pier for Isla del Mujer and downtown area. Hotel restaurant is also a good eat.
Rooms, access , staff
my friend and i stayed here 4 nights in total. we did many day trips from here. highly recommended. u can go to the beaches on the hotel zone in the daytime and when you get back to the hotel unwind in the pool or jacuzzi TANIESHA C.
Clean rooms anf good service
Clean rooms, friendly staff great accessibility. We stayed 5 nights in total and did several day trips to the beach on the hotel zone and other towns
Downtown Hotel Clean rooms ,friendly staff
Enjoyed my stay at the Terrracaribe. Rooms serviced every day. Free WiFi which was very good. On the edge of Downtown which was okay for me. Regular buses to beaches.

value: This website is a Singaporean online travel agency and metasearch engine for hotels, vacation rentals, flights, and airport transfer. It is owned by Agoda Company Pte.


text:
McGraw Hill - 9780078791406 - Alibris
Books Author: McGraw Hill ISBN: 9780078791406
ISBN: 0078791405 /
ISBN-13: 9780078791406
�Buen Viaje! Level 2, Student Edition (Glencoe Spanish) (English and Spanish Edition)
by Conrad J. Scmitt, Protase E. Woodford
9780078791406
by Protase E. Woodford; Conrad J. Scmitt
�Buen Viaje! Level 2, Student Edition (English and Spanish Edition)
by Woodford, Protase E.; Scmitt, Conrad J.
0078791405
13471059782
Fair. A few pages may be dog-eared. Acceptable: unmarked. Book is in good condition; cover shows signs of wear. Pages are unmarked by pen or highlighter. Book has vertical bend; No creasing. Edges show discoloration/markings but do not bleed into the page. Good: unmarked. Book is in great condition; cover shows minor signs of wear. Pages are unmarked by pen or highlighter. Pages include limited underlining/notes but most of text is unmarked by highlighter or pen. Pages may have discoloration.
13469171138
12831259399
Fair. MULTIPLE COPIES AVAILABLE! Glencoe: Buen Viaje! Level 2-Student Edition (Hardcover). Copyright-2008, ISBN: 0078791405. These books are in ACCEPTABLE condition with the interior pages fully intact, tape-repaired bindings, and VISIBLE wear to the exterior covers! We ship daily, Mon-Sat. Customer service is always our top priority! WE WILL NOT PROCESS INTERNATIONAL ORDERS! These orders will be cancelled automatically! Thank you! !
12962175369
13427296905
13459037008
13460447487
Fair. 0078791405 HARDCOVER. First 30/600 pages have up to 3 inches of rippling/discoloration along page edge due to liquid exposure. All pages are usable and readable. Light to moderate wear to cover/edges/corners. School markings and writing on/inside covers. Minimal markings/highlighting on/inside book, none of which detracts from content. Binding and cover solidly connected.
13289610644
Good. Sewn binding. Cloth over boards. Glencoe Spanish. Intended for a juvenile audience.
12938670797
13164456336
Starting at $2.67	Buen Viaje!: Level 3
Starting at $0.99	Buen Viaje! Level 2, Student Tape Manual
by McGraw-Hill Starting at $0.99	Buen Viaje! Level 1 Student Edition
Starting at $1.15	Glencoe Spanish 2 Buen Viaje! Workbook and Audio Activities

value: This website is is an online store that sells new books, used books, out-of-print books, rare books, and other media through an online network of independent booksellers.