WO2012000349A1 - 一种网络流量分担的方法、装置及系统 - Google Patents

一种网络流量分担的方法、装置及系统 Download PDF

Info

Publication number
WO2012000349A1
WO2012000349A1 PCT/CN2011/073855 CN2011073855W WO2012000349A1 WO 2012000349 A1 WO2012000349 A1 WO 2012000349A1 CN 2011073855 W CN2011073855 W CN 2011073855W WO 2012000349 A1 WO2012000349 A1 WO 2012000349A1
Authority
WO
WIPO (PCT)
Prior art keywords
label
flow
bits
flow label
bit data
Prior art date
Application number
PCT/CN2011/073855
Other languages
English (en)
French (fr)
Inventor
易珂
第海兵
Original Assignee
华为技术有限公司
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 华为技术有限公司 filed Critical 华为技术有限公司
Priority to EP11800094A priority Critical patent/EP2512077A1/en
Priority to JP2012550316A priority patent/JP5706914B2/ja
Publication of WO2012000349A1 publication Critical patent/WO2012000349A1/zh
Priority to US13/722,799 priority patent/US20130107717A1/en

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/122—Avoiding congestion; Recovering from congestion by diverting traffic away from congested entities
    • 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/24—Multipath
    • 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
    • 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

Definitions

  • the present invention relates to network communication technologies, and in particular, to a method, an apparatus, and a system for network traffic sharing.
  • the existing network traffic sharing method is as shown in FIG. 1.
  • the traffic is entered by the source node R0, and is shared by the intermediate node P to the destination nodes R1, R2, and R3, and the existing intermediate node P passes through the parsed message.
  • the flow label performs the next equivalent routing, and the flow label is deleted when the outgoing nodes R1, R2, and R3 are reached.
  • Embodiments of the present invention provide a method, an apparatus, and a system for network traffic sharing, which improve the flexibility of traffic sharing of each node when multiple intermediate nodes exist.
  • the embodiment of the invention provides a method for network traffic sharing, including: Receiving, by the flow label in the packet sent by the upper node, adjusting the flow label, so that the flow labels between the adjacent intermediate nodes are different;
  • Equivalent path routing is performed according to the adjusted stream label.
  • the embodiment of the present invention further provides a device for network traffic sharing, where the device is disposed in an intermediate node, and includes:
  • a receiving module configured to receive a flow label in a packet sent by the upper node
  • an adjustment module configured to adjust, according to a predetermined rule, the flow label received by the receiving module, so that flow labels between adjacent intermediate nodes are different;
  • the routing module is configured to perform an equal path routing according to the flow label adjusted by the adjustment module.
  • the embodiment of the present invention further provides a network traffic sharing system, which is characterized in that: the device includes the network traffic sharing device and the upper node, and the upper node includes an ingress edge quotient device or a superior intermediate node, and the ingress edge
  • the commerce device is configured to receive the packet sent by the user side, and after parsing the received packet information, the HASH outflow label is inserted into the packet and sent to the lower intermediate node.
  • FIG. 1 is a schematic structural diagram of nodes in a network traffic sharing method in the prior art
  • FIG. 2 is a schematic flowchart of a network traffic sharing method according to an embodiment of the present invention
  • 3 is a schematic diagram of a package structure of a flow label according to an embodiment of the present invention
  • FIG. 4 is a schematic diagram of a flow of interaction between an intermediate node, two secondary nodes, and four destination nodes in an embodiment of the present invention
  • FIG. 5 is a schematic structural diagram of a network traffic sharing device according to an embodiment of the present invention
  • FIG. 6 is a source node, a primary intermediate node, and two secondary intermediate nodes according to an embodiment of the present invention
  • the four destination nodes are used as an example to illustrate the flow of interaction between nodes in a network traffic sharing system.
  • the technical solutions in the embodiments of the present invention are clearly and completely described in the following with reference to the accompanying drawings in the embodiments of the present invention. It is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. example. All other embodiments obtained by a person of ordinary skill in the art based on the embodiments of the present invention without creative efforts are within the scope of the present invention.
  • An embodiment of the present invention provides a method for network traffic sharing, which is suitable for adding load balancing of a perturbation factor, and is also suitable for packet forwarding. As shown in FIG. 2, the method includes:
  • Step 21 Receive a packet sent by the upper node, where the packet carries a flow label.
  • the upper node may include a source node (ingress edge advertiser device) or a superior intermediate node; and the ingress edge quotient device may be a router.
  • the ingress edge device provides access to a corporate or group virtual private network (VPN) to provide access to the metro Ethernet.
  • the ingress edge device may be configured to receive the packet sent by the user side, and parse the received packet information by hashing the HASH outflow label, and insert the stream label into the packet to send to the lower node.
  • VPN virtual private network
  • the process of parsing the received packet information hash HASH egress label may include, but is not limited to: the source IP (Internet Protocol, IP) address, the destination IP address, the source medium access control MAC address of the packet, Two or more parameters of the destination medium access control MAC address and port number are hashed and the hash label is parsed out; for example: Hash HASH is parsed between the source IP address and the destination IP address of the packet to parse the stream label; HASH can have many ways, such as "same or" operation or "exclusive OR” operation, for example, the source IP address is used. XOR the destination IP address to get the flow label.
  • IP Internet Protocol
  • the intermediate node may be a backbone router in the network, but it is not directly connected to the user edge device CE (CE, Customer Edge).
  • CE Customer Edge
  • the intermediate node has a basic multi-protocol label switching (MPLS) forwarding function, and does not maintain multi-protocol label switching information.
  • MPLS multi-protocol label switching
  • the stream tag is 4 bytes (32 bits) long.
  • the encapsulation structure of the flow label is as shown in FIG. 3.
  • the flow label may include a 20-bit label value field, a 3-bit extension field (Exp ), a 1-bit stack bottom identification field (S), and 8-bit survival.
  • Time domain (TTL) Time domain
  • Step 22 Adjust the flow label, so that the flow labels between the adjacent intermediate nodes are different. Specifically, the flow labels in the packets received by each intermediate node are the same, that is, are sent by the ingress edge merchant device. The flow label in the message. The flow label is adjusted only within the intermediate node.
  • the predetermined rule can be determined according to the actual situation of the network traffic or the specific settings of the operator.
  • the flow label of the intermediate node is adjusted according to the predetermined rule, so that the flow label between the adjacent intermediate nodes is not
  • the same can be, if there are three intermediate nodes, where the first intermediate node is sent to the second intermediate node, and the second intermediate node is sent to the third intermediate node as an example, the first intermediate node can not adjust the received flow label, and
  • the secondary intermediate node adjusts the received flow label, and the third-level intermediate node may also adjust the received flow label, or may use different rules between adjacent intermediate nodes to perform the received flow label.
  • the predetermined rules may include but are not limited to the following:
  • the value of the flow label or the value of the label value field in the flow label is modulo the total number of the equivalent routing, and other algorithms are also possible.
  • the value of the flow label value field is 8 of the flow label, the total number of equivalent routing is 5, the modulo is obtained by 3, and the selected path is represented by the modulo result;
  • the odd and even bits of the 20-bit data of the tag value field in the stream tag For example, if the odd and even bits of the lower 10 bits of data can be exchanged, the odd and even bits of the 20-bit data can be exchanged, for example, the odd and even bits of the lower 10 bits of data are exchanged, and the lower 10 bits are replaced.
  • the data is 0101010110, then it becomes 1010101001 after the exchange, then the upper intermediate node is selected according to the flow label before adjustment, and the intermediate nodes of the current level are selected according to the adjusted flow label, so the path selected by them is Different, it avoids the problem of failure of intermediate nodes in this level;
  • the data of the upper 10 bits and the lower 10 bits may be exchanged, or may be lower 10
  • the upper 5 bits of the bit are exchanged with the data of the lower 5 bits; for example: the high 5 bits of the lower 10 bits are exchanged with the data of the lower 5 bits, and the data of the lower 10 bits is 01010101 10, then the exchange After the change becomes 1011001010, then the upper intermediate node is selected according to the flow label before the adjustment, and the intermediate nodes of the current level are selected according to the adjusted flow label, so the paths selected by them are different, thus avoiding the The problem of failure of the intermediate node;
  • the 3-bit data is 011
  • the intermediate node of the upper level is based on The flow label routing before adjustment, and the intermediate nodes of the current level are selected according to the adjusted flow label, so the paths selected by them are different, and the problem of failure of the intermediate nodes of the level is avoided;
  • the 8-bit data is 10010011, and is changed to become 01100011 after being exchanged;
  • Step 23 Perform an equivalent path selection according to the adjusted flow label.
  • the corresponding path is selected according to the flow label.
  • the flow label For example, there are six paths with the same route cost, namely L0, L1, L2, L3, L4, and L5, and the flow label value field.
  • the values are 8 and 17, respectively, and the modulo is 2 and 5 respectively, then their paths are L2 and L5 respectively; or the flow labels are adjusted according to other methods so that they are different from the flow labels of the upper intermediate nodes, then they are The selected path is different, which avoids the problem that the intermediate node in this level fails.
  • the primary node R1 As shown in Figure 4, the primary node R1, the secondary intermediate nodes R2 and R3, and the destination node R4,
  • R5, R6, and R7 transmit four packets as an example:
  • Step 41 R1 sends the packets f1 and f3 to R2 according to the flow label in the received packet, and sends the packets f2 and f4 to R3.
  • Step 42 R2 adjusts the flow labels in the received messages f1 and f3 so as to be different from the flow labels of R1, and R3 adjusts the flow labels in the received messages f2 and f4 to make The flow labels of R1 are not equal;
  • Step 43 R2 sends the packet ⁇ and f3 to R4 and R5 respectively according to the adjusted packet f and the flow label of f3; R3 sends the packet f2 and f4 according to the flow label of the adjusted packets f2 and f4 respectively.
  • R6 and R7 R2 sends the packet ⁇ and f3 to R4 and R5 respectively according to the adjusted packet f and the flow label of f3; R3 sends the packet f2 and f4 according to the flow label of the adjusted packets f2 and f4 respectively.
  • the storage medium may be a magnetic disk, an optical disk, or a read-only storage memory.
  • ROM Read-Only Memory
  • RAM Random Access Memory
  • the method for implementing network traffic sharing by using the middle level or above
  • the node adjusts the flow label parsed by the received packet to be different from the flow label obtained by the upper-level intermediate node, so that the traffic sharing of each node is effective, and the flexibility of traffic sharing of each node is improved.
  • the flow labels of the intermediate nodes can be flexibly adjusted according to the actual network traffic conditions, so as to achieve the randomness and dispersion of the flow labels used by the intermediate nodes for routing, and objectively improve the traffic sharing in the probability. distributed.
  • a device for network traffic sharing which is suitable for load sharing of a disturbance factor, and is also suitable for packet forwarding. As shown in FIG. 5, the device is disposed in an intermediate node.
  • the receiving module 51, the adjusting module 52 and the routing module 53 are included, wherein:
  • the receiving module 51 is configured to receive a packet sent by the upper node, where the packet carries a flow label.
  • the upper node may include a source node (ingress edge quotient device) or a superior intermediate node; the length of the flow label is 4 bytes (32 bits), and the encapsulation structure is as shown in FIG. 3, and may include a 20-bit tag value field. (Label), 3-bit extended field (Exp), 1-bit stack bottom identification field (S), and 8-bit lifetime time domain (TTL);
  • the adjustment module 52 is configured to adjust the flow label received by the receiving module 51, so that the flow labels between adjacent intermediate nodes are different;
  • the flow labels in the packets received by each intermediate node are the same, that is, the flow labels in the packets sent by the ingress edge quotient device.
  • the flow label is adjusted only within the intermediate node.
  • the predetermined rule can be determined according to the actual situation of the network traffic or the specific settings of the operator.
  • the flow label of the intermediate node is adjusted according to the predetermined rule, so that the flow label between the adjacent intermediate nodes is not
  • the same can be, if there are three intermediate nodes, where the first intermediate node is sent to the second intermediate node, and the second intermediate node is sent to the third intermediate node as an example, the first intermediate node can not adjust the received flow label, and
  • the secondary intermediate node adjusts the received flow label, and the third-level intermediate node may also adjust the received flow label, or may adjust the received flow label by using different rules between adjacent intermediate nodes.
  • the predetermined rule may include but is not limited to the following: And the value of the flow label or the value of the label value field in the flow label is modulo the total number of the equivalent routing, for example, a flow label with a value of 8 in the flow label value field, which is equivalently selected The total number of roads is 5, and the modulus is obtained by 3, and the selected path is represented by the modulo result;
  • swapping the odd-numbered bits and the even-numbered bits of the 20-bit data of the tag value field in the stream tag for example, the odd-numbered bits and the even-numbered bits in the lower 10-bit data can be exchanged, and the odd-numbered bits and the even-numbered bits in the 20-bit data can also be used.
  • Bit swapping, etc. for example, in the lower 10-bit data, the odd-numbered bits are exchanged with the even-numbered bits, and the lower-order 10-bit data is 0101010110, then the switch becomes 1010101001, then the upper-level intermediate node is selected according to the stream label before the adjustment.
  • the intermediate nodes of the current level are selected according to the adjusted flow labels, so the paths selected by them are different, and the problem of failure of the intermediate nodes of the level is avoided;
  • the data of the upper 10 bits and the lower 10 bits may be exchanged, or may be lower 10
  • the upper 5 bits of the bit are exchanged with the data of the lower 5 bits; for example: the high 5 bits of the lower 10 bits are exchanged with the data of the lower 5 bits, and the data of the lower 10 bits is 01010101 10, then the exchange After the change becomes 1011001010, then the upper intermediate node is selected according to the flow label before the adjustment, and the intermediate nodes of the current level are selected according to the adjusted flow label, so the paths selected by them are different, thus avoiding the The problem of failure of the intermediate node;
  • the 3-bit data is 011
  • the intermediate node of the upper level is based on The flow label selection before the adjustment, and the intermediate nodes of the current level are selected according to the adjusted flow label, so the paths selected by them are different, and the failure of the intermediate nodes of the level is avoided. question;
  • the 8-bit data is 10010011, and is changed to become 01100011 after being exchanged;
  • the two bits of the 8-bit data in the time-of-day domain in the stream tag and the different values may be exchanged.
  • the 8-bit data is 1001001 1, and the value is changed to 01010011 or 10011 100.
  • the routing module 53 is configured to perform an equivalent path routing according to the flow label adjusted by the adjustment module 52.
  • the corresponding path is selected according to the flow label.
  • the flow label For example, there are six paths with the same route cost, namely L0, L1, L2, L3, L4, and L5, and the flow label value field.
  • the values are 8 and 17, respectively, and the modulo is 2 and 5 respectively, then their paths are L2 and L5 respectively; or the flow labels are adjusted according to other methods so that they are different from the flow labels of the upper intermediate nodes, then they are The selected path is different, which avoids the problem that the intermediate node in this level fails.
  • the embodiment of the present invention further provides a network traffic sharing system, including the foregoing network traffic sharing device and an upper node, where the upper node may include an ingress edge advertiser device or a superior intermediate node.
  • the ingress edge quotient device may be configured to receive the sent packet of the user side, and parse the received packet information by hashing the HASH outgoing label, and insert the flow label into the packet and send the packet to the lower node.
  • the process of parsing the received packet information hash HASH egress label may include, but is not limited to: the source IP address, the destination IP address, the source medium access control MAC address, and the destination medium access control MAC address of the packet.
  • the two or more parameters of the port number are hashed and the hash label is parsed out; for example: hashing the source IP address and the destination IP address of the packet to the flow label; HASH Can be in many ways, like or For example, the XOR operation is performed by XORing the source IP address with the destination IP address to obtain a stream label.
  • the source node is the ingress edge Provider R0, the primary intermediate node R1, the secondary intermediate nodes R2 and R3, and the destination nodes R4, R5, R6, and R7 transmit four packets as an example:
  • Step 61 R0 receives the packets l, f2, f3, and f4 sent by the user side, and after hashing the HASH outflow label by parsing the received packet information, inserting the flow label into the corresponding packet respectively. Send to the first intermediate node R1;
  • Step 62 R1 sends the packets f1 and f3 to R2 according to the flow label in the received packet, and sends the packets f2 and f4 to R3.
  • Step 63 R2 adjusts the flow labels in the received messages f1 and f3 so as to be different from the flow labels of R1, and R3 adjusts the flow labels in the received messages f2 and f4 to make The flow labels of R1 are not equal;
  • Step 64 R2 sends the packet ⁇ and f3 to R4 and R5 respectively according to the adjusted packet and the flow label of f3; R3 sends the packet f2 and f4 according to the flow label of the adjusted packets f2 and f4 respectively. Give R6 and R7.
  • the method, the device and the system for implementing the network traffic sharing solved the problem that the flow label in the received packet is adjusted by the intermediate node to be different from the flow label obtained by the upper intermediate node.
  • the effect of the secondary or multi-stage load sharing scenario is weakened or even invalid, so that the traffic sharing of each node is effective, and the flexibility of traffic sharing of each node is improved.
  • the flow label of each intermediate node can be based on actual conditions.
  • the network traffic condition can be flexibly adjusted to achieve the randomness and dispersion of the flow labels used by each intermediate node for routing, and objectively improve the uniformity distribution of the traffic sharing in probability.

Description

一种网络流量分担的方法、 装置及系统
本申请要求于 2010年 07月 02日提交中国专利局、 申请号为 CN201010223998.3 , 发明名称为 "一种网络流量分担的方法、 装置及系 统" 的中国专利申请的优先权， 其全部内容通过引用结合在本申请中。 技术领域 本发明涉及网络通信技术， 尤其涉及一种网络流量分担的方法、 装置 及系统。 背景技术 现有的网络流量分担方法如图 1所示， 流量由源节点 R0进入， 经由中间 节点 P分担到目的节点 R1、 R2和 R3， 现有的中间节点 P通过解析出的报文 中的流标签进行下一步等价选路，到达出节点 R1、 R2和 R3时删除所述流标 签。
在实现本发明过程中， 发明人发现现有技术中至少存在如下问题： 现有的网络流量分担方法只适用于只存在一个中间节点的情况， 一旦 有两个及以上中间节点时， 每个中间节点通过流标签等价选路的方式都相 同， 故到了第二级或下几级中间节点， 就无法实现分路， 从而导致各节点 流量分担失效。 发明内容 本发明的实施例提供了一种网络流量分担的方法、 装置及系统， 在存 在多个中间节点时， 提高各节点流量分担的灵活性。
本发明实施例提供了一种网络流量分担的方法， 包括： 接收上级节点发送的报文中的流标签， 对所述流标签进行调整， 使相 邻中间节点之间的流标签不同；
根据所述调整后的流标签进行等价路径选路。
本发明实施例还提供了一种网络流量分担的装置， 所述装置设置于中 间节点中， 包括：
接收模块， 用于接收上级节点发送的报文中的流标签；
调整模块， 用于根据预定的规则对所述接收模块接收的所述流标签进 行调整， 使相邻中间节点之间的流标签不同；
选路模块， 用于根据所述调整模块调整后的所述流标签进行等价路径 选路。
本发明实施例还提供了一种网络流量分担的系统， 其特征在于， 包括 所述的网络流量分担的装置及上级节点， 所述上级节点包括入口边缘商设 备或上级中间节点， 所述入口边缘商设备用于接收用户侧发送的报文并通 过解析所述接收的报文信息哈希 HASH出流标签后，将所述流标签插入报文 中发送给下级中间节点。
由上述本发明的实施例提供的技术方案可以看出， 其通过在中间节点 对接收到的报文中的流标签进行调整， 使相邻中间节点获得的流标签不相 同， 从而使各节点流量分担均有效， 提高了各节点流量分担的灵活性。 附图说明 为了更清楚地说明本发明实施例的技术方案， 下面将对实施例描述中 所需要使用的附图作简单地介绍， 显而易见地， 下面描述中的附图仅仅是 本发明的一些实施例， 对于本领域普通技术人员来讲， 在不付出创造性劳 动性的前提下， 还可以根据这些附图获得其他的附图。
图 1为现有技术中网络流量分担方法中节点间的结构示意图； 图 2为本发明实施例所述的一种网络流量分担方法的流程示意图； 图 3为本发明实施例所述流标签的封装结构示意图；
图 4为本发明实施例以 1个一级中间节点， 2个二级中间节点和 4个目的 节点为例， 说明之间交互的流程示意图；
图 5为本发明实施例所述的一种网络流量分担装置的结构示意图； 图 6为本发明实施例以源节点、 1个一级中间节点， 2个二级中间节点和
4个目的节点为例， 说明所述的一种网络流量分担系统中各节点之间交互的 流程示意图。 具体实施方式 下面将结合本发明实施例中的附图， 对本发明实施例中的技术方案进 行清楚、 完整地描述， 显然， 所描述的实施例仅仅是本发明一部分实施例， 而不是全部的实施例。 基于本发明中的实施例， 本领域普通技术人员在没 有作出创造性劳动前提下所获得的所有其他实施例， 都属于本发明保护的 范围。
本发明实施例提供了一种网络流量分担的方法， 它适合于加入扰动因 素的负载分担， 也适合于报文的转发， 如图 2所示， 该方法包括：
步骤 21、 接收上级节点发送的报文， 该报文中携带有流标签。
具体地， 上级节点可以包括源节点 （入口边缘商设备）或上级中间节 点； 所述入口边缘商设备可以是路由器。 入口边缘设备提供企业或集团虚 拟专用网络（VPN， Virtual Private Network ) 的接入服务， 提供城域以太 的接入。 入口边缘设备可以用于接收用户侧发送的报文并通过解析所述接 收的报文信息哈希 HASH出流标签， 并将所述流标签插入报文中发送给下 级节点。 通过解析所述接收的报文信息哈希 HASH出流标签的过程可以包 括但不限于： 将所述报文的源 IP ( Internet Protocol , IP )地址、 目的 IP 地址、 源介质访问控制 MAC地址、 目的介质访问控制 MAC地址及端口号 中的两项或两项以上参数进行哈希 HASH解析出所述流标签； 例如： 将所 述报文的源 IP地址与目的 IP地址之间进行哈希 HASH解析出所述流标签； HASH 可以有很多方式， 如 "同或" 运算或者 "异或" 运算等， 例如， 将 源 IP地址与目的 IP地址进行异或运算得到流标签。
进一步， 所述中间节点可以是网络中的骨干路由器， 但其不与用户边 缘设备 CE ( CE, Customer Edge ) 直接相连。 所述中间节点具备基本的 多协议标签交换（ MPLS, Multi-Protocol Label Switching )转发功能， 不 维护多协议标签交换信息。 流标签的长度为 4个字节 （32 比特）。 该流标 签的封装结构如图 3所示，该流标签可以包括 20比特的标签值域（ Label )、 3比特的扩展域（ Exp )、 1比特的栈底标识域（ S ) 以及 8比特生存时间域 ( TTL );
步骤 22、 调整所述流标签， 使相邻中间节点之间的流标签不同； 具体地， 每个中间节点接收的报文中的流标签都是相同的， 即都是入 口边缘商设备发送的报文中的流标签。 调整流标签仅限于中间节点内部， 可以根据网络流量的实际情况或运营商的具体设置确定预定的规则， 根据 预定的规则调整中间节点的流标签， 只要使相邻中间节点之间的流标签不 相同即可， 如有三个中间节点， 其中一级中间节点发送给二级中间节点， 二级中间节点发送给三级中间节点为例， 一级中间节点可以对接收到的流 标签不调整， 而二级中间节点对接收到的流标签进行调整， 且三级中间节 点也可以对接收到的流标签不进行调整， 或者也可以对相邻中间节点间采 用不同的规则对接收到的流标签进行调整， 所述预定的规则可以包括但不 限于以下几种：
将所述流标签的数值或所述流标签中的标签值域的数值对所述等价选 路的总条数取模， 采用其它的算法也是可以的， 例如， 流标签值域的数值 为 8的流标签， 等价选路的总条数为 5， 取模得到 3， 用所述取模结果表示选 择的路径；
或将所述流标签中的标签值域的 20比特数据的奇数位和偶数位的调 换， 如可以把低 10比特数据中奇数位与偶数位调换， 也可以把 20比特数据 中奇数位与偶数位调换等， 例如， 低 10比特数据中奇数位与偶数位进行调 换， 低 10比特的数据为 0101010110， 那么调换后变为 1010101001， 那么 上一级中间节点是根据调整前的流标签选路， 而本级中间节点是根据调整 后的流标签进行选路， 故它们选择的路径就不相同， 就避免了本级中间节 点失效的问题；
或将所述流标签中的标签值域的 20比特数据中的 2比特位及以上不同 数值间的调换， 如可以把高 10比特位与低 10比特位的数据进行调换， 也可 以把低 10比特中的高 5比特位与低 5比特位的数据进行调换； 例如： 把低 10 比特中的高 5比特位与低 5比特位的数据进行调换， 低 10比特的数据为 01010101 10, 那么调换后变为 1011001010， 那么上一级中间节点是根据 调整前的流标签选路， 而本级中间节点是根据调整后的流标签进行选路， 故它们选择的路径就不相同， 就避免了本级中间节点失效的问题；
或将所述流标签中的扩展域的 3比特数据奇数位和偶数位的不同数值 进行调换， 例如 3比特数据为 101， 调换后变为 110或 01 1， 那么上一级中间 节点是根据调整前的流标签选路， 而本级中间节点是根据调整后的流标签 进行选路， 故它们选择的路径就不相同， 就避免了本级中间节点失效的问 题；
或将所述流标签中的扩展域的 3比特数据中的 2比特位及以上不同数值 间的调换， 例如 3比特数据为 011， 调换后变为 101或 110， 那么上一级中间 节点是根据调整前的流标签选路， 而本级中间节点是根据调整后的流标签 进行选路， 故它们选择的路径就不相同， 就避免了本级中间节点失效的问 题；
或将所述流标签中的生存时间域的 8比特数据奇数位和偶数位的调换， 例如， 8比特数据为 10010011， 调换后变为 01100011 ;
或将所述流标签中的生存时间域的 8比特数据中的 2比特位及以上不同 数值间的调换， 例如， 8比特数据为 1001001 1， 调换后变为 01010011或 10011 100等。
步骤 23、 根据所述调整后的流标签进行等价路径选路。
具体地， 是在路由开销相同的路径中根据所述流标签选择对应的路径， 例如， 共有 6条路由开销相同的路径， 分别为 L0、 L1、 L2、 L3、 L4和 L5， 流标签值域的数值分别为 8和 17，取模分别得到 2和 5， 那么它们的路径分别 为 L2和 L5; 或者根据其它方式将流标签调整后使与上一级中间节点的流标 签不相同， 那么它们选择的路径就不相同， 就避免了本级中间节点失效的 问题。
如图 4所示，以一级中间节点 R1，二级中间节点 R2和 R3， 目的节点 R4、
R5、 R6和 R7， 传输 4条报文为例进行说明：
步骤 41、 R1根据接收到的报文中的流标签将报文 f1和 f3发送给 R2， 将 报文 f2和 f4发送给 R3;
步骤 42、 R2将接收到的报文 f1和 f3中的流标签进行调整， 使之与 R1的 流标签不相等， R3将接收到的报文 f2和 f4中的流标签进行调整， 使之与 R1 的流标签不相等；
步骤 43、 R2根据调整后报文 Π和 f3的流标签， 分别将报文 Π和 f3发送给 R4和 R5; R3根据调整后报文 f2和 f4的流标签， 分别将报文 f2和 f4发送给 R6 和 R7。
本领域普通技术人员可以理解实现上述实施例方法中的全部或部分流 程， 是可以通过计算机程序来指令相关的硬件来完成， 所述的程序可存储 于一计算机可读取存储介质中， 该程序在执行时， 可包括如上述各方法的 实施例的流程。 其中， 所述的存储介质可为磁碟、 光盘、 只读存储记忆体
( Read-Only Memory , ROM ) 或随机存储记忆体 ( Random Access Memory, RAM )等。
本发明实施例所述实现网络流量分担的方法， 通过在二级或以上中间 节点对接收到报文解析出的流标签进行调整， 使其与上一级中间节点获得 的流标签不相同， 从而使各节点流量分担均有效， 提高了各节点流量分担 的灵活性； 同时对各中间节点的流标签可以根据实际的网络流量情况可以 灵活的进行调整， 以达到各中间节点用来选路的流标签的随机性和分散性， 客观上提高了流量分担在概率上的均勾分布。
本发明实施例所述的一种网络流量分担的装置， 它适合于加入扰动因 素的负载分担， 也适合于报文的转发， 如图 5所示， 所述装置设置于中间节 点中， 该装置包括接收模块 51、 调整模块 52和选路模块 53， 其中：
所述接收模块 51， 用于接收上级节点发送的报文， 该报文中携带有流 标签；
具体地， 上级节点可以包括源节点 （入口边缘商设备）或上级中间节 点； 流标签的长度为 4个字节 （32比特） ， 封装结构如图 3所示， 可以包括 20比特的标签值域（Label ) 、 3比特的扩展域（Exp ) 、 1比特的栈底标识 域（S ) 以及 8比特生存时间域（TTL ) ；
调整模块 52， 用于对接收模块 51接收的所述流标签进行调整， 使相邻 中间节点之间的流标签不同；
具体地， 每个中间节点接收的报文中的流标签都是相同的， 即入口边 缘商设备发送的报文中的流标签。 调整流标签仅限于中间节点内部， 可以 根据网络流量的实际情况或运营商的具体设置确定预定的规则， 根据预定 的规则调整中间节点的流标签， 只要使相邻中间节点之间的流标签不相同 即可， 如有三个中间节点， 其中一级中间节点发送给二级中间节点， 二级 中间节点发送给三级中间节点为例， 一级中间节点可以对接收到的流标签 不调整， 而二级中间节点对接收到的流标签进行调整， 且三级中间节点也 可以对接收到的流标签不进行调整， 或者也可以相邻中间节点间采用不同 的规则对接收到的流标签进行调整， 所述预定的规则可以包括但不限于以 下几种： 将所述流标签的数值或所述流标签中的标签值域的数值对所述等价选 路的总条数取模， 例如， 流标签值域的数值为 8的流标签， 等价选路的总条 数为 5， 取模得到 3， 用所述取模结果表示选择的路径；
或将所述流标签中的标签值域的 20比特数据的奇数位和偶数位的调 换， 如可以把低 10比特数据中奇数位与偶数位调换， 也可以把 20比特数据 中奇数位与偶数位调换等， 例如， 低 10比特数据中奇数位与偶数位进行调 换， 低 10比特的数据为 0101010110， 那么调换后变为 1010101001， 那么 上一级中间节点是根据调整前的流标签选路， 而本级中间节点是根据调整 后的流标签进行选路， 故它们选择的路径就不相同， 就避免了本级中间节 点失效的问题；
或将所述流标签中的标签值域的 20比特数据中的 2比特位及以上不同 数值间的调换， 如可以把高 10比特位与低 10比特位的数据进行调换， 也可 以把低 10比特中的高 5比特位与低 5比特位的数据进行调换； 例如： 把低 10 比特中的高 5比特位与低 5比特位的数据进行调换， 低 10比特的数据为 01010101 10, 那么调换后变为 1011001010， 那么上一级中间节点是根据 调整前的流标签选路， 而本级中间节点是根据调整后的流标签进行选路， 故它们选择的路径就不相同， 就避免了本级中间节点失效的问题；
或将所述流标签中的扩展域的 3比特数据奇数位和偶数位的不同数值 进行调换， 例如 3比特数据为 101， 调换后变为 110或 01 1， 那么上一级中间 节点是根据调整前的流标签选路， 而本级中间节点是根据调整后的流标签 进行选路， 故它们选择的路径就不相同， 就避免了本级中间节点失效的问 题；
或将所述流标签中的扩展域的 3比特数据中的 2比特位及以上不同数值 间的调换， 例如 3比特数据为 011， 调换后变为 101或 110， 那么上一级中间 节点是根据调整前的流标签选路， 而本级中间节点是根据调整后的流标签 进行选路， 故它们选择的路径就不相同， 就避免了本级中间节点失效的问 题；
或将所述流标签中的生存时间域的 8比特数据奇数位和偶数位的调换， 例如， 8比特数据为 10010011， 调换后变为 01100011 ;
或将所述流标签中的生存时间域的 8比特数据中的 2比特位及以上不同 数值间的调换， 例如， 8比特数据为 1001001 1， 调换后变为 01010011或 10011 100等。
选路模块 53， 用于根据调整模块 52调整后的所述流标签进行等价路径 选路。
具体地， 是在路由开销相同的路径中根据所述流标签选择对应的路径， 例如， 共有 6条路由开销相同的路径， 分别为 L0、 L1、 L2、 L3、 L4和 L5， 流标签值域的数值分别为 8和 17，取模分别得到 2和 5， 那么它们的路径分别 为 L2和 L5; 或者根据其它方式将流标签调整后使与上一级中间节点的流标 签不相同， 那么它们选择的路径就不相同， 就避免了本级中间节点失效的 问题。
上述装置中包含的各模块的处理功能的具体实现方式在之前的方法实 施例中已经描述， 在此不再重复描述。
本发明实施例还提供了一种网络流量分担的系统， 包括上述一种网络 流量分担的装置及上级节点， 所述上级节点可以包括入口边缘商设备或上 级中间节点。
进一步， 所述入口边缘商设备可以用于接收用户侧的发送的报文并通 过解析所述接收的报文信息哈希 HASH出流标签，并将所述流标签插入报文 中发送给下级节点。通过解析所述接收的报文信息哈希 HASH出流标签的过 程可以包括但不限于： 将所述报文的源 IP地址、 目的 IP地址、 源介质访问控 制 MAC地址、 目的介质访问控制 MAC地址及端口号中的两项或以上参数进 行哈希 HASH解析出所述流标签； 例如： 将所述报文的源 IP地址与目的 IP地 址之间进行哈希 HASH解析出所述流标签； HASH可以很多方式， 如同或运 算或者异或运算等，例如，将源 IP地址与目的 IP地址进行异或运算得到流标 签。
如图 6所示， 以源节点即入口边缘商设备 R0， 一级中间节点 R1， 二级 中间节点 R2和 R3， 目的节点 R4、 R5、 R6和 R7， 传输 4条报文为例进行说 明：
步骤 61、 R0接收用户侧发送的报文 l、 f2、 f3和 f4， 并通过解析所述接 收的报文信息分别哈希 HASH出流标签后，将所述流标签分别插入相应的报 文中发送给一级中间节点 R1；
步骤 62、 R1根据接收到的报文中的流标签将报文 f1和 f3发送给 R2， 将 报文 f2和 f4发送给 R3;
步骤 63、 R2将接收到的报文 f1和 f3中的流标签进行调整， 使之与 R1的 流标签不相等， R3将接收到的报文 f2和 f4中的流标签进行调整， 使之与 R1 的流标签不相等；
步骤 64、 R2根据调整后报文 Π和 f3的流标签， 分别将报文 Π和 f3发送给 R4和 R5; R3根据调整后报文 f2和 f4的流标签， 分别将报文 f2和 f4发送给 R6 和 R7。
本发明实施例提供的实现网络流量分担的方法、 装置及系统， 通过在 中间节点对接收的报文中的流标签进行调整， 使其与上一级中间节点获得 的流标签不相同， 解决了现有技术中在二级或多级负载分担场景效果减弱 甚至失效的问题， 从而使各节点流量分担均有效， 提高了各节点流量分担 的灵活性； 同时对各中间节点的流标签可以根据实际的网络流量情况可以 灵活的进行调整， 以达到各中间节点用来选路的流标签的随机性和分散性， 客观上提高了流量分担在概率上的均勾分布。
以上所述， 仅为本发明较佳的具体实施方式， 但本发明的保护范围并不局 限于此， 任何熟悉本技术领域的技术人员在本发明揭露的技术范围内， 可 轻易想到的变化或替换， 都应涵盖在本发明的保护范围之内。 因此， 本发 明的保护范围应该以权利要求的保护范围为准。

Claims

权利要求
1、 一种网络流量分担的方法， 其特征在于， 包括：
接收上级节点发送的报文中的流标签，
对所述流标签进行调整， 使相邻中间节点之间的流标签不同； 根据所述调整后的流标签进行等价路径选路。
2、 根据权利要求 1所述的方法， 其特征在于， 所述对所述流标签进行 调整为： 根据预定的规则对流标签进行调整。
3、 根据权利要求 1或 2所述的方法， 其特征在于， 所述上级节点发送到 报文中的流标签包括标签值域、 扩展域、 栈底标识域以及生存时间域。
4、 根据权利要求 1或 2或 3所述的方法， 其特征在于， 所述上级节点发 送到报文中的流标签包括标签值域、 扩展域、 栈底标识域以及生存时间域。
5、 根据权利要求 2-4中任一所述的方法， 其特征在于， 所述预定的规 则根据网络流量的实际情况或运营商的具体设置确定， 包括：
将所述流标签的数值或所述流标签中的标签值域的数值对所述等价选 路的总条数取模；
或将所述流标签中的标签值域的 20比特数据的奇数位和偶数位调换； 或将所述流标签中的标签值域的 20比特数据中的 2比特位及以上不同 数值间的调换；
或将所述流标签中的扩展域的 3比特数据奇数位和偶数位的调换； 或将所述流标签中的扩展域的 3比特数据中的 2比特位及以上不同数值 间的调换；
或将所述流标签中的生存时间域的 8比特数据奇数位和偶数位的调换； 或将所述流标签中的生存时间域的 8比特数据中的 2比特及以上不同数 值间的调换。
6、 根据权利要求 5中任一所述的方法， 其特征在于， 所述等价路径 选路是在路由开销相同的路径中根据所述流标签选择对应的路径。
7、 一种网络流量分担的装置， 其特征在于， 所述装置设置于中间节点 中， 包括：
接收模块， 用于接收上级节点发送的报文中的流标签；
调整模块， 用于根据预定的规则对所述接收模块接收的所述流标签进 行调整， 使相邻中间节点之间的流标签不同；
选路模块， 用于根据所述调整模块调整后的所述流标签进行等价路径 选路。
8、 根据权利要求 7所述的装置， 其特征在于， 所述接收模块接收到的 所述流标签包括标签值域、 扩展域、 栈底标识域以及生存时间域。
9、 根据权利要求 7或 8所述的装置， 其特征在于， 所述调整模块中所述 预定的规则根据网络流量的实际情况或运营商的具体设置确定， 包括： 将所述流标签的数值或所述流标签中的标签值域的数值对所述等价选 路的总条数取模；
或将所述流标签中的标签值域的 20比特数据的奇数位和偶数位的调 换；
或将所述流标签中的标签值域的 20比特数据中的 2比特位及以上不同 数值间的调换；
或将所述流标签中的扩展域的 3比特数据奇数位和偶数位的调换； 或将所述流标签中的扩展域的 3比特数据中的 2比特位及以上不同数值 间的调换；
或将所述流标签中的生存时间域的 8比特数据奇数位和偶数位的调换； 或将所述流标签中的生存时间域的 8比特数据中的 2比特位及以上不同 数值间的调换。
10、根据权利要求 7-9中任一所述的装置，其特征在于，所述选路模块， 具体用于在路由开销相同的路径中根据所述流标签选择对应的路径。
11、 一种网络流量分担的系统， 其特征在于， 包括权利要求 7-10任一 项所述的装置及上级节点， 所述上级节点包括入口边缘商设备或上级中间 节点， 所述入口边缘商设备用于接收用户侧发送的报文并通过解析所述接 收的报文信息哈希 HASH出流标签后，将所述流标签插入报文中发送给下级 中间节点。
12、 根据权利要求 11所述的系统， 其特征在于， 通过解析所述接收的 报文信息哈希 HASH出流标签， 包括：
将所述报文的源 IP地址、 目的 IP地址、 源介质访问控制 MAC地址、 目 的介质访问控制 MAC地址及端口号中的两项或两项以上参数进行哈希 HASH解析出所述流标签。
PCT/CN2011/073855 2010-07-02 2011-05-10 一种网络流量分担的方法、装置及系统 WO2012000349A1 (zh)

Priority Applications (3)

Application Number Priority Date Filing Date Title
EP11800094A EP2512077A1 (en) 2010-07-02 2011-05-10 Method, apparatus and system for sharing network flow
JP2012550316A JP5706914B2 (ja) 2010-07-02 2011-05-10 ネットワーク・トラフィックを共有する方法、装置およびシステム
US13/722,799 US20130107717A1 (en) 2010-07-02 2012-12-20 Method, apparatus, and system for sharing network traffic

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201010223998.3 2010-07-02
CN201010223998.3A CN102143041B (zh) 2010-07-02 2010-07-02 一种网络流量分担的方法、装置及系统

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US13/722,799 Continuation US20130107717A1 (en) 2010-07-02 2012-12-20 Method, apparatus, and system for sharing network traffic

Publications (1)

Publication Number Publication Date
WO2012000349A1 true WO2012000349A1 (zh) 2012-01-05

Family

ID=44410280

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2011/073855 WO2012000349A1 (zh) 2010-07-02 2011-05-10 一种网络流量分担的方法、装置及系统

Country Status (5)

Country Link
US (1) US20130107717A1 (zh)
EP (1) EP2512077A1 (zh)
JP (2) JP5706914B2 (zh)
CN (1) CN102143041B (zh)
WO (1) WO2012000349A1 (zh)

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8750121B2 (en) 2011-10-28 2014-06-10 Telefonaktiebolaget L M Ericsson (Publ) Addressing the large flow problem for equal cost multi-path in the datacenter
US9137144B2 (en) * 2012-09-28 2015-09-15 Alcatel Lucent Method and apparatus for communication path selection
CN104486236B (zh) * 2014-11-28 2018-02-06 华为技术有限公司 负载分担的方法和路由设备
CN106257876B (zh) * 2015-06-16 2020-09-15 中兴通讯股份有限公司 标签处理方法、路由信息下发方法及装置
CN108881054A (zh) * 2018-09-13 2018-11-23 新华三技术有限公司 报文转发方法和装置
CN110599005B (zh) * 2019-08-23 2023-01-31 东软集团股份有限公司 流程解析方法、装置、计算机可读存储介质和电子设备
CN111277504B (zh) * 2020-01-20 2022-03-25 烽火通信科技股份有限公司 一种在mpls多层标签栈中插入流标签的方法和系统

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1553654A (zh) * 2003-05-26 2004-12-08 华为技术有限公司 网络处理器系统端口捆绑中实现流量均担的方法
US20080123650A1 (en) * 2006-08-04 2008-05-29 Nidhi Bhaskar Technique for avoiding IP lookup with multipoint-to-multipoint label switched paths
CN101325557A (zh) * 2008-07-25 2008-12-17 华为技术有限公司 一种隧道负载分担的方法、系统和装置
CN101527685A (zh) * 2009-04-17 2009-09-09 华为技术有限公司 一种报文传输链路的分配方法和装置
CN101605101A (zh) * 2009-07-15 2009-12-16 中兴通讯股份有限公司 实现负荷分担的方法及装置

Family Cites Families (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7512702B1 (en) * 2002-03-19 2009-03-31 Cisco Technology, Inc. Method and apparatus providing highly scalable server load balancing
US7346706B2 (en) * 2003-05-02 2008-03-18 Alcatel Equivalent multiple path traffic distribution in communications networks
JP4383216B2 (ja) * 2004-03-24 2009-12-16 富士通株式会社 通信端末
JP4598462B2 (ja) * 2004-09-16 2010-12-15 富士通株式会社 Ｌ２−ｖｐｎサービスを提供するプロバイダ網、及びエッジルータ
CN100417138C (zh) * 2005-11-19 2008-09-03 华为技术有限公司 一种负载分担的方法
US8718060B2 (en) * 2006-07-31 2014-05-06 Cisco Technology, Inc. Technique for multiple path forwarding of label-switched data traffic
US7760735B1 (en) * 2007-02-06 2010-07-20 Google Inc. Method and system for discovering network paths
US8149839B1 (en) * 2007-09-26 2012-04-03 Foundry Networks, Llc Selection of trunk ports and paths using rotation
CN101217491A (zh) * 2008-01-04 2008-07-09 杭州华三通信技术有限公司 一种调整流处理单元负载分担的方法及装置
US8416692B2 (en) * 2009-05-28 2013-04-09 Microsoft Corporation Load balancing across layer-2 domains

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1553654A (zh) * 2003-05-26 2004-12-08 华为技术有限公司 网络处理器系统端口捆绑中实现流量均担的方法
US20080123650A1 (en) * 2006-08-04 2008-05-29 Nidhi Bhaskar Technique for avoiding IP lookup with multipoint-to-multipoint label switched paths
CN101325557A (zh) * 2008-07-25 2008-12-17 华为技术有限公司 一种隧道负载分担的方法、系统和装置
CN101527685A (zh) * 2009-04-17 2009-09-09 华为技术有限公司 一种报文传输链路的分配方法和装置
CN101605101A (zh) * 2009-07-15 2009-12-16 中兴通讯股份有限公司 实现负荷分担的方法及装置

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP2512077A4 *

Also Published As

Publication number Publication date
JP2014220837A (ja) 2014-11-20
JP5706914B2 (ja) 2015-04-22
JP2013518487A (ja) 2013-05-20
EP2512077A4 (en) 2012-10-17
CN102143041A (zh) 2011-08-03
CN102143041B (zh) 2014-03-26
US20130107717A1 (en) 2013-05-02
EP2512077A1 (en) 2012-10-17

Similar Documents

Publication Publication Date Title
US9467478B1 (en) Overlay management protocol for secure routing based on an overlay network
US7865615B2 (en) Maintaining IGP transparency of VPN routes when BGP is used as a PE-CE protocol
US8462790B2 (en) Label switching in fibre channel networks
US9350650B2 (en) Switching to a backup traffic path by a label switching router in a multi-protocol label switching network
US9537752B2 (en) Encoding inter-domain shared service paths
WO2012000349A1 (zh) 一种网络流量分担的方法、装置及系统
WO2019210769A1 (en) Explicit routing with network function encoding
EP2667548B1 (en) Network traffic volume distribution method, network node, and system
CN113347091B (zh) 灵活算法感知边界网关协议前缀分段路由标识符
US20090147674A1 (en) Loop prevention techniques using encapsulation manipulation of ip/mpls field
US20110161657A1 (en) Method and system for providing traffic hashing and network level security
EP1997017A2 (en) Technique for preventing routing loops by disseminating bgp attribute information in an ospf-configured network
WO2014034097A1 (en) Path control system, control apparatus, edge node, path control method, and program
US7154899B2 (en) Protecting the filtering database in virtual bridges
US11240063B2 (en) Methods, nodes and computer readable media for tunnel establishment per slice
EP2975808B1 (en) Method for packet processing and packet device and system
CN107566286B (zh) 用于有效的内容递送网络对等的分散式宽带网络网关功能
US9912598B2 (en) Techniques for decreasing multiprotocol label switching entropy label overhead
JP5426024B2 (ja) 内側のｍｐｌｓラベルと外側のｍｐｌｓラベルとの連結
Previdi et al. IS-IS Traffic Engineering (TE) Metric Extensions
TW200814633A (en) Method for differentiating pseudowire packets from multi-protocal label switching packets
Cisco Configuring IP Enhanced IGRP
JP2006246087A (ja) データフレーム転送装置およびデータフレーム転送方法
Reuter Source Packet Routing in Networking (SPRING)
Garg Label Distribution Protocol & Loop Free Alternative

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: 11800094

Country of ref document: EP

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 5754/CHENP/2012

Country of ref document: IN

REEP Request for entry into the european phase

Ref document number: 2011800094

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 2011800094

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 2012550316

Country of ref document: JP

NENP Non-entry into the national phase

Ref country code: DE