JP2014116854A - Network for transferring cell, packet or packet with cell header - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a network capable of performing divided address transfer in which a drop address that a network used for transferring a packet, a cell or a packet with a cell header on a ring has, or an address length of a drop address table can be shortened.SOLUTION: A network for transferring a cell, a packet or a packet with a cell header has a collection point within a hierarchy or a collection point within a ladder. In an uplink direction, in a hierarchy at a lower side of a hierarchy including a connection destination downlink of the cell, the packet or the packet with the cell header, the network has neither a division destination address which is effectively available only in the hierarchy, nor a source address which is effectively available only in the hierarchy, or does not have the destination address which is effectively available only in the hierarchy but has the source address which is effectively available only in the hierarchy, or has the source address which is effectively available only in the hierarchy but does not use the source address.

Description

The present invention relates to a network for transferring a MAC packet or a cell or a packet with a cell header by a drop address memory or a drop address table having only network division addresses.

  As a configuration of the MAC switch, there is JP 2000-151617 “Table creation / retrieval device”. This conventional example will be described with reference to FIG. This conventional example relates to a MAC address storage circuit, and includes a first table, a matrix address 820, a MAC address, a RAM having a matrix address 800, a MAC address data area MA (48 bits) 801, and an index area IA802. It consists of a second table composed of a RAM having an address data area MA (48 bits) 821 and an index area IA822. The MAC addresses of the first and second tables are shown in hexadecimal notation.

First, a method for storing the source MAC address of the arrival packet will be described.
The MAC address data area MA (48 bits) 801 (for example, 805) in which the MAC address table of the first table is specified by the address (for example, 803) indicated by the lower 16 bits of the MAC address of the arriving packet has a 48-bit MAC. If the address is not already stored, it is stored there. If there is no stored address in the index area IA, the address of the MAC address data area MA (48 bits) 821 of the second table Is searched for a write address in which the MAC address is not already stored, the MAC address is stored therein (for example, 826), and the stored address (for example, 2) is stored in the index area IA802 of the first table (for example, 808).

  If an address is already stored in the index area IA802 of the first table address (for example, 803) indicated by the lower 16 bits of the MAC address that has arrived next, the index indicated by that address (for example, 2) in the second table If there is no storage address in the area 830 of the area IA122, the MAC address data area MA (48 bits) 821 in the second table is searched for an unstored address, and the MAC address of the arrival packet is stored there, and the address (For example, 3) is stored in 830 of the index area IA822. On the other hand, if an address is already stored in the index area IA822 830, the MAC address data area MA (48 bits) if there is no storage address in the index area IA822 831 indicated by the address (for example, 3). An address in which data 821 is not stored is searched, the MAC address of the arrival packet is stored therein, and the address (for example, 4) is stored in the index area 831.

  Next, a method for confirming whether the destination MAC address of the arrival packet is in the table will be described.

  An address (for example, 803) indicated by the lower 16 bits of the MAC address of the arriving packet is stored in the MAC address data area MA (48 bits) 801 (for example, 805) in which the MAC address table of the first table is designated. If the MAC address does not match the MAC address of the arrival packet, the address (for example, 2) of the second table stored in the index area IA 808 is searched, and the MAC address stored therein is the MAC of the arrival packet. If the address does not match, the address (for example, 3) in the second table stored in the index area IA 830 is searched, and if the MAC address stored therein does not match the MAC address of the arrival packet , Its index area IA83 If the MAC address stored in the second table (for example, 4) matches the MAC address of the arriving packet, the destination MAC address of the arriving packet is Judge that it is remembered.

  Further, as a configuration of the MAC switch, there is JP 2002-334114 “Table management method and apparatus”. This conventional example will be described with reference to FIG. 20, 900 is a received MAC address, 901 is a hash function such as CRC, 902 is an address specification bit (10 bits) of the entry table 903 which is a hash value, and the entry table 903 has the received MAC address as its hash value address. There are four tables B1, B2, B3, and B4 in this example, and each entry 903 stores a MAC address of 8 bits, a port number, and the like. 904 is the registered MAC address 8 bits read by the address bit 902, and 905, 906, 907, and 908 are the MAC address 8 bits read by the address 902 from each entry table of B1, B2, B3, and B4. The received MAC address is a comparator of 8 bits (909), 910 is an OR circuit of the output of each comparator, and 911 is a coincidence detection signal of the output.

  The operation will be described below. None of the MAC addresses in the storage entries of the address positions of the four entry tables specified by the address bits 902 of the hash value of the reception source MAC address 900 match the reception MAC address, and there is an entry area that is not stored. If there is, the 8 bits of the received source MAC address and the port number are written in that position, and if any MAC address stored in the address position of the specified entry table matches the received MAC address, leave it as it is. If there is no match and there is no space in the entry table, rehashing occurs, and the stored entry MAC address is changed to the received MAC address.

  Further, if the MAC address is not stored in the address position of the entry table designated by the address bit 902 of the hash value of the destination MAC address of the packet, the packet is flooded as an unknown packet. On the other hand, if it is stored, the four MAC addresses are compared with the reception destination MAC address, and if there is a match, the packet is sent to the port number stored together at the address position, If they do not match, flooding is performed as an unknown packet.

  Next, a conventional ring technique will be described. Rings such as EASP, MRP, and MMRP2 using conventional MAC switches such as L2SW have been proposed as conventional ring technologies, but these all have a point to cut the ring flow on the ring so that a loop is not possible. Existed.

  On the other hand, the packet transfer on the ring is encapsulated by attaching the MAC address of the ADD node of the packet to the ring and the MAC address of the node that DROPs from the ring to the terminal MAC header. An RPR that realizes MAC ring transfer is proposed and standardized only when it has a function of discarding a packet that circulates above the source ADD ring node and discarding the packet.

  The ring network is an IEEE 802.17 RPR (Resilient Packet Ring). As an example of this prior art, there is JP-A-2009-77285 (packet ring network system and forwarding database management method). These RPRs solved a congestion storm caused by a loop which has been a problem in the past.

  There is a conventional MACSW shown in FIG. 21 as a node device performing a conventional MAC type operation applied to a ring. In FIG. 21, reference numerals 305 and 306 are node devices, reference numerals 300 and 301 are MAC address tables in which source addresses of packets input to the ports used therein and the input ports are recorded, reference numeral 302 is a clockwise ring transmission path, Reference numeral 303 denotes a counterclockwise ring transmission path, reference numeral 304 denotes an input packet header reading circuit, reference numerals 307 and 308 denote ADD transmission path ports, and reference numerals 309 and 310 denote ring transmission path ports.

  Buffers necessary for the packet confluence at each header reading circuit and ring transmission path are omitted in the figure. If the destination address of the packet input to each port is in the MAC address tables 300 and 301, it is output to the port written together with the address, otherwise it is copied as an unknown packet and output to all ports. In the figure, English letters CD, BA, etc. after MAC in the display of MACCD, MACBA, MACAB, MACDC indicate that the destination address is C, B and the source address is D, A.

  The packet MACBA arriving at the port 2 (308) of the right node is (1) MACBA in the counterclockwise ring transmission path 303 connected to the port 4 (310) that is the output destination port of the destination address MACB of the MAC address table 301. And is dropped as (2) MACBA to port 2 (308), which is the output destination port of the destination address MACB in the MAC address table 300 of the left node.

  On the other hand, the packet MACAB that has arrived at port 2 (308) of the left node, which is the opposite flow, is connected to port 3 (309), which is the output destination port of the destination address MACA in the MAC address table 11 (300). It is transmitted as (3) MACAB to the ring transmission path 302 and dropped as (4) MACAB to the port 2 (308) which is the output destination port of the destination address MACA in the MAC address table 301 of the right node. The operations of (5), (6) MACCD, and (7), (8) MACDC are the same.

  Next, FIG. 22 shows a conventional RPR ring operation. FIG. 22 has four ring nodes of nodes A (322), B (323), C (324), and D (325) on the 0-system ring transmission line 321 and the 1-system ring transmission line 320. As the ring node identification numbers, MAC source addresses MACA, MACB, MACC, and MACD are respectively included. Node A has terminal H (330), node B has terminal F (331), and node C has Terminal G (332) is connected. The MAC source address of terminal H (330) is MACH, the IP source address is IPH, the MAC source address of terminal F is MACF, the IP source address is IPF, and the MAC source address of terminal G is MACC. Yes, the IP source address is IPC.

  The packet transmission on the ring is performed by adding a MAC header having a node MAC source address and a node MAC destination address necessary for transferring the packet on the ring to the packet arriving from the terminal. For this purpose, a header conversion table necessary to attach a node MAC header for inter-node transfer to the terminal MAC header is provided at the entrance to the ring of each node.

  The conversion table needs to be learned and held when the terminal first arrives at the node from each terminal. This is performed by an ARP packet arriving from the terminal, and the diagram of this conventional example shows the operation. The operation is shown below.

  The terminal H (330) has an IPF which is an IP destination address from the terminal H (330) to the terminal F destined for the terminal F (331), the MAC destination address is all 1, and the MAC H and the IP source which are the MAC source addresses of the terminal H When the ARP packet (1) ARP, MAC, all1, H, IPF, H having the address IPH arrives at the ring node A (322), the node A (22) does not know the destination of the packet. Therefore, a packet in which the MAC packet is added with the MAC destination address of MACA that is the MAC source address of the node A and the MAC source address of the node A, and (2) Broadcastcast, MAC, all1, A, MAC, all1, H, IPF, H, both rings And sends the Taha piece system ring.

  The packet is copied and dropped at each node B (323), node C (324), and node D (325). The packet dropped at each node creates a header conversion table of MACA which is the outer MAC source address of the packet and MACH which is the terminal MAC source address at the exit of the node, and then the outer MAC header is removed. (3) ARP, MAC, all1, H, IPF, H are sent to the lower drop transmission line. Only the terminal F (331) whose IPF, which is the destination IP address of the packet matches the IP source address of the terminal, captures the packet, and receives the ARP response packet. (4) ARP response, MAC, H, F , IPH, F are sent to Node B.

  The node B (323) retrieves the destination ring node MAC address from the header conversion table from the MAC destination address of the terminal packet, and at the same time describes the relationship between the terminal H, terminal F, and node A regarding the connection between the terminals. Complete the conversion table, and attach the MAC header, MAC, A, B for transfer between ring nodes to the terminal packet, and (5) MAC, A, B, MAC, H, F, IPH, F, 1 system Send to ring (320). At that time, since the node B (323) knows in advance the shortest route to the destination node A (322), it sends the packet to the system 1 ring. The packet that goes up to the system 1 ring is dropped at the node A (322) that is the destination of the packet, and at the drop point exit, the terminal describes the relationship between the terminal H, the terminal F, and the node B. After completing the header conversion table regarding the inter-connection, the outer MAC header is removed and sent to the terminal H as (6) ARP response, MAC, H, F, IPFH, F. Thereafter, packet transfer between the terminal H and the terminal F via this ring is performed using the header conversion table created in the node A and the node B.

  FIG. 23 shows the unicast packet transfer operation in that case after the MAC conversion table of each node is completed in the RPR which is the prior art. In this figure, terminal E (333) and terminal H (330) are connected to node A (322), terminal F (331) is connected to node B (323), and terminal G (332) is connected to node C (324). ) Are connected and packet transfer is performed between the terminal H and the terminal F and between the terminal E and the terminal G.

  In FIG. 23, a MAC header of a packet transferred between terminals via a ring node is shown on each ring. Each terminal uses the relationship table of the source terminal MAC address, the destination terminal MAC address, the source node MAC address, and the destination node MAC address shown in the header conversion table of node A, node B, and node C. When going up to the ring of each node, the header is converted and the packet is transferred.

  Next, FIG. 24 shows a conventional node device for a ring that operates in the MAC mode. FIG. 24 is an example disclosed in Japanese Patent Application No. 2012-206011 (packet transfer method and node device), which is used for packet transmission for a path or one flow, and has an active and spare drop address table. is there. In FIG. 24, 609 is a working drop address table, 610 is a backup drop address table, 600 is a 0-system ring transmission line, 601 is a 1-system ring transmission line, 602 is an ADD transmission line, 603 is a DROP transmission line, 604 Is a MACBA (B is a destination MAC address, A is a source MAC address), 605 is a MACAB, 606 is a header reading circuit (with BUF) of a 0-system transmission path packet, and 607 is a header of a packet of a 1-system transmission path A reading circuit (with BUF) 608 is a packet distribution circuit (with BUF). The operation is shown below. The packet MACBA 604 input to the node from the ADD transmission path 602 is read by the packet distribution circuit 608, and if the source address of the packet is not in the current drop address table 609, the source address is written in the table. In some cases, the packet is sent as it is to the 0-system ring transmission line 600 indicated by the least significant bit (0 in this example) of the source address A of the packet. On the other hand, for a packet arriving at this node from the ring, the destination address of the packet is read by the header reading circuit 606 or 607, and it is first searched whether the address exists in the drop address table 609 on the working side. If there is no packet, the spare drop address table 610 is searched. If there is, the packet is dropped. If there is no packet, the packet is directly passed through the output ring transmission path and transmitted. .

  In this example, MACAB 605 arrives at the node from system 1 ring transmission line 601, and since its destination address A is in the working drop address table 609, the packet is sent to DROP transmission line 603. In such an operation, when the spare drop address table 610 is not hit in the search for a certain time or longer, it is determined that the source address in the spare drop address table 610 has become old, And the spare drop address table 610 is used as a working drop address table, and the drop address table 609 that has been used so far is changed to a spare drop address table. In this example, the MAC table has only a drop address, and the operation is simplified.

  Next, FIG. 25 shows an example of a one-stroke writing operation of a conventional multistage tree-shaped ring network. This example is disclosed in Japanese Patent Application No. 2012-206011 (packet transfer method and node device), and is an example of a one-stroke multi-stage ring tree network that writes a path or one flow MAC packet. This network shows a procedure in which a terminal connects to an edge node in a state where a single path is set by a single path setting packet from the edge node to the highest ring edge. In FIG. 25, the edge node accommodated in the lowermost ring on the right side has a MAC address MACSB (S of SB indicates a source address and B is the source address), and (1) 'MAC ○ B0 (single path setup packet) (◯ indicates that the MAC destination address is all 0) is sent, and the source address B is left in the drop address table at the entrance of the lowest ring. This source address is set in two drop address tables corresponding to the 0-system ring and the 1-system ring. Since the least significant bit of the MAC source address of this packet is 0, it goes up to the 0-system ring and there is no destination even if it makes a round on the ring, so (2) 'MAC B0 (one-path setting packet) A multi-round bit is added at a node that goes up the ring. The packet with (3) 'MACB0 multi-round bit is determined by the fact that a multi-round bit is attached to the node that goes up the upper ring, and (3) multi-round bit removal of (MAC) B0 is performed. Drop later and go up to the upper ring. The upper ring operates in the same manner as the lowest ring, and, as shown in the figure, at the egress node that goes up to the highest ring, (6) remove and drop the multi-round bits of 'MAC ○ B0, (7) As shown in 'MAC B0, the packet goes up to the uppermost ring, and after writing the source address in the drop address table at the entrance of the ring, the packet is discarded.

  On the other hand, the terminal MACSC having the MAC source address C sends (1) the MACBC0 call packet addressed to the edge node B to the lowest ring, leaves the source address C in the drop address table of the ring, and It goes up to the 0 system ring indicated by the least significant bit of the source address. Also in this case, since the destination of this packet is not on the ring, a round-trip bit is given to the node that makes one round and returns to the original ADD node, and the packet drops at the node that goes up to the upper ring, Go up to the ring. These operations are described in (1) to (10) in the figure and operate in the same manner as the packet from the edge node described above, and thus description thereof is omitted. In (10), since it is connected to the path set by the one-path setting packet from the edge node described above, after that, it reaches the edge node by the path, and the service of the edge node or After being connected to a terminal under the edge node, packet transfer is performed thereafter.

  Further, as a network for dividing and transferring a conventional address, there are a cell transfer network using VCI in ATM and a cell transfer network using VPI. The VC network and VP network are clearly divided into layers. ATM, which is a conventional technique for dividing and transferring addresses, is pre-configured between cross-connects with a VP network, but in many cases it is a network in which the cross-connect exit is selected and set by signaling. This is a network in which a route is set by signaling. At the ATM subscriber exchange at the connection point between the VC network and the VP network on the originating side, the VPI connected to the partner ATM subscriber exchange is attached to the arrival cell from the originating subscriber and transferred to the VP network. , The other party connection destination VCI is obtained from the VCI on the calling side and the transferred VPI, the header is converted, and the other party subscriber is connected. In the ATM network, VCI and VPI with the same uplink and downlink are used.

  As another conventional example, there are a network that is transferred by an IPv4 IP address of a packet and a network that is transferred by an upper IP address and a network that is transferred by a lower IP address. The upper IP address is clearly separated from the lower address network for foreign connection or the like, but the lower address does not clearly separate the area of use and the boundary of the address use hierarchy.

On the other hand, there is an ATM network as an example in which the source address is not used for transfer. Therefore, signaling was required. Also, the IP router uses only the destination address for forwarding, but since a failure address to the source in the middle router and a response address is required by the server, etc., the packet to be forwarded is used to identify the source of the packet. Also uses the source address.

JP 2000-151617 A JP 2002-334114 A Japanese Patent Application No. 2012-206011

IEEE 802.17 RPR (Resilient Packet Ring)

  Conventional example as a conventional MAC switch configuration Japanese Patent Laid-Open No. 2000-151617 has a simplified storage operation compared to a method of storing MAC addresses of arriving packets in a table in the order of arrival. If all the MAC address bits are not yet stored in the MAC address data storage area of the first table indicated by the 16 bits of the MAC address, and if all the different MAC address bit bits are already stored, the index of the address The address position of the second table in which the storage destination is stored in the area is searched. If all the MAC address bits of the packet arriving there are not stored, the MAC address of the arrival packet is stored in that address. If all the different MAC address bits are already stored there, an empty area is searched and all the MAC address bits are stored therein, and the address is stored in the previous index area.

  As described above, unless the storage area is traced one after another, neither storage nor storage read can be performed, and there is a problem that it takes time to process the MAC address of the arrival packet. Therefore, there is a problem that it cannot be used for a high-speed MAC switch with a large number of packet processing and a MAC switch with a large number of MAC addresses to be stored.

  In addition, the conventional example of Japanese Patent Application Laid-Open No. 2002-334114 as a conventional MAC switch configuration has a limitation in speeding up the hash calculation method using the hash function, but the MAC address search is somewhat faster, but is received. If the MAC address stored in the address indicated by the address bit, which is the hash value of the MAC address, does not match the received source MAC address, it is necessary to change the MAC address of the entry table, which may cause a malfunction. Also, if the hash value of the MAC address of the received destination address does not match the MAC address of the specified entry table and the MAC address of the received destination address, flooding is necessary and the network becomes congested. is there.

  Although it is possible to expand the entry table by setting the address bits to 18 bits, there is also a problem that the address space of the entry table cannot be increased because the storage data area of the entry table is large. For this reason, the number of conventional MAC entries is limited to about 16000, and although there are applications to LANs and MANs, there is a problem that they cannot be applied to higher networks.

  In addition, the MAC address table of the MAC switch shown in FIG. 12 as a conventional node device performing the MAC type operation applied to the ring has to learn the MAC source address of all the ports of the node, and the operation becomes complicated. There was a problem that high-speed operation was not possible.

  Further, IEEE 802.17 RPR (Resilient Packet Ring) as a conventional ring technology FIGS. 22 and 23 use a special RPR header, and a DROP node number is required for the RPR header, which takes time to learn. Even after creating the conversion table FDB (Forwarding Database), it is necessary to attach a header having the MAC address of the DROP destination node to the packet received from the terminal by looking at this table, and it takes time for conversion.

  RPR transfers control packets between ring nodes, so that each node has position information of other nodes on the ring, and the shortest path to the DROP node is known. However, in order to connect to another ring, it is necessary to set the other ring ID in the packet, and it takes time to learn. Therefore, since RPR is basically difficult to apply to other than a single double ring, there are application examples to MAN and LAN, but there is no application example to a large-scale network.

  In addition, since RPR is encapsulated, high-speed transfer is possible on the ring, but in order to connect to another ring, it is necessary to learn the ring drop node again at the other ring entrance node. There's a problem.

  Also, since RPR is encapsulated, it is also a path connection ring. However, there is a problem that a packet having a path configuration inputted from outside the ring cannot be transferred on the ring unless it is further encapsulated in the ring by a ring header.

  In addition, the conventional MAC operation ring shown in FIGS. 24 and 25 of Japanese Patent Application No. 2012-206011, which is a conventional ring technology, can simplify the node device and operate at high speed, but can accommodate 48 bits of MAC address. In this case, since a memory such as RAM, SRAM, and CAM cannot be used, there is a disadvantage that the cost increases. For this reason, there is no choice but to use a MAC address table. Therefore, there is a problem that a large number of MAC addresses cannot be accommodated. However, if a drop MAC address memory can be used for this network, the data is only one bit indicating whether or not there is a drop from the ring, so that the address space can be expanded.

  In addition, since the conventional ATM network has a short address bit length of VCI and VPI to be used, there is an advantage that RAM, SRAM, etc. can be used for the VCSW and VPSW tables excluding the ATM subscriber exchange. However, since the conventional ATM network is clearly divided into two hierarchies, VCI can be used separately in each sub-region and in each sub-region in the subordinate network. In order to connect ATM switchboards, VPI conversion must be performed in the middle of the VP cross-connect, and it is necessary to use the same bi-directional VPI unlike the MAC address, so there are restrictions on route settings. There was a problem that a large net could not be made. In addition, there is a problem that a route can be set only by signaling.

  This is because the VP network is not separated for each region, and the route setting is complicated. For this reason, there is a problem that the route cannot be automatically set. Note that the conventional ATM network has high security because the ATM subscriber exchange identifies the calling subscriber and the connected subscriber, but the amount of hardware for cellization and decellization and, as described above, signaling In addition, the header conversion process is heavy and expensive.

On the other hand, in the conventional IP network, since the area is not clearly separated in the lower network, the router has to look at all bits of the IP address, and there is a problem that the IP table becomes large. In addition, the IP network has a problem that it is not possible to automatically set a route because IP table information must be exchanged between adjacent routers. In addition, hash technology is used to search the IP table. However, as with the MAC address hash calculation, calculation time is required, and the entry table requires a destination MAC address and an output port number. There is a problem that the number of data bits becomes large and there is a limit to the address space of the memory that can be used, and there is a problem that costs are high.

  The present invention has been made in view of the above-described problems of the prior art, and its object is to provide a drop address or a drop address table of a network used for packet transfer on a ring or a packet with a cell or cell header. A network capable of split address transfer that can shorten the address length is proposed.

  According to the present invention (1), in a network for transferring a cell or a packet or a packet with a cell header, the network is a network having a concentration point in a hierarchy or a concentration point in a hierarchy, and a cell or packet or A packet with a cell header is valid only in a split destination address that can be used only in that hierarchy and in a hierarchy below the hierarchy in which the cell or packet or a packet with a cell header is connected in the upstream direction. Does not have a source address that can be used, or does not have a destination address that can only be used effectively at that level, has a source address that can be used only at that level, or can be used only at that level Even though it has a source address, it has a configuration that does not use it, and it passes through through bits. On the other hand, in the parallel direction in the top ladder and in the parallel direction in the downward halfway and the middle of the downward direction, it passes through the bit through bit, and in the hierarchy for dispersion from the collection point in the hierarchy or the collection point in the hierarchy Cell or packet or packet with cell header, characterized by being transferred by a drop address memory or a drop address table of a network having only a destination division address for each of a plurality of hierarchies for distribution from the gathering points or the gathering points in the hierarchy Provide a network to transfer.

  Preferably, in the present invention (2), in the present invention (1), the network having a concentrating point is a multiple ring network having a plurality of nodes or a plurality of nodes, or a mesh network or a plurality of nodes connected in a mesh form. A network that connects multiple ring networks with mesh transmission lines, a ring network that has multiple nodes connected in a skewered manner, or a ring network that has multiple nodes in a skewered manner connects one source ring and one end ring The present invention provides a network for transferring a cell or packet or a packet with a cell header, which is a complex network having a structure in which a plurality of levels are connected in a tree shape as a level.

  Preferably, in the present invention (3), in the present invention (2), each hierarchical layer has an independent divided address and an independent divided address for each region in each hierarchical layer. Provided is a network for transferring a cell or a packet or a packet with a cell header, characterized by transferring a cell or a packet or a packet with a cell header within each area of each layer by an address.

  Preferably, in the present invention (4), in the present invention (3), the divided address used in each area of each hierarchy is an address of a specific node in each area of each hierarchy excluding the lowest hierarchy. It is characterized by that.

Preferably, in the present invention (5), in the above-described present invention (2, 3, 4), the composite network is composed of a plurality of ring networks, and the ring network for transferring a cell or a packet or a packet with a cell header is provided. A cell, packet, or cell header under each ring of a multi-stage ring tree network connected in a tree form, or a mesh network ring network in which a plurality of ring networks that transfer cells, packets, or packets with cell headers are connected in a mesh form A ring network that forwards attached packets is connected in a tree shape, a complex ring network that is connected to the highest ring of a multistage ring tree network, or a ring network that forwards cells or packets with packet or cell headers is connected in a skewered manner. Forward cells or packets or packets with cell headers under the ring network A fixed path in which multiple ring networks that connect cells or packets or packets with cell headers in a plane are connected in advance. A composite ring in which a ring network that forwards cells or packets or packets with cell headers is connected in a tree structure under each ring of a configured mesh ring network, and the top ring of a multistage ring tree network is connected A cell or a loop or a ring-shaped skewered ring network in which a ring network connecting cells or packets or ring networks that transfer packets with cell headers in a skewered connection is connected to a cell or A multi-stage network in which ring networks that transfer packets or packets with cell headers are connected in a tree shape Composite ring network was connected to the top ring of the ring-tree network, or,
A multi-stage ring network that connects a plurality of ring networks that transfer cells, packets, or packets with cell headers in a mesh form, or a ring network that connects cells, packets, or packets with cell headers connected in a tree structure A tree network, or a ring-shaped skewered ring network or cell in which a ring network that connects cells or packets or ring networks that transfer packets with cell headers in a skewered manner is connected to a starting ring network and an end ring network Alternatively, a fixed path that connects a large number of ring networks that transfer packets or packets with cell headers in a plane is skewed into a mesh ring network that has been set in advance or a ring network that transfers cells, packets, or packets with cell headers. One of a ring network with many connections A mesh network ring network in which cells or packets or packets with cell headers are transferred in a mesh form or a ring network that forwards cells or packets or packets with cell headers is connected in a skewered manner. A fixed path in which a ring-shaped skewered ring network connecting the start ring network and the end ring network of the ring network or a ring network that transfers a cell or a packet with a packet or a cell header in a plane is connected in advance. Place one of the configured mesh ring networks, or a ring network in which many ring networks that transfer cells, packets, or packets with cell headers are connected in a skewered manner, and place them on the lower network ring from below Rising cells or packets with a header or cell header Without connecting through other rings of the lower network, and directly connected to any ring of the upper network, and below each ring of the lower network, a single ring or a cell or The present invention is characterized in that it is a composite network having a configuration in which the ring networks for transferring packets or packets with cell headers are connected in a tree shape and the highest ring of a multistage ring tree network is connected.

  Preferably, in the present invention (6), in the present invention (5), when the existing Internet terminal and server are accommodated in this network, the existing IP terminal or existing IP server has them. An existing IP address can maintain a conventional connection relationship with other existing IP terminals or existing IP servers.

Preferably, in the present invention (7), in the present invention (2, 3, 4), the network of the network configuration used in this network is one hierarchical network of a network having a plurality of layers, and the nodes are meshed. If the network is connected in a network, the route setting must be set manually in advance, or if the network is the lowest network in the hierarchy to which the network belongs, the address of the connection node with the lower network is assigned. When a route setting cell or route setting packet is distributed to all nodes in the local network or all nodes in the hierarchy by flooding, and the address is registered in the memory at the entrance port of the flood destination node, Record only when the address is not recorded in the memory of the other port of the node or in the memory of its own port, or record the input port number and address of the flood destination When the address is not recorded in the drop address memory or the drop address table corresponding to the node, the input port number and the address are recorded, and the flooding is continued together with the address. The cell or packet is discarded,
In addition, the flooding of the central node of the network is configured such that the cell or packet is discarded after the address of the route setting cell or route setting packet is recorded in the drop address memory or drop address table of the entry node of the upper network. On the other hand, if the network is not the lowest network in the hierarchy to which the network belongs, a route setting cell or route setting packet having an address recorded in the drop address memory or drop address table of the node connected to the lower network is stored. When the address is registered in the memory at the entry port of the flood destination node by flooding to all nodes in the regional network or all nodes in the hierarchy, the memory or self Only if the address is not recorded in the port memory When the address is not recorded in the drop address memory or drop address table corresponding to the node that records or records the input port number and address of the flooding destination, the input port number and the address are recorded. In addition, the flooding is continued and the cell or packet is discarded if it is already recorded, and the flooding of the concentrating node of the network is the highest level of the hierarchy to which the network belongs. This method is performed only when not in the network, and the method is such that the cell or packet is discarded after the address of the route setting cell or route setting packet is recorded in the drop address memory or the drop address table of the entry node of the upper network. Features.

  Preferably, in the present invention (8), in the present invention (7), the route setup packet of the lowest hierarchy is an ARP packet, and the node to which the terminal of the lowest hierarchy is connected receives the received ARP packet. The route setting packet is flooded in the hierarchy, and flooding from the center node of the hierarchy to the higher level network does not discard the ARP packet after writing the address to the drop address memory at the upper level network entrance, but continues to the Even when the upper network floor is flooded with an ARP packet and reaches the topmost floor without a concentrating node, the address is written in the drop address memory of the entrance node of the floor, and then the packet is discarded. The terminal does not receive the ARP response packet after sending the ARP packet. If there is no destination on that floor, the packet is forwarded through to the center node of that floor, and the packet goes up to the upper floor at that node. A network for transferring packets, characterized in that the packet is forwarded through to the central node of the node, repeatedly going up to the upper level at that node, dropped at the level with the destination address, and connected to the destination terminal. .

  Preferably, in the present invention (9), in the present invention (8), the MAC packet does not leave a source address in the downlink direction.

  Preferably, in the present invention (10), in the present invention (1 to 6), the node is a higher-order bit string describing the number of cells per unit time flowing in the forward transmission path or the packet length of the packet within the unit time. The transmission path rate is obtained from the total value obtained by reading the bits, congestion prediction is determined, and the congestion bit is displayed in the cell header or packet header.

  Preferably, in the present invention (11), in the present invention (7, 8, 9), the node reads the upper bits of the bit string in which the packet length of the packet in the unit time flowing through the forward transmission path is written. The transmission rate is obtained from the value, congestion prediction is judged, and the congestion bit is displayed in the packet header.

  Preferably, in the present invention (12), in the above-mentioned present invention (5, 6, 10), the cell, packet or cell header packet ADDed to the node of the ring of this network is assigned its node number as the cell, packet or cell header. When the packet is written in the attached packet and goes up to the ring and reaches the node having the same number as that node number, a multi-round bit is added.

Preferably, in the present invention (13), in the present invention (1 to 7),
The drop address memory is characterized in that when the initial memory data is all 1 and normal data 1 is recorded at the recording address position, 0 is recorded as the data to be recorded.

Preferably, in the present invention (14), in the present invention (1 to 7),
In this case, the record of specific data corresponding to the address required for the drop address memory of each node belonging to this network or the address that needs to be recorded in the drop address memory is set in advance for all nodes except the lowest layer. Features.

  Preferably, in the present invention (15), in the present invention (1 to 6, 10, 12), the address of the drop address memory of each node of all the rings or the address position of the address that needs to be recorded in the drop address memory. The recording of the specific data indicating that the address has been recorded is set by a single path setting cell or a single path setting packet having the address of the entry node of each hierarchical network.

  Preferably, in the present invention (16), in the case of the present invention (15), when the network of the layer to be set for one path is a tree-like ring network, the network or terminal below the lowest ring in the layer The address of the node connected to the node is left in the drop address memory of the node, and the single route setting cell or single route setting packet having the address of the node is once or periodically dropped at the entry address of the highest ring in the hierarchy. In the middle of the ring, only the address is written in the drop address memory at the entrance. Through the ring, the node goes up to the upper ring, goes up to the upper ring, and stores the address in the drop address memory of the uppermost ring. The cell or packet is discarded after writing.

  Preferably, in the present invention (17), in the case of the present invention (15), when the network of the layer to be set for one path is a mesh ring network, the network or terminal under each ring of the network The address of the node connected to the node is left in the drop address memory of the node, and the single route setting cell or single route setting packet having the address of the node is converted into a copyable cell or packet. When the ring is circulated, copied at the node connected to the mesh transmission path on the ring, sent to the mesh transmission path, and reaches the drop address memory at the entrance of the mesh network ring to which the transmission path is connected, After writing the address of the cell or packet to the memory, discard the one-path setting cell or one-path setting packet. In a configuration, when a copyable one-path setting cell or one-path setting packet that has circulated around the original ring returns to the node where the address of the cell or packet is in the drop address memory, the one-path setting cell or one piece The route setting packet is configured to be discarded.

  Preferably, in the present invention (18), in the above-mentioned present invention (15), when the network of the layer to be routed is a skewered network, it is connected to a network or a terminal below each ring of the network. The address of the node to be used is left in the drop address memory of the node, and the one-path setting cell or one-path setting packet having the address of the node is made a copyable cell or a copyable packet. A one-path setting cell that returns to the node where the address of the cell or packet is stored in the drop address memory of the transmission source in a configuration where it is circulated, copied at the node connected to the adjacent ring on that ring, and sent to the adjacent ring Alternatively, the single path setting packet is discarded, and the single path setting cell or single path setting packet that has risen to the adjacent ring is After writing the address of the cell or packet to the drop address memory at the entrance of the ring, it goes around the ring, drops it at the node connected to the adjacent node, and repeats the operation of moving to the adjacent ring. When there is no adjacent ring in the end ring and the cell returns to the node where the address of the cell or packet is in the drop address memory, the one-path setting cell or one-path setting packet is discarded.

  Preferably, in the present invention (19), in the above-mentioned present invention (15), the network of the target layer for which one path is set includes a start ring network and an end ring network of a ring network in which a number of ring networks are connected in a skewered manner. In the case of a connected looped ring network, the address of the node connected to the network or terminal under each ring of the network is left in the drop address memory of that node, and the fragment having the address of that node is also stored. A route setting cell or single route setting packet is circulated around the ring once or periodically, a node connected to the adjacent ring on the ring is dropped on the adjacent ring, and the single route setting cell or the packet that goes up to the adjacent ring When a single path setup packet writes the address and mark of the cell or packet to the drop address memory at the entrance of the ring, If there is a node that has the address of the cell or packet in the drop address memory on the ring and wraps around the ring, the address is temporarily set around the ring. When returning to a node, the temporary address and mark are deleted and the cell or packet is discarded. On the other hand, there is no node with the address of the cell or packet in the drop address memory on the ring. In this case, when returning to the node where the address is temporarily set after going around the ring once, the temporarily set address is set to the main setting, and the multi-round bit is added to circulate the ring. A single route setup cell or single route setup packet with a bit is dropped at a node connected to an adjacent node and moved to an adjacent ring. Either temporarily set the address and mark in the drop address memory at the entrance of the adjacent ring, and repeat the same operation as above to set one path, or connect to the network or terminal under each ring of the network The address of the node to be used is left in the drop address memory of the node, and the single route setting cell or single route setting packet having the address of the node is circulated around the ring once or periodically, to the adjacent ring on the ring. Leave a record that prohibits writing the address of the cell or packet at the connected node, circulate to the original node, add the multi-round bit at the original node, circulate, and one path with the multi-round bit A setup cell or single-route setup packet is dropped at a node connected to an adjacent ring and then goes up to that adjacent ring. The single route setting cell or single route setting packet with a multi-turn bit is circulated after writing the address of the cell or packet to the drop address memory at the ring entrance, and similarly to the drop address memory at the entrance / exit node. By proceeding to the node of the ring where the prohibition of the address is set, the single path setting cell or the single path setting packet with the multi-turn bit is discarded at the node of the ring where the prohibition of the address is set. A method of setting a single path is used.

  Preferably, in the present invention (20), in the present invention (15), this network is a network to which a fixed telephone number address is transferred. In the case of a network that connects a mesh ring network above, if the connection node to the upper network of each ring of the lower mesh mesh ring network is an international network, the home country's international telephone number Create an international connection number address with the node number address added to the address, and send a single route setup cell or single route setup packet with that address to the upper network once or periodically. Up to one mesh ring, leaving the address in the drop address memory at the entrance of the upper network, and at that node the cell or packet can be copied or It is converted to a packet that can be transmitted to the network, circulated around the ring, copied at a node connected to all mesh transmission lines, sent to the mesh transmission line, and stored in the drop address memory at the entrance of the mesh ring to be connected. After writing the address, the one-path setting cell or one-path setting packet is discarded, and the copyable one-path setting cell or one-path setting packet that circulates the source ring is connected to the lower network of the ring. When returning to the node, a cell or packet or a packet with a cell header that is called out of the network in a configuration to be discarded is transmitted at the node connected to the higher level network with its node number address added to the home country address. In addition to the original address, all the additional addresses that may be used in the country of the other country's international telephone number A calling cell that has been converted to a plurality of calling cells or calling packets or packets with a calling cell header having an international connection number address, copied, sent to the upper network, and reached the destination terminal in the partner country Alternatively, the destination terminal generates a response cell, a response packet, or a packet with a response cell header from the source address and destination address of the call packet, and sends the response cell to the source.

  Preferably, in the present invention (21), in the present invention (5, 6, 10, 15 to 20), the cell or packet to be ADDed on the ring or the packet with the cell header is a specific position of the destination address or the source address. It goes up to the ring transmission line indicated by the bit.

  Preferably, in the present invention (22), in the above-mentioned present invention (21), the ring transmission path selected by the cell or the packet or the packet with the cell header from the originating side to the terminating side that is ADDed to the ring is the destination address (source) In the case of the transmission path indicated by the bit at the specific position of the address), the ring transmission path selected by the packet from the incoming side to the outgoing side is the transmission path indicated by the bit at the specific position of the source address (destination address). It is characterized by doing.

  Preferably, in the present invention (23), in the above-mentioned present invention (5, 6, 10, 12 to 20), a cell, a packet, or a packet with a cell header ADDed on the ring has a cell, a packet, or a packet with a cell header. It goes up to the ring transmission path indicated by the ring transmission path identification bit.

  Preferably, in the present invention (24), in the present invention (23), the ring transmission path selected by the cell or the packet or the packet with the cell header from the incoming side that is ADDed to the ring to the outgoing side is selected from the outgoing side to the incoming side. A cell or packet or packet with a cell header heading for is a ring transmission path indicated by a ring transmission path identification bit having a ring transmission path identification bit opposite to that of the cell or packet or packet with a cell header. Features.

  Preferably, in the present invention (25), in the present invention (21, 22, 23, 24), a calling cell or packet or a packet with a cell header added to the edge node ring of the lowest layer of this network is the ring. The congestion state of the transmission path between the call processing circuits of the partner edge node ring is checked by the call processing circuit of the other party, and when the congestion of the through transmission path is predicted, it is discarded as a call loss. .

  Preferably, in the present invention (26), in the present invention (1 to 6, 10, 12, 15 to 25), the MAC of the packet to be transferred is MAC in MAC or MAC in MAC in MAC. The cell header of the cell or packet with cell header is a double cell header or a double cell header obtained by extending the bit length of the cell header.

  Preferably, in the present invention (27), the address of the MAC in MAC or MAC in MAC in MAC or the address of the double cell header or the double cell header obtained by extending the bit length of the cell header in the present invention (26) It is a fixed telephone binary bit string in which 0 to 9 in decimal notation of each digit of a fixed telephone number is replaced with a 4-bit binary number.

  Preferably, in the present invention (28), in the present invention (27), an address of one MAC of MAC in MAC or MAC in MAC in MAC, or a double cell header obtained by extending a bit length of the double cell header or cell header. The 16 bits of the specific position of the address of the two cell headers are the lower 16 bits of the fixed telephone binary bit string in which 0 to 9 in the decimal notation of each digit of the existing fixed telephone number are replaced with a 4-bit binary number. Features.

  Preferably, in the present invention (29), in the present invention (27), the MAC in MAC or MAC in MAC in MAC or the double cell header or the double cell header in which the bit length of the cell header is extended is 16 bits of the address at a specific position. Is used as one flow address corresponding to the lower four digits of the fixed phone number decimal display in the lower edge node ring which is the lowest hierarchy, and the 20 bits of the address at the specific position is the lower decimal decimal display of the fixed telephone number which is the intermediate hierarchy. It is used as a pass address which is a bit string corresponding to the 5th to 9th digits, and the remaining address bit string is used as an 8 bit foreign connection bit string corresponding to a fixed telephone number.

Preferably, in the present invention (30), in the present invention (29),
An additional bit string is attached to 8 bits of the foreign connection bit string corresponding to the fixed telephone number and used as a foreign connection bit string.

Preferably, in the present invention (31), in the present invention (29),
When connecting to a foreign country, the intermediate layer bit string for foreign countries is used, and the intermediate layer in the home country has a through bit set up.

  Preferably, in the present invention (32), the bit length of the MAC header, the double cell header, or the cell header inside the MAC in MAC packet or MAC in MAC in MAC packet is extended in the present invention (27, 28, 29). The MAC header placed after the double cell header is used for fixed telephone number transfer, and the distinction from the conventional MAC use is determined by 0 and 1 of the seventh bit of the MAC header.

  Preferably, in the present invention (33), in the present invention (32), a mobile phone number is sent from a personal computer in a home instead of a fixed phone number, and a distinction between the fixed phone and the mobile phone is an empty bit in the MAC header. It is characterized by using.

  Preferably, in the present invention (34), in the present invention (32), a mobile phone number is inserted instead of a fixed phone number, and a distinction between the fixed phone and the mobile phone is performed by an empty bit of the MAC header. And

  Preferably, in the present invention (35), in the present invention (1 to 7, 10, 12 to 34), the radio edge node placed below or in place of the lowest layer network of this network In the ring, transfer is performed with one wireless flow address, and one wireless flow address assigned to the portable terminal is assigned to the wireless edge node with respect to the call registration portable terminal when the portable terminal is called. The base station placed at the node of the ring performs the call, and the receiving side calls the packet having a unique flow address in the appropriate wireless edge node ring including the other party's mobile number, and the base station calls the receiving terminal with a copy packet. And a response packet using the one flow address is connected to the calling side.

  Preferably, in the present invention (36), in the present invention (35), a mobile number is registered in a source mobile address memory placed in a node of a wireless edge node ring of a network for transferring a cell or a packet or a packet with a cell header. When a mobile terminal makes a call, the calling mobile terminal emits a radio wave including the calling mobile terminal number, and the base station that first receives the radio wave from the calling mobile terminal sets the mobile number of the calling mobile terminal. The call registration packet containing the node is raised to the mobile registration ring to which the node belongs, and the mobile phone number is recorded in the mobile phone address memory of the node, and the node number is written in the registration packet. The mobile phone number is recorded in the mobile phone address memory of the node, and the node number is stored in the packet. If the node number is smaller than the node number of the packet, the mobile number record is deleted. Record the packet, return to the original node of the node number recorded in the packet, and delete the record of the mobile number recorded in the mobile phone address memory of the node. If a record remains even after a certain period of time has passed since the mobile number was written, it is determined that the node has accepted the call, and the mobile number is given a unique flow address in the wireless edge node ring, The one flow address is recorded in the transmission address memory of the transmission ring of the node and the reception address memory of the reception ring. The base station of the base station sends the base station address of the base station, the flow address of the base station, the mobile phone number, the home memory, the mobile phone number of the mobile phone, the home memory, the connected IP address, or the fixed phone number of the mobile phone. A call processing is performed by sending a packet having the following.

  Preferably, in the present invention (37), in the present invention (35), the transmission address memory placed in the node of the wireless edge node ring is a memory in which one flow address possessed by a mobile number is registered. When it is determined that the reception area has changed, the mobile terminal emits a radio wave with a caller number that is one higher than the caller ID that was previously sent, and receives a radio wave with a different caller number for the first time or before. A base station that is not connected to the mobile terminal raises a mobile registration packet including one flow address and a transmission number of the mobile terminal to the transmission ring to which the node belongs, and stores the 1 in the transmission address memory of the node. Record the flow address and calling number, write the node number in the movement registration packet, and circulate on the transmission ring. When the one flow address is recorded in the transmission address memory of the node and the recorded transmission number is smaller than the transmission number of the packet, the transmission address memory and the incoming address memory of the node If the transmission number and one flow address record are deleted, and the transmission number is the same and the node number is larger than the node number of the packet, the transmission number and one flow address record in the transmission address memory of the node are deleted. On the other hand, if one flow address is recorded and the caller number is the same as that of the packet and the node number is smaller than the node number of the packet, this is indicated in the packet. Record, return to the original node of the node number recorded in the packet, and The record of one flow address and the caller number recorded in is deleted, and if the record remains even after a fixed time has elapsed since the writing of the one flow address to the transmission address memory, the node accepts movement. The one flow address is recorded in the destination ring address memory of the incoming ring, and the fact that the base station of the node stores the mobile terminal number and the address of the base station in the home memory of the mobile terminal. In addition to registering the location, the base station's address in the hierarchy, its mobile number, 1 flow address, its home memory, partner mobile number, its home memory, or the destination IP address It is characterized in that a packet having the other party's fixed telephone number is sent out and movement acceptance processing is performed.

  Preferably, in the present invention (38), in the present invention (35), the incoming address memory placed in the node of the wireless edge node ring is a memory in which an incoming one flow address is registered. The receiving station calls the receiving terminal mobile number including one flow address that is unique in the wireless edge node ring from all the base stations on the wireless edge node ring to which the incoming mobile terminal is supposed to exist at the same time. The base station that has received the response radio wave including one flow address raises an incoming response registration packet including one flow address of the incoming call response terminal to the incoming ring to which the node belongs, and the one flow address is stored in the incoming address memory of the node. And write the node number in the incoming registration packet and If the one flow address is not recorded in the incoming address memory on the ring, a measure to prohibit the recording of the one flow address is performed, and if it is recorded, the node number is If it is greater than the node number of the packet, the record is deleted and the writing of the one flow address is prohibited. On the other hand, if it is recorded, the node number is the node number of the packet. If it is smaller, record that fact in the packet, return to the original node of the node number recorded in the packet, erase the record of one flow address recorded in the incoming address memory of that node, The configuration is such that the writing of the one flow address is prohibited, and one flow address is added to the incoming address memory. If a record remains even after a certain period of time has elapsed since the writing of the network, it is determined that the node has received an incoming call response, and the base station of the node transmits the hierarchy of the base station to the receiving station. A packet having the address, 1 flow address, calling mobile phone number, and incoming mobile phone number is transmitted, and the incoming call response process is performed.

  Preferably, in the present invention (39), in the present invention (35), the wireless edge node ring has a 0-system ring transmission path and a 1-system ring transmission path. Emits a radio wave containing the calling mobile terminal number, and the base station receiving the radio wave for the first time from the calling mobile terminal converts the call registration packet containing the mobile phone number of the calling mobile terminal to the binary number of the mobile terminal number of the node. Raise it to the ring transmission line corresponding to the bit at the specific position of the changed bit string, record the mobile number in the originating mobile address memory of the ring transmission line, write the node number in the registration packet, and , And the mobile number is recorded in the mobile phone address memory of the ring transmission path of the node, and the node number is the node that the packet has If the mobile phone number is recorded and the node number is smaller than the node number of the packet, the mobile phone number record is deleted. Record and return to the original node of the node number recorded in the packet, and change the mobile terminal number of the node into the binary number, the mobile address address memory of the ring transmission line corresponding to the bit at the specific position of the bit string If the record remains even after a certain period of time has elapsed since the mobile number was written to the calling mobile address memory, it is determined that the node has accepted the call. Then, a unique flow address is given to the mobile number by the wireless edge node ring, and the single flow address is assigned to a specific position of the single flow address. Is recorded in the drop address memory of the ring transmission line corresponding to the bit of the node, and the fact that the base station of the node transmits the address of the hierarchy of the base station, its one flow address, and the mobile phone number to the originating station A packet having the home memory, the partner mobile number, the home memory, the connection destination IP address, or the partner fixed telephone number is transmitted to perform the calling process.

  Preferably, in the present invention (40), in the present invention (35), a wireless edge node ring 0 system ring transmission path and a system 1 ring transmission path are used, and one flow address during use of a mobile terminal in communication is The mobile terminal in communication is recorded in the drop address memory of the ring transmission line corresponding to the bit at the specific position of one flow address of the mobile terminal in use at the node of the base station to which the mobile terminal is connected. If it is determined that the reception area has changed, the mobile terminal emits a radio wave that includes a caller number that is one higher than the caller ID that was previously sent, and receives a radio wave with a different caller number from the mobile terminal for the first time or before. A base station that is not connected to the mobile terminal transmits a mobile registration packet including one flow address and a calling number of the mobile terminal to the base station node. It is raised to the ring transmission line corresponding to the bit at a specific position of one flow address in use of the portable terminal, and the one flow address and the calling number are recorded in the drop address memory of the ring transmission line, and the node number is registered for movement. When a packet is written and circulated on the ring transmission path, and the one flow address is recorded in the drop address memory of the node's ring transmission path, the recorded transmission number is the transmission number of the packet. If it is smaller, the one flow address and the calling number recorded in the drop address memory of the node are deleted, and the one flow address is recorded in the drop address memory of the ring transmission path The caller ID recorded with the caller If the node number is larger than the node number of the packet, the one flow address and the calling number recorded in the drop address memory of the ring transmission path of the node are deleted, When the one flow address is recorded in the drop address memory of the ring transmission path, the transmission number recorded with it is the same as the number of the packet, and the node number is the node number of the packet. If it is smaller, the fact is recorded in the packet, the process returns to the original node of the node number recorded in the packet, and the one flow address recorded in the drop address memory of the ring transmission path of the node The record of the calling number is erased and the packet is discarded. If a record remains even after a lapse of a certain time since the writing of one flow address to the memory, it is determined that the node has accepted mobile terminal movement, and that fact is indicated by the base station of the node. In addition, the mobile terminal number and the base station address are registered in the home memory of the mobile terminal, and the base station address and the mobile number 1 A packet having a flow address, its home memory, a partner mobile number, its home memory, a connection destination IP address, or a partner fixed telephone number is transmitted, and movement acceptance processing is performed.

Preferably, in the present invention (41), in the present invention (35),
Wireless edge node ring 0 system ring transmission line and 1 system ring transmission line. When receiving an incoming call, the receiving station is simultaneously sent from all base stations on the wireless edge node ring where the incoming mobile terminal is supposed to exist. The base station that received the response radio wave including the 1 flow address from the receiving terminal by calling the mobile number of the receiving terminal including the unique 1 flow address in the wireless edge node ring, and the incoming call registration including the 1 flow address of the incoming response terminal The packet is raised to the ring transmission line corresponding to the bit at the specific position of the one flow address to which the node belongs, the one flow address is recorded in the drop address memory of the ring, and the node number is written in the incoming registration packet. Circulate on the ring transmission line and store it in the drop address memory on the ring transmission line. If the one flow address is not recorded, a process for prohibiting the recording of the one flow address is performed. If the one flow address is recorded in the drop address memory on the ring transmission path, the node number If the packet number is larger than the node number of the packet, the record is erased and the writing of the one flow address is prohibited, while the one flow address is recorded in the drop address memory on the ring transmission path. If the node number is smaller than the node number of the packet, the fact is recorded in the packet, the node number of the node recorded in the packet is returned, and the node Deletes the record of one flow address recorded in the drop address memory of the ring transmission line Both are configured to prohibit the writing of the one flow address and discard the packet, and when a record remains even after a lapse of a certain time from the writing of the one flow address to the drop address memory. Determines that the node has received an incoming call response, and the base station of the node sends a packet having the address of the base station, the flow address, the calling mobile phone number, and the incoming mobile phone number to the receiving station. And the incoming call response process is performed.

  As described above, the present invention relates to a drop address used for a ring node in which a large number of rings based on a tree structure described in Japanese Patent Application No. 2012-206011 (packet transfer method and node device) are connected in a tree shape. Use a network that uses a memory that has only 1-bit information as to whether or not to drop the packet from the ring, and use the telephone number of the fixed telephone network as the address of the packet to be transferred there. Independently used, and a 16-bit local network corresponding to the last four digits of the telephone number, a 20-bit long-distance network corresponding to the middle five digits of the telephone number, and 8 bits for foreign connection 3 Used as a hierarchical network. Since the IP over MAC packet or IP packet with cell header transferred in this network has a separate address range for each layer, the address bit length of the drop address memory or drop address table used for the ring node is at most 20 bits. Thus, memory such as RAM, SRAM, CAM, etc. can be used, and hash calculation is not required, so that the cost can be reduced. Further, as shown in the above-mentioned patent, the route setting of this network can be automatically set with a single stroke after the one-way setting to the highest ring with one-way setting cell or packet. In addition, the upper network other than the local network may embed the route in advance.

  Furthermore, since this network has a tree structure, it can basically pass through each layer in the direction going up the upper ring, so the source address of the IP over MAC packet to be transferred or the IP packet with cell header is possessed. Can be omitted. However, since the source address for response is necessary, the source address is included in the call packet, the call cell header packet, the initial setting packet, or the packet with the initial setting cell header, and registered in the destination terminal or destination device. It is necessary to keep. To identify the subsequent IP over MAC packet or the IP packet with a cell header in the transmission destination apparatus, it is necessary to assign an address that can be identified only within the transmission destination apparatus.

  In the present invention, it is possible to further increase the size of the net by using a skewered ring net and a mesh ring net on the tree-like ring net. In addition, the network of the present invention is characterized in that it does not require header conversion of an IP over MAC packet to be transferred or an IP packet with a cell header at a connection point between layers.

  In addition, as long as the address embedded type is used, a packet with a cell header or a packet can be transferred in any network without a source address.

  The network of the present invention can also be used for a mobile phone network by setting a base station of a wireless network as an edge node ring node.

Further, the hierarchical MAC processing operation type transfer network of the present invention has a feature that it can accommodate an IP terminal or an IP server of an existing Internet network while being operable with a conventional IP address. Furthermore, in the present invention, the conventional Internet surfing performed on the Internet has a MAC address header conversion circuit that can convert the destination IP address to the destination MAC layer address on the server side, without returning control to the transmitting terminal side, There is a feature that becomes possible by connecting directly from the destination server to the surfing destination. Or, there is a feature that is made possible by returning the surfing change destination to the transmission source terminal.

As described above, the drop address memory of the ring node used for transferring the IP over MAC packet or the IP packet with the cell header that transfers the address division transfer ring network of the present invention is an address space for a short address length used in each layer. Therefore, it is possible to use a memory such as a RAM, an SRAM, and a CAM, and the cost can be reduced. Therefore, a hash technique is unnecessary, the node is simplified, and high-speed operation is possible. The address division transfer ring network has an advantage that a global network can be easily configured. Further, since a fixed telephone number address can be used as an address used in the network, there is an advantage that the subscriber terminal can determine an address necessary for all transfers. Furthermore, in the network of the present invention, there is an advantage that an IP terminal or an IP server can maintain a conventional connection relationship with other IP terminals or IP servers using their existing IP addresses.

It is a figure for demonstrating operation | movement of the packet or cell transfer network using the mesh network hierarchy division | segmentation address drop address memory of 1st Example of this invention. It is a figure for demonstrating the operation | movement of the packet transfer network with a packet or cell or cell header using the mesh network hierarchy division | segmentation address drop address memory of 2nd Example of this invention. It is a figure for demonstrating the operation | movement of the packet transfer network with a packet or cell or cell header using the ring network hierarchy division | segmentation address drop address memory of 3rd Example of this invention. It is a figure for demonstrating operation | movement of the packet transmission network with a packet or cell or cell header using the ring network hierarchy division | segmentation address drop address memory of 4th Example of this invention. It is a figure for demonstrating the operation | movement of the packet transmission network with a packet or cell or cell header using the ring network hierarchy division | segmentation address drop address memory of 5th Example of this invention. It is a figure for demonstrating the operation | movement of the packet transfer network with a packet or cell or cell header using the ring network hierarchy division | segmentation address drop address memory of 6th Example of this invention. It is a figure for demonstrating operation | movement of the packet transmission network with a packet or cell or cell header using the ring network hierarchy division | segmentation address drop address memory of 7th Example of this invention. It is a figure for demonstrating the operation | movement of the packet transmission network with a packet or cell or cell header using the ring network hierarchy division | segmentation address drop address memory of 8th Example of this invention. It is a figure for demonstrating the operation | movement of the packet transfer network with a packet or cell or cell header using the ring network hierarchy division | segmentation address drop address memory of 9th Example of this invention. It is a figure for demonstrating the operation | movement of the packet transmission network with a packet or cell or cell header using the ring network hierarchy division | segmentation address drop address memory of 10th Example of this invention. It is a figure for demonstrating the operation | movement of the packet transmission network with a packet or cell or cell header using the ring network hierarchy division | segmentation address drop address memory of 11th Example of this invention. It is a figure for demonstrating operation | movement of the application example of the packet transfer network with a packet or cell or cell header using the ring network hierarchy division | segmentation address drop address memory of 12th Example of this invention. It is a figure for demonstrating operation | movement of the application example of the packet transfer network with a packet or cell or cell header using the ring network hierarchy division | segmentation address drop address memory of 13th Example of this invention. It is a figure for demonstrating the operation | movement of the application example of the packet transfer network with a packet or cell or cell header using the ring network hierarchy division | segmentation address drop address memory of 14th Example of this invention. It is a figure for demonstrating the operation | movement of the application example of the packet transfer network with a packet or cell or cell header using the ring network hierarchy division | segmentation address drop address memory of 15th Example of this invention. It is a figure for demonstrating the example of a double cell header structure used for the packet transfer network with a cell using the ring network hierarchy division | segmentation address drop address memory of this invention, or a cell header. It is a figure for demonstrating the example of a double cell header structure used for the packet transfer network with a cell using the ring network hierarchy division | segmentation address drop address memory of this invention, or a cell header. It is a figure for demonstrating the example of a packet header used for the packet forwarding network using the ring network hierarchy division | segmentation address drop address memory of this invention. It is a figure for demonstrating a prior art. It is a figure for demonstrating a prior art. It is a figure for demonstrating a prior art. It is a figure for demonstrating a prior art. It is a figure for demonstrating a prior art. It is a figure for demonstrating a prior art. It is a figure for demonstrating a prior art.

  A first embodiment of the present invention is shown in FIG. In this embodiment, a mesh network is connected in a tree shape, and the network has three layers. This network is an example in which fixed telephone number addresses are divided into three layers and used. Further, in this example, the source MAC addresses of all routes are manually set in the L2 switch.

  Reference numeral 850 denotes a first hierarchy made up of a local network (mesh network), 851 a second hierarchy made up of an out-of-city network (mesh network), and 852 a third hierarchy made up of an international network (mesh network), 856,857. , 858, 859 are L2 switches of the first layer, 865, 861, 862, 860, 863, 864 are L2 switches of the second layer, 866, 867, 868 are L2 switches of the third layer, 857, 858, 859. Is a concentrating node in the regional floor, a connection node with the upper network, 863 and 864 are concentrating nodes in the out-of-city layer, a connection gateway node with the international network, and 860, 861 and 862 are subordinate networks And has a MAC address of its own node in its own hierarchy. 866 and 867 are subordinate networks and connection nodes of the international network, and have their own node MAC addresses in the international network. Reference numeral 853 denotes a transmission terminal A, and reference numeral 854 denotes a reception terminal B. 855 is a packet sent out by the transmitting terminal A. The first b of MAC, b, c, b indicates the partner country, the MAC address of the egress node of the third layer international network, and the next c is the partner country. The MAC address of the lowest-order node in the second layer that is the exit of the toll network, and the next b is the MAC address of the node that is connected to the terminal of the local network in the partner first layer. This address is an address of only a destination address that does not have a source address.

Reference numeral 890 indicates a three-layer address of a fixed telephone number used in this network. A connection node with a lower layer of each layer has its own MAC address used only in that layer. Each of a, b, and c described in the L2 switch in each layer is a MAC source address that can be used only in that layer, and is manually set in advance in each L2 switch. Each region of the hierarchy is forwarded by the set destination MAC address, but if the packet passes through that region, it is a connection node with the upper network, and the central point in that region The packet is transferred toward the node through the set route. The symbols (1) to (17) shown in the figure indicate the path through which 855 MAC packets are transferred from the transmitting terminal A to the receiving terminal B. Pass by.
Next, a second embodiment of the present invention is shown in FIG. In this embodiment, a mesh network is connected in a tree shape, and the network has three layers. This network is an example in which fixed telephone number addresses are divided into three layers and used. Further, in this example, the source MAC addresses of all paths are set in advance in the L2 switch by flooding.

  Reference numeral 870 denotes a first hierarchy consisting of a local network (mesh network), 871 denotes a second hierarchy consisting of an out-of-city network (mesh network), and 872 denotes a third hierarchy consisting of an international network (mesh network), 876,877. , 878, 879 are L2 switches of the first layer, 885, 881, 882, 880, 883, 884 are L2 switches of the second layer, 886, 887, 888 are L2 switches of the third layer, 877, 878, 879. Is a concentrating node in the regional floor, a connection node with the upper network, 883 and 884 are concentrating nodes in the out-of-city layer, a connection gateway node with the international network, and 880, 881 and 882 are the lower network And has a MAC address of its own node in its own hierarchy.

  Reference numerals 886 and 887 are subordinate networks and connection nodes of the international network, and have their own node MAC addresses in the international network. Reference numeral 873 denotes a transmission terminal A, and reference numeral 874 denotes a reception terminal B. 875 is a packet sent from the transmitting terminal A. The first b of MAC, b, c, b indicates the partner country, the MAC address of the egress node of the third layer international network, and the next c is the partner country. The MAC address of the lowest-order node in the second layer that is the exit of the toll network, and the next b is the MAC address of the node that is connected to the terminal of the local network in the partner first layer. This address is an address of only a destination address that does not have a source address.

  Reference numeral 890 indicates a three-layer address of a fixed telephone number used in this network. A connection node with a lower layer of each layer has its own MAC address used only in that layer. Each of a, b, and c described in the L2 switch of each layer is a MAC source address that can be used only in that layer, and is a MAC address of a connection node with a lower level network of each layer. It is set in advance for each L2 switch. The numbers a1, a2, a3, c1, c2, c3, etc. indicate the order of flooding, and the symbols Xc3, Xa3, Xc2, etc. are different from the ports where the same MAC address has already arrived at the L2 switch where the flooding arrived When set to a port, it indicates that the packet has been discarded. With this discarding operation, a flooding storm does not occur even without the spanning tree protocol.

  Each region of the hierarchy is forwarded by the set destination MAC address, but if the packet passes through that region, it is a connection node with the upper network, and the central point in that region The packet is transferred toward the node through the set route. The symbols (1) to (17) shown in the figure indicate the path through which 875 MAC packets are transferred from the transmitting terminal A to the receiving terminal B. Pass by.

  A third embodiment of the present invention is shown in FIG. This embodiment is a three-layer network in which double rings are connected in a tree shape, and this network is an example in which fixed telephone number addresses are divided into three layers and used. In this example, a one-way route is set.

  Reference numeral 1 denotes a first hierarchy consisting of a local network (edge node ring) 2, 3 denotes a second hierarchy consisting of an out-of-city network (tree-like network) 4, and 5 denotes a second hierarchy consisting of an international network (tree-like network) 6. 3 layers, 7 is a double ring of edge nodes, 8 is a double ring of the 2nd layer, 9 is a double ring of the 3rd layer, 10 is a fixed telephone number address, 11 is the destination terminal A, 12 is called The side terminals B and 50 are drop address memories having confident addresses (a, b, c, d) of nodes connected to the edge node ring of the lowest ring of the second hierarchy, and 51 is the lowest address of the second hierarchy The drop address memory of the node connected to the upper ring, 52 is the uppermost ring of the second layer, the drop address memory of the node connected to the third layer ring, 53 is the lowermost ring of the second layer Drop a node connected to a ring The address memory 54 is a drop address memory having a self-confidence address (e, f, g, h) of a node connected to the second hierarchy ring of the lowest ring of the third hierarchy, and 55 is the highest address of the third hierarchy The drop address memory of the node connected to the lower ring of the ring, 57 is the drop address memory of the node connected to the upper ring with the lowest ring in the third hierarchy, and 60 is the destination address of the cell sent out by the terminal A (11) A certain VPI (third-layer address h, partner country second-layer address b) and VCI (B), 61 are examples in which a cell transmitted from terminal A passes through the edge node ring, and 62 is from terminal A. Is the example where the cell from terminal A passes through the lowest ring in the second hierarchy, 63 is an example where the cell from terminal A passes through the highest ring in the second hierarchy, and 64 and 65 are terminals A An example in which the cell circulates the lowest ring in the third layer, 66 is an example in which the cell from terminal A circulates with the multi-round bit (mr) attached, and 67 is a multi-round bit from terminal A. The drop address memory of the connection node with the upper ring in which the destination address h of the cell marked with is written, 68 is an example in which the cell from the terminal A drops the uppermost ring of the third hierarchy, 69 is the terminal An example in which a cell from A drops the lowest ring in the third hierarchy and connects to the second hierarchy, 70 is an example in which a cell from terminal A drops the highest ring in the second hierarchy in the destination country, 71 is an example in which the cell from terminal A drops the lowest layer of the second hierarchy of the destination country and connects to the destination edge node ring, and 72 is a cell from terminal A that has the edge node ring of the destination country. Drop and connect to destination terminal B In the following example, 73 is a drop address memory in which the address B of the destination terminal B is written. The multi-round bit may be set by the multi-round bit grant node, but when ADD is made to the ring node, the node number is written in the cell, and if the cell reaches the same node as the node number, the multi-round bit is set. A round bit may be added.

  In this embodiment, the node connected to the lower ring of the lowest ring of each hierarchy writes the address of that hierarchy of confidence to that node, and the drop address memory of the connected node with the lower ring of the highest ring of that hierarchy Until one-path setting cell having only the address of that node is periodically sent, the address of that cell in the drop address memory of the connection node between the drop address memory at the point going up to the through ring and the lower ring of the highest ring This is an example of writing. As a result, cells sent to this network pass through in the upstream direction, or if there is no destination, go around the ring, add multi-turn bits at the ADD node, and attach multi-turn bits. Is a node connected to the upper ring, the destination address used in the hierarchy of the cell is written in the drop address memory of the node, the node goes to the upper ring, and the node where the destination address is written by the one-path setting cell , The downstream direction can reach the partner edge node ring in the downstream direction by the already set address.

  The reverse direction can be reached as well. When making a foreign connection, all the domestic edge node rings on the originating side and the second level ring pass through. This is because in address division transfer, when connecting to a foreign country, the destination address of the second layer of the partner country cannot be written in the drop address memory of the second layer of the home country. This is because the address is double between the partner country and the home country. Therefore, since the source address cannot be left in the drop address memory in the downlink direction in the partner country, the only way to pass through the uplink direction in the home country is. This cannot be routed in advance. A tree-like network having only a one-way network can be passed through the second layer, and a tree-like network having a mesh network at the highest level is also possible, but it can only be passed through because it does not pass through the mesh network.

  In this embodiment, a node that goes up to an upper ring in a ring connected to an upper hierarchy becomes a collecting node in that hierarchy. In each ring, a node that passes through and goes up to the upper ring becomes a collecting node on the regional level.

  Next, a fourth embodiment of the present invention is shown in FIG. This embodiment is a three-layer network in which double rings are connected in a tree shape, and this network is an example in which fixed telephone number addresses are divided into three layers and used. This example is an example in which all routes in the second and third layers are set in advance.

  80 is an example in which the destination address is set in the drop address memory of the node that goes up to the upper ring of each ring of the second hierarchy, excluding the uppermost ring of the second hierarchy set in advance. 81 is an example in which the destination address is set in the drop address memory of the node that goes up to the upper ring of each ring of the third hierarchy, excluding the highest ring of the third hierarchy set in advance.

  82 is a destination address of a cell transmitted from terminal A (11), VPI (third layer address h, partner country second layer address b) and VCI (B), 83 are cells transmitted from terminal A Through the edge node ring, 84 is an example in which a cell transmitted from the terminal A passes through the lowest layer ring in the second layer, and 85 is an example in which a cell transmitted from the terminal A is the uppermost ring in the second layer. 86 is an example in which a cell from terminal A circulates the lowest ring in the third hierarchy, 87 is an example in which a cell from terminal A reaches the highest ring in the third hierarchy, 88 An example in which a cell from terminal A drops the highest ring in the third hierarchy, 89 is an example in which a cell from terminal A drops the lowest ring in the third hierarchy and connects to the second hierarchy, 90 indicates that the cell from terminal A is the second layer of the destination country An example in which the highest ring is dropped, 91 is a case in which the cell from terminal A drops the lowest ring in the second layer of the destination country and connects to the destination edge node ring, and 92 is a cell from terminal A. An example of dropping the edge node ring of the destination country and connecting to the destination terminal B, 93 is a drop address memory in which the address B of the destination terminal B is written. Since other circuit operations are the same as those in the third embodiment, the description thereof is omitted.

  In this embodiment, since the route is preset, all the rings have destinations, so that the multi-turn bit is not added. However, as explained in the first embodiment, the second hierarchy of the home country can only be passed.

  Next, FIG. 5 shows a fifth embodiment of the present invention. This embodiment is a three-layer network in which double rings are connected in a tree shape. This network is an example of domestic connection in which fixed telephone number addresses are divided into three layers and used. In this example, a one-way route is set.

  100 is a destination address of a cell transmitted by terminal A (11), VPI (third layer address is 0 indicating local connection, second layer address a of partner terminal) and VCI (B), 101 are An example in which a cell transmitted from terminal A passes through the edge node ring, 102 and 103 are examples in which a cell from terminal A circulates the lowest ring in the second layer, and 104 is a cell from terminal A. An example in which a multi-round bit (mr) is added, and 105 is a drop address memory of a connection node with a higher ring in which a destination address a of a cell attached with a multi-round bit from terminal A is written, 106 An example in which a cell from terminal A drops the highest ring in the second hierarchy, 107 is a cell from terminal A that drops the lowest ring in the second hierarchy and connects to the destination edge node ring. Example, 108, the cell from the terminal A, to drop the edge node ring, example of connecting to the destination terminal B, 109, it is a drop address memory the address of the destination terminal B B is written. Other circuit operations are the same as those in the first embodiment, and thus description thereof is omitted. The multi-round bit may be set by the multi-round bit grant node, but when ADD is made to the ring node, the node number is written in the cell, and if the cell reaches the same node as the node number, the multi-round bit is set. A round bit may be added.

  Next, a sixth embodiment of the present invention is shown in FIG. This embodiment is a three-layer network in which double rings are connected in a tree shape. This network is an example of domestic connection in which fixed telephone number addresses are divided into three layers and used. In this example, all routes are set in advance.

  110 is a destination address of a cell transmitted by terminal A (11), VPI (third layer address is 0 indicating local connection, second layer address a of partner terminal) and VCI (B), 111 are: An example in which a cell transmitted from terminal A passes through the edge node ring, 112 is an example in which a cell from terminal A circulates the lowest ring in the second layer, and 113 is a cell from terminal A in the second An example of dropping the highest ring of the hierarchy, 114 is a cell from terminal A, an example of dropping the lowest ring of the second hierarchy and connecting to the destination edge node ring, 115 is a cell from terminal A, An example in which the edge node ring is dropped and connected to the destination terminal B, 116 is a drop address memory in which the address B of the destination terminal B is written. Since other circuit operations are the same as those in the fourth embodiment, the description thereof is omitted.

  Next, FIG. 7 shows a seventh embodiment of the present invention. In this embodiment, the second layer is a network composed of three layers in which double rings are connected in a tree shape and the third layer is connected in a mesh shape. This network divides fixed telephone number addresses into three layers. This is an example of international connection. In addition, this example is an example in which a single path is set.

  21 is a double ring connected in a mesh form of the third hierarchy, 120 and 121 are nodes connected to the second hierarchy of the mesh ring of the third hierarchy, and a drop address memory in which the address of the node is set 122, 123 are examples in which the address of the node connected to the second layer is set in the drop address memory at the entrance of each ring of the mesh network. Reference numeral 140 denotes an international network (mesh network).

  130 is a destination address of a cell sent from terminal A (11), VPI (third layer address is f indicating international connection, second layer address d of partner country) and VCI (B), 131 are terminals An example in which a cell transmitted from A passes through the edge node ring, 132 indicates an example through the lowest ring in the second layer, 133 indicates an example through the highest ring in the second layer, and 134 indicates a terminal A. The cell from lap around the lowest ring of the third hierarchy, 135 the cell from terminal A drops the lowest ring of the third hierarchy, 136 the cell from terminal A Example of dropping the second highest layer ring in country 2 137, cell from terminal A dropping second lowest layer ring in second layer and connecting to destination edge node ring 138 from terminal A Cell Drop di node rings, an example of connecting to the destination terminal B. Since other circuit operations are the same as those in the third embodiment, the description thereof is omitted.

  When writing a single path setting address to the drop address memories 122 and 123 in the third hierarchy, the connection node with the second hierarchy in the third hierarchy converts a single path setting cell having a confident address into a copyable cell. The cell sent out periodically is copied at all nodes connected to the mesh transmission line of the ring, sent to the mesh transmission line, and dropped at the entrance of the destination ring of the mesh network transmission line. After the address of the cell is written in the address memory, it is discarded. The copyable one-path setting cell of the original ring is discarded when the drop address memory returns to the original node having the address of the cell. This prevents the copied cell from becoming a loop.

  Next, FIG. 8 shows an eighth embodiment of the present invention. In this embodiment, the second layer is a three-layer network in which double rings are connected in a tree shape, and the third layer is a double ring connected in a loop. This network has a fixed telephone number address. This is an example of international connection, which is divided into three layers. In addition, this example is an example in which a single path is set.

  900 is a double ring skewed and connected in a third layer loop, 901 and 902 are nodes connected to the second layer of the third layer looped skewer ring, and the address of the node is set. The drop address memories 903 and 904 are examples in which the address of the connection node with the second hierarchy is set in the drop address memory at the entrance of the loop connection node of each ring of the looped skewering network. Reference numeral 940 denotes an international network (loop skewered net).

  Reference numeral 910 denotes a VPI that is a destination address of a cell transmitted from the terminal A (11) (the third layer address is f indicating international connection, the second layer address d of the partner country), and the VCI (B) and 911 are terminals. An example in which a cell transmitted from A passes through the edge node ring, 912 indicates an example through the lowest ring in the second layer, 913 indicates an example through the highest ring in the second layer, and 914 indicates a terminal A. , The cell from terminal A circulates around the looped skewer ring of the third layer, 915 is an example where the cell from terminal A drops the connection ring with the second layer of the third layer, 916 is from terminal A , In which the cell from terminal A drops the highest ring in the second hierarchy of the partner country, and 917 shows an example in which the cell from terminal A drops the lowest ring in the second hierarchy and connects to the destination edge node ring, 918 Is a terminal Cells from and drop the edge node ring, an example of connecting to the destination terminal B. Since other circuit operations are the same as those in the third embodiment, the description thereof is omitted.

  Writing a single path setting address to the drop address memories 903 and 904 in the third hierarchy leaves the address of the node connected to the second hierarchy network in the drop address memory of the node and also has the address of the node A node or a single route setup packet that circulates in the ring once or periodically, drops to the adjacent ring at a node connected to the adjacent ring on the ring, and goes to the adjacent ring. The routing packet writes the address and mark of the cell or packet to the drop address memory at the entrance of the ring and temporarily sets them, circulates the ring, and stores the cell or packet in the drop address memory on the ring. If there is a node with an address, the ring When returning to the node where the address is temporarily set after one round, the temporarily set address and mark are deleted and the cell or packet is discarded, while the cell or packet is dropped in the drop address memory on the ring. If there is no node with the address that the packet has, when going around the ring and returning to the node where the address is temporarily set, the temporary address is set to this setting and the multi-round bit is set. In addition, a single route setup cell or single route setup packet with a round bit is dropped at the node connected to the adjacent node, moved to the adjacent ring, and stored in the drop address memory at the entrance of the adjacent ring. One path is set by temporarily setting an address and a mark and repeating the same operation as described above.

  Alternatively, the address of the node connected to the second layer network is left in the drop address memory of the node, and the single path setting cell or single path setting packet having the address of the node is circulated once or periodically in the ring. , Leaving a record that prohibits the writing of the address of the cell or packet to the node connected to the adjacent ring on the ring, circulate to the original node, attach a multi-round bit at the original node, circulate, A single route setup cell or single route setup packet with a multi-round bit is dropped at a node connected to an adjacent ring, and a single route setup cell or single route setup packet with a multi-round bit is dropped on that ring. After writing the address of the cell or packet to the drop address memory at the entrance To the node of the ring where the address prohibition is set in the drop address memory at the entrance of the distant node, and at the node of the ring where the prohibition of the address is set, the multipath bit-attached one-path setting cell Alternatively, a method of setting a single path is used by discarding the single path setting packet.

  Next, FIG. 9 shows a ninth embodiment of the present invention. In this embodiment, the second hierarchy is a three-layer network in which double rings are connected in a structure in which a mesh network is placed on a tree-like network, and the third hierarchy is connected in a mesh shape. This is an example of international connection in which fixed telephone number addresses are divided into three layers and used. However, the third layer extends the address length by adding an additional address β to the fixed telephone number. In addition, this example is an example in which a single path is set.

  158 is a third layer mesh-connected double ring, 154 and 155 are nodes connected to the second layer of the third layer mesh ring, and the second layer mesh is connected to the fixed telephone number of the country. In the drop address memory 156, 157 in which the address of the connection node with the mesh network ring is set, the extended address of the connection node with the second layer is set in the drop address memory at the entrance of each ring of the mesh network It is an example. 153 is a mesh-like ring placed at the top of the second layer, and drop address memories 151 and 152 at the entrance of each mesh transmission line include single-path setting cells that have risen from the lower tree-like network. It is converted to a copy cell, copied at a node connected to each mesh transmission line, sent to the mesh transmission line, and the cell's address is set in the drop address memory at the entrance of the mesh ring at the connection destination. By discarding, the address of the connection node with the edge node ring of the lowest ring of the second hierarchy is recorded.

  Further, the mesh-like ring 153 has a node 175 that is directly connected to the third layer ring, and the through cell is internationally connected via the node. The node 175 periodically sends a single-route setting cell or single-route setting packet having an international connection address obtained by adding the node number address to the international telephone number of the home country to the mesh ring of the third layer, Is set. Reference numeral 160 denotes an international network (mesh network), and 161 denotes a long distance network (a network in which a mesh network is connected to a tree network). Reference numeral 162 denotes a VPI (third layer home international address e + 0) that is a source address of a calling cell transmitted by the terminal A (11) and a destination address VPI (third layer address f + 0, a partner country second layer Address d) and VCI (B), 163 are examples in which a cell transmitted from terminal A passes through the edge node ring, and 164 is an example in which a cell transmitted from terminal A passes through the lowest-order ring in the second layer. 165, an example in which the cell transmitted from the terminal A passes through the node 175 directly connected to the third layer ring without passing through the second layer mesh network. In the node 175, the source international connection address is added. The node number address 1 is added to the position of the address 0, and the destination international address is all possible additional addresses to the destination international telephone number address f. Converts into several international connection address was example, are copied.

  Although f + X is entered in the figure, a large number of calling cells are actually copied. 166 is an example in which a cell from terminal A is sent from its node 175 to the mesh transmission path in the third layer, 167 is an example in which a cell from terminal A transfers the mesh ring in the third layer, 168 An example in which a cell from terminal A drops a third layer mesh ring and connects to a second layer node 176 in the partner country. 169 is a second layer in the destination country. , 170 is a cell from terminal A, and a cell from terminal A drops a second lowest layer ring in the second layer of the destination country and connects to a destination edge node ring. 171 is a cell from terminal A In this example, the edge node ring of the destination country is dropped and connected to the destination terminal B. 177 is an example of an international connection address that has been expanded and copied. Actually, a large number of copy call cells arrive at the partner country, but do not reach the partner terminal.

  Reference numeral 180 denotes an example in which an additional address β is added to the fixed telephone number of the third layer address. In this example, only the international connection address f + X is transferred to the second layer address d at the node 176 and reaches the terminal. The other copied international connection address is also converted to the second layer address d, but the cell is discarded because there is no drop node in the converted ring. In the node 176, the transferred address is converted to the second layer address d. However, the destination international connection address F + X is transferred to the terminal B together with the source international connection address e + 1. Terminal B creates a response cell or response packet or a packet with a response cell header and responds to the calling terminal.

  In this embodiment, there are a large number of nodes of the mesh ring that are internationally connected in the home country, and each node is connected to the mesh ring of the third layer through a separate transmission line. Since a large number of addresses are required, it is necessary to add an additional address to the 8-bit international connection address of the conventional fixed telephone number to expand the international connection address space.

  Next, FIG. 10 shows a tenth embodiment of the present invention. This embodiment is a three-layer network in which the second layer connects double rings in a tree shape and the third layer is connected in a skewered manner. This network divides fixed telephone number addresses into three layers. This is an example of international connection. In addition, this example is an example in which a single path is set.

  202 is a third level skewered ring, rings at both ends, 201 is a third level skewered ring, a ring that is not a ring at both ends, and 190 and 191 are second levels of the third level skewered ring. The drop address memory 192 to 196, which records the address of its own node at the connection node with, is connected to the second layer of the skewered ring of the third layer, and the address of the node set by the single path setting cell Drop address memory. Reference numeral 200 denotes an international network (a skewered network).

  210 is a destination address of a cell sent out by terminal A (11) VPI (third layer address is f indicating international connection, second layer address d of partner country) and VCI (B), 211 are terminals An example in which a cell transmitted from A passes through the edge node ring, 222 an example in which the lowest layer ring in the second hierarchy is passed through, 223 an example in which the cell in the second hierarchy passes through the highest ring, and 224 the terminal A An example in which a cell from a cell transfers a third layer skewered ring, 225 an example in which a cell from terminal A drops a third layer skewered ring and connects to the second layer in the partner country 226 An example in which the cell from terminal A drops the highest layer in the second hierarchy of the partner country, and 227 shows that the cell from terminal A drops the lowest ring in the second hierarchy and becomes the destination edge node ring. Example of connection, 22 The cells from terminal A drops the edge node ring, an example of connecting to the destination terminal B. Since other circuit operations are the same as those in the third embodiment, the description thereof is omitted.

  The node connected to the second layer of the third layer skewered ring writes the address of the node in the drop address memory of the connection node, and the one-way setting cell having the address is converted into a copyable cell, Copy at the node connected to the adjacent ring of the ring, circulate, and if the address is in the drop address memory, the cell is discarded, and the single path setting that is copied and goes up to the adjacent ring The cell writes the address of the cell to the drop address memory at the entrance of the ring, goes around the ring, drops at the node connected to the adjacent ring, goes up to the adjacent ring, repeats the above operation, and repeats the above operation. Cycled around the ring at the end and reached the node where the address of the cell already exists in the drop address memory The case, on that node, discard the cell.

  Next, an eleventh embodiment of the present invention is shown in FIG. In this embodiment, the second layer is a ring network in which double rings are connected in a tree shape, and the third layer is a meshed ring network in which a fixed path in which a large number of ring networks are connected in a plane is set in advance. This is a network composed of three layers, and this network is an example of international connection in which fixed telephone number addresses are divided into three layers and used. In addition, this example is an example in which a single path is set.

  256 is a planar mesh ring in which one ring in the third layer is connected to four other rings. The address e of the node is written in the drop address memory of the node connected to the second layer 250, and the address is set in advance in the drop address memories 253 and 255. Further, the address f of the node is written in the drop address memory of the node connected to the second layer of 251, and the address is set in advance in the drop address memories of 252 and 254. 279 is an international network (planar mesh network).

  260 is a destination address of a cell sent out by terminal A (11) VPI (third layer address is f indicating international connection, second layer address d of partner country) and VCI (B), 261 are terminals An example in which a cell transmitted from A passes through the edge node ring, 262 passes through the lowest ring in the second layer, 263 passes through the uppermost ring in the second layer, and 264 and 265 denote Example of cell from terminal A transferring 3rd layer planar mesh ring 266, cell from terminal A dropping 3rd layer planar mesh ring and connecting to 2nd layer of partner country Example 267 is a case where the cell from terminal A drops the highest layer of the second hierarchy of the partner country. 268 is a case where the cell from terminal A drops the lowest layer of the second hierarchy and the destination. Edge node Example of connecting to the grayed, 269 cells from terminal A drops the edge node ring, an example of connecting to the destination terminal B. Since other circuit operations are the same as those in the third embodiment, the description thereof is omitted.

  Next, FIG. 12 shows a twelfth embodiment of the present invention. This embodiment is an example in which the MAC address division transfer network 400 of the third to eleventh embodiments is applied to an existing Internet network, and is an example in which the MAC address header conversion circuit 404 is used for net surfing. The packet transmitted from the existing IP terminal E401 is transferred at the lowest layer address 408, and is transferred at the lowest layer address 409 via the MAC address division transfer network 400 described in the first to ninth embodiments. The service reaches the IP server F402 and receives a service.

  When surfing the network from the existing IP server F402 to the existing IP server G403, the MAC address header conversion circuit 404 converts the MAC address of the packet arriving from the existing IP terminal E401 based on the IP address of the existing IP server G403. Then, via the MAC address division transfer network 400, the existing IP server G403 is connected with the lowest layer address 410 and receives the service of the existing IP server G403. This embodiment is characterized in that the network cost of the existing Internet network is reduced because it can be connected to the server of the existing Internet network via the MAC address division transfer network without changing the connection IP address.

  Next, FIG. 13 shows a thirteenth embodiment of the present invention. This embodiment is an example in which the MAC address division transfer network 400 according to the third to eleventh embodiments is applied to an existing Internet network, and the MAC address header conversion circuit 404 is used via the existing MAC networks 430, 431, and 432 for net surfing. It is an example. The packet sent from the existing IP terminal E401 is transferred via the existing MAC network 430 at the lowest layer address 433, and is transferred via the MAC address division transfer network 400 described in the first to ninth embodiments to the highest. It is transferred at the lower layer address 434, reaches the existing IP server F402 via the existing MAC network 431, and receives a service.

  When surfing the existing IP server F402 to the existing IP server G403, the MAC address header conversion circuit 404 converts the MAC address of the packet arriving from the existing IP terminal E based on the IP address of the existing IP server G403. The existing IP server G403 is connected to the existing IP server G403 via the MAC address division transfer network 400 via the existing MAC networks 431 and 432 at the lowest layer addresses 434 and 435, and the service of the existing IP server G403 is received. This embodiment is characterized in that the network cost of the existing Internet network is reduced because it can be connected to the server of the existing Internet network via the MAC address division transfer network without changing the connection IP address.

  Next, FIG. 14 shows a fourteenth embodiment of the present invention. This embodiment is an example in which the MAC address division transfer network 400 according to the third to eleventh embodiments is applied to an existing Internet network, and a network surfing is not performed from a connection destination existing IP server F402 without using a MAC address header conversion circuit. The existing IP terminal E401 receives the IP address of the existing IP server G403 that is the surfing destination, and directly connects to the existing IP server G403 from the existing IP terminal E401 to receive the service. This embodiment is the same as the tenth embodiment except for the absence of the MAC address header conversion circuit. In the tenth to twelfth embodiments, the IP terminal or the IP server can maintain the conventional connection relationship with other IP terminals or the IP server by using the existing IP address.

The fourteenth embodiment is an example in which the MAC address division transfer network 400 is used. Instead of the MAC address division transfer network, the cell header address division transfer network in which the packets transferred in the networks described in the third to eleventh embodiments are cells. Similarly, the service can be received by connecting the existing IP terminal and the existing IP server.
Next, FIG. 15 shows a fifteenth embodiment of the present invention. In this embodiment, the third and second layer MAC address division transfer networks 700 of the third to eleventh embodiments are connected to the wireless edge node rings 703 and 704 of the first layer.

  700 is a third layer and second layer MAC address division transfer network, 701 is a wireless transmitting station, 702 is a wireless receiving station, 703 is a first transmitting wireless edge node ring, 704 is a first-layer incoming-side wireless edge node ring, 705 is a mobile number registration ring, 706 is a transmission ring, 707 is an incoming ring, 708 is a wireless edge node ring 703, 704 is an upper network Nodes to be connected, 709 is a transmission path to which the transmission ring 706 is connected to the higher level network, 710 is a transmission path to which the incoming ring 707 is connected to the higher level network, 711 to 718 are radio base stations, 719 is a mobile phone Terminals K and 720 are called mobile terminals L. Further, a is a mobile phone address memory, b is a transmission address memory, and c is an incoming address memory. The A mobile phone address memory is a RAM, SRAM, CAM, or the like that records a lower address as data at the upper address position, and the memory that records one flow address b, c is a hierarchical address to which the ring belongs. A drop address memory such as RAM, SRAM, CAM, or a drop address table. The transmitting station 701 and the receiving station 702 are given intermediate layer addresses via the conversion circuit up to the lowest layer address.

  The mobile phone address memory a placed in the node of the originating wireless edge node ring 703 is a memory in which a mobile phone number is registered. When the mobile phone terminal k (719) is called, the mobile phone terminal 719 The base stations 715 to 718 that emit the radio wave including the terminal number and receive the radio wave for the first time from the calling mobile terminal 719 send the call registration packet including the mobile phone number of the calling mobile terminal 719 to the mobile registration ring 705 to which the node belongs. The mobile phone number is recorded in the mobile phone address memory a of the node, and the node number is written in the registration packet and circulated on the mobile registration ring 705. The mobile phone number is stored in the mobile phone address memory of the node. If the node number is greater than the node number of the packet, the mobile number record On the other hand, when the mobile number is recorded and the node number is smaller than the node number of the packet, the fact is recorded in the packet and the node recorded in the packet Returning to the original node of the number, the record of the mobile number recorded in the mobile phone address memory a of the node is deleted, and the recording is performed even if a certain time has elapsed since the mobile phone number was written in the mobile phone address memory a. Is left, it is determined that the node has accepted the call, a unique flow address is given to the mobile number in the wireless edge node ring, and the one flow address is assigned to the transmission ring 706 of the node. Is recorded in the incoming address memory b of the incoming ring 707 and the incoming address memory c of the incoming ring 707. Send a packet having the base station's layer address, the one flow address, the calling mobile number, the home memory, the partner mobile number, the home memory, the destination IP address, or the other party's fixed telephone number. Perform call processing. The receiving station inquires of the other party's home memory, obtains the position of the receiving side station to which the other party's mobile terminal belongs, and requests the other party to call the other party.

  In the incoming call processing, the incoming address memory c placed in the node of the incoming side radio edge node ring 704 is a memory in which the incoming 1 flow address is registered, and the incoming side station 702 receives the incoming mobile terminal 720 when receiving an incoming call. Calls the receiving terminal mobile number including one unique flow address in the wireless edge node ring from all the base stations on the wireless edge node ring that are assumed to be present at the same time, and the response radio wave including one flow address from the receiving terminal The received base stations 711 to 714 raise an incoming response registration packet including one flow address of the incoming call response terminal to the incoming ring 707 to which the node belongs, and record the one flow address in the incoming address memory c of the node. At the same time, the node number is written in the incoming registration packet and the incoming ring If the one flow address is not recorded in the incoming address memory c on the ring, the action of prohibiting the recording of the one flow address is performed. If the number is larger than the node number of the packet, the record is erased and the writing of the one flow address is prohibited. On the other hand, if it is recorded, the node number is the packet number. If the node number is smaller than the node number of the node, the fact is recorded in the packet, the original node of the node number recorded in the packet is returned, and the one flow address recorded in the incoming address memory c of the node is recorded. And the incoming address memory c is configured to take measures to prohibit writing of the one flow address. If a record remains even after a certain time has elapsed since the writing of one flow address, it is determined that the node has received an incoming response, and the base station of the node sends the base station to the receiving station 702. A packet having the address of the station in the hierarchy, one flow address, a mobile phone number and a mobile phone number is sent out, and an incoming call response process is performed.

  If the wireless area changes midway, the transmission address memory b placed in the node of the wireless edge node ring is a memory in which one flow address of the mobile number is registered, and the reception area of the mobile terminal is When it is determined that the mobile terminal has changed, the mobile terminal emits a radio wave with a caller number that is one higher than the caller ID that was sent up to that point. The base station that is not connected to the mobile terminal raises the mobile registration packet including the 1 flow address and the transmission number of the mobile terminal to the transmission ring 706 to which the node belongs, and stores the 1 flow address in the transmission address memory b of the node. , And the node number is written in the movement registration packet and circulates on the transmission ring 706. When one flow address is recorded in the transmission address memory b of the node and the recorded transmission number is smaller than the transmission number of the packet, the transmission address memory b and the incoming address memory c of the node If the transmission number is the same and the node number is larger than the node number of the packet, the transmission number and the 1 flow address in the transmission address memory b of the node are deleted. On the other hand, if one flow address is recorded and the caller number is the same as that of the packet and the node number is smaller than the node number of the packet, this is indicated. Record the packet, return to the original node of the node number recorded in the packet, and send If the record remains even after a certain time has elapsed since the writing of the one flow address to the transmission address memory b, the node And the one flow address is recorded in the destination address memory c of the incoming ring 707, and the base station of the node notifies the originating station 701 or the incoming station 702 of that fact. Transmits a packet having the base station's hierarchical address, one flow address, its mobile number, its home memory, its partner's mobile number, its home memory, its destination IP address, or its partner's fixed telephone number, and performs a movement acceptance process .

  When the calling mobile terminal and the called mobile terminal are connected within the own radio edge node ring, the transmission address memory b on the transmission ring 706 is used.

  Next, a configuration example of the cell header transferred in the third to eleventh embodiments is shown in FIGS. In FIG. 16 and FIG. 17, the allocation of the address bits for the long-distance network is different.

  In FIG. 16, 500 is a double cell header configuration example, 501 is a forward cell header, 502 is a backward cell header, 503 is an 8-bit CRC bit, 504 is an IP packet, 505 is 8 bits for domestic selection / international connection, 506 is 20 bits for the domestic / destination foreign country destination toll network, 507 is 4 bits for control, 508 is 16 bits for the destination city, and 509 is 4 bits of source identification in the destination edge node ring (encryption A) + encryption 8 bits (encryption B), 510 is 4 bits for control. In this example, there is no source address, the source identification bit for identifying the terminal using the destination server is as few as 4 bits, the number of connected terminals is limited to 16, and it is too few depending on the server, so it is expanded. An example of this is shown in FIG.

  In FIG. 17, 500 is a double cell header configuration example, 501 is a forward cell header, 502 is a backward cell header, 503 is an 8-bit CRC bit, 504 is an IP packet, 520 is domestic selection / international connection 8 bits, 521 is 16 bits for local / destination foreign country destination toll network, 522 is 8 bits for control, 523 is 16 bits for destination city, 524 is 8 bits of source identification in destination edge node ring (encryption A) + encryption 8 bits (encryption B). In this example, the terminal identification bit in the server is 8 bits, and 256 terminals can be accommodated.

  Next, FIG. 18 shows an example of a three-layer MAC processing type header configuration example 550 in which the addresses for international connection used in Example 9 and Examples 12, 13, 14, and 15 are expanded. 551 is the first MAC header, 552 is the second MAC header, 553 is the third MAC header, 554 is the IP packet, 555 is 28 bits for synchronization, 556 is 12 bits for control, 557 is 12 bits in packet length 558 is a 12 bit for domestic selection / international connection destination, 559 is a 12 bit for domestic selection / international connection transmission source, 560 is a bit for CRC, 561 is for the local network of the local destination / destination foreign destination 28 Bit, 562 is 16 bits for destination local network, 563 is 16 bits for source local network, 564 is 16 bits for spare / control, 565 is 12 bits for CRC, 566 is existing MAC / new MAC 96 bits for (fixed phone number, mobile phone number). This example is an example having a source address and a destination address other than the bits for the domestic toll network and synchronizing packets with the first bit.

As mentioned above, although the Example of this invention was described, this invention contains the appropriate deformation | transformation which does not impair the objective and advantage, Furthermore, the limitation by said embodiment is not received.

850 First layer consisting of a local network (mesh network) 851 Second layer consisting of an out-of-city network (mesh network) 852 Third layer consisting of an international network (mesh network) 856, 857, 858, 859 L2 of the first layer Switches 865, 861, 862, 860, 863, 864 Second level L2 switches 866, 867, 868 Third level L2 switches 857, 858, 859 , 864 A node in the outskirts of the city and a connection gateway node with the international network 860,861,862 A node with a MAC address of its own node in the own layer 866,867 International network with a connection node with the lower network A node having a local node MAC address in the international network with a lower level network and a connection node
854 Receiving terminal B
855 Packet sent by sending terminal A 890 Three-layer address of fixed telephone number used in this network 870 First layer consisting of local network (mesh network) 871 Second layer consisting of out-of-city network (mesh network) 872 International 3rd layer consisting of a network (mesh network) 876, 877, 878, 879 1st layer L2 switch 885, 881, 882, 880, 883, 884 2nd layer L2 switch 886, 887, 888 3rd layer L2 Switch 877, 878, 879 A node at the regional level, a connection node with the upper network 883, 884 A node at the central level, a connection node with the international network 880, 881, 882 Node that has the MAC address of its own node in its own layer at the connecting node 886,887 Node with local node MAC address of the inner 873 transmitting terminal A
874 Receiving terminal B
875 Packets sent out by sending terminal A 1 First layer composed of local network (edge node ring) 2 3 Second layer composed of out-of-city network (tree-shaped network) 4 5 Second layer composed of international network (tree-shaped network) 6 3rd layer 7 Edge node double ring 8 2nd layer double ring 9 3rd layer double ring 10 Fixed telephone number address 11 Calling terminal A
12 Terminal B
50 Drop address memory having the self-address (a, b, c, d) of the node connected to the edge node ring of the lowest ring in the second hierarchy 51 The node of the node connected to the upper ring in the lowest ring of the second hierarchy Drop address memory 52 The top level ring of the second hierarchy is a drop address memory of a node connected to the third hierarchy ring 53 The drop address memory of a node where the top level ring of the second hierarchy is connected to a lower ring 54 The top of the third hierarchy Drop address memory 55 having a self-confidence address (e, f, g, h) of a node connected to the second hierarchy ring of the lower ring 57 Drop address memory of a node connected to the lower ring of the uppermost ring of the third hierarchy 57 Drop address memory of a node in which the lowest ring in the three layers is connected to the upper ring 60 Terminal A (11 VPI and VCI but is the destination address of the cell to be sent
61 Example of a cell transmitted from the terminal A passing through the edge node ring 62 Example of a cell transmitted from the terminal A passing through the lowest layer ring of the second layer 63 A cell from the terminal A is the highest layer of the second layer Examples of passing through the ring 64, 65 Example of a cell from the terminal A circulating around the lowest ring in the third layer 66 Example of a cell from the terminal A circulating with the multi-round bit (mr) added 67 Terminal A The drop address memory of the node connected to the upper ring in which the destination address h of the cell to which the multi-round bit is attached from 68 is dropped 68 The cell from the terminal A drops the uppermost ring of the third hierarchy 69 Terminal A Example: Cell from cell drops the third lowest layer ring and connects to second layer 70 Cell from terminal A drops second layer highest layer ring in destination country 71 Example of cell from terminal A dropping the lowest layer of the second hierarchy of destination country and connecting to destination edge node ring 72 Cell from terminal A drops edge node ring of destination country and destination terminal B 73 Drop address memory in which the address B of the destination terminal B is written 80 Drop address of the node that goes up to the upper ring of each ring of the second hierarchy excluding the uppermost ring of the second hierarchy set in advance Example in which a destination address is set in the memory 81 A destination address is set in the drop address memory of a node that goes up to the upper ring of each ring in the third hierarchy, excluding the uppermost ring in the third hierarchy set in advance. Example 82 VPI and VCI, which are destination addresses of cells sent from terminal A (11)
83 Example of a cell transmitted from terminal A passing through the edge node ring 84 Example of a cell transmitted from terminal A passing through the lowest ring in the second layer 85 A cell transmitted from terminal A is the highest in the second layer Example of passing through upper ring 86 Example of cell from terminal A circulating around lowest ring of third layer 87 Example of cell from terminal A reaching uppermost ring of third layer 88 Cell from terminal A Example of dropping the highest ring in the third hierarchy 89 Cell from terminal A drops the lowest ring in the third hierarchy and connects to the second hierarchy 90 The cell from terminal A is the destination country Example of dropping the highest ring in the second hierarchy 91 Example in which the cell from the terminal A drops the lowest ring in the second hierarchy in the destination country and connects to the destination edge node ring 92 The cell from the terminal A is the destination Country Example of Dropping Node Node Ring and Connecting to Destination Terminal B 93 Drop address memory in which address B of destination terminal B is written 100 VPI and VCI which are destination addresses of cells sent out by terminal A (11)
101 Example in which cell transmitted from terminal A passes through edge node ring 102, 103 Example in which cell from terminal A circulates the lowest ring in the second layer 104 Cell from terminal A has multi-round bit (mr 105) Example of wrapping around cell 105 Drop address memory of node connected to higher ring in which destination address a of cell attached with multi-round bit from terminal A is written 106 Cell from terminal A is second layer Example 107 in which the cell from terminal A drops the lowest ring in the second hierarchy and connects to the destination edge node ring 108 The cell from terminal A drops the edge node ring, Example of connection to destination terminal B 109 Drop address memory in which address B of destination terminal B is written 110 Send out by terminal A (11) VPI and VCI is the destination address of that cell
111 Example in which cell transmitted from terminal A passes through edge node ring 112 Example in which cell from terminal A circulates lowest level ring in second layer 113 Cell from terminal A is highest level ring in second layer 114 A cell from terminal A drops the lowest ring in the second layer and connects to the destination edge node ring 115 A cell from terminal A drops the edge node ring and drops to destination terminal B Example of connection 116 Drop address memory in which address B of destination terminal B is written 21 Third-layer mesh-connected double ring 120, 121 At a connection node with the second layer of the third-layer mesh ring Drop address memory 122, 123 where the address of the node is set Drop address of the entrance of each ring of the mesh network Examples of address of the connection node between the second layer is set in the memory 140 international network (meshed network)
130 VPI and VCI which are destination addresses of cells sent out by terminal A (11)
131 Example in which cell transmitted from terminal A passes through edge node ring 132 Example in which lowest layer ring in second layer is passed through 133 Example in which uppermost ring in second layer is passed through 134 Cell from terminal A is third Example of circulating the lowest ring in the hierarchy 135 Example in which a cell from terminal A drops the lowest ring in the third hierarchy 136 Example in which a cell from terminal A drops the highest ring in the second hierarchy in the partner country 137 Example of cell from terminal A dropping the lowest ring in the second layer and connecting to destination edge node ring 138 Example of cell from terminal A dropping edge node ring and connecting to destination terminal B 900 Double ring 901, 902 connected to the second layer of the third layer loop-shaped skewer ring, the node connected to the second layer Drop address memory 903, 904 An example in which the address of the connection node with the second layer is set in the drop address memory at the entrance of the loop connection node of each ring of the loop skewered network 940 International network ( Looped skewer net)
910 VPI and VCI, which are destination addresses of cells sent out by terminal A (11)
911 Example of cell transmitted from terminal A passing through edge node ring 912 Example of passing through lowest layer ring of second layer 913 Example of passing through highest layer ring of second layer 914 Cell from terminal A is third Example of wrapping looped skewer ring of layer 915 Example of cell from terminal A dropping connection ring with layer 2 of second layer 916 Cell from terminal A is the highest layer in second layer of partner country Example of dropping a ring 917 Example of cell from terminal A dropping the lowest ring in the second layer and connecting to destination edge node ring 918 Cell from terminal A dropping edge node ring and destination terminal B 158 Example of connection to 158 Third-layer mesh-connected double ring 154, 155 A node connected to the second layer of the third-layer mesh-like ring. Drop address memory 156, 157 in which the address of the connection node with the mesh network ring of the second layer is set to the fixed telephone number in the country of the country The connection to the second layer is made to the drop address memory at the entrance of each ring of the mesh network Example in which extended address of node is set 153 Drop address memory 151, 152 at the entrance of each mesh transmission path in the mesh-like ring placed at the top of the second layer Cell 153 Mesh-like ring 175 Node directly connected to the third layer ring 160 International network (mesh-like network)
161 Outer city network (a network in which a mesh network is connected to a tree network)
162 VPI and VCI which are source addresses of calling cells sent from terminal A (11)
163 Example in which cell transmitted from terminal A passes through edge node ring 164 Example in which cell transmitted from terminal A passes through lowest ring in second layer 165 Cell transmitted from terminal A is mesh in second layer Example of passing through directly to node 175 connected to the third layer ring without going through the network 166 Example of sending cell from terminal A to mesh transmission path of third layer from node 175 167 Example of cell transferring third layer mesh ring 168 Example of cell from terminal A dropping third layer mesh ring and connecting to second layer node 176 of partner country 169 From terminal A Example: Cell 2 drops the highest level ring in the second hierarchy of the destination country 170 A cell from terminal A drops the lowest level ring in the second hierarchy of the destination country and Example of connection to node ring 171 Example of cell from terminal A dropping edge node ring of destination country and connecting to destination terminal B 177 Example of internationally copied international connection address 180 Third layer address is fixed telephone An example in which an additional address β is added to the number 202 Rings at both ends in a third level skewered ring 201 Rings at a third level skewered ring that are not rings at both ends 190, 191 Drop address memory 192 to 196 in which the address of the own node is recorded at the connection node with the second layer The node of the node set with the address of the connection node with the second layer of the skewered ring of the third layer is dropped by the one-path setting cell Address memory 200 International network (skewer network)
210 VPI and VCI which are destination addresses of cells sent out by terminal A (11)
211 Example of cell transmitted from terminal A passing through edge node ring 222 Example of passing through lowest level ring of second layer 223 Example of passing through highest level ring of second layer 224 Cell from terminal A is third Example of transferring a layered skewered ring 225 Example of cell from terminal A dropping third layered skewered ring and connecting to second layer of partner country 226 Cell from terminal A Example of dropping the highest ring of two layers 227 Example of cell from terminal A dropping the lowest ring of second layer and connecting to destination edge node ring 228 Cell from terminal A dropping edge node ring Example of connection to destination terminal B 256 Planar mesh ring in which one ring in the third layer is connected to four other rings 250 Node connected to the second layer Drop address memory 253, 255 Drop address memory 251 Drop address memory 252 and 254 drop address memory 260 of the node connected to the second layer 260 VPI and VCI which are destination addresses of cells sent out by the terminal A (11)
261 Example of cell transmitted from terminal A passing through edge node ring 262 Example of passing through lowest level ring of second layer 263 Example of passing through highest level ring of second layer 264, 265 Cell from terminal A is Example of transferring third layer planar mesh ring 266 Example of cell from terminal A dropping third layer planar mesh ring and connecting to second layer of partner country 267 Cell from terminal A Example of dropping the highest layer of the second hierarchy in the partner country 268 Example of cell from terminal A dropping the lowest ring of the second hierarchy and connecting to the destination edge node ring 269 Cell from terminal A is edge Example of dropping node ring and connecting to destination terminal B 400 MAC address division transfer network 404 MAC address header conversion circuit 401 Existing IP terminal
408, 409, 410 Lowest layer address 402 Existing IP server F
403 Existing IP server G
700 Third-layer and second-layer MAC address division transfer network 701 Radio originating station 702 Radio terminating station 703 First hierarchy originating radio edge node ring 704 First hierarchy terminating radio edge node ring 705 Mobile number registration ring 706 Transmission ring 707 Incoming ring 708 Wireless edge node ring 703, 704 Node connected to upper network 709 Transmission path connected to upper network 710 Incoming ring 707 connected to upper network Route 711 to 718 Wireless base station 719 mobile terminal K
720 mobile terminal L
500 Double cell header configuration example 501 Front cell header 502 Back cell header 503 8 bits CRC bit 504 IP packet 505 8 bits for domestic selection / international connection 506 20 bits for local destination / destination foreign destination destination toll network 507 4 bits for control 508 16 bits for destination city 509 4 bits for source identification (encryption A) + 8 bits for encryption (encryption B) at destination edge node ring
510 4 bits for control 520 8 bits for domestic selection / international connection 521 16 bits for local destination / destination foreign destination destination toll network 522 8 bits for control 523 16 bits for destination city 524 Transmission on destination edge node ring Original identification 8 bits (encryption A) + encryption 8 bits (encryption B)
550 Three-layer MAC processing header configuration example in which an address for international connection is expanded 551 First MAC header 552 Second MAC header 553 Third MAC header 554 IP packet 555 28 bits for synchronization, etc. 556 12 bits for control 557 packets Long 12 bits 558 12 bits for domestic selection / international connection destination 559 12 bits for domestic selection / international connection transmission source 560 bits for CRC 561 28 bits for own country destination / destination foreign country destination toll network 562 16 for destination city network Bit 563 16 bits for local network 564 16 bits for spare / control 565 12 bits for CRC 566 96 bits for existing MAC / new MAC (fixed phone number, mobile phone number) 800 Matrix address 801 MAC address data area MA ( 48 bits)
802 Index area IA
820 Matrix address 821 MAC address data area MA (48 bits)
822 Index Area IA
900 Reception MAC address 901 Hash function such as CRC 902 Address specification bit (10 bits) of entry table 903 which is a hash value
903 Entry table 904 Registered MAC address 905, 906, 907, 908 Comparator 909 MAC address for comparison 910 OR circuit 911 Match detection signal 305, 306 Node device 300, 301 Source address of packet input to each port and its input port MAC address table 302 clockwise ring transmission path 303 counterclockwise ring transmission path 304 input packet header reading circuit 307, 308 ADD transmission path port 309, 310 ring transmission path port 321 0 system ring transmission path 320 1 system Ring transmission line 322 Node A
323 Node B
324 Node C
325 Node D
330 Terminal H
331 Terminal F
332 Terminal G
609 Current drop address table 610 Spare drop address table 600 0-system ring transmission line 601 1-system ring transmission line 602 ADD transmission line 603 DROP transmission line 604 MACBA (B is a destination MAC address, A is a source MAC address)
605 MACAB
606 header transmission circuit for 0 system transmission line packet (with BUF)
607 Packet header reading circuit (with BUF) for 1-system transmission line
608 Packet distribution circuit (with BUF)

Claims (41)

In networks that transfer cells or packets or packets with cell headers,
The network is a network with a concentration point in the hierarchy or a concentration point in the hierarchy, and a cell or packet toward the destination or a packet with a cell header is
In the upstream direction, in the layer below the layer where the destination downlink path of the cell or packet or packet with cell header is in the layer,
There is no split destination address that can only be used effectively in that hierarchy, and there is no source address that can be used only in that hierarchy, or there is no destination address that can be used only in that hierarchy, and it can be used only in that hierarchy. Have a valid source address, or have a valid source address that can only be used at that level, but do not use it, and pass through with a through bit. Pass through
On the other hand, in the parallel direction in the top level and in the parallel direction in the downward direction and in the middle of the downward direction, the points in the level or the points in the level to be dispersed from the points in the level. Transferred by a drop address memory or a drop address table of a network having only destination division addresses for each of multiple hierarchies to be distributed from a point,
A network for transferring cells or packets or packets with cell headers characterized by
The net according to claim 1, wherein
A network with a central point is a ring having a plurality of nodes, a plurality of ring networks having a plurality of nodes, a mesh network in which a plurality of nodes are connected in a mesh form, or a network having a plurality of nodes connected by a mesh transmission line or a ring having a plurality of nodes. A composite network with a structure in which a net connected in a skewered manner or a ring network with multiple nodes connected in a skewered manner with a net connected to the start point and end point ring as one floor and the multiple levels connected in a tree shape ,
A network for transferring cells or packets or packets with cell headers characterized by
The net according to claim 2, wherein
Each layer of the hierarchical structure has an independent divided address and an independent divided address for each region in each layer, and a cell, packet, or packet with a cell header in each region of each layer with that divided address Forwarding,
A network for transferring cells or packets or packets with cell headers characterized by
The net according to claim 3,
The division address used in each area of each hierarchy is the address of a specific node in each area of that hierarchy, excluding the lowest hierarchy,
A network for transferring cells or packets or packets with cell headers characterized by
The network according to claim 2, 3 or 4,
The structure of a network composed of multiple ring networks is
A multistage ring tree network in which cells or packets or ring networks that transfer packets with cell headers are connected in a tree structure, or
A ring network that transfers cells, packets, or packets with cell headers is connected in a tree structure under each ring of the mesh network ring network that connects cells, packets, or packets with cell headers in a mesh form. A complex ring network connecting the top rings of a multi-stage ring tree network, or
A multi-stage ring tree network in which a ring network that transfers cells, packets, or packets with cell headers is connected in a tree structure under a ring network in which many ring networks that transfer cells, packets, or packets with cell headers are connected in a skewered manner Complex ring network with top ring connected, or
A cell, packet, or packet with cell header is forwarded under each ring in the mesh ring network that has been set up in advance by a fixed path consisting of a large number of ring networks that transfer cells, packets, or packets with cell headers in a plane. A multi-stage ring tree network connected to the top ring of a multi-ring ring tree network, or
A cell, packet, or cell header is attached under a loop-shaped skewered ring network that connects a starting ring network and a terminating ring network that connects many ring networks that transfer cells, packets, or packets with cell headers in a skewered manner. A composite ring network in which ring networks that transfer packets are connected in a tree shape, and a top-level ring of a multi-stage ring tree network is connected, or
A mesh network ring, a network or a mesh network that connects a plurality of ring networks that transfer cells or packets or packets with cell headers.
A multistage ring tree network in which cells or packets or ring networks that transfer packets with cell headers are connected in a tree structure, or
A ring-shaped skewered ring network in which a starting ring network and a terminating ring network in which a ring network in which cells, packets, or packets with cell headers are transferred in a skewered connection are connected, or a packet with a cell, packet, or cell header A mesh-shaped ring network that has been set up in advance with a fixed path in which many ring networks that transfer
A ring network in which many ring networks that transfer cells or packets or packets with cell headers are connected in a skewered manner,
Under one of the nets,
A mesh network ring network in which a plurality of ring networks that transfer cells or packets or packets with cell headers are connected in mesh, or
A ring-shaped skewered ring network in which a starting ring network and a terminating ring network in which a ring network in which a cell or a packet or a packet having a cell header is transferred in a skewered connection is connected, or
A meshed ring network in which a fixed path in which a large number of ring networks that transfer cells, packets, or packets with cell headers are connected in a plane is connected in advance, or
A ring network in which many ring networks that transfer cells or packets or packets with cell headers are connected in a skewered manner,
Put one of the nets,
A configuration in which cells or packets with cell headers or packets with a cell header rising from below are directly connected to a ring of the lower network from the ring without passing through another ring of the lower network. Under each ring of the lower network, a single ring or a ring network for transferring cells or packets or packets with cell headers connected in a tree shape is connected to the top ring of a multi-stage ring tree network. Being a composite network of components,
A network for transferring cells or packets or packets with cell headers characterized by
The net according to claim 5,
When this network is configured to accommodate existing Internet terminals and servers, the existing IP terminals or existing IP servers are connected to other existing IP terminals or existing IP servers in the conventional manner using their existing IP addresses. Being able to maintain a relationship,
A network for transferring cells or packets or packets with cell headers characterized by
The network according to claim 2, 3 or 4,
When the network of the network configuration used in this network is a one-layered network of a network having a plurality of layers and nodes are connected in a mesh shape, the route setting is manually set in advance,
If the network is the lowest network in the hierarchy to which the network belongs, route setting cells or route setting packets having addresses of nodes connected to the lower network are sent to all nodes in the regional network or in the hierarchy. When distributing to all nodes by flooding and registering the address in the memory at the entry port of the flooded node, the address is not recorded in the memory of the other port of the node or the memory of its own port Only to record,
Or, if the address is not recorded in the drop address memory or drop address table corresponding to the node that records the input port number and address of the flooding destination, the input port number and the address are recorded and flooding is performed together with the address. Continuing, if already recorded, the cell or packet is discarded,
In addition, the flooding of the central node of the network is configured such that the cell or packet is discarded after the address of the route setting cell or route setting packet is recorded in the drop address memory or drop address table of the entry node of the upper network. ,
On the other hand, if the network is not the lowest network in the hierarchy to which the network belongs,
A routing cell or routing packet having the address recorded in the drop address memory or drop address table of the node connected to the lower level network is flooded to all nodes in the regional network or all nodes in the hierarchy, and flooded. When the address is registered in the memory at the entrance port of the previous node, the address is recorded only when the address is not recorded in the memory of the other port of the node or the memory of the own port, or
Or, if the address is not recorded in the drop address memory or drop address table corresponding to the node that records the input port number and address of the flooding destination, the input port number and the address are recorded and flooding is performed together with the address. Continuing, if already recorded, the cell or packet is discarded,
In addition, flooding of the node of the network is performed only when the network is not the highest network in the hierarchy to which the network belongs, and the method sets the route in the drop address memory or the drop address table of the entry node of the higher network. After recording the address of a cell or routing packet, the cell or packet must be discarded.
A network for transferring cells or packets or packets with cell headers characterized by
The net according to claim 7,
The route setting packet of the lowest hierarchy is an ARP packet, and the node to which the terminal of the lowest hierarchy is connected causes the received ARP packet to be used as a route setting packet, floods the inside of the hierarchy, and starts from the center node of the hierarchy. In the flooding to the upper network, the ARP packet is not discarded after the address is written to the drop address memory at the upper network entrance, but the ARP packet is continuously flooded with the ARP packet in the upper network layer, and the uppermost layer without the collecting node is flooded. When it arrives, the address is written in the drop address memory of the entry node of the floor, and then the packet is discarded.
After sending the ARP packet, the terminal sends the communication start packet even if it does not receive the ARP response packet. If there is no destination on the floor, the terminal forwards the packet to the center node of the floor, If the node goes up to the upper level and there is no destination on that level, the packet is forwarded through to the center node of that level, and then it goes up to the upper level at that node, and drops at the level with the destination address. A network for transferring a cell or a packet or a packet with a cell header, characterized by connecting to a destination terminal.
The net according to claim 8,
In the downstream direction, the MAC packet should not leave a source address,
A network for transferring cells or packets or packets with cell headers characterized by
The net according to any one of claims 1 to 6,
The node obtains the transmission line rate from the total value obtained by reading the upper bits of the bit string describing the number of cells per unit time flowing through the forward transmission path or the packet length of the packet within the unit time, judges the congestion prediction, and determines the cell header. Or display the congestion bit in the packet header,
A network for transferring cells or packets or packets with cell headers characterized by
The network according to claim 7 or 8,
The node obtains the transmission line rate from the total value obtained by reading the high-order bits of the bit string describing the packet length of the packet in the unit time flowing through the forward transmission line, determines the congestion prediction, and displays the congestion bit in the packet header. ,
A network for transferring cells or packets or packets with cell headers characterized by
The net according to claim 5, 6 to 10,
A cell or packet or packet with a cell header that ADDs to a node in the ring of this network writes its node number into the cell or packet or packet with a cell header and goes up to the ring, and if it reaches a node with the same number as that node number Granting multi-round bits,
A network for transferring cells or packets or packets with cell headers characterized by
A network according to claims 1 to 7,
In the drop address memory, when the initial memory data is all 1 and normal data 1 is recorded at the recording address position, the data to be recorded is 0.
A network for transferring cells or packets or packets with cell headers characterized by
The net according to claim 1 to 7 or 13,
The record of specific data corresponding to the address required for the drop address memory of each node belonging to this network or the address that needs to be recorded in the drop address memory is set in advance for all nodes,
A network for transferring cells or packets or packets with cell headers characterized by
The net according to claim 1 to 6, 10 or 12,
The record of the specific data indicating that the address is recorded at the address of the drop address memory of each node of all the rings or the address that needs to be recorded in the drop address memory has the address of the node at the entrance of each hierarchical network Must be set by a single path setting cell or single path setting packet.
A network for transferring cells or packets or packets with cell headers characterized by
The net of claim 15,
If the network of the target layer to be set for a single path is a tree-like ring network, the address of the node connected to the network or terminal below the lowest ring in the layer is left in the drop address memory of that node, and the node A single route setup cell or single route setup packet with the address of 1 to the drop address memory at the entrance of the highest ring of the hierarchy once or periodically, the intermediate ring only writes its address to the drop address memory of the entrance, A node that passes through the ring and goes up to the upper ring, goes up to the upper ring, writes the address to the drop address memory of the highest ring, and then discards the cell or packet.
A network for transferring cells or packets or packets with cell headers characterized by
The net of claim 15,
If the network of the target layer for which one path is set is a mesh ring network, the address of the node connected to the network or terminal under each ring of the network is left in the drop address memory of the node, and the node A single-routed cell or single-routed packet with the following address is converted to a copyable cell or packet, and the ring is circulated once or periodically and copied at a node connected to the mesh transmission path on the ring. When sending to the mesh transmission line and reaching the drop address memory at the entrance of the mesh network ring to which the transmission line is connected, the address of the cell or packet is written to the memory, and then the one-path setting is made A cell or single path setup packet is discarded, and a copyable single path setup cell or single path around the original ring It constant packet, when it returns to the node which has the address held by the cell or packet in the drop address memory, the strip path set up cell or one route setting packet is configured to discard,
A network for transferring cells or packets or packets with cell headers characterized by
The net of claim 15,
If the network of the target layer to be set as a single path is a skewered network, the address of the node connected to the network or terminal under each ring of the network is left in the drop address memory of the node, and the address of the node Make a single-routed cell or single-routed packet with a copyable cell or copyable packet, circulate around that ring once or periodically, copy it at the node connected to the adjacent ring on that ring, and One-path setting cell or one-path setting cell returned to the node having the address of the cell or packet in the source drop address memory in the configuration to be sent to the ring and discarded to the adjacent ring. Or a single route setup packet is stored in the drop address memory at the entrance of the ring. After writing one address, circulate the ring, drop it at the node connected to the adjacent node, repeat the operation to move to the adjacent ring, there is no adjacent ring at the end ring of the skewered ring network, and the drop address memory When returning to the node where the address of the cell or packet is, discard the one-path setting cell or one-path setting packet,
A network for transferring cells or packets or packets with cell headers characterized by
The net of claim 15,
If the network of the target layer to be set for one-path is a skewered ring network with a loop configuration in which a starting ring network and a terminating ring network in which a ring network is connected in a skewered manner, are connected,
The address of the node connected to the network or terminal under each ring of the network is left in the drop address memory of the node, and the single path setting cell or single path setting packet having the address of the node is once or periodically, A node that circulates around the ring and connects to an adjacent ring on the ring drops into the adjacent ring, and a single route setup cell or single route setup packet that goes up to the adjacent ring is stored in the drop address memory at the ring entrance. Write the address and mark of the cell or packet, make them temporary, wrap around the ring, and if there is a node with the address of the cell or packet in the drop address memory on the ring, set the ring If you return to the node where the address is temporarily set after one round, The set address and mark are deleted, and the cell or packet is discarded. On the other hand, when there is no node having the address of the cell or packet in the drop address memory on the ring, the ring is made one round. If the address is temporarily returned to the node where the address is temporarily set, the temporarily set address is set to the main setting, the multi-round bit is added, the ring is circulated, and the one-path setting cell or the multi-round bit is set. The route setting packet is dropped at the node connected to the adjacent node, moved to the adjacent ring, the address and the mark are temporarily set in the drop address memory at the entrance of the adjacent ring, and the same operation as above is repeated, so that one route How to set,
Or
The address of the node connected to the network or terminal under each ring of the network is left in the drop address memory of the node, and the single path setting cell or single path setting packet having the address of the node is once or periodically, Rotate to that ring, leave a record that prohibits writing the address of the cell or packet to the node connected to the adjacent ring on that ring, circulate to the original node, and attach the multi-round bit at the original node A single-path setting cell or single-path setting packet with a multi-round bit is dropped at a node connected to an adjacent ring, and a single-path setting cell or single-path setting with a multi-round bit is raised to that adjacent ring. The packet writes the address of the cell or packet to the drop address memory at the entrance of the ring. In the same way, go to the node of the ring where the prohibition of the address is set in the drop address memory at the entrance of the disjunction node, and at the node of the ring where the prohibition of the address is set, Use a method of setting a single path by discarding a single path setting cell with a bit or a single path setting packet,
A network for transferring cells or packets or packets with cell headers characterized by
The net of claim 15,
If this network is a network that is forwarded with a fixed telephone number address, and the network of the target layer for which a single path is set is a network that connects a mesh ring network on a mesh ring network, the mesh of the lower network If the connection node to the upper network of each ring in the ring network is an international network, create an international connection number address by adding the node number address to the international telephone number address of the home country, and enter the address The single-path setting cell or single-path setting packet that is held once or periodically is sent to the upper network from the connection node with the upper network to one mesh ring of the upper network, and the address is stored in the drop address memory at the upper network entrance. And at that node, the cell or packet is converted to a copyable cell or copyable packet, wraps around the ring, and all meshes Copy at the node connected to the transmission path, send it to the mesh transmission path, write the address to the drop address memory at the entrance of the mesh ring at the connection destination, and then discard the one-path setting cell or one-path setting packet In this configuration, the copyable one-path setting cell or one-path setting packet that has circulated around the source ring is discarded when it returns to the connection node with the lower network of the ring.
A cell or packet or a packet with a cell header that is called from this network to a foreign country is a connection node with a higher-level network, and has a source address with its node number address added to its own country address, and an international telephone number of the other country. Convert and copy to multiple calling cells or calling packets or packets with calling cell headers with international connection number addresses that have all the additional addresses that may be used in that country, and copy them to the upper network The destination terminal creates a response cell, response packet, or packet with a response cell header from the source address and destination address of the call cell or call packet that arrives at the destination terminal in the partner country, and sends it to the source. To do,
A network for transferring cells or packets or packets with cell headers characterized by
The net according to claim 5, 6, 10, 15 to 20,
A cell or packet to be ADDed on the ring or a packet with a cell header goes up to the ring transmission path indicated by the bit at the specific position of the destination address or the source address;
A network for transferring cells or packets or packets with cell headers characterized by
The net according to claim 21,
When the ring transmission path selected by the cell or packet or cell header-attached packet from the originating side to the incoming side that adds to the ring is the transmission path indicated by the bit at the specific position of the destination address (source address), the incoming side The ring transmission path selected by the packet from the source to the transmission side is a transmission path indicated by the bit at the specific position of the source address (destination address);
A network for transferring cells or packets or packets with cell headers characterized by
21. A net according to claim 12-20.
A cell or packet to be ADDed on the ring or a packet with a cell header goes up to the ring transmission path indicated by the ring transmission path identification bit of the cell or packet or packet with a cell header;
A network for transferring cells or packets or packets with cell headers characterized by
24. The net of claim 23.
The ring transmission path selected by the cell or packet or cell header packet with the cell header from the incoming side to the outgoing side that is ADDed to the ring is the cell or packet or cell header packet from the outgoing side to the destination side of the cell or packet or packet with cell header. A ring transmission path indicated by a ring transmission path identification bit having a ring transmission path identification bit opposite to the ring transmission path identification bit possessed,
A network for transferring cells or packets or packets with cell headers characterized by
25. A net as claimed in claim 21, 22, 23 or 24.
Calling cells or packets or packets with cell headers that are ADDed to the edge node ring in the lowest layer of this network have the call processing circuit of that ring check the congestion state of the transmission path between the call processing circuits of the partner edge node ring. If the congestion of the through transmission path is predicted, discard it as a call loss,
A network for transferring cells or packets or packets with cell headers characterized by
A network according to claims 1 to 6, 10, 12, 15 to 25,
The MAC of the transferred packet is MAC in MAC or MAC in MAC in MAC, and the cell header of the transferred cell or packet with cell header is a double cell header or a double cell header obtained by extending the bit length of the cell header.
A network for transferring cells or packets or packets with cell headers characterized by
The net of claim 26.
The address of MAC in MAC or MAC in MAC in MAC or the address of a double cell header or a double cell header obtained by extending the bit length of a cell header is a 4-bit 2 from 0 to 9 in decimal notation of each digit of an existing fixed telephone number. A fixed-line binary bit string replaced with a hexadecimal number,
A network for transferring cells or packets or packets with cell headers characterized by
The net of claim 27.
MAC in MAC or MAC in MAC in MAC address of one MAC or double cell header or the cell header of one cell header of the double cell header with the bit length of the cell header extended, the 16 bits of the specific position of each existing fixed telephone number The lower 16 bits of a fixed-line binary bit string in which 0 to 9 in decimal representation of digits are replaced with a 4-bit binary number;
A network for transferring cells or packets or packets with cell headers characterized by
The net of claim 27.
MAC in MAC or MAC in MAC in MAC or double cell header or double cell header with extended bit length of cell header, decimal address of fixed phone number in lower edge node ring that is 16 bits of address of specific position at lower edge node ring at the bottom hierarchy Use as one flow address corresponding to 4 digits, use 20 bits of address at a specific position as a path address which is a bit string corresponding to 5 digits from the lower 5th to the 9th decimal display of the fixed telephone number which is the middle layer, Furthermore, the remaining address bit string is used as a foreign connection bit string 8 bits corresponding to a fixed telephone number,
A network for transferring cells or packets or packets with cell headers characterized by
30. The net of claim 29.
Attaching an additional bit string to the 8 bit foreign connection bit string corresponding to the fixed telephone number and using it as a foreign connection bit string,
A network for transferring cells or packets or packets with cell headers characterized by
30. The net of claim 29.
When connecting to a foreign country, use the foreign intermediate layer bit string, and set the through bit for the intermediate layer in your country.
A network for transferring cells or packets or packets with cell headers characterized by
A net according to claim 27, 28 or 29,
MAC in MAC packet or MAC in MAC in MAC packet inside MAC packet or double cell header or MAC header placed after double cell header with extended bit length of cell header is used for fixed telephone number transfer, distinguishing from conventional MAC use Is determined by 0 and 1 of the seventh bit of the MAC header,
A network for transferring cells or packets or packets with cell headers characterized by
The net of claim 32,
Send a mobile phone number from a personal computer in the home instead of a fixed phone number, and use a free bit in the MAC header to distinguish between a fixed phone and a mobile phone.
A network for transferring cells or packets or packets with cell headers characterized by
The net of claim 32,
A network for transferring a cell or a packet or a packet with a cell header, wherein a mobile phone number is inserted instead of a fixed phone number, and the fixed phone and the mobile phone are distinguished by an empty bit of the MAC header.
A network according to claims 1 to 7, 10, 12 to 34,
Within the wireless edge node ring placed below or in place of the lowest layer of this network, it is transferred with one flow address for wireless, and one flow address that is unique in that ring of wireless to the mobile terminal Is assigned by the base station placed at the node of the wireless edge node ring for the call registration mobile terminal when the mobile terminal is called, and the receiving side receives the appropriate wireless edge node ring including the other party mobile number. The base station calls a packet having a unique one flow address to the receiving terminal side with a copy packet, and connects to the calling side with a response packet using the one flow address.
A network for transferring cells or packets or packets with cell headers characterized by
36. The net of claim 35.
The mobile phone address memory placed in the node of the wireless edge node ring is a memory in which a mobile phone number is registered. When a mobile terminal makes a call, the mobile phone device emits a radio wave including the mobile phone terminal number, The base station receiving the radio wave for the first time from the terminal raises the call registration packet including the mobile number of the mobile terminal to the mobile registration ring to which the node belongs, and records the mobile number in the mobile address memory of the node In addition, when the node number is written in the registration packet and circulated on the ring for mobile registration, and the mobile number is recorded in the mobile phone address memory of the node, the node number is the node of the packet If it is greater than the number, delete the cell phone number record,
On the other hand, when the mobile number is recorded and the node number is smaller than the node number of the packet, that fact is recorded in the packet and the node number recorded in the packet is recorded. Returning to the original node, the record of the mobile number recorded in the mobile phone address memory of that node is erased, and the record remains even after a certain time has elapsed since the mobile phone number was written into the mobile phone address memory In that case, the node judges that the call has been accepted, gives the mobile number a unique flow address in the wireless edge node ring, and uses the flow address as a transmission address memory in the transmission ring of the node and Record in the incoming ring address memory of the incoming ring, and the fact that the base station of the node is to the originating station Scan and its 1 sends out a packet having a flow address and calling mobile number and its home memory and opposite mobile number as its home memory or destination IP address or destination fixed telephone number, to perform a call process,
A network for transferring cells or packets or packets with cell headers characterized by
36. The net of claim 35.
The transmission address memory placed in the node of the wireless edge node ring is a memory in which one flow address of the mobile number is registered. When it is determined that the reception area of the mobile terminal has changed, the mobile terminal outputs up to that point. A base station that emits a radio wave with a caller number that is one higher than the caller's outgoing call number and receives a radio wave with a different caller number for the first time from a mobile terminal. The mobile registration packet including the one flow address and the calling number is raised to the transmission ring to which the node belongs, and the one flow address and the calling number are recorded in the transmission address memory of the node, and the node number is stored in the movement registration packet. Write, circulate on the transmit ring, and that one flow address is recorded in the transmit address memory of the node If the recorded outgoing number is smaller than the outgoing number of the packet, the outgoing number and one flow address record in the outgoing address memory and incoming address memory of the node are deleted and the outgoing number is the same. If the node number is larger than the node number of the packet, delete the transmission number and 1 flow address record in the transmission address memory of the node,
On the other hand, if one flow address is recorded and the caller number is the same as that of the packet and the node number is smaller than the node number of the packet, that fact is recorded in the packet. And return to the original node of the node number recorded in the packet, and erase the record of one flow address and the transmission number recorded in the transmission ring of the node, and one flow address to the transmission address memory. If a record remains even after a certain period of time has elapsed since it was written, it is determined that the node has accepted movement, the one flow address is recorded in the destination address memory of the incoming ring, and that fact is The base station registers the location of the mobile terminal number and the address of the base station in the home memory of the mobile terminal and Sends a packet with the base station's hierarchical address, its mobile number, 1 flow address, its home memory, the other party's mobile number, its home memory, the destination IP address, or the other party's fixed telephone number to the side station. , Performing the move acceptance process,
A network for transferring cells or packets or packets with cell headers characterized by
36. The net of claim 35.
The incoming address memory placed in the node of the wireless edge node ring is a memory in which the incoming 1 flow address is registered. When receiving an incoming call, the receiving station is on the wireless edge node ring where the incoming mobile terminal is supposed to exist. The base station that has received a response radio wave including one flow address from the receiving terminal is called from the base station that has received a response radio wave including one flow address from the base station at the same time. An incoming response registration packet including one flow address of the node is raised to the incoming ring to which the node belongs, and the one flow address is recorded in the incoming address memory of the node, and the node number is written in the incoming registration packet to receive the incoming ring. Circulate up, the incoming address memory on the ring has that one flow address If the node number is not recorded, if the node number is larger than the node number of the packet, the record is deleted. , Take action to prohibit writing of that one flow address,
On the other hand, if the node number is recorded and the node number is smaller than the node number of the packet, that fact is recorded in the packet, and the process returns to the original node of the node number recorded in the packet. The configuration is such that the record of one flow address recorded in the incoming address memory of the node is erased and the writing of the one flow address is prohibited, and a certain time has elapsed since the writing of the one flow address to the incoming address memory. If a record remains even after the elapse of time, it is determined that the node has received an incoming call response, and the base station of the node sends the address of the hierarchy of the base station and one flow address to the destination station. Send a packet with the calling mobile number and the incoming mobile number and perform incoming call response processing,
A network for transferring cells or packets or packets with cell headers characterized by
36. The net of claim 35.
The wireless edge node ring has a 0-system ring transmission line and a 1-system ring transmission line. When a mobile terminal makes a call, the mobile terminal sends out a radio wave including the mobile terminal number. The received base station raises the call registration packet including the mobile number of the calling mobile terminal to the ring transmission path corresponding to the bit at the specific position of the bit string obtained by changing the mobile terminal number of the node to a binary number. The mobile number is recorded in the mobile phone address memory of the transmission line, the node number is written in the registration packet, and the circuit is circulated on the ring transmission line. The mobile phone number is the mobile phone address memory of the ring transmission line of the node. If the node number is greater than the node number of the packet, delete the mobile number record,
On the other hand, when the mobile number is recorded and the node number is smaller than the node number of the packet, that fact is recorded in the packet and the node number recorded in the packet is recorded. Returning to the original node, it is a configuration to delete the record of the mobile number recorded in the source address memory of the ring transmission path corresponding to the bit at the specific position of the bit string in which the mobile terminal number of the node is changed to binary,
If a record remains even after a certain period of time has passed since the mobile phone number was written to the mobile phone address memory, it is determined that the node has accepted the call, and the mobile phone number is unique by the wireless edge node ring. 1 flow address is given, and the 1 flow address is recorded in the drop address memory of the ring transmission line corresponding to the bit at the specific position of the 1 flow address. Send a packet with the base station's address of that hierarchy, its one flow address, its originating mobile number, its home memory, its partner's mobile number, its home memory or its connected IP address or its partner's fixed telephone number to the station, Performing call processing,
A network for transferring cells or packets or packets with cell headers characterized by
36. The net of claim 35.
The wireless edge node ring has a 0-system ring transmission line and a 1-system ring transmission line, and the 1 flow address in use of the mobile terminal in communication is that of the node of the base station to which the mobile terminal in communication is connected. When it is recorded in the drop address memory of the ring transmission line corresponding to the bit at a specific position of one flow address in use of the terminal and it is determined that the reception area of the mobile terminal has changed, the mobile terminal A base station that emits a radio wave that includes a caller number that is one higher than the previous caller number and receives a radio wave with a different caller number for the first time from a mobile terminal, and the base station that is not connected to the mobile terminal The mobile registration packet including the one flow address and the calling number of the base station node corresponds to the bit at the specific position of the one flow address in use of the mobile terminal of the base station node. 1 flow address and calling number are recorded in the drop address memory of the ring transmission path, the node number is written in the movement registration packet, and the circuit is circulated on the ring transmission path. Is recorded in the drop address memory of the ring transmission path of the node, and if the recorded transmission number is smaller than the transmission number of the packet, it is recorded in the drop address memory of the node. The one flow address and the transmission number are deleted, and the one flow address is recorded in the drop address memory of the ring transmission path, and the transmission number recorded with the one flow address is the transmission number of the packet The node number is greater than the node number of the packet Case, erase and its 1 Flow address recorded in the drop address memory of the ring transmission path of the node originating number,
On the other hand, in the case where the one flow address is recorded in the drop address memory of the ring transmission path, the transmission number recorded together with it is the same as the number of the packet, and the node number is possessed by the packet. If it is smaller than the node number, the fact is recorded in the packet, the process returns to the original node of the node number recorded in the packet, and one flow recorded in the drop address memory of the ring transmission path of the node The configuration is such that the record of the address and the calling number is erased and the packet is discarded. If the record remains even after a fixed time has elapsed since the writing of one flow address to the drop address memory, the node It is determined that mobile terminal movement has been accepted, and that fact is indicated by the base station of the node. The mobile terminal number and the base station address are registered in the mobile memory, and the hierarchical level of the base station, the mobile number, one flow address, and the home memory are stored in the transmitting station or the receiving station. Sending a packet with the other party's mobile number and its home memory or destination IP address or the other party's fixed telephone number,
A network for transferring cells or packets or packets with cell headers characterized by
36. The net of claim 35.
Wireless edge node ring 0 system ring transmission line and 1 system ring transmission line. When receiving an incoming call, the receiving station is simultaneously sent from all base stations on the wireless edge node ring where the incoming mobile terminal is supposed to exist. The base station that received the response radio wave including the 1 flow address from the receiving terminal by calling the mobile number of the receiving terminal including the unique 1 flow address in the wireless edge node ring, and the incoming call registration including the 1 flow address of the incoming response terminal The packet is raised to the ring transmission line corresponding to the bit at the specific position of the one flow address to which the node belongs, the one flow address is recorded in the drop address memory of the ring, and the node number is written in the incoming registration packet. Circulate on the ring transmission line and store it in the drop address memory on the ring transmission line. If the one flow address is not recorded, a process for prohibiting the recording of the one flow address is performed. If the one flow address is recorded in the drop address memory on the ring transmission path, the node number Is larger than the node number of the packet, delete the record and take a measure to prohibit writing the one flow address,
On the other hand, when the one flow address is recorded in the drop address memory on the ring transmission path and the node number is smaller than the node number of the packet, that fact is recorded in the packet, Returning to the original node of the node number recorded in the packet, deleting the record of one flow address recorded in the drop address memory of the ring transmission path of the node, and prohibiting the writing of the one flow address The packet is discarded, and if a record remains even after a fixed time has elapsed since the writing of one flow address to the drop address memory, it is determined that the node has received an incoming response, The base station of the node sends the base station address and one flow to the destination station. By sending a packet with the address and calling mobile number and called mobile number, performing the incoming call response process,
A network for transferring cells or packets or packets with cell headers characterized by