WO2000033609A1 - An access control mechanism for packet switched communication networks - Google Patents
An access control mechanism for packet switched communication networks Download PDFInfo
- Publication number
- WO2000033609A1 WO2000033609A1 PCT/SE1999/002244 SE9902244W WO0033609A1 WO 2000033609 A1 WO2000033609 A1 WO 2000033609A1 SE 9902244 W SE9902244 W SE 9902244W WO 0033609 A1 WO0033609 A1 WO 0033609A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- delay sensitive
- network
- scheduling
- node
- traffic service
- Prior art date
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
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/04—Selecting arrangements for multiplex systems for time-division multiplexing
- H04Q11/0428—Integrated services digital network, i.e. systems for transmission of different types of digitised signals, e.g. speech, data, telecentral, television signals
- H04Q11/0478—Provisions for broadband connections
-
- 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/56—Queue scheduling implementing delay-aware scheduling
- H04L47/568—Calendar queues or timing rings
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/78—Architectures of resource allocation
- H04L47/781—Centralised allocation of resources
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/80—Actions related to the user profile or the type of traffic
- H04L47/801—Real time traffic
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/90—Buffering arrangements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04M—TELEPHONIC COMMUNICATION
- H04M7/00—Arrangements for interconnection between switching centres
- H04M7/006—Networks other than PSTN/ISDN providing telephone service, e.g. Voice over Internet Protocol (VoIP), including next generation networks with a packet-switched transport layer
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13204—Protocols
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13216—Code signals, frame structure
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13242—Broadcast, diffusion, multicast, point-to-multipoint (1 : N)
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/1329—Asynchronous transfer mode, ATM
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13292—Time division multiplexing, TDM
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13352—Self-routing networks, real-time routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13389—LAN, internet
Definitions
- the invention relates to media access control (MAC) over a shared multiplexed link using packet transmission. It is particularly directed to the management of the transfer of information from services which stipulate certain delays and delay variations, such as circuit emulated traffic, in a packet switched network, and specifically between a central node and one of several multipoint nodes over a shared medium.
- MAC media access control
- MAC Media access control
- MAC Media access control
- MAC Media access control
- a packet switched network is a mechanism for determining which of a plurality of nodes is allowed to send information over a shared medium.
- the head end or central node in a shared link will control the utilisation of the link by multipoint nodes. This is achieved by polling the various multipoint nodes. The polling order and frequency is generally controlled according to traffic demand.
- time slots are allocated by the head end of a link in response to requests sent by the multipoint nodes when traffic is awaiting transmission at these node. The slots are allocated using permits that designate which time slot in the future traffic stream may be utilised for which service traffic.
- Packet switched networks are increasingly utilised to transport a variety of traffic, some of which is traditionally circuit switched.
- IP internet protocol
- An example of this is the transmission of voice over an internet protocol (IP) based network.
- IP internet protocol
- speech information may be packetised, certain transmission delays and delay variations must be respected if the speech service is to be acceptable to the end user.
- This is a general requirement of all circuit emulated traffic. Accordingly, with the above-described request based protocols, a multipoint node carrying circuit emulated traffic requires permits to be allocated without delay and with high priority. When more than one delay sensitive service utilises the shared medium the access control becomes more complex.
- a method and arrangement for controlling access to a central node over shared medium by one of several network nodes carrying both delay sensitive and non-delay sensitive traffic by providing a scheduler that defines a predetermined scheduling interval for the delay sensitive traffic services.
- the scheduling interval corresponding essentially to the time in terms of time slots for assembling a data packet of the delay sensitive traffic service.
- the central node consults the scheduler to determine if a scheduling interval has elapsed.
- a time slot is allocating to the network node carrying the corresponding delay sensitive traffic service. If no scheduling interval has elapsed for the time slot consulted, the central node allocates a time slot to a non-delay sensitive service on the basis of stored information concerning the amount of traffic awaiting transmission at the various network nodes.
- the scheduler is a cyclical storage means that is divided into cells representing a time slot on the shared medium and adapted to contain scheduling information relating to the traffic service.
- the scheduler may comprise scheduling information for several services in a single cyclical storage means.
- the scheduler contains several separate, cyclical schedulers arranged in a queue, and each being dedicated to a single traffic service.
- Fig. 1 schematically depicts a point to multipoint link of a multiplexed packet switched network
- Fig. 2 shows a first embodiment of a scheduler according to the invention
- Fig. 3 shows a further embodiment of a scheduler according to the invention.
- FIG. I A typical multipoint-to-point link in a TDMA packet switched communication network is illustrated in Fig. I Several multipoint nodes 20 communicate via a single, shared bi-directional channel with a central node 10. Only three nodes are shown in the figure, however it is to be understood that further nodes may be connected above and below the illustrated nodes.
- the channel 100 may be a fixed electrical or electro-optical link or an air interface.
- the central node 10 determines which time slots on the shared channel 100 will be allocated to which services conveyed by the multipoint nodes 20. This is accomplished by the central node 10 issuing permits for a time slot in the future information stream. For delay insensitive packet switched services, such as data transmission services, the central node 10 holds a record of the number of packets of information awaiting transmission at each of the multipoint nodes 20. This is represented in the figure by a queue record memory 11. The queue records are updated by means of permit requests, or equivalent queue size reports, sent by the multipoint nodes 20 to the central node 10.
- MAC media access control
- the central node 10 When the record of a particular multipoint node 20 indicates that packets are awaiting transmission, the central node 10 issues a corresponding permit defining which time slot the multipoint node 20 in question may utilise for transmitting the packet. When more packets are awaiting transmission than can be dealt with immediately, the central node 10 determines which service has priority. This prioritising information is likewise obtained from the multipoint nodes 20 on invitation from the central node 10.
- the traffic A, B, C conveyed by the three illustrated multipoint nodes 20 is delay sensitive, i.e. has strict requirements as to allowable delays and delay variations. This may include, but is not limited to, circuit emulated traffic, voice or interactive video traffic. Furthermore, each service A, B, C has different frame lengths.
- Fig. 2 shows a scheduler 30 according to a first embodiment of the invention.
- the scheduler 30 can he viewed as a circular memory divided into cells 31, each of which represents a time slot on the shared channel.
- the scheduler 30 may be implemented using one or more modulo counters, memories or registers with pointers, or similar means which allow information to be obtained at predetermined regular intervals.
- the scheduler 30 is either incorporated in the central node 10 or is arranged such that a controller of the central node 10 (not shown) that is adapted to handle the allocation of time slots across the shared link can easily access the scheduler 30.
- the scheduler 30 Prior to operation, or upon the introduction of a new delay sensitive service, the scheduler 30 is programmed. This may be done by the central node 10 using its controller, or may be performed using external means.
- the scheduler 30 in Fig. 2 is already programmed with markers in some of the cells 31 that serve to indicate which service is to be allocated a permit for which time slot in the future traffic stream. In the present example these markers are represented by the letters A, B and C for the three delay sensitive services of the same names, respectively.
- the scheduler 30 does not define the slot as an absolute time, but rather the slot interval.
- the different services, A, B and C have different frame formats and lengths determined by the transmission bit rate and denoted in the figure by a, b and c, respectively.
- the frame length a of the service A is given as the equivalent of 7 time slots on the shared channel; the frame length b of service B is 8 time slots, and the frame length c of the service C is 11 time slots.
- the total length of the scheduler 30 is a multiple of all the frame lengths in terms of time slots. While the scheduler 30 illustrated in Fig. 2 is somewhat truncated, it is assumed to have a length equal to the smallest multiple of a, b and c, that is 616 cells 31. It will be understood that the permit intervals between different services will also take account of possible path delay differences between the various multipoint nodes 20 and the central node 10.
- the central node 10 consults the cells 31 of scheduler 30 in succession to determine whether a permit is scheduled for one of the services A, B or C for each time slot. If the cell 31 consulted is marked, a permit will be issued to the corresponding multipoint node 20 carrying the selected service. If no permit is scheduled for a particular time slot, the central node 10 may issue a permit to one of the other delay insensitive services which require access to the shared medium on the basis of queue size information stored at the node 10, as described above. Once all the cells 31 of the scheduler 30 have been consulted in turn, the pointer or its equivalent returns to the beginning again.
- the central node 10 will allocate the time slot to one of the services and cause the frames for the remaining services to be delayed by one or more time slots.
- the allocation of time slots for conflicting permit schedules may be decided on the basis of prioritising information relating to the services, whereby one service will consistently be handled before the others.
- the central node 10 may treat all services with equal priority by giving one service priority in the first incidence of conflict and another service priority in the next incidence.
- the scheduler 30 could be programmed such that only one permit is allocated to each cell, however this would necessarily introduce a firm priority for one or other of the services.
- the scheduler 30 described with reference to Fig. 2 can deal efficiently with the access of circuit emulated delay sensitive traffic over a shared link of a packet switched network when the number of services with different frame lengths is not too high. However, when several different services, many with different frame lengths are to be scheduled on a shared medium, the length of the scheduler will become prohibitively large. Furthermore the scheduler 30 of Fig. 2 does not lend itself easily to expansion. It is complex to incorporate additional services, since new permit schedules will effect both the total length and the content of the scheduler 30.
- this scheduler 40 includes several short schedule memories 41 arranged in a queue.
- Each schedule memory 41 contains information for services having the same frame format and length.
- the topmost schedule memory 41 contains scheduling information for the service A
- the next schedule memory 41 in descending order contains information relating to service B
- the final schedule memory 41 contains permit scheduling information for service C.
- the maximum length required for this scheduler is thus a+b+c cells 42.
- the central node 10 consults the cells 42 of each of the schedule memories 41 representing the current time slot in turn, and determines which, if any, of the services is to be sent a permit for the specified time slot.
- the central node controller will decide which service will be handled preferentially. This is done on the basis of prioritising information obtained previously from the corresponding multipoint nodes 20.
- priority will be allocated by the central node controller to each service in turn as each conflict arises.
- the schedule memories 40 may be programmed with a specified priority hierarchy causing some services to be consistently delayed in favour of another so that decisions do not need to be made by the central node 10, or its controller.
- Circuit emulated traffic transmitted over a packet switched network may use only part of a cell for traffic information so as to reduce the time needed for assembly of the cell. For example, to reduce the time needed to assemble an ATM cell for a 64kbps telephone service, the ATM cell may contain only
- the delay experienced by this service can be substantially reduced, when the scheduling of packet transmission using the scheduler 30, 40 described above is synchronised to coincide with the assembly of the cell after the arrival of 24 bytes of information. Furthermore, the permits may be scheduled to prevent time slots being wasted on the transmission of idle or dummy cells or cell portions.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Computer And Data Communications (AREA)
- Communication Control (AREA)
- Selective Calling Equipment (AREA)
- Time-Division Multiplex Systems (AREA)
Abstract
Description
Claims
Priority Applications (7)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US09/857,288 US6965607B1 (en) | 1998-12-01 | 1999-12-01 | Access control mechanism for packet switched communication networks |
AU20156/00A AU758093B2 (en) | 1998-12-01 | 1999-12-01 | An access control mechanism for packet switched communication networks |
EP99963787A EP1135960B1 (en) | 1998-12-01 | 1999-12-01 | An access control mechanism for packet switched communication networks |
BR9915806-0A BR9915806A (en) | 1998-12-01 | 1999-12-01 | Process for controlling the transmission of traffic sensitive to delay and non-sensitive to delay from a plurality of network nodes to a central node over a shared medium, packet-switched communication network including a central node and a plurality of network nodes connected to the said central node by a shared medium, and, node in a packet-switched communication network to control the transmission of data from a plurality of network nodes over a shared medium |
JP2000586129A JP2002532037A (en) | 1998-12-01 | 1999-12-01 | Access control mechanism for packet-switched communication networks |
CA002352889A CA2352889A1 (en) | 1998-12-01 | 1999-12-01 | An access control mechanism for packet switched communication networks |
DE69940217T DE69940217D1 (en) | 1998-12-01 | 1999-12-01 | ACCESS CONTROL MECHANISM FOR PACKAGED COMMUNICATION NETWORKS |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
SE9804172A SE516084C2 (en) | 1998-12-01 | 1998-12-01 | A technology for access control in communication networks with packet switching |
SE9804172-6 | 1998-12-01 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2000033609A1 true WO2000033609A1 (en) | 2000-06-08 |
Family
ID=20413525
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/SE1999/002244 WO2000033609A1 (en) | 1998-12-01 | 1999-12-01 | An access control mechanism for packet switched communication networks |
Country Status (12)
Country | Link |
---|---|
US (1) | US6965607B1 (en) |
EP (1) | EP1135960B1 (en) |
JP (1) | JP2002532037A (en) |
CN (1) | CN1135056C (en) |
AT (1) | ATE419724T1 (en) |
AU (1) | AU758093B2 (en) |
BR (1) | BR9915806A (en) |
CA (1) | CA2352889A1 (en) |
DE (1) | DE69940217D1 (en) |
RU (1) | RU2001117851A (en) |
SE (1) | SE516084C2 (en) |
WO (1) | WO2000033609A1 (en) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN100362784C (en) * | 2002-01-18 | 2008-01-16 | 硅系统设计公司 | Process for the transmission of data by a multi-user, point to multi-point digital data transmission system |
WO2008104094A1 (en) * | 2006-11-01 | 2008-09-04 | Zte Corporation | A method for sharing the non-scheduling resource and the scheduling resource in the enhanced uplink system |
Families Citing this family (16)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7330877B2 (en) * | 2000-09-18 | 2008-02-12 | Sharp Laboratories Of America | Devices, softwares and methods for rescheduling multi-party sessions upon premature termination of session |
WO2005065035A2 (en) * | 2004-01-08 | 2005-07-21 | Wisair Ltd. | Distributed and centralized media access control device and method |
CN100356736C (en) * | 2004-10-27 | 2007-12-19 | 华为技术有限公司 | IP network jitter simulation method |
JP4684045B2 (en) * | 2005-08-30 | 2011-05-18 | 株式会社エヌ・ティ・ティ・ドコモ | Transmission control method, mobile station, radio base station, and radio network controller |
CN101132225B (en) * | 2006-08-24 | 2012-04-11 | 中兴通讯股份有限公司 | Transmission method for sharing unscheduled and scheduled resource in ascending reinforcement system |
US8634430B2 (en) * | 2006-11-27 | 2014-01-21 | Fujitsu Limited | Multicast transmissions in optical burst transport |
US20080124081A1 (en) * | 2006-11-27 | 2008-05-29 | Takeo Hamada | Predictive scheduling of data path control |
CN101222270B (en) * | 2007-01-12 | 2013-06-05 | 中兴通讯股份有限公司 | TBS and modulation mode selection method and apparatus |
CN101282286B (en) * | 2007-04-02 | 2012-09-05 | 中兴通讯股份有限公司 | Method for reducing transmission block set coarseness during access of high speed upstream packet |
CN101282190B (en) * | 2007-04-02 | 2011-05-11 | 中兴通讯股份有限公司 | Method for multiplexing scheduling and non-scheduling service transmission in high speed upstream packet access |
JP5566312B2 (en) * | 2011-02-09 | 2014-08-06 | 日本電信電話株式会社 | Transmission apparatus and network system |
US8856368B2 (en) * | 2011-04-01 | 2014-10-07 | International Business Machines Corporation | Method for distributing a plurality of data portions |
US9055483B2 (en) * | 2011-08-19 | 2015-06-09 | Broadcom Corporation | Scheduling in a two-tier network |
CN103946184B (en) | 2011-11-17 | 2019-09-24 | 戴诺诺贝尔亚太股份有限公司 | Explosive composite |
US20140181822A1 (en) * | 2012-12-20 | 2014-06-26 | Advanced Micro Devices, Inc. | Fragmented Channels |
US9736860B2 (en) * | 2015-07-30 | 2017-08-15 | Raytheon Bbn Technologies Corp. | Systems and methods for scheduling of a shared resource |
Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5297144A (en) * | 1991-01-22 | 1994-03-22 | Spectrix Corporation | Reservation-based polling protocol for a wireless data communications network |
US5327432A (en) * | 1990-12-26 | 1994-07-05 | France Telecom | Protocol for multiple access to a telecommunications channel from auxiliary terminals by digitized information messages and corresponding system |
US5677909A (en) * | 1994-05-11 | 1997-10-14 | Spectrix Corporation | Apparatus for exchanging data between a central station and a plurality of wireless remote stations on a time divided commnication channel |
WO1998044758A1 (en) * | 1997-04-03 | 1998-10-08 | Ericsson, Inc. | Data transmission over a point-to-multipoint optical network |
WO1998054858A1 (en) * | 1997-05-30 | 1998-12-03 | Motorola Inc. | System, device, and method for sharing contention mini-slots among multiple priority classes |
Family Cites Families (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
DE69534445T2 (en) * | 1995-04-28 | 2006-04-27 | Alcatel | Method for TDMA management, central station, subscriber station and network for carrying out the method |
US5590131A (en) * | 1995-05-30 | 1996-12-31 | Motorola, Inc. | Efficient distributed queueing random access method for the medium access control layer in networks with broadcast channels |
US5751709A (en) * | 1995-12-28 | 1998-05-12 | Lucent Technologies Inc. | Adaptive time slot scheduling apparatus and method for end-points in an ATM network |
US5896382A (en) * | 1996-11-19 | 1999-04-20 | Scientific-Atlanta, Inc. | Method and apparatus for communicating information between a headend and subscriber over a wide area network |
US5960001A (en) * | 1997-06-19 | 1999-09-28 | Siemens Information And Communication Networks, Inc. | Apparatus and method for guaranteeing isochronous data flow on a CSMA/CD network |
US6034960A (en) * | 1997-12-04 | 2000-03-07 | Nortel Networks Corporation | ATM service scheduler using reverse-binary scattering and time-space mapping |
US6545996B1 (en) * | 1998-12-10 | 2003-04-08 | Lucent Technologies Inc. | Management of wireless control channel |
-
1998
- 1998-12-01 SE SE9804172A patent/SE516084C2/en not_active IP Right Cessation
-
1999
- 1999-12-01 EP EP99963787A patent/EP1135960B1/en not_active Expired - Lifetime
- 1999-12-01 WO PCT/SE1999/002244 patent/WO2000033609A1/en active IP Right Grant
- 1999-12-01 US US09/857,288 patent/US6965607B1/en not_active Expired - Lifetime
- 1999-12-01 DE DE69940217T patent/DE69940217D1/en not_active Expired - Lifetime
- 1999-12-01 CN CNB998159700A patent/CN1135056C/en not_active Expired - Fee Related
- 1999-12-01 AT AT99963787T patent/ATE419724T1/en not_active IP Right Cessation
- 1999-12-01 AU AU20156/00A patent/AU758093B2/en not_active Ceased
- 1999-12-01 CA CA002352889A patent/CA2352889A1/en not_active Abandoned
- 1999-12-01 JP JP2000586129A patent/JP2002532037A/en not_active Withdrawn
- 1999-12-01 RU RU2001117851/09A patent/RU2001117851A/en not_active Application Discontinuation
- 1999-12-01 BR BR9915806-0A patent/BR9915806A/en not_active IP Right Cessation
Patent Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5327432A (en) * | 1990-12-26 | 1994-07-05 | France Telecom | Protocol for multiple access to a telecommunications channel from auxiliary terminals by digitized information messages and corresponding system |
US5297144A (en) * | 1991-01-22 | 1994-03-22 | Spectrix Corporation | Reservation-based polling protocol for a wireless data communications network |
US5677909A (en) * | 1994-05-11 | 1997-10-14 | Spectrix Corporation | Apparatus for exchanging data between a central station and a plurality of wireless remote stations on a time divided commnication channel |
WO1998044758A1 (en) * | 1997-04-03 | 1998-10-08 | Ericsson, Inc. | Data transmission over a point-to-multipoint optical network |
WO1998054858A1 (en) * | 1997-05-30 | 1998-12-03 | Motorola Inc. | System, device, and method for sharing contention mini-slots among multiple priority classes |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN100362784C (en) * | 2002-01-18 | 2008-01-16 | 硅系统设计公司 | Process for the transmission of data by a multi-user, point to multi-point digital data transmission system |
WO2008104094A1 (en) * | 2006-11-01 | 2008-09-04 | Zte Corporation | A method for sharing the non-scheduling resource and the scheduling resource in the enhanced uplink system |
Also Published As
Publication number | Publication date |
---|---|
CA2352889A1 (en) | 2000-06-08 |
ATE419724T1 (en) | 2009-01-15 |
EP1135960A1 (en) | 2001-09-26 |
RU2001117851A (en) | 2003-06-27 |
SE516084C2 (en) | 2001-11-19 |
AU2015600A (en) | 2000-06-19 |
US6965607B1 (en) | 2005-11-15 |
SE9804172L (en) | 2000-06-02 |
CN1335039A (en) | 2002-02-06 |
DE69940217D1 (en) | 2009-02-12 |
AU758093B2 (en) | 2003-03-13 |
CN1135056C (en) | 2004-01-14 |
BR9915806A (en) | 2001-08-21 |
EP1135960B1 (en) | 2008-12-31 |
SE9804172D0 (en) | 1998-12-01 |
JP2002532037A (en) | 2002-09-24 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US6965607B1 (en) | Access control mechanism for packet switched communication networks | |
US8031598B2 (en) | Flow-rate-regulated burst switches | |
US7817543B2 (en) | Regulating data-burst transfer | |
JP4354711B2 (en) | Delay minimization system with guaranteed bandwidth delivery for real-time traffic | |
JP3715098B2 (en) | Packet distribution apparatus and method in communication network | |
US5640389A (en) | Traffic shaper and packet communication apparatus | |
JP2981095B2 (en) | Communication device | |
KR100329911B1 (en) | Traffic shaper with multiply queued virtual paths | |
US6396834B1 (en) | Flexible scheduler in an asynchronous transfer mode (ATM) switch | |
US6940861B2 (en) | Data rate limiting | |
Hahne et al. | DQDB networks with and without bandwidth balancing | |
US6931002B1 (en) | Hybrid switching | |
US20020044563A1 (en) | Data packet scheduler | |
EP0717532A1 (en) | Dynamic fair queuing to support best effort traffic in an ATM network | |
US20040156367A1 (en) | Hierarchically distributed scheduling apparatus and method | |
WO1998045976A2 (en) | Hierarchical packet scheduling method and apparatus | |
US5946315A (en) | Method and device for synchronizing dynamic synchronous transfer mode in a ring topology | |
US6671260B1 (en) | Data transmission in a point-to-multipoint network | |
US7130267B1 (en) | System and method for allocating bandwidth in a network node | |
JPH1155276A (en) | Shaping device | |
US7123611B2 (en) | Packet switching | |
Mukherjee et al. | An improved voice—data integration protocol for fiber optic bus networks | |
JP2003224595A (en) | Band control system for line control part | |
JP2001057563A (en) | Method for generating atm cell for low bit rate application | |
WO2001084783A1 (en) | Data transmission in a point-to-multipoint network |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
WWE | Wipo information: entry into national phase |
Ref document number: 99815970.0 Country of ref document: CN |
|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): AE AL AM AT AU AZ BA BB BG BR BY CA CH CN CR CU CZ DE DK DM EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT TZ UA UG US UZ VN YU ZA ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): GH GM KE LS MW SD SL SZ TZ 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 GW ML MR NE SN TD TG |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
DFPE | Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101) | ||
ENP | Entry into the national phase |
Ref document number: 2352889 Country of ref document: CA Ref document number: 2352889 Country of ref document: CA Kind code of ref document: A |
|
WWE | Wipo information: entry into national phase |
Ref document number: 20156/00 Country of ref document: AU |
|
ENP | Entry into the national phase |
Ref document number: 2000 586129 Country of ref document: JP Kind code of ref document: A |
|
WWE | Wipo information: entry into national phase |
Ref document number: 1999963787 Country of ref document: EP |
|
WWP | Wipo information: published in national office |
Ref document number: 1999963787 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 09857288 Country of ref document: US |
|
REG | Reference to national code |
Ref country code: DE Ref legal event code: 8642 |
|
WWG | Wipo information: grant in national office |
Ref document number: 20156/00 Country of ref document: AU |