/pdf/a-break-in-the-clouds-towards-a-cloud-definition-svovsw1r5a.pdf

A Break in the Clouds: Towards a Cloud Definition

Communications of the ACM (CACM for short, not the best sounding acronym around) is the ACM’s flagship magazine. Started in 1957, CACM is handy for keeping up to date on current research being carried out across all topics of computer science and realworld applications. CACM has had an illustrious past with many influential pieces of work and debates started within its pages. These include Hoare’s presentation of the Quicksort algorithm; Rivest, Shamir and Adleman’s description of the first publickey cryptosystem RSA; and Dijkstra’s famous letter against the use of GOTO. In addition to the print edition, which is released monthly, there is a fantastic website (http://cacm.acm. org/) that showcases not only the most recent edition but all previous CACM articles as well, readable online as well as downloadable as a PDF. In addition, the website lets you browse for articles by subject, a handy feature if you want to focus on a particular topic. CACM is really essential reading. Pretty much guaranteed to contain content that is interesting to anyone, it keeps tabs on the latest in computer science. It is a valuable asset for us students, who tend to delve deep into a particular area of CS and forget everything that is happening around us. — Daniel Gooch U ndergraduate research is like a box of chocolates: You never know what kind of project you will get. That being said, there are still a few things you should know to get the most out of the experience.

Communications of the ACM

System, method, and tangible computer-readable storage media are disclosed for providing a brokering service for compute resources The method includes, at a brokering service, polling a group of separately administered compute environments to identify resource capabilities and information, each compute resource environment including the group of managed nodes for processing workload, receiving a request for compute resources at the brokering service system, the request for compute resources being associated with a service level agreement (SLA) and based on the resource capabilities across the group of compute resource environments, selecting compute resources in one or more of the group of compute resource environments The brokering service system receives workload associated with the request and communicates the workload to the selected resources for processing The brokering services system can aggregate resources for multiple cloud service providers and act as an advocate for or a guarantor of the SLA associated with the workload

System and method of brokering cloud computing resources

The overall increase in traffic on the World Wide Web is augmenting user-perceived response times from popular Web sites, especially in conjunction with special events. System platforms that do not replicate information content cannot provide the needed scalability to handle large traffic volumes and to match rapid and dramatic changes in the number of clients. The need to improve the performance of Web-based services has produced a variety of novel content delivery architectures. This article will focus on Web system architectures that consist of multiple server nodes distributed on a local area, with one or more mechanisms to spread client requests among the nodes. After years of continual proposals of new system solutions, routing mechanisms, and policies (the first dated back to 1994 when the NCSA Web site had to face the first million of requests per day), many problems concerning multiple server architectures for Web sites have been solved. Other issues remain to be addressed, especially at the network application layer, but the main techniques and methodologies for building scalable Web content delivery architectures placed in a single location are settled now. This article classifies and describes main mechanisms to split the traffic load among the server nodes, discussing both the alternative architectures and the load sharing policies. To this purpose, it focuses on architectures, internal routing mechanisms, and dispatching request algorithms for designing and implementing scalable Web-server systems under the control of one content provider. It identifies also some of the open research issues associated with the use of distributed systems for highly accessed Web sites.

The state of the art in locally distributed Web-server systems

Internet of things (IoT) facilitates billions of devices to be enabled with network connectivity to collect and exchange real-time information for providing intelligent services. Thus, IoT allows connected devices to be controlled and accessed remotely in the presence of adequate network infrastructure. Unfortunately, traditional network technologies such as enterprise networks and classic timeout-based transport protocols are not capable of handling such requirements of IoT in an efficient, scalable, seamless, and cost-effective manner. Besides, the advent of software-defined networking (SDN) introduces features that allow the network operators and users to control and access the network devices remotely, while leveraging the global view of the network. In this respect, we provide a comprehensive survey of different SDN-based technologies, which are useful to fulfill the requirements of IoT, from different networking aspects— edge , access , core , and data center networking. In these areas, the utility of SDN-based technologies is discussed, while presenting different challenges and requirements of the same in the context of IoT applications. We present a synthesized overview of the current state of IoT development. We also highlight some of the future research directions and open research issues based on the limitations of the existing SDN-based technologies.

Software-Defined Networking for Internet of Things: A Survey

A content-aware routing method comprising the steps of: providing a Web sever cluster having a Web content for responding a plurality of requests via a network, wherein the sever content has a plurality of sever items each having a name with a variable-length alphabet string; providing a URL table having a plurality of record named with a fixed-length binary string converted form the variable-length alphabet string of the name of the sever items by means of a hash function; receiving a request packet with a object name via a network and retrieving the object name of the request packet; converting the retrieved object name into a retrieved fixed-length binary string by means of the hash function; and comparing the retrieved fixed-length binary string with the fixed-length binary string in the URL table for routing the request packet into the Web server cluster With the proposed approach in the invention, a content-aware routing mechanism can be configurable so that some complex system policies can be deployed in the server system, and the incoming requests can be correctly routed to the appropriate server at very high speed

Configurable and high-speed content-aware routing method

Clustered server architectures have been employed for many years on the Internet as a way to increase performance, reliability and scalability in the presence of the Internet's explosive growth. A routing mechanism for mapping requests to individual servers within cluster is at the heart of any server clustering techniques. In this paper, we first analyze the deficiencies of existing request-routing approaches. Based on these observations, we argue that the request routing mechanism in a cluster-based server should factor in the content of a request in making decisions. Thus, we designed and implemented a new mechanism to efficiently support content-aware routing in Web server clusters. With this mechanism, we also built in a number of sophisticated content-aware intelligence for making routing decision. Performance evaluation on a prototype implementation demonstrates substantial performance improvements over contemporary routing schemes. The proposed mechanism can also enable many new capabilities in cluster-based servers, such as sophisticated load balancing, differentiated service, special content deployment, session integrity, etc.

Efficient support for content-based routing in web server clusters

A zero-loss web service system for providing World Wide Web access service to clients connecting via the Internet and sending requests to said system for said access, wherein the system comprises a server cluster and a dispatcher device. The server cluster comprises a number of servers connected in a network. The dispatcher device comprises a routing mechanism, the dispatcher dispatching each of the access requests sent by the clients to a corresponding one of the servers in the cluster, and the routing mechanism discriminating each of the requests sent by the clients and migrating the requests to another server in the event that the corresponding server suffers a service failure.

Zero-loss web service system and method

Clusters of commodity computers are becoming an increasingly popular approach for building cost-effective high-performance Internet servers. However, how to place and manage content in such a distributed and complex system is becoming a challenging problem. In particular, such distributed servers tend to be more heterogeneous, and this heterogeneity will further increase the management burden. This paper describes the motivation, design, implementation and performance of a content placement and management system for a heterogeneous distributed Web server.

A content placement and management system for distributed Web-server systems

Modern Web services must support large and rapidly growing user populations, and remain available 24 hours per day, 7 day per week. Server-cluster is the most promising approach to address this challenge. We further augment the server-cluster schemes with a novel mechanism that enables a Web request to be smoothly migrated and recovered on another working node in the presence of server failure or overload. The new mechanism provides a powerful solution to fault tolerance and dynamic load-distribution for Web services. The administrator can explicitly specify some services to be guaranteed for fault-tolerance or higher performance support. We present the details of our design, implementation, and performance data. The performance results show that the proposed mechanism is efficient and with low associated overhead.

Mon-Yen Luo

Papers

Configurable and high-speed content-aware routing method

Efficient support for content-based routing in web server clusters

Zero-loss web service system and method

A content placement and management system for distributed Web-server systems

Constructing zero-loss Web services