WO2008090486A1 - Recalcule d'un quota de temps d'émission dans un réseau local sans fil pour une meilleure utilisation de la bande passante - Google Patents

Recalcule d'un quota de temps d'émission dans un réseau local sans fil pour une meilleure utilisation de la bande passante Download PDF

Info

Publication number
WO2008090486A1
WO2008090486A1 PCT/IB2008/050109 IB2008050109W WO2008090486A1 WO 2008090486 A1 WO2008090486 A1 WO 2008090486A1 IB 2008050109 W IB2008050109 W IB 2008050109W WO 2008090486 A1 WO2008090486 A1 WO 2008090486A1
Authority
WO
WIPO (PCT)
Prior art keywords
data
quota
service
stream
airtime
Prior art date
Application number
PCT/IB2008/050109
Other languages
English (en)
Inventor
Ruediger Schmitt
Richard Chen
Original Assignee
Koninklijke Philips Electronics N.V.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Koninklijke Philips Electronics N.V. filed Critical Koninklijke Philips Electronics N.V.
Priority to US12/522,947 priority Critical patent/US8345656B2/en
Priority to EP08702410A priority patent/EP2127258A1/fr
Priority to JP2009546034A priority patent/JP5123317B2/ja
Priority to CN2008800027810A priority patent/CN101589586B/zh
Publication of WO2008090486A1 publication Critical patent/WO2008090486A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/62—Queue scheduling characterised by scheduling criteria
    • H04L47/622—Queue service order
    • H04L47/6225—Fixed service order, e.g. Round Robin
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/52—Queue scheduling by attributing bandwidth to queues
    • H04L47/525—Queue scheduling by attributing bandwidth to queues by redistribution of residual bandwidth
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/52—Allocation or scheduling criteria for wireless resources based on load
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W8/00—Network data management
    • H04W8/02—Processing of mobility data, e.g. registration information at HLR [Home Location Register] or VLR [Visitor Location Register]; Transfer of mobility data, e.g. between HLR, VLR or external networks
    • H04W8/04—Registration at HLR or HSS [Home Subscriber Server]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/02—Hierarchically pre-organised networks, e.g. paging networks, cellular networks, WLAN [Wireless Local Area Network] or WLL [Wireless Local Loop]
    • H04W84/10—Small scale networks; Flat hierarchical networks
    • H04W84/12—WLAN [Wireless Local Area Networks]

Definitions

  • the invention relates to a system and method for delivery of data for multiple data services, e.g. multiple data streams.
  • the invention further relates to software for control of such a system or method.
  • WLANs wireless local area networks
  • QoS Quality of Service
  • the 802.1 Ie standard addresses these needs by providing a framework for centralized scheduling and admission control algorithms, please see, e.g., WO2005/011307 (Attorney docket US 030248).
  • the scheduling and admission control algorithms themselves are not standardized, but vendor dependent.
  • Special scheduling algorithms for WLANs have been developed, which take into account the characteristics of WLANs, such as time-varying channels, multiple transmission rates, location-dependent errors as a result of the mobility of the users of the WLAN, and interference from neighboring WLANs.
  • the Air Fair Scheduling algorithm and its related admission control algorithm prevent streams which experience increased number of retransmissions or reduction in physical transmission rate (PHY-rate), due to worsening link quality, from affecting the QoS of streams whose link quality has not changed.
  • PHY-rate physical transmission rate
  • For the Air Fair Scheduling algorithm please see, e.g., the discussion of time- fairness and of TF-WFQ (time fair - weighted fair queuing) in WO2005/125124 (PHUS040231) or "Cross-Layer Wireless Multimedia Transmission: Challenges, Principles and New Paradigms", M. van der Schaar and N. Sai Shankar, IEEE Wireless Communications, Vol.12(4), Aug.2005, pp 50-58.
  • For the related admission control algorithm please see, e.g., WO2005/011307.
  • the admission control algorithm executed in the admission control unit (ACU), decides whether or not the scheduler can accommodate a stream based on, among other things, the stream's traffic characteristics (mean data rate and peak data rate, burst size, average packets size), the minimum PHY-rate, the maximum delay bound and the available resources of the scheduler. More specifically the ACU calculates the airtime quota needed by a particular stream in order to satisfy its QoS requirements.
  • An airtime policing module as presented in WO2006/077522 (Attorney docket US050018), monitors and enforces the airtime allocated to outgoing streams of a station and thus completes the Air Fair Scheduling algorithm.
  • the airtime quota is policed at the granularity of a Service Interval (SI), such that the airtime used by a stream (referred to as an "admitted stream") during each SI does not exceed the allocated transmission opportunity (TXOP-SI).
  • SI Service Interval
  • TXOP-SI allocated transmission opportunity
  • WO2005/125124 relates to sharing a communications channel in wireless communications, and in particular to allocation of time to devices that communicate under a protocol such as 802. l ie.
  • the Time Fairness concept is utilized with an algorithm that specifies a way to distribute the time allocation in such a way that the delay requirements of all streams are not violated. Streams are prioritized based on highest ratio of, on the one hand, time remaining to be allocated to a stream in a service period and, on the other, the time remaining before the service period elapses.
  • US patent 6,973,315 relates to a method and system for sharing over-allocated bandwidth between different classes of service in a wireless network.
  • Traffic is transmitted for a first service class in excess of bandwidth allocated to the first service class, using unused bandwidth allocated to a second class.
  • traffic for a third service class is transmitted in unused bandwidth remaining in the second service class.
  • bandwidth is being used to refer to "baud” i.e., the rate at which symbols may be transmitted through the system, or to refer to the channel capacity, i.e., the rate at which bits may be transmitted through the system.
  • the system comprises first means, e.g., an admission control unit, for determining a respective first quota per service time interval for accommodating the data for each respective one of the multiple data services to comply with a respective quality of service requirement associated with the respective data service.
  • the system comprises a second means for determining for each respective data service a respective second quota per service time interval. The respective second quota is proportional to the respective first quota.
  • the respective second quota is proportional to the ratio between, on the one hand, a portion of the service time interval available for accommodating the data of the multiple data services and, on the other hand, the aggregate of the first quotas of the multiple data services.
  • the system also comprises third means, e.g., a scheduler, for scheduling the delivery of the data per service time interval for each respective data service under control of the respective second quota, if the ratio is larger than unity.
  • a recalculation of the originally allocated quotas in accordance with the invention provides the services with more liberal quotas without compromising the QoS requirements.
  • the system of the invention can be implemented in hardware, wherein the first, second and first means each comprise dedicated hardware modules, e.g., an admission control circuit and a scheduling circuit.
  • the system can be implemented in software, wherein the first, second and third means each comprise software modules for being processed on a data processing system.
  • the invention is especially relevant in case each respective one of the multiple data services comprises a respective data stream, owing to the real-time aspects of streaming and stringent QoS requirements.
  • the approach of the invention is in particular advantageous in a wireless data network operating under the 802. l ie standard.
  • a first one and second one of the multiple data services comprise a first data stream and a second data stream, respectively, and a third one of the multiple data services comprises a best-effort data delivery service.
  • the QoS of a best-effort service does not specify a guarantee or a reservation of resources. Allocation of airtime quota to best-effort data traffic does not need to take into account stringent requirements, if any.
  • the invention also relates to a method of delivering data for multiple data services.
  • the method comprises determining a respective first quota per service time interval for accommodating the data for each respective one of the multiple data services in order to comply with a respective quality of service, if required for the respective data service.
  • the method comprises determining for each respective data service a respective second quota per service time interval.
  • the respective second quota is proportional to the respective first quota.
  • the respective second quota is also proportional to the ratio between, on the one hand, a portion of the service time interval available for accommodating the data of the multiple data services and, on the other hand, the aggregate of the first quotas of the multiple data services.
  • the method further comprises scheduling the delivery of the data per service time interval for each respective data service under control of the respective second quota if the ratio is larger than unity.
  • Fig.l is a block diagram of a known airtime scheduling system
  • Fig.2 is a time diagram of allocated transmission opportunities
  • Fig.3 is a block diagram of an airtime scheduling system in the invention.
  • Fig.4 gives mathematical formulae illustrating the recalculating of the airtime quota.
  • FIG.l is a block diagram of a known airtime scheduling system 100 in a wireless network environment wherein multiple nodes share access to the communication medium (colloquially referred to as "air" in a "wireless” context) or communication channel.
  • System 100 comprises a running software application 102 at a particular node, an admission control unit (ACU) 104, a channel monitor 106 and a scheduler 108.
  • ACU admission control unit
  • TSPEC Traffic Specification
  • MAC Media Access Control
  • Others among the parameters depend on the requirements of application 102 or of the user. Still others among these parameters are strictly characteristic of the traffic stream itself.
  • the parameters of the first two categories can be readily determined.
  • the parameters of the last category must be determined from the actual content of the traffic stream, or else must either be estimated or set at a standard value based on at least one of the specific application and the type of the stream.
  • the concept "QoS" is well known in the art.
  • the QoS typically relates to the cumulative effect on user satisfaction of factors affecting the service, e.g., guaranteed delay, jitter, bandwidth, response time, interrupts, noise, cross-talk, loudness levels, frequency response, noticeable echos, etc.
  • the QoS typically comprises any suitable service level information that identifies parameters representing required limits or levels for the data connection.
  • ACU 104 uses an admission control algorithm to operate on the TSPEC parameters for computing a Transmission Opportunity (TXOP).
  • TXOP corresponds to the amount of network bandwidth to be allocated to the particular traffic stream from application 102.
  • the TXOP is passed on to scheduler 108.
  • ACU 104 decides whether or not scheduler 108 can accommodate a stream based on, among other things, the stream's traffic characteristics (mean data rate and peak data rate, burst size, average packets size), the minimum PHY-rate, the maximum delay bound and the available resources of scheduler 108. More specifically, ACU 104 calculates the airtime quota needed by a particular stream in order to satisfy its QoS requirements.
  • Channel monitor 106 is operative to monitor the data traffic in the communication channel so as to identify the data traffic's and channel's quality characteristics relevant to the operation of ACU 104.
  • the airtime quota is policed, here by scheduler 108, at the granularity of a Service Interval (SI), such that the airtime used by a stream during each SI does not exceed the allocated transmission opportunity (TXOP-SI).
  • Scheduler 108 performs the task of airtime quota policing and strictly enforces the TXOP-SI allocated for a particular stream.
  • Fig.2 considers the following transmission scenario, where two streams have been admitted, and shows the usage of the communication channel by Stream- 1 and Stream-2 admitted by ACU 104.
  • Stream- 1 and Stream-2 have respective airtime quotas TXOP-SIi and TXOP-SI 2 .
  • Stream- 1 and Stream-2 are policed by an airtime policing module (not shown) accommodated in scheduler 108 for monitoring and enforcing the airtime allocated to the streams.
  • Fig.2 shows quotas TXOP-SIi and TXOP-SI 2 as consecutive time intervals per SI. Note that Stream- 1 and Stream-2 could also be interleaved.
  • the TXOP-SIi and TXOP-SI 2 intervals are therefore merely meant to illustrate the principle of operation.
  • Stream- 1 and Stream-2 use exactly the airtime quota allocated to them, i.e. both streams are not prevented by scheduler 108 from sending all their data during SI-I .
  • the remaining time in SI-I can be used for other data services that have not been admitted via ACU 104 (the "non-admitted traffic").
  • this other data traffic could be accommodated in SI-I as a data delivery service based on best-effort.
  • a best-effort service relies on the resources when they become available, without guarantee or reservation of those resources.
  • the invention addresses a problem occurring in SI-2 as shown in Fig.2.
  • Stream-2 needs more airtime than the allocated TXOP-SI 2 , but is unable to send all of its data due to the strict airtime quota enforcement by scheduler 108. Since the network is not working at full capacity, i.e., since SI-I and SI-2 are not being fully used, Stream-2 would have been able to transmit all of its data during SI-2 without violating the airtime allocated to Stream- 1.
  • airtime scheduling system 100 strict enforcement of airtime quotas in an SI can lead to inefficient use of the communication channel and to service degradation for multimedia streams.
  • the inventors now propose to distribute the time in an SI between all admitted streams and (optionally) other data delivery services such as best-effort delivery, in proportion to the original airtime quotas calculated by ACU 104. This allows the streams to use more airtime in case not the entire SI has been allocated, i.e., in case the total of the originally allocated airtimes is less the length of the SI.
  • Fig.3 is a block diagram of an airtime scheduling system 300 in the invention.
  • System 300 comprises the functionalities discussed with respect to system 100 of Fig.1.
  • system 300 comprises an airtime quota redistributing module 302, interposed between ACU 104 and scheduler 108.
  • Redistributing module 302 scales the airtime quota determined by ACU 104 by a scaling factor that is representative of the ratio between a portion of the length of the SI that is available for accommodating the streams, and the total of the airtime quota originally calculated by ACU 104. If this ratio is larger than unity, then the scaling leads to a more liberal allocation of airtime per individual stream admitted.
  • the redistribution algorithm is executed whenever a new stream has been admitted by ACU 104 or an active stream has been de-admitted by ACU 104.
  • a usage scenario would be a video streaming session, wherein the media stream itself goes through the admission control process of ACU 104 and the out-of-band control information falls under the best-effort category.
  • the actual amount of airtime reserved for best-effort traffic can be arbitrary. Preferably, a certain amount of airtime is reserved for best-effort data traffic to prevent it from being starved.
  • Fig.4 gives mathematical formulae 402 and 404 that represent first and second scenarios for implementing the invention. Each scenario treats the best-effort data service in a different manner.
  • First scenario 402 treats the airtime quota allocation of best-effort data traffic, TXOP-SIbe, in the same manner as the airtime quota allocation of an admitted stream, TXOP- SI n , wherein the subscript "n" is used to identify the relevant one of multiple streams.
  • the new airtime quota for stream "n", TXOP-SI n is proportional to originally calculated airtime quota for admitted stream "n", TXOP-SI n , and to a factor that consist of the ratio between the length of the SI, on the one hand, and the sum of the originally calculated airtime quota of all admitted streams, TXOP-SI sum , plus the originally calculated airtime quota for best-effort traffic, TXOP-SIbe, on the other hand.
  • the new airtime quota for best-effort traffic, TXOP-SI be is proportional to originally calculated airtime quota for best-effort traffic, TXOP-SIbe, and to the same factor that signifies the ratio between what is available, on the one hand, and what is needed to comply with QoS, on the other.
  • Second scenario 404 treats the airtime quota for best-effort traffic, SIbe, as a constant.
  • the new airtime quota for stream "n", TXOP-SI n is proportional to originally calculated airtime quota for admitted stream "n", TXOP-SI n , and to a factor that is the ratio between, on the one hand, the portion of the SI available for the admitted streams after allocating the best-effort traffic and, on the other hand, the sum of the originally calculated airtime quota of all admitted streams, TXOP-SI sum , needed to comply with the QoS of each admitted stream.
  • First and second scenarios 402 and 404 are illustrated by following examples, wherein the length of an SI is 10 time units.
  • admitted Stream- 1 and Stream-2 whose original airtime quotas have been determined as 2 time units and 3 time units, respectively, in order to comply with their respective QoS requirements.
  • an original airtime quota of 1 time unit for best-effort data traffic is 6 time units, which is smaller than the 10 time units of the SI.
  • Stream- 1 is allocated a new airtime quota of 3.3 time units
  • Stream-2 is allocated a new airtime quota of 5 time units
  • best-effort traffic is allocated a new airtime quota of 1.6 time units. Accordingly, the two streaming services and the best-effort service can all be accommodated in the SI with more liberal airtime quota.
  • Stream- 1 is allocated a new airtime quota of 3.6 time units
  • Stream-2 is allocated a new airtime quota of 5.4 time units
  • best-effort traffic keeps its originally allocated airtime quota of 1 time unit.
  • the invention can be used in the applications with wireless transmitters, such as in the Streamium product line of Philips Electronics, home wireless gateways, home wireless routers, wireless media nodes, wireless entertainment hubs, wireless DVS blasters, wireless VoIP (voice over IP) devices, wireless monitors, etc.
  • wireless transmitters such as in the Streamium product line of Philips Electronics, home wireless gateways, home wireless routers, wireless media nodes, wireless entertainment hubs, wireless DVS blasters, wireless VoIP (voice over IP) devices, wireless monitors, etc.
  • the scheduled data delivery process can be executed on a general-purpose computer under control of software on a computer-readable medium, or by means of a dedicated processor, and may alternatively be embodied in hardware or firmware.
  • the invention can also be applied to wired data communication wherein multiple data services share the same communication channel or communication medium.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Databases & Information Systems (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Small-Scale Networks (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

Dans un canal de communication sans fil, le temps par intervalle de service est distribué entre de multiples services désignés. Les services de données se sont vus allouer des quotas de temps d'émission afin de satisfaire leurs exigences de qualité de service (QoS). Ces quotas de temps d'émission sont mis à l'échelle par un facteur qui est le rapport entre, d'une part, le temps disponible par intervalle de service pour insérer des données de ces services et, d'autre part, le total des quotas de temps d'émission. Ceci permet aux services d'utiliser plus de temps d'émission dans le cas où l'intervalle de service entier n'a pas été alloué.
PCT/IB2008/050109 2007-01-22 2008-01-14 Recalcule d'un quota de temps d'émission dans un réseau local sans fil pour une meilleure utilisation de la bande passante WO2008090486A1 (fr)

Priority Applications (4)

Application Number Priority Date Filing Date Title
US12/522,947 US8345656B2 (en) 2007-01-22 2008-01-14 Recalculating airtime quota in WLAN to use up bandwidth
EP08702410A EP2127258A1 (fr) 2007-01-22 2008-01-14 Recalcule d'un quota de temps d'émission dans un réseau local sans fil pour une meilleure utilisation de la bande passante
JP2009546034A JP5123317B2 (ja) 2007-01-22 2008-01-14 帯域幅を使い切るためのｗｌａｎにおけるエアタイム割り当ての再計算
CN2008800027810A CN101589586B (zh) 2007-01-22 2008-01-14 在wlan中重新计算带宽占用时间配额以用尽带宽

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US88592807P 2007-01-22 2007-01-22
US60/885,928 2007-01-22

Publications (1)

Publication Number Publication Date
WO2008090486A1 true WO2008090486A1 (fr) 2008-07-31

Family

ID=39530626

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/IB2008/050109 WO2008090486A1 (fr) 2007-01-22 2008-01-14 Recalcule d'un quota de temps d'émission dans un réseau local sans fil pour une meilleure utilisation de la bande passante

Country Status (6)

Country Link
US (1) US8345656B2 (fr)
EP (1) EP2127258A1 (fr)
JP (1) JP5123317B2 (fr)
CN (1) CN101589586B (fr)
TW (1) TWI502928B (fr)
WO (1) WO2008090486A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2013514037A (ja) * 2009-12-15 2013-04-22 インテル コーポレイション 無線装置、通信方法及び製品
KR20150049232A (ko) * 2013-10-29 2015-05-08 삼성전자주식회사 Wlan에서 액세스 포인트의 스케줄링 방법 및 장치

Families Citing this family (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9143916B2 (en) * 2011-10-19 2015-09-22 Hewlett-Packard Development Company, L.P. Hybrid wireless virtualization architecture
US9124547B2 (en) 2012-07-31 2015-09-01 Hewlett-Packard Development Company, L.P. System and method for enforcing uplink wireless medium usage in wireless networks
CN105009491B (zh) 2013-03-13 2018-04-10 赛莱诺通信（以色列）有限公司 用于无线局域网的通信时间感知调度
EP2785103A1 (fr) * 2013-03-28 2014-10-01 British Telecommunications public limited company Procédé et système de contrôle de trafic dans un réseau local sans fil
TWI551181B (zh) * 2015-04-13 2016-09-21 瑞昱半導體股份有限公司 一種提供頻帶使用時間公平性的方法及其無線基地台
US9432999B1 (en) * 2015-11-19 2016-08-30 Uwatec Sárl Optimization of airtime among Wi-Fi clients connected to an access point
CN107920028B (zh) * 2017-11-14 2020-06-16 东软集团股份有限公司 一种数据包发送方法、装置及设备
CN109152057A (zh) * 2018-08-14 2019-01-04 Oppo广东移动通信有限公司 时间片分配方法、装置及电子设备

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0901301A2 (fr) * 1997-09-05 1999-03-10 Nec Corporation Planification dynamique, basée sur le débit, pour réseaux ATM
EP0977405A1 (fr) * 1998-07-31 2000-02-02 Alcatel Méthode, planificateur, mémoire tampon intelligente, processeur et système de télécommunication pour la distribution de la bande passante disponible

Family Cites Families (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6973315B1 (en) * 2001-07-02 2005-12-06 Cisco Technology, Inc. Method and system for sharing over-allocated bandwidth between different classes of service in a wireless network
US7103350B2 (en) * 2001-11-16 2006-09-05 Nortel Networks Limited Scheduler with fairness control and quality of service support
JP2003273880A (ja) * 2002-03-14 2003-09-26 Nippon Telegr & Teleph Corp <Ntt> タイムスケジューリング方法および基地局
US8937928B2 (en) * 2002-08-23 2015-01-20 Koninklijke Philips N.V. Frequency hopping in 5GHz WLAN via dynamic frequency selection
WO2005011208A1 (fr) * 2003-07-24 2005-02-03 Koninklijke Philips Electronics, N.V. Procede et appareil pour assurer l'egalite du temps demission dans des systemes sans fil a vitesses de transmission physique multiples
WO2005011307A2 (fr) 2003-07-24 2005-02-03 Koninklijke Philips Electronics, N.V. Contrôle d’accès à un réseau sans fil sur la base d’une vitesse de transmission garantie
EP1652342B1 (fr) 2003-07-31 2008-05-14 Koninklijke Philips Electronics N.V. Procede, point d'acces et progiciel pour assurer l'egalite de bande passante et de temps d'emission dans des reseaux sans fil
US7460543B2 (en) * 2003-08-13 2008-12-02 Panasonic Corporation Method and system for scheduling traffic in a wireless network
WO2005022832A1 (fr) * 2003-09-03 2005-03-10 Koninklijke Philips Electronics, N.V. Allocation equitable du temps de transmission par un milieu de communication de la norme ieee 802.11e
WO2005125124A1 (fr) 2004-06-15 2005-12-29 Koninklijke Philips Electronics, N.V. Repartition par fraction de temps restant a affecter dans un intervalle de service restant
JP4130648B2 (ja) * 2004-10-19 2008-08-06 株式会社東芝 通信装置および通信方法
DE602006011274D1 (de) 2005-01-18 2010-02-04 Koninkl Philips Electronics Nv Verfahren und vorrichtung zum durchsetzen der sendezeitquote in wartungsintervallen in drahtlosen lokalen netzwerken

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0901301A2 (fr) * 1997-09-05 1999-03-10 Nec Corporation Planification dynamique, basée sur le débit, pour réseaux ATM
EP0977405A1 (fr) * 1998-07-31 2000-02-02 Alcatel Méthode, planificateur, mémoire tampon intelligente, processeur et système de télécommunication pour la distribution de la bande passante disponible

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2013514037A (ja) * 2009-12-15 2013-04-22 インテル コーポレイション 無線装置、通信方法及び製品
US8743711B2 (en) 2009-12-15 2014-06-03 Intel Corporation Techniques for managing heterogeneous traffic streams
KR20150049232A (ko) * 2013-10-29 2015-05-08 삼성전자주식회사 Wlan에서 액세스 포인트의 스케줄링 방법 및 장치
KR102152308B1 (ko) 2013-10-29 2020-10-26 삼성전자주식회사 Wlan에서 액세스 포인트의 스케줄링 방법 및 장치

Also Published As

Publication number Publication date
TWI502928B (zh) 2015-10-01
CN101589586B (zh) 2013-01-02
JP2010517353A (ja) 2010-05-20
JP5123317B2 (ja) 2013-01-23
TW200845660A (en) 2008-11-16
US20100111056A1 (en) 2010-05-06
US8345656B2 (en) 2013-01-01
CN101589586A (zh) 2009-11-25
EP2127258A1 (fr) 2009-12-02

Similar Documents

Publication Publication Date Title
US8345656B2 (en) Recalculating airtime quota in WLAN to use up bandwidth
US10219254B2 (en) Airtime-based packet scheduling for wireless networks
CN104769864B (zh) 多播到单播转换技术
Sayenko et al. Ensuring the QoS requirements in 802.16 scheduling
JP4540712B2 (ja) 強化されたサービス品質を有する無線通信用のダイナミック適合
US7796521B2 (en) Method and apparatus for policing bandwidth usage for a home network
WO2009074095A1 (fr) Procédé, système et appareil d&#39;ajustement de la qualité du service aux utilisateurs
Ramos et al. Dynamic adaptation policies to improve quality of service of real-time multimedia applications in IEEE 802.11 e WLAN networks
Bai et al. Robust QoS control for single carrier PMP mode IEEE 802.16 systems
US20040081095A1 (en) Policing mechanism for resource limited wireless MAC processors
Rao et al. Performance evaluation of congestion aware transmission opportunity scheduling scheme for 802.11 wireless LANs
KR100523996B1 (ko) 이동통신 시스템의 패킷 스케줄링 시스템 및 방법
Rath et al. Adaptive modulation-based TCP-aware uplink scheduling in IEEE 802.16 networks
Dosciatti et al. A new scheduler for IEEE 802.16 with delay bound guarantee
Taghipoor et al. Scheduling Algorithm and Bandwidth Allocation in WiMAX
Riza et al. Improving QoS in WLAN using dynamic weighted fair scheduling
Rath et al. On TCP-aware uplink scheduling in IEEE 802.16 networks
Papaioannou et al. A cross-layer scheduling scheme for multimedia services over power line networks
Ranasinghe et al. Fair Queueing Scheduler for
Pradishta et al. Dynamic QoS-based optimized video transmission in WiMAX networks
KR20100008910A (ko) 광대역 무선 통신 시스템에서 자원 할당 장치 및 방법
Daneshi Distributed reservation algorithms for video streaming over WiMedia UWB networks
Laias Performance Analysis and Enhancement of QoS Framework for Fixed WiMAX Networks. Design, analysis and evaluation of 802.16 Point-to-Multipoint (PMP) Quality of Service Framework based on uplink scheduler and call admission control analysis.
Pedrasa et al. An enhanced framing strategy for jitter management
Simsek et al. Improving the Performance of IEEE 802.11 e with an Advanced Scheduling Heuristic

Legal Events

Date Code Title Description
WWE Wipo information: entry into national phase

Ref document number: 200880002781.0

Country of ref document: CN

121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 08702410

Country of ref document: EP

Kind code of ref document: A1

REEP Request for entry into the european phase

Ref document number: 2008702410

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 2008702410

Country of ref document: EP

ENP Entry into the national phase

Ref document number: 2009546034

Country of ref document: JP

Kind code of ref document: A

WWE Wipo information: entry into national phase

Ref document number: 12522947

Country of ref document: US

NENP Non-entry into the national phase

Ref country code: DE

WWE Wipo information: entry into national phase

Ref document number: 4732/CHENP/2009

Country of ref document: IN