WO1997010655A1 - Dispositif, appareil d'acheminement, procede et systeme de fourniture d'un protocole hybride d'acces multiples pour des utilisateurs a priorites multiples - Google Patents

Dispositif, appareil d'acheminement, procede et systeme de fourniture d'un protocole hybride d'acces multiples pour des utilisateurs a priorites multiples Download PDF

Info

Publication number
WO1997010655A1
WO1997010655A1 PCT/US1996/013601 US9613601W WO9710655A1 WO 1997010655 A1 WO1997010655 A1 WO 1997010655A1 US 9613601 W US9613601 W US 9613601W WO 9710655 A1 WO9710655 A1 WO 9710655A1
Authority
WO
WIPO (PCT)
Prior art keywords
users
contention
information
feedback
providing
Prior art date
Application number
PCT/US1996/013601
Other languages
English (en)
Inventor
Chester A. Ruszczyk
Levent Gun
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 EP96928999A priority Critical patent/EP0850518A4/fr
Priority to AU68563/96A priority patent/AU6856396A/en
Publication of WO1997010655A1 publication Critical patent/WO1997010655A1/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
    • 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/2801—Broadband local area networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks

Definitions

  • the user then transitions to the contention state 512 and, based on the multiple access protocol being used, attempts to transmit the information. Many schemes may be used here, with or without collision resolution. Upon successful transmission, the user returns to the idle state. A modification of this scheme incorporates reservations, 516. Then from contention, 518, a user can enter the active state, 520, by successfully transmitting in a slot if the user has more information to transmit in its queue, and when using a modulo counter, transmits in the same slot at all times until all information is transmitted.
  • This approach is commonly used in a slotted system, where fixed size packet lengths exist, and a frame structure is used, meaning that X slots make a frame and after X slots the frame begins again, where X is a positive integer.
  • FIG. 3 shows an example of one embodiment of steps of the method utilized by stations in accordance with the present invention .
  • FIG. 4 is a diagrammatic representation showing how the prior art defines transmission.
  • FIG. 5 shows a user state diagram as is known in the art.
  • FIG. 6 illustrates prior art topolgies
  • FIG. 7 shows an example of one embodiment of the system topology and architecture in accordance with the present invention.
  • FIG. 9 illustrates one embodiment of the types of information the downstream channel carries in accordance with the present invention.
  • FIG. 10 shows a flow chart of one embodiment of the method utilized by the adaptive reservation manager in accordance with the present invention.
  • FIG. 12 shows a schematic representation of one embodiment of a control packet that may be used in accordance with the present invention. Detailed Description of a Preferred Embodiment
  • the present invention provides the following benefits over existing solutions: 1 )support of multiple service categories; 2) insurance that each user admitted to the system receives the negotiated service guarantee designated for the user's service category; 3) by allowing the central controller to dynamically vary the frequency and number of contention subslots on a per service category basis, the present invention achieves an overall system performance that is comparable to centralized algorithms at high system loads, while allowing desirable performance levels of distributed access protocols at low system loads, 4) further system level efficiency is achieved by allowing transmission of variable number of packets, each with variable size, when access is granted to a user; and 5) reduction of the number of instances a user needs to content for access, thereby reducing collisions and overhead due to contention slots and improving system performance.
  • a hybrid solution is one which incorporates decision- making capabilities located at both the central node and users.
  • the hybrid solution was introduced since, in stand-alone operations, centralized approaches, such as traditional TDMA, large delays occur at low utilization in comparison with distributed random access techniques which have very little delay at low utilization. At high utilization, in terms of average delay and throughput, the TDMA performance exceeds that of random access.
  • the central node communicates broadcast control information, and the users respond by either using a distributed approach or respond only when the central control addresses a specific station, depending on the control packet contents. In both cases, generally the centralized approach initiates occurrence of the distributed actions based on an address identified or lack thereof.
  • a hybrid approach for all priority classes on the broadcast medium is based on a single class of users and is unable to accommodate a multiplicity of classes of users efficiently.
  • the contention is based on a single class and is available in all unassigned slots, including slots without reservations, the hybrid approach further includes the use of a random access (slotted aloha) type of contention, and once a reservation has been made, the user is polled in a periodic fashion.
  • the present invention includes a system for implementing a hybrid multiple access protocol for users with multiple priorities that provides efficient reservation of channel resources to accommodate users with randomly transmitted requests wherein the users have multiple priorities.
  • the system typically includes a central controller device having: A) an adaptive reservation manager, coupled to a scheduler, for, upon receiving randomly transmitted requests from users, accepting reservations from the users, resolving contentions that arise, and providing contention feedback information to a feedback generator; B) the feedback generator coupled to the adaptive reservation manager and to the scheduler, for providing a transmission schedule and information to the users on a current state of contention; and
  • the scheduler coupled to the adaptive reservation manager, for providing global system information to the reservation manager and for providing a transmission schedule for both the feedback generator and the users .
  • the contention feedback information may be selected to be a ternary feedback indicating one of: an idle, a success, and a collision.
  • the scheduler includes a process that is embodied in a computer program implemented by a microprocessor having the steps of: A) mapping randomly transmitted requests from users and current states of users to a global system state; B) determining the transmission schedule for both the feedback generator and the users based on randomly transmitted requests from users and current states of users.
  • the hybrid approach of the present invention utilizes a hybrid multiple access protocol in which a combination of centralized and distributed access protocols are executed.
  • the distributed approach allows users to contend for reservations wherein a preselected centralized MAC algorithm based on service requested and system resources available guarantees that a minimum service requirement is met, for example, an upper bound may be guaranteed on end to end delay for isochronous traffic, and a low error rate may be set for asynchronous traffic.
  • the centralized approach determines which users may have access to the broadcast medium based on the priority class of the user, and when users that are inactive in the centralized approach will be allowed to contend for admission.
  • FIG. 7, numeral 700 illustrates the environment of the proposed method.
  • the stations, 704 may consist of multiple users, 706, 708, 710, that may be grouped into priority classes based on the service that is negotiated during initialization, wherein the users are waiting to gain access to the upstream channel, 712.
  • Each user/priority class may, for example, be classified into one of three states as shown in FIG. 5, numeral 500. These states are: 1 ) idle, 517, which corresponds to a priority class having no information to be transmitted; 2) contention, 518, which corresponds to the user contending, via a distributed MAC algorithm, for entrance into the central controllers MAC protocol; and 3) active, 520, which refers to active stations in the centralized MAC protocol located within the central controller, 502.
  • the upstream channel, 712, used by stations to communicate to the central node, is defined by the central controller.
  • the upstream channel consists of variable length slots of at least a preselected minimum size, but smaller than a predetermined finite maximum length.
  • the slots are typically further separated into one of two types: contention or dedicated, FIG. 8, numeral 800, which are determined by the central controller.
  • the users in the contention state, 518 contend only for subslots assigned with the same priority.
  • the priority of the subslots is determined by the central controller.
  • the dedicated bandwidth channel, 804 is assigned to active users that have secured a reservation and have been polled by the central controller.
  • the channel assignment and subslot allocation is dictated by the central controller based on priority and allowable numbers of stations cable of being supported by the central controller. This information is passed to the stations/users by a broadcast packet, 806, where the destination address indicates the user to receive the information. Feedback is ternary feedback from the previous contention slot 802, and the polling frame is the definition of the next contention slot 803.
  • the downstream broadcast channel contains variable length packets destined to specific users, or groups of users, based upon upstream requests made to external sources, such as client servers, cable operators, telephone connections and control information from the central control unit.
  • external sources such as client servers, cable operators, telephone connections and control information from the central control unit.
  • the information for each user is supplied on the user's downstream channel. Due to the fact that the downstream channel is a broadcast channel, all downstream stations may read the incoming packets, decode the destination id and packet type, and decide to store or discard the packet.
  • the central controller is described by the system shown in FIG. 1 , numeral 100, and contains the following functional units: the adaptive reservation manager, 102; the scheduler 104; and the feedback control 106.
  • the adaptive reservation manager, 102 is a dynamic unit that: 1 ) processes information from the multiple access contentions, in the contention subslots, on the upstream channel, 108; 2) provides local state information to the scheduler, 1 14, for successful contentions and priorities; 3) based on the contention results, dynamically defines the priorities of the subslots in the next contention slot; and 4) provides contention slot feedback and definition information to the feedback controller, 1 16.
  • the state information may include, but is not limited to, user queue depth, size of the packet at the head of the queue, and the priority requested.
  • the device of FIG. 1 may include contention feedback information that is a ternary feedback indicating one of: an idle, a success, and a collision.
  • the device may be a microprocessor.
  • the scheduler may execute a process that is embodied in a computer program implemented by a microprocessor having the steps of: A) mapping randomly transmitted requests from users and current states of users to a global system state; and B) determining the transmission schedule for both the feedback generator and the users based on randomly transmitted requests from users and current states of users.
  • the global information contains the number of available users/priority classes that may be supported on the upstream channel, 1004.
  • a predetermined predictive algorithm is then executed to estimate the aggregate arrival rate for each priority class. This information is critical to the adaptive reservation manager's assignment of priority classes to the subslots in the next contention slot, 1006.
  • the information is then passed to the feedback generator 1008 such that when the scheduler assigns the next contention slot, the control packet for the contention slot is available.
  • the values (maxx, N), 1 122 are global information supplied by the scheduler and represent the maximum allowable users for priority class X and the present number of active users, N, for that class. The value N is required since the ARM (adaptive reservation manager) does not keep track of active users that no longer require service.
  • PRIx , 1 121 is the predictive aggregate arrival rate on a specific channel for priority class x and determined in 1004.
  • state 1 106 HH
  • state 1 106 HH
  • the probability of reducing the contention time is increased along the with stability of the system for a higher arrival rate. This scheme is required to help with the QOS (Quality Of Service) issues for high priority users which usually have delay constraints applied to them.
  • the priority contention remains in 1 106 until no further collisions occur in either of the two contention subslots, 1 120. If the results of both contention subslots are none/single, 1 1 18, the next slot definition returns to 1 102, or HL.
  • condition 1 1 16 To enter state 1 104, condition 1 1 16 must be met: the maximum number of high priority (H) users, or the maximum for that channel, must have been reached or there has been a collision in the low priority and PRI
  • the priority contention stays in 1 104 until the number of active high priority users falls below MAXH (where MAXH is a predetermined maximum high priority); thus condition 1 1 12 is met and the next contention state definition is HL.
  • MAXH where MAXH is a predetermined maximum high priority
  • the scheduler, 104 may use any of the existing approximate scheduling algorithms.
  • An approximate algorithm is used for problems in the class of algorithms classified as nonpolynomial time.
  • the known bin packing algorithm would be sufficient with the modification that each bin has a movable upper bound on the present number of users for that priority class which can be supported and the amount of information that can be transferred. If a bin is supplied to each priority with a bandwidth capacity limiting the size of the bin, and if there exists any unused portion of a bin, the unused portion may be transferred to the next lower priority class. This type of transferral may be repeated until the last bin.
  • the scheduling of the contention slot is a novel feature of the invention.
  • the feedback generator, 104 is the gatherer and executer for the scheduler.
  • the feedback generator is supplied with the schedules that are continuously updated, and based on the state information, creates a control feedback packet to be supplied to all users with the appropriate control information.
  • Unit 1202 contains the address that the packet is destined for, since the control information address is all zeros, indicating availability for all users.
  • Unit 1204 contains the feedback of the last contention subslots, i.e., the ternary feedback, 0, 1 , or e (error).
  • Unit 1206 identifies the priorities associated with the current contention slot.
  • HL represents the next subslot's definition high and low priority.
  • the contention feedback information may be a ternary feedback indicating one of: an idle, a success, and a collision.
  • the scheduler may include a process that is embodied in a computer program implemented by a microprocessor having the steps of: A) mapping randomly transmitted requests from users and current states of users to a global system state; B) determining the transmission schedule for both the feedback generator and the users based on randomly transmitted requests from users and current states of users.
  • Step 302 is executed when a control packet is received.
  • the stations decode the control packet to determine whether there is a contention poll 304.
  • the result of 304 dictates if the station executes the centralized or distributed MAC protocol. If the control packet is destined to a specific user, and not all users, path 305 holds true.
  • a comparison to the stations' id is evaluated, 306. If the station is the destination, the station updates the local state information and transmits the allocated amount to the central node, 308.
  • the process waits for the next contention poll (meaning destination id equals 0000).
  • path 306 is entered, and the distributed MAC protocol is executed.
  • the stations then process the feedback information for the individual particular priority class, if available, and determine eligibility. Eligibility may be determined in many ways, for example, using tree splitting algorithms, probablistically, or deterministically. If the station is not in a contention state, the contention procedure is done 324. If the station is in a contention state, 312, and the station contended in a previous subslot, 314, the station determines from the feedback supplied what the result of the contention attempt was.
  • the station determines whether it is eligible to compete in the contention slot 320. For example, if the feedback for that subslot was 1 , success, then the station moves into the active state and waits to be polled by the central controller, 318. Otherwise, 320, the station determines how many contention slots exist for the priority class, and chooses one with equal probability, or 1 /(number of slots assigned to priority class). If no priority subslots exist for that particular class, the station must wait until the next contention period to determine whether it may compete, 324. If the station may contend, then in 322, the station creates a packet with the predetermined local information and contends in the slot chosen. The station then waits for the next contention control packet to arrive to determine the results.

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

La présente invention concerne un système, un dispositif (100), un appareil d'acheminement et un procédé (200) qui appliquent un protocole hybride d'accès multiples pour des utilisateurs à priorités multiples. Ce protocole assure une réservation efficace des canaux disponibles pour servir des utilisateurs dont les demandes sont transmises de manière aléatoire, ces utilisateurs ayant des priorités multiples. La présente invention présente les avantages suivants sur les solutions existantes: 1) elle constitue un support pour des catégories de services multiples; 2) elle offre l'assurance que tous les utilisateurs admis à accéder au système obtiennent le service garanti convenu, qui convient pour leur catégorie de service; 3) elle réalise des performances d'ensemble du système qui sont comparables aux algorithmes centralisés pour de fortes charges du système, tout en permettant des niveaux souhaitables de performances des protocoles d'accès distribués pour de faibles charges du système; 4) elle permet la transmission de paquets en nombres variables, chacun étant de taille variable quand l'accès est donné à un utilisateur, et 5) elle réduit le nombre de cas où un utilisateur subit une concurrence pour obtenir l'accès, ce qui réduit les collisions et la surcharge due aux zones de contention et améliore les performances du système.
PCT/US1996/013601 1995-09-11 1996-08-22 Dispositif, appareil d'acheminement, procede et systeme de fourniture d'un protocole hybride d'acces multiples pour des utilisateurs a priorites multiples WO1997010655A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP96928999A EP0850518A4 (fr) 1995-09-11 1996-08-22 Dispositif, appareil d'acheminement, procede et systeme de fourniture d'un protocole hybride d'acces multiples pour des utilisateurs a priorites multiples
AU68563/96A AU6856396A (en) 1995-09-11 1996-08-22 Device, router, method and system for providing a hybrid multiple access protocol for users with multiple priorities

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US52629595A 1995-09-11 1995-09-11
US08/526,295 1995-09-11

Publications (1)

Publication Number Publication Date
WO1997010655A1 true WO1997010655A1 (fr) 1997-03-20

Family

ID=24096750

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US1996/013601 WO1997010655A1 (fr) 1995-09-11 1996-08-22 Dispositif, appareil d'acheminement, procede et systeme de fourniture d'un protocole hybride d'acces multiples pour des utilisateurs a priorites multiples

Country Status (5)

Country Link
EP (1) EP0850518A4 (fr)
CN (1) CN1196145A (fr)
AU (1) AU6856396A (fr)
CA (1) CA2231263A1 (fr)
WO (1) WO1997010655A1 (fr)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1082665A1 (fr) * 1998-05-28 2001-03-14 Motorola, Inc. Estimation de trafic offert et applications permettant de l'utiliser dans un reseau de communication
WO2001043363A1 (fr) * 1999-12-09 2001-06-14 Koninklijke Philips Electronics N.V. Reseau de communication presentant un retard limite en cas de conflit sur le trajet de circulation
US6859464B2 (en) 1999-08-27 2005-02-22 Motorola, Inc. Method and device for controlling outliers in offered load estimation in a shared medium communication network
US20140350969A1 (en) * 2004-04-30 2014-11-27 Ebay Inc. System and method to provide altered benefit based on preferred status
US8918505B2 (en) 2001-12-18 2014-12-23 Ebay Inc. Prioritization of third party access to an online commerce site

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN100401716C (zh) * 2003-12-29 2008-07-09 华为技术有限公司 一种在网络路由设备接口上实现的多组播协议通信方法
CN101286925B (zh) * 2007-04-13 2011-08-17 上海贝尔阿尔卡特股份有限公司 检测是否会出现重复的组播数据包的方法及装置
CN114826986B (zh) * 2022-03-30 2023-11-03 西安电子科技大学 一种用于优先级无帧结构的aloha协议的性能分析方法

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4940974A (en) * 1988-11-01 1990-07-10 Norand Corporation Multiterminal communication system and method
US5010329A (en) * 1987-04-10 1991-04-23 Fujitsu Limited Block polling data communication system having optimum block determination means
US5430732A (en) * 1992-03-18 1995-07-04 Nec Usa, Inc. Satellite communication system
US5499243A (en) * 1993-01-22 1996-03-12 Hall; Dennis R. Method and apparatus for coordinating transfer of information between a base station and a plurality of radios

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0444207B1 (fr) * 1989-09-19 1996-12-27 Fujitsu Limited Systeme d'acces multiple pour un reseau de communications
US5384777A (en) * 1993-04-19 1995-01-24 International Business Machines Corporation Adaptive medium access control scheme for wireless LAN

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5010329A (en) * 1987-04-10 1991-04-23 Fujitsu Limited Block polling data communication system having optimum block determination means
US4940974A (en) * 1988-11-01 1990-07-10 Norand Corporation Multiterminal communication system and method
US5430732A (en) * 1992-03-18 1995-07-04 Nec Usa, Inc. Satellite communication system
US5499243A (en) * 1993-01-22 1996-03-12 Hall; Dennis R. Method and apparatus for coordinating transfer of information between a base station and a plurality of radios

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP0850518A4 *

Cited By (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1082665A1 (fr) * 1998-05-28 2001-03-14 Motorola, Inc. Estimation de trafic offert et applications permettant de l'utiliser dans un reseau de communication
EP1082665A4 (fr) * 1998-05-28 2001-08-16 Motorola Inc Estimation de trafic offert et applications permettant de l'utiliser dans un reseau de communication
KR100397718B1 (ko) * 1998-05-28 2003-09-17 모토로라 인코포레이티드 네트워크 로드 평가 및 이를 이용한 통신 네트워크에서의 응용 장치
US6859464B2 (en) 1999-08-27 2005-02-22 Motorola, Inc. Method and device for controlling outliers in offered load estimation in a shared medium communication network
WO2001043363A1 (fr) * 1999-12-09 2001-06-14 Koninklijke Philips Electronics N.V. Reseau de communication presentant un retard limite en cas de conflit sur le trajet de circulation
US6967968B2 (en) 1999-12-09 2005-11-22 Koninklijke Philips Electronics N.V. Communication network having minimized roundtrip contention delay
US8918505B2 (en) 2001-12-18 2014-12-23 Ebay Inc. Prioritization of third party access to an online commerce site
US9508094B2 (en) 2001-12-18 2016-11-29 Paypal, Inc. Prioritization of third party access to an online commerce site
US9589289B2 (en) 2001-12-18 2017-03-07 Paypal, Inc. Prioritization of third party access to an online commerce site
US9626705B2 (en) 2001-12-18 2017-04-18 Paypal, Inc. Prioritization of third party access to an online commerce site
US9679323B2 (en) 2001-12-18 2017-06-13 Paypal, Inc. Prioritization of third party access to an online commerce site
US20140350969A1 (en) * 2004-04-30 2014-11-27 Ebay Inc. System and method to provide altered benefit based on preferred status

Also Published As

Publication number Publication date
EP0850518A4 (fr) 1999-11-24
CN1196145A (zh) 1998-10-14
CA2231263A1 (fr) 1997-03-20
AU6856396A (en) 1997-04-01
EP0850518A1 (fr) 1998-07-01

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
US6879579B1 (en) Medium access control protocol for data communications
US5886993A (en) System, device, and method for sharing contention mini-slots among multiple priority classes
US5751708A (en) Access method for broadband and narrowband networks
US7158531B2 (en) Method and apparatus implementing a multimedia digital network
JP4354711B2 (ja) リアルタイムトラヒックに対する保証された帯域幅配達を備える遅延最小化システム
Papadimitriou et al. Learning-automata-based TDMA protocols for broadcast communication systems with bursty traffic
KR101236294B1 (ko) 공유되어 있는 통신망에 대한 충돌 회피 미디어 액세스방법
US20040156367A1 (en) Hierarchically distributed scheduling apparatus and method
JP2001504316A (ja) 通信ネットワーク内でスケジューリングを行うシステム，装置および方法
US6009468A (en) Employing feedback data and congestion ranking to minimize contention delay in a multi-slot Mac protocol
Corner et al. A priority scheme for the IEEE 802.14 MAC protocol for hybrid fiber-coax networks
EP0850518A1 (fr) Dispositif, appareil d'acheminement, procede et systeme de fourniture d'un protocole hybride d'acces multiples pour des utilisateurs a priorites multiples
WO2006050664A1 (fr) Systeme et procede permettant de controler l'acces a un support sans fil
Kuo et al. Improved priority access, bandwidth allocation and traffic scheduling for DOCSIS cable networks
WO2005062560A1 (fr) Controle de congestion preventif pour un support d'application
EP1017244A1 (fr) Méthode et système pour l' allocation de bande valable soit dans un système P-MP ATM radio et soit dans un system P-MP ATM PON
JP3877987B2 (ja) シームレスポーリング／コンテンション方式を含む媒体アクセス制御（ｍａｃ）プロトコル
JP4335481B2 (ja) 無線非同期伝送モード（ａｔｍ）システムのための適応セルスケジューリングアルゴリズム
Papadimitriou et al. Adaptive MAC protocols for broadcast networks with bursty traffic
US5909444A (en) System, device, and method for aggregating users in a shared-medium network
US7016356B1 (en) Method and system to assign transmission bandwidth in both radio and PON ATM P-MP systems
KR100346779B1 (ko) 무선 에이티엠망에서 공통큐를 이용한 동적예약 무선 액세스 방법
JPH10126430A (ja) ケーブル・ネットワークシステム
AU761936B2 (en) Medium access control protocol for data communications

Legal Events

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

Ref document number: 96196882.6

Country of ref document: CN

AK Designated states

Kind code of ref document: A1

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

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): KE LS MW SD SZ UG AT BE CH DE DK ES FI FR GB GR IE IT LU MC NL PT SE BF BJ CF CG CI CM GA

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
ENP Entry into the national phase

Ref document number: 2231263

Country of ref document: CA

Ref document number: 2231263

Country of ref document: CA

Kind code of ref document: A

WWE Wipo information: entry into national phase

Ref document number: 1996928999

Country of ref document: EP

WWP Wipo information: published in national office

Ref document number: 1996928999

Country of ref document: EP

REG Reference to national code

Ref country code: DE

Ref legal event code: 8642

WWW Wipo information: withdrawn in national office

Ref document number: 1996928999

Country of ref document: EP