Abstract:
A communications router (6) is provided with an add-on device (7) for diverting data traffic over a replacement connection (70, 80) when a primary connection route (60) meets a failover criterion. Traffic addressed to an allocated network address associated with the primary connection (60) is diverted to a network termination of the replacement connection (70) by a routing function (31) if the replacement connection (70) has been authenticated by an authentication system (35). Authentication is provided by setting up an association between the internet IP address of the router (6) when addressed through the link (60), and a network identity of the add-in unit (7). This may achieved by having the add-on unit (7), when first installed, transmit its identity of a SIM over the fixed line connection (60) to the authentication system (35), which can then associate that SIM identity with the network address from which it has been received so that during a subsequent failover condition traffic addressed to the fixed-line network address can be diverted to the replacement connection, thereby allowing the same network address to be used during the failover condition.
Abstract:
Residence time is a variable part of the propagation delay of the packet. Information about the propagation delay for each transient node can be used as performance metric to calculate the Traffic Engineered route that can conform to delay and delay variation requirements. In an exemplary embodiment, a computing device uses special test packets to measure residence time. The computing device calculates routes to direct special test packets to one or more nodes. A node may calculate the residence time metric, such as a residence time variation (RTV), or residence time (RT) per ordered set of ingress and egress interfaces of the node. The computing device may also collect the residence time metric per test set from each node and may use this information to calculate the Test Engineered route.
Abstract:
The present disclosure is related in general to network management providing method and system for determining data flow paths for communicating data packets/bits in a communication network. A network management system determines number of data flow paths required between source and destination network element within the communication network and determine a shortest data flow path between them using predefined data flow path determining techniques. Further, zero weightage is assigned to each edge of the total number of data flow paths excluding each edge of the shortest data flow path to obtain modified graph of the communication network. Using the modified graph, alternative shortest data flow paths are determined. The shortest and the alternative shortest data flow paths are determined without modifying existing nodes i.e. without splitting nodes in data flow path, thereby reducing complexity and time taken in determining the shortest and the alternative shortest data flow paths.
Abstract:
Methods and apparatuses for enabling nonstop routing are described. One or more transport protocol packets are received (4a) at a first network element, NE, 101A from a peer network device 102, where the one or more transport protocol packets include a routing protocol message associated with a routing protocol session established between the first network element 101A and the peer network device 102. The routing protocol message is retrieved (4b) and a synchronization message is transmitted (5) to a second network element 101B, where the second network element 101B and the first network element 101A are part of a redundancy system 101. The synchronization message includes the retrieved routing protocol message, an identifier of a transport protocol session associated with the routing protocol session, and current transport protocol states associated with the transport protocol session. Flow then moves to operation (6a) at which NE 101B transmits an acknowledgment message to the active NE confirming the receipt of the synchronization message. The standby NE 101B updates (6b) routing protocol information and uses the mapping information stored at the NE to update the local transport protocol session associated with the transport protocol session of the active NE 101 A identified in the synchronization message. Thus instead of transmitting all transport protocol packets (TCP segments) received at the active NE 101A to be processed by a transport stack (TCP stack) of the standby NE 101B for determining current transport states and/or updated routing protocol information (transmitted within the TCP segments) as performed in prior art techniques, the embodiments of the present invention process the transport packets at the active NE 101A and transmit only relevant information that may be needed to seamlessly transition the TCP sockets from the NE 101A to the NE 101B when a switchover occurs in the redundancy system.
Abstract:
In an example method, a computer system retrieves a plurality of data items. Each data item indicates a respective network route on the network. The computer system determines a route automaton based on the plurality of data items. The route automaton includes a representation of the network routes. The computer system determines one or more routing policies on the network based on the route automaton. The method can be used to detect one or more routing policies on a network.
Abstract:
Methods, apparatuses, systems, devices, and computer program products directed to common transport of backhaul and fronthaul traffic (collectively "crosshaul traffic") are provided. Among new methodologies and/or technologies provided herein is a crosshaul common frame (XCF) adapted to carry, among other information, new control information for enabling optimized forwarding and/or management of any packet-based crosshaul traffic. The optimized forwarding and/or management may be enhanced with segment routing adaptation of the XCF. And pursuant to the XCF being MAC-in-MAC protocol compatible, not only can the forwarding of the XCF be carried out by packet switching elements supporting common XCF-domain forwarding and management controls (and hence, capable of utilizing the new control information), but also by legacy MAC-in-MAC protocol (Ethernet) switches not under the XCF-domain common forwarding control.
Abstract:
A method for establishing a TCP connection between a first end-point (1) and a second end-point (3) aims at reducing TCP end-to-end transfer time and thereby accelerating the data transfer. The method comprises: establishing a first TCP connection between said first end-point (1) and said second end-point (3), said second end-point (3) dynamically deciding on redirecting said first TCP connection via a chain of proxies (5) that interconnects said first and said second end-points (1; 3), in case of a redirection decision by said second end-point (3), said first end- point (1) establishing a new TCP connection with the first proxy (5-1) of said chain of proxies (5), and establishing a segmented TCP connection between said first end-point (1) and said second end-point (3) via said chain of proxies (5) and transferring data between said first end-point (1) and said second end-point (3) through said chain of proxies (5).
Abstract:
In one implementation, the present invention provides a mechanism for balanced ad-hoc network formation. To achieve the for balanced ad-hoc network formation, the present invention sends the metric information with DIO control message. A new metric container type is introduced in RPL to hold the metric information, and select the parent with minimum path cost, and switch the parent with minimum path cost, as per the defined logic. A stateless metric considers that the average traffic flow from each node is approximately same. The stateless metric directly uses the number of routing table entries (RT size ) to decide which path to use. A stateful metric, wherein the node keeps a track of packets processed per second by itself. For stateful metric, the node maintains packets processed rate (PPR) variable, which is then used as the metric.
Abstract:
A system and method for intercepting intra-network traffic for smart appliance behavior analysis. A network traffic hub is configured to intercept network traffic between a switch and a router. A smart appliance sends a message to the router, such as a DHCP request when the smart appliance joins the network. The router sends a response to the smart appliance. The network traffic hub intercepts and modifies the response to instruct the smart appliance to send all future intra-network traffic through the network traffic hub and the router. In some embodiments, the network traffic hub alters a network mask in the response message to instruct the smart appliance to send traffic through the network traffic hub. The network traffic hub then extracts data from the network traffic and uses that data for behavior analysis of smart appliances.