H04L12/733

Node and a method of communicating among a plurality of nodes in content-centric networking environment

In a method for communicating among a plurality of nodes in a content-centric networking environment, each of a plurality of nodes selects at least one relay node based on topology information on neighbor nodes adjacent within 2 hops from itself. Each of the selected relay nodes determines whether itself is a publisher relay node. Each of the determined publisher relay nodes generates a multi-hop content announce (CA) message including content information of its own 1-hop neighbor nodes, and broadcasts the multi-hop CA message to the plurality of nodes through the selected relay nodes.

Path Computation Element Hierarchical Software Defined Network Control
20170244628 · 2017-08-24 ·

A parent PCE controller comprising a memory comprising instructions executable by a processor and a processor coupled to the memory and configured to execute the instructions. Executing the instructions causes the processor to establish a parent-child relationship with at least a first child PCE controller controlling a first domain and a second child PCE controller controlling a second domain, receive a request to create an E2E tunnel from a source to a destination crossing the first domain and the second domain, compute a shortest path from the source to the destination through the first domain and the second domain, transmit a request message to the first child PCE controller for creating a first tunnel segment of the E2E tunnel through the first domain, and transmit a request message to the second child PCE controller for creating a second tunnel segment of the E2E tunnel through the second domain.

RADIO COMMUNICATION SYSTEM, RADIO COMMUNICATION DEVICE, AND RADIO RELAY DEVICE
20170245132 · 2017-08-24 · ·

A radio communication system including a radio communication device configured to request connection, and radio relay devices. The communication device includes a neighbor node discovery unit to transmit a neighbor node discovery message, a selection unit to select the connection destination based on determination information when a response message to the discovery message is received, the determination information being used for determining whether to select a transmission source as the connection destination, and a storage unit to store the determination information. Each relay device includes a calculation processing unit to calculate, in accordance with a value of the determination information, transmission waiting time until transmission of the response message, a timer unit to manage passage of the waiting time, a response message transmission unit to transmit the response message when the timer unit notifies elapse of the waiting time, and a storage unit configured to store the determination information.

METHOD FOR CONTROLLING NETWORK INTERFACES OF ELECTRONIC DEVICE AND ASSOCIATED PROCESSING CIRCUIT
20170245195 · 2017-08-24 ·

A method for controlling a plurality of network interfaces of an electronic device includes: providing at least one table comprising information associated with a plurality of routing costs, wherein the routing costs correspond to at least paths between each of the network interfaces of the electronic device and the other electronic devices; and referring to the at least one table to select a specific network interface to transmit/receive data, and to disable at least one of the unused network interfaces.

Route optimization for on-demand routing protocols for mesh networks

Various embodiments implement a set of low overhead mechanisms to enable on-demand routing protocols. The on-demand protocols use route accumulation during discovery floods to discover when better paths have become available even if the paths that the protocols are currently using are not broken. In other words, the mechanisms (or “Route Optimizations”) enable improvements to routes even while functioning routes are available. The Route Optimization mechanisms enable nodes in the network that passively learn routing information to notify nodes that need to know of changes in the routing information when the changes are important. Learning routing information on up-to-date paths and determining nodes that would benefit from the information is performed, in some embodiments, without any explicit control packet exchange. One of the Route Optimization mechanisms includes communicating information describing an improved route from a node where the improved route diverges from a less nearly optimal route.

INTERMEDIARY NETWORK ELEMENT FOR TAP TRAFFIC

In one implementation, a method for tap traffic redirection can include identification of a request protocol and a source network element, selection of a redirector protocol based on a list of device capabilities, instruction of the source network element to send a first copy of network traffic to an intermediary network element using the redirector protocol, and instruction of the intermediary network element to forward a second copy of the network traffic using the request protocol.

Energy efficient management of heterogeneous multi-hop wireless networks

A wireless multi-hope network of nodes including data nodes and at least one sink node. The data nodes include battery-powered nodes (BPNs) having active and sleep periods and mains-powered nodes (MPNs) having only active periods, wherein each data node transmits the packets only within corresponding active periods. A BPN includes a transceiver for transmitting and receiving data packets and a processor for determining a schedule of active and sleep periods of the BPN independently from the active and sleep periods of other data nodes in the network and independently from commands transmitted by the sink node, and a battery for providing energy to the transceiver and the processor. The processor switches the transceiver ON and OFF according to the schedule.

Mobile accelerator
09736710 · 2017-08-15 · ·

Techniques for providing mobile device content delivery acceleration are discussed herein. Some embodiments may provide for a system including a mobile device and a mobile accelerator system. The mobile accelerator system may include point of presences (“POPs”) configured to facilitate accelerated content delivery to the mobile device from a content server. For example, the mobile device may be configured to: determine an entry POP from POPs of a mobile accelerator system; and create a dedicated transport channel with the entry POP. The entry POP of the mobile accelerator system may be configured to: receive a query to a content server from the mobile device via the dedicated transport channel; determine at least a portion a dynamic path between the mobile device and the content server; and route data transfers between the mobile device and the content server through the at least a portion of the dynamic path.

Systems and methods for discovery of a controller in openflow networks

Systems and methods for discovery of a controller in an OpenFlow network may include using an OpenFlow capable switch to discover the controller without the help of other components, such as DHCP. The link discovery protocol may be configured on the switch and the discovery process may use an out-of-band or an in-band communication. In one example, a link discovery protocol packet is sent out of all ports of a switch that meet the eligibility criteria. The response is guaranteed because of a TTL like mechanism in the packet. Each port on a switch that receives this link discovery protocol packet takes an action depending on its current state.

NON-MINIMUM COST FORWARDING FOR PACKET-SWITCHED NETWORKS
20170222914 · 2017-08-03 ·

In some examples, a network node receives a packet from an adjacent node in a packet-switched network. The receiving node can forward the packet to a destination node via a minimum cost forwarding node adjacent to the network node or to a non-minimum cost forwarding node adjacent to the network node based on routing criteria for the packet-switched network. The routing criteria can include whether the adjacent node that sent the packet to the receiving node is a non-minimum cost node between a source node and the destination node for the packet.