Abstract: Sets of communication modules each have a pair of ring-channel ports for a ring-configured channel in a network, a peripheral device port for peripheral device data, and dual-ring ports for an inter-ring channel for the pair of modules. First and second ones of a set of communication modules send duplicate data packets on their respective first and second rings. Responsive to duplicate data packets arriving via the rings at first and second modules in a next set within a predetermined time interval of one another, each of the next modules transmits its ring-channel received data packet out a downstream ring-channel port. Responsive to one of the duplicate packets arriving at the DRP of a module a predetermined time interval before arriving at a ring-channel port of the module, the module sends the corresponding packet received at the DRP out its other ring-channel port and its peripheral device port.

Abstract: Embodiments disclosed herein provide redundant connectivity between an Ethernet Automatic Protection Switching (EAPS) access network and a Virtual Private LAN Service (VPLS) network. A first VPLS node is provided to function as an EAPS controller node. A second VPLS node is provided to function as an EAPS partner node. The first and second VPLS nodes are linked by a pseudowire and an EAPS shared-link. Additional EAPS nodes are also provided. The additional EAPS nodes are linked to each other and one of the additional EAPS nodes is designated as a master node. Links are also established between the VPLS nodes and the EAPS nodes such that one or more EAPS rings are formed. Each EAPS ring includes the shared-link between the first and second VPLS nodes. The EAPS rings are monitored to detect link failures.

Abstract: A hierarchical ring architecture is constructed with on-chip networks. The on-chip network includes two type-0 ring nodes and two type-1 ring nodes. Multiple data transfer is provided in parallel between multiple processor cores or multiple functional units and register banks with a dynamic configuration. A low control complexity, an optimized local bandwidth, an optimized remote node path, a low routing complexity, and a simplified circuit is thus obtained.

Abstract: A system enabling inter-ring network connection when a plurality of ring networks are connected via a redundancy network, that is, a packet network system configured by a plurality of ring networks and redundancy networks linking the plurality of ring networks. This system virtually defines a plurality of virtual resilient packet ring networks among all of these packet networks and transfers packets on a designated virtual resilient packet ring network. Here, each virtual resilient packet ring network is identified by a virtual resilient packet ring network identifier allocated to each.

Abstract: The present invention discloses a method including the steps of a) confirming the status of a path corresponding to each node apparatus in the ring network by using a predetermined control information that includes a function of adding/deleting a predetermined path on a physical layer, b) instructing each node apparatus to add/delete the predetermined path by using the predetermined control information when the status of the path corresponding to each node apparatus is confirmed to be normal, c) reporting completion of the addition/deletion of the predetermined path to each node apparatus by using the predetermined control information when the addition/deletion of the predetermined path is adequately performed by each node apparatus, and d) reporting the addition/deletion of the predetermined path to a ring application function included in the ring application of the data link layer when the completion of the addition/deletion of the predetermined path is adequately reported by each node apparatus.

Abstract: An approach for determining shortest paths within a multiple ring network. Topology information associated with a ring network that includes a plurality of rings is retrieved, wherein each of the rings includes one or more nodes. A start node and an end node associated with the ring network are selected. A minimum set of one or more interconnected rings of the ring network is determined. One or more shortest paths between the start node and the end node are determined based on the determined minimum set.

Abstract: An embodiment is directed to a method for selectively routing a DNS request in which a DNS request to translate a domain name is received from a local client device. The DNS request is directed to a remote DNS server on a remote network. A link status to the remote network is identified. If the link status indicates that a connection to the remote network is not possible, the DNS request is routed to a locally embedded DNS server. If the link status indicates that a connection to the remote network is possible, the DNS request is routed to the remote DNS server on the remote network.

Abstract: The invention relates to a rapid response method for the failure of a link between two routing domains in a packet-oriented network. Once the failure of a link has been identified, substitute routes are provided for the interrupted routes by the local selection of alternative routes and by the propagation of messages along the substitute routes. In contrast to conventional inter-domain protocols such as the BGP (Iborder gateway protocol) the transmission of messages and the associated modification to the routing only involves routing domains that lie along the replacement routes. In one embodiment, a network-wide propagation of messages takes place if the failure of the link represents a persistent breakdown. As a consequence, optimal routes are re-determined in the entire network. The invention provides breakdown compensation that is appropriate for temporary breakdowns and prevents instabilities that occur as a result of the use of conventional inter-domain protocols.

Abstract: In a ring redundant communication path control method, each of transfer apparatuses periodically transmits an inspection frame for inspecting a communication path, detects a failure of the communication path when the inspection frame is not received for a fixed time, transmits a non-arrival notification frame for notifying that the inspection frame has not arrived yet, and detects a failure of the communication path when the non-arrival notification frame is received.

Abstract: A method and system for provisioning a Resilient Packet Ring (“RPR”) over a Wavelength Division Multiplexing (“WDM”) network is disclosed. A plurality of stations send data packets to each other over a dual ring fiber optic link. The data packets travel over the dual ring fiber optic link at a unique wavelength to distinguish the different data packets. When one station of the plurality of stations detects a location of a failure in the WDM network, the station identifying the location of the failure either notifies all stations of the plurality of stations of the location of the failure or notifies only the stations of the plurality of stations abutting the location of the failure. If all stations of the plurality of stations are notified of the failure, all stations steer data packets sent towards the location of the failure away from the location of the failure.

Abstract: Network node discovery is implemented using parameters reflecting network-specific characteristics. Estimates of the number of active nodes in a network are computed based on the presence of dead time (e.g., due to clock latency, device driver delays, etc.), network topology, packet size, network capacity, a tolerable network overload threshold, and other characteristics. A network node enumeration process is therefore parameterized to incorporate consideration of such characteristics. A damping factor that incorporates dead time to set a lower bound for an estimate of remaining active nodes in a network is one example of a network-specific parameter.

Abstract: Methods and systems for fast and reliable network recovery from multiple link failures. In accordance with one example of the method, a master node receives a request from a transit node having a blocked port to open the blocked port for data forwarding, wherein the blocked port is associated with a restored link. The master node starts a health-check timer and transmits a health-check message on its primary port to determine that all failed links of the network are restored. Upon determining that the health-check message is received at its secondary port, the master node transmits a message to each transit node indicating that all failed links are restored. Upon determining that the health-check message is not received at its secondary port before the health-check timer lapsed, the master node transmits a message to the transit node to open the blocked port associated with the restored link for data forwarding.

Abstract: A system and method are provided for designing ring cover candidates for a network. A ring cover candidate is generated based on configuration information and traffic demand information associated with the network. The ring cover candidate includes a group of rings, where each ring includes a group of network spans. In some implementations consistent with the principles of the invention, a report including characteristics of a ring cover candidate may be generated.

Abstract: A method for realizing many to many protection switching operation of ring network including: determining information of a switch request of M:N protection switching of the ring network, a destination node of the switch request, a source node of the switch request, a flag of long or short path, a status of bridging and switching, a channel number of protected working channel, and utilization condition of protection channels; carrying the information in a signaling and transferring it on the ring network; upon receipt of the signaling, performing the M:N protection switching of the ring network by a ring network node according to the information in the signaling. Therefore, the format of APS protocol signaling provided in this invention includes the information necessary for protection switching. This invention also provides an effective transmission approach of APS protocol signaling for protection switching.

Abstract: A ring network redundancy method is disclosed. If somewhere the connection of the ring network is damaged and broken, then the state of an initially blocked port that has been assigned as blocked is set as forward so as to keep the network functioning. And after the problem is repaired, a newly assigned blocked port is then assigned so that there is now once more a blocked ported; wherein the position of this newly assigned blocked port is set directly at one of the two ends of the repaired network line. Thereby the resettling time for the position of the newly assigned blocked port is reduced, thus the ring network system becomes much more stable.

Abstract: The present invention provides a method and apparatus for transmitting control signal of Resilient Packet Ring (RPR) Medium Access Control (MAC), including: encapsulating a control signal of RPR MAC interface to be transmitted into an RPR data frame of predefined format, and directly sending it to a receiving unit through a standard interface. In this invention, an RPR data frame of predefined format is utilized to transmit signals between an RPR MAC and a receiving unit, e.g., an RPR client, via standard interfaces, which may avoid the increase of unstable factors affecting signal transmission and hardware cost caused by the appending of hardware devices in the standard interfaces. Thus, the reliability of signal transmission is enhanced, and the hardware cost of communication system is reduced.

Abstract: In a system having distributed components arranged in a logical ring structure, each component monitors only their respective neighboring component in the structure and the condition of the neighboring component is determined. If a component determines a condition of its neighboring component that corresponds to a predefinable condition, the component informs the other components of the system of the predefined condition of the neighboring component.

Abstract: A method for communication includes configuring a plurality of ring nodes to communicate over a communication network that includes two or more overlapping communication rings, each ring including two unidirectional ringlets in mutually-opposite directions. A data packet including one or more header fields is accepted at an ingress ring node. An egress ring node to which the data packet is to be forwarded by the ingress ring node is determined. A subset of the rings including one or more common rings that are connected to both the ingress and egress ring nodes is identified. A ringlet of a ring among the one or more common rings is selected responsively to a respective value of at least one of the header fields of the packet. The data packet is forwarded from the ingress ring node to the egress ring node over the selected ringlet.

Abstract: In an embodiment, a method is disclosed for operating a network having a group of bridges connected together to form a ring, each bridge having two ports assigned to the ring to form a group of ring ports. The claimed embodiment includes forwarding information through the ring according to one or more spanning tree instances, each instance designating one of the group of ring ports as a respective alternate port that is in a state of discarding. Responsive to learning of a failure by a bridge within the ring, a determination is made, for each spanning tree instance, whether the bridge contains a respective alternate port and if the bridge contains a respective alternate port, changing the state of the respective alternate port to forwarding.

Abstract: In a multi-ring network with a plurality of rings to which RPR is applied connected, high-speed failure recovery is enabled when a failure occurs between the rings. The contact nodes 700-1 and 700-3 connected to the living inter-link 505 periodically transmit and receive a KeepAlive signal to/from each other. Then, when a KeepAlive signal fails to arrive for a fixed time period, determination is made that the inter-link 505 develops a fault to broadcast-transmit an inter-link failure notification RPR-MAC frame indicative of failure occurrence on the inter-link to each node. A contact node as a transmission source of the inter-link failure notification RPR-MAC frame and each node having received the inter-link failure notification RPR-MAC frame immediately flush learning contents of their own learning data bases. A contact node connected to the spare inter-link 506 switches the spare inter-link 506 to a forwarding state.

Abstract: The invention relates to a method for tolerating the breakdown and/or decoupling of at least one network node in a communication network used for controlling and/or adjusting the movement of a plurality of machine parts, for example the rotation bodies in a printing machines, machine tools and other production machines, wherein the network is operated according to a closed single or multiple ring structure, in which each node communicates with the transmitter or the port of a first adjacent node by means of a receiver or a first port and with the receiver or the port of a second adjacent network node by means of a transmitter or a second port, the closed ring structure is preserved in the case of the breakdown or decoupling of at least one node, at least one network node is coupled to the network by means of a data path switching device which is actuated, in the case of the breakdown or decoupling of said node, in such a way that the communicating nodes, which exist in the network and are arranged next to eac

Abstract: A half-duplex communication network comprises a plurality of communication links, each link being configured a priori to communicate in one direction; and a plurality of nodes, each node coupled to a first and second direct neighbor nodes and a first and second skip neighbor nodes via the plurality of communication links. Each node comprises propagation logic adapted to arbitrate conflicts between concurrent messages based on at least one of higher level policies and a comparison between a priority of each message, wherein each node is adapted to communicate a message without waiting to determine if another node is transmitting another message with a higher priority.

Abstract: Methods are provided for determining a master node on a ring network. According to one embodiment, a first node on the ring network initiates circulation of an arbitration token by (i) determining an arbitration token timeout period has elapsed and (ii) transmitting the arbitration token to a neighboring node. Upon receipt of the arbitration token by a node, it determines its relative priority by comparing its ID to an ID field of the arbitration token, initialized by the first node. If the node is determined to be higher priority, then it overwrites the ID field and retransmits the arbitration token onto the ring network. If the node is determined to be lower priority, then the node retransmits the arbitration token without overwriting the ID field. If the node is determined to be of equal priority and the node is the first node, then it assumes the master node role.

Abstract: The range delay of each of a plurality of user devices of an HFC is monitored. If the delay of a number of devices shifts by about the same amount and at about the same time, then the number of devices having such a shift is compared to a predetermined threshold. If the number exceeds the threshold, it is assumed that a leg of a fiber ring in the HFC has been severed, and a ring switch is determined to have occurred. Upon this determination, granting of bandwidth requests to a group of user devices is suspended, and a ranging and register process for all devices in the group begins. The group may comprise all user devices affected by the broken fiber ring. Following ranging and registering, granting of bandwidth requests to the affected devices begins according to a normally-provisioned request grant schedule.

Abstract: A method for communication includes, in a communication network that includes multiple ring nodes arranged in at least first and second ring networks that are connected by two or more of the ring nodes serving as interconnect nodes, accepting at the two or more interconnect nodes respective copies of a data packet, which is sent from a source user node connected to the first ring network. An attribute is extracted from the respective copies of the data packet at each of the interconnect nodes, and a predefined mapping function is applied to the extracted attribute so as to select a single interconnect node for forwarding the data packet to the second ring network. A single copy of the data packet is forwarded to the second ring network only from the selected interconnect node, while refraining from forwarding other copies from the other interconnect nodes.

Abstract: A system and methods of detecting a loop in a network having at least one access point with a first interface and a second interface, at least one switch with multiple ports, and at least one client with a first interface and a second interface, including: the access point first interface intermittently transmitting a loop check packet to the switch; the switch receiving the loop check packet at one of the ports and transmitting the loop check packet to the client through another one of the ports; the client first interface receiving the loop check packet; the client second interface retransmitting the loop check packet to the access point; and the access point second interface being configured to receive the retransmitted loop check packet. The access point detects a loop when the access point second interface receives the retransmitted loop check packet. Other embodiments eliminate the loops in various ways.

Abstract: A network node discovery method allows multiple enumerators to concurrently accept and interpret the same enumeration responses from responder nodes on a network. In this manner, the responder nodes do not have to issue individual responses for each enumerator. Each responder maintains a discovery state and one or more per-enumerator session states to manage when the responder should transmit enumeration responses. The enumeration, therefore, proceeds at a target network load, irrespective of the number of enumerators present, and completes in a short time by making efficient use of the network capacity available. Furthermore, an enumerator can determine that it need only wait for responses solicited by other enumerators, rather than requesting them, thereby reducing network traffic in the presence of many concurrently enumerating nodes.

Abstract: A system and method for rerouting circuits on a SONET, SDH or similar ring without disrupting service. In one embodiment, the system includes: (1) a route design subsystem adapted to identify, for the circuits, alternative routes that are subject to an alignment constraint and increase an objective value associated with the ring and (2) a path migration subsystem, associated with the route design subsystem, adapted to determine a hitless migration sequence that allows the alternative routes to be employed.

Abstract: A system and method providing fault resilient multicast services using a network topology in which a source node communicates with a plurality of receiver nodes via at least two disjoint paths in which at least one receiver node is provisioned according to a 1+1 protection mechanism.

Abstract: In one embodiment, a method includes configuring a first node, located at an edge of a core network and connected to an access ring, with a maintenance end point for a virtual local area network on a port connecting the first node to the access ring. The first node operates in an active mode for the virtual local area network and is in communication with a second node located at the edge of the core network and connected to the access ring. The method further includes receiving and processing at a processor at the first node, continuity check messages from access nodes on the access ring, synchronizing the first node with the second node, and communicating from the first node to the second node to initiate switching of the second node from a backup mode to the active mode for the virtual local area network upon identification of a failure.

Abstract: A method of managing faults in a ring network may include configuring a ring network to be in a “horseshoe” topology by disabling a communications link from distributing media between a selected pair of adjacent nodes while allowing other communications or non-related media to continue to be distributed via the adjacent nodes. In the event of a failure, the disabled communications path may be re-enabled, and first or second backup communications paths may be employed, where the first backup communications path may use primary connections between adjacent nodes used for primary communications paths normally used to carry the media, and the second backup communications paths may use secondary connections between non-adjacent nodes. The disabled communications path may be dynamically moved in a logical or physical manner in an event of a communications link or node failure to maintain a “horseshoe” topology in the ring network.

Abstract: Implementations and techniques for allocating bandwidth in a resilient packet ring network by a PI-type controller are generally disclosed.

Abstract: A packet ring network system is disclosed which enables plurality of packet rings to perform packet transfer via a plurality of links while preventing multiple reception of packets and broadcast stream in a normal state where no failure has occurred. The packet ring network system includes a first packet ring and a second packet ring, each packet ring having a plurality of inter-ring connecting nodes, and each of the plurality of inter-ring connecting nodes in the first packet ring is connected with each of the plurality of inter-ring connecting nodes in the second packet ring in a one to one relationship so that the packet rings are connected with each other. When one of the inter-ring connecting nodes receives a packet to be broadcasted via a link connecting the first and second packet rings the node performs bidirectional flooding of the broadcast packet such that the packet arrives at a predetermined cleave point, and the node uses the source address of the other node so as to falsify the source.

Abstract: A communication system that enhances the efficiency of network operations in response to a request for a transfer bandwidth increased locally. A physical links are installed at a span where a transfer bandwidth is locally increased in a network, and the physical links can cover the increased transfer bandwidth. A load sharing section regards the physical links as one virtual link called a link aggregation, and performs load sharing and outputs data to the plurality of physical links. A collecting section collects data transmitted through the plurality of physical links and outputs the data according to the destination of the data. Any nodes are connected by a link aggregation to configure an RPR ring network having non-uniform transfer bandwidth.

Abstract: A relay apparatus includes a MAC (Media Access Control) address learning table for recording transfer destinations for frames. The relay apparatus is connected to other relay apparatuses to compose a network of a ring redundancy method. The relay apparatus includes a port move detecting circuit for detecting a port move which occurs in a case where a frame arrives from other than a path learned in the MAC address learning table on a path changing on ring redundancy.

Abstract: A method for communication includes sending first data over a first communication link to a destination communication system at a first data rate, which can be varied. Second data, including at least a portion of the first data, is sent over a second communication link from the source communication system to the destination communication system at a second data rate, which can be varied. First and second data rates of the respective first and second communication links are dynamically set. At least the portion of the first data is selectively extracted from one of the first and second data at the destination communication system. In some embodiments, the first data equals the second data, and the data is extracted without data loss.

Abstract: A branch element is specified for use in a communication network, whereby in the interplay of two branch elements designed according to the invention, a cleared fault in a communication medium stretching between the two branch elements, in particular a line, with a power supply cable and a current return cable, can be recognized with the help of a test current, which can be supplied by supplying test equipment—preferably provided in each branch element—and which can be detected using terminating test equipment—likewise preferably provided in each branch element—and whereby each terminating test equipment is designed and/or provided to deactivate a bus termination assigned to the respective branch element when the test current is detected.

Abstract: According an aspect of the embodiment, there is provided a method for accommodating signal paths to a ring network. A demand chain is defined as a series of traffic demands in which each traffic demand shares one of the pair of terminal nodes pointed thereby with at least one adjacent traffic demand and the number of pairs of terminal nodes pointed by traffic demands in the series of traffic demands is maximized. Each traffic demand of the demand chain is corresponded to a demand accommodating route which is defined as a route between the pair of terminal nodes on the ring network pointed by the each traffic demand and arranged in a predetermined rotation direction on the ring network. Then, signal paths required by traffic demands each pointing a pair of terminal nodes both included in the demand accommodating route chain are accommodated to the demand accommodating route chain.

Abstract: A protection method in a packet transport network is provided. A protection path is established for a service data flow borne on a shared protection ring in the method, where the protection path includes a wrapping protection path and a steering protection path. Firstly, a first service data flow is sent through the wrapping protection path. Then, a service data flow node stops sending a second service data flow subsequent to the first service data flow to the wrapping protection path, and buffers the second service data flow. When the first service data flow completely passes by the service data flow node again, the buffered second service data flow is switched from the wrapping protection path to the steering protection path.

Abstract: Delivering multicast data traffic over a communication network includes a first network node delivering multicast data traffic to second network nodes. The first and second network nodes are connected by a transmission network in a ring architecture and implement a point-to-multipoint layer 2 protocol. A method includes at the first network node: collecting alarms signals indicative of a failure along the whole ring and of the second network nodes. Based on a current state of the alarm signals, delivering the multicast data traffic either in a first delivery direction along the ring, or in a second delivery direction along the ring opposite to the first delivery direction, or in both the first and second delivery directions. At each of the second network nodes: collecting alarm signals indicative of a failure of the transmission network locally to the second network node and of the second network node.

Abstract: The present invention discloses a failure processing method for a slave port of a master node in an Ethernet ring system, comprising the following steps of: (1) the master node detecting a state of a link connecting directly the slave port; and (2) setting the slave port in a blocked state if the link connecting directly the slave port of the master node fails; and keeping the slave port in the blocked state during the failure of the link.

Abstract: A ring-based packet transmitting method, network system and node equipment are provided. The ring-based packet transmitting method includes the following steps: a received user packet is encapsulated; one or more PBB or PBT rings are detected for fault; when a fault is detected, a PBB or PBT ring having no fault is selected to send the encapsulated packet to a target node equipment according to a corresponding relation between virtual media access control (VMAC) addresses and ports. The network system includes at least two node equipments interconnected with one or more node equipments respectively through ports provided thereon to form one or more PBB or PBT rings. The node equipment includes at least two ports and a data processing unit. Thus, packet transmission on the PBB or PBT ring is achieved.

Abstract: A network for an industrial control system employs a ring topology that is normally opened by a ring supervisor at the ring supervisor. Upon failure of the network, the ring supervisor reconnects the ring to provide an alternative transmission path around the failure point. High speed operation is reconciled with the ability to use commercial switching integrated circuits through a dual communication channel of communicating a network state as either closed or open using both high-speed hardware handled beacon frames and low-speed software processed announce frames.

Abstract: The instant disclosure generally relates to a method and apparatus for determining path loss by combining geolocation with interference suppression. In one embodiment, the disclosure relates to a method for determining a path loss value between a receiver at a first location and a wireless mobile device at a second location. The method includes the steps of: (a) locating the mobile device at the second location and (b) at the receiver: (i) receiving a first signal transmitted by the mobile device at the second location; (ii) determining a received signal level of the first signal; (iii) receiving a second signal comprising data from which a transmitted signal level of the mobile device at the second location can be determined; and (iv) determining from the first and second signals the path loss value between the receiver and the mobile device at the second location.

Abstract: The invention described herein provides a system and method for fault isolation and auto-recovery in chained loop or ring networking systems (103). According to aspects of the method and the associated path-selection algorithms described, fault isolation and auto-recovery operations can be handled locally on each node on a loop and the overall fault recovery time under a link failure condition can be minimized. In addition, the method allows for auto-recovery operations that are transparent to the rest of network and to remote hosts.

Abstract: The present invention discloses a method and device for implementing Och-SPRing in Wavelength Division Multiplexing system. The method includes: in the node of the optical network system, setting two switches in each working path and its backup path that pass through the node, each of which includes two input ports and one output port; when receiving signals, controlling the first switch to selectively accept the downlink service signals sent from the working path or the backup path; when sending signals, sending the uplink service signal sent from the local device respectively to one output port of uplink direction in the working path and the second switch; controlling the second switch to choose one signal among the local uplink service signal and the downlink service signal sent from the backup path to input into the uplink direction of the backup path. The method of the present invention can largely reduce construction cost of the system, save optical power budget, and improve OSNR.

Abstract: This invention provides a tool for reliability evaluation and performance analysis of an IP backbone network by using the network packet loss ratio as the main measurement. A queuing model and algorithm is presented for calculating packet loss at congested interfaces or links. A reliability model is presented for considering network hardware component failures such as router failures, ATM switch failures, and physical link failures. Based on the measurement and models presented, a network reliability and performance (NetRAP) apparatus calculates IP network reliability and performance measurements. The NetRAP apparatus uses the network topology, a traffic matrix, and the reliability parameters of a network as inputs and calculates the network packet loss ratio and sigma score, and provides a list of heavily congested links under non-failure or different single failure conditions.

Abstract: RSVP-TE Enhancement for MPLS-FRR Bandwidth Optimization is a method of RSVP-TE protocol enhancement for optimizing network resources when FRR is protecting LSP traffic in a topology where the bypass LSP tunnel traverses the original previous hop(s) of the protected LSP. The node providing FRR protection, the PLR, will use the enhanced message TLVs to report to the nodes all the way back to the HE node. The node(s) on the original path prior to the PLR node can check if there is a better alternative bypass tunnel to use to provide FRR from a network resource optimization perspective (such as using the bypass tunnel from the HE node in a ring topology to reduce the traffic in the ring).

Abstract: The present invention is directed towards systems and methods of routing payload data in a communications system. Specifically, the payload data is routed using a source address. The destination node(s) utilize a dynamically-stored look-up table indicating the source address when the payload data is to be dropped at that node(s).

Abstract: A method and apparatus for managing a loop network, the loop network (200) including at least one loop (206, 208), a plurality of devices (210) connected to the at least one loop (206, 208) via ports (211, 212), wherein at least two of the devices are initiators (207, 209). The method includes each initiator (207, 209) sending a frame to all other initiators (207, 209) in the loop network (200) identifying any ports (211, 212) which should not be used. Each initiator (207, 209) merges the information from all other initiators (207, 209) with its own information identifying any ports (211, 212) which should not be used resulting in all the initiators (207, 209) generating a single list of ports (211, 212) to be used which is consistent across all the initiators (207, 209). Each initiator (207, 209) applies an algorithm (300) to determine a common set of ports (211, 212) to be used by all the initiators (207, 209) and to balance port accesses across the loop network (200).