EP1351453B1 - Verfahren und Vorrichtungen zur Umordnung von Paketen in einem Netzwerkprozessor - Google Patents

Verfahren und Vorrichtungen zur Umordnung von Paketen in einem Netzwerkprozessor Download PDF

Info

Publication number
EP1351453B1
EP1351453B1 EP02290817A EP02290817A EP1351453B1 EP 1351453 B1 EP1351453 B1 EP 1351453B1 EP 02290817 A EP02290817 A EP 02290817A EP 02290817 A EP02290817 A EP 02290817A EP 1351453 B1 EP1351453 B1 EP 1351453B1
Authority
EP
European Patent Office
Prior art keywords
packet
packets
tiers
reordering
processing time
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.)
Expired - Lifetime
Application number
EP02290817A
Other languages
English (en)
French (fr)
Other versions
EP1351453A1 (de
Inventor
Peter Irma August Barri
Robert Elliott Robotham
Miroslav Vrana
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.)
Alcatel CIT SA
Alcatel Lucent SAS
Original Assignee
Alcatel CIT SA
Alcatel SA
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 Alcatel CIT SA, Alcatel SA filed Critical Alcatel CIT SA
Priority to DE60210576T priority Critical patent/DE60210576T2/de
Priority to EP02290817A priority patent/EP1351453B1/de
Priority to AT02290817T priority patent/ATE323360T1/de
Priority to US10/389,929 priority patent/US8045549B2/en
Publication of EP1351453A1 publication Critical patent/EP1351453A1/de
Application granted granted Critical
Publication of EP1351453B1 publication Critical patent/EP1351453B1/de
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q3/00—Selecting arrangements
    • H04Q3/64—Distributing or queueing
    • H04Q3/66—Traffic distributors
    • 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/34—Flow control; Congestion control ensuring sequence integrity, e.g. using sequence numbers
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13106—Microprocessor, CPU
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13141—Hunting for free outlet, circuit or channel
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13166—Fault prevention
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13174—Data transmission, file transfer
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13204—Protocols
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13296—Packet switching, X.25, frame relay
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13298—Local loop systems, access network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13348—Channel/line reservation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13389—LAN, internet

Definitions

  • the present invention is related to an Internet Protocol (IP) router or a Multiprotocol Label Switching (MPLS) router and network processors for routing packets over a network. Further, the present invention is related to a method for routing packets over a network.
  • IP Internet Protocol
  • MPLS Multiprotocol Label Switching
  • IP and MPLS routers use network processors (NP) for their packet forwarding tasks.
  • NP network processors
  • These network processors are programmable devices optimised (optionally with dedicated hardware auxiliary circuits) to do the processing of e.g. IP and MPLS protocols.
  • IP and MPLS protocols e.g. IP and MPLS protocols.
  • a single processor is hardly able to process at wirespeed the 25 to 100 million packets per second of Optical Carrier interfaces
  • many network processors use a multiprocessor engine whereby each of the engines may run multiple threads. In such architecture, multiple packets are processed at the same time. As the processing time of an individual packet may vary, a dedicated function is required to ensure that the network processor maintains packet order.
  • the packet reordering function in state of the art network processors is engineered to keep packet order only between relevant packets, i.e. typically packets of the same end to end flow see, for example, United States Patent 6,134,217.
  • relevant packets i.e. typically packets of the same end to end flow see, for example, United States Patent 6,134,217.
  • means are introduced, such as a hashing function based on packet parameters, in order to classify packets in "classes". This is performed before the packet processing is started. Within such a class, the packet order is maintained.
  • the above solution does not classify packets based on their processing time. It is even not possible to do so, as the processing time is only known when packet processing is ongoing or finished.
  • the prior art solution i.e. classification based on a hashing function, results in a classification of packets with a large variety in processing time within each of the classes.
  • the reordering of the packets within such a class may not be very efficient because the reordering element of the network processor has to wait for the packet with the largest processing time before all packets can be reordered and sent out subsequently. The network processor is not utilised efficiently during this waiting time.
  • the present invention aims to provide a novel method according to claim 1 and apparatus according to claims 9 and 10 for forwarding packets efficiently in a network processor.
  • the present invention concerns a method according to claim 1 for packet reordering in a network processor, comprising the steps of:
  • the step of determining the nominal packet processing time comprises the steps of:
  • processing time is advantageously expressed in time units, such as real time but more preferably time tokens, indicating a relative time within the network processor.
  • time tokens can provide quicker processing of time data.
  • the method for packet reordering of the present invention can further be characterised in that the plurality of tiers comprises one first tier and at least one subsequent tier, said first tier being used for transfer of short processing time packets.
  • a suitable sorting algorithm for the first tier can e.g. be based on the sequence number of the packet.
  • the suitable sorting algorithm for the subsequent tiers can e.g. be based on the timestamp of the packet.
  • the step of collecting eligible packets from the groups in a collector for forwarding can comprise a selection of a tier according to a weighed round robin algorithm.
  • a packet from a tier is eligible for collecting if the actual time is later than the timestamp of said packet + the maximum processing time of a packet associated to said tier.
  • Another embodiment of the present invention concerns a reordering unit implementing the method of the present invention.
  • a further embodiment of the present invention is a network processor comprising the reordering unit of the present invention.
  • Fig. 1 illustrates the general setting of a network processor.
  • Fig. 2 represents the data flow in a multiprocessor network processor according to the present invention.
  • Fig . 3 shows the data flow in a reordering unit according to the present invention.
  • Fig. 4 and 5 respectively show the reordering principles in tier 1 and in tier 2 and up.
  • Fig. 6 is a flowchart in which the packet flow in a network processor according to the present invention is represented.
  • the present invention which provides a solution to the problems of the state of the art concerns packet classification by the network processor during packet processing.
  • This classification is based on the processing method and corresponding time.
  • Each class of this new reordering principle corresponds to a packet processing time interval, a result of the applied processing method(s).
  • the processing time intervals of two classes may be (partly) overlapping.
  • the reordering of packets in a particular class only has to cope with a well known processing time interval defined for that class, which is much smaller than the global delta processing time of all packets processed by the Network processor (NP).
  • NP Network processor
  • the solution can be applied to reorder traffic in one packet processing component or between multiple packet processing components.
  • the network processor code is able to make a classification of the packets based on processing time and method at packet processing time.
  • the code overhead is very small. This classification allows one to organise the reordering per class, whereby the delta processing time of packets in one class is much smaller than the overall delta processing time.
  • Figure 1 shows the traditional set-up of a Network Processor (NP).
  • a network processor 2 is set up to receive packets 1 and to forward these packets to their destination, the output of a NP is referred to as processed packets 3.
  • FIG. 2 shows a more detailed scheme of a NP (2).
  • Incoming packets 1 are put into an input queue 4, which is fed to a dispatch unit 5.
  • This dispatch unit 5 redistributes the packets over a plurality of processing units 6, which will collect the packets into reordering unit 7 after processing the packets.
  • the reordering unit 7 finally outputs processed packets 3 to their destination.
  • Packets are foreseen of parameters such as a packet reference number, a timestamp, and a sequence number. Typically, all or some of the parameters need to be read and/or passed onto the next level to allow proper treatment in the reordering unit. E.g. between the dispatch unit 5 and the processing units 6, packet reference numbers are passed (9), while the dispatch unit 5 passes packet reference numbers, timestamps and sequence numbers to the reordering unit 7 (8).
  • Processing of a packet by a processing unit consists of a sequence of actions.
  • a different type of packet will require a different type of processing, which is reflected in a different combination (a different sequence) of actions. Every possible action also has its nominal processing time.
  • Each token represents e.g. a processing time unit.
  • each action is logged.
  • a packet is thus associated to a specific processing time which can be calculated by addition of all the nominal processing times for all the actions required to process the packet. For type 3, the total processing time will thus be equal to time 1 + time 2 + time 3. Further, all packets are associated to an array logging the processing actions, so for a processed packet of type 3, the array looks like
  • the total nominal processing time is used to assign it to a tier (10), as can be seen on figure 3.
  • the different tiers each handle a specific nominal packet processing range: Nominal processing time ranges Selected tier Range A Tier 1 Range B Tier 2 Range C Tier 3
  • the ranges are non-overlapping, so that every packet is associated with only one nominal processing time, which is only associated with one tier. Every processed packet can thus be assigned to only one processing tier. Packets arriving at their assigned tier, have to be reordered before they are passed on to a collector 13 which is at the end of the network processor. Since all packets that are present in a tier have about the same processing time (the difference between processing times of different packets is small since the tier assignment was done on the basis of processing time), the tier reordering can be optimised to suit the needs. E.g., tier 1 (11) can be used for fast processed packets, while tier 2 (12) and up can be used for packets with medium or long processing time.
  • the collector 13 can collect the packets in a weighted round robin mode (the lower tiers may have e.g. higher weights).
  • Fig. 4 shows an advantageous reordering principle for tier 1 in such a set-up.
  • a filled bucket lookup engine 16 is used. Processed packets are directly inserted in the corresponding sequence number bucket (15). A packet is eligible to be passed (14) to the collector 13 if the actual time is later than the timestamp + the maximum processing time of a packet associated to tier 1 or if the packet has the sequence number following the sequence number of the previously collected packet of tier 1. This reorder engine can work at wirespeed and treats typically the fastest processed packets.
  • Fig. 5 draws the reordering in tier 2 and up and is based on time equalising sorting such as for an n-airy tree. Packets arriving in a FIFO queue 18 are sorted on their timestamp (17). A packet is eligible for transfer (19) to the collector 13 if it is at the head of the timestamp sorter 17 and if the actual time is later than the actual timestamp + the maximum processing time of a packet associated to the corresponding tier.
  • Packet processing preferably performed by determining the packet type and processing the packet accordingly, is performed first.
  • the packet nominal processing time associated to a packet on the basis of the nominal processing time required for the actions required to process that packet type, the packets are distributed into a plurality of tiers, which are reordered independently.
  • a collector selects eligible packets from the reordered tiers and forwards the packets to their destination.

Landscapes

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

Claims (11)

  1. Verfahren zur Umordnung von Paketen in einem Netzwerkprozessor (2), das folgende Schritte umfasst:
    a. Verarbeitung von Paketen;
    b. Aufteilung der verarbeiteten Pakete in eine Vielzahl von Reihen (10, 11, 12); und
    c. Umordnung der Reihen unabhängig voneinander und Sammeln geeigneter Pakete aus der Vielzahl von Reihen in einem Sammler (13) zur Weiterleitung,
    DADURCH GEKENNZEICHNET, DASS das Verfahren weiterhin den Schritt umfasst, während der Verarbeitung die Nenn-Paket-Verarbeitungszeit jedes Paketes zu bestimmen, und dadurch, dass die verarbeiteten Pakete abhängig von der Nenn-Paket-Verarbeitungszeit in die Vielzahl von Reihen (10, 11, 12) aufgeteilt werden.
  2. Verfahren zur Umordnung von Paketen nach Anspruch 1, DADURCH GEKENNZEICHNET, DASS der Schritt der Bestimmung der Nenn-Paket-Verarbeitungszeit folgende Unterschritte umfasst:
    a. Bestimmung der zur Verarbeitung des Pakettyps erforderlichen Aktionen; und
    b. Bestimmung der Nenn-Paket-Verarbeitungszeit durch Addition aller Nenn-Paket-Verarbeitungszeiten der zur Verarbeitung des Paketes erforderlichen Aktionen.
  3. Verfahren zur Umordnung von Paketen nach Anspruch 1 oder 2, DADURCH GEKENNZEICHNET, DASS die Verarbeitungszeit in Zeiteinheiten ausgedrückt wird.
  4. Verfahren zur Umordnung von Paketen gemäß einem beliebigen der Ansprüche 1 bis 3, DADURCH GEKENNZEICHNET, DASS die Vielzahl von Reihen eine ersten Reihe und mindestens eine nachfolgende Reihe umfasst, wobei die erste Reihe dazu benutzt wird, die Pakete mit kurzer Verarbeitungszeit zu übergeben.
  5. Verfahren zur Umordnung von Paketen nach Anspruch 4, DADURCH GEKENNZEICHNET, DASS der geeignete Sortier-Algorithmus für die erste Reihe auf der Reihenfolge-Nummer der Pakete beruht.
  6. Verfahren zur Umordnung von Paketen nach Anspruch 4 oder 5, DADURCH GEKENNZEICHNET, DASS der geeignete Sortier-Algorithmus für die nachfolgenden Reihen auf dem Zeitstempel des Paketes beruht.
  7. Verfahren zur Umordnung von Paketen nach einem beliebigen der Ansprüche 1 bis 6, DADURCH GEKENNZEICHNET, DASS der Schritt des Sammelns geeigneter Pakete aus den Gruppen in einem Sammler zur Weiterleitung eine Auswahl einer Reihe gemäß einem gewichteten Round-Robin-Verfahren umfasst.
  8. Verfahren zur Umordnung von Paketen nach Anspruch 7, DADURCH GEKENNZEICHNET, DASS ein Paket aus einer Reihe zur Sammlung geeignet ist, wenn die aktuelle Zeit hinter dem Zeitstempel des Paketes plus der maximalen Verarbeitungszeit eines der Reihe zugeordneten Paketes liegt.
  9. Umordnungs-Einheit (7) zur Verwendung in einem Netzwerkprozessor (2) zur Umordnung von Paketen in dem Netzwerkprozessor (2), wobei die Umordnungs-Einheit (7) folgendes umfasst:
    a. Eine Vielzahl von Reihen (10, 11, 12), wobei jede Reihe der Vielzahl von Reihen unabhängig voneinander so angepasst ist, dass sie Pakete umordnet, DADURCH GEKENNZEICHNET, DASS die Pakete abhängig von einer Nenn-Paket-Verarbeitungszeit in die Vielzahl von Reihen aufgeteilt werden; und
    b. Einen Sammler (13), der so angepasst ist, dass er geeignete Pakete aus der Vielzahl von Reihen in dem Sammler zur Weiterleitung sammelt.
  10. Netzwerkprozessor (2), der eine Paket-VerarbeitungsEinheit enthält, die so angepasst ist, dass sie Pakete verarbeitet, und die so angepasst ist, dass sie die verarbeiteten Pakete in eine Vielzahl von Reihen aufteilt, und die weiterhin so angepasst ist, dass sie die Reihen unabhängig voneinander umordnet,
    DADURCH GEKENNZEICHNET, DASS die Verarbeitungseinheit weiterhin so angepasst ist, dass sie während der Verarbeitung die Nenn-Paket-Verarbeitungszeit jedes Paketes bestimmt und die verarbeiteten Pakete abhängig von der Nenn-Paket-Verarbeitungszeit in die Vielzahl von Reihen aufteilt.
  11. Netzwerkprozessor gemäß Anspruch 10, der die Umordnungs-Einheit aus Anspruch 9 enthält.
EP02290817A 2002-04-03 2002-04-03 Verfahren und Vorrichtungen zur Umordnung von Paketen in einem Netzwerkprozessor Expired - Lifetime EP1351453B1 (de)

Priority Applications (4)

Application Number Priority Date Filing Date Title
DE60210576T DE60210576T2 (de) 2002-04-03 2002-04-03 Verfahren und Vorrichtungen zur Umordnung von Paketen in einem Netzwerkprozessor
EP02290817A EP1351453B1 (de) 2002-04-03 2002-04-03 Verfahren und Vorrichtungen zur Umordnung von Paketen in einem Netzwerkprozessor
AT02290817T ATE323360T1 (de) 2002-04-03 2002-04-03 Verfahren und vorrichtungen zur umordnung von paketen in einem netzwerkprozessor
US10/389,929 US8045549B2 (en) 2002-04-03 2003-03-18 Method and apparatus for packet reordering in a network processor

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
EP02290817A EP1351453B1 (de) 2002-04-03 2002-04-03 Verfahren und Vorrichtungen zur Umordnung von Paketen in einem Netzwerkprozessor

Publications (2)

Publication Number Publication Date
EP1351453A1 EP1351453A1 (de) 2003-10-08
EP1351453B1 true EP1351453B1 (de) 2006-04-12

Family

ID=27838162

Family Applications (1)

Application Number Title Priority Date Filing Date
EP02290817A Expired - Lifetime EP1351453B1 (de) 2002-04-03 2002-04-03 Verfahren und Vorrichtungen zur Umordnung von Paketen in einem Netzwerkprozessor

Country Status (4)

Country Link
US (1) US8045549B2 (de)
EP (1) EP1351453B1 (de)
AT (1) ATE323360T1 (de)
DE (1) DE60210576T2 (de)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE10260604B4 (de) * 2002-12-23 2006-09-21 Infineon Technologies Ag Multikanal-Prozessor
US7764611B2 (en) * 2008-12-23 2010-07-27 Avaya Inc. Sharing of network security and services processing resources
JP2014194672A (ja) * 2013-03-28 2014-10-09 Fujitsu Ltd メモリ制御装置、及びメモリ制御方法

Family Cites Families (41)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4581734A (en) * 1984-02-14 1986-04-08 Rosemount Inc. Multipriority communication system
US5179557A (en) * 1989-07-04 1993-01-12 Kabushiki Kaisha Toshiba Data packet communication system in which data packet transmittal is prioritized with queues having respective assigned priorities and frequency weighted counting of queue wait time
US5150358A (en) * 1990-08-23 1992-09-22 At&T Bell Laboratories Serving constant bit rate traffic in a broadband data switch
US5666161A (en) * 1993-04-26 1997-09-09 Hitachi, Ltd. Method and apparatus for creating less amount of compressd image data from compressed still image data and system for transmitting compressed image data through transmission line
US6134217A (en) * 1996-04-15 2000-10-17 The Regents Of The University Of California Traffic scheduling system and method for packet-switched networks with fairness and low latency
US6058114A (en) * 1996-05-20 2000-05-02 Cisco Systems, Inc. Unified network cell scheduler and flow controller
JP3419627B2 (ja) * 1996-06-11 2003-06-23 株式会社日立製作所 ルータ装置
US5926459A (en) * 1996-06-27 1999-07-20 Xerox Corporation Rate shaping in per-flow queued routing mechanisms for available bit rate service
US5894586A (en) * 1997-01-23 1999-04-13 Xionics Document Technologies, Inc. System for providing access to memory in which a second processing unit is allowed to access memory during a time slot assigned to a first processing unit
US6000053A (en) * 1997-06-13 1999-12-07 Microsoft Corporation Error correction and loss recovery of packets over a computer network
US6104700A (en) * 1997-08-29 2000-08-15 Extreme Networks Policy based quality of service
US6075791A (en) * 1997-10-28 2000-06-13 Lucent Technologies Inc. System for guaranteeing data transfer rates and delays in packet networks
US6272109B1 (en) * 1997-11-18 2001-08-07 Cabletron Systems, Inc. Hierarchical schedules for different ATM traffic
US6091709A (en) * 1997-11-25 2000-07-18 International Business Machines Corporation Quality of service management for packet switched networks
US6148324A (en) * 1998-01-05 2000-11-14 Lucent Technologies, Inc. Prioritized load balancing among non-communicating processes in a time-sharing system
JP2000092118A (ja) * 1998-09-08 2000-03-31 Hitachi Ltd プログラマブルネットワーク
SE513517C2 (sv) * 1998-09-10 2000-09-25 Net Insight Ab Förfaranden för ändring av bandbredden på en isokron kanal i ett kretskopplat nät
US6714517B1 (en) * 1998-11-10 2004-03-30 Extreme Networks Method and apparatus for interconnection of packet switches with guaranteed bandwidth
CN1153427C (zh) * 1999-01-26 2004-06-09 松下电器产业株式会社 数据中继处理方法和装置
JP3714403B2 (ja) * 1999-04-12 2005-11-09 ノキア コーポレイション パケット長さの分類
GB2349296B (en) * 1999-04-21 2001-04-04 3Com Corp Reduction of imbalance in transmit traffic queues in a network switch
JP3438651B2 (ja) * 1999-05-31 2003-08-18 日本電気株式会社 パケット多重装置
JP2001024640A (ja) * 1999-07-02 2001-01-26 Fujitsu Ltd Ａｔｍセル多重化装置及びそれにおけるスケジューリング方法
SE521463C2 (sv) * 1999-09-20 2003-11-04 Ericsson Telefon Ab L M Klassificerare i ett IP nätverk med medel för att avgöra huruvida ett transmitterat flöde är ett realtidsflöde eller inte
ATE295642T1 (de) * 2000-03-10 2005-05-15 Tellabs Operations Inc Auslese-ablaufsteuerung für nicht aufeinander- folgende daten
US6704346B1 (en) * 2000-03-16 2004-03-09 Sharp Laboratories Of America, Inc. Method and apparatus to provide improved microwave interference robustness in RF communications devices
US7215637B1 (en) * 2000-04-17 2007-05-08 Juniper Networks, Inc. Systems and methods for processing packets
US6826147B1 (en) * 2000-07-25 2004-11-30 Nortel Networks Limited Method and apparatus for aggregate flow control in a differentiated services network
JP2002171285A (ja) * 2000-11-29 2002-06-14 Mitsubishi Electric Corp 通信システムおよび通信方法
JP3601445B2 (ja) * 2000-12-06 2004-12-15 日本電気株式会社 パケット転送装置及びそれに用いる転送情報管理方法並びにその転送情報検索方法
US6898638B2 (en) * 2001-01-11 2005-05-24 International Business Machines Corporation Method and apparatus for grouping data for transfer according to recipient buffer size
JP5048184B2 (ja) * 2001-01-26 2012-10-17 富士通株式会社 伝送レート監視装置および伝送レート監視方法
US7042843B2 (en) * 2001-03-02 2006-05-09 Broadcom Corporation Algorithm for time based queuing in network traffic engineering
JP4475835B2 (ja) * 2001-03-05 2010-06-09 富士通株式会社 入力回線インタフェース装置及びパケット通信装置
US6985441B1 (en) * 2001-03-05 2006-01-10 Advanced Micro Devices, Inc. Intelligent embedded processor enabled mechanism to implement RSVP function
AU2002303501A1 (en) * 2001-04-27 2002-11-11 Wanwall, Inc. Weighted fair queuing-based methods and apparatus for protecting against overload conditions on nodes of a distributed network
JP4728511B2 (ja) * 2001-06-14 2011-07-20 古河電気工業株式会社 データ中継方法、その装置およびその装置を用いたデータ中継システム
US7095715B2 (en) * 2001-07-02 2006-08-22 3Com Corporation System and method for processing network packet flows
US20030053485A1 (en) * 2001-09-20 2003-03-20 Chuah Mooi Choo Multiplexing IP data packets within a MPLS frame
US8189591B2 (en) * 2001-10-30 2012-05-29 Exar Corporation Methods, systems and computer program products for packet ordering for parallel packet transform processing
US7403999B2 (en) * 2001-12-28 2008-07-22 International Business Machines Corporation Classification support system and method for fragmented IP packets

Also Published As

Publication number Publication date
DE60210576D1 (de) 2006-05-24
DE60210576T2 (de) 2007-02-15
US8045549B2 (en) 2011-10-25
US20030189931A1 (en) 2003-10-09
EP1351453A1 (de) 2003-10-08
ATE323360T1 (de) 2006-04-15

Similar Documents

Publication Publication Date Title
US8139576B2 (en) Network routing apparatus
CN105553880B (zh) 一种软件定义网络中的数据处理方法及装置
EP3082304B1 (de) Dienstroutingverfahren und -system
DE112020002484T5 (de) System und verfahren zur erleichterung der feinkörnigen flusssteuerung in einer netzwerkschnittstellensteuerung (nic)
US7426579B2 (en) System and method for handling frames in multiple stack environments
US7836198B2 (en) Ethernet virtualization using hardware control flow override
US20070153796A1 (en) Packet processing utilizing cached metadata to support forwarding and non-forwarding operations on parallel paths
CN1423873A (zh) 有线速度ip信息多点传送的方法和装置
WO2011072978A1 (en) Method for processing a plurality of data and switching device for switching communication packets
EP2740245A1 (de) Skalierbare paketplanungsrichtlinie für eine sehr grosse anzahl von sitzungen
WO2014200777A1 (en) Multicast flow reordering scheme
CN1577305A (zh) 一种并行处理的方法及系统
US7327759B2 (en) Sequence-preserving deep-packet processing in a multiprocessor system
EP1351453B1 (de) Verfahren und Vorrichtungen zur Umordnung von Paketen in einem Netzwerkprozessor
CN110099006B (zh) 用于有状态的分组处理的系统和方法
US20050226263A1 (en) Weighted random scheduling particularly applicable to packet switching systems
US7158512B1 (en) System and method for scheduling a cross-bar
JP3598985B2 (ja) キュー割り当てシステムおよびパケット交換機のキュー割り当て方法
US8441953B1 (en) Reordering with fast time out
JP3570366B2 (ja) アービタ回路及びそれに用いる出力セルのアービトレーション方法
CN113886071B (zh) 服务功能链的编排方法、装置、存储介质以及电子设备
US8848587B2 (en) Multicasting network packets
CN111581489B (zh) 一种基于共享计数树的存储空间优化采样方法
CN109347747B (zh) 一种数据处理方法及装置
JP2004064159A (ja) パケットスケジューリング装置

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE TR

AX Request for extension of the european patent

Extension state: AL LT LV MK RO SI

17P Request for examination filed

Effective date: 20040408

AKX Designation fees paid

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE TR

17Q First examination report despatched

Effective date: 20050124

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

RIC1 Information provided on ipc code assigned before grant

Ipc: 7H 04Q 3/66 B

Ipc: 7H 04L 12/56 A

RTI1 Title (correction)

Free format text: METHOD AND APPARATUSES FOR PACKET REORDERING IN A NETWORK PROCESSOR

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE TR

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: CH

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20060412

Ref country code: BE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20060412

Ref country code: NL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20060412

Ref country code: AT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20060412

Ref country code: LI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20060412

Ref country code: FI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20060412

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

REF Corresponds to:

Ref document number: 60210576

Country of ref document: DE

Date of ref document: 20060524

Kind code of ref document: P

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20060712

Ref country code: DK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20060712

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: ES

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20060723

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: PT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20060912

NLV1 Nl: lapsed or annulled due to failure to fulfill the requirements of art. 29p and 29m of the patents act
ET Fr: translation filed
REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

26N No opposition filed

Effective date: 20070115

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20060713

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20070403

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MC

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20070430

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: CY

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20060412

Ref country code: LU

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20070403

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: TR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20060412

REG Reference to a national code

Ref country code: GB

Ref legal event code: 732E

Free format text: REGISTERED BETWEEN 20131114 AND 20131120

REG Reference to a national code

Ref country code: FR

Ref legal event code: GC

Effective date: 20140717

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 14

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 15

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20160421

Year of fee payment: 15

Ref country code: GB

Payment date: 20160421

Year of fee payment: 15

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: IT

Payment date: 20160427

Year of fee payment: 15

Ref country code: FR

Payment date: 20160421

Year of fee payment: 15

REG Reference to a national code

Ref country code: DE

Ref legal event code: R119

Ref document number: 60210576

Country of ref document: DE

GBPC Gb: european patent ceased through non-payment of renewal fee

Effective date: 20170403

REG Reference to a national code

Ref country code: FR

Ref legal event code: ST

Effective date: 20171229

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: DE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20171103

Ref country code: FR

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20170502

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GB

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20170403

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IT

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20170403