This essay has been submitted by a student. This is not an example of the work written by our professional essay writers.
Since 2005, IEEE 802.11-based networks have been able to provide a certain level of quality of service (QoS) by the means of service differentiation, due to the IEEE 802.11e amendment. However, no mechanism or method has been standardized to accurately evaluate the amount of resources remaining on a given channel. Such an evaluation would, however, be a good asset for bandwidth-constrained applications. In multihop ad hoc networks, such evaluation becomes even more difficult. Consequently, despite the various contributions around this research topic, the estimation of the available bandwidth still represents one of the main issues in this field. In this paper, we propose an improved mechanism to estimate the available bandwidth in IEEE 802.11-based ad hoc networks. Through simulations, we compare the accuracy of the estimation we propose to the estimation performed by other state-of-the-art QoS protocols, BRuIT, AAC, and QoS-AODV.
The ad hoc networking community assumes that the underlying wireless technology is the IEEE 802.11 standard due to the broad availability of interface cards and simulation models.
This standard has not been targeted especially for multihop ad hoc operation, and it is therefore not perfectly suited to this type.
An accurate evaluation of the capabilities of the routes is necessary. Most of the current QoS proposals leave this problem aside, relying on the assumption that the link layer protocols are able to perform such an evaluation.
In this system they are using 802.11 MAC layer to evaluate the correct bandwidth.
This method combines channel monitoring to estimate each node's medium occupancy.
Probabilistic combination of the values is to account for synchronization between nodes, estimation of the collision probability between each couple of nodes, and variable overhead's impact estimation.
This mechanism only requires one-hop information communication and may be applied without generating a too high additional overhead.
We show the accuracy of the available bandwidth measurement through NS-2 simulations.
These results show that single-hop flows and multihop flows are admitted more accurately, resulting in a better stability and overall performance.
Scope of the Project
The scope of the project is to reduce the collision and we want to improve the Throughput value and finally we find the Bandwidth.
AD hoc networks are autonomous, self-organized, wireless, and mobile networks. They do not require setting up any fixed infrastructure such as access points, as the nodes organize themselves automatically to transfer data packets and manage topology changes due to mobility. Many of the current contributions in the ad hoc networking community assume that the underlying wireless technology is the IEEE 802.11 standard due to the broad availability of interface cards and simulation models. This standard provides an ad hoc mode, allowing mobiles to communicate directly. As the communication range is limited by regulations, a distributed routing protocol is required to allow long distance communications. However, this standard has not been targeted especially for multihop ad hoc operation, and it is therefore not perfectly suited to this type of networks. Nowadays, several applications generate multimedia data flows or rely on the proper and efficient transmission of sensitive control traffic. These applications may benefit from a quality of service (QoS) support in the network. That is why this domain has been extensively studied and more and more QoS solutions are proposed for ad hoc networks. However, the term QoS is vague and gathers several concepts. Some protocols intend to offer strong guarantees to the applications on the transmission characteristics, for instance bandwidth, delay, packet loss, or network load. Other solutions, which seem more suited to a mobile environment, only select the best route among all possible choices regarding the same criteria. In both cases, an accurate evaluation of the capabilities of the routes is necessary. Most of the current QoS proposals leave this problem aside, relying on the assumption that the link layer protocols are able to perform such an evaluation. However, they are not. The resource evaluation problem is far from being trivial as it must take into account several phenomena related to the wireless environment but also dependent on less measurable parameters such as the node mobility.
The IEEE 802.11-based networks have been able to provide a certain level of quality of service (QoS) by the means of service differentiation, due to the IEEE 802.11e amendment. Such an evaluation would, however, be a good asset for bandwidth-constrained applications. In multihop ad hoc networks, such evaluation becomes even more difficult. Consequently, despite the various contributions around this research topic, the estimation of the available bandwidth still represents one of the main issues in this field.
1.End-to-End Available Bandwidth: Measurement Methodology, Dynamics, and Relation With TCP Throughput Manish Jain and Constantinos Dovrolis, Member, IEEE
We described an original end-to-end available bandwidth measurement methodology, called SLoPS. The key idea in SLoPS is that the one-way delays of a periodic stream show increasing trend if the stream rate is greater than the avail-bw. Such an end-to-end avail-bw measurement methodology can have numerous applications, such as tuning TCP's ssthresh parameter, overlay networks and end-system multicast, rate
adaptation in streaming applications, end-to-end admission control, server selection and anycasting, and verification of service level aggrements (SLAs).We have implemented SLoPS in a tool called pathload, and showed through simulations and Internet experiments that pathload is nonintrusive and that it measures avail-bw accurately under various load conditions and typical path configurations. We finally examined the variability of avail-bw in different paths and load conditions, as well as the relationship between TCP throughput and avail-bw.
2. Determining Intra-Flow Contention along Multihop Paths inWireless Networks Kimaya Sanzgiri Ian D. Chakeresô€€€ Elizabeth M. Belding-Royer Dept. of Computer Science ô€€€ Dept. of Electrical & Computer Engineering University of California, Santa Barbara
firstname.lastname@example.org, email@example.com, firstname.lastname@example.org
In this paper, we propose two new approaches to determine intra-flow contention, i.e. the number of nodes on a multihop path that contend for medium access. Our approaches, Pre-Reply Probe (PRP) and Route Request Tail (RRT), are based on the fundamental idea that carriersensing information, such as the duration of sensed transmissions,
can be used to gather information about carriersensing neighbors. This idea is the central contribution of this paper. We compare our approaches with the intra-flow contention determination mechanism of the Contention- Aware Admission Control Protocol (CACP). Simulation results show that although PRP and RRT are slightly less accurate
than CACP, the small error is heavily outweighed by benefits such as reduced network load, lower energy consumption and faster response time. Our future work consists of enhancement of the proposed protocols to improve accuracy, possibly using other types of carrier-sensing information.
Acknowledgment: This work is supported in part by NSF Career Award CNS-0347886.
3. Bandwidth Estimation: Metrics, Measurement Techniques, and Tools
Ravi Prasad and Constantinos Dovrolis, Georgia Institute of Technology Margaret Murray and kc claffy, Cooperative Association for Internet Data Analysis (CAIDA)
IP networks do not provide explicit feedback to end hosts regarding the load or capacity of the network. Instead, hosts use active end-to-end measurements in an attempt to estimate the bandwidth characteristics of paths they use. This article surveys the state of the art in bandwidth estimation techniques, reviewing metrics and methodologies employed
and the tools that implement them. Several challenges remain. First, the accuracy of bandwidth estimation techniques must be improved, especially in high-bandwidth paths (e.g., greater than 500 Mb/s). Second, bandwidth estimation tools and techniques in this article assume that routers serve packets on a first come first served basis. It is
not clear how these techniques will perform in routers with_ Table 1. Taxonomy of publicly available bandwidth estimation tools.
pathchar Jacobson Per-hop capacity Variable packet size clink Downey Per-hop capacity Variable packet size pchar Mah Per-hop capacity Variable packet size bprobe Carter End-to-end capacity Packet pairs
nettimer Lai End-to-end capacity Packet pairs pathrate Dovrolis-Prasad End-to-end capacity Packet pairs and trains sprobe Saroiu End-to-end capacity Packet pairs cprobe Carter End-to-end available bandwidth Packet trains pathload Jain-Dovrolis End-to-end available Self-loading periodic bandwidth streams IGI Hu End-to-end available Self-loading periodic bandwidth streams pathChirp Ribeiro End-to-end available Self-loading packet bandwidth chirps treno Mathis Bulk transfer capacity Emulated TCP throughput cap Allman Bulk transfer capacity Standardized TCP throughput ttcp Muuss Achievable TCP throughput TCP connection Iperf NLANR Achievable TCP throughput Parallel TCP connections Netperf NLANR Achievable TCP throughput Parallel TCP connections thor Measurement metric Methodology
IEEE Network â€¢ November/December 2003 35 multiple queues (e.g., for different classes of service) or with virtual output-input queues. Finally, much work remains on how to best use bandwidth estimates to support
applications, middleware, routing, and traffic engineering techniques, in order to improve end-to-end performance and enable new services.
4. QoS-Aware Routing Based on Bandwidth Estimation
for Mobile Ad Hoc Networks Lei Chen, Student Member, IEEE, and Wendi B. Heinzelman, Member, IEEE
This paper proposes incorporating QoS into routing, and introduces bandwidth estimation by disseminating bandwidth information through "Hello" messages. A cross-layer approach, including an adaptive feedback scheme and an admission scheme to provide information to the application about the network status, are implemented. Simulations show that our QoS-aware routing protocol can improve packet delivery ratio greatly without impacting the overall end-to-end throughput, while also decreasing the packet delay and the energy consumption significantly. We have compared two different methods of estimating bandwidth. The "Hello" bandwidth estimation method performs better than the "Listen" bandwidth estimation method when releasing bandwidth immediately is important. The "Hello" and "Listen" schemes work equally well in static topologies by using large weight factors to reduce the congestion and minimize the chance of lost "Hello" messages incorrectly signaling a broken route. In a mobile topology, "Hello" performs better in term of end-to-end throughput, and "Listen" performs better in term of packet delivery ratio. From the perspective of overhead,
"Listen" does not add extra overhead, but "Hello" does add overhead by attaching neighbors' bandwidth consumption information in the "Hello" messages. In our protocol, we have not incorporated any predictive way
to foresee a route break, which causes a performance degradation in mobile topologies. Therefore, some methods such as preemptive
maintenance routing  and route maintenance based on signal strength  might help to reduce the transient time when the required QoS is not guaranteed due to a route break or network partition, so that the routing protocol can react much better to mobile topologies. The accurate measurement of the capacity of a multihop mobile network is an open issue right now. Further study of the 802.11 MAC layer's behavior could be helpful to understand this capacity issue. Also, in a real scenario, shadowing will cause a node's transmission range to vary, and it will not be the ideal circle that is assumed here. How to incorporate these nonidealities into our protocol is the subject of our future research. Furthermore, incorporating different transmission ranges
among all the hosts and analyzing fairness among the hosts will be explored in our future work. Our ultimate goal is to provide a model from the application layer to theMAC layer for supporting service differentiation. A transport layer protocol to support different data streams, queue management and a QoS-supported MAC will be addressed in our future work.
Implementation is the stage of the project when the theoretical design is turned out into a working system. Thus it can be considered to be the most critical stage in achieving a successful new system and in giving the user, confidence that the new system will work and be effective.
The implementation stage involves careful planning, investigation of the existing system and it's constraints on implementation, designing of methods to achieve changeover and evaluation of changeover methods.
Apply the RREQ And get RREP
Admission Control Mechanism
In this module we split the Data in to N number of Fixed size packet with Maximum length of 48 Characters.
Apply the RREQ and get RREP
The aim of the RREQ is to find a route between the sender and the receiver that meets the constraints specified by the application level in terms of Bandwidth.
Therefore, two flows with the same source and destination can follow different routes depending on the network state.
When a source node has data to send, it broadcasts a route request (RREQ) to its neighbors. The RREQ packet contains the address of the sender, and the requirements at the application level, the destination address, and a sequence number. The Intermediate Node or Destination Node sends RREP if it is free, otherwise, it silently discards the message.
Admission Control Mechanism
The Admission Control Mechanism is done in the receiver side. The Admission Control Mechanism has the all status of the node so if the nodes want to send RREP or discard the message, the particular node check the status by using the Admission Control Mechanism.
After the source nodes send the total message to the Destination Node finally we calculate the end to end delivery of the Bandwidth and Time delay.
In module given input and expected output
The source node selects the destination node first and then by using the browse button we select some text file and this text file is send to the destination side.
Apply the RREQ to Neighbor to Destination Node
Get the RREP from the neighbor or destination node
Use case Diagram
Select the node
Get the RREP
Send the data
View the details
2. SYSTEM STUDY
2.1 FEASIBILITY STUDY
The feasibility of the project is analyzed in this phase and business proposal is put forth with a very general plan for the project and some cost estimates. During system analysis the feasibility study of the proposed system is to be carried out. This is to ensure that the proposed system is not a burden to the company. For feasibility analysis, some understanding of the major requirements for the system is essential.
Three key considerations involved in the feasibility analysis are
This study is carried out to check the economic impact that the system will have on the organization. The amount of fund that the company can pour into the research and development of the system is limited. The expenditures must be justified. Thus the developed system as well within the budget and this was achieved because most of the technologies used are freely available. Only the customized products had to be purchased.
This study is carried out to check the technical feasibility, that is, the technical requirements of the system. Any system developed must not have a high demand on the available technical resources. This will lead to high demands on the available technical resources. This will lead to high demands being placed on the client. The developed system must have a modest requirement, as only minimal or null changes are required for implementing this system.
The aspect of study is to check the level of acceptance of the system by the user. This includes the process of training the user to use the system efficiently. The user must not feel threatened by the system, instead must accept it as a necessity. The level of acceptance by the users solely depends on the methods that are employed to educate the user about the system and to make him familiar with it. His level of confidence must be raised so that he is also able to make some constructive criticism, which is welcomed, as he is the final user of the system.
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:
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 platform-independent 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.
You can think of Java byte codes as the machine code instructions for the Java Virtual Machine (Java VM). Every Java interpreter, whether it's 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.
The Java Platform
A platform is the hardware or software environment in which a program runs. We've 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 operating system and hardware. The Java platform differs from most other platforms in that it's 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)
You've already been introduced to the Java VM. It's 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 that's running on the Java platform. As the figure shows, the Java API and the virtual machine insulate the program from the hardware.
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 just-in-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 you've surfed the Web, you're probably already familiar with applets. An applet is a program that adheres to certain conventions that allow it to 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.
Software components: Known as JavaBeansTM, can plug into existing component architectures.
Object serialization: Allows lightweight persistence and communication via Remote Method Invocation (RMI).
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.
How Will Java Technology Change My Life?
We can't 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, it's 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, its JavaBeans component architecture, and its wide-ranging, easily extendible API let you reuse other people's 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.
Microsoft Open Database Connectivity (ODBC) is a standard programming interface for application developers and database systems providers. Before ODBC became a de facto 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.
The ODBC system files are not installed on your system by Windows 95. Rather, they are installed when you setup a separate database application, such as SQL Server Client or Visual Basic 4.0. When the ODBC icon is installed in Control Panel, it uses a file called ODBCINST.DLL. It is also possible to administer your ODBC data sources through a stand-alone program called ODBCADM.EXE. There is a 16-bit and a 32-bit version of this program and each maintains a separate list of ODBC data sources.
From a programming perspective, the beauty of ODBC is that the application can be written to use the same set of function calls to interface with any data source, regardless of the database vendor. The source code of the application doesn't change whether it talks to Oracle or SQL Server. We only mention these two as an example. There are ODBC drivers available for several dozen popular database systems. Even Excel spreadsheets and plain text files can be turned into data sources. The operating system uses the Registry information written by ODBC Administrator to determine which low-level ODBC drivers are needed to talk to the data source (such as the interface to Oracle or SQL Server). The loading of the ODBC drivers is transparent to the ODBC application program. In a client/server environment, the ODBC API even handles many of the network issues for the application programmer.
The advantages of this scheme are so numerous that you are probably thinking there must be some catch. The only disadvantage of ODBC is that it isn't as efficient as talking directly to the native database interface. ODBC has had many detractors make the charge that it is too slow. Microsoft has always claimed that the critical factor in performance is the quality of the driver software that is used. In our humble opinion, this is true. The availability of good ODBC drivers has improved a great deal recently. And anyway, the criticism about performance is somewhat analogous to those who said that compilers would never match the speed of pure assembly language. Maybe not, but the compiler (or ODBC) gives you the opportunity to write cleaner programs, which means you finish sooner. Meanwhile, computers get faster every year.
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. If a database vendor wishes to have JDBC support, he or she must provide the driver for each platform that the database and Java run on.
To gain a wider acceptance of JDBC, Sun based JDBC's framework on ODBC. As you discovered earlier in this chapter, ODBC has widespread support on a variety of platforms. Basing JDBC on ODBC will allow vendors to bring JDBC drivers to market much faster than developing a completely new connectivity solution.
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.
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:
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. Attaining this goal allows for future tool vendors to "generate" JDBC code and to hide many of JDBC's complexities from the end user.
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.
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.
Provide a Java interface that is consistent with the rest of the Java system
Because of Java's acceptance in the user community thus far, the designers feel that they should not stray from the current design of the core Java system.
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.
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.
Keep the common cases simple
Because more often than not, the usual SQL calls used by the programmer are simple SELECT's, INSERT's, DELETE's and UPDATE's, 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 Java Networking.
And for dynamically updating the cache table we go for MS Access database.
Java ha two things: a programming language and a platform.
Java is a high-level programming language that is all of the following
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 platform-independent code instruction is passed and run on the computer.
Compilation happens just once; interpretation occurs each time the program is executed. The figure illustrates how this works.
You can think of Java byte codes as the machine code instructions for the Java Virtual Machine (Java VM). Every Java interpreter, whether it's 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.
Java byte codes help make "write once, run anywhere" possible. You can compile your Java program into byte codes on my platform that has a Java compiler. The byte codes can then be run any implementation of the Java VM. For example, the same Java program can run Windows NT, Solaris, and Macintosh.
The TCP/IP stack is shorter than the OSI one:
TCP is a connection-oriented protocol; UDP (User Datagram Protocol) is a connectionless protocol.
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 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 supplies logic to give a reliable connection-oriented protocol above IP. It provides a virtual circuit that two processes can use to communicate.
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.
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.
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.
8 bits are finally used for host addresses within our subnet. This places a limit of 256 machines that can be on the subnet.
The 32 bit address is usually written as 4 integers separated by dots.
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".
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.
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.
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 client-side 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 Licence (LGPL), which permits use in proprietary applications.
1. 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.
2. 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.
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.
4. Property Editors
The property editor mechanism in JFreeChart only handles a small subset of the properties that can be set for charts. Extend (or reimplement) this mechanism to provide greater end-user control over the appearance of the charts.
6. SYSTEM TESTING
The purpose of testing is to discover errors. Testing is the process of trying to discover every conceivable fault or weakness in a work product. It provides a way to check the functionality of components, sub assemblies, assemblies and/or a finished product It is the process of exercising software with the intent of ensuring that the
Software system meets its requirements and user expectations and does not fail in an unacceptable manner. There are various types of test. Each test type addresses a specific testing requirement.
TYPES OF TESTS
Unit testing involves the design of test cases that validate that the internal program logic is functioning properly, and that program inputs produce valid outputs. All decision branches and internal code flow should be validated. It is the testing of individual software units of the application .it is done after the completion of an individual unit before integration. This is a structural testing, that relies on knowledge of its construction and is invasive. Unit tests perform basic tests at component level and test a specific business process, application, and/or system configuration. Unit tests ensure that each unique path of a business process performs accurately to the documented specifications and contains clearly defined inputs and expected results.
Integration tests are designed to test integrated software components to determine if they actually run as one program. Testing is event driven and is more concerned with the basic outcome of screens or fields. Integration tests demonstrate that although the components were individually satisfaction, as shown by successfully unit testing, the combination of components is correct and consistent. Integration testing is specifically aimed at exposing the problems that arise from the combination of components.
Functional tests provide systematic demonstrations that functions tested are available as specified by the business and technical requirements, system documentation, and user manuals.
Functional testing is centered on the following items:
Valid Input : identified classes of valid input must be accepted.
Invalid Input : identified classes of invalid input must be rejected.
Functions : identified functions must be exercised.
Output : identified classes of application outputs must be exercised.
Systems/Procedures: interfacing systems or procedures must be invoked.
Organization and preparation of functional tests is focused on requirements, key functions, or special test cases. In addition, systematic coverage pertaining to identify Business process flows; data fields, predefined processes, and successive processes must be considered for testing. Before functional testing is complete, additional tests are identified and the effective value of current tests is determined.
System testing ensures that the entire integrated software system meets requirements. It tests a configuration to ensure known and predictable results. An example of system testing is the configuration oriented system integration test. System testing is based on process descriptions and flows, emphasizing pre-driven process links and integration points.
White Box Testing
White Box Testing is a testing in which in which the software tester has knowledge of the inner workings, structure and language of the software, or at least its purpose. It is purpose. It is used to test areas that cannot be reached from a black box level.
Black Box Testing
Black Box Testing is testing the software without any knowledge of the inner workings, structure or language of the module being tested. Black box tests, as most other kinds of tests, must be written from a definitive source document, such as specification or requirements document, such as specification or requirements document. It is a testing in which the software under test is treated, as a black box .you cannot "see" into it. The test provides inputs and responds to outputs without considering how the software works.
6.1 Unit Testing:
Unit testing is usually conducted as part of a combined code and unit test phase of the software lifecycle, although it is not uncommon for coding and unit testing to be conducted as two distinct phases.
Test strategy and approach
Field testing will be performed manually and functional tests will be written in detail.
All field entries must work properly.
Pages must be activated from the identified link.
The entry screen, messages and responses must not be delayed.
Features to be tested
Verify that the entries are of the correct format
No duplicate entries should be allowed
All links should take the user to the correct page.
6.2 Integration Testing
Software integration testing is the incremental integration testing of two or more integrated software components on a single platform to produce failures caused by interface defects.
The task of the integration test is to check that components or software applications, e.g. components in a software system or - one step up - software applications at the company level - interact without error.
Test Results: All the test cases mentioned above passed successfully. No defects encountered.
6.3 Acceptance Testing
User Acceptance Testing is a critical phase of any project and requires significant participation by the end user. It also ensures that the system meets the functional requirements.
Test Results: All the test cases mentioned above passed successfully. No defects encountered.