Professional Documents
Culture Documents
INTRODUCTION
1.1 Networking
Networking is the word basically relating to computers and their connectivity. It is
very often used in the world of computers and their use in different connections. The term
networking implies the link between two or more computers and their devices, with the vital
purpose of sharing the data stored in the computers, with each other. The networks between the
computing devices are very common these days due to the launch of various hardware and
computer software which aid in making the activity much more convenient to build and use.
Figure 2 Above diagrams show the clear idea about the networking functions
For the different computers to be able to distinguish between each other, every computer
has a unique ID called MAC-address (Media Access Control Address). This address is not only
unique on your network but unique for all devices that can be hooked up to a network. The
MAC-address is tied to the hardware and has nothing to do with IP-addresses. Since all
computers on the network receives everything that is sent out from all other computers the
MAC-addresses is primarily used by the computers to filter out incoming network traffic that is
addressed to the individual computer.
When a computer communicates with another computer on the network, it sends out both
the other computers MAC-address and the MAC-address of its own. In that way the receiving
computer will not only recognize that this packet is for me but also, who sent this data packet so
a return response can be sent to the sender.
On an Ethernet network as described here, all computers hear all network traffic since
they are connected to the same bus. This network structure is called multi-drop.
2
One problem with this network structure is that when you have, let say ten (10) computers on a
network and they communicate frequently and due to that they sends out there data packets
randomly, collisions occur when two or more computers sends data at the same time. When that
happens data gets corrupted and has to be resent. On a network that is heavy loaded even the
resent packets collide with other packets and have to be resent again. In reality this soon
becomes a bandwidth problem. If several computers communicate with each other at high speed
they may not be able to utilize more than 25% of the total network bandwidth since the rest of
the bandwidth is used for resending previously corrupted packets. The way to minimize this
problem is to use network switches.
peer-to-peer
server-based networks
1. Peer-to-Peer Network:
resources
and
usually
holds
the
resources
as
well.
This will help by giving you a central point to set up permissions on the data files, and it will
give you a central point from which to back up all of the data in case data loss should occur.
Network Communications:
Computer networks use signals to transmit data, and protocols are the languages
computers use to communicate.
Local area networks connect computers using a shared, half-duplex, baseband medium,
and wide area networks link distant networks.
Enterprise networks often consist of clients and servers on horizontal segments connected
by a common backbone, while peer-to-peer networks consist of a small number of computers
on a single LAN.
6. Speed:
Sharing and transferring files within networks is very rapid, depending on the type of network.
This will save time while maintaining the integrity of files.
2. LITERATURE SURVEY
1) Network performance anomaly detection and localization,
AUTHORS: P. Barford, N. Duffield, A. Ron, and J. Sommers
Detecting the occurrence and location of performance anomalies (e.g., high jitter or loss
events) is critical to ensuring the effective operation of network infrastructures. In this paper we
present a framework for detecting and localizing performance anomalies based on using an
active probe-enabled measurement infrastructure deployed on the periphery of a network. Our
framework has three components: an algorithm for detecting performance anomalies on a path,
an algorithm for selecting which paths to probe at a given time in order to detect performance
anomalies (where a path is defined as the set of links between two measurement nodes), and an
algorithm for identifying the links that are causing an identified anomaly on a path (i.e.,
localizing). The problem of detecting an anomaly on a path is addressed by comparing probebased measures of performance characteristics with performance guarantees for the network
(e.g., SLAs). The path selection algorithm is designed to enable a tradeoff between ensuring that
all links in a network are frequently monitored to detect performance anomalies, while
minimizing probing overhead. The localization algorithm is designed to use existing path
measurement data in such a way as to minimize the number of paths necessary for additional
probing in order to identify the link(s) responsible for an observed performance anomaly. We
assess the feasibility of our framework and algorithms by implementing them in ns-2 and
conducting a set of simulation-based experiments using several different network topologies. Our
results show that our method is able to accurately detect and localize performance anomalies in a
timely fashion and with lower probe and computational overheads than previously proposed
methodologies.
6
generated tests achieve high line coverage on average over 90% per tool (median: over 94%)
and significantly beat the coverage of the developers' own hand-written test suites. When we
did the same for 75 equivalent tools in the BUSYBOX embedded system suite, results were even
better, including 100% coverage on 31 of them. We also used KLEE as a bug finding tool,
applying it to 452 applications (over 430K total lines of code), where it found 56 serious bugs,
including three in COREUTILS that had been missed for over 15 years. Finally, we used KLEE
to cross-check purportedly identical BUSY-BOX and COREUTILS utilities, finding functional
correctness errors and a myriad of inconsistencies.
4. A NICE way to test Open Flow applications,
AUTHORS: M. Canini, D.Venzano, P. Peresini, D.Kostic, and J. Rexford,
The emergence of Open Flow-capable switches enables exciting new network functionality, at
the risk of programming errors that make communication less reliable. The centralized
programming model, where a single controller program manages the network, seems to reduce
the likelihood of bugs. However, the system is inherently distributed and asynchronous, with
events happening at different switches and end hosts, and inevitable delays affecting
communication with the controller. In this paper, we present efficient, systematic techniques for
testing unmodified controller programs. Our NICE tool applies model checking to explore the
state space of the entire system--the controller, the switches, and the hosts. Scalability is the main
challenge, given the diversity of data packets, the large system state, and the many possible event
orderings. To address this, we propose a novel way to augment model checking with symbolic
execution of event handlers (to identify representative packets that exercise code paths on the
controller). We also present a simplified Open Flow switch model (to reduce the state space), and
effective strategies for generating event interleaving likely to uncover bugs. Our prototype tests
Python applications on the popular NOX platform. In testing three real applications--a MAClearning switch, in-network server load balancing, and energy-efficient traffic engineering--we
uncover eleven bugs.
5. Network tomography of binary network performance characteristics,
8
AUTHORS: N. Duffield
In network performance tomography, characteristics of the network interior, such as link loss and
packet latency, are inferred from correlated end-to-end measurements. Most work to date is
based on exploiting packet level correlations, e.g., of multicast packets or unicast emulations of
them. However, these methods are often limited in scope-multicast is not widely deployed-or
require deployment of additional hardware or software infrastructure. Some recent work has
been successful in reaching a less detailed goal: identifying the lossiest network links using only
uncorrelated end-to-end measurements. In this paper, we abstract the properties of network
performance that allow this to be done and exploit them with a quick and simple inference
algorithm that, with high likelihood, identifies the worst performing links. We give several
examples of real network performance measures that exhibit the required properties. Moreover,
the algorithm is sufficiently simple that we can analyze its performance explicitly.
3. SYSTEM ANALYSIS
3.1 SYSTEM ANALYSIS
Networks are getting larger and more complex, yet administrators rely on rudimentary
tools such as and to debug problems. We propose an automated and systematic approach for
testing and debugging networks called Automatic Test Packet Generation (ATPG). ATPG reads
9
router configurations and generates a device-independent model. The model is used to generate a
minimum set of test packets to (minimally) exercise every link in the network or (maximally)
exercise every rule in the network. Test packets are sent periodically, and detected failures trigger
a separate mechanism to localize the fault. ATPG can detect both functional (e.g., incorrect
firewall rule) and performance problems (e.g., congested queue). ATPG complements but goes
beyond earlier work in static checking (which cannot detect liveness or performance faults) or
fault localization (which only localize faults given liveness results). We describe our prototype
ATPG implementation and results on two real-world data sets: Stanford Universitys backbone
network and Internet2. We find that a small number of test packets suffices to test all rules in
these networks: For example, 4000 packets can cover all rules in Stanford backbone network,
while 54 are enough to cover all links. Sending 4000 test packets 10 times per second consume
less than 1% of link capacity. ATPG code and the datasets are publicly available.
between data plane state and configuration specifications. The tool can also automatically
generate packets to test performance assertions such as packet latency.
It can also be specialized to generate a minimal set of packets that merely test every link
for network liveness.
ADVANTAGES OF PROPOSED SYSTEM:
A survey of network operators revealing common failures and root causes.
A test packet generation algorithm.
A fault localization algorithm to isolate faulty devices and rules.
ATPG use cases for functional and performance testing.
Evaluation of a prototype ATPG system using rule sets collected from the Stanford and
Internet2 backbones.
ECONOMICAL FEASIBILITY
TECHNICAL FEASIBILITY
SOCIAL FEASIBILITY
within the budget and this was achieved because most of the technologies used are freely
available. Only the customized products had to be purchased.
3.4.2 TECHNICAL FEASIBILITY
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.
3.5 MODULES
Test Packet Generation
Generate All-Pairs Reachability Table
ATPG Tool
Fault Localization
every queue. When generating test packets, ATPG must respect two key constraints First Port
(ATPG must only use test terminals that are available) and Header (ATPG must only use headers
that each test terminal is permitted to send).
3.6.2 Generate All-Pairs Reachability Table:
ATPG starts by computing the complete set of packet headers that can be sent from each test
terminal to every other test terminal. For each such header, ATPG finds the complete set of rules
it exercises along the path. To do so, ATPG applies the all-pairs reachability algorithm described.
On every terminal port, an all- header (a header that has all wild carded bits) is applied to the
transfer function of the first switch connected to each test terminal. Header constraints are
applied here.
3.6.3 ATPG Tool:
ATPG generates the minimal number of test packets so that every forwarding rule in the network
is exercised and covered by at least one test packet. When an error is detected, ATPG uses a fault
localization algorithm to determine the failing rules or links.
3.6.4 Fault Localization:
ATPG periodically sends a set of test packets. If test packets fail, ATPG pinpoints the fault(s) that
caused the problem. A rule fails if its observed behavior differs from its expected behavior. ATPG
keeps track of where rules fail using a result function Success and failure depend on the
nature of the rule: A forwarding rule fails if a test packet is not delivered to the intended output
port, whereas a drop rule behaves correctly when packets are dropped. Similarly, a link failure is
a failure of a forwarding rule in the topology function. On the other hand, if an output link is
congested, failure is captured by the latency of a test packet going above a threshold.
3.7.
INPUT DESIGN
The input design is the link between the information system and the user. It comprises the
developing specification and procedures for data preparation and those steps are necessary to put
transaction data in to a usable form for processing can be achieved by inspecting the computer to
read data from a written or printed document or it can occur by having people keying the data
directly into the system. The design of input focuses on controlling the amount of input required,
controlling the errors, avoiding delay, avoiding extra steps and keeping the process simple. The
input is designed in such a way so that it provides security and ease of use with retaining the
13
objectives.
Convey information about past activities, current status or projections of the
Future.
Signal important events, opportunities, problems, or warnings.
Trigger an action.
Confirm an action.
Hard Disk
40 GB.
Floppy Drive
1.44 Mb.
Monitor
15 VGA Colour.
Mouse
Logitech.
Ram
512 Mb.
Windows XP/7.
Coding Language
JAVA
IDE
Eclipse Kepler
4. SYSTEM DESIGN
4.1 SYSTEM ARCHITECTURE:
15
16
Test Packet
DB
Fault Localization
N
All Pairs Reachability
Router
N
Parser
Router
Router
and components.
7. Integrate best practices.
18
19
20
21
5. SOFTWARE ENVIRONMENT
5.1 Java Technology
Java technology is both a programming language and a platform.
22
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 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 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.
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
24
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.
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 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
25
The essentials: Objects, strings, threads, numbers, input and output, data
structures, system properties, date and time, and so on.
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.
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.
26
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 peoples tested code and introduce fewer bugs.
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.
5.2 ODBC
Microsoft Open Database Connectivity (ODBC) is a standard programming interface for
application developers and database systems providers. Before ODBC became a de facto
27
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 standalone program called ODBCADM.EXE. There is a 16-bit and a 32-bit version of this program
and
each
maintains
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 doesnt 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 isnt as efficient as talking directly to
28
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.
5.3 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. 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 JDBCs 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.
5.3.1
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
29
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.
4. 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.
5. 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.
6. Use strong, static typing wherever possible
30
Strong typing allows for more error checking to be done at compile time; also, less error
appear at runtime.
7. 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.
Java ha two things: a programming language and a platform. Java is a high-level
programming language that is all of the following
Simple
Architecture-neutral
Object-oriented
Portable
Distributed
High-performance
Interpreted
multithreaded
Robust
Dynamic
Secure
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.
31
Interpreter
Java Program
Compilers
My Program
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.
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.
5.4 Networking
TCP/IP stack
The TCP/IP stack is shorter than the OSI one:
32
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.
33
Total address
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.
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
34
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 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.
3. 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,
35
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.
5.5 MySQL
MySQL, the most popular Open Source SQL database management system, is developed,
distributed, and supported by Oracle Corporation.
The MySQL Web site (http://www.mysql.com/) provides the latest information about MySQL
software.
MySQL
software
uses
the
GPL
(GNU
General
Public
License),
http://www.fsf.org/licenses/, to define what you may and may not do with the software in
different situations. If you feel uncomfortable with the GPL or need to embed MySQL
code into a commercial application, you can buy a commercially licensed version from
us.
See
the
MySQL
Licensing
Overview
for
more
information
(http://www.mysql.com/company/legal/licensing/).
The MySQL Database Server is very fast, reliable, scalable, and easy to use.
If that is what you are looking for, you should give it a try. MySQL Server can run
comfortably on a desktop or laptop, alongside your other applications, web servers, and
so on, requiring little or no attention. If you dedicate an entire machine to MySQL, you
can adjust the settings to take advantage of all the memory, CPU power, and I/O capacity
available. MySQL can also scale up to clusters of machines, networked together.
You can find a performance comparison of MySQL Server with other database managers
on our benchmark page.
37
MySQL Server was originally developed to handle large databases much faster than
existing solutions and has been successfully used in highly demanding production
environments for several years. Although under constant development, MySQL Server
today offers a rich and useful set of functions. Its connectivity, speed, and security make
MySQL Server highly suited for accessing databases on the Internet.
The official way to pronounce MySQL is My Ess Que Ell (not my sequel), but we do not
mind if you pronounce it as my sequel or in some other localized way.
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
38
6.1TYPES OF TESTS
Unit testing
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 testing
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
Invalid Input
Functions
Output
40
Test objectives
Features to be tested
41
7. SAMPLE CODE
Node .Java
/package pro.atpg.ui;
import java.awt.Color;
import java.awt.GridLayout;
import java.awt.event.ActionEvent;
import java.awt.event.ActionListener;
import java.util.ArrayList;
import java.util.Random;
import java.util.Vector;
import javax.swing.BorderFactory;
import javax.swing.JButton;
import javax.swing.JFrame;
import javax.swing.JLabel;
import javax.swing.JOptionPane;
import javax.swing.JPanel;
import javax.swing.JScrollPane;
import javax.swing.JTable;
import javax.swing.JTextArea;
import javax.swing.JTextField;
import javax.swing.UIManager;
import javax.swing.table.DefaultTableModel;
import org.jvnet.substance.SubstanceLookAndFeel;
import pro.atpg.bo.Packet;
import pro.atpg.bo.Ticket;
import pro.atpg.impl.NodeReceiver;
import pro.atpg.impl.Sender;
import pro.atpg.utility.ATPGUtil;
public class Node implements ActionListener {
public int portSelection=1;
public String nodeName;
public static int WIDTH=1200;
public static int HEIGHT=700;
public JFrame mainform;
public JPanel leftPanel;
public JPanel rightPanel;
public JPanel leftTopPanel;
42
}
public void mainMethod(){
new ATPGUtil();
while(true){
String inp=JOptionPane.showInputDialog("Enter the Node
Name");
if(inp!=null && inp.length()>0){
nodeName=inp.toUpperCase();
break;
}
}
for(int port:ATPGUtil.portMap.get(nodeName)){
new NodeReceiver(port,nodeName);
}
mainform=new JFrame("Node : "+nodeName);
mainform.setLayout(new GridLayout(1,2));
mainform.add(leftPanelUI());
mainform.add(rightPanelUI());
mainform.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);
mainform.setResizable(false);
mainform.setSize(WIDTH,HEIGHT);
mainform.setVisible(true);
}
public JPanel leftPanelUI(){
leftPanel=new JPanel();
leftPanel.setBorder(BorderFactory.createLineBorder(Color.GRAY));
leftPanel.setLayout(new GridLayout(2,1));
leftPanel.add(leftTopPanelUI());
leftPanel.add(leftBottomPanelUI());
return(leftPanel);
}
public JPanel rightPanelUI(){
rightPanel=new JPanel();
rightPanel.setBorder(BorderFactory.createLineBorder(Color.GRAY));
rightPanel.setLayout(new GridLayout(2,1));
rightPanel.add(rightTopPanelUI());
rightPanel.add(rightBottomPanelUI());
return(rightPanel);
}
public JPanel leftTopPanelUI(){
44
leftTopPanel=new JPanel();
leftTopPanel.setBorder(BorderFactory.createTitledBorder("Data Send"));
leftTopPanel.setLayout(null);
destinationLabel=new JLabel("Destination");
destinationLabel.setBounds(30,30,100,25);
destinationText=new JTextField();
destinationText.setBounds(30,60,350,25);
dataLabel=new JLabel("Data");
dataLabel.setBounds(30,95,100,25);
dataText=new JTextArea();
dataText.setBounds(30,125,350,180);
sendButton=new JButton("Send");
sendButton.setBounds(400,125,100,25);
sendButton.addActionListener(this);
clearButton=new JButton("Clear");
clearButton.setBounds(400,170,100,25);
clearButton.addActionListener(this);
leftTopPanel.add(destinationLabel);
leftTopPanel.add(destinationText);
leftTopPanel.add(dataLabel);
leftTopPanel.add(dataText);
leftTopPanel.add(sendButton);
leftTopPanel.add(clearButton);
return(leftTopPanel);
}
public JPanel leftBottomPanelUI(){
leftBottomPanel=new JPanel();
leftBottomPanel.setBorder(BorderFactory.createTitledBorder("Ticket
Send"));
leftBottomPanel.setLayout(null);
ticketTitleLabel=new JLabel("Title");
ticketTitleLabel.setBounds(30,30,100,25);
ticketTitleText=new JTextField();
ticketTitleText.setBounds(30,60,350,25);
ticketDescLabel=new JLabel("Description");
ticketDescLabel.setBounds(30,95,100,25);
ticketDescText=new JTextArea();
ticketDescText.setBounds(30,125,350,180);
ticketSendButton=new JButton("Post");
ticketSendButton.setBounds(400,125,100,25);
ticketSendButton.addActionListener(this);
ticketClearButton=new JButton("Clear");
ticketClearButton.setBounds(400,170,100,25);
ticketClearButton.addActionListener(this);
leftBottomPanel.add(ticketTitleLabel);
leftBottomPanel.add(ticketTitleText);
45
leftBottomPanel.add(ticketDescLabel);
leftBottomPanel.add(ticketDescText);
leftBottomPanel.add(ticketSendButton);
leftBottomPanel.add(ticketClearButton);
return(leftBottomPanel);
}
public JPanel rightTopPanelUI(){
rightTopPanel=new JPanel();
rightTopPanel.setLayout(null);
sendInfoLabel=new JLabel("Sending Packet Information");
sendInfoLabel.setBounds(20,20,200,25);
sendInfoModel=new DefaultTableModel();
sendInfoTable=new JTable(sendInfoModel);
sendInfoModel.addColumn("File Number");
sendInfoModel.addColumn("Packer Number");
sendInfoModel.addColumn("Destination Address");
sendInfoModel.addColumn("Forward Address");
sendInfoModel.addColumn("Forward Port");
sendInfoScroll=new JScrollPane(sendInfoTable);
sendInfoScroll.setBounds(20,50,550,250);
rightTopPanel.add(sendInfoScroll);
rightTopPanel.add(sendInfoLabel);
return(rightTopPanel);
}
public JPanel rightBottomPanelUI(){
rightBottomPanel=new JPanel();
rightBottomPanel.setLayout(null);
receiveInfoLabel=new JLabel("Receiving Packet Information");
receiveInfoLabel.setBounds(20,20,200,25);
receiveInfoModel=new DefaultTableModel();
receiveInfoTable=new JTable(receiveInfoModel);
receiveInfoModel.addColumn("File Number");
receiveInfoModel.addColumn("Packer Number");
receiveInfoModel.addColumn("Source Address");
receiveInfoModel.addColumn("Receiving Address");
receiveInfoModel.addColumn("Receiving Port");
receiveInfoScroll=new JScrollPane(receiveInfoTable);
receiveInfoScroll.setBounds(20,50,550,250);
rightBottomPanel.add(receiveInfoScroll);
rightBottomPanel.add(receiveInfoLabel);
return(rightBottomPanel);
}
public static void main(String args[]){
Node node=new Node();
46
node.mainMethod();
}
@Override
public void actionPerformed(ActionEvent e) {
// TODO Auto-generated method stub
Object action=e.getSource();
if(action==sendButton){
String destination=destinationText.getText();
String content=dataText.getText();
ArrayList<String> neigh=ATPGUtil.neighMap.get(nodeName);
for(String str:neigh){
Packet pac=new Packet();
pac.sourceAddress=ATPGUtil.ipMap.get(nodeName);
pac.sourceName=nodeName;
pac.fromAddress=ATPGUtil.ipMap.get(nodeName);
pac.fromName=nodeName;
pac.toAddress=ATPGUtil.ipMap.get(str);
pac.toName=str;
pac.toPort=ATPGUtil.portMap.get(str).get(portSelection1);
pac.destinationAddress=ATPGUtil.ipMap.get(destination);
pac.destinationName=destination;
pac.fileNumber=new Random().nextInt(100);
pac.packetNumber=1;
pac.packetData=content;
pac.type="original";
pac.fileSize=content.length();
pac.toalPacketSize=1;
pac.paths=new ArrayList<String>();
pac.paths.add(nodeName);
Vector<String> vec1=new Vector<String>();
vec1.add(""+pac.fileNumber);
vec1.add(""+pac.packetNumber);
vec1.add(pac.sourceName);
vec1.add(pac.toName);
vec1.add(""+pac.toPort);
Node.sendInfoModel.addRow(vec1);
sender.sendPacketObject(pac);
if(portSelection>=3){
portSelection=1;
}else{
portSelection+=1;
}
}
47
}else if(action==clearButton){
destinationText.setText("");
dataText.setText("");
}else if(action==ticketSendButton){
String title=ticketTitleText.getText();
String desc=ticketDescText.getText();
Ticket ticket=new Ticket();
ticket.sourceName=nodeName;
ticket.ticketNumber=new Random().nextInt(100);
ticket.title=title;
ticket.description=desc;
ticket.toAddress=ATPGUtil.TOOL_IP;
ticket.toPort=ATPGUtil.TOOL_PORT;
sender.sendTicketObject(ticket);
}
}
}
ATPGUTIL.JAVA
package pro.atpg.utility;
import java.io.File;
import java.io.FileInputStream;
import java.io.InputStream;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.Properties;
public class ATPGUtil {
public static String TOOL_IP;
public static int TOOL_PORT;
public static String testSourceName;
public static String testDestinationName;
public static HashMap<String,String> ipMap;
public static HashMap<String,ArrayList<String>> neighMap;
public static HashMap<String,ArrayList<Integer>> portMap;
public static String testContent="ABCD EFGH IJKL MNOP QRST UVWX YZ";
public ATPGUtil() {
int total=100;
48
for(int i=0;i<total;i++){
testContent+="::";
}
ipMap=new HashMap<String, String>();
neighMap=new HashMap<String, ArrayList<String>>();
portMap=new HashMap<String, ArrayList<Integer>>();
try{
Properties prop=new Properties();
InputStream input=new FileInputStream("config.properties");
prop.load(input);
String routers[]=prop.getProperty("router").split(",");
String nodes[]=prop.getProperty("node").split(",");
for(String router:routers){
ipMap.put(router,prop.getProperty("IP"+router));
ArrayList<String> tempNeigh=new ArrayList<String>();
if(prop.getProperty("Neigh"+router).indexOf(",")!=-1){
for(String.nei:prop.getProperty("Neigh"+router).split(",")){
tempNeigh.add(nei);
}
neighMap.put(router, tempNeigh);
}else{
tempNeigh.add(prop.getProperty("Neigh"+router));
neighMap.put(router, tempNeigh);
}
ArrayList<Integer> tempPort=new ArrayList<Integer>();
if(prop.getProperty("Port"+router).indexOf(",")!=-1){
for(String port:prop.getProperty("Port"+router).split(",")){
tempPort.add(Integer.parseInt(port));
}
portMap.put(router, tempPort);
}else{
49
tempPort.add(Integer.parseInt(prop.getProperty("Port"+router)));
portMap.put(router, tempPort);
}
}
for(String node:nodes){
ipMap.put(node,prop.getProperty("IP"+node));
ArrayList<String> tempNeigh=new ArrayList<String>();
if(prop.getProperty("Neigh"+node).indexOf(",")!=-1){
for(String nei:prop.getProperty("Neigh"+node).split(",")){
tempNeigh.add(nei);
}
neighMap.put(node, tempNeigh);
}else{
tempNeigh.add(prop.getProperty("Neigh"+node));
neighMap.put(node, tempNeigh);
}
ArrayList<Integer> tempPort=new ArrayList<Integer>();
if(prop.getProperty("Port"+node).indexOf(",")!=-1){
for(String port:prop.getProperty("Port"+node).split(",")){
tempPort.add(Integer.parseInt(port));
}
portMap.put(node, tempPort);
}else{
tempPort.add(Integer.parseInt(prop.getProperty("Port"+node)));
portMap.put(node, tempPort);
}
}
TOOL_IP=prop.getProperty("ToolIP");
TOOL_PORT=Integer.parseInt(prop.getProperty("ToolPort"));
50
testDestinationName=prop.getProperty("TestDestination");
testSourceName=prop.getProperty("TestSource");
}catch (Exception e) {
e.printStackTrace();
}
}
public static void main(String args[]){
File file=new File("config.properties");
System.out.println(file.getAbsolutePath());
new ATPGUtil();
}
}
8. SCREEN SHOTS
51
ATPG Tool
NODE 1
52
ROUTER 1
53
54
55
56
Receiving at Node 3
57
58
59
60
9. CONCLUSION
Testing liveness of a network is a fundamental problem for ISPs and large data center operators.
Sending probes between every pair of edge ports is neither exhaustive nor scalable [30]. It
suffices to find a minimal set of end-to-end packets that traverse each link. However, doing this
requires a way of abstracting across device specific configuration files (e.g., header space),
generating headers and the links they reach (e.g., all-pairs reachability), and finally determining a
minimum set of test packets (Min-Set-Cover). Even the fundamental problem of automatically
generating test packets for efficient liveness testing requires techniques akin to ATPG.
ATPG, however, goes much further than liveness testing with the same framework. ATPG can
test for reachability policy (by testing all rules including drop rules) and performance health (by
associating performance measures such as latency and loss with test packets). Our
implementation also augments testing with a simple fault localization scheme also constructed
using the header space framework. As in software testing, the formal model helps maximize test
61
coverage while minimizing test packets. Our results show that all forwarding rules in Stanford
backbone or Internet2 can be exercised by a surprisingly small number of test packets ( for
Stanford, and for Internet2).
Network managers today use primitive tools such as and. Our survey results indicate that they
are eager for more sophisticated tools. Other fields of engineering indicate that these desires are
not unreasonable: For example, both
the ASIC and software design industries are buttressed by billion-dollar tool businesses that
supply techniques for both static (e.g., design rule) and dynamic (e.g., timing) verification. In
fact, many months after we built and named our system, we discovered to our surprise that ATPG
was awell-known acronym in hardware chip testing, where it stands for Automatic Test Pattern
Generation [2]. We hope network ATPG will be equally useful for automated dynamic testing of
production networks.
10.
REFERENCES
Automatic
Test
Pattern
Generation,
2013
[Online].
Available:
http://en.wikipedia.org/wiki/Automatic_test_pattern_generation
[3] P. Barford, N. Duffield, A. Ron, and J. Sommers, Network performance anomaly detection
and localization, in Proc. IEEE INFOCOM, Apr. , pp. 13771385.
[4] Beacon, [Online]. Available: http://www.beaconcontroller.net/
[5] Y. Bejerano and R. Rastogi, Robust monitoring of link delays and faults in IP networks,
IEEE/ACM Trans. Netw., vol. 14, no. 5, pp. 10921103, Oct. 2006.
62
[6] C. Cadar, D. Dunbar, and D. Engler, Klee: Unassisted and automatic generation of highcoverage tests for complex systems programs, in Proc. OSDI, Berkeley, CA, USA, 2008, pp.
209224.
[7] M. Canini,D.Venzano, P. Peresini,D.Kostic, and J. Rexford, A NICE way to test OpenFlow
applications, in Proc. NSDI, 2012, pp. 1010.
[8] A. Dhamdhere, R. Teixeira, C. Dovrolis, and C. Diot, Netdiagnoser: Troubleshooting
network unreachabilities using end-to-end probes and routing data, in Proc. ACM CoNEXT,
2007, pp. 18:118:12.
[9] N. Duffield, Network tomography of binary network performance characteristics, IEEE
Trans. Inf. Theory, vol. 52, no. 12, pp. 53735388, Dec. 2006.
[10] N. Duffield, F. L. Presti, V. Paxson, and D. Towsley, Inferring link loss using striped
unicast probes, in Proc. IEEE INFOCOM, 2001, vol. 2, pp. 915923.
[11] N. G. Duffield and M. Grossglauser, Trajectory sampling for direct traffic observation,
IEEE/ACM Trans. Netw., vol. 9, no. 3, pp. 280292, Jun. 2001.
[12] P. Gill, N. Jain, and N. Nagappan, Understanding network failures in data centers:
Measurement, analysis, and implications, in Proc. ACM SIGCOMM, 2011, pp. 350361.
[13]
Hassel,
the
Header
Space
Library,
[Online].
Available:
https://bitbucket.org/peymank/hassel-public/
[14] Internet2, Ann Arbor, MI, USA, The Internet2 observatory data collections, [Online].
Available: http://www.internet2.edu/observatory/archive/data-collections.html
[15] M. Jain and C. Dovrolis, End-to-end available bandwidth: Measurement methodology,
dynamics, and relation with TCP throughput, IEEE/ACM Trans. Netw., vol. 11, no. 4, pp. 537
63
[25] H. Mai, A. Khurshid, R. Agarwal, M. Caesar, P. B. Godfrey, and S. T. King, Debugging the
data plane with Anteater, Comput. Commun. Rev., vol. 41, no. 4, pp. 290301, Aug. 2011.
[26] A. Markopoulou, G. Iannaccone, S. Bhattacharyya, C.-N. Chuah, Y. Ganjali, and C. Diot,
Characterization of failures in an operational ip backbone network, IEEE/ACM Trans. Netw.,
vol. 16, no. 4, pp. 749762, Aug. 2008.
[27] N. McKeown, T. Anderson, H. Balakrishnan, G. Parulkar, L. Peterson, J. Rexford, S.
Shenker, and J. Turner, Openflow: Enabling innovation in campus networks, Comput.
Commun. Rev., vol. 38, pp. 6974, Mar. 2008.
[28] OnTimeMeasure, [Online]. Available: http://ontime.oar.net/
[29] Open vSwitch, [Online]. Available: http://openvswitch.org/
[30] H. Weatherspoon, All-pairs ping service for PlanetLab ceased, 2005 [Online]. Available:
http://lists.planet-lab.org/pipermail/users/2005-July/001518.html
[31] M.Reitblatt,N.Foster, J. Rexford, C. Schlesinger, andD.Walker, Abstractions for network
update, in Proc. ACM SIGCOMM, 2012, pp. 323334.
[32] S. Shenker, The future of networking, and the past of protocols, 2011 [Online].Available:
http://opennetsummit.org/archives/oct11/shenkertue.pdf
[33]
Troubleshooting
the
network
survey,
2012
[Online].
Available:
http://eastzone.github.com/atpg/docs/NetDebugSurvey.pdf
[34] D. Turner, K. Levchenko, A. C. Snoeren, and S. Savage, California fault lines:
Understanding the causes and impact of network failures, Comput. Commun. Rev., vol. 41, no.
4, pp. 315326, Aug. 2010.
65
[35] P. Yalagandula, P. Sharma, S. Banerjee, S. Basu, and S.-J. Lee, S3: A scalable sensing
service for monitoring large networked systems, in Proc. INM, 2006, pp. 7176.
66