A Structured Marketplace for Arbitrary Services

Abstract Creating simple marketplaces with common rules, that enable the dynamic selection and consumption of functionality, is the missing link to allow small businesses to enter the cloud, not only as consumers, but also as vendors. In this paper we present the concepts behind a hybrid service and process repository that can act as the foundation for such a marketplace, as well as a prototype that allowed us to test various real-world scenarios. The advantage of a hybrid service and process repository is, that it not only holds a flat list of services, but exposes a generic set of use cases, information how specific services can be used to implement the use cases as well as information to select services at run-time according to customers goal functions

Multi-capacity bin packing with dependent items and its application to the packing of brokered workloads in virtualized environments

Providing resource allocation with performance predictability guarantees is increasingly important in cloud platforms, especially for data-intensive applications, in which performance depends greatly on the available rates of data transfer between the various computing/storage hosts underlying the virtualized resources assigned to the application. Existing resource allocation solutions either assume that applications manage their data transfer between their virtualized resources, or that cloud providers manage their internal networking resources. With the increased prevalence of brokerage services in cloud platforms, there is a need for resource allocation solutions that provides predictability guarantees in settings, in which neither application scheduling nor cloud provider resources can be managed/controlled by the broker. This paper addresses this problem, as we define the Network-Constrained Packing (NCP) problem of finding the optimal mapping of brokered resources to applications with guaranteed performance predictability. We prove that NCP is NP-hard, and we define two special instances of the problem, for which exact solutions can be found efficiently. We develop a greedy heuristic to solve the general instance of the NCP problem , and we evaluate its efficiency using simulations on various application workloads, and network models.This work was done while author was at Boston University. It was partially supported by NSF CISE awards #1430145, #1414119, #1239021 and #1012798. (1430145 - NSF CISE; 1414119 - NSF CISE; 1239021 - NSF CISE; 1012798 - NSF CISE

Network-constrained packing of brokered workloads in virtualized environments

Providing resource allocation with performance predictability guarantees is increasingly important in cloud platforms, especially for data-intensive applications, in which performance depends greatly on the available rates of data transfer between the various computing/storage hosts underlying the virtualized resources assigned to the application. Existing resource allocation solutions either assume that applications manage their data transfer between their virtualized resources, or that cloud providers manage their internal networking resources.With the increased prevalence of brokerage services in cloud platforms, there is a need for resource allocation solutions that provides predictability guarantees in settings, in which neither application scheduling nor cloud provider resources can be managed/controlled by the broker. This paper addresses this problem, as we define the Network-Constrained Packing (NCP)problem of finding the optimal mapping of brokered resources to applications with guaranteed performance predictability. We prove that NCP is NP-hard, and we define two special instances of the problem, for which exact solutions can be found efficiently. We develop a greedy heuristic to solve the general instance of the NCP problem, and we evaluate its efficiency using simulations on various application workloads, and network models.This work is supported by NSF CISE CNS Award #1347522, # 1239021, # 1012798

XSRL: An XML web-services request language

One of the most serious challenges that web-service enabled e-marketplaces face is the lack of formal support for expressing service requests against UDDI-resident web-services in order to solve a complex business problem. In this paper we present a web-service request language (XSRL) developed on the basis of AI planning and the XML database query language XQuery. This framework is designed to handle and execute XSRL requests and is capable of performing planning actions under uncertainty on the basis of refinement and revision as new service-related information is accumulated (via interaction with the user or UDDI) and as execution circumstances necessitate change

Rating agencies: an information privilege whose time has passed

Nicolas Véron argues rating agencies have failed the marketplace in the run-up to the crisis, as their risk assessment processes have been found wanting on a number of counts. It is not clear that conflicts of interests have been the root cause of this serious failure, even if such conflicts may have existed. More regulation of rating agencies will not be a sufficient response to the challenge posed by the agencies recent failings, and carries risks of its own. What is needed is a deeper change in the structure of the market for financial risk assessment services.

A 10-Point Agenda for Comprehensive Telecom Reform

Changing committee chairmanships in Congress and a leadership shakeup at the Federal Communications Commission have once again opened a window of opportunity for comprehensive telecommunications policy reform. While new faces are taking over within Congress and at the FCC, however, old issues continue to dominate the telecom policy landscape. This is largely due to the fact that, when Congress last attempted to address these matters five years ago by passing the historic Telecommunications Act of 1996, legislators intentionally avoided providing clear deregulatory objectives for the FCC and instead delegated broad and remarkably ambiguous authority to the agency. That left the most important deregulatory decisions to the FCC, and, not surprisingly, the agency did a very poor job of following through with a serious liberalization agenda. The Telecom Act, with its backward-looking focus on correcting the market problems of a bygone era, has been a failure. Instead of thoroughly clearing out the regulatory deadwood of the past, legislators and regulators have engaged in an effort to rework regulatory paradigms that where outmoded decades ago. In short, it was an analog act for an increasingly digital world. The new leadership in Congress and the FCC should adopt a fresh approach based on deregulation and free markets

NEEDS SEEDED STRATEGIES

This paper addresses the issue of developing strategies starting from the identification and comprehension of true consumer needs. Needs and opportunities are linked to markets, benefits and strategies through a specific 3D model based on Maslow�s pyramid. A further model, denoted the PIE (Persons, Institutions and Enterprises), also contextualises needs seeded strategies also for institutions. Furthermore the paper builds on declared and latent needs and the author shows how both can live together, or separately, irrespective whether or not one sees them from the demand or supply side. The argument is that demand strategies are essentially based on declared needs and are �red ocean� in nature while supply strategies pace consumers by hitting latent needs and produce �blue ocean� favoured strategies. It is argued that current strategy frameworks e.g. Porter�s competitive advantage, Wernerfelt�s resourcebased strategy and Hax and Wilde�s integrated competitive advantage models, need to pace rather than chase the consumer. Strategies are considered as being the outcome of strategic choices that enterprises need to answer in order to stay or become (more) competitive. If an enterprise is to build its strategy on satisfying consumer needs then it is necessary to view resources from two perspectives, namely customers and assets. For each one of these two resources three possible scenarios are discussed namely that the resources are Insufficient, Limited or AbundantStrategy, Blue-ocean, Red-ocean, Declared, Latent, Needs