Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Tree root allocation and message processing method and routing network bridge

A routing and tree root technology, which is applied in the field of communication and can solve problems such as message discarding, tree allocation, etc.

Inactive Publication Date: 2013-12-04
ZTE CORP
View PDF3 Cites 24 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] The purpose of the present invention is to provide a method of tree root distribution, message processing and routing bridge, to solve the problems of message discarding and tree distribution among group members

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Tree root allocation and message processing method and routing network bridge
  • Tree root allocation and message processing method and routing network bridge
  • Tree root allocation and message processing method and routing network bridge

Examples

Experimental program
Comparison scheme
Effect test

application example 1

[0113] Application example 1: Point-to-point LAG application scenario

[0114] In the personal draft draft-tissa-trill-cmt-00 of the TRILL working group, an Affinity TLV is proposed, which is used to notify which trees are used by group members when using RBv encapsulation. However, the document adopts a scheme for tree allocation: perform a modulo operation on the sorting number of the tree root and the sorting number of the group members, that is, if there are n trees, the sorting is 1-n, and there are j group members in the group, The tree number assigned to the i-th group member is i, i+j, i+2j...i+xj in n trees, where i+xj<n<i+(x+1)j. This allocation method has nothing to do with the physical location of the specific node and the tree root node. Assume that the tree root allocated to member RB1 is RBi and the tree root allocated to member RB2 is RBj in this way, and RB1 is far from When RBj is close and RB2 is close to RBi, the intermediate link bandwidth will be wasted....

application example 2

[0121] Application example 2: LAN application scenario

[0122] Such as Figure 6 As shown, RB1~RBk are in a routing bridge group, and the nickname of the routing bridge group is RBv, if the root priorities of RB1~RBk are sorted from high to low (it can also be sorted according to other principles, such as when the tree root When the root priorities are the same, they can be sorted by system id. If the system ids are the same, they can be sorted by nickname size) are RB1 to RBk. Suppose RB1 to RBk is configured or elected as RB2 as GDRB. According to the method described in Application Example 1, RB2 performs tree selection calculation, and publishes the tree distribution results to other group members.

[0123] The notification information containing the allocation result can be carried in the HELLO message on the LAN. The message structure is as follows: Figure 4 As shown, in this way, other nodes do not need to perceive the existence of the message, and the group members...

application example 3

[0124] Application example 3: Designation, election and failure handling of GDRB

[0125] The designation, election and invalidation processing of the GDRB in the above application example 1 and application example 2 can be specifically as follows:

[0126] When there is a designated GDRB in the group, GDRB can automatically set its own election priority to the highest according to the automatic election rules, and at the same time send out a message identifying itself as a GDRB (transmitted through the intra-portal link in the group) ), other group members stop the election after receiving the GDRB identification message sent by other members, and wait for the GDRB to release the allocation result. When other group members know that the GDRB is invalid (such as DBR downtime), if other nodes in the group are configured with GDRB, the node will set its own election priority to the highest and send a GDRB identification message, which is determined by Nodes in this group will k...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a tree root allocation and message processing method and a routing network bridge which is applied to a transparent interconnection of lots of links (TRILL) network. The tree root allocation method comprises the steps of using one routing network bridge (RB) as a group designate node (GDRB) in a routing network bridge group, allocating tree roots for each RB in the group according to a tree selection strategy and then informing an allocation result to each RB in the group. Correspondingly, the routing network bridge comprises a tree selection unit for allocating the tree roots for each RB in the group according to the tree selection strategy when the RB is used as the GDRB in the routing network bridge group, an informing unit for informing the allocation result of the tree selection unit for allocating the tree roots for each RB to each RB in the group. After adopting the tree root allocation and message processing method and the routing network bridge, mistaken abandonment of messages can be avoided, tree root allocation is flexibly applied, and members in the group can perform full information share and flexible network configuration through the group designate node and provide guarantee for network application.

Description

technical field [0001] The invention relates to the field of communication, in particular to a method for distributing at the root of a tree, processing messages and a routing bridge. Background technique [0002] TRILL (Transparent Interconnection over Lots of Links, transparent interconnection of multiple links) is a connection layer (L2) network standard recommended by the Internet Engineering Task Force (IETF for short). TRILL introduces an intermediate system to intermediate system (Intermediate System to Intermediate System, IS-IS for short) routing protocol into the L2 network and implements it as a control plane. In the TRILL network, the device running the TRILL protocol is called a router bridge (Router Bridge, RBridge or RB for short), and the RB connected to the terminal is called Edge RB (edge ​​RB, ERB for short), and the entrance RB is called Ingress RB, egress RB is called egress RB. At the entrance of the TRILL network, the original data frame of the end d...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): H04L12/721H04L12/753H04L12/46
Inventor 廖婷翟洪军
Owner ZTE CORP
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com