Apparatus and method for setup of optimum route using tree-topology
A tree topology and routing technology, applied in star/tree network, data exchange through path configuration, digital transmission system, etc., can solve problems such as inability to store or find routing information, and infeasible routing search
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
no. 1 example
[0037] According to a first embodiment of the invention, a source node establishes a route to a destination node. First, the case of N- routing along the tree is explained, followed by another case of N+ routing along the tree.
[0038] 1. N- in the tree structure
[0039] If N- is the source node, the N-source node determines whether the destination node is its descendant node or ancestor node along the tree route. Although no routing table is stored, N- can determine whether the destination node is its descendant node or an ancestor node by analyzing the address of the destination node, so as to send data packets using the connected tree routing according to this determination. N- The source node searches for a route using N+ located on the route to the destination node as its agent node.
[0040] If N- is an intermediate node, the N-intermediate node relays the received data to its parent node or child node along the tree routing by analyzing the address of the destinatio...
no. 2 example
[0064] According to the second embodiment of the present invention, a routing table capable of containing certain information is assigned to N-nodes, and a concept of a border node is proposed.
[0065] 1. N- in the tree structure
[0066] If the N-node is the source node, the N-node stores the data to be sent in the buffer and locates the location of the destination node. When the destination node is its descendant node, the N-node sends data along the tree route without searching for the route. If the destination node is not its descendant node, even the N-node creates a routing table for the relevant destination node and broadcasts a RREQ message.
[0067] If the N-node is an intermediate node and receives a unicast RREQ message, the N-node updates and sends the received RREQ message along the tree route. If the source node of the RREQ message is its descendant node, and the N-node receives the broadcast RREQ message from its child nodes, the N-node updates and sends the ...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
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