The emerging Service-Oriented Computing (SOC) paradigm promises to enable businesses and organizations to collaborate in an unprecedented way by means of standard web services. To support rapid and dynamic composition of services in this paradigm, web services that meet requesters' functional requirements must be able to be located and bounded dynamically from a large and constantly changing number of service providers based on their Quality of Service (QoS). In order to enable quality-driven web service selection, we need an open, fair, dynamic and secure framework to evaluate the QoS of a vast number of web services. The fair computation and enforcing of QoS of web services should have minimal overhead but yet able to achieve sufficient trust by both service requesters and providers. In this paper, we presented our open, fair and dynamic QoS computation model for web services selection through implementation of and experimentation with a QoS registry in a hypothetical phone service provisioning market place application.

The emerging Service-Oriented Computing (SOC) paradigm promises to enable businesses and organizations to collaborate in an unprecedented way by means of standard web services. To support rapid and dynamic composition of services in this paradigm, web services that meet requesters' functional requirements must be able to be located and bounded dynamically from a large and constantly changing number of service providers based on their Quality of Service (QoS). In order to enable quality-driven web service selection, we need an open, fair, dynamic and secure framework to evaluate the QoS of a vast number of web services. The fair computation and enforcing of QoS of web services should have minimal overhead but yet able to achieve sufficient trust by both service requesters and providers. In this paper, we presented our open, fair and dynamic QoS computation model for web services selection through implementation of and experimentation with a QoS registry in a hypothetical phone service provisioning market place application.

Long Term Evolution (LTE) of Universal MobileTelecommunications System (UMTS) Terrestrial Radio Access and Radio Access Network is a Fourth Generation (4G) wireless broadband technology which is capable of delivering high data transmission rates and low latency with reduced costs, among other promises. Carrier Aggregation (CA) is employed to improve the capacity of the cell. Regarding scheduling there are two main alternatives for CA, either resources are scheduled on the same carrier as the grant is received, or cross-carrier scheduling may be used. A key research topic is to design efficient and reliable Physical Downlink Control Channels (PDCCHs) that carry the downlink scheduling assignments and uplink scheduling grants. In Release11, the New Carrier Type characterized by no PDCCH was put forward which has to rely on the crosscarrier scheduling. However with the increase in carriers, CA-based HetNet with cross-carrier scheduling, in which case the PDCCH capacity might become a limiting factor. At the same time, the UE complexity for blind decoding is much higher than before. To solve the problems a novel crosscarrier scheduling method is proposed in this paper to reduce the PDCCH capacity blocking probability and UE complexity.