WO2005006672A1 - Dispositif de planification hierarchique - Google Patents

Dispositif de planification hierarchique Download PDF

Info

Publication number
WO2005006672A1
WO2005006672A1 PCT/JP2003/008780 JP0308780W WO2005006672A1 WO 2005006672 A1 WO2005006672 A1 WO 2005006672A1 JP 0308780 W JP0308780 W JP 0308780W WO 2005006672 A1 WO2005006672 A1 WO 2005006672A1
Authority
WO
WIPO (PCT)
Prior art keywords
bucket
queue
count value
unit
packet
Prior art date
Application number
PCT/JP2003/008780
Other languages
English (en)
Japanese (ja)
Inventor
Takanori Ueda
Toshiaki Tomisawa
Yoshihiko Shirokura
Original Assignee
Mitsubishi Denki Kabushiki Kaisha
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 Mitsubishi Denki Kabushiki Kaisha filed Critical Mitsubishi Denki Kabushiki Kaisha
Priority to JP2005503853A priority Critical patent/JP4234134B2/ja
Priority to PCT/JP2003/008780 priority patent/WO2005006672A1/fr
Publication of WO2005006672A1 publication Critical patent/WO2005006672A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/52—Queue scheduling by attributing bandwidth to queues
    • H04L47/522—Dynamic queue service slot or variable bandwidth allocation
    • 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/2441—Traffic characterised by specific attributes, e.g. priority or QoS relying on flow classification, e.g. using integrated services [IntServ]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/62—Queue scheduling characterised by scheduling criteria
    • H04L47/625—Queue scheduling characterised by scheduling criteria for service slots or service orders
    • H04L47/6255—Queue scheduling characterised by scheduling criteria for service slots or service orders queue load conditions, e.g. longest queue first

Definitions

  • the present invention relates to a scheduling method for transmitting a packet such as an asynchronous transfer mode (ATM) or an Internet Protocol (IP) bucket.
  • a packet such as an asynchronous transfer mode (ATM) or an Internet Protocol (IP) bucket.
  • ATM asynchronous transfer mode
  • IP Internet Protocol
  • the present invention relates to a device, and more particularly, to a scheduling device that controls the order in which variable-length packets are transmitted.
  • packet transfer is differentiated according to the characteristics of the service.
  • the scheduling device uses real-time traffic packets, such as voice and video, and real-time traffic, such as browsing the World Wide Web (WWW) and e-mail used on the Internet.
  • WWW World Wide Web
  • Buckets of unrequested services were identified using the priority class indicated by the identifier in the header, and priority control and bandwidth control were realized by changing the transmission order of these buckets.
  • the basis of the Internet is the BestEff0rt type, which handles all packets fairly using the IP (Internet Protocol), that is, a communication service that does not guarantee the quality of service.
  • IP Internet Protocol
  • QOS Quality of Services
  • the ATM scheduling When scheduling is performed on a bucket-by-bucket basis, the distribution of buckets input to the scheduler for each priority class is biased, so that there is a problem that the fairness of each priority class cannot be maintained. To remedy this problem, it is necessary to support variable-length packets, and the scheduling device must perform packet-aware scheduling.
  • a conventional scheduling device that supports a variable packet length includes a packet queue for holding packets, and a scheduling unit having two scheduling queue units. Based on the identifier obtained from the scheduling queue unit, a packet queue that outputs a bucket is selected in an interleaved manner.
  • input packets are classified into classes, for example, a real-time class and a non-real-time class, and a scheduling unit is provided for each of the classified classes, thereby realizing class-based scheduling. , Patent Document 1).
  • the bucket after scheduling and scheduling when processing is performed over a plurality of packet queues, the bucket after scheduling and scheduling must be temporarily stored and re-scheduled.
  • CPS Common Packet Sublayer
  • AAL2 ATM Adaptation Layer 2
  • VCI virtual channel identifier
  • the present invention has been made in view of the above, and has a scheduling device that performs multiplexing with respect to a specific bucket of a plurality of buckets corresponding to variable-length packets and then performs scheduling after multiplexing.
  • the purpose is to get. DISCLOSURE OF THE INVENTION.
  • n (where n is a natural number) first first value register that stores a bucket and has a first count value register that holds a weight count value based on the stored bucket is provided.
  • M (m is a natural number) second packet queue units to be output by shading, and the input buckets to the n second bucket queues based on the identifiers assigned to the externally input buckets.
  • a first bucket input part to be allocated to a part and m first bucket queues; and the n first bucket queue parts and m second buckets.
  • a bucket is selected based on the rotation priority control, and a bucket is obtained according to the first or second count value register of the selected first or second packet queue and the state of the stored bucket.
  • a first queue control unit for changing the weight count value of the first or second count value register of the selected first or second packet queue unit, and the first queue control unit acquires A first bucket generating unit for multiplexing buckets.
  • the first packet input unit identifies the quality class of the packet based on the identifier given to the input packet, and generates n first bucket queue units or m Distribute to the second bucket bucket section.
  • the first queue control unit controls the first or second bucket queue by the rotation priority control.
  • a bucket is selected according to the weight count value of the count value register inside the selected first or second bucket queue section and the state of the stored bucket.
  • the second packet queue unit multiplexes the plurality of accumulated packets to generate one new packet, and the first queue control unit acquires the generated bucket.
  • FIG. 1 is a block diagram showing a configuration of a scheduling device according to the present invention
  • FIG. 2 is a block diagram showing a configuration of a queue control unit shown in FIG. 1
  • FIG. 5 is a flowchart for explaining the operation of the scheduling device.
  • FIG. 1 is a block diagram showing a configuration of a scheduling device according to the present embodiment of the present invention.
  • the scheduling apparatus according to the present embodiment of the present invention includes a packet input unit 111-10 as a first bucket input unit and n (n is a natural number) first bucket queue units 122- :! 1 to 2—n and m (m is a natural number) second packet queue units 15 _ 1 to: 15—m and a queue control unit 13 1, which is the first queue control unit 13 And a bucket generation unit 1411 which is a first bucket generation unit.
  • the bucket input unit 111-110 identifies the quality class of the input bucket based on the identifier assigned to the input bucket, and the first packet queue unit 1 2— :! corresponding to the identified quality class. 11 2 _m, and the second packet queue unit 15-1 to 15-n.
  • Each of the first bucket queue sections 1 2—1 to 1 2—in has a count value register 16—1, which is a first count value register that holds a weight count value. It stores fixed-length or variable-length packets sorted by the packet input unit 111.
  • the second packet queue sections 15-l to 15-n have the same functions.
  • the second packet queue unit 15-1 includes a packet input unit 11 1-1 as a second packet input unit and a first packet queue unit of a ( a is a natural number) which is a third packet queue unit. 1 2—0 1 to 1 2—la; a queue control unit 13—011, which is a second queue control unit; a packet generation unit 14—01, which is a second bucket generation unit; It has a count value register 16-1-01, which is a second count value register.
  • the second bucket queue unit 15-m is composed of a bucket input unit 1 l-m which is a second bucket input unit and a first packet of b (b is a natural number) which is a third packet queue unit.
  • the difference between the second bucket stowing sections 15-0 1 to 15-m is the number of the first bucket stowing sections that each has, but the number of the first bucket stowing sections that each has is the same. It doesn't matter.
  • the function of the second packet queue unit will be described using the second packet queue unit 15-1 as an example.
  • the bucket input unit 111 has the same function as the bucket input unit 110, and the bucket quality is determined based on the identifier assigned to the bucket assigned by the bucket input unit 110. Identify the class and assign it to one of the first bucket queue sections 1 2-0 1 to 1 2-0 a corresponding to the identified quality class.
  • the first packet queue section 12-0 1-: L 2-0 a has the same function as the first packet queue section 12-1-12-m. That is, each of the first packet queues 1 2—0 1 to 1 2—0a has a count value register 16—1 that holds a weight count value, and the packet input unit 1 1—1 1 Stores fixed-length or variable-length packets that have been allocated to them.
  • the queue control unit 1 3 01 1 performs the first packet queue based on the determined order. Part 1 2— Select 0 1 to 1 2 _ 0 m. Then, based on the count value of the selected first packet queue unit count value register 16-1, the bucket accumulated in the selected first packet queue unit is obtained, and the first bucket queue unit is acquired. Set the weight count value for each of 1 2— 0 1 to 1 2— O m.
  • FIG. 2 is a block diagram showing a configuration of the queue control unit 13-01 shown in FIG.
  • the queue control unit 1 3 — 0 1 includes a queue selection unit 13 1, which is a second queue selection unit, a queue selection pointer 13 2, and a weight force value update unit, which is a second weight count value update unit. 13 and a weighting force value resetting unit 134 which is a second weighting force value resetting unit.
  • the order of the first bucket queuing unit selected by the cue selecting unit 13 1 is defined in the cue selection pointer 1 32.
  • the queue selection unit 13 1 selects the first bucket queue unit indicated by the queue selection pointer 13 2. If the value of the count value register of the selected first bucket queuing unit is greater than 0 (positive number), the queue selecting unit 131 acquires the bucket accumulated in the selected first bucket queuing unit, Update (increment) the value of the queue selection pointer 1 32. If the value of the count value register corresponding to the selected first bucket queue unit is smaller than 0 (0 or a negative number), the queue selection unit 1331 increments the value of the queue selection pointer 132 and newly queues. The first bucket queue section indicated by the selection pointer 1 32 is selected. That is, the queue selection unit 13 1 sequentially selects the first bucket queue units 1 2-0 1 to 1 2-0 m according to the round robin set by the queue selection pointer 1 32.
  • the weight value update unit 133 counts the first bucket queue unit. The weight corresponding to the packet length of the packet to be obtained is subtracted from the weight count value in the value register. Then, the subtracted value is set as a new weight count value in the count value register 16-1 of the first packet queue unit for acquiring the bucket.
  • the weight count value update unit 1 3 3 is the queue selection unit 1 3 If 1 cannot obtain the bucket (if no packets are stored in the selected first bucket queue unit), the first packet queue unit count value register 16-1 is selected from the weight count value of the selected first bucket queue unit. The weight corresponding to the maximum packet length of the packet that can be stored in the packet queue is subtracted. Then, the subtracted value is set as the new weight count value in the count value register 16-1 of the first bucket queuing unit selected.
  • the weighting event value resetting section 13 4 sets the count value of all the count value registers 16-1 of the first packet queue section 1 2-0 1 to 1 2-0 a to 0 or a negative number. In this case, the respective weight count values are reset in the count value register 16-1 of the first packet queue unit 1 2—0 1 to 1 2—0a.
  • the weight count value of the resetting is at least the first packet queue part 1 2— 0 1 to 1 2— which fluctuates according to the quality and bandwidth setting for the priority class expected to be input 0 a
  • the specified value that is longer than the maximum bucket length of each packet that can be stored is assigned to the first bucket queue. Part 1 2—0 1 to 1 2—0 Value added to the event value.
  • the packet generation unit 141-101 generates the bucket acquired by the queue control unit 13-01 into one bucket, and outputs the generated bucket.
  • the queue control unit 13-1 has the same function as the queue control unit 13-01-1 shown in FIG. However, the queue selection pointer 13 2 of the queue control unit 13-1 indicates the first bucket queue unit 12 _l to 12-n and the second bucket queue unit 15-1 to 15 _m. is there. Also, the queue selection unit 13 1 of the queue control unit 13-1 is a first queue selection unit, and the weight value update unit 13 3 of the queue control unit 13-1 is a first weight unit. A weight updating unit, and the weighting point value resetting unit 134 of the queue control unit 13-1 is a first weighting point value resetting unit.
  • the bucket generation unit 14-1 has the same function as the packet generation unit 14-0-1 to 14-10m, and generates the packet obtained by the queue control unit 13-1 into one packet. And output the generated bucket.
  • the operation of the scheduling device according to the present embodiment of the present invention will be described. First, the basic operation of acquiring a packet will be described with reference to the flowchart in FIG.
  • the queue control units 13-1, 13-01 to 13_0m initialize the respective queue selection pointers 131 (step S100).
  • the bucket input unit 11-0 identifies the quality class of the bucket based on the identifier assigned to the input bucket, and the first bucket queue unit 12-1 to 12_n and the bucket input corresponding to the identified quality class.
  • Part 1 1 1 1 1 Distributes the input packet to 1 to 11 1 m.
  • the packet input section 11-0 identifies the VCI in the header section of the ATM cell and outputs a multiplexable CPS bucket to the bucket input section 11-1 of the second bucket queue section 15-0.
  • OAM Operaation And Maintenance
  • the packet input units 111-11-111m identify the quality glasses of the bucket based on the identification given to the bucket twisted by the packet input unit 111-10, and correspond to the identified quality class. Distribute the bucket to the first bucket part 12—01 to 12-0 a, 12—ml to l 2—mb.
  • the queue selection unit 131 of the queue control unit 13-1 selects the first bucket queue unit or the second bucket queue unit indicated by the queue selection pointer 132 (step S110). .
  • the queue selection pointer 132 of the queue control unit 13-1 indicates the first bucket queue unit 12-1.
  • the queue selection unit 13 1 of the queue control unit 13-1 selects the first packet queue unit 12-1 and counts the count value register 16-1 in the selected first packet queue unit 12-1. Check the value.
  • the queue control unit 13-1 selects the queue.
  • the selection unit 131 checks whether a bucket is stored in the first bucket queue unit 12-1. If buckets are accumulated in the first packet queue unit 12-1 (step S130, Yes), the weight count value updating unit 133 of the queue selecting unit 13-1 is switched to the first packet queue unit 12-1.
  • the weight corresponding to the packet length of the packet to be obtained is subtracted from the weight count value of the count value register 16-1 (step S140). Then, the subtracted value is set as a new weight count value in the count value register 16-1 of the first bucket queue unit 12-1.
  • the queue selection unit 131 of the queue control unit 13-1 acquires the bucket from the first packet queue unit 12-1 and outputs the acquired packet to the packet generation unit 14-1 (step S150). Then, the cue selection pointer 132 of the cue control unit 13-1 is incremented (step S160).
  • the count value register 16-1 of the selected first bucket queue unit 12-1 has a positive count value (step S120, Yes), and packets are accumulated in the selected first bucket queue unit 12-1. If not (step S130, No), the weight value update unit 133 of the queue control unit 13-1 will calculate the weight count value of the count value register 16-1 of the first packet queue unit 12_1 from the The first bucket queue unit 12-1 subtracts a weight corresponding to the maximum bucket length of a packet that can be stored (step S170). Then, the subtracted value is set as a new weight count value in the count value register 16-1 of the first bucket queue unit 12-1. Further, the queue selection unit 131 of the queue control unit 13-1 increments the queue selection pointer 132 of the queue control unit 13-1 (step S160).
  • step S120, No If the weight count value of the count value register 16-1 of the selected first packet queue unit 12-1 is 0 or a negative number (step S120, No), the queue selection unit 131 of the queue control unit 13-1 , All the first buckets registered in the queue selection pointer 132 12— :! Check the count values of the count value registers 16-1 to 16-0m in the count value registers 16-1 and the second bucket key unit 15-1 to 15-m. First Packet queue part 12— :! To 12—n count value registers 16—1 and the second bucket queue unit 15— :!
  • step S180, No If one or more of the weight count values of 16-Om to 16-Om are positive numbers (step S180, No), the queue selection unit 131 of the queue control unit 13-1 The queue selection pointer 132 of the queue control unit 13-1 is incremented (step S160).
  • the queue selection unit 131 of the queue control unit 13-1 is provided with a count value register 16-1 in all the first bucket queue units 12-1 to 12-n indicated by the queue selection pointer 132 of the queue control unit 13-1. And the second packet queue section 15— :! Until all the weight count values of the 16-m to 15-m count registers 16-01 to 16_0 m become 0 or a negative number, the queue control unit 13-1 displays the queue selection number indicated by the queue selection pointer 132. The bucket bucket unit 1 or the second bucket queue unit is selected, the count value register of the selected first bucket queue unit or the second bucket queue unit is checked, and the operation of acquiring the bucket is repeated (step S11). 0 to step S180).
  • the specified value equal to or larger than the maximum bucket length of the bucket that can be stored in the register is added to the weighted count value of each count value register. Then, the added value is set in each power value register as a new weight power value.
  • the weight count value of the second packet queue unit is The sum of the weight count values of the first bucket queuing unit may be used, or an independent value may be set.
  • the queue selection unit 13 1 of the queue control unit 13-1 checks the weight count value of the count value register 16-01 of the second packet queue unit 15-1.
  • the queue selection unit 13 1 of the queue control unit 13—1 sends the queue control unit 1 of the selected second bucket queue unit 15—1.
  • 3—01 Move the processing to 1.
  • the queue selection unit 131-1 of the queue control unit 13-01 selects the first packet queue unit indicated by the queue selection pointer 1332 of the queue control unit 13-01.
  • the queue selection pointer 13 22 of the queue control unit 13-01-1 points to the first bucket queue unit 12-01.
  • the queue controller 1 3—01 1 queue selector 1 3 1 selects the first packet queue 1 2—0 1 and counts the value in the first packet queue 1 2—0 1 Check the weight value of 16-1.
  • the queue selection unit 13 1 of the queue control unit 13—01 1 Check if buckets are stored in part 1 2—01 1. When buckets are stored in the first bucket queue unit 1 2—01 1, the weight count value updating unit 1 3 3 of the queue selection unit 1 3—0 1 is counted by the first bucket queue unit 1 2—0 1 The weight corresponding to the packet length of the bucket to be obtained is subtracted from the weight count value of the value register 16-1. Then, the subtracted value is set as a new weight count value in the count-in direct register 16-1 of the first bucket queue unit 12-01.
  • the queue selection unit 13 1 of the queue control unit 13 3-0 1 obtains a bucket from the first packet queue unit 12-01, and converts the obtained bucket into a bucket generation unit 14 4-0. 1 and increments the queue selection pointer 1 3 2 of the queue control unit 1 3 — 0 1 to the first packet queue indicated by the queue selection pointer 1 3 2 of the queue control unit 1 3 — 0 1. Select a department. Then, the queue control unit 13-01 obtains a bucket based on the weight value of the selected count value register of the first packet queue unit and the presence / absence of a bucket of the selected first bucket queue unit.
  • the operation is performed as follows: the packet stored in the first bucket queue unit 1 2—0 1 to 1 2—0 a disappears, and the packet generation unit 14 1 0 1 exits from the queue control unit 13 3 0 1 Repeat until multiplexing of the input packets cannot be performed. That is, the queue control unit 13-01, when the process is shifted from the queue control unit 13-1, to the first bucket queue indicated by the queue selection pointer 1332 of the queue control unit 13-01. A packet is obtained by selecting a packet by round robin and a packet is generated by the packet generation unit 1410 1 by multiplexing the obtained packet. Then, when one packet is generated, the queue control unit 13-01 transfers the processing to the queue control unit 13-1.
  • the queue control unit 13-1 acquires the bucket generated by the packet generation unit 14-0 1 of the second packet queue unit 15-0, and outputs it to the bucket generation unit 14-1, Increment the cue selection pointer 1 32 of the cue control unit 13-1. Then, the first bucket queue unit or the second bucket queue unit indicated by the queue selection pointer 132 is selected.
  • the first packet input unit identifies the quality class of the bucket based on the identifier given to the input bucket, and ri first quality classes for each quality class.
  • the first queue control unit selects the first or second packet queue unit by the rotation priority control, and stores the weight count value of the selected weight value register in the first or second bucket queue unit and the accumulated count value. Get a bucket according to the state of the bucket.
  • the second packet queue unit multiplexes the plurality of stored packets to generate a new bucket, and stores the generated bucket in the first queue. Since the control unit obtains it, it can flexibly respond to packets with different attributes, and buckets with specific attributes can be multiplexed and treated as one new packet .
  • the first queue selecting unit may select a positive count value of the count value register of the first packet queue unit or the second count register of the second bucket queue unit selected by the rotation priority control, and When a bucket is accumulated in the first or second packet queue unit, the bucket is acquired, the first weight count value updating unit acquires the first packet, and the first queue count updating unit acquires the bucket.
  • Bucket queue Set the value obtained by subtracting the bucket length value of the acquired packet from the weight count value of some first count value registers or the second count value register of the second bucket queue unit as a new weight count value. However, if the first queue selection unit fails to obtain a bucket, the maximum number of packets that can be stored by the selected first or second packet queue unit.
  • the first weight count value setting unit may include, for each weight count value of the first count value register of each first packet queue unit and the second count value register of each second packet queue unit, Because a value that is equal to or greater than the maximum packet length of a bucket that fluctuates according to quality and / or is added, and the added value is set as a new weight count value in each of the first and second count value registers. Therefore, it is possible to flexibly change the settings and use the bandwidth efficiently.
  • the second packet queue unit stores a plurality of third packet queue units having a third count value register for storing a packet and storing a weight count value based on the bucket to be stored, and a first packet queue unit.
  • a second bucket input unit for allocating a packet input based on an identifier given to a packet input from the packet input unit to a plurality of third packet queue units; and the plurality of third packets.
  • the packet queue is selected based on the rotation priority control, and a packet is obtained based on the third count value register of the selected third packet queue unit and the state of the stored packet.
  • a second queue control unit for changing the weight value of the third count value register of the selected third packet queue unit; and a second queue control unit for multiplexing the bucket acquired by the second queue control unit. Since the two bucket generation units are provided, it is possible to execute scheduling in multiple stages for packets having different genera- tions and efficiently perform processing across a plurality of packet queues. Industrial applicability
  • the scheduling device is useful when controlling the order of transmitting variable-length packets such as ATMs and IP packets, and in particular, multiplexes input packets to create a new packet. Suitable for scheduling buckets that need to be sent out as one bucket.

Landscapes

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

Abstract

Selon l'invention, une première section d'entrée de paquets distribue des paquets à une première ou à une seconde section de file d'attente de paquets en fonction d'un identifiant affecté à chaque paquet entré depuis l'extérieur. Un premier contrôleur de file d'attente sélectionne la première et la seconde section de file d'attente de paquets en fonction de la commande de priorité de rotation, saisit un paquet en fonction d'un premier ou d'un second registre de valeurs de comptage de la première ou de la seconde section de file d'attente de paquets sélectionnée et de l'état des paquets accumulés, et modifie la valeur de comptage pondérée du premier ou du second registre de valeurs de comptage de la première ou de la seconde section de file d'attente de paquets sélectionnée. Une première génération de paquets effectue le multiplexage des paquets saisis par le premier contrôleur de file d'attente.
PCT/JP2003/008780 2003-07-10 2003-07-10 Dispositif de planification hierarchique WO2005006672A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
JP2005503853A JP4234134B2 (ja) 2003-07-10 2003-07-10 階層型スケジューリング装置
PCT/JP2003/008780 WO2005006672A1 (fr) 2003-07-10 2003-07-10 Dispositif de planification hierarchique

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/JP2003/008780 WO2005006672A1 (fr) 2003-07-10 2003-07-10 Dispositif de planification hierarchique

Publications (1)

Publication Number Publication Date
WO2005006672A1 true WO2005006672A1 (fr) 2005-01-20

Family

ID=34044609

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2003/008780 WO2005006672A1 (fr) 2003-07-10 2003-07-10 Dispositif de planification hierarchique

Country Status (2)

Country Link
JP (1) JP4234134B2 (fr)
WO (1) WO2005006672A1 (fr)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2008236265A (ja) * 2007-03-19 2008-10-02 Fujitsu Ltd 通信装置および出力制御方法
JP2009290633A (ja) * 2008-05-30 2009-12-10 Fujitsu Ltd データ出力装置および通信装置ならびにスイッチ装置
CN104243349A (zh) * 2013-06-21 2014-12-24 中兴通讯股份有限公司 报文调度方法和装置
CN106817317A (zh) * 2013-07-09 2017-06-09 英特尔公司 具有入口控制的业务量管理

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH09149051A (ja) * 1995-09-18 1997-06-06 Toshiba Corp パケット転送装置
JPH1084383A (ja) * 1996-09-10 1998-03-31 Toshiba Corp パケットスケジューリング装置及びパケット転送方法

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH09149051A (ja) * 1995-09-18 1997-06-06 Toshiba Corp パケット転送装置
JPH1084383A (ja) * 1996-09-10 1998-03-31 Toshiba Corp パケットスケジューリング装置及びパケット転送方法

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2008236265A (ja) * 2007-03-19 2008-10-02 Fujitsu Ltd 通信装置および出力制御方法
JP2009290633A (ja) * 2008-05-30 2009-12-10 Fujitsu Ltd データ出力装置および通信装置ならびにスイッチ装置
CN104243349A (zh) * 2013-06-21 2014-12-24 中兴通讯股份有限公司 报文调度方法和装置
CN104243349B (zh) * 2013-06-21 2018-05-04 中兴通讯股份有限公司 报文调度方法和装置
CN106817317A (zh) * 2013-07-09 2017-06-09 英特尔公司 具有入口控制的业务量管理
CN106817317B (zh) * 2013-07-09 2020-04-10 英特尔公司 具有入口控制的业务量管理

Also Published As

Publication number Publication date
JPWO2005006672A1 (ja) 2006-08-31
JP4234134B2 (ja) 2009-03-04

Similar Documents

Publication Publication Date Title
US6222858B1 (en) Method of inverse multiplexing for ATM
JP3434642B2 (ja) パケットスケジューリング装置
EP0763915B1 (fr) Dispositif et méthode de transfert de paquets, appropriés pour un grand nombre de portes d'entrée
JP3953819B2 (ja) スケジューリング装置およびスケジューリング方法
US7023866B2 (en) Fair queue servicing using dynamic weights (DWFQ)
JP3435293B2 (ja) パケットスケジューリング装置及びパケット転送方法
US6438135B1 (en) Dynamic weighted round robin queuing
US7023856B1 (en) Method and system for providing differentiated service on a per virtual circuit basis within a packet-based switch/router
KR20030045987A (ko) 크레딧 기반 라운드 로빈을 이용한 패킷 스케쥴링장치 및방법
JP3673025B2 (ja) パケット転送装置
US6246687B1 (en) Network switching system supporting guaranteed data rates
WO2005006672A1 (fr) Dispositif de planification hierarchique
JP3906231B2 (ja) パケット転送装置
US8467401B1 (en) Scheduling variable length packets
JP3783628B2 (ja) 通信システムにおけるノード装置及びその動作制御方法
US7315901B1 (en) Method and system for network processor scheduling outputs using disconnect/reconnect flow queues
Shi et al. DS-PPS: A practical framework to guarantee differentiated QoS in terabit routers with parallel packet switch
US6377547B1 (en) Quality of service-oriented cell disc discarding
JPH11252097A (ja) パケット送出装置及びパケット送出方法
Chlamtac et al. A counter based congestion control (CBC) for ATM networks
KR100334319B1 (ko) 에이에이엘 2 에이티엠 셀 생성 장치 및 방법
KR100523482B1 (ko) 다양한 서비스의 지연요구조건을 보장하는 ａａｌ2 ａｔｍ전송장치 및 방법과 그를 이용한 패킷 전송방법
Yen et al. A novel sliding weighted fair queueing scheme for multimedia transmission
Wu Link-sharing method for ABR/UBR services in ATM networks
KR100290191B1 (ko) 상대에러방식을이용하는흐름레이트에기초한스케줄링방법및장치

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): CN JP US

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LU MC NL PT RO SE SI SK TR

121 Ep: the epo has been informed by wipo that ep was designated in this application
WWE Wipo information: entry into national phase

Ref document number: 2005503853

Country of ref document: JP

122 Ep: pct application non-entry in european phase