Abstract:
Embodiments of the present invention solve problems experienced by mesh networks concerning loop formation where two nodes are connected by both a wired and wireless link. The present invention prevents or 'breaks' a loop that would otherwise result in continually repeating and delayed network data transmission.
Abstract:
A method ensures that multicast packets follow the same loop-free path followed by unicast packets in a packet communication network. The communication network includes at least one first area interconnected through at least one area border node ("ABN") to a second area. Each ABN has a first level port connected to each first area and a second level port connected to the second area. Each multicast packet forwarded includes a header having a root-id identifying a root of a multicast tree. A data packet is received at an ABN. Responsive to receiving a multicast packet at a second level port of an area border node, the root-id of the multicast packet is examined and if the multicast packet is to be forwarded over at least one of the first level ports, a different root-id is substituted into the packet before the packet is forwarded over the first level port.
Abstract:
A method and a node are provided to detect routing loops in mobile Internet Protocol networks. A legitimate mobile node may register at a home agent by sending a binding message carrying a home address and a care-of address. The home agent stores the addresses in a binding cache entry. It is possible for a malicious node to send a binding message to one HA, resulting in a HoA being assigned by the HA. Then the malicious node may use this HoA as a CoA for registration at another HA. If the malicious MN uses the HoA assigned by the second HA as a CoA and updates the binding at the first HA, a routing loop is created. The present invention verifies the presence of a routing loop responsive to the receipt of the binding message. If a routing loop is detected, the binding cache entry is deleted.
Abstract:
Certain aspects of the present disclosure provide methods for detecting a routing loop between at least two home agents utilizing the mobile internet protocol (MIPv6) standard. In a first method, the home agent sends a test message to the last care of address associated with a mobile node and receives a reply if there is no loop. In a second method, the home agent parses a packet and checks if the address of any of the inner headers matches the address of the home agent to find a loop between home agents.
Abstract:
A device and a method for managing data communications of a device in a network are provided. The method includes establishing a secure communication connection for the device with a service provider via a tunnel mode connection. A determination is then made whether the device is part of a trusted domain including one or more other devices. If the device is part of a trusted domain including one or more other devices, then a direct communication connection is established, which bypasses the tunnel mode connection for only the devices that are part of the same trusted domain. Communications with any devices which are not part of the same trusted domain are routed via the tunnel mode connection.
Abstract:
Forwarding loop prevention apparatus and methods are provided. After a communication traffic block such as a packet is received, a determination is made as to whether the packet is to be broadcasted to a number of communication devices. If the packet is to be broadcasted, the packet is modified to include an indication that the packet is reflected, and the packet is broadcasted. A device that receives the broadcasted packet determines whether it is reflected and whether the identifier is associated with the device. If the packet is reflected and the identifier is associated with the device, the device discards the packet. Otherwise it forwards the packet. Forwarding loops may instead be avoided without modifying packets, based on an amount of time elapsed between sending and receiving a packet.