US7839863B2 - Method and equipment for performing aggregate-portion-specific flow shaping in packet-switched telecommunications - Google Patents
Method and equipment for performing aggregate-portion-specific flow shaping in packet-switched telecommunications Download PDFInfo
- Publication number
- US7839863B2 US7839863B2 US10/575,710 US57571004A US7839863B2 US 7839863 B2 US7839863 B2 US 7839863B2 US 57571004 A US57571004 A US 57571004A US 7839863 B2 US7839863 B2 US 7839863B2
- Authority
- US
- United States
- Prior art keywords
- shaping
- packet
- group
- groups
- forwarded
- 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.)
- Active, expires
Links
Images
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/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/10—Flow control; Congestion control
-
- 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/22—Traffic shaping
-
- 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/41—Flow control; Congestion control by acting on aggregated flows or links
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/50—Reducing energy consumption in communication networks in wire-line communication networks, e.g. low power modes or reduced link rate
Definitions
- the present invention relates to a method, according to claim 1 , for performing aggregate-portion-specific flow shaping in packet-switched telecommunications.
- the invention also relates to equipment, according to claim 3 , for performing aggregate-portion-specific flow shaping formation in packet-switched telecommunications.
- a speed property can refer, for example, to the mean traffic speed (CIR), the size of the burst (CBS) by which the mean speed can be momentarily exceeded, or the momentary speed (PIR).
- the traffic flow can consist of, for example, packets to be routed to a specific transfer link, packets sent by a specific end-user, which have a specific source address, or packets to be routed to a specific transfer link, which have a specific service class.
- an individual traffic flow consists of packets, which are directed to a specific queue, in the order of their entry to the system, FIGS. 1 , 2 , 3 , and 4 .
- FIG. 1 shows one way, according to the prior art, of monitoring and limiting the speed properties of a traffic flow.
- speed properties is used to include mean speed (CIR [bit/s]), burst size (CBS [bit]), by which the mean speed can be exceeded temporarily, and momentary speed (PIR [bit/s]).
- CIR mean speed
- CBS burst size
- PIR momentary speed
- VTS_CIR gives the earliest permitted moment in time, when the next packet can be begun to be transferred past MP, in order not to exceed the CIR or the CBS restrictions.
- VTS_PIR gives the earliest permitted moment in time, when the next packet can be begun to be transferred past MP, in order not to exceed the PIR restriction.
- the equations 1 and 2 show the principle generally used for calculating the VST_CIR and the VTS_PIR values.
- VTS earliest permitted moment
- shaping a system, by means of which the speed properties of the traffic flow can be monitored and limited, will be referred to as a ‘shaper’ (SH) while the operation, in which the speed properties of the traffic flow are monitored and limited, will be referred to as ‘shaping’.
- An essential part of shaping is a buffer memory, in which it is possible to store the packets, which, due to speed restrictions, cannot be forwarded (i.e. past point MP) immediately after they have arrived in the system. If it is wished to ensure that shaping does not alter the transfer sequence of the packets, FIFO (first in-first out) queue discipline is applied in the buffer memory, as in FIG. 1 .
- FIG. 2 shows a system according to the prior art for implementing the shaping of several parallel traffic flows V 1 , . . . , V 5 , in a situation, in which the flows in question are alternated (multiplexed) to form a single aggregate flow Va. Multiplexing can take place by applying, for example, the SFQ (Start-time Fair Queuing [1]) method.
- the speed properties of a portion formed of packets representing individual traffic flows (V 1 , . . . , or V 5 ) in an aggregate flow Va can be monitored and limited. Measurement points (MP1, MP5) relating to the multiplexed traffic flows (V 1 , . . .
- V 5 are all at the same location in the output of the multiplexer.
- VTSi when calculating the earliest permitted transfer moment VTSi, only packets representing the traffic flow Vi are taken into account.
- the earliest permitted transfer moment VTSi can be calculated for a multiplexed traffic flow Vi, for example, as shown in equations 1, 2, and 3.
- aggregate-portion-specific shaping is performed, but with the limitation that, when examined in terms of shaping, the aggregate portions always consist of traffic representing only a single incoming traffic flow V 1 , V 2 , V 3 , V 4 , or V 5 .
- FIG. 3 shows a system according to the prior art for implementing shaping corresponding to the example situation described above.
- the traffic flows V 1 and V 2 are multiplexed to form the traffic flow V 1 a and the shaper SH 1 a performs shaping resulting in the traffic flow V 1 b .
- the traffic flows V 2 and V 3 are multiplexed to form the traffic flow V 2 a and the shaper SH 2 a performs shaping resulting in the traffic flow V 2 b .
- the traffic flows V 1 b , V 2 b , and V 5 are multiplexed to form the traffic flow V 3 a while the shaper SH 3 a performs shaping resulting in the traffic flow V 3 b.
- the logical topology of the multiplexing and shaping system depends on how the traffic flows arriving in the system are bundled into different shaping groups.
- the system shown in FIG. 3 is only responsible for bundling individual examples of the traffic flows into different shaping groups.
- the topology is arbitrary. This hampers the implementation of the shaping system.
- the circuit implementation e.g., using an ASIC (Application Specific Integrated Circuit) microcircuit
- the software implementation is also challenging.
- the present invention is intended to eliminate the defects of the prior art disclosed above and for this purpose create an entirely new type of method and equipment for performing shaping in packet-switched telecommunications.
- the aim of the invention is a method and system for performing shaping in such a way as to avoid the aforementioned problems relating to the prior art.
- the method according to the invention comprises:
- the system according to the invention comprises:
- FIG. 1 shows a block diagram of one way according to the prior art of monitoring and limiting the speed properties of a traffic flow.
- FIG. 2 shows a block diagram of a system according to the prior art for implementing the monitoring and limiting of the speed properties of several parallel traffic flows V 1 , . . . , V 5 , in a situation in which the flows in question are alternated (multiplexed) to form a single aggregate flow Va.
- FIG. 3 shows a block diagram of a system according to the prior art concerning an example of a situation, in which it is wished to perform shaping, in such a way that it is possible to monitor and limit the speed properties in an aggregate flow of a portion formed of packets representing the traffic flows V 1 and V 2 , it is possible to monitor and limit the speed properties in an aggregate flow of a portion formed on packets representing the traffic flows V 3 and V 4 , and, in addition, it is possible to monitor and limit the speed properties of the aggregate flow V 3 .
- FIG. 4 shows a block diagram of a system according to the invention for performing shaping, in such a way that the traffic flows arriving at the system can belong to shaping groups in an arbitrary manner and the speed properties of the aggregate portion formed of packets representing an arbitrary shaping group can be monitored and limited (aggregate-portion-specific shaping).
- the central concept is a shaping group, i.e. an aggregate portion.
- the shaping group consists of the incoming traffic flows, the speed properties of the portion of the aggregate flow formed of packets representing which are monitored and limited using a restriction totality of specific speed properties (such as a totality formed of the CIR, PIR, and CBS values).
- the VTS value is shaping-group-specific.
- the VTS value of a specific shaping group thus expresses the earliest permitted moment in time, at which a packet representing the relevant shaping group can be forwarded (first bit past the measurement point), in order that a rule set for even one speed property (e.g., CIR) of the relevant shaping ⁇ group ⁇ will not be broken.
- the measurement point too is logically shaping-group-specific.
- the measurement points of all the shaping groups k are at the same location.
- the measurement points MP of one or more shaping groups k are located separately.
- the following examination is restricted to a situation, in which the measurement points MP of all of the shaping groups are at the same location. It is then possible to refer simply to the measurement point, instead of to the measurement point relating to a specific shaping group.
- An individual traffic flow can belong to one, several, or no shaping group k. If the traffic flow does not belong to even one shaping group k, the shaping equipment naturally will not set any limit to the speed properties of the traffic flow in question.
- VTS — pk max(VTSk, packet belongs under shaping group k ), (4) in which VTS_pk is the earliest moment in time, after which the packet can be forwarded (first bit past the measurement point), in order that not even one rule set for the speed properties associated with any shaping group concerning the packet will be broken, and VTSk is the VTS value of the shaping group k.
- the packet being examined is the packet closest to the multiplexer (i.e. at the head of the queue) of some FIFO queue.
- the packet is offered to the multiplexer 10 , and if the multiplexer 10 selects the packet in question, the packet is then moved immediately past the measurement point.
- VTSpk states the earliest moment in time, at which the packet is permitted to be offered to the multiplexer. For this reason, in FIG. 4 , the permit/refuse operations of the transfer of the packet are set between the FIFO queues I-L and the multiplexer 10 .
- the VTS values of all the shaping groups, under which the packet in question belongs are updated. If the restrictions of the speed properties of the shaping group are expressed in the form CIR, PIR, CBS, the VTS values can be updated, for example, as shown in equations 1, 2, and 3.
- the method according to the invention places no restrictions on how the traffic flows entering the system can be grouped into different shaping groups.
- the measurement points of all the shaping groups according to FIG. 4 it is possible to monitor and limit the speed properties of an aggregate portion formed on packets representing an arbitrary shaping group.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
Description
- CBS Committed Burst Size (greatest permitted burst size [bit]), when exceeding the committed information flow,
- CIR Committed Information Rate (greatest permitted mean traffic speed [bit/s]),
- FIFO First In, First Out discipline,
- MP Measuring Point, in which the speed characteristics of the traffic flow are measured (e.g., mean traffic speed, momentary traffic speed, bust size),
- PIR Peak Information Rate (greatest permitted momentary traffic speed [bit/s]),
- PKS Packet size in bits,
- V1, V2, . . . .
Traffic flow - VTS The earliest moment in time, after which the next packet representing a specific traffic flow, or shaping group may be forwarded, in order that not even one rule set for a speed property of the traffic flow or shaping group in question will be broken (Valid Time to Send),
- VTSi The earliest moment in time, after which the next packet representing the traffic flow i may be forwarded, in order that not even one rule set for a speed property of the flow in question will be broken,
- VTSk The earliest moment in time, after which the next packet representing the shaping group k may be forwarded, in order that not even one rule set for a speed property of the shaping group in question will be broken,
- VTS_pk The earliest moment in time, after which a packet may be forwarded, in order that not even one rule set for a speed property dealing with any shaping group associated with the packet will be broken (Valid Time to Send),
- VTS_CIR The earliest moment in time, after which the next packet representing a specific traffic flow, or shaping group may be forwarded, in order that the greatest permitted mean speed and/or the greatest permitted burst size will not be exceeded,
- VTS_PER The earliest moment in time, after which the next packet representing a specific traffic flow, or shaping group may be forwarded, in order that the greatest permitted momentary speed will not be exceeded.
VTS_CIRnext=max(t-CBS/CIR,VTS_CIRprev)+PKS/CIR, (1)
and
VRS_PIRnext=max(t,VTS_PIRprev)+PKSprev/PIR, (2)
in which t is the time, PKS is the size of the packet in bits, the sub-index ‘next’ refers to the next packet and the sub-index ‘prev’ prefers the packet the first bit of which is transferred past point MP at the moment t.
VTS=max(VTS_CIR,VTS_PIR). (3)
-
- transferring digital information as constant or variable-length packets to a buffer memory as at least two separate traffic flows, the traffic flows forming an aggregate flow,
- defining at least one shaping group, each shaping group being a portion of the aggregate flow and including at least one of the traffic flows, and at least one of the shaping groups including at least two of the traffic flows,
- setting restrictions of speed properties for at least two shaping groups,
- defining an earliest permitted moment, at which a packet can be forwarded, as a greatest value of Valid Time to Send-values of the at least two shaping groups, to which a traffic flow represented by the packet to be forwarded belongs, and
- as a result of forwarding the packet, updating the Valid Time to Send-values of the same shaping groups to which the forwarded packet belongs, a Valid Time to Send-value of each shaping group expressing an earliest permitted moment, at which a packet belonging under that shaping group can be forwarded without breaking restrictions of speed properties of that shaping group.
-
- means for receiving constant or variable-length packets carrying digital information,
- a controller configured to
- classify a packet arriving in the equipment as representing one of traffic flows arriving in the system, the traffic flows forming an aggregate flow,
- define at least two shaping groups, each shaping group being a portion of the aggregate flow and including at least one of the traffic flows, and at least one of the shaping groups including at least two of the traffic flows, and
- set restrictions of speed properties for the at least two shaping groups,
- means for forwarding the packets to an outgoing link or links,
- the controller being configured to:
- define an earliest permitted moment, at which a packet can be forwarded, as a greatest value of Valid Time to Send-values of those at least two shaping groups, to which a traffic flow represented by the packet to be forwarded belongs, and
- update, as a response to forwarding the packet, the Valid Time to Send-values of the same shaping groups to which the forwarded packet belongs, a Valid Time to Send-value of each shaping group expressing an earliest permitted moment, at which a packet under that shaping group can be forwarded without breaking restrictions of speed properties of that shaping group.
VTS— pk=max(VTSk, packet belongs under shaping group k), (4)
in which VTS_pk is the earliest moment in time, after which the packet can be forwarded (first bit past the measurement point), in order that not even one rule set for the speed properties associated with any shaping group concerning the packet will be broken, and VTSk is the VTS value of the shaping group k.
- Situation: Packet (first bit) passes measurement point.
- Operations: Update all VTS values of the shaping groups, under which the packet in question belongs.
- Situation: Determine earliest permitted moment, at which the packet can pass the measurement point.
- Operations: Seek maximum of the VTS values of the shaping groups, under which the packet in question belongs.
- [1] Pawan Goyal, Harric M. Vin, Haichen Cheng. Start-time Fair Queuing: A Scheduling Algorithm for Integrated Services Packet Switching Networks. Technical Report TR-96-02, Department of Computer Sciences, University of Texas Austin.
Claims (4)
Applications Claiming Priority (5)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
FI20031502 | 2003-10-14 | ||
FI20031502A FI20031502A0 (en) | 2003-10-14 | 2003-10-14 | Method and apparatus for performing aggregate flow modulation in packet switched communication |
FI20031525 | 2003-10-17 | ||
FI20031525A FI114599B (en) | 2003-10-14 | 2003-10-17 | Aggregate-portion-specific flow shaping in packed-switched communication, involves defining earliest permitted moment at which packet is forwarded, as greatest value of valid time to spend values of all shaping groups |
PCT/FI2004/000611 WO2005039123A1 (en) | 2003-10-14 | 2004-10-13 | Method and equipment for performing aggregate-portion-specific flow shaping in packet-switched telecommunications |
Publications (2)
Publication Number | Publication Date |
---|---|
US20070076609A1 US20070076609A1 (en) | 2007-04-05 |
US7839863B2 true US7839863B2 (en) | 2010-11-23 |
Family
ID=29252356
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US10/575,710 Active 2026-07-31 US7839863B2 (en) | 2003-10-14 | 2004-10-13 | Method and equipment for performing aggregate-portion-specific flow shaping in packet-switched telecommunications |
Country Status (5)
Country | Link |
---|---|
US (1) | US7839863B2 (en) |
EP (1) | EP1673905B1 (en) |
DE (1) | DE602004030596D1 (en) |
FI (1) | FI114599B (en) |
WO (1) | WO2005039123A1 (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US11516151B2 (en) | 2019-12-31 | 2022-11-29 | Infinera Oy | Dynamically switching queueing systems for network switches |
Families Citing this family (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
FI123302B (en) | 2008-04-22 | 2013-02-15 | Tellabs Oy | Method and equipment for processing the transmission speed of a data traffic flow |
Citations (14)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP1111851A2 (en) | 1999-12-22 | 2001-06-27 | Alcatel USA Sourcing, L.P. | A scheduler system for scheduling the distribution of ATM cells |
EP1124356A2 (en) | 2000-02-08 | 2001-08-16 | Lucent Technologies Inc. | Guaranteeing types of service in a packet-based system |
CA2366781A1 (en) | 2001-01-10 | 2002-07-10 | Lucent Technologies Inc. | Method and apparatus for hierarchical bandwidth distribution in a packet network |
EP1227624A2 (en) | 2000-12-28 | 2002-07-31 | Alcatel USA Sourcing, L.P. | Qos monitoring system and method for a high-speed diffserv-capable network element |
WO2002063837A1 (en) | 2001-02-07 | 2002-08-15 | Telefonaktiebolaget Lm Ericsson (Publ) | Arrangement and method relating to traffic control |
US6532213B1 (en) | 1998-05-15 | 2003-03-11 | Agere Systems Inc. | Guaranteeing data transfer delays in data packet networks using earliest deadline first packet schedulers |
US6549514B1 (en) | 1998-07-07 | 2003-04-15 | Nokia Corporation | Method and apparatus for shaping traffice for a SIMA network |
US20030099200A1 (en) | 2001-11-27 | 2003-05-29 | Amplify.Net, Inc. | Parallel limit checking in a hierarchical network for bandwidth management traffic-shaping cell |
US20030165116A1 (en) | 2002-03-01 | 2003-09-04 | Fallon Michael F. | Traffic shaping procedure for variable-size data units |
EP1345365A2 (en) | 2002-03-15 | 2003-09-17 | Broadcom Corporation | Weighted fair queuing (WFQ) shaper |
US20040066743A1 (en) * | 1998-12-15 | 2004-04-08 | Kabushiki Kaisha Toshiba | Packet switch and packet switching method using priority control based on congestion status within packet switch |
US20040100967A1 (en) * | 2002-09-04 | 2004-05-27 | Robotham Robert E. | System and method for scheduling data traffic flows for a communication device |
US20090010262A1 (en) * | 2000-01-26 | 2009-01-08 | Hitachi, Ltd. | Network routing apparatus |
US20090116489A1 (en) * | 2007-10-03 | 2009-05-07 | William Turner Hanks | Method and apparatus to reduce data loss within a link-aggregating and resequencing broadband transceiver |
-
2003
- 2003-10-17 FI FI20031525A patent/FI114599B/en not_active IP Right Cessation
-
2004
- 2004-10-13 US US10/575,710 patent/US7839863B2/en active Active
- 2004-10-13 WO PCT/FI2004/000611 patent/WO2005039123A1/en active Search and Examination
- 2004-10-13 DE DE602004030596T patent/DE602004030596D1/en not_active Expired - Lifetime
- 2004-10-13 EP EP04767125A patent/EP1673905B1/en not_active Expired - Lifetime
Patent Citations (14)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6532213B1 (en) | 1998-05-15 | 2003-03-11 | Agere Systems Inc. | Guaranteeing data transfer delays in data packet networks using earliest deadline first packet schedulers |
US6549514B1 (en) | 1998-07-07 | 2003-04-15 | Nokia Corporation | Method and apparatus for shaping traffice for a SIMA network |
US20040066743A1 (en) * | 1998-12-15 | 2004-04-08 | Kabushiki Kaisha Toshiba | Packet switch and packet switching method using priority control based on congestion status within packet switch |
EP1111851A2 (en) | 1999-12-22 | 2001-06-27 | Alcatel USA Sourcing, L.P. | A scheduler system for scheduling the distribution of ATM cells |
US20090010262A1 (en) * | 2000-01-26 | 2009-01-08 | Hitachi, Ltd. | Network routing apparatus |
EP1124356A2 (en) | 2000-02-08 | 2001-08-16 | Lucent Technologies Inc. | Guaranteeing types of service in a packet-based system |
EP1227624A2 (en) | 2000-12-28 | 2002-07-31 | Alcatel USA Sourcing, L.P. | Qos monitoring system and method for a high-speed diffserv-capable network element |
CA2366781A1 (en) | 2001-01-10 | 2002-07-10 | Lucent Technologies Inc. | Method and apparatus for hierarchical bandwidth distribution in a packet network |
WO2002063837A1 (en) | 2001-02-07 | 2002-08-15 | Telefonaktiebolaget Lm Ericsson (Publ) | Arrangement and method relating to traffic control |
US20030099200A1 (en) | 2001-11-27 | 2003-05-29 | Amplify.Net, Inc. | Parallel limit checking in a hierarchical network for bandwidth management traffic-shaping cell |
US20030165116A1 (en) | 2002-03-01 | 2003-09-04 | Fallon Michael F. | Traffic shaping procedure for variable-size data units |
EP1345365A2 (en) | 2002-03-15 | 2003-09-17 | Broadcom Corporation | Weighted fair queuing (WFQ) shaper |
US20040100967A1 (en) * | 2002-09-04 | 2004-05-27 | Robotham Robert E. | System and method for scheduling data traffic flows for a communication device |
US20090116489A1 (en) * | 2007-10-03 | 2009-05-07 | William Turner Hanks | Method and apparatus to reduce data loss within a link-aggregating and resequencing broadband transceiver |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US11516151B2 (en) | 2019-12-31 | 2022-11-29 | Infinera Oy | Dynamically switching queueing systems for network switches |
Also Published As
Publication number | Publication date |
---|---|
EP1673905B1 (en) | 2010-12-15 |
EP1673905A1 (en) | 2006-06-28 |
FI114599B (en) | 2004-11-15 |
WO2005039123A1 (en) | 2005-04-28 |
DE602004030596D1 (en) | 2011-01-27 |
US20070076609A1 (en) | 2007-04-05 |
FI20031525A0 (en) | 2003-10-17 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US9025450B2 (en) | Method and equipment for performing flow shaping that maintains service quality in packet-switched telecommunications | |
CN109479032B (en) | Congestion avoidance in network devices | |
US7621162B2 (en) | Hierarchical flow-characterizing multiplexor | |
US8897315B1 (en) | Fabric traffic management in a network device | |
US7307949B1 (en) | Hierarchical policers for enforcing differentiated traffic behavior | |
CN108040019B (en) | Message forwarding method and device | |
US6771601B1 (en) | Network switch having source port queuing and methods, systems and computer program products for flow level congestion control suitable for use with a network switch having source port queuing | |
US7631096B1 (en) | Real-time bandwidth provisioning in a switching device | |
CA2358284A1 (en) | Method and system for traffic management in packet networks using random early marking | |
CN112866134A (en) | Method for sending message, first network equipment and computer readable storage medium | |
Klepec et al. | Performance of VoIP applications in a simple differentiated services network architecture | |
US7839863B2 (en) | Method and equipment for performing aggregate-portion-specific flow shaping in packet-switched telecommunications | |
CN101465794B (en) | Method and apparatus for scheduling packet | |
WO2002015499A3 (en) | Apparatus and method for controlling queuing of data at a node on a network | |
Gusat et al. | Extended ethernet congestion management (e2cm): Per path ecm-a hybrid proposal | |
KR100739492B1 (en) | Quality of service management device for ip network and method thereof | |
EP2182685B1 (en) | Method for splitting a multiplex packet stream and corresponding splitting system | |
CN100574262C (en) | The set of the part of the given traffic streams in the packet-switched telecommunications is carried out the method and apparatus of shaping | |
KR101093500B1 (en) | Real-time scheduling device for flow class based on reservation / registration and its method | |
KR20090060108A (en) | Packet scheduling apparatus and method | |
JPH08130543A (en) | Virtual channel multiplexing device | |
Yurcik et al. | Local quality of service provisioning to meet end-to-end requirements in ATM networks | |
JP3132719B2 (en) | Usage parameter control circuit | |
JP2005101852A (en) | Frame control device | |
JP2001203751A (en) | Node device and message impartiality guaranteeing method used for the same |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: TELLABS OY, FINLAND Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:VAANANEN, JANNE;REEL/FRAME:017803/0570 Effective date: 20060328 |
|
STCF | Information on status: patent grant |
Free format text: PATENTED CASE |
|
FEPP | Fee payment procedure |
Free format text: PAYOR NUMBER ASSIGNED (ORIGINAL EVENT CODE: ASPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY |
|
FPAY | Fee payment |
Year of fee payment: 4 |
|
AS | Assignment |
Owner name: CORIANT OY, FINLAND Free format text: CHANGE OF NAME;ASSIGNOR:TELLABS OY;REEL/FRAME:034980/0920 Effective date: 20141015 |
|
AS | Assignment |
Owner name: CERBERUS BUSINESS FINANCE, LLC, AS THE COLLATERAL Free format text: SECURITY INTEREST;ASSIGNOR:CORIANT OY (FORMERLY KNOWN AS TELLABS OY;REEL/FRAME:036132/0362 Effective date: 20150427 |
|
MAFP | Maintenance fee payment |
Free format text: PAYMENT OF MAINTENANCE FEE, 8TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1552) Year of fee payment: 8 |
|
AS | Assignment |
Owner name: CORIANT OY (FORMERLY TELLABS OY), ILLINOIS Free format text: RELEASE BY SECURED PARTY;ASSIGNOR:CERBERUS BUSINESS FINANCE, LLC;REEL/FRAME:047727/0035 Effective date: 20181001 |
|
MAFP | Maintenance fee payment |
Free format text: PAYMENT OF MAINTENANCE FEE, 12TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1553); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY Year of fee payment: 12 |