H04L12/751

CONTENT-CENTRIC NETWORK ON-DEMAND DISTANCE VECTOR ROUTE METHOD

The present invention relates to a content-centric network on-demand distance vector route method, comprising: a request source node of a required request route broadcasts a route request packet CCN_RREQ to other nodes in a network, and starts a route discovery process; after a target node receives the route request packet CCN_RREQ, replying with a route reply packet CCN_RREP; after the request source node receives the route reply packet CCN_RREP returned by the target node, establishing a path between the request source node and the target node according to the content of the route reply packet CCN_RREP.

Topological Learning Method and Apparatus for OPENFLOW Network Cross Conventional IP Network
20170302562 · 2017-10-19 ·

A topological learning method and apparatus for an OPENFLOW network cross a conventional Internet Protocol (IP) network. The method includes obtaining, by a controller, M OPENFLOW switch (OFS) ports connected to a same conventional IP network, determining whether there is a logical switch corresponding to the conventional IP network, if the controller determines that there is no logical switch corresponding to the conventional IP network, creating and storing the information about the logical switch, where the information about the logical switch includes related information of the M OFS ports, and related information of each OFS port includes link information in a direction from the port to the logical switch and/or link information in a direction from the logical switch to the port, and managing, by the controller, the logical switch as a common OPENFLOW switch of an OPENFLOW network.

BLOCKING UNDESIRABLE COMMUNICATIONS IN VOICE OVER INTERNET PROTOCOL SYSTEMS
20170303126 · 2017-10-19 · ·

Blocking of undesirable voice over internet protocol (VOIP) communications is disclosed. A communication screening service initiates operations to block a threat posed by a VOIP communication upon receiving the communication from a gateway server. The communication may include an audio/video conversation and/or an audio/video conference. Next, metadata and content of the communication is analyzed to detect a threat, such as a scamming scheme and/or a phishing scheme, from a sender of the communication. A rejection of the communication is generated to disrupt the threat associated with the communication. The rejection is transmitted to the gateway server to prompt the gateway server to block the communication.

Data Center Topology Having Multiple Classes of Reliability

Techniques and architectures may be used to generate data center network topologies that use less reliable and less expensive links mixed with links of higher reliability. Such topologies may be categorized into reliability classes, where each class corresponds to a bound(s) on reliability of paths that include the links. A topology class may be selected for use by an application based, at least in part, on the degree of reliability demanded by the application.

Method and system for improved routing
09794166 · 2017-10-17 · ·

Method for use in updating a routing table of a router of a plurality of routers, said routing table comprising the route(s) to be used for at least one destination, wherein update messages with routing information are sent between said plurality of routers, typically BGP routers, wherein the following steps are performed at the router: receiving of an update message containing a path or a withdrawal of a path for a destination; determining if the (withdrawn) path is associated with a path exploration event; deciding on the updating of the routing table taking into account the result of the determination.

Systems and methods for creating, managing and communicating users and applications on spontaneous area networks

A Spontaneous Area Network (SPAN) is formed by mobile and fixed nodes using wireless transmission links between nodes, usually in a nearby geographical area. Applications allow users to create, join, leave, and manage SPANs and groups in a SPAN. Automatic procedures allow nodes to join other SPANs. Transmission power of the wireless network interface is dynamic, varying depending on battery level, type of information to transmit, state and topology of the network. A delay tolerant object layer abstraction creates, modifies, deletes, publishes, and handles Delay Tolerant Distributed Objects (DTDOs). A Patient Transport Protocol (PTP) ensures a reliable transport of information through the network while avoiding congestion conditions. An aggressive and explosive network protocol (AGENET) has routing and forwarding capacities and uses datagrams to establish communication between different nodes of the SPAN. Cooperation and diversity are exploited to react to node mobility that causes frequent changes in network topology and disconnections.

Building topology in communications networks

The present proposal provides a specific solution for communications network topology summarization with a good trade-off between high scalability, good stability and resources utilization efficiency.

Selecting among multiple concurrently active paths through a network

Methods and systems for selecting among multiple concurrently active paths through a network are provided. According to one embodiment, a method is performed by a network interface of a source network device within a loop-free, reverse-path-learning network. The network is divided into multiple virtual local area networks (VLANs). Network traffic destined for a destination network device and specifying an address for the destination or including information from which the address can be derived is received from the source. A set of VLANs that can be used to transport the packet from the source to the destination is determined. Each VLAN in the set of VLANs is associated with a different path through the network from the source to the destination. A particular VLAN from the set of VLANs networks is selected, thereby effectively selecting a particular path from multiple selectable paths between the source and the destination.

Method and device for allocating packet switching resource
09794192 · 2017-10-17 · ·

Embodiments of the present invention provide a method and a device for allocating a packet switching resource, which includes: receiving, by a management plane unit, a service transport request carrying service information, where the service information includes source node information, sink node information, quality of service QoS requirement information, and bandwidth requirement information; determining, by the management plane unit, at least one transport path according to the service information and a preset resource allocation policy, and generating a routing table entry/forwarding table entry according to the at least one transport path; and sending, by the management plane unit, the routing table entry/forwarding table entry to data plane units of packet switching devices of each transport path of the at least one transport path. According to the embodiments, transparent and controllable allocation of a network bandwidth resource is implemented, so that utilization efficiency of a network resource is improved.

Bicasting using non-congruent paths in a loop-free routing topology having routing arcs

In one embodiment, a method comprises creating, in a computing network, a loop-free routing topology comprising a plurality of routing arcs for reaching a destination network node, each routing arc comprising a first network node as a first end of the routing arc, a second network node as a second end of the routing arc, and at least a third network node configured for routing any network traffic along the routing arc toward the destination node via any one of the first or second ends of the routing arc, the loop-free routing topology providing first and second non-congruent paths; and forwarding bicasting data, comprising a data packet in a first direction from a network node and a bicasted copy of the data packet in a second direction from the network node, concurrently to the destination node respectively via the first and second non-congruent paths.