Abstract: Techniques for improving image processing related to item deliveries are described. In an example, a computer system receives an image showing a drop-off of an item, the item associated with a delivery to a delivery location. The computer system inputs the image to a first artificial intelligence (AI) model. The computer system receives first data comprising an indication of whether the drop-off is correct from the first AI model. The computer system causes a presentation of the indication at a device associated with the delivery of the item to the delivery location.

Abstract: Techniques for improving image processing related to item deliveries are described. In an example, a computer system receives image data showing a portion of a delivery location. The computer system determines an artificial intelligence (AI) model associated with the delivery location. The computer system inputs the image data to the AI model. The computer system receives an indication of whether the portion corresponds to a correct drop-off location and causes a presentation about the indication to be provided at a device.

Abstract: A method and an apparatus for performing deep neural network compression use an approximation training set along with information, such as in matrices representing weights, biases and non-linearities, to iteratively compress a pre-trained deep neural network by low displacement rank based approximation of the network layer weight matrices. The low displacement rank approximation allows for replacement of an original layer weight matrices of the pre-trained deep neural network as the sum of a small number of structured matrices, allowing compression and low inference complexity.

Abstract: 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.

Abstract: According to embodiments, the disclosure relates to a networking node for exchanging messages in a communication network. The networking node comprises a message exchange module configured to exchange these messages based on object locators of objects within this communication network. An object locator further comprises geometric coordinates of a respective object in a negatively curved hyperbolic space and a distance between objects in this negatively curved hyperbolic space relate to a travel time of messages exchanged between these objects.

Abstract: Network system for communicating between a mobile node and a correspondent node via a first IP edge-IP network-second IP edge connectivity, comprising a user IP addressing space and a network IP addressing space, wherein a locator identifier space is inserted between the user IP and network IP addressing space, wherein the first and second IP edges are associated with first and second locator identifiers, and wherein the system is further arranged for associating a mobile node with one or more IP network addresses and an IP user address decoupled from the one or more IP network addresses via the first locator identifier.

Abstract: Method for use in updating a routing information base of a node of a network, said routing information base comprising for each destination node of a number of destination nodes in said network a number of paths; wherein an update message with routing information is sent in said network from a first node to a peer of the first node, said first node having a first routing information base; wherein the update message comprises: a selected path for a first destination node of said number of destination nodes, said selected path comprising a next hop node adjacent the first node; at least one routing topology variable derived from the number of paths available for said first destination; said at least one routing topology variable being a measure for the risk on bottlenecks in the selected path.

Abstract: Method for use in updating a routing information base of a node of a network, said routing information base comprising for each destination node of a number of destination nodes in said network a number of paths; wherein an update message with routing information is sent in said network from a first node to a peer of the first node, said first node having a first routing information base; wherein the update message comprises: a selected path for a first destination node of said number of destination nodes, said selected path comprising a next hop node adjacent the first node; at least one routing topology variable derived from the number of paths available for said first destination; said at least one routing topology variable being a measure for the risk on bottlenecks in the selected path.

Abstract: A method of controlling paging flow in a network for cellular communications is described, which comprises the steps of: at a control node, receiving a request for paging a mobile station; determining a location area in which the paging shall be performed; checking whether the number of paging transactions which are ongoing for the location area is lower than at least one maximum number of ongoing paging transactions allowed for the location area; after a determination that the number of ongoing paging transactions is lower than the maximum number, updating the number of ongoing paging transactions for the location area and processing the paging request. Preferably, if the number of ongoing paging transactions is not lower than the maximum number, it is checked whether the paging request is a particular LCS transaction and, if so, the request is placed in a buffer and served with priority as soon as the number of ongoing paging transactions returns to be lower than the maximum number.

Abstract: 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.

Abstract: A method to grant a supplicant access to a data communication network and related devices is claimed. The supplicant is associated to a Medium Access Control address and is coupled to a port of an authenticator of the data communication network. The method includes: transmitting an authentication request by the authenticator to an authentication server being coupled thereto; making by the authentication server an authentication decision based upon predefined rules and conditions; and transmitting by the authentication server to the authenticator an authentication reply that comprises a result of the authentication decision.

Abstract: An embodiment includes encoding, into a resource reservation signaling message, (i) a group identifier assigned to a group of pseudo point-to-point connections established between a root node and at least one leaf node and (ii) a sub-group identifier assigned to a sub-group of pseudo point-to-point connections out of the group of pseudo point-to-point connections. The sub-group of pseudo point-to-point connections share a common network tunnel established between a previous signaling hop and a next signaling hop. The method further includes aggregating, into the resource reservation signaling message, resource reservation signaling related to the sub-group of pseudo point-to-point connections based on the group identifier and the sub-group identifier. The resource reservation signaling message is then exchanged between the previous signaling hop and the next signaling hop.

Abstract: Networks (8) for setting up connections between nodes (1,2) via request messages (R1) and allocation messages (A1) are made more efficient by providing the request messages (R1) with indications for indicating the first node's capabilities with respect to different signalling procedures and by providing the allocation messages (A1) with instructions for instructing the first nodes (1) to use one of the signalling procedures. Only one round trip is needed. The indications comprise first preference values for the first signalling procedure (wavelength switching) and second preference values for the second signalling procedure (waveband switching). The instructions comprise signalling information and signalling procedure assignments. The second nodes (2) run label assignment algorithms for making the signalling procedure assignment in dependence of the preference values.

Abstract: A method is devoted to setting up a connection between the first (N1) and second (N2) external nodes connected to a GMPLS control plane (RG) and each incorporating a portion (PA1,PA2) of a distributed application and a signalling module (MS1,MS2) loaded to manage the setting up of the connection.

Abstract: Network system for communicating between a mobile node and a correspondent node via a first IP edge-IP network-second IP edge connectivity, comprising a user IP addressing space and a network IP addressing space, wherein a locator identifier space is inserted between the user IP and network IP addressing space, wherein the first and second IP edges are associated with first and second locator identifiers, and wherein the system is further arranged for associating a mobile node with one or more IP network addresses and an IP user address decoupled from the one or more IP network addresses via the first locator identifier.

Abstract: The present invention provides a technique for conveying Inverse Address Resolution Protocol (InARP) packets between a source node and an end node. A data path is established through a data communication network between the source node and the end node by exchanging signaling messages between network nodes along the data path. InARP requests are sent through the control address space used for controlling the operation of the network. At the source node, a common path identifier that identifies the data path is encoded into a request that is sent to the end node for identifying a particular data path that terminates at that end node, and for returning a data network address associated with that data path.

Abstract: A control device (D) for a node (LCR3) in an Ethernet communications network having a GMPLS control plan and through which node a connection for setting up is to pass, includes control means (MC) arranged, in the event of said node (LCR3) receiving a connection setup message containing at least one first value representative of the sum since the beginning of the connection for setting up of the local values of an additive parameter as introduced in each of the preceding nodes (LCR3) in the connection, to determine a second value that is a function of the first value and of the local value as introduced by the node (LCR3), and then to compare the second value with a selected threshold so as to determine whether the connection can accept a maximum value for the additive parameter at the node, and to replace the first value in the received message with the second value as determined, at least when the connection can accept the maximum value.

Abstract: The present invention relates to a method and apparatus for reserving network resources for pseudo point-to-point connections by means of an idempotent resource reservation protocol. A method according to the invention comprises the steps of: encoding, into a resource reservation signaling message (rsvp_path12, rsvp_resv12), a group identifier (GID0) assigned to a group of pseudo point-to-point connections (MS-PW4 . . . 7) established between a root node (T-PE0) and at least one leaf node (T-PE4 . . . 7), and a sub-group identifier (SGID12) assigned to a sub-group of pseudo point-to-point connections (MS-PW4 . . .

Abstract: To achieve an efficient and flexible routing of signaling messages between a core network and an access network in a mobile communication cellular network, it is proposed to provide a pool of mobile switching apparatuses between the core network and the access network. Each mobile switching apparatus in the pool (10) comprises a signaling unit (32) adapted to issue a paging message to the access network for connection establishment to a mobile terminal. Further, according to the present invention it is proposed to provide each mobile switching apparatus in the pool (10) with a relay unit (28) adapted to receive a paging response from the access network. Further, the relay unit (28) is adapted to determine a mobile switching apparatus in the pool (10) of mobile switching apparatuses handling the paging response.

Abstract: Communication network routing apparatus and techniques using logical communication links are disclosed. A routing apparatus identifies a logical communication link that it is capable of being used to establish a virtual connection with another routing apparatus within a virtual connection operational domain, which includes multiple sub-domains, of an underlying communication system. A destination that is associated with the routing apparatus and is reachable through the virtual connection is also identified. Information that is indicative of the identified logical communication link and of the identified destination is provided for distribution from a sub-domain of the routing apparatus in the virtual connection operational domain to another sub-domain within the virtual connection operational domain. This distribution of information enables a routing apparatus in one sub-domain to dynamically route a virtual connection toward a destination in a different sub-domain.