WO2012109909A1 - Procédé et appareil pour partager des charges de flux de données - Google Patents

Procédé et appareil pour partager des charges de flux de données Download PDF

Info

Publication number
WO2012109909A1
WO2012109909A1 PCT/CN2011/081036 CN2011081036W WO2012109909A1 WO 2012109909 A1 WO2012109909 A1 WO 2012109909A1 CN 2011081036 W CN2011081036 W CN 2011081036W WO 2012109909 A1 WO2012109909 A1 WO 2012109909A1
Authority
WO
WIPO (PCT)
Prior art keywords
load sharing
routing
link
load
forwarding
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/CN2011/081036
Other languages
English (en)
Chinese (zh)
Inventor
朱明�
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.)
ZTE Corp
Original Assignee
ZTE Corp
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 ZTE Corp filed Critical ZTE Corp
Publication of WO2012109909A1 publication Critical patent/WO2012109909A1/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/12—Avoiding congestion; Recovering from congestion
    • H04L47/125—Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/38—Flow based routing

Definitions

  • the present invention relates to the field of communications, and in particular to a data stream load sharing method and apparatus.
  • a load balancing method is often used.
  • a network node distributes packets of the same forwarding destination to multiple links through a certain policy, and finally aggregates them to a common target device. In this way, part of the user's requirements for link bandwidth and traffic management can be met.
  • load sharing modes there are two types of load sharing modes: a packet-based load sharing mode and a flow-based load sharing mode.
  • the packet-based mode distributes the packets evenly to each load sharing path according to the link weight. The selection of the link is independent of the text.
  • the flow-based mode generates a flow identifier based on the packet traits, such as the quintuple information of the IP packet and the label value of the label, and each flow identifier corresponds to a load sharing link.
  • packet traits such as the quintuple information of the IP packet and the label value of the label
  • each flow identifier corresponds to a load sharing link.
  • the data stream is mapped to a load sharing link.
  • a flow identifier is obtained according to the feature word of the packet, and the method for performing the remainder operation on the flow identifier is mapped to a load sharing link.
  • the load sharing member is rounded up into several items, such as hashing 3 members to 256 entries, and the hashing method is 1, 2, 3, 1,2,3,1,2..., then select directly from the 256 hash members according to the flow identifier to obtain the interface and the next hop.
  • the number of hash entries is not an integer multiple of the number of members, and there are not enough hash entries, a large load sharing error will occur.
  • three members are load-sharing according to a 1:1:1 ratio. If they are hashed into 5 entries, the actual ratio is 2:2:1, and a 50% error rate occurs.
  • the present invention provides a data flow load sharing method and apparatus to solve at least the problem of uneven load sharing in the above-described load sharing member hashing technique.
  • a data flow load sharing method including: a routing device calculates a routing value of a data stream in a pre-stored load sharing link table according to a flow identifier of a data stream to be forwarded; Determining whether the routing value falls within the error range of the load sharing link table; if yes, the routing device selects one load sharing member link as the forwarding link of the data flow according to the load condition of the current load sharing member link, and Forward the data stream.
  • the routing device selects a load sharing member link as the forwarding link of the data flow according to the load condition of the current load sharing member link, and forwards the data stream, including: For the first packet of the data flow, the routing device The load balancing member link is selected as the forwarding link and the first packet is forwarded according to the current load sharing relationship of the member ports.
  • the traffic load sharing error routing table is generated according to the correspondence between the first packet and the forwarding link. For subsequent packets of the data stream, the forwarding link is obtained directly from the traffic load sharing error routing table, and subsequent packets are forwarded.
  • the method further includes: pre-storing the load sharing link table on the routing device, where each load sharing member link is hashed according to the round robin hashing manner.
  • the load sharing is in the entries of the link table.
  • the routing device calculates the routing value of the data flow in the preset load sharing link table according to the flow identifier of the data flow, including: the routing device acquires the flow identifier of the data flow according to the feature word in the packet of the data flow;
  • the algorithm calculates the entry corresponding to the flow identifier in the load sharing link table, and uses the entry as the routing value of the data flow.
  • the routing device determines whether the routing value falls within the error range of the load sharing link table, and includes: when the routing value is greater than ⁇ and less than or equal to N, determining that the routing value falls within the error range of the load sharing link table; If the value is less than or equal to ⁇ , it is determined that the routing value does not fall within the error range of the load sharing link table; where M is the number of load sharing member links; N is the number of entries in the load sharing link table; K is such that ⁇ is smaller than The largest integer equal to N.
  • the method further includes: if the routing device determines that the routing value does not fall within the error range of the load sharing link table, the entry corresponding to the routing value
  • the load sharing member link acts as a forwarding link for the data stream and forwards the data stream.
  • a data stream load sharing apparatus including: a calculating module, configured to calculate a routing value of a data stream in a preset load sharing link table according to a flow identifier of the data stream; The judging module is configured to determine whether the routing value falls within the error range of the load sharing link table; the routing module is configured to share the load of the member link according to the current load when the routing value falls within the error range A load sharing member link is selected as a forwarding link of the data flow; and a forwarding module is configured to forward the data flow to the forwarding link.
  • the routing module is further configured to: when the packet to be forwarded by the data stream is the first packet, select a load sharing member link as the forwarding link according to the load condition of the current load sharing member link, and pass the forwarding module. Forwarding the first packet; generating a traffic load sharing error routing table according to the correspondence between the first packet and the forwarding link, and obtaining a forwarding link directly from the traffic load sharing error routing table for subsequent packets of the data flow, and passing The forwarding module forwards subsequent packets.
  • the calculation module includes: an acquisition submodule, configured to obtain a flow identifier of the data flow according to the feature word in the packet of the data flow; and a calculation submodule, configured to calculate, by using a hash algorithm, the flow identifier corresponding to the load sharing link table The entry, and the entry as the routing value of the data stream.
  • the judging module is further configured to: when the routing value is greater than KxM and less than or equal to N, determine that the routing value falls within the error range of the load sharing link table; when the routing value is less than or equal to ⁇ , determine that the routing value does not fall into the load sharing chain
  • the error range of the road table where M is the number of load sharing member links; N is the number of entries of the load sharing link table; K is the largest integer such that ⁇ is less than or equal to N.
  • FIG. 1 is a flow chart of a data flow load sharing method according to a first embodiment of the present invention
  • FIG. 2 is a flow chart of a data flow load sharing method according to a second embodiment of the present invention
  • FIG. 3 is a third embodiment of the present invention.
  • FIG. 4 is a structural block diagram of a data flow load sharing device according to Embodiment 4 of the present invention
  • 5 is a block diagram showing the structure of a data stream load sharing device according to Embodiment 5 of the present invention
  • FIG. 6 is a block diagram showing the structure of a data stream load sharing device according to Embodiment 6 of the present invention.
  • Step S102 A routing device calculates a data flow according to a flow identifier of a data flow to be forwarded. The pre-stored load balances the routing values in the link table.
  • Step S104 The routing device determines whether the routing value falls within the error range of the load sharing link table.
  • Step S106 If yes, the routing device selects a load sharing member link as a forwarding link of the data flow according to the load condition of the current load sharing member link, and forwards the data flow.
  • the error is identified by the routing value of the data stream. When the routing value of the stream falls within the error range, the error caused by the routing is adjusted by specifying the forwarding link, thereby avoiding the member links.
  • the problem of uneven load sharing ensures efficient and high-quality packet forwarding.
  • the step S106 includes: for the first packet of the data flow, the routing device selects a load sharing member link as the forwarding link according to the load condition of the member load of the current load, and forwards the first packet; A flow load sharing error routing table is generated by the corresponding relationship with the forwarding link. For subsequent packets of the data flow, the forwarding link is directly obtained from the traffic load sharing error routing table, and subsequent packets are forwarded.
  • the method further includes: pre-storing the load sharing link table on the routing device, wherein each load sharing member link is hashed to each entry of the load sharing link table according to a round robin hash.
  • Step S102 includes: the routing device acquires a flow identifier of the data flow according to the feature word in the packet of the data flow; and uses a hash algorithm to calculate an entry corresponding to the flow identifier in the load sharing link table, and uses the entry as the entry The routing value of the data stream.
  • the error range determination in the step S104 includes: when the routing value is greater than ⁇ and less than or equal to N, determining that the routing value falls within the error range of the load sharing link table; when the routing value is less than or equal to ⁇ , determining the routing The value does not fall within the error range of the load sharing link table; where M is the number of load sharing member links; N is the number of entries in the load sharing link table; K is the largest integer such that ⁇ is less than or equal to N.
  • the routing device determines that the routing value does not fall within the error range of the load sharing link table, the load sharing member link in the entry corresponding to the routing value is used as the forwarding link of the data flow, and is forwarded. data flow.
  • Step S202 Flow load sharing error identification.
  • the routing value calculated by the flow identifier can be uniformly distributed in the hash entry of the integral multiple of the load sharing member, according to the probability statistics, the routing can be considered to be uniform. Then the unevenness is the entry whose routing value falls outside the integer multiple. For example, if three load sharing members are hashed into 128 entries, the data flow with the selected value falling at 126 127 causes a load sharing error.
  • Step S204 The routing device specifies a load sharing link for the packet to be sent according to the load sharing condition of the current flow. After receiving the packet, the routing device first determines the load sharing policy. If the traffic load is shared, the routing device extracts the flow identifier information of the packet, and uses a hash algorithm to calculate the load sharing routing value. And determining whether the routing value falls within the error range, and if yes, assigning a load sharing link transmission to the data flow according to the load condition of the current load sharing link, and recording the data flow and the selected path, where the data flow is fixed Take this path to send.
  • FIG. 3 is a flowchart of a data flow load sharing method according to Embodiment 3 of the present invention. As shown in FIG. 3, the method includes the following steps: Step S302, obtaining a load sharing policy.
  • the routing device searches the routing forwarding table according to the destination IP address of the packet of the data stream, obtains the routing information, and determines whether it is a load sharing route according to the routing information. If yes, the load balancing policy table is searched according to the load sharing index in the routing table.
  • step S304 it is determined whether the acquired load sharing policy is flow-based or packet-based. If the packet is based on the step S306, otherwise the flow-based load sharing is performed, step S308 is performed. Step S306, searching for a load sharing routing table according to the packet routing value of the packet to obtain forwarding information. Step S308, calculating a flow identifier according to the feature word of the message. The packet feature word is extracted from the packet according to the configuration, and the stream identifier is calculated by a simple hash algorithm. In step S310, it is determined whether the stream falls within the error range. In the load sharing configuration process, a load sharing link table is generated.
  • the load sharing member links are hashed into the table in a round robin hash.
  • the load sharing link table supports n entries, the number of load sharing members is m, and the integer number of max k times supported in the O nl range is considered to be the chain whose flow identifier falls within the range of 0 ⁇ km-l.
  • the road load sharing is uniform, and the link falling within the range of km ⁇ n causes load sharing error. Therefore, the flow identifier is in the range of 0 ⁇ km-l, and the default is non-error flow, and step S312 is performed; otherwise, step S314 is performed.
  • Step S312 obtaining forwarding information from the load sharing link table.
  • Step S314 searching for a flow load sharing error routing table according to the feature word of the message.
  • step S316 it is determined whether the flow load sharing error routing table is hit. If the hit does not indicate that the message is the first packet of the data flow, step S320 is performed; if the hit indicates that the data flow is re-entering the routing device, step S318 is performed.
  • Step S320 Specify a forwarding path for the packet according to the load condition of the member link of each load. The packet data stream falls within the error range and is the first packet. The system needs to specify the forwarding path for it. The designation of the forwarding path is determined according to the load conditions of the current load sharing members.
  • the load balancing is required according to the ratio of 1: 1 : 1.
  • the current load is 2:2: 1
  • the third link is specified as the forwarding path of the current packet.
  • the path is recorded by adding a new error routing entry.
  • the forwarding path can be directly obtained in the error routing table.
  • Step S322 the packet is sent according to the selected forwarding path, and the process ends.
  • the calculated flow load sharing routing value falls outside the maximum integer multiple of the supported hash value, it is considered to be the data flow causing the routing error.
  • FIG. 4 is a structural block diagram of a data flow load sharing device according to Embodiment 4 of the present invention. As shown in FIG. 4, the data flow load sharing device includes: a calculation module 10, a determination module 20, a routing module 30, and a forwarding module. 40.
  • the calculation module 10 is configured to calculate a routing value of the data flow in the preset load sharing link table according to the flow identifier of the data flow; and the determining module 20 is configured to determine whether the routing value falls into the load sharing link.
  • the error range of the table; the routing module 30 is set to select a load sharing member link as the forwarding link of the data stream according to the load condition of the current load sharing member link according to the load condition of the current load sharing member link.
  • the forwarding module 40 is configured to forward the data stream to the forwarding link.
  • the determining module 20 performs error identification on the routing value of the data stream.
  • the routing module 30 specifies the forwarding link according to the load sharing condition of the current member link.
  • FIG. 5 is a structural block diagram of a data flow load sharing device according to Embodiment 5 of the present invention.
  • the present embodiment includes the functional modules shown in FIG. 4, wherein the computing module includes an obtaining submodule 101 and a computing submodule 102.
  • the obtaining sub-module 101 is configured to obtain a stream identifier of the data stream according to the feature word in the data stream packet;
  • the calculating sub-module 102 is configured to calculate, by using a hash algorithm, an entry corresponding to the stream identifier in the load sharing link table, and Use this entry as the routing value for the data stream.
  • the determining module 20 is further configured to: when the routing value is greater than ⁇ and less than or equal to N, determine that the routing value falls within the error range of the load sharing link table; when the routing value is less than or equal to ⁇ , determine that the routing value does not fall into the load sharing The error range of the link table; where M is the number of load-sharing member links; N is the number of entries in the load-sharing link table; and K is the largest integer such that ⁇ is less than or equal to N.
  • the routing module 30 is further configured to: when the packet to be forwarded by the data stream is the first packet, select a load sharing member link as the forwarding link according to the load condition of the current member load sharing member link, and The sending module 40 forwards the first packet, and generates a traffic load sharing error routing table according to the correspondence between the first packet and the forwarding link, and obtains the forwarding link directly from the traffic load sharing error routing table for subsequent packets of the data flow. And forwarding the subsequent message through the forwarding module 40.
  • the load sharing member link in the entry corresponding to the routing value is selected as the forwarding link of the data flow.
  • the packet includes: a message access module 50, a route lookup module 60, and a load sharing service identification module 70.
  • the message access module 50 is responsible for receiving and parsing the message;
  • the route lookup module 60 is configured to search the route forwarding table according to the information such as the destination IP address of the packet, and obtain the routing information;
  • the load sharing service identification module 70 identifies the load sharing route according to the routing result.
  • the load sharing routing module 80 is responsible for selecting one of the multiple load sharing links.
  • the packet forwarding module 90 is responsible for completing packet encapsulation and transmission according to information such as the selected forwarding link.
  • the routing value of the data stream is identified based on the routing mode of the load sharing member hash, and when the routing value of the stream falls within the error range, according to the load of the current member link.
  • the error caused by the routing is adjusted by the specified forwarding link, which avoids the problem of uneven load sharing among the member links and ensures efficient and high-quality packet forwarding.
  • modules or steps of the present invention can be implemented by a general-purpose computing device, which can be concentrated on a single computing device or distributed over a network composed of multiple computing devices. Alternatively, they may be implemented by program code executable by the computing device, such that they may be stored in the storage device by the computing device and, in some cases, may be different from the order herein.
  • the steps shown or described are performed, or they are separately fabricated into individual integrated circuit modules, or a plurality of modules or steps are fabricated as a single integrated circuit module.
  • the invention is not limited to any specific combination of hardware and software.
  • the above is only the preferred embodiment of the present invention, and is not intended to limit the present invention, and various modifications and changes can be made to the present invention. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and scope of the present invention are intended to be included within the scope of the present invention.

Landscapes

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

Abstract

La présente invention se rapporte à un procédé et à un appareil adaptés pour partager des charges de flux de données. Le procédé selon l'invention comprend les étapes suivantes : un dispositif de routage calcule une valeur de sélection de route d'un flux de données dans une table de liaisons de partage de charges préenregistrée, sur la base de l'identifiant de flux d'un flux de données devant être transféré ; le dispositif de routage détermine si la valeur de sélection de route est incluse, ou non, dans la marge d'erreur de la table de liaisons de partage de charges ; si le résultat de la détermination est positif, le dispositif de routage sélectionne l'une des liaisons individuelles de partage de charges en tant qu'une liaison de transfert du flux de données, sur la base de la charge de chaque liaison individuelle de partage de charges actuelle, et il transfère le flux de données. Selon la présente invention, une identification d'erreur est accomplie en ce qui concerne la valeur de sélection de route du flux de données. Quand la valeur de sélection de route du flux est incluse dans la marge d'erreur, l'erreur générée par la sélection de route est ajustée en spécifiant une liaison de transfert sur la base du partage de charges de la liaison individuelle actuelle. La solution technique de la présente invention permet donc de prévenir le problème lié au fait que le partage de charges de chaque liaison individuelle n'est pas équilibré. Elle garantit d'autre part un transfert de paquets efficace et de grande qualité.
PCT/CN2011/081036 2011-02-16 2011-10-20 Procédé et appareil pour partager des charges de flux de données Ceased WO2012109909A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201110039070.4 2011-02-16
CN201110039070.4A CN102098224B (zh) 2011-02-16 2011-02-16 数据流负荷分担方法及装置

Publications (1)

Publication Number Publication Date
WO2012109909A1 true WO2012109909A1 (fr) 2012-08-23

Family

ID=44131096

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2011/081036 Ceased WO2012109909A1 (fr) 2011-02-16 2011-10-20 Procédé et appareil pour partager des charges de flux de données

Country Status (2)

Country Link
CN (1) CN102098224B (fr)
WO (1) WO2012109909A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2015070601A1 (fr) * 2013-11-14 2015-05-21 中兴通讯股份有限公司 Procédé et système d'encapsulation d'identifiant de flux

Families Citing this family (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102098224B (zh) * 2011-02-16 2015-06-03 中兴通讯股份有限公司 数据流负荷分担方法及装置
CN102377667B (zh) * 2011-10-14 2017-08-01 南京中兴新软件有限责任公司 板卡及跨板捆绑链路的限速方法
EP2852113B1 (fr) 2012-06-21 2017-03-08 Huawei Technologies Co., Ltd. Procédé et dispositif de partage de charge, et carte unique
CN106559233A (zh) * 2015-09-28 2017-04-05 中兴通讯股份有限公司 数据流的镜像处理方法及装置
CN109474518B (zh) 2017-09-07 2021-08-20 华为技术有限公司 转发报文的方法及装置
CN109067664B (zh) * 2018-08-29 2022-06-10 迈普通信技术股份有限公司 一种负载均衡方法及装置
CN112702277B (zh) * 2020-12-15 2023-01-10 锐捷网络股份有限公司 一种负载均衡配置优化的方法和装置
CN115834485A (zh) * 2021-09-14 2023-03-21 中兴通讯股份有限公司 负荷分担选路方法及装置
CN117675684A (zh) * 2022-08-22 2024-03-08 中兴通讯股份有限公司 一种报文转发处理方法、装置、存储介质及电子装置
CN118101571A (zh) * 2022-11-28 2024-05-28 中兴通讯股份有限公司 一种发送报文的方法、电子设备及存储介质

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2004019569A1 (fr) * 2002-08-20 2004-03-04 Telia Ab (Publ) Procede d'equilibrage de charge par routage par chemins courts
CN1913454A (zh) * 2006-08-30 2007-02-14 华为技术有限公司 一种ip报文负载分担实现方法及装置
CN101789949A (zh) * 2010-02-04 2010-07-28 中兴通讯股份有限公司 一种实现负荷分担的方法和路由设备
CN102098224A (zh) * 2011-02-16 2011-06-15 中兴通讯股份有限公司 数据流负荷分担方法及装置

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP3816246B2 (ja) * 1998-10-30 2006-08-30 株式会社東芝 カットスルーパス制御方法
CN101119313A (zh) * 2007-09-14 2008-02-06 杭州华三通信技术有限公司 一种负载分担方法和设备
CN101656675A (zh) * 2009-09-22 2010-02-24 中兴通讯股份有限公司 负荷分担方法和装置

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2004019569A1 (fr) * 2002-08-20 2004-03-04 Telia Ab (Publ) Procede d'equilibrage de charge par routage par chemins courts
CN1913454A (zh) * 2006-08-30 2007-02-14 华为技术有限公司 一种ip报文负载分担实现方法及装置
CN101789949A (zh) * 2010-02-04 2010-07-28 中兴通讯股份有限公司 一种实现负荷分担的方法和路由设备
CN102098224A (zh) * 2011-02-16 2011-06-15 中兴通讯股份有限公司 数据流负荷分担方法及装置

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2015070601A1 (fr) * 2013-11-14 2015-05-21 中兴通讯股份有限公司 Procédé et système d'encapsulation d'identifiant de flux
US10069723B2 (en) 2013-11-14 2018-09-04 Zte Corporation Method and system for encapsulating flow identifier

Also Published As

Publication number Publication date
CN102098224B (zh) 2015-06-03
CN102098224A (zh) 2011-06-15

Similar Documents

Publication Publication Date Title
WO2012109909A1 (fr) Procédé et appareil pour partager des charges de flux de données
US11876717B2 (en) Flow-based load balancing
US8793400B2 (en) Management of inter-provider peer-to-peer based feature network
US20190253359A1 (en) Load balancing of network communications
CN1744563B (zh) 在以太网交换机上实现策略路由的方法
CN102098740B (zh) 链路聚合选路方法及装置
US8326929B2 (en) Peer-to-peer based feature network
US8989189B2 (en) Scaling IPv4 in data center networks employing ECMP to reach hosts in a directly connected subnet
WO2018107908A1 (fr) Procédé de transmission de message, et commutateur
US20150085859A1 (en) Two-Stage Port-Channel Resolution in a Multistage Fabric Switch
CN101789949B (zh) 一种实现负荷分担的方法和路由设备
WO2017025021A1 (fr) Procédé et dispositif de traitement de table de flux
US20200228618A1 (en) Content delivery method, device, and system
CN114640682B (zh) 一种基于改进无状态哈希的负载均衡方法和系统
US20150256460A1 (en) System and method for packet forwarding using a conjunctive normal form strategy in a content-centric network
CN101656675A (zh) 负荷分担方法和装置
CN114221834B (zh) 一种报文转发方法及装置
CN118368230A (zh) 转发网内计算报文的方法、转发节点及计算机存储介质
WO2025260738A1 (fr) Procédé de planification de puissance de calcul, et dispositif et support
US20240113959A1 (en) Instance-affine service scheduling
KR101929804B1 (ko) 세션 자원 관리 방법 및 장치
CN102231879B (zh) 终端设备和终端设备的业务数据处理的方法
WO2007073620A1 (fr) Systeme et procede de traitement de message
Azgin et al. H 2 N4: Packet forwarding on hierarchical hash-based names for content centric networks
US20070206599A1 (en) Priority Content Addressable Memory (PCAM)

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 11858973

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 11858973

Country of ref document: EP

Kind code of ref document: A1