TWI306707B - Methods for constructing multi-point-link interactive environments using based on point-to-point connections in wireless networks - Google Patents

Description

-1306707

If the invention belongs to the technical field of the invention, and particularly relates to a construction of a multi-point connection, the invention relates to a wireless network system, which uses a point-to-point connection method in a wireless network environment. Environmental methods and systems. [Prior Art] Today's popular network virtual environments (such as On-Line Game) are mainly built under the processing system of the master-slave (CUent/Serv^) architecture. The "master-slave" system architecture should be divided into two parts: the client (clien〇) and the server (Server). The Internet is the Internet. The road phase is coupled. Referring to Figure 1, it is a schematic diagram showing a conventional master-slave architecture. The architecture includes a servo benefit 110 and an application (ie client) 13〇, both of which are through the Internet. Or the transmission medium (not shown) of the local area network is coupled. The user can communicate with the server 11() through the front-end application 13〇, and provide the user with input or output operations such as querying, modifying, printing, etc. The server 11 0 is responsible for executing the command sent by the front-end application 1 3 and transmitting the result of the processing back to the application 丨 3 〇 of the front end, _ directly showing the result to the user. The processing efficiency of the architecture is extremely high. Through proper division of labor, the client application 30 can present a more sophisticated interface to the user, while the server at the end focuses on more efficient execution processing, including data = take, Systems management and security protection, and provides a more flexible, more efficient application environment.

-1306707 Description of Invention (2) ^丨β ί, To construct the above-mentioned connection network by wireless connection, a uses ..., the data base station (Access p〇int) to achieve the purpose. However, the network constructed by the mountain project will reduce the network quality due to too many clients accessing the wireless base station at the same time. In addition, the wireless base station:: The network outside the 16 (four) transmission wheel (four) in the network will not be able to add the wireless interface. The present invention provides a method for constructing a broadcast & line network by using a point-to-point connection method to solve the above problem. problem. The construction of the invention is disclosed in the embodiment of the present invention. The first node in the helmet network is in the first, the -node is provided, and the first item is detected. The message sends a join message to the second node, ^:: point: the first node message replies to the first node, a confirmation message: brother;: point $received: joins the message to select a first logical bit:弟-卽: According to the cluster network, the address is set to form the hierarchy. [Embodiment] In order to make the above-mentioned and the beans of the present invention easy to understand, the following is a better f ^ *, features and advantages. It can be more clearly explained as follows. Preferably, the present invention is disclosed in detail with reference to the accompanying drawings. In the network environment, the point pair 0213-A40410W (N2); K93179; ALEXCHEN. ptd 6 pages^306707

<, invention description (3) black t-party - . Method and system for constructing multi-point connection interactive environment with no green language, the broadcast transmission of radio waves in the profit and luxury road (M u 11 icasting ) Special structure. The embodiment of the present invention includes node addressing, node routing (R〇Uting), node mobility (Mobility), and doing 3 έ H H H E E E E E E E E E E E E E ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ! Communication (MU1 1 CaS 1 ng) and other four parts, the following will be explained separately. Cheng. The first node (the mobile device) is located in the node of the invention (the mobile device). The point-to-point transmission (not called Ad zero 1100) is the wireless network. #丄> The pole is located in the wood structure, where the parent node is represented as one and each node has its transmission radius. The characteristics of the broadcast transmission using radio waves can be used. The wave shape broadcasts.L produces a hierarchical clustered tree structure as shown in Fig. 2. In this network structure & address (L〇gical IP) every two points have a unique logical node communication information, the use of this logical address is 1 3, and, the middle root is the point (R〇〇 t Node ) logical address von i. 3, and its child node logic bamboo 1 Φ, · 佑 佑 a & * section address is 1.0. In the embodiment of the present invention, the data format of the logical address can be any 彡々=up to the parent: the 与其 point and its parent node (~_ the network is established into a tree structure, and the embodiment can be used to utilize the tree structure. Features to solve, do, = the existence of the routing path, but also the problem. When a node joins U = routing and node movement, etc. asks for a unique logical address, when it addresses the program binary structure, it must obtain an x, The program of the address is described as follows. Figure 3 shows the implementation of the present invention - the addition or generation of the swaying device

0213-A40410TWF(N2); K93179;ALEXCHEN.p td Page 7 "306707 ''Five', invention description (4) Steps of the address procedure when the two-tree tree structure is d point ff (ie, the mobile device is turned on) Time) (step paste) 发出 send a message to ❹) if there is no other, then broadcast the node ueighb0r Node)) at the node of the =, address (ie, neighbor), and if so, execute step S14, no list (Step S1, the (4) node of the logical address is in its / / /: step S15. If there is no - tree structure, let it construct the logical address (such as 1.0) and its root Node, define it (Media Access c〇ntr〇1, the following object access control device, MAC address) as the knowledge of the tree (ie, the action S14 element returns to step 311, x). Step 2: If there is a neighbor with a logical address that cannot exist - the tree structure is within its range, the table message is detected in all neighbors r '' :, then broadcast S1". If yes, execute 步=the existence of the root node in step P (steps if all neighbors r 5^ otherwise jump to step S14. The neighboring node sends out one: into f, that is, the existence of the point, when the node receives the message of joining the lang point, the neighbor will point to the neighbor to inform the node of its own logical address (step It is true that the confirmation message includes the neighboring step sn), and the address of the neighboring section of the neighboring section S is still not received. If it is over a period of time, it is given to all the neighboring nodes. When the join message is sent, the node is rooted: when receiving the reply from each neighbor node, it is indeed based on the logical bits contained in all the confirmation messages.

0213-A40410TWF(N2); K93179; ALEXCHEN • Ptd Page 8 1306707 ~~:—'-~~- Ugly, invention description (5) - J " —1 address, calculate the available logical address (step § 1 8) Address ' and select the one with the shortest length of 1 · 2 · 1 and 1.3. . For example, if the reply confirmation message contains 1, 3. 1. The logical address available for the Logic Address is 1· 2. 1 · 1 1.3.1. Let the height of the tree be short, so the node selects the logical address next, the root address is the section of 1 · 3. The logical address selected by the kilobyte is sent to its parent node (that is, the logic of the selected logic ^) As soon as the confirmation message is added (step S1 9 ), the row contact and update f are prepared as their logical addresses, and the parent node is periodically scheduled to perform the - node selection. Step S2〇). If you choose a parent node, if there are multiple possible parent nodes, you can select the parent node address. If the signal strength exceeds a certain threshold, the parent node can be considered as the parent node. . The node with the shorter address length is selected, and the routing path becomes less than the hierarchy of the three tree structures. Thus, the premise of the critical point and the signal strength of the parent node must be too weak, causing node A. ; avoid the signal between some nodes and the parent node ^ m. , ^ ^ 2 to make a small move, lose the contact with the parent node n & I need to re-between the point between the m points, = f There are cases where address conflicts may occur. For example, there are two 铕It ϋ · · 壮 壮 壮 壮 壮 壮 、 、 、 、 、 、 、 、 The example L "King Ding moving device) is far apart, and they are not in the range of the Panshiguang f transmission wheel. ^The two nodes are all logically started at the start: because of the joining of other nodes... Section address=: (Tree Networ k) When it comes together, it will happen that the weight of the pound is heavy. To solve this problem, there are many strategies that can be used. The way to take the order is to start when the address conflict occurs - one = and

0213-A4〇41〇TWF(N2); K93179;ALEXCHEN.ptd 1306707 ~5% of the description of the program (6), the number of nodes with a large number of nodes in accordance with the above obtained logical bits, then, as the main body, the number of nodes The lesser tree address, the new logic that re-takes the address method of the two tree networks, .^ Q 1 becomes one. Next, the process of implementing the routing and sealing in the embodiment of the present invention is shown. The routing table learns that the next point to be maintained by each node includes a child node route to the destination node. Each section Neighbor Table (not shown) and a table are responsible for recording the logic of all current child nodes::: : child: point routing The neighbor routing table is responsible for recording the status of neighbors 乍=2: child nodes. The broadcast address and state of the Ad Hoc wireless network environment, because the data is transmitted by its neighbor nodes; the data of each node is in each parent node and its child = node. The example knows which nodes are nearby. ', heart can let each distance borrowing can help shorten the routing distance when routing data. According to the tree network route established by the above method, if there is no good control mechanism, you can choose the routing path. There is a delay. Therefore, the method of the routing path of the embodiment of the present invention solves the above problem. A method of indenting the younger brother is to, when, the node 44" island gentleman f stores the logical address of the destination node and the logical address recorded in the package itself, and performs a longest header comparison as recorded in the table.

Prefix Match) operation to find the logical address length of the second

•1306707

V-, invention description (7), then send the packet to this node. For example, the reference | (source node) phase is to be transmitted, and the node point of the address is "1.1.1. 1" (the destination node is given; the address is "1.1·2", the section The table is Longest Prefi; = the logical address of the destination node and its own route, 丄1·]"and node',1.]atci\° According to the comparison result, it is found that the node node can arbitrarily select the most of the 2 The length of the header is 3, so the source is in this embodiment, the source section goes to the f (F〇rwarding) node. At the point. When the packet is passed to r, the node ''1 · 1. 1" is selected as the pass. When the first Longest Prefix ^ point ^·1", the node m, will do a Μ · 1.2" longest header length Ch, according to the comparison result, the node degree is found to be 2, so the node "is 3 and the node" The longest header length of ;1.1" is to pass the packet in this way, and the node is passed to the node. The second method is the node.

Prefix Match, which uses the L〇ngest mentioned in the helmet method to make routing more efficient. The function of the broadcast packet is transmitted by the spring packet. The method of the packet is the routing table that the broadcaster transmits to the neighbor node in the Ad hoc network environment; when a node wants to pass the packet to actively inform the packet When the node has the registered node, the neighbor node will have the node "1 _ 1. 2 · Γ. Node "/points"1 _ 1. 1. 1" To pass a packet to a node, the node "1 · 1. 2 · 1, μ · 12 ” is a node "1. 1 _ 1. 1 ” The neighbors in the node "1 1 · 1 · 211 neighbor ^ ^ point 1. 1. 1. 2" of the neighbor node, so the relevant information, so when the node will record the node by the table "1. 1. 2 Γ 2. 1", node" 1. }. j2 ”1 1. Γ want to pass the packet to the node "丨·工. _ Proactively inform the node” 1. 1 · 1 · 1", node

0213-A40410TWF(N2); K93179;ALEXCHEN. Page 11 Ί306707

— _ V. Description of invention (8) When selecting along the seed map, the point is to pass the packet ο 1 „ π± to the selected routing path to the node "] η 丄 丄 = node Μ.1, 1.2" Because it will receive the A ^ temple), and then will find the purpose of the packet to reach 2;; neighbor ί, that is, to inform the node "1. 1.1. 1" via the node "丨' ie / Μ "To the point ''1 · 1. 2. 1", at this time the node 11 1 1 1 1丨| can, 鸾摭_. 郎点""·1· 1. 2" Pass the packet to the node "Κ1·Υ i" More choices via the ί method, using routing cache (R〇Uting Caehe) &Ϊ1'; the package can have a smaller number of jumps in the process of being passed ( C0unt) can be selected. When a packet passes through a node (, ::: walks the basic hierarchical routing path, the node's available point and its selected transit node are recorded in the routing cache. :::: ::The packet passes through the node And to reach the same destination node or moxibustion 2 = branch (child node) _, you can quickly find from the route: transfer the point, and then send the packet through the delivery node = for example, refer to Figure 6, node " ],,, 朗点π 1. 1. 1. When the factory, because of the previous node, Tian Feng G passed to the node "1. 1. 2 factory (such as the dotted arrow _ · · · have passed the packet Cache (the information includes ^ no, and there is the information fast "1. 1. 1. 1 ” find the destination node's address is,,] t. In addition, the node 疋1· 1.2. 1", this address is

0213-A40410TWF(N2) ;K93179;ALEXCHEN.ptd Page 12 •1306707 V-, invention description (9) node "1.1.2.1" (in the previous method, the information of the Hop Count is higher than the level H = 'point) The child node sends a 1π selection via the node "丨.丨.丨狄路仫, so the node "1 ·丨.i. "1. 1. 2. 1" path to pass the packet. h 1. 2" - Node Next, the implementation of the present invention will be described. In the characteristics of the mobile Uobility that moves in the Ad Hoc wireless network, that is, in the tree network, it is necessary to test the sound when the node point is moving, in the embodiment, when the section h (Re -Addressing), 3§^willing to re-address to achieve its purpose: that is, the update mechanism (the action of the Soft node to register and update. The point needs to be periodically with the parent, for example, the old flute 7 Α Ask to join (eg (3: 'Consider a node 其, its original point. If node P is from its parent r # Λ not) and make node A become its parent section input range (it is also possible to move within the transmission range to Node B's transit node B can give node p = move but node A moves). If point P, it must be moved to the original address (as shown in (4)), then the section's action (such as point A) Address release (Address regular update action. Autumn & 5) does not) 'turn to the location of the new parent node B to contact (such as the 7th "β 'If node 1 " move + move to one can only Node B is not the logical address of the node, and if the original parent node is the sender, it must be active. It turns out that the frugality has not been registered and updated for a long time, and the parent node A must next explain the address of the T-two logical address: the action of the address release. Implementation process. Refer to the eighth example to point the point in the tree network. Moving, as mentioned above, assume that node P, originally in the range of the parent's 1130707 _ five., invention description (10) node A, when it wants to replace the parent node A and leave its transmission range, The parent node to be joined (e.g., node 8) issues a join message "step S21)' and judges whether or not the section_reply acknowledgment message is received (step S22). If the acknowledgment message of the Node B is not received, it indicates that it is not within the transmission range of the Node B, so the address described above is performed to obtain a new logical address (step S23). If the node B knife and the signal are received, it is checked whether the logical address length of the new parent node B is shorter than the logical address length of the original parent node A (step S24). If the logical address length of the parent node A is short, the process returns to step s2i, and the node P re-issues the join message to other nodes to re-search. If the logical address length of the parent node B is short, the node 发出 issues a message requesting a logical address (step S25) to become a child node of the parent node β. Next, judge 』 Ρ 要 要 要 要 要 要 要 要 要 要 要 广 广 广 广 广 广 广 广 广 广 广 广 广 广 广 广 广 广 广 广 广Fang Erlang points to receive the message of the node address, and will reply - the confirmation message to = the request logic has not received the confirmation message from the parent node B / the table is here, if the node 15 parent node B moves, causing the node P detachment point;: pass; because ^ section: or back to the step, for example, node P re-issues the join message fence 'so it searches for a new parent node. Next, from Di: mouth, 匕 Lang points to re-confirm the message, according to the confirmation message, β receives the confirmation message sent by the parent node B to the parent node Β (step 3 $ 3 ^ available logical address to send an original The parent node does the address release of |% γ. Next, the node traverses all the child nodes and points under it, its parent (step (10)), and the money informs the logical address of the ^ that periodically registers with the parent node 4 to perform the registration update. Changed, and the action of 々 (step S29), that is, return to 0213-A40410TWF (N2); K93l79; ALEXCHEN.ptd 13, 06707 step j1, repeat the operations of steps S21 to S29 „ early spiders logical position of a node The address has changed, it must be master, 3: at this time its child nodes can choose direct = two all its 3 bits, as the pre-index of its own address (prefi two new logical nodes of the logical node) Originally, it is "丨.2. 5", for example, the logical address of the subnode can be changed from the original to the "1.2" address 1'u. ~ is to re-find the node to do v. ^ Must consider the root node or the child that is very close to the root node. 2: Point person. Example: If the shape. For example, 'Reference 6 'With a node or;. Contact with them' and these sub-nodes can try to print a possible "1':" J can leave the tree structure, so it must be generated again - the sub-node is the method under the point, Solution ', 么二Γ/同Λ产生_ Select a new node according to the size of the priority "" m = for the sub-section lU.x becomes the node "U" has priority over sub-worry. For example, The priority of the node "Priority Point 1.2" is greater than the node 3,,, and the second J.2 'and a new node|, 1. 〇"., push until the spoon J: to explain In the embodiment of the present invention, the process of communication between nodes in a group is performed in three parts: a group (J〇in), a node leaving a group, and a greedy forwarding (Forward).

1306707 -5·, invention description ' _____ First, the node is added to a certain multi-cast 珥 , ' and the actual process. When a node wants to be in the category of ambiguity, it is omitted. (The definition of the propagation group is not in the group address mapping that the sender wants to join, and the hash table is used to hold the logical bit. Address, #MaP) to a logical address, connected to the logical address, and registered by reading t = point and obtain the non-existence of other registered members, the node:, responsible for maintaining the registration data. If the node says that if the node wants to join the parent node, it is responsible for maintaining the registration data. For example, the multicast group A included in the group is broadcasted, and the logical address obtained by the hash table and the multi-point transmission is used as the address to perform the mapping operation, according to the mapping "1.3. 5" Registration, but if f 3. Therefore, node P must go to the node or leave the tree network A. 1. 5. 5 does not exist (may move to another book. If it is 1. v, then change to point "I 3" to be responsible for maintenance Note registration information. If it does not exist, then the node "1. 0" is responsible for maintenance. On the other hand, it must be transferred back to the section. 5 The Force is negative: If the node of the dimension appears, then the data point "·3" instead of, for example, In the above embodiment, the original one is: 朁 1 ie, 3. 5 " maintain the member data of group A, eve 1 is the two nodes add this network, and obtain the logical address "13' shell two, After the 3.3, you must inform the node "ΐ3·5, for data transfer. In addition, you must = to be responsible for maintaining the group festival, including because of the A: group leaving the tree network If the action = for example, the action is down, the node that is causing the node to maintain the group data must notify: the origin replaces the maintenance data. In order to avoid the above situation, a "Father's Day"

1306707 V-, invention description (13), must send a confirmation message to the node that was originally registered periodically, if it is found that the confirmation message has not been replied 'represents that the maintenance node is invalid, then ^ must be registered again with the parent node of the original responsible node once. Since this is really a small group, the amount of data that needs to be transferred is not too large. Therefore, it is necessary to worry that data transfer will waste too much bandwidth and time. Next, the actual process of the node leaving the group is explained. When a node opens a multicast group, the process of authenticating to the node it originally registered is similar to the process of joining the group. The hash table will be mapped to a logical address, assuming that "135"= Μ 向 郎 ’ '1_3. 5" cancel the registration. Also consider that the node "" is not in the = two second time information must be found by the node 3. 5 " parent node dimension to maintain its data node. 〗 〖 疋 疋 Next, explain the actual process of data transfer. After the group = group, you can start to execute the transmission and reception of the data ":: every node in the network must deal with its own "by having to serve as the routing section and point to help, i 'To achieve a valid wrap-around packet to make the package. In the case of information, the amount of the package is reduced to a minimum of ::: to receive the question. In order to reduce the amount of packets, the data transmission in the important wireless network of the 摅太旅一田 has ‘二=, network’. In addition, several features must be added to the packet to achieve its purpose. (1) UP FUg: If the upper flag value is set to i, it means

1306707 V. Invention Description (14) A parent node that forwards a packet to an intermediate node must process the packet. (2) Chi 1 dren Node Map: Each bit represents a child node of the relay node. If a bit is set to 1, it indicates that the child node represented by this bit must forward this. Packet. (3) Sequence number: In the broadcast environment, it is possible that the same packet is forwarded by several different nodes and then received by the same node. At this time, the serial number must be used to determine whether the packet has been received. (4) Relay node: used to record the logical bit and address of the node that forwards the packet. (5) Member List: used to record the address of a member in a multicast group, where the first bit in the address is retained' and it is judged how to forward the packet. The root ί narration of the interception and the use of wireless network radio waves have the characteristics of broadcasting. When a member node sends a packet, it can be received by member nodes within its transmission range. That is to say, for some member nodes, only one packet needs to be sent once. If you are in the range of radio waves, deduct these points and points, and other :: hierarchical tree structure to transfer 1 to save multi-point transmission. . The rules required in the algorithm are described in detail below. The tile first assumes that the node passing the packet is the sender / Λα of the sender. The first bit of the address (extra-reserved) is set to rule 1 and the right is the place where the singer is located in the 偻 沾 沾 说 卉 卉 卉 、 、 、 、 、 、 、 、 、 、 、 、 、 、 、 、 、 、 、 、 、 、 、 、 、 、 、 、 , Bellow J will be 5 Hai into the logical address of the Bay Point!

1306707 jade, invention description (15) is 1 〇 rule 2 'except for nodes according to rule i, if there are members belonging to the transfer node set to 1 in the child node image will be:; two branches together, according to the rules 3. If there is a /70 in the member list, the bit 70 is 1. If it is set to 1, the first bit of the upper flag is set to record the address of the transmitting node, and the packet = I is in the middle and the dusty spot. =: Set the section to pass the packet; The situation of the sender. Bit judgment), and the child node image is transferred at twelve points (the bit of the node of the branch by the relay node is set to i when the bit is set to i: the member node is not in the delivery node faster 70.... The branch point of the node is located at the branch point and belongs to point two. Then, the address of the point that is transmitted is recorded in the relay node block, and the packet is sent out. Rule 5, if the received packet is forwarded by the child node, and the flag is sent For 1 ', the first bit in the list of bins is not the point of the node. 丨 Set the first bit of the node of the bit, ... to i, instead of the bit; The node that points but belongs to the child node of the delivery node sets its first bit to 1, and sets the bit of the node representing the branch to 1 in the child node image. If there is the first one in the member node If the bit is not set to 丨·', the ^ flag is set to 1, otherwise it is 〇, and the address of the delivery node is recorded in the relay node block, and then the packet is sent out.

0213. From 〇41〇实(犯); 咖179;ALEXCHEN.ptd Page 19 1306707^五-, invention description (17) According to rule 5, node "]n">> the first bit in the list The gas meets the rules defined by it, and at this time it becomes "1 3 2丨, and the node with the machine is 1 has a node 丨'3. I 2丨, and both nodes are not located at the node" The cache of ι〇" is its sub-print, so the first bit in the member list, is set to i, and the good ^ point /.3.1.2 and the point I3 · 2 (representing the node) .3 "will: the third bit of the lang dot image" is captured, for example, the point-to-point transmission in the wireless network (Ad Hoc a ground / and the connection between the devices) without passing through No line: With a clustered tree structure, in this energy, you can reduce the workload of the connection network 2 =!, plus). The invention of the present invention has been disclosed above by way of a preferred embodiment, but it is not intended to be used by any person skilled in the art without departing from the spirit of the invention. Various modifications and refinements are possible, and the scope of the invention is defined by the scope of the appended claims.

13.06707 Simple description of the diagram [Simple description of the diagram] Figure 1 shows a schematic diagram of a conventional master-slave architecture. Figure 2 is a schematic diagram showing the architecture of a point-to-point transmission wireless network in accordance with an embodiment of the present invention. Figure 3 is a flow chart showing the steps of an addressing procedure when a mobile device of a embodiment of the present invention joins or generates a wireless network tree structure. 4 to 6 are schematic views showing the actual shortening of the routing path in the embodiment of the present invention. 7A, 7B are diagrams showing the addition of a mobile device or the removal of another mobile device in one embodiment of the present invention. Figure 8 is a flow chart showing the steps of the actual process of joining or leaving another mobile device of one of the embodiments of the present invention. Fig. 9 is a view showing the group communication between the mobile devices of the embodiment of the present invention. [Main component symbol description] 11 0~Server 1 3 0~Application A, B, P~node t (1). . ( 5)~Operation

0213 -A40410TfF(N2);K93179;ALEXCHEN.p t d第22页

Claims (1)

• 13.06707 • * — 'Six-, patent coverage, 1 · A method in a wireless network environment that utilizes a point-to-point connection and multi-point connection interactive environment. The following steps are taken: a network, a package & for a first node; the first node, after waiting for a standing message to detect that there is a second and a second τ, broadcasts the first node to issue a force::= - the second node; the second node receives the %, gives the second node; points a confirmation message; and, when the message is received, replies to the first node, the first node according to the address, and sends a join Confirming that the message 2 selects a first logical address of the first logical address, and thus the shape = γ of the second node to confirm the acquisition. 2. For the scope of the patent, the method of the hierarchical cluster network. The step of constructing the multi-point connection interactive loop of the above-mentioned narration further includes the following steps: the 发出 point broadcasts the above-mentioned message to the first node, and the neighboring party has a logical address neighbor. Clicking on the above message to detect whether, if there is no neighbor with a logical address, it becomes one of the above-mentioned hierarchical cluster networks: then the first node logical address is set, and the above-mentioned ~μ root node is defined One of the corresponding ones is one of the above-mentioned hierarchical cluster networks. The media access control address is such that if there is no other logical bit, the f code; the broadcast mode sends a message to the 彳贞 4 node, then the above Whether a node has a wide node 丨贞1 in the neighboring node, whether there is a 0213-A40410TWF (N2); K93179; ALEXCHEN.ptd.K.06707 patent application scope right in the above-mentioned neighbor. If there is a node in the point, then each of the above-mentioned first nodes omits all the neighbors of the neighbors~' = replies - the confirmation message 2 points after receiving one of the above-mentioned join messages, the points are respectively replied to them ^ ^ a first node, wherein each of the neighboring nodes is the first-at least one logical address; and a third acknowledgement message is provided to select a third node to describe the third node to confirm: 发出 and send-add confirmation message Give j 3. For example, if the third logic address is applied for, the method of the environment, the order of the above-mentioned logical address provided by the construction of the multi-point connection interactive loop point of the third item is: the other neighbors' sites. The shortest logical bit of 4. The method of claim 3, wherein the third node V constructs a multi-point, ^: 2 and the parent node of the hierarchical cluster network point. 5. The method of claim 5, wherein the hierarchical multi-point connection interaction loop has a child node routing table and a neighbor node: The nodes are respectively 6. As shown in the fifth paragraph of the patent application scope. The method according to the method, wherein the routing method, the disk construction method, the multi-point connection interactive ring routing table, and the foregoing neighbor node routing/, the above-mentioned child nodes of each node are delivered to a destination node. From the table, the data packet is composed of ί:: 7_ as described in the scope of claim 6... ____ 夕点线互动环 0213-A40410TWF(N2); K93179;ALEXCHEN.ptd Page 24-------- ", the method of applying for the scope of the patent, Gan points from an ice /, order 'in the above-mentioned class #隹a then; 5 #Source node receives a large-funded f-set network, when a fourth-node hot two-sub-node routing table and neighbor two packets, according to the above first routing rule, 仃 - the longest header comparison (L The logical bit count contained in the point routing table ^ will be operated on the pref ix Match ) according to the comparison result, and the length of the node will be transmitted to the t with the longest header, as in the seventh item of the patent application scope, + - brother,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,, The information of the node-the fifth node is the fourth node. The above fifth node will be the above purpose. 9. The method of applying for a patent, wherein each of the above-mentioned constructed multi-point connection interaction rings is described. The destination node and the route of the route::: the data packet to be delivered (Cache), For later delivery to its routing cache 10 · as requested in the scope of the patent application / 4 packets access. The method of the environment 'its t 'the above _ structure multi-point connection interactive ring - and the second node The identification code, the first-logic position is respectively represented as the above-mentioned point 'and the above-mentioned first-node is periodically operated with the parent node of the above-mentioned first lang. The execution of the registration and update of the lang point is as follows. Method..., when the 1st eve connection interacts with the point desire - the fifth node becomes 1M1 page 25 〇213-A40410TWF(N2); K93179; ALEXCHEN.ptd, upper: ίί=: second node execution - Address release operation, = the intended party is like the law application, the construction of the multi-point connection interaction described in the second item is not to the second point 2 r: the first node is after a predetermined time The main ί: The operation of the above registration and update is performed, and the i 14 actively performs the above address release operation. The method 11 of the above-mentioned environment, the construction of the multi-point connection interactive ring described in the first item of the patent p range , and -Μ ~ The hierarchical cluster network includes a multipoint ## #丨步顿:-six nodes Joining the above-mentioned multicast group flow execution 1 mapping: ^ table: the logical address included in the above multicast group: the above::Vi to obtain a pair of mapped logical addresses; and registration, and the above The logical address of the mapping is obtained - node 15. If the Shenyi point is above, the registration data of the sixth node is maintained. The method of the environment is the construction of the multi-point connection interaction parent node described in the item: Maintenance 1; in 1 by the above-mentioned node's extension of the sixth point of the registration data. The party V of the environment, "Zhongli $? The registration information of the chest point is from the above; the judge =:= 'The sixth node of the above sixth section. ',.' The point must be transferred to the above sixth.卽点从卜:;+,文Υ城μ, the process includes the following steps: Up 4 multi-cast group 0213-Α40410TWF(Ν2); K93179;ALEXCHEN.p td Page 26 13.06707 VI-, the scope of the patent application uses the above-mentioned choke table to perform a pair of mapping operations, from the logical group contained in the propagation group to the sixth node to... The logical address obtained by the inch mapping, _ and P point are executed to the parent node - the action of canceling the registration; the second master m is the above, that is, the point is to have the above-mentioned mapping, the ® s main book. One of the logical addresses of the node is for the method of the first-order 夕 埦 埦 如 如 申 申 申 申 申 申 申 申 申 申 申 申 申 申 申 申 申 申 申 申 申 申 申 申 申 , , , Following node and member two: J is provided with a flag, and the child node is located at j table 4 according to the above ,, and the sixth packet is. In the multi-point communication group, a data seal is sent. 19. For example, the method of applying for the patent scope "item%", in which the construction of multi-point connection of #μ, +. #4 is in the 卞 gentleman. The node is a packet, r·Pubei, and the J recorded in the above-mentioned list of bins is transmitted, and the point is recorded in the sixth node - the cache node - the member node of the acquisition - One bit is set! . Constructing a multi-point connection with the parent--the above-mentioned fast environment application===: If there is a first one belonging to the above-mentioned transfer node: the logical address of the member node, then the upper six f Point to the branch, then the above subsection:: 2,; ^ said the node of the node is set to i. Will represent the above-mentioned branch 21. " please patent the scope of the second item of the environment, where if the upper M + g ± i Fu Xi ^ transport line interaction right upper fan into the list of at least - member section 0123-A404107? F (N2); K93179; ALEXCHEN. ptd page 27 1306707 six -, the scope of the patent application is not If it is set, the above-mentioned upper flag field is sucked into the work, and then - the above-mentioned relay node records the sixth transfer bit 2 as described in the above-mentioned patent (4) item 14 The sixth node is not a private line point, although the packet received by the parent node of the sixth node is sent according to the sixth node eight: and the bit of the upper node is set to " Calculate the first one: the table is divided into $, that is, in the cache of a packet transfer node, i is the above-mentioned bin> the branch of the child node transmitted by the above packet, and the bit of the node that belongs to the node that is the branching branch is set to 丨, and the bit of the packet transmitting node is recorded in the spot image in the missing point image. The method of the above-mentioned relay node 23. The environment according to claim 22, wherein if the data packet is connected to the work point and the upper flag is set to 丨, the calculation is performed at The member node sub-node forwards, the member node of 1, will be located in the above packet transmission: the first bit of the first bit is not set to 丨, instead of being located in the above-mentioned scoop=cache The node but the special node of the above-mentioned packet transfer node sets its first bit to 〗, and at the node of the above-mentioned child r, the bit of the node of the child node is set to 丨. The image order will represent the method of the environment as described in claim 23, wherein if the node node in the above member node is set to a node of 1, the upper flag is set, first One bit does not follow the node block The above-described packet transmission node, and bits in the above 0213-A40410TWF(N2); K93179;ALEXCHEN.ptd第28页