US7907516B2 - Node setting apparatus, network system, node setting method, and computer product - Google Patents

Node setting apparatus, network system, node setting method, and computer product Download PDF

Info

Publication number
US7907516B2
US7907516B2 US11/822,525 US82252507A US7907516B2 US 7907516 B2 US7907516 B2 US 7907516B2 US 82252507 A US82252507 A US 82252507A US 7907516 B2 US7907516 B2 US 7907516B2
Authority
US
United States
Prior art keywords
node
failure
ring network
master node
master
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Fee Related, expires
Application number
US11/822,525
Other languages
English (en)
Other versions
US20070253330A1 (en
Inventor
Yuji Tochio
Akio Endo
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Fujitsu Ltd
Original Assignee
Fujitsu Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Fujitsu Ltd filed Critical Fujitsu Ltd
Assigned to FUJITSU LIMITED reassignment FUJITSU LIMITED ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: ENDO, AKIO, TOCHIO, YUJI
Publication of US20070253330A1 publication Critical patent/US20070253330A1/en
Application granted granted Critical
Publication of US7907516B2 publication Critical patent/US7907516B2/en
Expired - Fee Related legal-status Critical Current
Adjusted expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/42—Loop networks
    • H04L12/423—Loop networks with centralised control, e.g. polling

Definitions

  • the present invention generally relates to technology for setting a node as a master node that prevents generation of a loop path by blocking relay of user data in a ring network.
  • Ethernet registered trademark
  • a node here means network devices such as computers, hubs, and routers that are connected to one another in the network.
  • EAPS Electronic Protection Switching
  • FIG. 15 is a schematic for explaining the conventional EAPS technique.
  • the ring network is made up of six nodes, namely, nodes 10 1 to 10 6 .
  • One of the nodes, namely the node 10 1 is set as a master node (indicated with the letter “M” in the drawing).
  • the master node 10 1 logically blocks a port 11 1 positioned between the master node 10 1 and the adjacent node 10 2 .
  • the node 10 4 When the failure 12 has been repaired, the node 10 4 logically blocks a port 11 4 between the failure 12 and the node 10 4 , and the node 105 logically blocks a port 115 between the failure 12 and the node 105 , thereby preventing occurrence a loop phenomenon (state 3 ).
  • the nodes 10 4 and 10 5 transmit a packet to the master node 10 1 to notify that the failure 12 has been repaired and also respectively open the ports 11 4 and 11 5 .
  • the master node 10 1 logically blocks the port 11 1 again and prevents a loop phenomenon from occurring (state 4 ).
  • FIG. 16 is a drawing for explaining this conventional data relaying method.
  • the ring network is made up of six nodes, namely, nodes 13 1 to 13 6 .
  • One of the nodes, namely the node 13 1 is set as a master node.
  • the master node 13 1 logically blocks a port 14 1 positioned between the node 13 1 and the node 13 2 .
  • the master node 13 1 opens the port 14 1 so that communication can be performed among the nodes 13 1 to 13 6 .
  • the nodes 13 4 and 13 5 that are connected to the link in which the failure 15 has occurred logically block ports 14 4 and 14 5 , respectively, that are positioned on the two sides of the failure 15 (state 6 ).
  • the nodes 13 4 and 13 5 exchange control signals with each other so as to set only one of the nodes, namely the node 13 4 , as a master node.
  • the other node 13 5 is set as a normal node, and the port 14 5 that has been blocked by the node 13 5 is opened (state 7 ).
  • the link in which the relay of data has been blocked is the same before and after the repair of the failure 15 .
  • the number of times the routing information needs to be learned is only one.
  • FIG. 17 is a drawing for explaining this conventional data relaying method that is used when a node failure has occurred.
  • FIG. 17 an example is shown in which a failure 16 has occurred in the node 13 4 , and the nodes 13 3 and 13 5 are respectively blocking the ports 14 3 and 14 5 that are positioned on the node 13 4 side (state 8 ).
  • the nodes 13 3 and 13 5 exchange control signals with each other via the node 13 4 (state 9 ). Only one of the nodes, namely the node 13 3 , is set as a master node. The other node 13 5 is set as a normal node, and the port 14 5 is opened (state 10 ).
  • a master node needs to be set in advance before the start-up. If the nodes are started up without setting a master node, a loop phenomenon occurs.
  • a node setting apparatus that judges whether an arbitrary first node from among a plurality of nodes in a ring network is be set as a master node, the master node being a node that prevents generation of a loop path in the ring network by blocking relay of user data in the ring network, includes a data transmitting unit that blocks relay of user data in the ring network on one side of the first node and transmits control data in the ring network, the control data containing a priority order indicative of an order for setting the first node as a master node; and a judging unit that, when the first node receives control data transmitted in the ring network by the first node, or when the first node receives control data transmitted in the ring network by other node, judges whether the first node is to be set as a master node based on a priority order contained in received control data.
  • a network system includes a plurality of nodes in a ring network, and in which an arbitrary first node from among the nodes judges whether the first node is be set as a master node.
  • the master node being a node that prevents generation of a loop path in the ring network by blocking relay of user data in the ring network.
  • the first node includes a data transmitting unit that blocks relay of user data in the ring network on one side of the first node and transmits control data in the ring network, the control data containing a priority order indicative of an order for setting the first node as a master node; and a judging unit that, when the first node receives control data transmitted in the ring network by the first node, or when the first node receives control data transmitted in the ring network by other node, judges whether the first node is to be set as a master node based on a priority order contained in received control data.
  • a node setting method of judging whether an arbitrary first node from among a plurality of nodes in a ring network is be set as a master node, the master node being a node that prevents generation of a loop path in the ring network by blocking relay of user data in the ring network includes blocking relay of user data in the ring network on one side of the first node and transmitting control data in the ring network, the control data containing a priority order indicative of an order for setting the first node as a master node; and judging, when the first node receives control data transmitted in the ring network by the first node, or when the first node receives control data transmitted in the ring network by other node, whether the first node is to be set as a master node based on a priority order contained in received control data.
  • a computer-readable recording medium stores therein a computer program that causes a computer to execute the above method.
  • FIG. 1 is a drawing for explaining a concept of a node setting process performed when a ring network is started up;
  • FIG. 2 is a drawing for explaining a concept of a node setting process performed when a link failure has occurred
  • FIG. 3 is a drawing for explaining a concept of a node setting process performed when a node failure has occurred
  • FIG. 4 is a drawing for explaining a concept of a node setting process performed when a health packet has not yet been detected
  • FIG. 5 is a functional block diagram of a data transmitting apparatus according to an embodiment of the present invention.
  • FIG. 6 is a drawing for explaining a transmission and reception permitting process for health packets performed by a pseudo master node
  • FIG. 7 is a drawing for explaining a master node compulsory setting process
  • FIG. 8 is a drawing for explaining a node setting process performed when a node that is not the data transmitting apparatus is included in a network
  • FIG. 9 is a drawing for explaining state transitions of nodes
  • FIG. 10 is a flowchart of a procedure in a pseudo master node transition process
  • FIGS. 11A and 11B are flowcharts of a procedure in a transition process to transit from a pseudo master node to a master node or to a transit node;
  • FIG. 12 is a flowchart of a procedure in a transition process to transit from a master node to a transit node;
  • FIG. 13 is a drawing for explaining a transmission and reception permitting process for health packets performed when each pseudo master node transmits a trap packet and a flash packet;
  • FIG. 14 is a hardware configuration diagram of a computer that serves as the data transmitting apparatus 30 shown in FIG. 5 ;
  • FIG. 15 is a drawing for explaining a conventional EAPS technique
  • FIG. 16 is a drawing for explaining a conventional data relaying method.
  • FIG. 17 is a drawing for explaining a conventional data relaying method that is used when a node failure has occurred.
  • FIG. 1 is a drawing for explaining how a node setting process is performed when a ring network is started up.
  • the ring network is made up of six nodes, namely, nodes 20 1 to 20 6 .
  • Each of the nodes 20 1 to 20 6 has two ports that are respectively connected to two of the nodes 20 1 to 20 6 that are positioned on either side of the node.
  • each of the nodes 20 1 to 20 6 makes a transition so as to change the state thereof to a state called a pseudo master node.
  • Each of the pseudo master nodes is indicated with the letters “PM” in the drawing.
  • the pseudo master nodes block the relay of user data packets. From another set of ports that are respectively positioned on the other side of the nodes 20 1 to 20 6 , the pseudo master nodes transmit health packets H 1 to H 6 (state 11 ).
  • the ports 21 1 to 21 6 that are blocked may be specified in advance or may be determined in a random manner.
  • the health packets H 1 to H 6 are control packets that are transmitted by the nodes 20 1 to 20 6 so as to check to see whether there is any failure in the ring network.
  • the nodes 20 1 to 20 6 receive the transmitted health packets H 1 to H 6 at the ports that are positioned opposite the ports from which the health packets H 1 to H 6 have been transmitted.
  • the nodes 20 1 to 20 6 When transmitting the health packets H 1 to H 6 , the nodes 20 1 to 20 6 each transmit information related to a priority order thereof by putting the information into the health packets H 1 to H 6 , the priority order indicating an order in which each of the nodes 20 1 to 20 6 is to be set as a master node. It is acceptable to assign the priority orders to the nodes 20 1 to 20 6 in advance. Alternatively, it is also acceptable to use Media Access Control (MAC) addresses assigned to the nodes 20 1 to 20 6 as indications of the priority orders.
  • MAC Media Access Control
  • each of the nodes 20 1 to 20 6 When having received one of the health packets H 1 to H 6 from another one of the nodes 20 1 to 20 6 , each of the nodes 20 1 to 20 6 obtains the information related to the priority order contained in the received one of the health packets H 1 to H 6 and compares the obtained priority order information with the priority order information of its own.
  • the nodes 206 and 203 When the nodes 206 and 203 have received the health packets H 1 and H 4 respectively and found out that the priority orders that are contained in the health packets H 1 and H 4 transmitted from the nodes 20 1 and 20 4 are higher than their own priority orders, the nodes 206 and 20 3 open the ports 21 6 and 21 3 that have been blocked and make transitions so as to change the state thereof to transit nodes (each indicated with the letter “T” in the drawing) that allow the user data packets to be relayed (state 12 ).
  • the priority orders are specified so that none of the nodes has the same priority order as the other nodes.
  • the health packets H 1 to H 6 keeps being transmitted to a different one of the nodes 20 1 to 20 6 , all the nodes except the node 20 1 make transitions so as to change the state thereof to a transit node. Accordingly, the ports 21 2 to 21 6 that have been blocked by the nodes 20 2 to 20 6 are opened (state 13 ). Also, when the nodes 20 2 to 20 6 each have made the transition so as to change the state thereof to a transit node, the transmission of the health packets is stopped.
  • the node 20 1 that eventually remains as the pseudo master node receives the health packet H 1 that was transmitted therefrom.
  • each of the nodes 20 1 to 20 6 performs a process of making a transition so as to change the state thereof to a master node (indicated with the letter “M”) (state 14 ).
  • FIG. 2 is a drawing for explaining the concept of a node setting process performed when a link failure has occurred.
  • the node 20 1 has been set as a master node and it blocks the relay of user data packets performed via the port 21 1 .
  • a failure 22 has occurred in a link connecting the node 20 3 and the node 20 4 to each other (state 15 ).
  • the nodes 20 3 and 20 4 that are connected to the link in which the failure 22 has occurred detect the occurrence of the failure 22 and each set the state thereof as a pseudo master node.
  • the nodes 20 3 and 20 4 also block the ports 21 3 and 21 4 , respectively, that are positioned on the side of the link in which the failure 22 has occurred.
  • the nodes 20 3 and 20 4 respectively transmit trap packets T 3 and T 4 to notify the node 20 1 serving as the master node of the occurrence of the failure 22 , from the ports that are positioned on the opposite side of the ports 21 3 and 21 4 (state 16 ).
  • the node 20 1 serving as the master node makes a transition so as to change the state thereof to a transit node and opens the port 21 1 that has been blocked.
  • the nodes 20 3 and 20 4 transmit health packets H 3 and H 4 , respectively. Then, the nodes 20 3 and 20 4 wait to receive the health packet from each other. (i.e., the node 20 3 waits to receive the health packet H 4 transmitted from the node 20 4 , whereas the node 20 4 wait to receive the health packet H 3 transmitted from the node 20 3 ) (state 17 ).
  • each of the nodes 20 3 and 20 4 When having received the one of the health packets H 3 and H 4 transmitted from the other of the two nodes, each of the nodes 20 3 and 20 4 performs the process of judging whether the state thereof should be a master node or a transit node, based on the information related to the priority order that is contained in the received one of the health packets H 3 and H 4 , in the same fashion as the node setting process explained with reference to FIG. 1 .
  • the node 20 3 becomes a master node, whereas the node 20 4 becomes a transit node (state 18 ). It means that the priority order of the node 20 3 is set to be higher than the priority order of the node 20 4 .
  • the node 20 3 continues to function as the master node. Thus, there is no need to set a master node again after the failure 22 is repaired.
  • FIG. 3 is a drawing for explaining the concept of a node setting process performed when a node failure has occurred.
  • the node 20 1 has been set as a master node, and the port 21 1 is blocking the relay of user data packets.
  • the port 21 1 is blocking the relay of user data packets.
  • the nodes 20 3 and 20 5 that are positioned on either side of the node 20 4 in which the failure has occurred detect the occurrence of the failure and block the ports 213 and 215 , respectively, that are positioned on the node 20 4 side, because the failure has occurred in the node 20 4 . Further, the nodes 203 and 205 transmit trap packets T 3 and T 5 , respectively, to notify the master node 201 of the occurrence of the failure (state 20 ).
  • the master node 20 1 After that, when having received at least one of the trap packets T 3 and T 5 , the master node 20 1 makes a transition so as to change the state thereof to a transit node and opens the port 21 1 that has been blocked.
  • the nodes 20 3 and 20 5 transmit health packets H 3 and H 5 , respectively.
  • the nodes 20 3 and 20 5 wait to receive the health packet from each other (i.e., the node 20 3 waits to receive the health packet H 5 transmitted from the node 20 5 , whereas the node 20 5 wait to receive the health packet H 3 transmitted from the node 20 3 ) (state 21 ).
  • each of the nodes 20 3 and 20 5 When having received the one of the health packets H 3 and H 5 transmitted from the other of the two nodes, each of the nodes 20 3 and 20 5 performs the process of judging whether the state thereof should be a master node or a transit node, based on the information related to the priority order that is contained in the received one of the health packets H 3 and H 5 , in the same fashion as the node setting process explained with reference to FIG. 1 .
  • the node 20 3 becomes a master node, whereas the node 20 5 becomes a transit node (state 22 ). It means that the priority order of the node 20 3 is set to be higher than the priority order of the node 20 5 .
  • the node 20 4 When the failure in the node 20 4 has been repaired, the node 20 4 temporarily becomes a pseudo master node. The node 20 4 then blocks one of the ports, namely 21 4 , and transmits a health packet H 4 (state 23 ).
  • the node 20 3 serving as a master node transmits a health packet regularly, when the node 20 4 receives one of such health packets, the node 20 4 makes a transition so as to change the state thereof to a transit node, as a result of a comparison of priority orders (state 24 ).
  • FIG. 4 is a drawing for explaining the concept of a node setting process performed when the health packet has not yet been detected.
  • the node 20 1 has been set as a master node and is blocking the relay of user data packets at the port 21 1 .
  • the node 20 1 also has transmitted a health packet H 1 (state 25 ).
  • the node 20 1 makes a transition so as to change the state thereof to a master node again (state 25 ).
  • the nodes 20 3 and 20 5 that are positioned on either side of the node 20 4 in which the failure has occurred detect the occurrence of the failure because no signals can be detected, and the nodes 20 3 and 20 5 each make a transition so as to change the state thereof to a pseudo master node.
  • the nodes 20 3 and 20 5 then block the ports 21 3 and 21 5 , respectively, that are positioned on the node 20 4 side, because the failure has occurred in the node 20 4 .
  • the nodes 20 3 and 20 5 also transmit health packets H 3 and H 5 , respectively (state 27 ).
  • the node 20 1 makes a transition so as to change the state thereof to a transit node and opens the port 21 1 that has been blocked (state 28 ).
  • the process that is the same as the one shown in FIG. 3 as state 22 , state 23 , and state 24 is performed so that a master node can be set.
  • the ports that relay the user data are blocked, and also the health packets that contain the information related to the priority order in which each of the nodes is to be set as a master node are transmitted.
  • a node has received such a health packet that was transmitted therefrom or when a node has received a health packet that contains information related to a priority order from another node, it is judged whether the node should be set as a master node, based on the information related to the priority order contained in the received health packet.
  • FIG. 5 is a functional diagram of a data transmitting apparatus 30 according to the present embodiment.
  • the data transmitting apparatus 30 includes ports 31 a and 31 b , a packet transmitting/receiving unit 32 , a storage unit 33 , a master-node process executing unit 34 , a transit-node process executing unit 35 , a routing-information learning processing unit 36 , an event detecting unit 37 , a pseudo-master-node process executing unit 38 , and a controlling unit 39 .
  • the ports 31 a and 31 b relay packets containing user data or control data.
  • the packet transmitting/receiving unit 32 performs processes of transmitting and receiving various types of packets including data packets, trap packets, and health packets, via the ports 31 a and 31 b.
  • the storage unit 33 is a storage device such as a memory.
  • the storage unit 33 stores therein self-node information 33 a , other-node information 33 b , and routing information 33 c .
  • the self-node information 33 a is stored information related to the data transmitting apparatus 30 in which the storage unit 33 and the other constituent elements described above are included (hereinafter, “the node”), such as information about the priority order and the MAC address of the node.
  • the other-node information 33 b is stored information related to priority orders and MAC addresses of nodes other than the node.
  • the routing information 33 c is stored information related to transfer destinations of packets. More specifically, in the routing information 33 c , MAC addresses serving as the transfer destinations of the packets are stored in correspondence with information of ports to which the nodes having the MAC addresses assigned thereto are connected respectively.
  • the master-node process executing unit 34 executes various types of processes that should be performed by master nodes when the node has been set as a master node. More specifically, to prevent a loop phenomenon from occurring in the network, the master-node process executing unit 34 blocks the relay of user data packets at one of the ports and also performs a process of transmitting a health packet regularly.
  • the master-node process executing unit 34 checks the destination MAC address of the received packet and performs a process of transmitting the packet from an appropriate port by referring to the routing information 33 c.
  • the transit-node process executing unit 35 executes various types of processes that should be performed by transit nodes when the node has been set as a transit node. More specifically, when a packet has been received, the transit-node process executing unit 35 checks the destination MAC address of the received packet and performs a process of transmitting the packet from an appropriate port by referring to the routing information 33 c.
  • the routing-information learning processing unit 36 re-learns the routing information 33 c.
  • the event detecting unit 37 performs a process of detecting a start-up of the node and a failure that has occurred in a link or in a node. More specifically, the event detecting unit 37 detects a start-up of the node by detecting that the electric power source has been turned on or that the node has been re-booted.
  • the event detecting unit 37 also detects a failure that has occurred in a link that is connected to the node or in another node that is connected to such a link, based on information related to the state of signal levels of packets or based on whether there are responses from other nodes.
  • the event detecting unit 37 When having detected a failure, the event detecting unit 37 transmits a trap packet to one or more of the other nodes. In particular, while the node is serving as a master node, the event detecting unit 37 performs a process of transmitting a flash packet to one or more of the other nodes.
  • the event detecting unit 37 detects a failure that has occurred in the network by checking to see whether a health packet transmitted from the node comes back to the node before the predetermined period of time elapses.
  • the pseudo-master-node process executing unit 38 sets the node as a pseudo master node and executes various types of processes that should be performed by pseudo master nodes.
  • the pseudo-master-node process executing unit 38 includes a port-block processing unit 38 a , a health-packet transmission processing unit 38 b , and a node setting unit 38 c.
  • the port-block processing unit 38 a performs a process of blocking the relay of user data packets at one of the two ports.
  • the port-block processing unit 38 a blocks the port that is positioned on the failure side.
  • the health-packet transmission processing unit 38 b performs a process of transmitting a health packet that contains information related to the priority order to one or more of the other nodes.
  • the node setting unit 38 c compares the information related to the priority order that is contained in the received health packet with the self-node information 33 a that is stored in the node as the priority order information thereof, so as to perform the process of judging whether the priority order of the node is higher.
  • the node setting unit 38 c sets the node as a transit node.
  • the node setting unit 38 c waits until a next health packet is received so as to judge again if the priority order of the node is higher.
  • the node setting unit 38 c sets the node as a master node.
  • the nodes 20 3 and 20 4 that are connected to the link in which the failure 22 has occurred each make a transition so as to change the state thereof to a pseudo master node; however, if the node 20 1 serving as a master node has already transmitted health packets before receiving the trap packets T 3 and T 4 , a problem arises where the nodes 20 3 and 20 4 each make a transition so as to change the state thereof to a transit node immediately after receiving the health packet.
  • the packet transmitting/receiving unit 32 included in each of the nodes 20 3 and 20 4 waits until the node 20 1 serving as the master node transmits a flash packet that erases the routing information stored in each of the nodes in response to the node 20 1 's receiving the trap packets T 3 and T 4 .
  • the packet transmitting/receiving unit 32 in each of the nodes 20 3 and 20 4 transmits and receives health packets only after receiving the flash packet transmitted by the node 20 1 .
  • FIG. 6 is a drawing for explaining a transmission and reception permitting process for health packets performed by a pseudo master node.
  • FIG. 6 corresponds to a situation shown in FIG. 2 in which a link failure has occurred.
  • each of the nodes 20 3 and 20 4 transmits a trap packet to the node 20 1 serving as the master node.
  • the node 20 1 serving as the master node transmits a health packet regularly.
  • Each of the nodes 20 3 and 20 4 serving as pseudo master nodes discards the received health packets until the node receives a flash packet that is transmitted in response to the trap packet.
  • each of the nodes 20 3 and 20 4 After having received the trap packet, each of the nodes 20 3 and 20 4 performs the same process as the one shown in state 17 and state 18 explained with reference to FIG. 2 . With this arrangement, it is possible to solve the problem where each of the nodes 20 3 and 20 4 prematurely makes a transition so as to change the state thereof to a transit node immediately after receiving the health packet transmitted by the master node, before transmitting a health packet.
  • the routing-information learning processing unit 36 included in each of the nodes re-learns the routing information 33 c every time the node has received a flash packet.
  • controlling unit 39 is a controlling unit that exercises overall control of the data transmitting apparatus 30 and controls data exchange among the functional units.
  • FIG. 7 is a drawing for explaining a master node compulsory setting process.
  • a ring network is made up of six nodes, namely, the nodes 20 1 to 20 6 .
  • the priority order of the node 20 4 is set to be the highest so that 20 4 functions as a master node when the ring network is started up.
  • the other nodes namely the nodes 20 1 to 20 3 , 20 5 , and 20 6 each make a transition so as to change the state thereof to a pseudo master node when the ring network is started up.
  • each of the nodes 20 1 to 20 6 blocks the relay of user data packets. From another set of ports that are respectively positioned on the other side of the nodes 20 1 to 20 6 , the nodes 20 1 to 20 6 transmit the health packets H 1 to H 6 , respectively (state 29 ).
  • each of the nodes 20 1 to 20 6 When having received one of the health packets H 1 to H 6 from another one of the nodes 20 1 to 20 6 , each of the nodes 20 1 to 20 6 obtains the information related to the priority order contained in the received one of the health packets H 1 to H 6 and compares the obtained priority order with the priority order of its own stored therein.
  • the nodes 20 1 to 20 3 , 20 5 , and 20 6 each make a transition so as to change the state thereof to a transit node (state 30 and state 31 ).
  • the node 20 4 serving as the master node receives the health packet H 4 that has been transmitted from the node 20 4 (state 32 ).
  • FIGS. 1 to 4 are on an assumption that each and all of the nodes is the data transmitting apparatus 30 that performs the node setting process according to the present invention.
  • FIG. 8 is a drawing for explaining a node setting process performed when a node that is not the data transmitting apparatus 30 is included in a network.
  • the node 20 3 has been set as a master node and is blocking the relay of user data packets performed via the port 21 3 .
  • the failure 22 has occurred in the link that is connecting a data relaying node 23 and the node 20 1 to each other (state 33 ).
  • each of the nodes 20 1 to 20 5 is realized with the data transmitting apparatus 30 shown in FIG. 5 .
  • the data relaying node 23 belongs to both the ring network made up of the nodes 20 1 to 20 5 and another ring network and has a function to relay packets.
  • the node 20 1 detects the occurrence of the failure 22 and makes a transition so as to change the state thereof to a pseudo master node. In other words, the node 20 1 blocks the port 21 1 that is positioned on the failure 22 side and also transmits a trap packet T 1 (state 34 ).
  • the node 20 3 serving as a master node When the node 20 3 serving as a master node has received the trap packet T 1 , the node 20 3 makes a transition so as to change the state thereof to a transit node and opens the port 21 3 that has been blocked. On the other hand, the node 20 1 serving as a pseudo master node transmits a health packet H 1 regularly and keeps functioning as the pseudo master node until the failure 22 is repaired (state 35 ).
  • the node 20 1 When the failure 22 has been repaired, the node 20 1 receives the health packet H 1 transmitted therefrom and therefore makes a transition so as to change the state thereof to a master node (state 36 ). As explained above, it is possible to apply the node setting process according to the present invention to such a situation in which a node that is not the data transmitting apparatus 30 is included in the network.
  • FIG. 9 is a drawing for explaining state transitions of nodes.
  • FIG. 10 is a flowchart of a procedure in a pseudo master node transition process.
  • the pseudo master node transition process explained with reference to FIG. 10 corresponds to transition 4 , transition 5 , or transition 6 shown in FIG. 9 .
  • a disabled state 40 denotes a situation in which a node is in a link-down state. More specifically, a node makes a transition to a disabled state, when the electric power source of the data transmitting apparatus 30 is turned off, when the data transmitting apparatus 30 is re-booted, or when the node has been operating as a master node 41 , a master node 42 , or a transit node 43 , but has detected two failures (transition 1 , transition 2 , and transition 3 ).
  • the node setting unit 38 c included in the data transmitting apparatus 30 detects an operational state of the data transmitting apparatus 30 (hereinafter, “the node”) (step S 101 ).
  • the node setting unit 38 c then checks to see whether the node has been started up from the disabled state 40 (step S 102 ).
  • step S 105 the node setting unit 38 c checks to see whether at least one of the ports is in a link-up state.
  • step S 101 the process proceeds to step S 101 , and the processes at the steps thereafter will be continued.
  • the node setting unit 38 c When at least one of the ports is in a link-up state (Yes at step S 105 ), the node setting unit 38 c enables both of the ports that are positioned on either side of the node (step S 106 ) and sets the node as a pseudo master node (step S 107 ). Thus, the pseudo master node transition process is completed.
  • the processes at steps S 102 through S 107 correspond to transition 4 shown in FIG. 9 .
  • step S 102 when the node has not been started up from the disabled state 40 (No at step S 102 ), the node setting unit 38 c checks to see whether the event detecting unit 37 has detected any failure at any of the ports that are positioned on either side of the node (step S 103 ).
  • step S 103 When one or more failures have been detected (Yes at step S 103 ), the process proceeds to step S 107 so that the node setting unit 38 c sets the node as a pseudo master node. Thus, the pseudo master node transition process is completed.
  • the processes at steps S 103 and S 107 correspond to transition 5 or transition 6 shown in FIG. 9 .
  • the node setting unit 38 c checks to see whether the node is a master node and also the node has not received the health packet that was transmitted therefrom for the predetermined period of time (step S 104 ).
  • step S 104 When the node has not received the health packet for the predetermined period of time (Yes at step S 104 ), the process proceeds to step S 107 so that the node setting unit 38 c sets the node as a pseudo master node. Thus, the pseudo master node transition process is completed.
  • the process proceeds to step S 101 , and the processes at the steps thereafter will be continued.
  • the processes at steps S 103 , S 104 , and S 107 correspond to transition 5 shown in FIG. 9 .
  • FIGS. 11A and 11B are flowcharts ( 1 ) and ( 2 ) of the procedure in the transition process to transit from a pseudo master node to a master node or to a transit node.
  • This transition process corresponds to transition 7 and transition 8 shown in FIG. 9 .
  • the node setting unit 38 c included in the data transmitting apparatus 30 checks to see whether both of the ports that are positioned on either side of the data transmitting apparatus 30 (hereinafter, “the node”) are in a link-up state and also the node has received a health packet that was transmitted therefrom (step S 201 ).
  • the node setting unit 38 c sets the node as a master node (step S 204 ), and thus the transition process is completed.
  • This process corresponds to the master node setting process explained with reference to FIG. 1 .
  • the node setting unit 38 c further checks to see whether both of the ports positioned on either side of the node are in a link-up state and also the node has compulsorily been set as a master node (step S 202 ).
  • step S 202 When both of the ports that are positioned on either side of the node are in a link-up state and also the node has compulsorily been set as a master node (Yes at step S 202 ), the process proceeds to step S 204 , so that the node setting unit 38 c sets the node as a master node. Thus, the transition process is completed.
  • This process corresponds to the master node setting process explained with reference to FIG. 7 .
  • the node setting unit 38 c further checks to see whether one of the ports is in a link-down state and also the node has received a flash packet as well as a health packet having a lower priority order than the priority order assigned to the node (step S 203 ).
  • step S 204 the node setting unit 38 c sets the node as a master node.
  • This process corresponds to the master node setting process explained with reference to FIG. 2 or FIG. 3 .
  • the processes at steps S 201 through S 204 correspond to transition 7 shown in FIG. 9 .
  • the node setting unit 38 c further checks to see, as shown in FIG. 11B , whether both of the ports are in a link-up state and also the node has received a health packet from a master node (step S 204 ).
  • the node setting unit 38 c sets the node as a transit node (step S 208 ), and thus the transition process is completed.
  • This process corresponds to the transit node setting process explained with reference to FIG. 7 .
  • the node setting unit 38 c further checks to see whether both of the ports are in a link-up state and also the node has received a health packet having a higher priority order than the priority order assigned to the node (step S 205 ).
  • step S 208 the node setting unit 38 c sets the node as a transit node.
  • This process corresponds to the transit node setting process explained with reference to FIG. 1 .
  • the node setting unit 38 c further checks to see whether one of the ports is in a link-down state, and also the node has received a flash packet as well as a health packet having a higher priority order than the priority order assigned to the node (step S 206 ).
  • step S 208 the node setting unit 38 c sets the node as a transit node.
  • This process corresponds to the transit node setting process explained with reference to FIGS. 2 and 3 .
  • the node setting unit 38 c further checks to see whether a receive time-out has occurred with the health packet that the node had transmitted while serving as a master node, and also the node has received a health packet transmitted from another node (step S 207 ).
  • step S 207 When a receive time-out has occurred with the health packet and also the node has received a health packet transmitted from another node (Yes at step S 207 ), the process proceeds to step S 208 so that the node setting unit 38 c sets the node as a transit node. Thus, the transition process is completed.
  • This process corresponds to the transit node setting process explained with reference to FIG. 4 .
  • step S 207 When one or both of the two conditions above are not satisfied (i.e., “a receive time-out has occurred with the health packet” is not satisfied and/or “the node has received a health packet transmitted from another node” is not satisfied) (No at step S 207 ), the process proceeds to step S 201 , and the processes at the steps thereafter are performed again.
  • the processes at steps S 204 through S 208 correspond to transition 8 shown in FIG. 9 .
  • FIG. 12 is a flowchart of the procedure in the transition process to transit from a master node to a transit node.
  • the process shown in FIG. 12 corresponds to transition 9 shown in FIG. 9 .
  • the node setting unit 38 c included in the data transmitting apparatus 30 checks to see whether the data transmitting apparatus 30 (hereinafter, “the node”) serving as a master node 42 has received a health packet having a higher priority order than the priority order assigned to the node (step S 301 ).
  • the node setting unit 38 c makes a transition so as to change the state thereof to a transit node (step S 303 ), and thus the transition process is completed.
  • the node setting unit 38 c checks to see whether the node has received any trap packet (step S 302 ).
  • step S 302 When the node has received one or more trap packets (Yes at step S 302 ), the process proceeds to step S 303 so that the node setting unit 38 c makes a transition so as to change the state thereof to a transit node. Thus, the transition process is completed.
  • the transition process is completed as it is.
  • FIG. 6 the example in which the node 20 1 serving as a master node transmits the flash packet is shown; however, alternatively, another arrangement is acceptable in which the nodes 20 3 and 20 4 serving as pseudo master nodes also transmit flash packets in addition to the trap packets.
  • FIG. 13 is a drawing for explaining a transmission and reception permitting process for health packets performed when each pseudo master node transmits a trap packet and a flash packet.
  • the node 20 1 serving as a master node transmits acknowledgement (ACK) packets to notify the nodes 20 3 and 20 4 that the node 20 1 has received the trap packets and the flash packets.
  • ACK acknowledgement
  • Each of the nodes 20 3 and 20 4 serving as the pseudo master nodes discards any health packets received by the node until the node receives the ACK packet. In other words, each the nodes 20 3 and 20 4 permits transmission and reception of health packets only after the node receives the ACK packet.
  • the routing-information learning processing unit 36 included in each of the nodes re-learns the routing information 33 c every time the node receives a flash packet.
  • the port-block processing unit 38 a included in the data transmitting apparatus 30 blocks the relay of user data performed on the side of one of the ports of one of the nodes included in the ring network.
  • the health-packet transmission processing unit 38 b transmits a health packet that contains the information related to the priority order in which the node is to be set as a master node.
  • the node setting unit 38 c judges whether the node should be set as a master node, based on the information related to the priority order contained in the received health packet.
  • the health-packet transmission processing unit 38 b stops the transmission of the health packet that contains the information related to the priority order. Thus, it is possible to inhibit unnecessary transmission of health packets.
  • the event detecting unit 37 detects a failure that has occurred in the ring network.
  • the health-packet transmission processing unit 38 b transmits a health packet that contains the information related to the priority order.
  • the event detecting unit 37 detects a failure that has occurred in the ring network by checking to see whether the health packet transmitted by the node comes back thereto. Thus, it is possible to detect a failure efficiently. Also, it is possible to set a master node appropriately and efficiently when a failure has occurred.
  • the node setting unit 38 c judges that the node should remain as the master node. Thus, it is possible to make judgment appropriately and efficiently so that the state of the node as the master node is maintained.
  • the event detecting unit 37 transmits a trap packet to notify the master node that the event detecting unit 37 has detected the failure.
  • the master node it is possible to notify the master node of the occurrence of the failure. Consequently, it is possible to cause the master node to perform an appropriate process in response to the occurrence of the failure.
  • the node setting unit 38 c judges whether the node should be set as a master node based on the information related to the priority order contained in the received health packet.
  • the node setting unit 38 c prematurely judges whether the node should be set as a master node, based on a health packet that had been transmitted by the master node before the master node has received the trap packet.
  • the routing-information learning processing unit 36 every time the node receives a flash packet transmitted by a master node in response to the master node's receiving a trap packet, the routing-information learning processing unit 36 starts re-learning the routing information 33 c .
  • the routing-information learning processing unit 36 starts re-learning the routing information 33 c .
  • the event detecting unit 37 when having detected a failure, transmits a flash packet.
  • the event detecting unit 37 transmits a flash packet.
  • the node setting unit 38 c judges whether the node should be set as a master node based on the information related to the priority order contained in the received health packet.
  • the node setting unit 38 c prematurely judges whether the node should be set as a master node, based on a health packet that had been transmitted by the master node before the master node has received the flash packet.
  • the routing-information learning processing unit 36 starts re-learning the routing information 33 c every time the node receives a flash packet.
  • the routing-information learning processing unit 36 starts re-learning the routing information 33 c every time the node receives a flash packet.
  • the event detecting unit 37 detects a failure in the data relaying node 23 or in a link that connects the data relaying node 23 and the node to each other.
  • the health-packet transmission processing unit 38 b transmits a health packet that contains the information related to the priority order.
  • FIG. 14 is a hardware configuration diagram of the computer that serves as the data transmitting apparatus 30 shown in FIG. 5 .
  • the computer is configured so as to include the following elements that are connected to one another via a bus 106 . That is, an input button 100 that receives an input from a user; a Light Emitting Diode (LED) 101 that outputs various types of information; a main memory 102 ; a flash memory 103 ; a Central Processing Unit (CPU) 104 ; and a read-only memory 105 .
  • an input button 100 that receives an input from a user
  • LED Light Emitting Diode
  • main memory 102 main memory
  • flash memory 103 a flash memory 103
  • CPU Central Processing Unit
  • read-only memory 105 read-only memory
  • the read-only memory 105 stores therein a node setting program 105 a , which is a program that realizes the same function as that of the data transmitting apparatus 30 .
  • the node setting program 105 a may be stored in a distributed manner, as necessary.
  • the node setting computer process 104 a corresponds to the function units shown in FIG. 5 , namely, the packet transmitting/receiving unit 32 , the master-node process executing unit 34 , the transit-node process executing unit 35 , the routing-information learning processing unit 36 , the event detecting unit 37 , the pseudo-master-node process executing unit 38 , and the controlling unit 39 .
  • the flash memory 103 stores therein self-node information 103 a , other-node information 103 b , and routing information 103 c .
  • the self-node information 103 a , the other-node information 103 b , and the routing information 103 c correspond to the self-node information 33 a , the other-node information 33 b , and the routing information 33 c.
  • the CPU 104 stores the self-node information 103 a , the other-node information 103 b , and the routing information 103 c into the flash memory 103 .
  • the CPU 104 also reads the self-node information 103 a , the other-node information 103 b , and the routing information 103 c from the flash memory 103 and stores the read information into the main memory 102 .
  • the CPU 104 then executes the various types of data processes based on self-node information 102 a , other-node information 102 b , and routing information 102 c that are stored in the main memory 102 .
  • the node setting program 105 a does not necessarily have to be stored in the read-only memory 105 in advance.
  • a “portable physical medium” such as a flexible disk (FD), a Compact Disc Read-Only Memory (CD-ROM), an Magneto-Optical (MO) disk, a Digital Versatile Disk (DVD), a magnetic optical disk, an Integrated Circuit (IC) card, or a “stationary physical medium” such as a hard disk drive (HDD) that is provided on the inside or the outside of the computer, or “another computer (or a server)” that is connected to the computer via a public circuit, the Internet, a Local Area Network (LAN), or a Wide Area Network (WAN), so that the computer reads the program from such a storage and executes the read program.
  • a “portable physical medium” such as a flexible disk (FD), a Compact Disc Read-Only Memory (CD-ROM), an Magneto-Optical (MO) disk, a Digital Versatile Disk (DVD),
  • the constituent elements of the data transmitting apparatus 30 that are shown in the drawings are based on functional concepts. Thus, it is not necessary to physically configure the elements as indicated in the drawings. In other words, the specific mode of distribution and integration of the data transmitting apparatus 30 is not limited to the one shown in the drawings. It is acceptable to functionally or physically distribute or integrate all or a part of the apparatus in any arbitrary units, depending on various loads and the status of use.
  • all or a part of the processing functions performed by the data transmitting apparatus 30 may be realized by a CPU and a program that is analyzed and executed by the CPU or may be realized as hardware using wired logic.
  • an advantageous effect is achieved where it is possible to set the master node appropriately and efficiently when a failure has occurred.
  • an advantageous effect is achieved where it is possible to detect a failure efficiently and also to set the master node appropriately and efficiently when the failure has occurred.
  • an advantageous effect is achieved where it is possible to make the judgment appropriately and efficiently so that the node remains as the master node.
  • an advantageous effect is achieved where it is possible to notify the master node of the occurrence of the failure so as to cause the master node to perform an appropriate process in response to the occurrence of the failure.
  • an advantageous effect is achieved where it is possible to avoid the situation in which the judgment as to whether the node should be set as a master node is prematurely made, based on the control data that had been transmitted by the master node before the master node has received the failure detection control data.
  • an advantageous effect is achieved where it is possible to appropriately manage the number of times the re-learning process is performed so that the transmission path is re-learned every time occurrence of a failure has been detected.
  • an advantageous effect is achieved where it is possible to request that another node should re-learn the information related to the transmission path of the user data and to cause the other nodes in the network to perform an appropriate process in response to the occurrence of the failure.
  • an advantageous effect is achieved where it is possible to avoid the situation in which the judgment as to whether the node should be set as a master node is prematurely made, based on the control data that had been transmitted by the master node before the master node has received the routing information learning control data.
  • an advantageous effect is achieved where it is possible to appropriately manage the number of times the re-learning process is performed so that the transmission path is re-learned every time occurrence of a failure has been detected.
  • an advantageous effect is achieved where it is possible to set the master node appropriately and efficiently, even if the data relaying node that has no function to judge whether the one of the nodes should be set as a master node is included in the ring network.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Small-Scale Networks (AREA)
US11/822,525 2005-01-07 2007-07-06 Node setting apparatus, network system, node setting method, and computer product Expired - Fee Related US7907516B2 (en)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/JP2005/000143 WO2006072996A1 (fr) 2005-01-07 2005-01-07 Dispositif d'etablissement de noeud, systeme de reseau, methode d'etablissement de noeud et programme d'etablissement de noeud

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2005/000143 Continuation WO2006072996A1 (fr) 2005-01-07 2005-01-07 Dispositif d'etablissement de noeud, systeme de reseau, methode d'etablissement de noeud et programme d'etablissement de noeud

Publications (2)

Publication Number Publication Date
US20070253330A1 US20070253330A1 (en) 2007-11-01
US7907516B2 true US7907516B2 (en) 2011-03-15

Family

ID=36647484

Family Applications (1)

Application Number Title Priority Date Filing Date
US11/822,525 Expired - Fee Related US7907516B2 (en) 2005-01-07 2007-07-06 Node setting apparatus, network system, node setting method, and computer product

Country Status (3)

Country Link
US (1) US7907516B2 (fr)
JP (1) JP4621212B2 (fr)
WO (1) WO2006072996A1 (fr)

Families Citing this family (33)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9083551B2 (en) * 2006-03-17 2015-07-14 Tellabs Operations, Inc. Method and apparatus for media distribution using VPLS in a ring topology
CN101232428B (zh) 2007-01-23 2012-05-23 华为技术有限公司 一种以太网环保护方法及装置
CN101232427A (zh) 2007-01-23 2008-07-30 华为技术有限公司 一种以太网环保护方法及装置
CN100534048C (zh) * 2007-04-27 2009-08-26 中控科技集团有限公司 分布式以太网系统及基于该系统的故障检测方法
KR20090050920A (ko) * 2007-11-16 2009-05-20 한국전자통신연구원 이더넷 링 네트워크의 비환원 모드에서의 장애 복구 방법
US8115414B2 (en) * 2008-03-12 2012-02-14 Freescale Semiconductor, Inc. LED driver with segmented dynamic headroom control
US8106604B2 (en) * 2008-03-12 2012-01-31 Freescale Semiconductor, Inc. LED driver with dynamic power management
US7825610B2 (en) * 2008-03-12 2010-11-02 Freescale Semiconductor, Inc. LED driver with dynamic power management
US8035314B2 (en) * 2008-06-23 2011-10-11 Freescale Semiconductor, Inc. Method and device for LED channel managment in LED driver
US8279144B2 (en) * 2008-07-31 2012-10-02 Freescale Semiconductor, Inc. LED driver with frame-based dynamic power management
US8373643B2 (en) * 2008-10-03 2013-02-12 Freescale Semiconductor, Inc. Frequency synthesis and synchronization for LED drivers
JP5298796B2 (ja) * 2008-11-18 2013-09-25 ヤマハ株式会社 オーディオネットワークシステム及び方法
US8675649B2 (en) * 2008-11-18 2014-03-18 Yamaha Corporation Audio network system and method of detecting topology in audio signal transmitting system
US8004207B2 (en) * 2008-12-03 2011-08-23 Freescale Semiconductor, Inc. LED driver with precharge and track/hold
US8035315B2 (en) * 2008-12-22 2011-10-11 Freescale Semiconductor, Inc. LED driver with feedback calibration
US8049439B2 (en) * 2009-01-30 2011-11-01 Freescale Semiconductor, Inc. LED driver with dynamic headroom control
WO2010087308A1 (fr) * 2009-02-02 2010-08-05 日本電気株式会社 Système de gestion de réseau de communication, procédé, programme et ordinateur de gestion
US8179051B2 (en) * 2009-02-09 2012-05-15 Freescale Semiconductor, Inc. Serial configuration for dynamic power control in LED displays
US8493003B2 (en) * 2009-02-09 2013-07-23 Freescale Semiconductor, Inc. Serial cascade of minimium tail voltages of subsets of LED strings for dynamic power control in LED displays
US8040079B2 (en) * 2009-04-15 2011-10-18 Freescale Semiconductor, Inc. Peak detection with digital conversion
US8305007B2 (en) * 2009-07-17 2012-11-06 Freescale Semiconductor, Inc. Analog-to-digital converter with non-uniform accuracy
US7843242B1 (en) 2009-08-07 2010-11-30 Freescale Semiconductor, Inc. Phase-shifted pulse width modulation signal generation
US8228098B2 (en) * 2009-08-07 2012-07-24 Freescale Semiconductor, Inc. Pulse width modulation frequency conversion
US8237700B2 (en) * 2009-11-25 2012-08-07 Freescale Semiconductor, Inc. Synchronized phase-shifted pulse width modulation signal generation
US9490792B2 (en) * 2010-02-10 2016-11-08 Freescale Semiconductor, Inc. Pulse width modulation with effective high duty resolution
US8169245B2 (en) * 2010-02-10 2012-05-01 Freescale Semiconductor, Inc. Duty transition control in pulse width modulation signaling
CN102014001B (zh) * 2010-12-08 2012-10-17 迈普通信技术股份有限公司 一种实现快速以太环网的方法及交换设备
US8599915B2 (en) 2011-02-11 2013-12-03 Freescale Semiconductor, Inc. Phase-shifted pulse width modulation signal generation device and method therefor
TWI455525B (zh) * 2011-08-09 2014-10-01 Nat Univ Tsing Hua 環狀網路之復原方法
CN103297257B (zh) * 2012-02-27 2016-10-19 北京东土科技股份有限公司 一种冗余网络的实现方法
US9411786B2 (en) * 2013-07-08 2016-08-09 Adobe Systems Incorporated Method and apparatus for determining the relevancy of hyperlinks
JP6554405B2 (ja) * 2015-11-26 2019-07-31 株式会社日立製作所 リングネットワークシステム、及び、ネットワークノード
CN109462518B (zh) * 2018-10-24 2020-10-02 新华三技术有限公司 一种环路检测的方法及装置

Citations (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5023871A (en) * 1988-04-28 1991-06-11 Hitachi, Ltd. Method of controlling the operation of stations in a ring network
JPH0630009A (ja) 1992-07-06 1994-02-04 Toshiba Corp リング型ｌａｎにおけるマスタのバックアップ方式
JPH08181708A (ja) 1994-12-21 1996-07-12 Nec Corp リングネットワークシステムのオーダーワイヤ通信制御方法
JP2003218894A (ja) 2002-01-22 2003-07-31 Mitsubishi Electric Corp ネットワークシステムおよびネットワーク構成方法
JP2004076593A (ja) 2002-08-09 2004-03-11 Honda Motor Co Ltd デシメーションフィルタを用いた内燃機関の空燃比制御装置
US6717922B2 (en) * 2002-03-04 2004-04-06 Foundry Networks, Inc. Network configuration protocol and method for rapid traffic recovery and loop avoidance in ring topologies
US6766482B1 (en) * 2001-10-31 2004-07-20 Extreme Networks Ethernet automatic protection switching
US20060215544A1 (en) * 2005-03-22 2006-09-28 Fujitsu Limited Packet repeater
US20060215546A1 (en) * 2005-03-28 2006-09-28 Fujitsu Limited Data relay apparatus and failure recovery method
US7181547B1 (en) * 2001-06-28 2007-02-20 Fortinet, Inc. Identifying nodes in a ring network
US20070204068A1 (en) * 2006-02-24 2007-08-30 Tomoyuki Oku Ring network and master node
US20080239943A1 (en) * 2007-03-30 2008-10-02 Nokia Corporation Traffic protection in a communication network
US7440397B2 (en) * 2004-03-17 2008-10-21 Fujitsu Limited Protection that automatic and speedily restore of Ethernet ring network

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2797765B2 (ja) * 1991-08-20 1998-09-17 日本電気株式会社 オーダワイヤ信号伝送装置
JPH05167599A (ja) * 1991-12-17 1993-07-02 Nec Corp 同期網リングｌａｎシステムにおけるオーダワイヤ制御方式

Patent Citations (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5023871A (en) * 1988-04-28 1991-06-11 Hitachi, Ltd. Method of controlling the operation of stations in a ring network
JPH0630009A (ja) 1992-07-06 1994-02-04 Toshiba Corp リング型ｌａｎにおけるマスタのバックアップ方式
JPH08181708A (ja) 1994-12-21 1996-07-12 Nec Corp リングネットワークシステムのオーダーワイヤ通信制御方法
US7181547B1 (en) * 2001-06-28 2007-02-20 Fortinet, Inc. Identifying nodes in a ring network
US6766482B1 (en) * 2001-10-31 2004-07-20 Extreme Networks Ethernet automatic protection switching
JP2003218894A (ja) 2002-01-22 2003-07-31 Mitsubishi Electric Corp ネットワークシステムおよびネットワーク構成方法
US6717922B2 (en) * 2002-03-04 2004-04-06 Foundry Networks, Inc. Network configuration protocol and method for rapid traffic recovery and loop avoidance in ring topologies
JP2004076593A (ja) 2002-08-09 2004-03-11 Honda Motor Co Ltd デシメーションフィルタを用いた内燃機関の空燃比制御装置
US7440397B2 (en) * 2004-03-17 2008-10-21 Fujitsu Limited Protection that automatic and speedily restore of Ethernet ring network
US20060215544A1 (en) * 2005-03-22 2006-09-28 Fujitsu Limited Packet repeater
US20060215546A1 (en) * 2005-03-28 2006-09-28 Fujitsu Limited Data relay apparatus and failure recovery method
US20070204068A1 (en) * 2006-02-24 2007-08-30 Tomoyuki Oku Ring network and master node
US20080239943A1 (en) * 2007-03-30 2008-10-02 Nokia Corporation Traffic protection in a communication network

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
International Search Report, Mar. 16, 2005, PCT/JP2005/000143, 4-pages.
RFC 3619 (RFRC3619)-Extreme Networks' Ethernet Automatic Protection Switching (EAPS) Version 1; S. Shah, M. Yip; Oct. 2003, 5-pages.

Also Published As

Publication number Publication date
US20070253330A1 (en) 2007-11-01
JP4621212B2 (ja) 2011-01-26
WO2006072996A1 (fr) 2006-07-13
JPWO2006072996A1 (ja) 2008-06-12

Similar Documents

Publication Publication Date Title
US7907516B2 (en) Node setting apparatus, network system, node setting method, and computer product
US7440397B2 (en) Protection that automatic and speedily restore of Ethernet ring network
JP4437984B2 (ja) ネットワーク中継装置及びその制御方法
US6910149B2 (en) Multi-device link aggregation
US7969915B2 (en) Technical enhancements to STP (IEEE 802.1D) implementation
US7391719B2 (en) Redundant network interface for ethernet devices
EP1655905B1 (fr) Protocol de gestion pour commutateur empilable avec attribution automatique d'identifiants de commutateur empilable
US7173934B2 (en) System, device, and method for improving communication network reliability using trunk splitting
US7505403B2 (en) Stack manager protocol with automatic set up mechanism
EP1655906B1 (fr) Protocol de gestion pour commutateur empilable avec suspension temporaire de la supervision
US8248922B2 (en) System and method for avoiding duplication of MAC addresses in a stack
US7864666B2 (en) Communication control apparatus, method and program thereof
US20070258359A1 (en) Network system, node, node control program, and network control method
JP2005130049A (ja) ノード
JP4729117B2 (ja) エッジスイッチ及びフォワーディングテーブルの書き換え方法
JP2003258822A (ja) パケットリングネットワーク及びそれに用いるパケットリングネットワーク間の接続方法
US7546496B2 (en) Packet transmission device and packet transmission method
US10644989B2 (en) Method for running a computer network
JP6061303B2 (ja) ブリッジ装置、通信制御装置、通信制御方法、ブリッジプログラム及び通信制御プログラム
JP7480675B2 (ja) 中継装置
JP4653800B2 (ja) 伝送路システム、フレーム伝送装置、伝送路システムにおける伝送路切り替え方法およびプログラム
JP5835502B2 (ja) Ｐｂｂネットワーク、ｐｂｂエッジスイッチ、フレーム転送方法および記憶媒体
JP2021064855A (ja) 電子制御装置

Legal Events

Date Code Title Description
AS Assignment

Owner name: FUJITSU LIMITED, JAPAN

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:TOCHIO, YUJI;ENDO, AKIO;REEL/FRAME:019566/0949

Effective date: 20070501

STCF Information on status: patent grant

Free format text: PATENTED CASE

CC Certificate of correction
FEPP Fee payment procedure

Free format text: PAYER NUMBER DE-ASSIGNED (ORIGINAL EVENT CODE: RMPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

Free format text: PAYOR NUMBER ASSIGNED (ORIGINAL EVENT CODE: ASPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

CC Certificate of correction
FPAY Fee payment

Year of fee payment: 4

FEPP Fee payment procedure

Free format text: MAINTENANCE FEE REMINDER MAILED (ORIGINAL EVENT CODE: REM.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

LAPS Lapse for failure to pay maintenance fees

Free format text: PATENT EXPIRED FOR FAILURE TO PAY MAINTENANCE FEES (ORIGINAL EVENT CODE: EXP.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

STCH Information on status: patent discontinuation

Free format text: PATENT EXPIRED DUE TO NONPAYMENT OF MAINTENANCE FEES UNDER 37 CFR 1.362

FP Lapsed due to failure to pay maintenance fee

Effective date: 20190315