Alcatel Lucent

Nokia Solutions and Networks Oy

Alcatel-Lucent USA Inc.

Deutschetelekom Ag

Ivica Rimac

Volker Fredrich Hilt

Moritz M Steiner

Jairo Orlando Esteban

Andre Beck

Volker Hilt

Markus Andreas Hofmann

James Robert Ensor

Uichin Lee

Istemi Ekin Akkus

Manuel Stein

Ruichuan Chen

Hilt Volker

Sampath Rangarajan

Randeep Singh Bhatia

Simon C Borst

Yang Guo

Anwar I Walid

Matteo Varvello

Girija J Narlikar

Srinivasan Seetharaman

Volker Friedrich Hilt

Nazanin Magharei

Suman Ramkumar Srinivasan

Xuan Bao

Steven A Benno

Ghulam Memon

Prithula Dhungel

Leonhard Nobach

Volker F Hilt

The present disclosure generally discloses an event handling capability configured to support handling of events. The event handling capability may be configured to support handling of events in a distributed event handling system, which may use distributed queuing of events, distributed processing of events, and so forth. The distributed event handling system may be serverless cloud system or other type of distributed event handling system. The event handling capability may be configured to support handling of events in a distributed event handling system based on use of a message bus for queuing of events and based on use of hosts for queuing and processing of events.

Event handling in distributed event handling systems

A method for migration of a virtual network function, VNF, from a source node to a destination node includes receiving by the destination node a snapshot of a state of the virtual network function implemented by the source node and receiving by the destination node state update elements encoding a change of the state of the virtual network function implemented by the source node caused by processing of one or more data packets received by the source node since the snapshot.

Method for migration of virtual network function

The present disclosure generally discloses a host scaling capability for supporting scaling of hosts in a distributed event handling system. The host scaling capability may be configured to support scaling of hosts in a distributed event handling system which may use distributed queuing of events, distributed processing of events, and so forth. The distributed event handling system may be serverless cloud system or other type of distributed event handling system.

Scaling hosts in distributed event handling systems

Various exemplary embodiments relate to a method and related network node including one or more of the following: receiving a request message, the request message including a pointer; determining whether the network node is associated with the pointer; and if the network node is associated with the pointer: determining a label associated with the pointer, modifying the request message to produce a modified message, the modified message including the label, and transmitting the modified message to at least one other network node. Various embodiments additionally or alternatively relate a method and related network node including one or more of the following receiving a publish message, wherein the publish message includes a pointer; generating a label to be associated with the pointer; modifying the publish message to produce a modified message, wherein the modified message includes the label; and transmitting the modified message to at least one other network node.

Routing by resolution

A method comprises associating at least one cache replacement granularity value with a given one of a plurality of content streams comprising a number of segments, receiving a request for a given segment of the given content stream in a network element, identifying a given portion of the given content stream which contains the given segment, updating a value corresponding to the given portion of the given content stream, and determining whether to store the given portion of the given content stream in a memory of the network element based at least in part on the updated value corresponding to the given portion. The at least one cache replacement granularity value represents a given number of segments, the given content stream being separable into one or more portions based at least in part on the at least one cache replacement granularity value.

Content stream delivery using variable cache replacement granularity

The invention includes a method and apparatus for promoting a data item within a data distribution network. In one embodiment, a method includes monitoring at least one parameter for the data item where the data item is associated with an application or service, propagating the data item from a first data server toward a second data server based on the monitoring of the at least one parameter for the data item, and propagating, toward at least one device, a message indicative of the propagation of the data item from the first data server toward the second data server. The message is for adapting the at least one device to identify the second data server as a source of the data item capable of serving future requests for the data item.

Method and apparatus for parameterized promotion and delivery of data

A method and apparatus for peer-to-peer file sharing is provided. In some embodiments, the method includes receiving a request for a list of neighbor peers, where the request is made by a requesting peer device, and where the requesting peer device has a local internet service provider (ISP). The method may also include employing a server device to rank each neighbor peer in a plurality of neighbor peers based on whether the respective neighbor peer is external to the local ISP, and if the respective neighbor peer is external to the ISP, further based on a cost metric associated with a next ISP hop from the requesting peer device to the respective neighbor peer. The method may also include generating the list of neighbor peers based on the ranking of the neighbor peers, and enabling transmission of the list of neighbor peers to the requesting peer device.

Price-aware neighborhood selection for peer-to-peer networks

A cache management system and method and a content distribution system. In one embodiment, the cache management system includes: (1) a content request receiver configured to receive content requests, (2) a popularity lifetime prediction modeler coupled to the content request receiver and configured to generate popularity lifetime prediction models for content that can be cached based on at least some of the content requests, (3) a database coupled to the popularity lifetime prediction modeler and configured to contain the popularity lifetime prediction models and (4) a popularity lifetime prediction model matcher coupled to the content request receiver and the database and configured to match at least one content request to the popularity lifetime prediction models and control a cache based thereon.

Cache management system and method and content distribution system incorporating the same

The present invention relates to a system and method for controlling peer-to-peer connections in a Peer-to-Peer (P2P) streaming application for individual Internet Service Provider (ISP) networks over a localized overlay. The system may include a tracker local to a first ISP network configured to select edge peers among local peers of the first ISP network. The selected edge peers have external connections to peers outside the first ISP network in order to transfer sub-streams to or from the first ISP network, and the local peers not selected as edge peers have internal connections to other local peers within the first ISP network to transfer the sub-streams over the localized overlay.

System and method for controlling peer-to-peer connections

Methods determine data spots in a network by identifying a transmission resource and its characteristics so as to determine geography of a data spot. Users are then directed to, locate, and/or move to the data spot and retrieve desired content. Users may be directed to the determined data spot, with a map or compass. Transmission resources include ad hoc hotspots for need by sideloading network users in a communicative proximity. Methods may match characteristics of the requesting network user with determined transmission resources to position a data spot. Example methods may be configured based on amounts of network resources consumed, third-party costs to a user, maximizing user experience by providing nearer and faster data spots, and/or any other desired criteria. Different portions of the methods may be performed by the network, the user, and/or third-parties, to reduce network burden while supplying users with desired content through data spots.

Methods of locating data spots and networks and user equipment for using the same

A method of processing peer-to-peer requests is provided. The method may include; storing, at a network element, peer information in a database for each peer of a plurality of peers, the peer information indicating at least one ISP associated with the peer and the content contained by the peer, receiving a request for content from a requester, and sending a response to the content requester based on the ISP with which the requester is associated and the stored peer information.

Localization of peer to peer traffic

In one embodiment, the method includes receiving a content request from the end user at a proxy. A modified TCP connection request message is generated such that the modified TCP connection request message includes a content identifier. The content identifier identifies the requested content. The modified TCP connection request message is sent from the proxy towards an origin server associated with the requested content, and a response to the TCP connection request message is received from a network element. A TCP connection is established with the network element.

Method for providing on-path content distribution

A content distribution network (CDN) comprising a hierarchy of content storage nodes (CSNs) or caches having storage space that is allocated between local space for storing locally popular content objects and federated space for storing a portion of the less popular content objects. Local space and federated space based upon changes in content object popularity and/or other utility factors. Optionally, parent/child (upstream/downstream) communication paths are used to migrate content between CSNs or caches of the same or different hierarchical levels to avoid utilizing higher price top hierarchical level communications channels.

Growing community of inventors

Tinton Falls, NJ, United States of America

Ivica Rimac