Bharat S. Rawal

Mini Web Server Clusters for HTTP Request Splitting

HTTP request splitting is a new concept where the TCP connection and data transfer phases are dynamically split between servers without using a central dispatcher or load balancer. Splitting is completely transparent to the client and provides security due to the inaccessibility and invisibility of the data servers. We study the performance of mini Web server clusters with request splitting. With partial delegation in which some requests are split, throughput is better, and response times are only marginally less than for an equivalent non-split system. For example with partial delegation, for a four-node cluster with a single connection server and three data servers serving 64 KB files, and for a three-node cluster with two connection servers and a single data server serving 4 KB files, the respective throughput improvements over non-split systems are 10% and 22%, with only a marginal increase in response time. In practice, the throughput improvement percentages will be higher and response time gaps will be lower since we ignore the overhead of a dispatcher or load balancer in non-split systems. Although these experiments used bare PC Web servers without an operating system/kernel for ease of implementation, splitting and clustering may also be implemented on conventional systems.

Splitting HTTP requests on two servers

Many techniques are commonly used to increase server availability or for distributing the load among a group of servers. We propose a technique for splitting a single HTTP request that allows a TCP connection to be dynamically split between two Web servers without using a central control. For example, one server can handle connection establishment and closing, while another handles the data transfer. This approach requires no client involvement since the existing connection with the initial server continues to be maintained, and the client is completely unaware of the splitting. We demonstrate the splitting concept in a LAN environment and provide related performance results that highlight several interesting features of splitting. The splitting was done using two bare PC servers with no operating system (OS) or kernel running in the machines. Splitting also works with clients located anywhere on the Internet, although servers have to be located on the same LAN. Our implementation and results indicate the feasibility of splitting TCP connections to transparently redistribute server load without client involvement.

A split protocol technique for web server migration

Reliability, availability and survivability are important characteristics of Web servers that enable them to provide continual service to clients. Server migration is one of the many approaches used to improve the reliability of Web servers. We propose a novel technique for migrating Web servers that is based on protocol splitting, wherein two servers, a connection server and a data server, function as a single logical server. The technique extends splitting by having the connection server dynamically transfer a TCP connection to another connection server with no client involvement. We describe an implementation of the migration technique and present preliminary performance results using bare PC Web servers in a LAN environment with Linux routers. The connection transfer is achieved by means of an additional inter-server packet and a script to modify a routing table. The results indicate the feasibility of adapting this approach in the future to work with conventional (non-bare) servers on the Internet.

Split protocol client/server architecture

Protocol splitting has been used to enable protocols to be split at a server level without client involvement. We describe a novel split protocol client/server architecture that completely separates connections and data transfers within a typical session. In this approach, a client becomes aware of its multiple server sources and communicates with them using their IP addresses. Specifically, a client makes a single TCP connection to a connection server and subsequently communicates with one or more data servers to obtain its data and close the connection. We also conduct experiments and measure performance to demonstrate the feasibility of this architecture. Our results indicate that scalable server cluster configurations can be built using this approach. The proposed architecture simplifies server implementations, avoids traditional load balancing techniques, and isolates clients from data servers. It also results in a scalable and distributable approach to client/server computing that provides an alternative to the current paradigm.

Emergence of DDoS resistant augmented Split architecture

Distributed Denials of Service (DDoS) attacks have become the daunting problem for businesses, system administrators and computer system users. Prevention and detection of a DDoS attack is a major research topic for researchers throughout the world. As new remedies are developed to prevent or mitigate DDoS attacks, invaders are continually evolving new methods to circumvent these new procedures. In this paper, we describe various DDoS attack mechanisms, categories, scope of DDoS attacks and their existing countermeasures. In response, we propose to introduce DDoS resistant Augmented Split-protocol (ASp). The migratory nature and role changeover ability of servers in Split-protocol architecture will avoid bottleneck at the server side. It also offers the unique ability to avoid server saturation and compromise from DDoS attacks. The goal of this paper is to present the concept and performance of (ASp) as a defensive tool against DDoS attacks.

Split-Encoding: The Next Frontier Tool for Big Data

This paper proposes Split-encoding mechanism, an alternative to available encoding and compression techniques for transmitting large medical images. In the Split-protocol, a client establishes a connection with one connection server, then transfers data concurrently from the multiple data servers located on subnets, while providing client connection anywhere along the network. The separation of data transfer from connection establishment is completely transparent to the client. Split-encoding technique reduces network impact, avoids redundancy of data, and improves data transmission time; offers better reliability and Security. The Split-protocol was successfully engaged in defending against the DoS/DDoS attack. This paper describes the design and initial implementation of Split-encoding, serving as a basis for application implementation. It also reports the results of quantitative studies regarding the execution of the initial execution.

Architectural reliability of split-protocol

HTTP request splitting is a novel concept where the TCP connection and data-transfer phases are dynamically split between servers without the use of a central dispatcher or load balancer. Splitting is entirely transparent to the client and provides security due to the inaccessibility and invisibility of the data servers. This study focuses reliability of Mini Web Server Clusters based on HTTP Request Splitting. Previous work has studied through performance and established a performance improvement range between 6% and 25 % and an improved data transmission time which was 84% better than conventional computing. We believe this higher performance results from inbuilt reliability in the architecture of split protocol. There are plenty of researches, and literatures focusing on component-based reliability. Especially in Software Engineering researches, they assumed that each component has a single Service. Thus, this paper highlights on an inbuilt reliability in a split-protocol due to the dual and interchangeable role of Connection Server (CS) and Data Server (DS). This novel approach introduces a more effective way of offering reliability in cluster computing and in general. To assess the reliability of the system, this paper proposed a simple mathematical model which can capture the reliability of the system. This model is also used to compare the reliability of the split system against dispatcher system. The results show that split system reliability is far better than dispatcher system reliability.

A Curriculum for Future Information Technology

Computer science, information systems, information technology and other related programs have been evolving over the years to prepare students for the ever changing work force or to become research scientists. These program structures and curriculum gets updated rapidly even before a student had a chance to complete a four year cycle. When a student graduates, there may be a daunting challenge to find a right fit for a right job in todayâ??s global market. This paper proposes a revolutionary curriculum paradigm that is based on sound engineering principles and need for applied education. The curriculum proposed here is based on student needs and industry outlook. It reduces educational cost for students, administrative cost for teaching institutions and training cost for industry. It also provides a first cut of curriculum that integrates a variety of disciplines under the information technology umbrella. The curriculum taxonomies are shown to illustrate the proposed concept. An initial road map and time schedules are shown to demonstrate the feasibility of this concept. The roles of students, faculty and industry supervisors are discussed. The approach proposed here will have a broader positive impact in information technology when adopted. Further research is needed to fully exploit the proposed concept