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.

Network hardware devices organized in a wireless mesh network (WMN) in which one network hardware devices includes a first radio and a second radio coupled to a processing device. The processing device receives a request from a client consumption device via the first radio and determines a destination for the request as a second mesh network device. The processing device access a master routing table to determine that the second radio is to forward the request and forwards the request to the second radio. The second radio accesses a local routing table at the second radio to determine that a radio of a third mesh network device is a next-hop mesh network device in a first path to the second mesh network device. The second radio sends the request to the radio of the third mesh network device.

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.

The subject technology addresses a need for improving utilization of network bandwidth in a multicast network environment. More specifically, the disclosed technology provides solutions for extending multipathing to tenant multicast traffic in an overlay network, which enables greater bandwidth utilization for multicast traffic. In some aspects, nodes in the overlay network can be connected by virtual or logical links, each of which corresponds to a path, perhaps through many physical links, in the underlying network.

Embodiments are provided for managing routes of data traffic within a network. The management may be performed via a graphical user interface that interacts with a Web server to update a configuration file. The configuration file can be converted to router management commands by a network management device (e.g., a BGP speaker). The commands can then be sent to border routers for controlling network traffic. Embodiments are also provided for capturing and logging routing updates made in a network.

In general, embodiments of the invention relate to a method and system for enabling a peer state synchronization mechanism for dynamic network address translation (DNAT). More specifically, at least two network elements may be permitted to mount each other's DNAT tables, thereby providing redundancy for the implementation of DNATs in case of the failover of one of the network elements. The failed network element may then re-initialize while the functional network element continues to process packets, including packets that have been redirected to the functional network element post-failure of the failed network element. Upon completing re-initialization, the once failed network element recovers its DNAT table from the functional network element and proceeds to process packets normally.

A relay device includes an acquisition unit that acquires, upon detection of a change of settings concerning a network environment of an external system or the relay device, information related to the change; a generation unit that generates setting change information for causing settings of the external system to match settings of the relay device with reference to the information acquired by the acquisition unit; and an information setting unit that causes the setting change information generated by the generation unit to be set in the external system by transmitting the setting change information to the external system.

A relay device includes an acquisition unit that acquires, upon detection of a change of settings concerning a network environment of an external system or the relay device, information related to the change; a generation unit that generates setting change information for causing settings of the external system to match settings of the relay device with reference to the information acquired by the acquisition unit; and an information setting unit that causes the setting change information generated by the generation unit to be set in the external system by transmitting the setting change information to the external system.

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.

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.