WO1999000941A1 - Systeme, dispositif et procede permettant de raccourcir le temps d'acces pour des applications a duree de vie critique dans un reseau a support de transmission partage - Google Patents

Systeme, dispositif et procede permettant de raccourcir le temps d'acces pour des applications a duree de vie critique dans un reseau a support de transmission partage Download PDF

Info

Publication number
WO1999000941A1
WO1999000941A1 PCT/US1998/009715 US9809715W WO9900941A1 WO 1999000941 A1 WO1999000941 A1 WO 1999000941A1 US 9809715 W US9809715 W US 9809715W WO 9900941 A1 WO9900941 A1 WO 9900941A1
Authority
WO
WIPO (PCT)
Prior art keywords
mac
priority
low
polling
users
Prior art date
Application number
PCT/US1998/009715
Other languages
English (en)
Inventor
Krishnan Ramakrishnan
Michael W. Patrick
Original Assignee
Motorola Inc.
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 Motorola Inc. filed Critical Motorola Inc.
Priority to CA002292479A priority Critical patent/CA2292479A1/fr
Priority to AU74831/98A priority patent/AU720470B2/en
Priority to EP98922235A priority patent/EP0990331A1/fr
Priority to JP50553099A priority patent/JP2002506593A/ja
Priority to BR9810343-1A priority patent/BR9810343A/pt
Publication of WO1999000941A1 publication Critical patent/WO1999000941A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/40—Bus networks
    • H04L12/403—Bus networks with centralised control, e.g. polling
    • H04L12/4035—Bus networks with centralised control, e.g. polling in which slots of a TDMA packet structure are assigned based on a contention resolution carried out at a master unit
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/40—Bus networks
    • H04L12/403—Bus networks with centralised control, e.g. polling
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/40—Bus networks
    • H04L12/40143—Bus networks involving priority mechanisms
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/64—Hybrid switching systems
    • H04L12/6418—Hybrid transport
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/64—Hybrid switching systems
    • H04L12/6418—Hybrid transport
    • H04L2012/6421—Medium of transmission, e.g. fibre, cable, radio, satellite
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/64—Hybrid switching systems
    • H04L12/6418—Hybrid transport
    • H04L2012/6424—Access arrangements
    • H04L2012/6427—Subscriber Access Module; Concentrator; Group equipment
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/64—Hybrid switching systems
    • H04L12/6418—Hybrid transport
    • H04L2012/6445—Admission control
    • H04L2012/6448—Medium Access Control [MAC]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/64—Hybrid switching systems
    • H04L12/6418—Hybrid transport
    • H04L2012/6464—Priority

Definitions

  • the invention relates generally to communication systems and, more particularly, to multiple access protocols for use over a shared communications medium
  • a shared medium network is one in which a single communications channel (the shared channel) is shared by a number of end users such that uncoordinated transmissions from different end users may interfere with each other.
  • the shared communications channel is typically one of a number of frequency bands carried over a shared physical medium, such as a hybrid fiber-optic/coaxial cable (HFC) network or by electromagnetic waves in free space.
  • HFC hybrid fiber-optic/coaxial cable
  • communications networks typically have a limited number of communications channels
  • the shared medium network allows many end users to gain access to the network over a single communications channel, thereby allowing the remaining communications channels to be used for other purposes.
  • the shared medium network is only feasible when each end user only transmits data intermittently, allowing other end users to transmit during periods of silence.
  • each end user interfaces to the shared channel by means of an Access Interface Unit (AlU) which allows the end user to transmit and receive information via the shared channel.
  • AlU Access Interface Unit
  • a single AlU may support one or a number of end users.
  • Each end user wishing to utilize the shared channel participates in a Medium Access Control (MAC) protocol which provides a set of rules and procedures for accessing the shared channel.
  • MAC Medium Access Control
  • FIG. 1 is a logical representation of a shared medium network 100 as is known in the art.
  • a headend unit 1 10 is coupled to a plurality of AIUs 120 a through 120 n (collectively referred to as AIUs 120) via a shared channel 130.
  • the shared channel 130 is one of a number of communications channels carried by a shared physical medium such as an HFC or wireless network.
  • the shared physical medium may be coaxial cable, fiber-optic cable, twisted pair wires, and so on, and may also include air, atmosphere, or space for wireless and satellite communication.
  • the headend unit 1 10 is also coupled to a communications network 140, which may include networks such as the Internet, on-line services, telephone and cable networks, and other communication systems.
  • the shared physical medium such as an HFC or wireless network
  • the shared physical medium has or supports a plurality of communications channels.
  • the communications channels in which a headend unit, such as the headend unit 1 10, transmits information, signals, or other data to an AlU, such as AlU 120 n are referred to as downstream channels.
  • the communications channels in which an AlU, such as AlU 120 n , transmits information, signals, or other data to a headend unit, such as headend unit 1 10 are referred to as upstream channels.
  • the communications medium is an HFC network, with downstream channels in the frequency spectrum (band) typically 50 - 750 MHz (and up to 1 GHz), and with upstream channels in the frequency spectrum typically 5 - 42 MHz.
  • the headend unit uses a single downstream channel to send information, including poll messages, to the MAC Users, and a single upstream channel is used by the MAC Users to send information to the headend unit. Since the headend unit is the only device which transmits on the downstream channel, the downstream channel is not a "shared channel" as that term is applied to the present invention. However, since multiple MAC Users transmit on the upstream channel, the upstream channel is a shared channel, and the MAC protocol must provide for orderly access to the channel so as to maximize the data throughput over the channel.
  • contention-free protocols such as time-division multiple access (TDMA) and round-robin polling protocols
  • TDMA time-division multiple access
  • round-robin polling protocols are typically less efficient than contention-based protocols under light loads because the contention-free protocols generally allocate some amount of bandwidth to each MAC User whether or not the MAC User has information to send.
  • contention-based protocols only allocate bandwidth to those MAC Users that have information to send, although some amount of bandwidth is wasted whenever collision resolution is required.
  • Hybrid protocols utilizing both contention-free and contention-based access, have been developed in an attempt to gain the advantages of both techniques. In many multiple access protocols, some form of round-robin polling is used.
  • each MAC User is provided equal access to the shared channel whether the MAC User is "active" (i.e., is actively generating data) or "inactive" (i.e., infrequency has data to transmit).
  • Some round-robin polling protocols attempt to improve the effectiveness and efficiency of polling by segregating the MAC Users into multiple lists according to the frequency with which the MAC User has data to transmit.
  • the "active" MAC Users are typically placed on a "fast poll” list, and are polled at a relatively high frequency, while the "inactive” MAC Users are typically placed on a “slow poll” list, and are poll at a relatively low frequency.
  • An alternative approach maintains a list of "recently active" MAC Users (i.e., MAC Users that are currently "inactive" but had recently been “active") which are polled less frequently than the MAC Users on the fast poll list but more frequently than the MAC Users on the slow poll list.
  • MAC User having high-priority, time-sensitive data is polled in the same manner, and at the same frequency, as an "active" user having low-priority, time-insensitive data. In that case, the data from the high-priority MAC User may be delayed while data from low-priority MAC Users is being transmitted.
  • segregating MAC Users according to data availability alone does not adequately address the issue of prioritizing MAC User transmissions.
  • a knowledge of the MAC User priority a priori would allow the polling sequence to account for MAC User priority.
  • the MAC User priority is typically not known at the time the MAC User enters the system, and may change over time as the MAC User accesses various services over the network. Therefore, a need remains for a system, device, and method for providing low access delay for time-sensitive applications in a shared medium network.
  • FIG. 1 is a block diagram of a shared medium network as is known in the art
  • FIG. 2 is a logic flow diagram for processing an upstream burst transmission
  • FIG. 3 is a logic flow diagram for a polling cycle.
  • the present invention provides such low access delay by having the headend unit segregate MAC Users into a high-priority group and a low-priority group.
  • the headend unit first polls all of the high-priority MAC Users, and then polls low-priority MAC Users until either all low-priority MAC Users have been polled or the low-priority MAC Users have been serviced for a predetermined maximum polling time.
  • the headend unit repeats this polling sequence in sequential polling cycles to provide the high-priority MAC Users with expedited access to the shared channel.
  • the headend unit In order for the headend unit to segregate the MAC Users into the high- priority group and the low-priority group, the headend unit must be able to determine the relative priority of each MAC User.
  • the MAC User priorities may be known a priori, for example, through configuration by a network administrator or by service class designations in an ATM or other network.
  • the MAC User priorities may not be known a priori, and, in fact, may change over time as the end users access different applications over the network.
  • the headend unit In networks where the MAC User priorities are not explicitly known, the headend unit must determine the MAC User priorities by other means.
  • the MAC User priority is not known a priori and is instead inferred from the characteristics of the upstream transmissions generated by the MAC User.
  • the headend unit monitors the MAC User transmissions and determines the delay requirements of the MAC User according to a predetermined set of parameters such as the burst/packet sizes transmitted by the MAC User, the packet types included in the MAC User transmissions, the applications accessed by the MAC User, and any of a number of other parameters that will be apparent to the skilled artisan.
  • the headend unit may use one or more parameters to determine the relative priority of the MAC User, and may use a different set of parameters for each MAC User.
  • the MAC User priority is inferred solely from the size of the data packets transmitted by the MAC User. It has been observed that time-sensitive, low-latency applications typically generate small data packets while time-insensitive applications typically generate larger data packets. For example, in a typical shared medium network carrying TCP/IP traffic, much of the upstream traffic for a TCP/IP application will be TCP acknowledgement packets which are transmitted over the upstream channel to allow TCP/IP traffic to continue flowing over the downstream channel. Web surfing and gaming applications will likewise typically generate small data packets in the upstream direction. These small data packets transmitted over the upstream channel are time-sensitive, since a delay in their delivery may result in noticeably unacceptable performance of the application.
  • Upstream file transfers will typically be characterized by large data packets transmitted over the upstream channel. These large data packets transmitted over the upstream channel are considered time- insensitive, since a delay in their delivery will typically go unnoticed. While it is not universally true that time-sensitive applications transmit small packets over the upstream channel and that time-insensitive applications transmit large packets over the upstream channel, the size of the packets is used by the headend unit to make an assumption as to the delay requirements of the application and therefore to categorize the MAC Users as either high-priority or low-priority.
  • the preferred embodiment utilizes an exponential weighted average of the received burst size for each MAC User.
  • the headend unit calculates the exponential weighted average for each MAC User as bursts are received over the upstream channel.
  • MAC Users having an average packet size below a predetermined threshold packet size are placed in the high-priority group, while the remaining MAC Users are placed in the low-priority group.
  • the headend unit Each time an upstream burst transmission is received from a MAC User, the headend unit updates the average packet size calculation for the MAC User and re-categorizes the MAC User into either the high-priority group or the low-priority group.
  • a logic flow diagram for processing an upstream burst transmission is shown in FIG. 2. The logic begins in step 210, and upon receiving a burst transmission from the MAC User in step 220, the logic updates the average packet size for the MAC User, in step 230. The logic then determines whether the average packet size is below the predetermined threshold packet size, in step 240.
  • the logic categorizes the MAC User in the high-priority group, in step 250; otherwise, the logic categorizes the MAC User in the low-priority group, in step 260.
  • the logic terminates in step 299. Because the categorization of a MAC User represents an assumption as to the delay requirements of the MAC User, the values selected for the predetermined weighting factor ⁇ and the predetermined threshold packet size affect whether or not a valid categorization is made.
  • the selection of the predetermined weighting factor ⁇ is a policy-based determination as to the weight placed on the most recently received burst relative to the historical average calculated over prior bursts.
  • the predetermined weighting factor ⁇ is selected to be 0.5, which places equal weight on the most recently received burst and the historical average.
  • the selection of the predetermined threshold packet size is based on observed traffic characteristics. In the preferred embodiment, the predetermined threshold packet size is selected to be 200 bytes.
  • a logic flow diagram for a polling cycle is shown in FIG. 3.
  • the logic for each polling cycle begins in step 310 and proceeds to poll the next high-priority MAC User in the high-priority round-robin polling list, in step 320.
  • the logic proceeds to step 330 where it determines if all of the high-priority MAC Users have been polled during the polling cycle. If all of the high-priority MAC Users have not been polled during the polling cycle (NO in step 330), then the logic recycles to step 320 to poll the next high-priority MAC User.
  • step 330 the logic proceeds to step 340 where it polls the next low-priority MAC User in the low-priority round-robin polling list.
  • step 340 the logic determines if all of the low-priority MAC Users have been polled during the polling cycle, in step 350. If all of the low- priority MAC Users have been polled during the polling cycle (YES in step 350), then the logic recycles to step 310 to begin a new polling cycle.
  • step 360 determines whether the low-priority MAC Users have been serviced for a predetermined maximum polling time. If the low- priority MAC Users have not been serviced for the predetermined maximum polling time (NO in step 360), then the logic recycles to step 340 to poll the next low-priority MAC User. However, if the predetermined maximum polling time has been reached (YES in step 360), then the logic recycles to step 310 to begin a new polling cycle.
  • step 360 polling of the low-priority MAC Users in step 340 during the next polling cycle begins with the next low-priority MAC User in the list following the last low-priority MAC User polled.
  • the low-priority MAC Users may be round-robin polled over a number of polling cycles.

Landscapes

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

Abstract

L'invention concerne un système, un dispositif et un procédé qui permettent de raccourcir le temps d'accès pour des applications à durée de vie critique dans un réseau à support de transmission partagé. Selon le procédé, les utilisateurs d'une commande d'accès au support sont divisés en un groupe à priorité élevée et un groupe à priorité basse. Quand les priorités des utilisateurs ne sont pas connues a priori, elles sont inférées à partir de la taille des paquets de données transmis par lesdits utilisateurs. Les utilisateurs qui transmettent de petits paquets sont placés dans le groupe à priorité élevée, tandis que ceux qui transmettent de gros paquets sont placés dans le groupe à basse priorité. L'unité tête de ligne commence par appeler sélectivement les utilisateurs à priorité élevée, puis elle appelle les utilisateurs à basse priorité, jusqu'à ce que tous les utilisateurs à basse priorité aient été appelés ou jusqu'à ce qu'ils aient été servis pendant un temps d'appel maximum prédéterminé. Elle répète cette séquence d'appel sélectif de manière cyclique, de façon à assurer aux utilisateurs à priorité élevée un accès accéléré au canal partagé.
PCT/US1998/009715 1997-06-27 1998-05-13 Systeme, dispositif et procede permettant de raccourcir le temps d'acces pour des applications a duree de vie critique dans un reseau a support de transmission partage WO1999000941A1 (fr)

Priority Applications (5)

Application Number Priority Date Filing Date Title
CA002292479A CA2292479A1 (fr) 1997-06-27 1998-05-13 Systeme, dispositif et procede permettant de raccourcir le temps d'acces pour des applications a duree de vie critique dans un reseau a support de transmission partage
AU74831/98A AU720470B2 (en) 1997-06-27 1998-05-13 System, device, and method for providing low access delay for time-sensitive applications in a shared medium network
EP98922235A EP0990331A1 (fr) 1997-06-27 1998-05-13 Systeme, dispositif et procede permettant de raccourcir le temps d'acces pour des applications a duree de vie critique dans un reseau a support de transmission partage
JP50553099A JP2002506593A (ja) 1997-06-27 1998-05-13 複数のｍａｃユーザを高優先度グループおよび低優先度グループに分ける方法、装置およびシステム
BR9810343-1A BR9810343A (pt) 1997-06-27 1998-05-13 Sistema, dispositivo e método para propiciar baixo retardo de acesso para aplicações sensiveis ao tempo em uma rede de meio partilhado

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US88452797A 1997-06-27 1997-06-27
US08/884,527 1997-06-27

Publications (1)

Publication Number Publication Date
WO1999000941A1 true WO1999000941A1 (fr) 1999-01-07

Family

ID=25384828

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US1998/009715 WO1999000941A1 (fr) 1997-06-27 1998-05-13 Systeme, dispositif et procede permettant de raccourcir le temps d'acces pour des applications a duree de vie critique dans un reseau a support de transmission partage

Country Status (8)

Country Link
EP (1) EP0990331A1 (fr)
JP (1) JP2002506593A (fr)
KR (1) KR20010014200A (fr)
CN (1) CN1262008A (fr)
AU (1) AU720470B2 (fr)
BR (1) BR9810343A (fr)
CA (1) CA2292479A1 (fr)
WO (1) WO1999000941A1 (fr)

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1221790A2 (fr) * 2001-01-05 2002-07-10 Samsung Electronics Co., Ltd. Equipement de communication sans fil, système de communication sans fil pour son utilisation et méthode de communication associée
KR100442346B1 (ko) * 2001-11-19 2004-07-30 엘지전자 주식회사 Ｉｅｅｅ802.11 ｍａｃ 계층에서 폴링 리스트 운용방법
KR100461539B1 (ko) * 2002-11-26 2004-12-17 한국전자통신연구원 이동통신 시스템에서 누적 카운터 값을 기준으로 하는패킷 스케줄링 방법
CN1302637C (zh) * 2003-01-28 2007-02-28 华为技术有限公司 一种多生成树协议桥优先级协调方法
KR100846767B1 (ko) * 2002-01-29 2008-07-16 삼성전자주식회사 네트워크 기기간의 충돌 방지 방법 및 장치
EP2936764A4 (fr) * 2012-12-18 2016-04-27 Ericsson Telefon Ab L M Procédé et appareil de gestion d'adresses de commande d'accès au support
US20220141789A1 (en) * 2018-09-28 2022-05-05 Qualcomm Incorporated Delivery time windows for low latency communications

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7085256B2 (en) * 2003-07-31 2006-08-01 Motorola, Inc. System and method for adaptive polling in a WLAN
US7885245B2 (en) * 2004-07-19 2011-02-08 Interdigital Technology Corporation Method and apparatus for enhanced uplink multiplexing
CN100401708C (zh) * 2004-12-17 2008-07-09 中兴通讯股份有限公司 基于自适应服务质量保证的无线局域网分群轮询方法
CN100401709C (zh) * 2004-12-17 2008-07-09 中兴通讯股份有限公司 基于固定服务质量保证策略的无线局域网分群轮询方法
US7969878B2 (en) * 2006-04-28 2011-06-28 Siemens Enterprise Communications Gmbh & Co. Kg Quality guarantee for real-time applications over shared networks
CN102291836B (zh) * 2010-06-21 2016-01-20 中兴通讯股份有限公司 一种随机接入控制方法及***
CN103248675A (zh) * 2013-04-23 2013-08-14 浪潮电子信息产业股份有限公司 一种用于监控服务器硬件状态的轮询方法

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5185737A (en) * 1989-03-23 1993-02-09 International Business Machines Corporation Method and apparatus for cyclic reservation multiple access in a communications system
US5572517A (en) * 1995-02-28 1996-11-05 General Instrument Corporation Configurable hybrid medium access control for cable metropolitan area networks

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5185737A (en) * 1989-03-23 1993-02-09 International Business Machines Corporation Method and apparatus for cyclic reservation multiple access in a communications system
US5572517A (en) * 1995-02-28 1996-11-05 General Instrument Corporation Configurable hybrid medium access control for cable metropolitan area networks

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1221790A2 (fr) * 2001-01-05 2002-07-10 Samsung Electronics Co., Ltd. Equipement de communication sans fil, système de communication sans fil pour son utilisation et méthode de communication associée
EP1221790A3 (fr) * 2001-01-05 2003-08-20 Samsung Electronics Co., Ltd. Equipement de communication sans fil, système de communication sans fil pour son utilisation et méthode de communication associée
US7412251B2 (en) 2001-01-05 2008-08-12 Samsung Electronics Co., Ltd. Wireless communication apparatus, wireless communication system adopting the same and communication method thereof
KR100442346B1 (ko) * 2001-11-19 2004-07-30 엘지전자 주식회사 Ｉｅｅｅ802.11 ｍａｃ 계층에서 폴링 리스트 운용방법
KR100846767B1 (ko) * 2002-01-29 2008-07-16 삼성전자주식회사 네트워크 기기간의 충돌 방지 방법 및 장치
KR100461539B1 (ko) * 2002-11-26 2004-12-17 한국전자통신연구원 이동통신 시스템에서 누적 카운터 값을 기준으로 하는패킷 스케줄링 방법
CN1302637C (zh) * 2003-01-28 2007-02-28 华为技术有限公司 一种多生成树协议桥优先级协调方法
EP2936764A4 (fr) * 2012-12-18 2016-04-27 Ericsson Telefon Ab L M Procédé et appareil de gestion d'adresses de commande d'accès au support
US9942163B2 (en) 2012-12-18 2018-04-10 Telefonaktiebolaget Lm Ericsson (Publ) Method and apparatus for managing media access control addresses
US20220141789A1 (en) * 2018-09-28 2022-05-05 Qualcomm Incorporated Delivery time windows for low latency communications

Also Published As

Publication number Publication date
CN1262008A (zh) 2000-08-02
AU7483198A (en) 1999-01-19
JP2002506593A (ja) 2002-02-26
KR20010014200A (ko) 2001-02-26
EP0990331A1 (fr) 2000-04-05
AU720470B2 (en) 2000-06-01
BR9810343A (pt) 2000-09-05
CA2292479A1 (fr) 1999-01-07

Similar Documents

Publication Publication Date Title
US5615212A (en) Method, device and router for providing a contention-based reservation mechanism within a mini-slotted dynamic entry polling slot supporting multiple service classes
US5960000A (en) System, device, and method for contention-based reservation in a shared medium network
WO1998054858A1 (fr) Systeme, dispositif et technique de partage de mini-creneaux temporels entre plusieurs classes de priorite
US6275497B1 (en) Method and apparatus for controlling communication channels using contention and polling schemes
AU720470B2 (en) System, device, and method for providing low access delay for time-sensitive applications in a shared medium network
US6114968A (en) Hybrid contention/polling access method
US20020052956A1 (en) Method for allocating resources
US20040196850A1 (en) WLAN access scheduling control
WO2006050664A1 (fr) Systeme et procede permettant de controler l'acces a un support sans fil
WO2002041590A1 (fr) Commande d'acces au support pour systemes sans fil
US5909444A (en) System, device, and method for aggregating users in a shared-medium network
AU743272B2 (en) Offered load estimation and applications for using same in a communication network
CN110958717A (zh) 中心化无线局域网无竞争随机介质访问控制方法及***
WO2003077487A1 (fr) Utilisation d'une voie de communication partagee pour des applications presentant des exigences de classes de service differentes
US7151743B2 (en) Method of transmitting a data packet
Mico et al. QoS in IEEE 802.11 wireless LAN: current research activities
Micó et al. QoS mechanisms for IEEE 802.11 wireless LANs
Lin et al. Adaptive bandwidth sharing mechanism for quality of service administration in infrastructure wireless networks
CN116887363A (zh) 一种适用于分布式固定tdma协议的数据聚合方法
CA2268794A1 (fr) Systeme, dispositif et procede d'ordonnancement d'un trafic a debit binaire variable, dans un reseau de communication
Gaur Effective Channel Utilization in 802. 11 WLANs
Morishita et al. Prioritized ACK transfer mechanisms for PLC media control access
EP0963639A1 (fr) Procede de partage de canaux de communication utilisant des schemas de contention et d'interrogation

Legal Events

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

Ref document number: 98806655.6

Country of ref document: CN

AK Designated states

Kind code of ref document: A1

Designated state(s): AL AM AT AU AZ BA BB BG BR BY CA CH CN CU CZ DE DK EE ES FI GB GE GH GW HU ID IL IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MD MG MK MN MW MX NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT UA UG UZ VN YU ZW

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): GH GM KE LS MW SD SZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE BF BJ CF CG CI CM GA GN ML MR NE SN TD TG

DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
121 Ep: the epo has been informed by wipo that ep was designated in this application
WWE Wipo information: entry into national phase

Ref document number: 74831/98

Country of ref document: AU

ENP Entry into the national phase

Ref document number: 2292479

Country of ref document: CA

Ref document number: 2292479

Country of ref document: CA

Kind code of ref document: A

WWE Wipo information: entry into national phase

Ref document number: 1998922235

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 1019997012278

Country of ref document: KR

WWP Wipo information: published in national office

Ref document number: 1998922235

Country of ref document: EP

REG Reference to national code

Ref country code: DE

Ref legal event code: 8642

WWG Wipo information: grant in national office

Ref document number: 74831/98

Country of ref document: AU

WWP Wipo information: published in national office

Ref document number: 1019997012278

Country of ref document: KR

WWR Wipo information: refused in national office

Ref document number: 1019997012278

Country of ref document: KR

WWW Wipo information: withdrawn in national office

Ref document number: 1998922235

Country of ref document: EP