H04L12/703

TECHNIQUE FOR DETERMINING WHETHER TO REESTABLISH FAST REROUTED PRIMARY TUNNELS BASED ON BACKUP TUNNEL PATH QUALITY FEEDBACK
20180006932 · 2018-01-04 ·

In one embodiment, a primary tunnel is established from a head-end node to a destination along a path including one or more protected network elements for which a fast reroute path is available to pass traffic around the one or more network elements in the event of their failure. A first path quality measures path quality prior to failure of the one or more protected network elements. A second path quality measures path quality subsequent to failure of the one or more protected network elements, while the fast reroute path is being used to pass traffic of the primary tunnel. A determination is made whether to reestablish the primary tunnel over a new path that does not include the one or more failed protected network elements, or to continue to utilize the path with the fast reroute path, in response to a difference between the first path quality and the second path quality.

METHOD AND APPARATUS FOR CELL UPDATE WHILE IN AN ENHANCED CELL_FACH STATE

A method and apparatus for cell update while in a Cell_FACH state are disclosed. After selecting a target cell, system information is read from the target cell including high speed downlink shared channel (HS-DSCH) common system information. A radio network temporary identity (RNTI) received in a source cell is cleared and a variable HS_DSCH_RECEPTION is set to TRUE. An HS-DSCH medium access control (MAC-hs) entity is configured based on the HS-DSCH common system information. High speed downlink packet access (HSDPA) transmission is then received in the target cell. A CELL UPDATE message is sent to notify of a cell change. The HSDPA transmission may be received using a common H-RNTI broadcast in the system information, a reserved H-RNTI as requested in a CELL UPDATE message, or a temporary identity which is a subset of a U-RNTI. The MAC-hs entity may be reset.

WIRELESS HOME NETWORK ROUTING PROTOCOL
20180006933 · 2018-01-04 · ·

A hierarchical wireless network is provided with a mesh backbone network portion and a switching tree network portion, The mesh backbone network portion includes first tier nodes each having at least one wireless link to another first tier node, The first tier nodes execute a link-state protocol for routing packets, The switching tree network portion includes second tier nodes each having a single wireless link to one first tier node and at least one wireless link to one third tier node, and third tier nodes each having a single wireless link to one second tier node. The second tier and the third tier nodes execute switching rules for switching packets,

RESILIENT PEER-TO-PEER APPLICATION MESSAGE ROUTING
20180006941 · 2018-01-04 ·

A network routing table includes destination addresses of destination applications hosted on peer nodes of a network. A primary processor registers a first destination application and a second destination application, where the first destination application is the same as the second destination application and both the first destination application and the second destination application have the same destination address. That processor also provides the peer nodes and a secondary processor with a copy of the table. When the first destination application is inactivated, all peer nodes and the secondary processor are provided with a copy of an updated routing table indicating inactivation of the first destination application and routing of the application message to the second destination application. A further application message addressed from any of the peer nodes to the destination address associated with the inactivated first destination application will be routed, via the updated routing table, to the second destination application having the same destination address as the inactivated first destination application. The secondary processor provides the copy of the routing table and the copy of the updated routing table in case of failure of the primary processor in response to a request from the querying peer node.

HIGHLY RELIABLE PATH ACCOMMODATION DESIGN APPARATUS AND METHOD

Accommodation design for wavelength and sub-λ paths in a communication network is performed. If sub-λ path accommodation is possible according to search for a wavelength path present in a single-hop logical route, the accommodation in the wavelength path is executed. If sub-λ path accommodation is possible according to search for a wavelength path present in a multi-hop logical route, a logical route is selected based on the wavelength path and the sub-λ path is accommodated in the wavelength path. Additionally, each physical route suitable for the sub-λ path accommodation is searched for. If the route can accommodate a wavelength path set in a single-hop logical route by available wavelength allocation, the sub-λ path is accommodated in the wavelength path. Furthermore, routes in consideration of overlapping of nodes, pipelines, and links and operation rate are selected based on information about the start and end nodes of each of redundant routes.

DETERMINING THE OPERATIONS PERFORMED ALONG A SERVICE PATH/SERVICE CHAIN

Presented herein are techniques performed in a network comprising a plurality of network nodes each configured to apply one or more service functions to traffic that passes the respective network nodes in a service path. At a network node, an indication is received of a failure or degradation of one or more service functions or applications applied to traffic at the network node. Data descriptive of the failure or degradation is generated. A previous service hop network node at which a service function or application was applied to traffic in the service path is determined. The data descriptive of the failure or degradation is communicated to the previous service hop network node.

Predictive routing using machine learning in SD-WANs

In one embodiment, a supervisory service for a software-defined wide area network (SD-WAN) obtains telemetry data from one or more edge devices in the SD-WAN. The service trains, using the telemetry data as training data, a machine learning-based model to predict tunnel failures in the SD-WAN. The service receives feedback from the one or more edge devices regarding failure predictions made by the trained machine learning-based model. The service retrains the machine learning-based model, based on the received feedback.

Packet Transmission Method, Node, Path Management Server and Storage Medium
20170373966 · 2017-12-28 ·

The present disclosure discloses a message transmission method, including: carrying a routing label and segment list information in a message, and transmitting the routing label and the segment list information along with the message in a message transmission process; the routing label being used for indicating that the message carries the segment list information, and the segment list information being used for representing a transmission path of the message. The present disclosure further discloses four nodes, two path management servers and a storage medium at the same time.

Systems and methods for adaptive routing
09853884 · 2017-12-26 · ·

Systems and methods for performing routing are described. For each of a plurality of messages transmitted over a primary route, a message transmission indication is received by an application. The application further receives, for at least one of the messages, a conversion indication that is based on the transmitted message. The quality of the primary route is determined based on a subset or all of the transmission indications and a subset or all of the conversion indications. Based on this determination, an alternate route is selected to replace the primary route.

Control method, information processing device, and communication system

A control method executed by an information processing device including a memory configured to store information on a plurality of temporary routes set for each kind of service, the control method includes receiving a routing request from a switch among a plurality of switches; extracting, from the memory, a temporary route corresponding to a service related to the routing request when it is determined that processing congestion of the information processing device occurs; setting the extracted temporary route for one or more related switches among the plurality of switches; determining a route corresponding to the service, based on a predetermined condition of the service, when it is determined that the processing congestion of the information processing device has subsided; and setting the determined route for the one or more related switches among the plurality of switches.