Abstract: The embodiments herein provide a computer implemented method for partner pixelling for user identification. The method includes sending a unique identifier request message to an identity broker when a user is on an advertiser webpage. The method includes receiving a unique identifier of the user from the identifier entity broker; and sending a rule file to a publisher server, wherein the rule file comprises the unique identifier of the user for which at least one DSP is interested in displaying an advertisement. Further, when the user visits the publisher website, the publisher server uses the unique identifier, revived from the identity broker, to identify the user and the list of DSPs that are interested in displaying advisement to the user.

Abstract: Systems and methods for dynamic scaling of RE middleboxes in a communication network are described. According to the present subject matter, the method comprises determining a load of incoming data at an encoding middlebox in the communication network. Further, the method comprises modifying a number of encoder instances in the encoding middlebox and a number of decoder instances in a decoding middlebox based on the load of incoming data.

Abstract: Methods and systems for flow migration between virtual network appliances in a cloud computing network are described. A network appliances managing architecture for migrating flow between VNAs including a controller to receive performance data for a VNA and analyze the performance data to determine whether the VNA has a weak performance status, where the weak performance status corresponds to any one of an overloaded, an under-loaded, and a failed status. The network appliances managing architecture further includes a classifier to receive a flow migration request from the controller for migrating one or more flows of data packets from the VNA based on the analyzing. The classifier further identifies an active VNA for flow migration based on a mapping policy and migrates the one or more flows from the VNA to the at least one active VNA.

Abstract: The embodiments herein provide a computer implemented method for partner pixelling for user identification. The method includes sending a unique identifier request message to an identity broker when a user is on an advertiser webpage. The method includes receiving a unique identifier of the user from the identifier entity broker; and sending a rule file to a publisher server, wherein the rule file comprises the unique identifier of the user for which at least one DSP is interested in displaying an advertisement. Further, when the user visits the publisher website, the publisher server uses the unique identifier, revived from the identity broker, to identify the user and the list of DSPs that are interested in displaying advisement to the user.

Abstract: Various embodiments provide a method and apparatus for dynamically allocating resources to processes by using unified resources. In particular, a superVM allows a process from an application to utilize resources (e.g., CPU, memory, and storage) from other VMs. Advantageously, sharing resources of of VMs that are operating below capacity increases cost efficiencies and providing resources without the overhead of spawning new VMs to VMs requiring additional resources increases application performance. Moreover, legacy applications may run utilize resources from multiple VMs without modification.

Abstract: The embodiments herein provide a system and computer-implemented method for buying an advertising inventory. The method includes receiving at least one rule book from a plurality of Demand Side Platform's (DSPs) when a user visits a web page. Further, the method includes selecting a DSP from the plurality of DSPs to buy the advertising inventory based on the at least one rule book.

Abstract: A capability is provided for scaling Redundancy Elimination (RE) middleboxes. The RE middleboxes include an RE encoding middlebox and an RE decoding middlebox. The RE middleboxes may employ max-match-based RE techniques or chunk-match-based RE techniques. The RE middleboxes may utilize Distributed Hash Tables (DHTs) to maintain content stores, respectively. The RE middleboxes may be scaled for use with cloud applications (e.g., for use in transfer of data between a customer network and a cloud side, for use in transfer of data between two cloud sites, or the like).

Abstract: A virtual resource assignment capability is disclosed. The virtual resource assignment capability is configured to support provisioning of virtual resources within a cloud environment. The provisioning of virtual resources within a cloud environment includes receiving a user virtual resource request requesting provisioning of virtual resources within the cloud environment, determining virtual resource assignment information specifying assignment of virtual resources within the cloud environment, and provisioning the virtual resources within the cloud environment using the virtual resource assignment information. The assignment of the requested virtual resources within the cloud environment includes assignment of the virtual resource to datacenters of the cloud environment in which the virtual resources will be hosted and, more specifically, to the physical resources within the datacenters of the cloud environment in which the virtual resources will be hosted.

Abstract: Methods and systems for flow migration between virtual network appliances in a cloud computing network are described. A network appliances managing architecture for migrating flow between VNAs including a controller to receive performance data for a VNA and analyze the performance data to determine whether the VNA has a weak performance status, where the weak performance status corresponds to any one of an overloaded, an under-loaded, and a failed status. The network appliances managing architecture further includes a classifier to receive a flow migration request from the controller for migrating one or more flows of data packets from the VNA based on the analyzing. The classifier further identifies an active VNA for flow migration based on a mapping policy and migrates the one or more flows from the VNA to the at least one active VNA.

Abstract: Systems and methods for dynamic scaling of RE middleboxes in a communication network are described. According to the present subject matter, the method comprises determining a load of incoming data at an encoding middlebox in the communication network. Further, the method comprises modifying a number of encoder instances in the encoding middlebox and a number of decoder instances in a decoding middlebox based on the load of incoming data.

Abstract: Various exemplary embodiments relate to a method and related network node including one or more of the following: obtaining a set of compute nodes, a set of data nodes, and a set of edges between compute nodes and data nodes; determining an assignment objective to be achieved in assigning compute nodes from the set of compute nodes to data nodes from the set of data nodes; applying an algorithm associated with the assignment objective to obtain a set of assignments based on a plurality of costs associated with the set of edges; and assigning a compute node of the set of compute nodes to a data node of the set of data nodes based on the set of assignments.

Abstract: A capability is provided for scaling Redundancy Elimination (RE) middleboxes. The RE middleboxes include an RE encoding middlebox and an RE decoding middlebox. The RE middleboxes may employ max-match-based RE techniques or chunk-match-based RE techniques. The RE middleboxes may utilize Distributed Hash Tables (DHTs) to maintain content stores, respectively. The RE middleboxes may be scaled for use with cloud applications (e.g., for use in transfer of data between a customer network and a cloud side, for use in transfer of data between two cloud sites, or the like).

Abstract: A capability is provided for scaling Redundancy Elimination (RE) middleboxes. The RE middleboxes include an RE encoding middlebox and an RE decoding middlebox. The RE middleboxes may employ max-match-based RE techniques or chunk-match-based RE techniques. The RE middleboxes may utilize Distributed Hash Tables (DHTs) to maintain content stores, respectively. The RE middleboxes may be scaled for use with cloud applications (e.g., for use in transfer of data between a customer network and a cloud side, for use in transfer of data between two cloud sites, or the like).

Abstract: Various embodiments provide a method and apparatus for dynamically allocating resources to processes by using unified resources. In particular, a superVM allows a process from an application to utilize resources (e.g., CPU, memory, and storage) from other VMs. Advantageously, sharing resources of of VMs that are operating below capacity increases cost efficiencies and providing resources without the overhead of spawning new VMs to VMs requiring additional resources increases application performance. Moreover, legacy applications may run utilize resources from multiple VMs without modification.

Abstract: Various exemplary embodiments relate to a method and related network node including one or more of the following: obtaining a set of compute nodes, a set of data nodes, and a set of edges between compute nodes and data nodes; determining an assignment objective to be achieved in assigning compute nodes from the set of compute nodes to data nodes from the set of data nodes; applying an algorithm associated with the assignment objective to obtain a set of assignments based on a plurality of costs associated with the set of edges; and assigning a compute node of the set of compute nodes to a data node of the set of data nodes based on the set of assignments.

Abstract: A capability is provided for scaling Redundancy Elimination (RE) middleboxes. The RE middleboxes include an RE encoding middlebox and an RE decoding middlebox. The RE middleboxes may employ max-match-based RE techniques or chunk-match-based RE techniques. The RE middleboxes may utilize Distributed Hash Tables (DHTs) to maintain content stores, respectively. The RE middleboxes may be scaled for use with cloud applications (e.g., for use in transfer of data between a customer network and a cloud side, for use in transfer of data between two cloud sites, or the like).

Abstract: Various exemplary embodiments relate to a method and related network node including one or more of the following: determining that a new virtual gateway location should be created; selecting a data center of a plurality of data centers to host the new virtual gateway location; and establishing a virtual gateway at the selected data center, wherein the virtual gateway is configured to provide at least one device with connectivity to a Virtual Private Network (VPN) and connectivity to the Internet.

Abstract: A virtual resource assignment capability is disclosed. The virtual resource assignment capability is configured to support provisioning of virtual resources within a cloud environment. The provisioning of virtual resources within a cloud environment includes receiving a user virtual resource request requesting provisioning of virtual resources within the cloud environment, determining virtual resource assignment information specifying assignment of virtual resources within the cloud environment, and provisioning the virtual resources within the cloud environment using the virtual resource assignment information. The assignment of the requested virtual resources within the cloud environment includes assignment of the virtual resource to datacenters of the cloud environment in which the virtual resources will be hosted and, more specifically, to the physical resources within the datacenters of the cloud environment in which the virtual resources will be hosted.

Abstract: Improved p-cycle restoration techniques using a signaling protocol are disclosed. For example, a technique for use in at least one node of a data communication network for recovering from a failure, wherein the data communication network includes multiple nodes and multiple links for connecting the multiple nodes, comprises the following steps/operations. Notification of the failure is obtained at the at least one node. A determination is made whether the failure is a single link failure or one of a node failure and a multiple link failure. A pre-configured protection cycle (p-cycle) plan is implemented when the failure is a single link failure but not when the failure is one of a node failure and a multiple link failure, such that two independent paths in the network are not connected when implementing the pre-configured protection cycle plan.

Abstract: Techniques and systems for designing a network providing communication and location identification services are described. A solution point comprising parameters for each of a plurality of base stations is generated. A coverage and locatability performance value for the solution point is computed, as well as derivatives of the performance value. The coverage and locatability performance value and its derivatives are used to indicate favorable directions for searching for subsequent solution points, and subsequent solution points are generated and compared against previous solution points until an optimum solution point is found. The coverage and locatability performance value is a weighted sum of coverage and locatability values for each point in the service area of the network, with coverage values representing forward and reverse link quality and locatability values representing the probability that a point will experience an acceptable power level from at least four base stations.