New Jersey Institute of Technology

Huawei Technologies Co., Limited

Convida Wireless, LLC

Xiang Sun

Nirwan Ansari

Chonggang Wang

Quang Ly

Xu Li

Dale N Seed

Shamim Akbar Rahman

Hongkun Li

Mingming Guo

A new semantic mashup architecture with modular design can comprise separate Semantic Mashup Profiles (SMPs), Virtual Semantic Mashup Resources (VSMRs), and Semantic Mashup Results (SMRSs). This kind of modular design greatly improves the reusability of SMPs, VSMRs, and SMRSs. In addition, this new mashup architecture leverages semantics during each mashup process, which increases the interoperability. Moreover, this new architecture essentially realizes new Semantic Mashup Service (SMS) at the service layer and consequently improves system efficiency.

Enabling semantic mashup in internet of things

An M2M/IoT resource directory entity may discover and register to other resource directory entities by including criteria attributes in discovery broadcasts and then processing link and metadata that may be included in responses. The resource directory with registrations to other resource directories may service a client request by selecting other resources directories to query based on the request or a query criteria contained therein, and then process link and metadata in responses from the other resource directory entities to aggregate a response to the client. Directory-to-directory registrations may be facilitated via using hierarchical parent-child resource directory identifiers, a peer-to-peer identifier regime, or a combination of the two. Observe notifications may include indicia registrations states, e.g., via change and delete response codes.

Mechanisms for resource-directory to resource-directory communications

An embodiment of the disclosure provides a method, performed by a resource management server, for mapping a plurality of unassigned virtual machines (VMs) to a plurality of physical machines (PMs). The resource management server includes a non-transient computer readable medium and a processor to execute computer executable instructions stored on the non-transient computer readable medium, so that when the instructions are executed, the resource management server performs the method of: (a) obtaining a total resource demand for each dimension requested by the plurality of unassigned VMs; (b) activating at least one PM in the plurality of PMs to create a set of activated PMs; (c) assigning at least one unassigned VM to the set of activated PMs, wherein a VM assigned to a PM has an equal or lower resource demand for each dimension compared to a remaining resource capacity for each respective dimension of the PM; (d) determining whether all unassigned VMs have been assigned to a PM in the set of activated PMs; and (e) conditionally activating one or more PMs when all unassigned VMs have not been assigned to a PM in the set of activated PMs.

Virtual machine placement in a heterogeneous data center

An embodiment of the disclosure provides a method, performed by a resource management server, for resource allocation in a virtualization environment. The resource management server includes a non-transient computer readable medium and a processor to execute computer executable instructions stored on the non-transient computer readable medium, so that when the instructions are executed, the resource management server performs the method of: (a) determining an average service rate for each virtual machine (VM) pool running an application; (b) predicting a workload of the application; (c) determining a set of collaborative VMs to serve the application in order to satisfy a service level requirement, the set of collaborative VMs comprising a number of selected VMs from the VM pools running the application; and (d) distributing incoming application requests of the application among the VMs in the set of collaborative VMs.

Virtual machine resource utilization in a data center

Technologies are generally described to manage bandwidth efficiency and fairness in cloud computing. According to some examples, bottleneck links may be determined in a network connecting communication device pairs. A first bandwidth allocation may be determined of a first subset of the communication device pairs communicating through the bottleneck links. A second bandwidth allocation may be determined of a second subset of the communication device pairs unable to communicate through the bottleneck links. Then, the first bandwidth may be adjusted based on an analysis of the first bandwidth, the second bandwidth, a first weight attribute associated with the first subset and a second weight attribute associated with the second subset.

Growing community of inventors

Harrison, NJ, United States of America

Xiang Sun