H04L45/028

APPARATUS AND METHOD FOR MODIFYING PACKET INTERVAL TIMING BASED ON DEVICE CHARACTERISTICS
20170280395 · 2017-09-28 ·

An apparatus and method are described for selecting an appropriate advertising interval for an IoT device. For example, one embodiment of an apparatus comprises: Internet of Things (IoT) device data collection circuitry/logic to collect IoT device usage data and/or other IoT device data; advertising interval determination circuitry/logic to determine an appropriate advertising interval based on the IoT device usage data and/or other IoT device data; and advertising interval selection circuitry/logic to implement the appropriate advertising interval determined by the advertising interval determination circuitry/logic.

Using PCE as SDN controller

Embodiments relate generally to systems and methods for transitioning a system from a tradition network to a Software Defined Network (SDN) enabled network. In some embodiments, the systems and methods may comprise the use of a Path Computation Element (PCE) as a central controller. Smooth transition between traditional network and the new SDN enabled network, especially from a cost impact assessment perspective, may be accomplished using the existing PCE components from the current network to function as the central controller of the SDN network is one choice, which not only achieves the goal of having a centralized controller to provide the functionalities needed for the central controller, but also leverages the existing PCE network components.

Method and device for operating a network component and a control instance in a software-defined networking communication infrastructure

A method and device for operating a network component and a control instance in a software-defined networking communication infrastructure. The software-defined networking communication infrastructure is switched from an operation according to a first strategy for forwarding time-critical data streams in network components of the communication infrastructure to an operation according to a second strategy for forwarding time-critical data streams in network components as a function of at least one trigger signal, the at least one trigger signal being received in an operation according to the first strategy from a control instance in a unicast message or in a broadcast message.

LONGEST-PREFIX MATCHING DYNAMIC ALLOCATION IN COMMUNICATIONS NETWORK
20220231946 · 2022-07-21 ·

A method performed by a node of a communications network such as a virtual routing function or policy enforcement node comprises receiving at least one packet, such as an internet protocol packet having an associated address and obtaining one or more metrics. The method involves dynamically configuring a longest-prefix match process on the basis of at least the metric(s). The dynamically configured longest-prefix match process is used with the associated address to identify an action and the identified action is applied to the packet.

METHOD AND UE FOR PERFORMING RID UPDATE IN UE IN WIRELESS COMMUNICATION NETWORK
20210392071 · 2021-12-16 ·

The present disclosure relates to a communication method and system for converging a 5th-Generation (5G) communication system for supporting higher data rates beyond a 4th-Generation (4G) system with a technology for Internet of Things (IoT). The present disclosure may be applied to intelligent services based on the 5G communication technology and the IoT-related technology, such as smart home, smart building, smart city, smart car, connected car, health care, digital education, smart retail, security and safety services. Embodiments herein provide a method for performing a routing ID (RID) update in user equipment (UE) in a wireless communication network.

Route calculation method, route calculation apparatus and program

A computer executes a first determination procedure determining a first link which at least partially overlaps a disaster area representing a range reached by an influence of a predetermined disaster, among links constituting a network, a second determination procedure determining a second link which at least partially overlaps a road area representing a range of a road width of a predetermined road used to recover from the disaster, among the links constituting the network, a route search procedure searching for a plurality of routes from a start point node to an end point node constituting the network, a grouping procedure grouping the plurality of routes searched for by the route search procedure into groups depending on a first parameter value that is based on the first link included in the routes, a computing procedure computing, for each of the plurality of routes searched for by the route search procedure, a second parameter value that is based on the first link and the second link included in the routes, and a selecting procedure selecting a predetermined number of routes among one or more routes grouped into the same group on the basis of the second parameter value computed by the computing procedure for each of the groups grouped by the grouping procedure.

PIECEWISE SHORTEST PATH FIRST ROUTING

A method and apparatus for routing packets in a network, such as a satellite mesh network. Geographic routing is employed in which packets specify their physical destination location. Network nodes maintain physical location information for nodes, along with routing information, for a limited portion of the network which is local thereto. At each node and for each packet, a target node is selected from the limited portion. The target node may be the node which is closest in orthodromic distance to the physical destination location. Based on the routing information, a route through the limited portion of the network to the target node is determined, other nodes are configured (e.g. via source routing) to cause the packet to traverse the determined route, and the packet is forwarded toward the target node.

Piecewise shortest path first routing

A method and apparatus for routing packets in a network, such as a satellite mesh network. Geographic routing is employed in which packets specify their physical destination location. Network nodes maintain physical location information for nodes, along with routing information, for a limited portion of the network which is local thereto. At each node and for each packet, a target node is selected from the limited portion. The target node may be the node which is closest in orthodromic distance to the physical destination location. Based on the routing information, a route through the limited portion of the network to the target node is determined, other nodes are configured (e.g. via source routing) to cause the packet to traverse the determined route, and the packet is forwarded toward the target node.

Piecewise shortest path first routing

A method and apparatus for routing packets in a network, such as a satellite mesh network. Geographic routing is employed in which packets specify their physical destination location. Network nodes maintain physical location information for nodes, along with routing information, for a limited portion of the network which is local thereto. At each node and for each packet, a target node is selected from the limited portion. The target node may be the node which is closest in orthodromic distance to the physical destination location. Based on the routing information, a route through the limited portion of the network to the target node is determined, other nodes are configured (e.g. via source routing) to cause the packet to traverse the determined route, and the packet is forwarded toward the target node.

Autonomous topology management for wireless radio user equipment

The described technology is generally directed towards an autonomous topology management scheme in a wireless communications network that establishes a hierarchical structure from a peer-to-peer network without assistance from the wireless network. A group of user equipments negotiate with each other to elect a local manager that acts as a base station by which other user equipments of the group can access network resources. Described is an example voting scheme by which the negotiation process elects the local manager for a term.