H04L12/755

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.

DATA PROCESSING
20180013673 · 2018-01-11 ·

A method of routing messages includes receiving a request message from an originating device to be forwarded to one of a plurality of target devices, the request message having a first network address as a source address identifying the originating device. The first network address of the request message is dynamically mapped to a second network address of a selected target device, and the first and second network addresses are stored in association with each other as address mapping information. The method also includes forwarding the selected target device using the second network address. The routing device receives from the target device an error message in relation to the request message, and identifies the originating device which originated the request message using the address mapping information and the second network address of the target device which issued the error message.

DIRECTED ACYCLIC GRAPH OPTIMIZATION FOR FUTURE TIME INSTANCE REQUESTED BY A CHILD NETWORK DEVICE
20170373964 · 2017-12-28 ·

In one embodiment, a method comprises receiving, by a network device within a tree-based topology rooted by a root network device, a request message from a child network device for generating an optimized tree-based topology for a future use by the child network device at a future time instance; the network device executing an objective function for generating the optimized tree-based topology for the future use by the child network device; and the network device providing network communications, for the child network device, at the future time instance using the optimized tree-based topology.

2 level routing in CCN

Exemplary methods at a content centric networking (CCN) gateway located at an autonomous system (AS), wherein the CCN gateway is communicatively coupled to a CCN domain name system (DNS) server, include receiving, on a first face, a first interest message comprising of a first content name identifying a first content being requested by the first interest message. The methods include in response to determining the first content is not located at the AS, determining a first remote AS name that identifies a first remote AS where the first content is located, generating a first 2-level (2L) content name comprising of the first remote AS name and the first content name, forwarding the first interest message comprising of the first 2L content name, and in response to receiving a first content object (CO) message comprising of the first 2L content name and the first content, forwarding the first content.

Technologies for distributed routing table lookup

Technologies for distributed table lookup via a distributed router includes an ingress computing node, an intermediate computing node, and an egress computing node. Each computing node of the distributed router includes a forwarding table to store a different set of network routing entries obtained from a routing table of the distributed router. The ingress computing node generates a hash key based on the destination address included in a received network packet. The hash key identifies the intermediate computing node of the distributed router that stores the forwarding table that includes a network routing entry corresponding to the destination address. The ingress computing node forwards the received network packet to the intermediate computing node for routing. The intermediate computing node receives the forwarded network packet, determines a destination address of the network packet, and determines the egress computing node for transmission of the network packet from the distributed router.

MODELING A BORDER GATEWAY PROTOCOL NETWORK
20170346727 · 2017-11-30 ·

Methods and systems for generating a model of a transit autonomous system (AS) network. The method comprises analyzing the routing information base for each border gateway protocol (BGP) node in the AS and storing, for each BGP router, (i) a routing table; and, (ii) a prioritized list of next hops for each prefix based on the appropriate best path algorithm. The model can be used to (a) determine how traffic will be routed through the transit AS in steady state and failure scenarios (e.g. when one or more links or nodes/routers have failed); and/or (b) determine how traffic should be routed through the transit AS (e.g. determine the best routes) in steady state and failure scenarios. The optimal routing of the traffic in a particular steady state or failure scenario (as determined by the model) can be compared to the actual routing of the traffic in the steady state or failure scenario (as determined by the model) to determine what changes to make to the transit AS to achieve the optimum routing.

Method and base station for routing messages of a positioning protocol in a wireless network

Methods and apparatuses are provided that facilitate routing of messages of a positioning protocol, such as long term evolution (LTE) positioning protocol annex (LPPa). A positioning server can determine a network area identifier of one or more messages based at least in part on an identifier of a base station associated with the one or more messages. Based at least in part on the network area identifier, the positioning server can provide the one or more messages to an intermediate network node corresponding to the one or more base stations, such as a mobility management entity (MME). MME can similarly provide the one or more messages to an optional gateway between it and the one or more base stations based at least in part on receiving the network area identifier in the one or more messages. In addition, a base station can update positioning information with the positioning server.

Method, device, and computer storage medium for implementing IP address advertisement

Disclosed are a method, device, and computer storage medium for implementing IP address advertisement. An advertisement for controlling LSA11 and an advertisement control switch for flooding are added into a router. The router performs, according to a state indicated by the advertisement control switch, IP address advertisement or flooding for LSA11 encapsulated with an IP address.

Die-stacked device with partitioned multi-hop network

An electronic assembly includes horizontally-stacked die disposed at an interposer, and may also include vertically-stacked die. The stacked die are interconnected via a multi-hop communication network that is partitioned into a link partition and a router partition. The link partition is at least partially implemented in the metal layers of the interposer for horizontally-stacked die. The link partition may also be implemented in part by the intra-die interconnects in a single die and by the inter-die interconnects connecting vertically-stacked sets of die. The router partition is implemented at some or all of the die disposed at the interposer and comprises the logic that supports the functions that route packets among the components of the processing system via the interconnects of the link partition. The router partition may implement fixed routing, or alternatively may be configurable using programmable routing tables or configurable logic blocks.

PLUG AND PLAY IN A CONTROLLER BASED NETWORK

In an example, there is disclosed an example of a system and method for plug and play in a controller based network. Aspects of the embodiments are directed to a network switch of a fabric network, the network switch configured to detect a connection of a device to the network switch, the device compliant with a remote integrated services engine (RISE) protocol; receive, from the device, a programming instruction for switching compliant with the RISE protocol; and distribute the programming instruction to one or more other network switches of the fabric network.