ABSTRACT In this paper, we face the challenging issue of defining and implementing an effective law for load balancing

in Content Delivery Networks (CDNs). We base our proposal on a formal study of a CDN system, carried out through the exploitation of a fluid flow model characterization of the network of servers. Starting from such characterization, we derive and prove a lemma about the network queues equilibrium. This result is then leveraged in order to devise a novel distributed and time-continuous algorithm for load balancing, which is also reformulated in a time-discrete version. The discrete formulation of the proposed balancing law is eventually discussed in terms of its actual implementation in a real-world scenario. Finally, the overall approach is validated by means of simulations.

Keywords Content Delivery Network (CDN), control theory, request balancing.

CHAPTER-1 DOMAIN INTRODUCTION

1.1 NETWORKING A network is any collection of independent computers that communicate with one another over a shared network medium. A computer network is a collection of two or more connected computers. When these computers are joined in a network, people can share files and peripherals such as modems, printers, tape backup drives, or CD-ROM drives. When networks at multiple locations are connected using services available from phone companies, people can send e-mail, share links to the global Internet, or conduct video conferences in real time with other remote users. When a network becomes open sourced it can be managed properly with online collaboration software. As companies rely on applications like electronic mail and database management for core business operations, computer networking becomes increasingly more important.

Every network includes: At least two computers Server or Client workstation. Networking Interface Card's (NIC). A connection medium, usually a wire or cable, although wireless communication between networked computers and peripherals is also possible. Network Operating system software, such as Microsoft Windows NT or 2000, Novell NetWare, Unix and Linux.

1.2 TCP/IP stack The TCP/IP stack is shorter than the OSI one:

Fig: 1.2.1

TCP is a connection-oriented protocol; UDP (User Datagram Protocol) is a connectionless protocol. 1.3 IP datagrams The IP layer provides a connectionless and unreliable delivery system. It considers each datagram independently of the others. Any association between datagram must be supplied by the higher layers. The IP layer supplies a checksum that includes its own header. The header includes the source and destination addresses. The IP layer handles routing through an Internet. It is also responsible for breaking up large datagram into smaller ones for transmission and reassembling them at the other end.

UDP UDP is also connectionless and unreliable. What it adds to IP is a checksum for the contents of the datagram and port numbers. These are used to give a client/server model - see later. TCP TCP supplies logic to give a reliable connection-oriented protocol above IP. It provides a virtual circuit that two processes can use to communicate. Internet addresses In order to use a service, you must be able to find it. The Internet uses an address scheme for machines so that they can be located. The address is a 32 bit integer which gives the IP address. This encodes a network ID and more addressing. The network ID falls into various classes according to the size of the network address. Network address Class A uses 8 bits for the network address with 24 bits left over for other addressing. Class B uses 16 bit network addressing. Class C uses 24 bit network addressing and class D uses all 32. Subnet address Internally, the UNIX network is divided into sub networks. Building 11 is currently on one sub network and uses 10-bit addressing, allowing 1024 different hosts. Host address 8 bits are finally used for host addresses within our subnet. This places a limit of 256 machines that can be on the subnet. Total address

Fig: 1.3.1
4

The 32 bit address is usually written as 4 integers separated by dots. Port addresses A service exists on a host, and is identified by its port. This is a 16 bit number. To send a message to a server, you send it to the port for that service of the host that it is running on. This is not location transparency! Certain of these ports are "well known".

Sockets A socket is a data structure maintained by the system to handle network connections. A socket is created using the call socket. It returns an integer that is like a file descriptor. In fact, under Windows, this handle can be used with Read File and Write File functions.

#include <sys/types.h> #include <sys/socket.h> int socket(int family, int type, int protocol); Here "family" will be AF_INET for IP communications, protocol will be zero, and type will depend on whether TCP or UDP is used. Two processes wishing to communicate over a network create a socket each. These are similar to two ends of a pipe - but the actual pipe does not yet exist.

1.4 JFree Chart JFreeChart is a free 100% Java chart library that makes it easy for developers to display professional quality charts in their applications. JFreeChart's extensive feature set includes: A consistent and well-documented API, supporting a wide range of chart types. A flexible design that is easy to extend, and targets both server-side and clientside applications; Support for many output types, including Swing components, image files (including PNG and JPEG), and vector graphics file formats (including PDF, EPS and SVG); JFreeChart is "open source" or, more specifically, free software. It is distributed under the terms of the GNU Lesser General Public License ( LGPL), which permits use in proprietary applications.
5

i. Map Visualizations Charts showing values that relate to geographical areas. Some examples include: (a) population density in each state of the United States, (b) income per capita for each country in Europe, (c) life expectancy in each country of the world. The tasks in this project include: Sourcing freely redistributable vector outlines for the countries of the world, states/provinces in particular countries (USA in particular, but also other areas); Creating an appropriate dataset interface (plus default implementation), a rendered, and integrating this with the existing XYPlot class in JFreeChart; Testing, documenting, testing some more, documenting some more. ii. Time Series Chart Interactivity Implement a new (to JFreeChart) feature for interactive time series charts --- to display a separate control that shows a small version of ALL the time series data, with a sliding "view" rectangle that allows you to select the subset of the time series data to display in the main chart. iii. Dashboards There is currently a lot of interest in dashboard displays. Create a flexible dashboard mechanism that supports a subset of JFreeChart chart types (dials, pies, thermometers, bars, and lines/time series) that can be delivered easily via both Java Web Start and an applet. iv. Property Editors The property editor mechanism in JFreeChart only handles a small subset of the properties that can be set for charts. Extend (or re-implement) this mechanism to provide greater end-user control over the appearance of the charts. 1.5 J2ME (Java 2 Micro edition):Sun Microsystems defines J2ME as "a highly optimized Java run-time environment targeting a wide range of consumer products, including pagers, cellular phones, screen-phones, digital set-top boxes and car navigation systems." Announced in
6

June 1999 at the Java One Developer Conference, J2ME brings the cross-platform functionality of the Java language to smaller devices, allowing mobile wireless devices to share applications. With J2ME, Sun has adapted the Java platform for consumer products that incorporate or are based on small computing devices. i. General J2ME architecture J2ME uses configurations and profiles to customize the Java Runtime Environment (JRE). As a complete JRE, J2ME is comprised of a configuration, which determines the JVM used, and a profile, which defines the application by adding domainspecific classes. The configuration defines the basic run-time environment as a set of core classes and a specific JVM that run on specific types of devices. We'll discuss configurations in detail in the The profile defines the application; specifically, it adds domain-specific classes to the J2ME configuration to define certain uses for devices. The following graphic depicts the relationship between the different virtual machines, configurations, and profiles

Fig: 1.5.1
ii. Developing J2ME applications

Introduction In this section, we will go over some considerations you need to keep in mind when developing applications for smaller devices. We'll take a look at the way

the compiler is invoked when using J2SE to compile J2ME applications. Finally, we'll explore packaging and deployment and the role pre-verification plays in this process. iii. Design considerations for small devices Developing applications for small devices requires you to keep certain strategies in mind during the design phase. It is best to strategically design an application for a small device before you begin coding. Correcting the code because you failed to consider all of the "gotchas" before developing the application can be a painful process. Here are some design strategies to consider: * Keep it simple. Remove unnecessary features, possibly making those features a separate, secondary application. * Smaller is better. This consideration should be a "no brainer" for all developers. Smaller applications use less memory on the device and require shorter installation times. Consider packaging your Java applications as compressed Java Archive (jar) files. * Minimize run-time memory use. To minimize the amount of memory used at run time, use scalar types in place of object types. Also, do not depend on the garbage collector. You should manage the memory efficiently yourself by setting object references to null when you are finished with them. Another way to reduce run-time memory is to use lazy instantiation, only allocating objects on an as-needed basis. Other ways of reducing overall and peak memory use on small devices are to release resources quickly, reuse objects, and avoid exceptions. iv. Configurations overview The configuration defines the basic run-time environment as a set of core classes and a specific JVM that run on specific types of devices. Currently, two configurations exist for J2ME, though others may be defined in the future: * Connected Limited Device Configuration (CLDC)is used specifically with the KVM for 16-bit or 32-bit devices with limited amounts of memory. This is the configuration (and the virtual machine) used for developing small J2ME applications. Its size
8

limitations make CLDC more interesting and challenging (from a development point of view) than CDC. CLDC is also the configuration that we will use for developing our drawing tool application. An example of a small wireless device running small applications is a Palm hand-held computer. * Connected Device Configuration (CDC)is used with the C virtual machine (CVM) and is used for 32-bit architectures requiring more than 2 MB of memory. An example of such a device is a Net TV box.

1.6 J2ME profiles What is a J2ME profile? As we mentioned earlier in this tutorial, a profile defines the type of device supported. The Mobile Information Device Profile (MIDP), for example, defines classes for cellular phones. It adds domain-specific classes to the J2ME configuration to define uses for similar devices. Two profiles have been defined for J2ME and are built upon CLDC: KJava and MIDP. Both KJava and MIDP are associated with CLDC and smaller devices. Profiles are built on top of configurations. Because profiles are specific to the size of the device (amount of memory) on which an application runs, certain profiles are associated with certain configurations. A skeleton profile upon which you can create your own profile, the Foundation Profile, is available for CDC. Profile 1: KJava KJava is Sun's proprietary profile and contains the KJava API. The KJava profile is built on top of the CLDC configuration. The KJava virtual machine, KVM, accepts the same byte codes and class file format as the classic J2SE virtual machine. KJava contains a Sun-specific API that runs on the Palm OS. The KJava API has a great deal in common with the J2SE Abstract Windowing Toolkit (AWT). However, because it is not a

standard J2ME package, its main package is com.sun.kjava. We'll learn more about the KJava API later in this tutorial when we develop some sample applications. Profile 2: MIDP MIDP is geared toward mobile devices such as cellular phones and pagers. The MIDP, like KJava, is built upon CLDC and provides a standard run-time environment that allows new applications and services to be deployed dynamically on end user devices. MIDP is a common, industry-standard profile for mobile devices that is not dependent on a specific vendor. It is a complete and supported foundation for mobile application development. MIDP contains the following packages, the first three of which are core CLDC packages, plus three MIDP-specific packages. * java.lang * java.io * java.util * javax.microedition.io * javax.microedition.lcdui * javax.microedition.midlet * javax.microedition.rm

10

CHAPTER-2 PROJECT INTRODUCTION

2.1 CONTENT DELIVERY NETWORKs (CDNs) With the proliferation of the Internet, popular Web services often suffer congestion and bottlenecks due to large demands made on their services. Such a scenario may cause unmanageable levels of traffic flow, resulting in many requests being lost. Replicating the same content or services over several mirrored Web servers strategically placed at various locations is a method commonly used by service providers to improve performance and scalability. The user is redirected to the nearest server and this approach helps to reduce network impact on the response time of the user requests. Content Delivery Networks (CDNs) provide services that improve network performance by maximizing bandwidth, improving accessibility and maintaining correctness through content replication. They offer fast and reliable applications and services by distributing content to cache or edge servers located close to users. A CDN has some combination of content-delivery, request-routing, distribution and accounting infrastructure. The content-delivery infrastructure consists of a set of edge servers (also called surrogates) that deliver copies of content to endusers. It also interacts with the distribution infrastructure to keep an up-to-date view of the content stored in the CDN caches. The accounting infrastructure maintains logs of client accesses and records the usage of the CDN servers. This information is used for trafficreporting and usage-based billing.

Fig. 2.1.1
11

A CDN consists of an original server(called back-end server) containing new data to be diffused, together with one or more distribution servers, called surrogate servers. Periodically, the surrogate servers are actively updated by the back-end server. Surrogate servers are typically used to store static data, while dynamic information (i.e., data that change in time) is just stored in a small number of back-end servers. In some typical scenarios, there is a server called redirector, which dynamically redirects client requests based on selected policies. The most important performance improvements derived from the adoption of such a network concern two aspects: 1) Overall system throughput, that is, the average number of requests served in a time unit (optimized also on the basis of the processing capabilities of the available servers); 2) Response time experienced by clients after issuing a request Depending on the network layers and mechanisms involved in the process, generally request routing techniques can be classified in DNS request routing, transport-layer request routing, and application-layer request routing. With a DNS-based approach, a specialized DNS server is able to provide a request-balancing mechanism based on well-defined policies and metrics. For every address resolution request received, the DNS server selects the most appropriate surrogate server in a cluster of available servers and replies to the client with both the selected IP address and a time-to-live (TTL). The latter allows defining a period of validity for the mapping process. Typical implementations of this approach can provide either a single surrogate address or a record of multiple surrogate addresses, in the last case leaving to the client the choice of the server to contact (e.g., in a round-robin fashion). In this paper first design a suitable load-balancing law that assures equilibrium of the queues in a balanced CDN by using a fluid flow model for the network of servers. Then, we discuss the most notable implementation issues associated with the proposed load-balancing strategy. This paper presents a new mechanism for redirecting incoming client requests to the most appropriate server, thus balancing the overall system requests load. Our mechanism leverages local balancing in order to achieve global balancing. This is carried out through a periodic interaction among the system nodes.

12

CHAPTER-3 3. LITERATURE SURVEY

3.1 Robust Rate Control for Integrated Services Packet Networks It is a control-theoritical approach to network congestion control that priviliges stable and robust network operation. Franco Blanchini, Member, IEEE, Renato Lo Cigno, Associate Member, IEEE, and Roberto Tempo, Fellow, IEEE Research on congestion-control algorithms has traditionally focused more on performance than on robustness of the closed-loop system to changes in network conditions. As the performance of the control loop is strictly connected with the quality of service, these systems are natural candidates to be approached by the optimal control theory. Unfortunately, this approach may fail in the presence of transmission delay variations, which are un- avoidable in telecommunication systems. In this paper, we first show the fragility of optimal controllers and demonstrate their instability when the control delay is not known exactly. Then we propose a robust control algorithm based on a classical proportional integral derivative scheme which does not suffer from this fragility phenomenon. Its stability versus the control delay variations, as well as versus sources that transmit less than their computed share, is studied with Nyquist analysis. The control algorithm is implemented within a simulator in the frame- work of the asynchronous transfer mode (ATM) ABR transfer capability. The final part of the paper shows some selected results assessing the performance of the control algorithm in a realistic net- work environment. ABR was chosen as an example, but the control studied here can be applied in any data network to obtain a robust and reliable congestion-control scheme.

13

3.2 Network Delivery of Live Events in a Digital Cinema Scenario It makes a system able to support the network delivery of live events in an expected Digital Cinema scenario. D.D. Sorte, M. Femminella, A.Parisi, and G.Reali, ONDM , Mar.2008 The goal of this paper is to present a system able to support the network delivery of live events in an expected, future Digital Cinema Scenario. This service can consume a large amount of network bandwidth, due to the large volume of transmitted data and to the number of receivers, thus multicast transmission proves to be very useful. Consequently, a key issue of the system is the request routing algorithm, the goal of which is to optimize the QoS-guaranteed delivery of live streams in the backbone, each one towards a set of theatres. It consider the Multi Protocol Label Switching, which has emerged as an elegant solution to meet traffic engineering and resource reservation requirements, and focus on the overall request routing procedure, the mathematical modeling of the problem, and relevant solving algorithms. It present the comparative performance evaluation of these algorithms by means of an extensive simulation campaign performed with the OMNET++ simulation platform

3.3 The State of the Art in Locally Distributed Web-Server Systems It manages the web system architectures consist of multiple server nodes, with one or more mechanisms to spread client requests among the nodes. V. Cardellini, E. Casalicchio, M. Colajanni, and P. S. Yu, Jun. 2002. The overall increase in trafc 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 trafc 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. After years of continual proposals of new system solutions,
14

routing mechanisms, and policies many problems concerning multiple server architectures for Web sites have been. 3.4 Fluid-based Analysis of a Network of AQM Routers Supporting TCP Flows with an Application to RED It obtains the expected transient behavior of networks with Active Queue Management routers supporting TCP flows. V. Misra, W. Gong, W. bo Gong, and D. Towsley, ACM SIGCOMM. In this paper we use jump process driven Stochastic Differential Equations to model the interactions of a set of TCP ows and Active Queue Management routers (AQM) in a network setting. It show how the SDEs can be transformed into a set of Ordinary Differential Equations which can be easily solved numerically. Our solution methodology scales well to a large number of ows. As an application, we model and solve a system where RED is the AQM policy. Our results show excellent agreement with those of similar networks simulated using the well known ns simulator. Our model enables us to get an in-depth understanding of the RED algorithm. Using the tools developed in this paper, it present a critical analysis of the RED algorithm. We explain the role played by the RED conguration parameters on the behavior of the algorithm in a network. We point out a aw in the RED averaging mechanism which we believe is a cause of tuning problems for RED. We believe this modeling/solution methodology has a great potential in analyzing and understanding various network congestion control algorithms 3.5 A Control Theoretic Analysis of RED They analyzed a combined TCP and AQM model from a control theoretic standpoint. C. V. Hollot, V. Misra, D. Towsley, and W. bo Gong, IEEEINFOCOM, 2001. In this paper we use a previously developed nonlinear dy- namic model of TCP to analyze and design Active Queue Management (AQM) control systems using RED. First, we linearize the interconnection of TCP and a bottlenecked queue and discuss its feedback properties in terms of network parameters such as link capacity, load and round-trip time. Using this model, we next design an AQM control system using the random early detection (RED) scheme by relating its
15

free parameters such as the low-pass lter break point and loss probability prole to the network parameters. It present guidelines for designing linearly stable systems subject to network parameters like propogation delay and load level. Robustness to variations in system loads is a prime objective. We present ns simulations to support our analysis.

16

CHAPTER-4 EXISTING SYSTEM

The simplest static algorithm is the Random balancing mechanism (RAND). In such a policy, the incoming requests are distributed to the servers in the network with a uniform probability. Another well-known static solution is the Round Robin algorithm (RR). This algorithm selects a different server for each incoming request in a cyclic mode. Each server is loaded with the same number of requests without making any assumption on the state, neither of the network nor of the servers. The Least-Loaded algorithm (LL) is a well-known dynamic strategy for load balancing. It assigns the incoming client request to the currently least loaded server. Such an approach is adopted in several commercial solutions. Unfortunately, it tends to rapidly saturate the least loaded server until a new message is propagated. Alternative solutions can rely on Response Time to select the server: The request is assigned to the server that shows the fastest response time. The Two Random Choices algorithm (2RC) randomly chooses two servers and assigns the request to the least load done between them. A modified version of such an algorithm is the Next-Neighbor Load Sharing.

Disadvantage of Existing System: A critical component of CDN architecture is the request routing mechanism. It allows to direct users requests for content to the appropriate server based on a specified set of parameters.

The proximity principle, by means of which a request is always served by the server that is closest to the client, can sometimes fail. Indeed, the routing process associated with a request might take into account several parameters (like traffic load, bandwidth, and

17

servers computational capabilities) in order to provide the best performance in terms of time of service, delay, etc.

Furthermore, an effective request routing mechanism should be able to face temporary, and potentially localized, high request rates (the so-called flash crowds) in order to avoid affecting the quality of service perceived by other users.

18

CHAPTER-5 PROPOSED SYSTEM

In this paper we first design a suitable load-balancing law that assures equilibrium of the queues in a balanced CDN by using a fluid flow model for the network of servers. We present a new mechanism for redirecting incoming client requests to the most appropriate server, thus balancing the overall system requests load. Our mechanism leverages local balancing in order to achieve global balancing. This is carried out through a periodic interaction among the system nodes. The implemented algorithm consists of two independent parts: a procedure that is in charge of updating the status of the neighbors load, and a mechanism representing the core of the algorithm, which is in charge of distributing requests to a nodes neighbors based on probability.

Advantages of Proposed System: The quality of our solution can be further appreciated by analyzing the performance parameters

The proposed mechanism also exhibits an excellent average Response Time, which is only comparable to the value obtained by the 2RC algorithm.

The excellent performance of our mechanism might be paid in terms of a significant number of redirections. Since the redirection process is common to all the algorithms analyzed, we exclusively evaluate the percentage of requests redirected more than once over the total number of requests generated.

19

CHAPTER-6 MODULE DESCRIPTION

MODULES There are three modules. Network Formation Fluid queue model Load balance

6.1 Network Formation In this module the content delivery network is formed. The network contain back end server, redirect server, number of surrogate server and number of client. Each client connects with one surrogate server. The Back end server maintain all server (redirect and surrogate server). 6.2 Fluid queue model Each server maintain an own queue for receiving the client request. Here Fluid queue model is used. Let qi(t)be the queue occupancy of server I at time t. Consider the instant arrival ratei(t) and the instant service rate i(t).

The fluid model of CDN servers queues is givenby

20

6.3 Load Balance The client sends the request to the server. The server first it check the queue. If the queue is limit exceeds, it redirect the server to others, otherwise it respond the user request. Every T seconds, the server sends its status information to its neighbors and, at the same time, waits for their information. After a well-defined interval, the server launches the status update process. When a new request arrives at a server, it verifies the presence of neighbors with a lower load. If no such neighbors are present, the server locally processes the request and serves it; otherwise the balancing strategy is adopted. For requests redistribution, we adopt a random number generator with uniform distribution between 0 and 1. Depending on which interval the generated number falls in, the algorithm selects the corresponding peer for redirecting the incoming request.

21

CHAPTER-7 SYSTEM CONFIGURATION

7.1 HARDWARE REQUIREMENTS: Processor Ram Hard Disk Compact Disk Input device : Any Processor above 500 MHz. : 1 GB. : 10 GB. : 650 Mb. : Standard Keyboard and Mouse.

7.2 SOFTWARE REQUIREMENTS: Operating System Technology Tools : Windows Xp. : Net Beans 7.2 : Jdk1.6

22

CHAPTER-8 SOFTWARE DESCRIPTIONS

8.1 SYSTEM SPECIFICATION Frontend and Features Java Technology Java technology is both a programming language and a platform. The Java Programming Language The Java programming language is a high-level language that can be characterized by all of the following buzzwords: Simple Architecture neutral Object oriented Portable Distributed High performance Interpreted Multithreaded Robust Dynamic Secure

With most programming languages, you either compile or interpret a program so that you can run it on your computer. The Java programming language is unusual in that a program is both compiled and interpreted. With the compiler, first you translate a program into an intermediate language called Java byte codes the platformindependent codes interpreted by the interpreter on the Java platform. The interpreter parses and runs each Java byte code instruction on the computer. Compilation happens just once; interpretation occurs each time the program is executed. The following figure illustrates how this works.

23

Fig 8.1.1

You can think of Java byte codes as the machine code instructions for the Java Virtual Machine (Java VM). Every Java interpreter, whether its a development tool or a Web browser that can run applets, is an implementation of the Java VM. Java byte codes help make write once, run anywhere possible. You can compile your program into byte codes on any platform that has a Java compiler. The byte codes can then be run on any implementation of the Java VM. That means that as long as a computer has a Java VM, the same program written in the Java programming language can run on Windows 2000, a Solaris workstation, or on an iMac.

Fig: 8.1.2 The Java Platform A platform is the hardware or software environment in which a program runs. Weve already mentioned some of the most popular platforms like Windows 2000, Linux, Solaris, and MacOS. Most platforms can be described as a combination of the
24

operating system and hardware. The Java platform differs from most other platforms in that its a software-only platform that runs on top of other hardware-based platforms. The Java platform has two components:

The Java Virtual Machine (Java VM) The Java Application Programming Interface (Java API)

Youve already been introduced to the Java VM. Its the base for the Java platform and is ported onto various hardware-based platforms. The Java API is a large collection of ready-made software components that provide many useful capabilities, such as graphical user interface (GUI) widgets. The Java API is grouped into libraries of related classes and interfaces; these libraries are known as packages. The next section, What Can Java Technology Do? Highlights what functionality some of the packages in the Java API provide. The following figure depicts a program thats running on the Java platform. As the figure shows, the Java API and the virtual machine insulate the program from the hardware.

Fig: 8.1.3 Native code is code that after you compile it, the compiled code runs on a specific hardware platform. As a platform-independent environment, the Java platform can be a bit slower than native code. However, smart compilers, well-tuned interpreters, and justin-time byte code compilers can bring performance close to that of native code without threatening portability.

What Can Java Technology Do? The most common types of programs written in the Java programming language are applets and applications. If youve surfed the Web, youre probably already familiar with applets. An applet is a program that adheres to certain conventions that allow it to
25

run within a Java-enabled browser. However, the Java programming language is not just for writing cute, entertaining applets for the Web. The general-purpose, high-level Java programming language is also a powerful software platform. Using the generous API, you can write many types of programs. An application is a standalone program that runs directly on the Java platform. A special kind of application known as a server serves and supports clients on a network. Examples of servers are Web servers, proxy servers, mail servers, and print servers. Another specialized program is a servlet. A servlet can almost be thought of as an applet that runs on the server side. Java Servlets are a popular choice for building interactive web applications, replacing the use of CGI scripts. Servlets are similar to applets in that they are runtime extensions of applications. Instead of working in browsers, though, servlets run within Java Web servers, configuring or tailoring the server. How does the API support all these kinds of programs? It does so with packages of software components that provides a wide range of functionality. Every full implementation of the Java platform gives you the following features:

The essentials: Objects, strings, threads, numbers, input and output, data

structures, system properties, date and time, and so on.

Applets: The set of conventions used by applets. Networking: URLs, TCP (Transmission Control Protocol), UDP (User Data gram

Protocol) sockets, and IP (Internet Protocol) addresses.

Internationalization: Help for writing programs that can be localized for users

worldwide. Programs can automatically adapt to specific locales and be displayed in the appropriate language.

Security: Both low level and high level, including electronic signatures, public

and private key management, access control, and certificates.

architectures. Object serialization: Allows lightweight persistence and communication via

TM

Remote Method Invocation (RMI).

Software components: Known as JavaBeans

, can plug into existing

component
26

Java Database Connectivity (JDBCTM): Provides uniform access to a wide

range of relational databases. The Java platform also has APIs for 2D and 3D graphics, accessibility, servers, collaboration, telephony, speech, animation, and more. The following figure depicts what is included in the Java 2 SDK.

Fig: 8.1.4

How Will Java Technology Change My Life? We cant promise you fame, fortune, or even a job if you learn the Java programming language. Still, it is likely to make your programs better and requires less effort than other languages. We believe that Java technology will help you do the following:

Get started quickly: Although the Java programming language is a powerful

object-oriented language, its easy to learn, especially for programmers already familiar with C or C++.

Write less code: Comparisons of program metrics (class counts, method counts,

and so on) suggest that a program written in the Java programming language can be four times smaller than the same program in C++.

Write better code: The Java programming language encourages good coding

practices, and its garbage collection helps you avoid memory leaks. Its object orientation,

27

its JavaBeans component architecture, and its wide-ranging, easily extendible API let you reuse other peoples tested code and introduce fewer bugs.

Develop programs more quickly: Your development time may be as much as

twice as fast versus writing the same program in C++. Why? You write fewer lines of code and it is a simpler programming language than C++.

Avoid platform dependencies with 100% Pure Java: You can keep your

program portable by avoiding the use of libraries written in other languages. The 100% Pure JavaTM Product Certification Program has a repository of historical process manuals, white papers, brochures, and similar materials online.

Write once, run anywhere: Because 100% Pure Java programs are compiled into

machine-independent byte codes, they run consistently on any Java platform.

Distribute software more easily: You can upgrade applets easily from a central

server. Applets take advantage of the feature of allowing new classes to be loaded on the fly, without recompiling the entire program.

ODBC Microsoft Open Database Connectivity (ODBC) is a standard programming interface for application developers and database systems providers. Before ODBC became a defacto standard for Windows programs to interface with database systems, programmers had to use proprietary languages for each database they wanted to connect to. Now, ODBC has made the choice of the database system almost irrelevant from a coding perspective, which is as it should be. Application developers have much more important things to worry about than the syntax that is needed to port their program from one database to another when business needs suddenly change. Through the ODBC Administrator in Control Panel, you can specify the particular database that is associated with a data source that an ODBC application program is written to use. Think of an ODBC data source as a door with a name on it. Each door will lead you to a particular database. For example, the data source named Sales Figures might be a SQL Server database, whereas the Accounts Payable data source could refer to an Access database. The physical database referred to by a data source can reside anywhere on the LAN.
28

Maybe not, but the compiler (ODBC) gives you the opportunity to write cleaner programs, which means you finish sooner. Meanwhile, computers get faster every year.

JDBC In an effort to set an independent database standard API for Java; Sun Microsystems developed Java Database Connectivity, or JDBC. JDBC offers a generic SQL database access mechanism that provides a consistent interface to a variety of RDBMSs. This consistent interface is achieved through the use of plug-in database connectivity modules, or drivers. JDBC was announced in March of 1996. It was released for a 90 day public review that ended June 8, 1996. Because of user input, the final JDBC v1.0 specification was released soon after. The remainder of this section will cover enough information about JDBC for you to know what it is about and how to use it effectively. This is by no means a complete overview of JDBC. That would fill an entire book.

JDBC Goals Few software packages are designed without goals in mind. JDBC is one that, because of its many goals, drove the development of the API. These goals, in conjunction with early reviewer feedback, have finalized the JDBC class library into a solid framework for building database applications in Java. The goals that were set for JDBC are important. They will give you some insight as to why certain classes and functionalities behave the way they do. The eight design goals for JDBC are as follows:

i.SQL Level API

The designers felt that their main goal was to define a SQL interface for Java. Although not the lowest database interface level possible, it is at a low enough level for higher-level tools and APIs to be created. Conversely, it is at a high enough level for application programmers to use it confidently.

29

ii.SQL Conformance
SQL syntax varies as you move from database vendor to database vendor. In an effort to support a wide variety of vendors, JDBC will allow any query statement to be passed through it to the underlying database driver. This allows the connectivity module to handle non-standard functionality in a manner that is suitable for its users.

iii.JDBC must be implemental on

top

of

common

database interfaces

The JDBC SQL API must sit on top of other common SQL level APIs. This goal allows JDBC to use existing ODBC level drivers by the use of a software interface. This interface would translate JDBC calls to ODBC and vice versa.

iv.Provide a Java interface that is consistent with the rest of the Java system Because of Javas acceptance in the user community thus far, the designers feel that they should not stray from the current design of the core Java system. v.Keep it simple This goal probably appears in all software design goal listings. JDBC is no exception. Sun felt that the design of JDBC should be very simple, allowing for only one method of completing a task per mechanism. Allowing duplicate functionality only serves to confuse the users of the API. vi.Use strong, static typing wherever possible Strong typing allows for more error checking to be done at compile time; also, less error appear at runtime. vii.Keep the common cases simple Because more often than not, the usual SQL calls used by the programmer are simple SELECTs, INSERTs, DELETEs and UPDATEs, these queries should be simple to perform with JDBC. However, more complex SQL statements should also be possible. Finally we decided to proceed the implementation using JavaNetworking. And for dynamically updating the cache table we go for MSAccess database. Java has two things: a programming language and a platform.

30

Java is a high-level programming language that is all of the following:-

Simple Object-oriented Distributed Interpreted Robust Secure

ArchitecturePortable High-performance Multithreaded Dynamic Neutral

Java is also unusual in that each Java program is both compiled and interpreted. With a compile you translate a Java program into an intermediate language called Java byte codes the platformindependent code instruction is passed and run on the computer.

JavaProgram

Interpreter

Compilers

My Program

Fig: 8.1.5

You can think of Java byte codes as the machine code instructions for the, Java Virtual Machine (Java VM). Every Java interpreter, whether its a Java development tool or a Web browser that can run Java applets, is an implementation of the Java VM. The Java VM can also be implemented in hardware.

31

CHAPTER-9 CONCLUSION
In this paper, we presented a novel load-balancing law for cooperative CDN networks. We first defined a model of such networks based on a fluid flow characterization. We hence moved to the definition of an algorithm that aims at achieving load balancing in the network by removing local queue instability conditions through redistribution of potential excess traffic to the set of neighbors of the congested server. The algorithm is first introduced in its timecontinuous formulation and then put in a discrete version specifically conceived for its actual implementation and deployment in an operational scenario. Through the help of simulations, we demonstrated both the scalability and the effectiveness of our proposal, which outperforms most of the potential alternatives that have been proposed in the past. The present work represents for us a first step toward the realization of a complete solution for load balancing in a cooperative, distributed environment.

32

CHAPTER-10

FUTURE ENHANCEMENT
Our future work will be devoted to the actual implementation of our solution in a real system, so to arrive at a first prototype of a load-balanced, cooperative CDN network to be used both as a proof-of-concept implementation of the results obtained through simulations and as a playground for further research in the more generic field of content-centric network management.

33

CHAPTER-11 REFERENCE
[1] S. Manfredi, F. Oliviero, and S. P. Romano, Distributed management for load balancing in content delivery networks, in Proc. IEEE GLOBECOM Workshop, Miami, FL, Dec. 2010, pp. 579583. [2] H. Yin, X. Liu, G. Min, and C. Lin, Content delivery networks: A Bridge between emerging applications and future IP networks, IEEE Netw., vol. 24, no. 4, pp. 5256, Jul.Aug. 2010. [3] J. D. Pineda and C. P. Salvador, On using content delivery networks to improve MOG performance, Int. J. Adv. Media Commun., vol. 4, no. 2, pp. 182201, Mar. 2010. [4] D. D. Sorte,M. Femminella, A. Parisi, andG. Reali, Network delivery of live events in a digital cinema scenario, in Proc. ONDM,Mar. 2008, pp. 16. [5] Akamai, Akamai, 2011 [Online]. Available: http://www.akamai.com/index.html [6] Limelight Networks, Limelight Networks, 2011 [Online]. Available: http://.uk.llnw.com [7] CDNetworks, CDNetworks, 2011 [Online]. Available: http://

www.us.cdnetworks.com/index.php [8] Coral, The Coral Content Distribution Network, 2004 [Online]. Available:

http://www.coralcdn.org [9] Network Systems Group, Projects, Princeton University, Princeton, NJ, 2008 [Online]. Available: http://nsg.cs.princeton.edu/projects [10] A. Barbir, B. Cain, and R. Nair, Known content network (CN) request- routing mechanisms, IETF, RFC 3568 Internet Draft, Jul 2003 [Online]. Available:

http://tools.ietf.org/html/rfc3568 [11] T. Brisco, DNS support for load balancing, IETF, RFC 1794 Internet Draft, Apr 1995 [Online] Available: http://www.faqs.org/rfcs/ rfc1794.html

34

[12] M. Colajanni, P. S. Yu, and D. M. Dias, Analysis of task assignment policies in scalable distributedWeb-server systems, IEEE Trans. Parallel Distributed Syst., vol. 9, no. 6, pp. 585 600, Jun. 1998 [13] D. M. Dias, W. Kish, R. Mukherjee, and R. Tewari, A scalable and highly availableWeb server, in Proc. IEEE Comput. Conf., Feb. 1996, pp. 8592. [14] C. V. Hollot, V. Misra,D. Towsley, andW.Gong, Analysis and design of controllers for AQM routers supporting TCP flows, IEEE Trans. Autom. Control, vol. 47, no. 6, pp. 945959, Jun. 2002. [15] C. V. Hollot, V. Misra, D. Towsley, and W. bo Gong, A control theoretic analysis of red, in Proc. IEEE INFOCOM, 2001, pp. 15101519. [16] J. Aweya, M. Ouellette, and D. Y. Montuno A control theoretic approach to active queue management Computer Netw, vol. 36, no. 23, pp. 203235, Jul. 2001 [17] F. Blanchini, R. L. Cigno, and R. Tempo, Robust rate control for integrated services packet networks, IEEE/ACM Trans. Netw., vol. 10, no. 5, pp. 644652, Oct. 2002. [18] V.Misra,W. Gong, W. bo Gong, and D. Towsley, Fluid-based analysis of a network of AQM routers supporting TCP flows with an application to red, Proc. ACM SIGCOMM, pp. 151160, 2000. [19] D. Cavendish, M. Gerla, and S. Mascolo, A control theoretical approachto congestion control in packet networks, IEEE/ACM Trans.Netw., vol. 12, no. 5, pp. 893906, Oct. 2004. [20] V. Cardellini, E. Casalicchio, M. Colajanni, and P. S. Yu, The stateof the art in locally distributedWeb-server systems, Computer Surveys,vol. 34, no. 2, pp. 263311, Jun. 2002

35