WO2004017576A1 - Systeme et procede d'ordonnancement du trafic pour un reseau a ligne unique - Google Patents

Systeme et procede d'ordonnancement du trafic pour un reseau a ligne unique Download PDF

Info

Publication number
WO2004017576A1
WO2004017576A1 PCT/IB2002/003234 IB0203234W WO2004017576A1 WO 2004017576 A1 WO2004017576 A1 WO 2004017576A1 IB 0203234 W IB0203234 W IB 0203234W WO 2004017576 A1 WO2004017576 A1 WO 2004017576A1
Authority
WO
WIPO (PCT)
Prior art keywords
terminal
importance level
traffic
scheduler
packet
Prior art date
Legal status (The legal status 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 status listed.)
Ceased
Application number
PCT/IB2002/003234
Other languages
English (en)
Inventor
Kalevi Kilkki
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nokia Inc
Original Assignee
Nokia 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 Nokia Inc filed Critical Nokia Inc
Priority to AU2002329527A priority Critical patent/AU2002329527A1/en
Priority to PCT/IB2002/003234 priority patent/WO2004017576A1/fr
Publication of WO2004017576A1 publication Critical patent/WO2004017576A1/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
    • H04L47/2408—Traffic characterised by specific attributes, e.g. priority or QoS for supporting different services, e.g. a differentiated services [DiffServ] type of service
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/32—Flow control; Congestion control by discarding or delaying data units, e.g. packets or frames
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/10—Flow control between communication endpoints
    • H04W28/14—Flow control between communication endpoints using intermediate storage
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/52—Allocation or scheduling criteria for wireless resources based on load

Definitions

  • the present invention relates to a system and method for traffic scheduling for a transmission network, preferably a shared media network, and in particular to resource allocation of shared media among a number of terminals. Further, the invention relates to a traffic scheduler, and to a terminal which can be used in such a system or method.
  • the shared media can be a radio channel, a point-to- multipoint (PMP) radio system, a mobile ad hoc network (MANET) or a passive optical network, or something else.
  • a network entity (called here traffic scheduler) determines the resource allocation between the terminals for a relatively short period, e.g., for 1 millisecond. This period is called here transmission cycle. The length of the cycle can either be constant or variable.
  • the traffic preferably consists of packets, in particular IP packets with the possibility to use DiffServ type of marking.
  • packets in particular IP packets with the possibility to use DiffServ type of marking.
  • the invention can be applied with any packet or cell-based system with similar information in the packets.
  • the task of the traffic scheduler is to divide the total resource of the shared media as efficiently and fairly as possible.
  • Efficiency means that the utilization level of the shared media is kept as high as possible.
  • Fairness basically means two things.
  • the fairness criteria is closely related to the service model of the network operator; equal division between terminals is not necessarily fair, because there can be different end-user categories, and the number of active end-users using one terminal can vary.
  • the difficulty lies in the diversity of the requirements, which makes it difficult to determine the right allocation without excessive amount of signaling traffic between the terminal and the traffic scheduler. This problem is particularly relevant when the shared media is radio channel with limited capacity.
  • Various standards and proprietary proposals include primary mechanisms to the technical implementation of a traffic scheduler. They typically define the channel structure of the shared media and some basic functionality for the interaction between the terminal and traffic scheduler, but leave the problem of actual traffic scheduling algorithm for upper layer protocols. Examples of this kind of system are IEEE 802.16 PMP (point to multipoint) radio system, Passive Optical Networks (PONs), and mobile ad hoc networks (MANETs) .
  • PMP point to multipoint
  • PONs Passive Optical Networks
  • MANETs mobile ad hoc networks
  • US 6 081 505 describes the buffering system for a fixed link where the next hop is the same for all packets or cells, and packets or cells can be transmitted individually in the same order they are located in the queues without sacrificing the performance of the transportation media.
  • US 6 047 326 and US 6 081 505 together form the so-called SIMA system which provides point-to-point traffic scheduling The SIMA concept is also discussed in: K. Kilkki and J. Ruutu, "Simple Integrated Media Access (SIMA) with TCP," in the 4th INFORMS Telecommunications conference Boca Raton, FL, USA, Mar. 1998, and in: K. Kilkki and J. Ruutu, "Simple integrated media access - an internet service based on priorities," in 6th International Conference on Telecommunication Systems, 1998, hereby incorporated by reference.
  • SIMA Simple Integrated Media Access
  • the invention provides a system as defined in the independent system claim.
  • the invention provides a method as defined in the independent method claim.
  • the invention provides a traffic scheduler as defined in the traffic scheduler claims, and a terminal as defined in the terminal claims, which can be used in such a system or method.
  • the invention provides a solution for the problem of resource allocation of shared media among a number of terminals.
  • the invention solves the problem of efficiently and fairly dividing a shared media resource, like that of radio channel or passive optical network.
  • the solution is based e.g. on the SIMA concept.
  • the original SIMA system was planned for fixed point to point links.
  • This invention extends the basic SIMA principles to point to multipoint environment.
  • the invention takes into account both the importance of IP packets and the delay requirement of IP packets (QoS) .
  • the invention provides methods for downlink and/or uplink traffic scheduling.
  • a system and/or method for scheduling traffic in a communication system wherein traffic can be transmitted, in the form of packets, to and from a plurality of terminals via a transmission medium such as shared media, comprising a traffic scheduling function or scheduler for scheduling traffic to and/or from one or more terminals.
  • a means or function for centrally determining a required importance level (Ireq) and communicating this required importance level to the terminals or a transmitter entity is provided.
  • the required importance level (Ireq) will be used to decide on accepting or dropping of packets.
  • the terminal When a packet is to be transmitted from a terminal, the terminal preferably compares an importance level included in the packet and the required importance level, and accepts the packet for transmitting if the importance level is greater than the required importance level, whereas, when the importance level of the packet is smaller than the required importance level, the packet is dropped.
  • a queue may be formed for each delay class in the terminal, and each accepted packet can be put in a queue according to delay class information or urgency information included in the packet.
  • Downlink sceduling preferably is a two-stage process where packets are grouped first according to their delay class, selected to the second stage according to delay priority order and grouped into second stage queues according to the destination.
  • the packets in the first stage are preferably "served" or selected in the order of delay classes so that whenever there are packets in the higher delay classes they are served while packets in lower delay classes wait until all packets with higher delay priority are served.
  • the two stage buffer may be provided in a traffic scheduler or in a transmission entity.
  • Uplink packets are preferably arranged into queues by delay class in each terminal (slave).
  • An e.g. central traffic sceduler or scheduling function is informed about the size of different queues on each terminal.
  • Resource is allocated to each terminal preferably based on total amount of traffic in each class.
  • the invention can be implemented in, or using, shared media networks, and is applicable to both wireless and wireline networks.
  • the invention can advatageously be implemented e.g. in PON (passive optical networks), e.g. IEEE 802.16 PMP (point-to-multipoint) , wireless routers and ad hoc mobile networks. Good results are achieved regarding e.g. low packet-loss ratio, delay and bandwidth allocation.
  • the invention provides, in accordance with one of the aspects thereof, a dynamic method for resource allocation when the traffic consists of IP packets with DiffServ -type (DiffServ stands for Differentiated Services) of marking.
  • DiffServ stands for Differentiated Services
  • Fig. 1 shows an embodiment of the present invention illustrating traffic scheduling for uplink and downlink using shared transmission media
  • Fig. 2 illustrates an embodiment of the invention and in particular an implementation of a traffic scheduling system for downlink direction
  • Fig. 3 illustrates an embodiment of the present invention and in particular an implementation of the traffic scheduling at the uplink direction.
  • a traffic scheduler There are two directions to be handled by a traffic scheduler: downlink and uplink as illustrated in Fig. 1. At both directions the task of the traffic scheduler is in principle the same, that is, to divide each transmission cycle among the end terminals.
  • Fig. 1 includes a network node or entity 1 which may be implemented as a base station, base station controller, or transceiving node of a network.
  • the node or entity 1 includes a traffic scheduler (or traffic scheduling function) 2, which cooperates and communicates with an entity 3.
  • the entity 3 is illustrated in Fig. 2 in more detail.
  • Fig. 1 shows the entities 2, 3 to be part of the same entity 1, it is also possible to implement the entities 2, 3 in different devices.
  • the traffic scheduler can be implemented in a base station (or Node B) controller, and entity 3 can be implemented in the base station (or Node B) .
  • Packets for downlink transmission output from entity 3 are transmitted via a transmission network 4, e.g. a radio transmission network, to terminals 5.
  • the transmission network 4 is preferably implemented as shared media.
  • the terminals 5 provide, if necessary, a proper conversion of received packets intended for the respective terminal e.g. into acoustic or optic form for output to respective end users 6.
  • the traffic coming to entity 3 in Fig 1 consists of packets, preferably IP packets, with certain type of traffic marking. Particularly, two types of information are preferably available in each packet:
  • Urgency or delay information indicating the urgency of the packet. This information is related to the delay requirement of the application. The urgency of the packet defines the delay class of the packet.
  • the main use of the importance information contained in a packet is to ensure that if there are not enough resources (in this case through the shared media 4), the most important packets will be transmitted and the least important packets will be discarded.
  • the main use of the urgency information is to ensure that urgent packets are transmitted with as short delay as possible when packets waiting for transportation have different urgency requirements.
  • Urgent packets are not necessarily important, and important packets are not necessarily urgent.
  • the present invention basically offers a solution preferably for a case when (1) either the sources or destinations of packets are different (as illustrated in Fig.l), and/or when (2) the use of the shared resource is more efficient when the packets or cells with the same source or destination are sent consecutively.
  • this invention describes properties e.g. related to shared media.
  • the downlink-direction is easier for the traffic scheduler 2 because the relevant information is available for the traffic scheduler 2 at the same side of shared media 4.
  • Downlink system and traffic scheduling method are described with reference to Fig 2, in particular regarding determination of required importance level, I req .
  • Fig. 2 shows a traffic scheduling system and method for downlink direction.
  • the embodiment shown in Fig. 2 illustrates the structure and functioning of entity 3 of Fig. 1.
  • the entity 3 includes a comparator 21 for comparing an importance level of an input packet to be transmitted to a terminating entity, e.g. terminal 5, and a required importance level I re q- Further, the entity 3 comprises a buffer means which here is implemented as a two-stage buffer means 23, 25 which are connected via a line or element 24.
  • Step 1) The first task is to decide whether or not an incoming packet e.g. input from a packet generator of a sending equipment is accepted to the system. The decision is based on the required importance level of the system (I r eq) and the importance level of the incoming packet (Ii) .
  • Comparator 21 effects this comparison. Comparator 21 receives the incoming packet via a line represented by an arrow at the left side of comparator 21, and checks a parameter or data "importance level Ii" indicated in the packet e.g. in the form of a bit or byte section of the packet reserved for importance indication. Further, the comparator 21 receives data defining or indicating the parameter or value "required importance level (I req ) " as another input indicated in Fig. 2 by a dashed line. The packet is accepted if Ii is equal or greater than I re q (Ii ⁇ Ireq) • When I should be smaller than Ireq (Ii ⁇ Ireq) the packet is dropped as shown at 22 "Dropping decision".
  • Step 2) Accepted packets are transmitted from comparator 21 to the buffer stage 23, and are grouped according to their delay class (in the first buffer stage 23) .
  • the delay class is indicated in each packet and is checked in entity 3 at or before the input of the first buffer stage 23.
  • Each delay class has its own buffer or queue 23 ⁇ to 23 3 which together represent the buffer stage 23.
  • Fig. 2 shows a system with three classes or queues 23 ⁇ to 23 3 , but the number of classes can in principle be any positive integer number (including 1). Most reasonable choices are two or three classes.
  • Step 3) The system, e.g. traffic scheduler 2 shown in Fig. 1, defines the required importance level I req for a next incoming packet based on the utilization level of all buffers 23 ⁇ to 23 3 at the first buffering stage 23.
  • Step 4) The packets in the first stage queues are transmitted to second stage queues 25 ⁇ to 25 of the second buffer stage 25 preferably in a way that just before the start of the each transmission cycle exactly (or essentially) the amount of packets that can served during this cycle is transferred from the first to the second buffer stages 23, 25.
  • the packets are selected for transferral based on priority order of queues 23 x to 23 3 : the queue with the highest (delay) priority is served whenever there are any packets, then the next one and so on.
  • the queue with the lowest delay priority is served only if there are not enough packets in the higher priority queues to fill the cycle.
  • Step 5) The packets are grouped into second stage queues 25 ⁇ to 25 according to their destinations.
  • the amount of data in the second stage queues 25 ⁇ to 25 4 is exactly the amount of data that can be transmitted during a transmission cycle.
  • part of the cycle can be left empty (or filled by insignificant data depending on the system characteristics) .
  • Step 6) Finally, the cycle is filled with the content in the second stage queues, and the data is transmitted to the terminals 5 via the shared media 4.
  • Step 7) In addition it is possible that the exact amount of data that can be transmitted during a cycle is not exactly known beforehand, for instance, because of variable conditions on a radio channel. In this case some packets may have to be retransmitted during the next cycle. This results in a situation in which the capacity of the next cycle shall be decreased.
  • FIG. 3 An embodiment of a function, system and method of the uplink traffic scheduling is shown in Fig. 3.
  • the scheduling for the uplink direction is somewhat more complex because information has to be transferred over the shared media 4.
  • Fig. 3 illustrates the traffic scheduling at the uplink direction.
  • the embodiment of Fig. 3 can be combined with the implementation of Fig. 2 to form an overall system, or can represent an embodiment of the invention, implemented independent of the embodiment of Fig. 2.
  • Each or at least some of the terminals 5 include a comparator 31 and a buffer stage 32 as well as a transmission output 33. The following steps are executed according to the embodiment of Fig. 3.
  • Step 1) When a packet arrives at, or is generated in a terminal 5 (j in Fig. 3) e.g. after conversion of user data such as voice or optical information into packetized traffic, the terminal (comparator 31) checks first whether or not the importance of the packet (Ii) is high enough. Similar to comparator 21 of Fig. 2, comparator 31 receives the incoming packet via a line represented by an arrow at the left side of comparator 31, and checks a parameter or data "importance level Ii" indicated in the packet e.g. in the form of a bit or byte section of the packet reserved for importance indication. Further, the comparator 31 receives data defining or indicating the parameter or value "required importance level (I re q)" as another input indicated in Fig. 3 by a dashed line. A packet is accepted if Ii is equal or greater than I req (Ii > Ir e q) i otherwise it is dropped.
  • Step 3) Each terminal 5 informs a (centralized) traffic scheduler 34 via the (e.g. radio) transmission network, e.g. the shared media 4, about the sizes Bji, Bj 2 ⁇ . ••• of each queue in the terminal 5, that is, the total amount bytes of the packets in each queue of the terminal 5. If there is not any data in any queue, it is not necessary to send any information to the traffic scheduler 34.
  • a traffic scheduler 34 via the (e.g. radio) transmission network, e.g. the shared media 4, about the sizes Bji, Bj 2 ⁇ . ••• of each queue in the terminal 5, that is, the total amount bytes of the packets in each queue of the terminal 5. If there is not any data in any queue, it is not necessary to send any information to the traffic scheduler 34.
  • the traffic scheduler 34 may be implemented as an own traffic scheduler, or may be identical with, and thus implemented in and by the traffic scheduler 2 of Fig. 1.
  • Step 4) The t affic scheduler 34 keeps track of the amount of data in every queue in every terminal based on the information sent by the terminals 5 in step 3) .
  • the required importance level (I req ) is determined based on these total load figures Bi, B 2 , B 3 , Bn, ..
  • I req f(B ⁇ , B 2 , B M ) , preferably in the same manner as in the case of downlink direction (see step 3) in downlink case of Fig. 2).
  • the result (I r eq) is sent to every terminal 5.
  • I req is the same for every terminal independent of the load situation of individual terminals. It is possible that only the changes of I req are sent to the terminals in order to save the resources of link capacity (though usually I re q can be coded by only a small number of bits, e.g. 3 bits).
  • Step 6) The resources given for each terminal (Cj) during each cycle is determined in the order of delay classes, the highest one first, the lowest one last.
  • the algorithm could be as follows: the resource given for delay class k in terminal z is
  • C M * C
  • C k * C k * - ⁇ C jk .
  • C M * C means that the capacity C* M available for the highest delay class is the total capacity C.
  • M is the number of delay classes. In practice the algorithm means that the available capacity for each delay class is calculated recursively starting from the highest class (M) and ending to the lowest class (1) .
  • This algorithm approximately evens out the momentary delay of each class between terminals, because the serving rate is proportional to the size of the queue in the terminal . • For practical purposes it might be necessary to modify this division of resources to fit the size of actual packets. Basically, this is a rounding process.
  • Step 7) Finally the terminal 5 sends packets according to information given by the traffic scheduler 34 in uplink direction e.g. to a base station or node 35.
  • the algorithm may be modified appropriately.
  • the exact implementation in different types of networks may be somewhat differing.
  • the objective of this invention is to provide an overall model for traffic scheduling in all kind of shared media networks.
  • relevant information is transported between the traffic scheduler 34 and terminals 5 (Ireq, Cj from scheduler 34 to terminals 5 and B- j * from terminals 5 to scheduler 34) .
  • I req is a specific parameter.
  • the invention can e.g. be used in case of PON, of IEEE 802.16 PMP, of wireless routers and in ad hoc mobile networks.
  • the invention is applicable in various access networks, both in radio and fixed networks. Particularly the principle of the traffic scheduler 34 at the uplink direction is very helpful, e.g. in case the traffic consists of IP packets and the IP packets contain reliable information about their importance and urgency.

Landscapes

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

Abstract

Cette invention concerne un terminal, un procédé, un système et un ordonnanceur de trafic servant à ordonnancer le trafic dans un système de communication par paquets. Un degré d'importance requis (Ireq) est utilisé pour déterminer si les paquets doivent être acceptés ou abandonnés. Lorsqu'un paquet doit être envoyé depuis un terminal, le terminal compare de préférence le degré d'importance contenu dans le paquet avec le degré d'importance requis. Si le degré d'importance est supérieur au degré d'importance requis, le paquet peut être envoyé, alors que si le degré d'importance du paquet est inférieur au degré d'importance requis, le paquet est abandonné.
PCT/IB2002/003234 2002-08-14 2002-08-14 Systeme et procede d'ordonnancement du trafic pour un reseau a ligne unique Ceased WO2004017576A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
AU2002329527A AU2002329527A1 (en) 2002-08-14 2002-08-14 Traffic scheduling system and method for a shared media network
PCT/IB2002/003234 WO2004017576A1 (fr) 2002-08-14 2002-08-14 Systeme et procede d'ordonnancement du trafic pour un reseau a ligne unique

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/IB2002/003234 WO2004017576A1 (fr) 2002-08-14 2002-08-14 Systeme et procede d'ordonnancement du trafic pour un reseau a ligne unique

Publications (1)

Publication Number Publication Date
WO2004017576A1 true WO2004017576A1 (fr) 2004-02-26

Family

ID=31726504

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/IB2002/003234 Ceased WO2004017576A1 (fr) 2002-08-14 2002-08-14 Systeme et procede d'ordonnancement du trafic pour un reseau a ligne unique

Country Status (2)

Country Link
AU (1) AU2002329527A1 (fr)
WO (1) WO2004017576A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2008113966A1 (fr) 2007-03-19 2008-09-25 Fujitsu Limited Systèmes de communication sans fil
JP2020512783A (ja) * 2017-03-29 2020-04-23 日本電気株式会社 基地局、通信方法およびプログラム

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2001065765A2 (fr) * 2000-02-29 2001-09-07 Celox Networks, Inc. Procede et dispositif servant a distribuer des largeurs de bande
US6421335B1 (en) * 1998-10-26 2002-07-16 Nokia Telecommunications, Oy CDMA communication system and method using priority-based SIMA quality of service class

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6421335B1 (en) * 1998-10-26 2002-07-16 Nokia Telecommunications, Oy CDMA communication system and method using priority-based SIMA quality of service class
WO2001065765A2 (fr) * 2000-02-29 2001-09-07 Celox Networks, Inc. Procede et dispositif servant a distribuer des largeurs de bande

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
"DESIGN FOR A SIMPLE NETWORK MANAGEMENT PROTOCOL SUBAGENT FOR INTERNET FIREWALLS", IBM TECHNICAL DISCLOSURE BULLETIN, IBM CORP. NEW YORK, US, vol. 40, no. 3, 1 March 1997 (1997-03-01), pages 63 - 68, XP000694517, ISSN: 0018-8689 *
KILKKI K: "Simple Integrated Media Acces (SIMA) (URL)", IETF, June 1997 (1997-06-01), pages 1 - 24, XP002239565, Retrieved from the Internet <URL:http://www.inf.puc-rio.br/~thyago/refer/diffserv/draft-kalevi-simple-media-access-01.txt> [retrieved on 20030428] *

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2008113966A1 (fr) 2007-03-19 2008-09-25 Fujitsu Limited Systèmes de communication sans fil
JP2010522452A (ja) * 2007-03-19 2010-07-01 富士通株式会社 無線通信システム
JP2020512783A (ja) * 2017-03-29 2020-04-23 日本電気株式会社 基地局、通信方法およびプログラム

Also Published As

Publication number Publication date
AU2002329527A1 (en) 2004-03-03

Similar Documents

Publication Publication Date Title
CN101828361B (zh) 用于在通信网络系统中调度数据分组的方法和设备
US6850540B1 (en) Packet scheduling in a communications system
KR100754733B1 (ko) 통신 시스템에서 데이터 스케줄링 장치 및 방법
KR101012683B1 (ko) 가변 지연 및 대역폭 조건 하에서 무선 링크를 통한 비디오 패킷
EP1093259B1 (fr) Méthode pour le contrôle des flux
US7532629B2 (en) Multi-hop network for transmission of packets whose size is determined by hop count number
CN100490584C (zh) 基站、无线电通信系统以及通信方法
KR101182175B1 (ko) 무선 베어러에 서비스를 매핑하여 가중치에 따라 무선 베어러에 대역폭을 할당하는 장치 및 방법
US7889743B2 (en) Information dissemination method and system having minimal network bandwidth utilization
CN101018208B (zh) 通信系统中发射机和接收机实体之间的流控制
EP3817487B1 (fr) Planification mac radio basée sur des contraintes de capacité de transport front-haul
EP1343282A1 (fr) Allocation de ressources aux paquets en fonction des qualités de service dans un environnement de communication radio
CN103079281A (zh) 缓冲状态报告(bsr)信息传输的触发的最优化方法
KR20090047739A (ko) 이동 통신 시스템에서 이동 단말의 우선순위 보고 장치 및방법
US20090285229A1 (en) Method for scheduling of packets in tdma channels
US8130713B2 (en) System and method for credit-based channel transmission scheduling (CBCTS)
US20110047271A1 (en) Method and system for allocating resources
CN113038530A (zh) 卫星移动通信系统QoS保障的分组业务高效传输方法
US7139251B1 (en) Scheduling for links having changing parameters
EP2387839B1 (fr) Procédé de transmission de trames dans un réseau maillé, dispositif maillé et réseau maillé associés
WO2004017576A1 (fr) Systeme et procede d&#39;ordonnancement du trafic pour un reseau a ligne unique
Kong et al. A novel scheduling scheme to share dropping ratio while guaranteeing a delay bound in a multicode-CDMA network
Li et al. An extended packet reservation multiple access protocol for wireless multimedia communication
Yang et al. Dynamic scheduling framework on an RLC/MAC layer for general packet radio service
Shanmuganathan et al. Performance measures of wireless protocols for ATM networks

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC 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 MZ NO NZ OM PH PL PT RO RU SD SE SG SI SK SL TJ TM TN TR TT TZ UA UG US UZ VC VN YU ZA ZM ZW

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR IE IT LU MC NL PT SE SK TR BF BJ CF CG CI CM GA GN GQ GW 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
122 Ep: pct application non-entry in european phase
NENP Non-entry into the national phase

Ref country code: JP

WWW Wipo information: withdrawn in national office

Country of ref document: JP