JAVA NETWORKING

An Agent Based Intrusion Detection, Response and Blocking using signature method in Active Networks

ABSTRACT
As attackers use automated methods to inflict widespread damage on vulnerable systems connected to the network, it has become painfully clear that traditional manual methods of protection do not suffice. This paper discusses an intrusion prevention approach, intrusion detection, response based on active networks that helps to provide rapid response to vulnerability advisories.

;                          

Bandwidth and Time Delay Calculation of Targeted Partners

ABSTRACT
Accurate measurement of network bandwidth is important for network management applications as well as flexible Internet applications and protocols which actively manage and dynamically adapt to changing utilization of network resources. Extensive work has focused on two approaches to measuring bandwidth: Measuring it hop-by-hop, and measuring it end-to-end along a path. Unfortunately, best-practice techniques for the former are inefficient and techniques for the latter are only able to observe bottlenecks visible at end-to-end scope.

             

Broken Links Handler

ABSTRACT
The presence of broken links is a serious problem plaguing the World Wide Web. Surveys show that 6% of the links on the web are broken. It reduces the usability of the world web. To deal with this problem, we implemented a web broken links handler check application with Java web interface. It can check the good links and bad ones in a web page. It has the functionality for checking a site, saving the checking result, canceling current check and so on. It differentiates external/internal links, for which internal link sites are recursively checked.

             

Chatting

ABSTRACT
Chatting is an application that lets you communicate using your text or other means with one or more people. Building an interactive chat room requires keeping the users up to date with the messages and status of other users. Chat lets you communicate with your contacts in real time so that you receive instant replies. Chatting is talking to other people who are using the Internet at the same time you are. Usually, this "talking" is the exchange of typed-in messages requiring one site as the repository for the messages (or "chat site") and a group of users who take part from anywhere on the Internet. In some cases, a private chat can be arranged between two parties who meet initially in a group chat. Chats can be ongoing or scheduled for a particular time and duration. Most chats are focused on a particular topic of interest and some involve guest experts or famous people who "talk" to anyone joining the chat.

             

Congestion Control Using Network Based Protocol

ABSTRACT
The Internet's excellent scalability and robustness result in part from the end-to-end nature of Internet congestion control. End-to-end congestion control algorithms alone, however, are unable to prevent the congestion collapse and unfairness created by applications that are unresponsive to network congestion. To address these maladies, we propose and investigate a novel congestion-avoidance mechanism called Congestion Free Router (CFR). CFR entails the exchange of feedback between routers at the borders of a network in order to detect and restrict unresponsive traffic flows before they enter the network, thereby preventing congestion within the network.

             

Mitigation Of Control Channel Jamming Under Node Capture Attacks

ABSTRACT
Availability of service in many wireless networks depends on the ability for network users to establish and maintain communication channels using control messages from base stations and other users. An adversary with knowledge of the underlying communication protocol can mount an efficient denial of service attack by jamming the communication channels used to exchange control messages. The use of spread spectrum techniques can deter an external adversary from such control channel jamming attacks. However, malicious colluding insiders or an adversary who captures or compromises system users is not deterred by spread spectrum, as they know the required spreading sequences. For the case of internal adversaries, we propose a framework for control channel access schemes using the random assignment of cryptographic keys to hide the location of control channels. We propose and evaluate metrics to quantify the probabilistic availability of service under control channel jamming by malicious or compromised users and show that the availability of service degrades gracefully as the number of colluding insiders or compromised users increases.

             

Data Collection Using Spanning Tree

ABSTRACT
Large-scale distributed applications are subject to frequent disruptions due to resource contention and failure. Such disruptions are inherently unpredictable and, therefore, robustness is a desirable property for the distributed operating environment. In this work, we describe and evaluate a robust topology for applications that operate on a spanning tree overlay network. Unlike previous work that is adaptive or reactive in nature, we take a proactive approach to robustness. The topology itself is able to simultaneously ithstand disturbances and exhibit good performance.

             

Data Transmission Using Multi-Tasking-Sockets

ABSTRACT
This Project a new socket class which supports both TCP and UDP communication. But it provides some advantages compared to other classes that you may find here or on some other Socket Programming articles. First of all, this class doesn't have any limitation like the need to provide a window handle to be used. This limitation is bad if all you want is a simple console application. So this library doesn't have such a limitation. It also provides threading support automatically for you, which handles the socket connection and disconnection to a peer. It also features some options not yet found in any socket classes that I have seen so far.

             

A Distributed Cycle Minimization Protocol For Peer-To-Peer Networks

ABSTRACT
In this project, we describe the Distributed Cycle Minimization Protocol (DCMP), a dynamic fully decentralized protocol that significantly reduces the duplicate messages by eliminating unnecessary cycles. As queries are transmitted through the peers, DCMP identifies the problematic paths and attempts to break the cycles while maintaining the connectivity of the network. In order to preserve the fault resilience and load balancing properties of unstructured P2P systems, DCMP avoids creating a hierarchical organization. Instead, it applies cycle elimination symmetrically around some powerful peers to keep the average path length small.

             

Designing Less-Structured Peer Request

ABSTRACT
We address the problem of highly transient populations in unstructured and loosely structured peer-to-peer (P2P) systems. We propose a number of illustrative query-related strategies and organizational protocols that, by taking into consideration the expected session times of peers (their lifespan), yield systems with performance characteristics more resilient to the natural instability of their environments. We first demonstrate the benefits of lifespan-based organizational protocols in terms of end-application performance and in the context of dynamic and heterogeneous Internet environments.

             

Detecting Malicious Packet Losses

ABSTRACT
we consider the problem of detecting whether a compromised router is maliciously manipulating its stream of packets. In particular, we are concerned with a simple yet effective attack in which a router selectively drops packets destined for some victim. Unfortunately, it is quite challenging to attribute a missing packet to a malicious action because normal network congestion can produce the same effect. Modern networks routinely drop packets when the load temporarily exceeds their buffering capacities. Previous detection protocols have tried to address this problem with a user-defined threshold: too many dropped packets imply malicious intent.

             

Development of an Internet Administration and Domain Tools

ABSTRACT
In the Internet Administration and Domain Tools a network service provider will have thousands of network elements of different kinds like eg, switches, routers, bridges, gateways and also of various makes eg, Cisco, Juniper, Nortel, etc.It is a suite of networking utilities/diagnostics tools. Internet Administration Domain Tools emulates common Unix TCP/IP utilities such as DNS, Finger, Ping, Time and Whois. It also has some additional utilities such as a multithreaded TCP port scanner and a default gateway finder. The Domain Administration Tool can use to manage security, servers, networks and workstations. With the Domain Administration Tool you can

             

Distributed Database Architecture for Global Roaming in Next Generation Mobile Networks

ABSTRACT
Global roaming is the basic service of the future mobile networks where terminal mobility and service provider portability must be supported. For this purpose, we need a project to introducing a location independent Personal Telecommunication Number (PTN). In this a PTN is assigned to every mobile user and with these PTNs, a user can easily move into the different locations and continue to receive subscribed services without changing their PTNs. A mobile subscriber can retain its lifelong PTN regardless of its location and service provider. In this we can connect directly from Home Location Register (HLR) to Visitors Location Register (VLR).In roaming concept we can reduce the database connectivity and the database loads. The proposed architecture effectively reduces the database loads as well as the signaling traffic incurred by the location registration and call delivery procedures.

             

Dual-Link Failure

ABSTRACT
Networks employ link protection to achieve fast recovery from link failures. While the first link failure can be protected using link protection, there areseveral alternatives for protecting against the second failure. This paper formally classifies the approaches to dual-link failure resiliency. One of the strategies to recover from dual-link failures is to employ link protection for the two failed links independently, which requires that two links may not use each other in their backup paths if they may fail simultaneously. Such a requirement is referred to as backup link mutual exclusion (BLME) constraint and the problem of identifying a backup path for every link that satisfies the above requirement is referred to as the BLME problem. This paper develops the necessary theory to establish the sufficient conditions for existence of a solution to the BLME problem. Solution methodologies for the BLME problem is developed using two approaches by: 1) formulating the backup path selection as an integer linear program; 2) developing a polynomial time heuristic based on minimum cost path routing.

Dynamic Load Balancing

ABSTRACT
The approach considers the heterogeneity in the processing rates of the nodes as well as the randomness in the delays imposed by the communication medium. The optimal one-shot load balancing policy is developed and subsequently extended to develop an autonomous and distributed load-balancing policy that can dynamically reallocate incoming external loads at each node. This adaptive and dynamic load balancing policy is implemented and evaluated in a two-node distributed system. The performance of the proposed dynamic load-balancing policy is compared to that of static policies as well as existing dynamic load-balancing policies by considering the average completion time per task and the system processing rate in the presence of random arrivals of the external loads.

             

Dynamic Routing with Security Considerations

ABSTRACT
Security has become one of the major issues for data communication over wired and wireless networks. Different from the past work on the designs of cryptography algorithms and system infrastructures, An analytic study on the proposed algorithm is presented, and experiments are conducted to verify the analytic results and to show the capability of the proposed algorithm.

             

Dynamic Source Routing Protocol

ABSTRACT
On-demand routing protocols use route caches to make routing decisions. Due to mobility, cached routes easily become stale. To address the cache staleness issue, prior work in DSR used heuristics with ad hoc parameters to predict the lifetime of a link or a route. The goal of our project is to proactively disseminating the broken link information to the nodes that have that link in their caches. We define a new cache structure called a cache table and present a distributed cache update algorithm. Each node maintains in its cache table the information necessary for cache updates.

             

E-Mail System

ABSTRACT
The project E-mail system is a window based application which allows the multiple users to send and receive the mail forth and back with in a network or outside of network. This email system having a facility of attachment. The should have a id to enter into the mail room If the user is a new one he need to register himself to get the user name and password. A user can change his own profile, as well as able to change the password.

             

Empowering the RMI in Java Approach

ABSTRACT
With the explosive growth of internet and network services, there is always a proliferation for distributed application that seek to leverage the power of the internet. Remote method invocation is now increasingly being used in Internet based applications and hence it is important to study the performance parameters of RMI. RMI is the action of invoking a method of a remote interface on a remote object. The three methods of RMI namely General , Activation and Custom Socket Factory are to be evaluated empirically using parameters like Round trip time , Latency and Packets per Unit time. The graph plotted allows us to gain an insight into the performance aspects and other tradeoffs of RMI. The General method deals with invoking any method directly from memory of the remote machine. RMI Activation allows passive objects to be brought into the active state by instantiating it on an as needed basis. Custom socket factory method allows customization of socket depending on the type and amount of data to be transferred over the channel. It is proposed to implement security for the data being transferred using Rijndael Algorithm that imparts security due to its high resistance to attacks, code compactness and design simplicity. Search mechanism is also to be implemented in the GUI, which has user-friendly access to the three methods of RMI and displays the results of the evaluation.

             

Energy Time Calculation in Mobile Networks

ABSTRACT
We show that even though mobile networks are highly unpredictable when viewed at the individual node scale, the end-to-end quality-of-service (QoS) metrics can be stationary when the mobile network is viewed in the aggregate. We define the coherence time as the maximum duration for which the end-to-end QoS metric remains roughly constant, and the spreading period as the minimum duration required to spread QoS information to all the nodes.

             

Estimation of Link Lifetimes in Networks

ABSTRACT
Existing methods of measuring lifetimes in P2P systems usually rely on the so-called Create-Based Method (CBM), which divides a given observation window into two halves and samples users "created" in the first half every time units until they die or the observation period ends. Despite its frequent use, this approach has no rigorous accuracy or overhead analysis in the literature. To shed more light on its performance, we first derive a model for CBM and show that small window size or large may lead to highly inaccurate lifetime distributions. We then show that create based sampling exhibits an inherent tradeoff between overhead and accuracy, which does not allow any fundamental improvement to the method. Instead, we propose a completely different approach for sampling user dynamics that keeps track of only residual lifetimes of peers and uses a simple renewal-process model to recover the actual lifetimes from the observed residuals.

             

Fast Ip Network Recovery

ABSTRACT
As the Internet takes an increasingly central role in our communications infrastructure, the slow convergence of routing protocols after a network failure becomes a growing problem. To assure fast recovery from link and node failures in IP networks, we present a new recovery scheme called Multiple Routing Configurations (MRC). It can be implemented with only minor changes to existing solutions. In this paper we present MRC, and analyze its performance with respect to scalability, backup path lengths, and load distribution after a failure. We also show how an estimate of the traffic demands in the network can be used to improve the distribution of the recovered traffic, and thus reduce the chances of congestion when MRC is used.

             

Graphical Web Server

ABSTRACT
This project describes the process of connecting a window based application with web application by taking the port number which specified at web page. A method and implementing computer system is provided in which a function or applet for example may be downloaded from a network server and graphical user interface. (GUI) processor interprets a data stream consisting of GUI controls and attributes, and places the controls and attributes in a presentation space. In an exemplary embodiment, a web browser program loads an HTML (Hypertext Markup Language) from a GUI (Graphical User Interface) stream processor applet from a web server .

             

Hacker Detection in Wireless network

ABSTRACT
Hacker Detection in Wireless network is of practical interest in many applications such as detecting an intruder in a battlefield. The intrusion detection is defined as a mechanism for a WSN to detect the existence of inappropriate, incorrect, or anomalous moving attackers. In this paper, we consider this issue according to heterogeneous WSN models. Furthermore, we consider two sensing detection models: single-sensing detection and multiple-sensing detection... Our simulation results show the advantage of multiple sensor heterogeneous WSNs.

             

Homogenous Network Control And Implementation

ABSTRACT
This project, titled "Homogenous Network Control and Implementation", presents a way of developing integrity-preserved computer networks. The proposed generic network is based on a detailed review and comparitive analysis of ongoing research work in the field of homogenous distributed systems and fault-tolerant systems. The presented network facilitates easy sharing of information among the systems in the network by establishing a peer to peer network connection among all the systems.Homogenous Network of Workstations (HNOW systems) comprises of similar kinds of PC's, Workstations connected over a single network. In a homogenous network, each machine has the ability to send data to another machine, irrespective of the working conditions of the server.

             

Hyper File Share

ABSTRACT
Not so long ago, the easiest and the simplest way to transfer files from one desktop computer to another was via the "sneaker net" – walking a diskette between machines. Later, modems and serial connections made it possible to transfer files between two computers using telephone lines. Setting up both computers for serial connections requires some preparation and time considerations. Once more modern computer networks made their debut, transferring files became as simple as retrieving or saving a file. Communications within such networks are done over high-speed network cables. With the introduction of the Internet came a new and extensive network system, packed with new features. Communications and file transfers are simpler and easier than even before. The Internet indirectly connects any computer on the Internet to every other computer on the Internet. Access is immediately possible to growing millions of computers and files. The administrator of each computer on the Internet grants permission to access their computer.

             

Identifying The Link Failures

ABSTRACT
In this project a formal approach for analyzing routing data to identify the origin of routing changes is provided. Using a simplified model of BGP and a graph model of the Internet, Find-Change algorithm set is presented. Note that even a single link failure or link addition can result in large number of BGP path changes, but finding this change without knowledge of the underlying topology can be a challenge. As a first step toward designing a formal set of algorithms for understanding internet route changes, identifying the single link failure or addition that caused an observed set of changes is focused. This approach takes snapshots of routing tables collected from vantage points, at two different time instances, and without knowing the underlying topology, locates the link that initiated the routing changes, as precisely as possible.

             

Integrated Framework For Security

ABSTRACT
This paper presents a framework for security requirements elicitation and analysis. The framework is based on constructing a context for the system, representing security requirements as constraints, and developing satisfaction arguments for the security requirements. The system context is described using a problem-oriented notation, then is validated against the security requirements through construction of a satisfaction argument. The satisfaction argument consists of two parts: a formal argument that the system can meet its security requirements and a structured informal argument supporting the assumptions expressed in the formal argument. The construction of the satisfaction argument may fail, revealing either that the security requirement cannot be satisfied in the context or that the context does not contain sufficient information to develop the argument. In this case, designers and architects are asked to provide additional design information to resolve the problems. We evaluate the framework by applying it to a security requirements analysis within an air traffic control technology evaluation project.

             

Video-Conferencing

ABSTRACT
ABSTRACT Video-Conferencing is simply a method for people in two or more locations to not only talk with one another, but to see each other and exchange information. Comminique is an emerging technology of video-conferencing that uses a standard personal computer which has been enhanced with special video processing capabilities and a small camera. This technology is employed by a broad spectrum of users to facilitate cost effective communication with key individuals or groups regardless of their geographic location. Ideally, participants have an experience similar to watching and listening to one another on TV, with the added ability to interact, or 'talk back'. Until recently, most videoconferencing was done with room videoconferencing systems, which require very sophisticated and expensive equipment to provide high-quality sound and video. Comminique is less expensive and requires personal computer.

             

IP Spoofing

ABSTRACT
The Distributed Denial of Service (DDOS) attack is a serious threat to the legitimate use of the Internet. Prevention mechanisms are thwarted by the ability of attackers to forge or spoof the source address in IP Packets. By employing IP Spoofing, attackers can avoid detection and put a substantial burden on the destination network for policing attack packets. In this project, we propose an Inter domain Packet Filter (IDPF) architecture that can mitigate the level of IP spoofing on the Internet. A key feature of our project is that it does not require global routing Information.

             

E-Mail Client In Java

ABSTRACT
An e-Mail client is an email program; software designed to collect and send electronic mail. It is also referred to as an email program, or mail user agent (MUA). The term "mail user agent" is less familiar to the average person, but is used in email headers. The headers of the email supply information to the mail servers or computers that handle transferring messages across networks like the Internet. Networking standards have been established to make exchange of messages possible from a virtual unlimited pool of Partners. To this end every mail user agent handles text messages, graphics and attached messages in a similar manner. When a user sends an email an array of information is sent with the message to ensure it reaches its destination. This extra "addressing" information is included in the headers, along with the name of the email program as the "mail user agent."

             

Layer to Forward Protocol

ABSTRACT
The demand for cost and time saving technologies in combination with competitive pressures within corporate environments has made VPN (Virtual Private Network) technology an alternative option for enterprise network connectivity. However, the amount of available information and the speed at which technical landscapes are changing quickly outpaces typical VPN solutions being developed. Rapid development and abundant options create complexity for network designers with respect to choosing and implementing the proper VPN technology. layer to forward protocol is a Java tool to observe network traffic virtually. Network administrators facilitate to monitor VPN (PPTP / IPSec / SSH) and SSL (HTTPS) connectivity of wire line/wireless networks. The graphical representation makes it easy to visualize messages being sent between computer nodes. Users can also read messages not of the above types in plain text. Connection statistics can be used as a measure of network security. The PRO edition allows network administrators to monitor multiple and remote networks.

             

Load Balancing In Multistage Packet Switches

ABSTRACT
The size of a single-hop cross-bar fabric is still limited by the technology, and the fabrics available on the market do not exceed the terabit capacity. A multihop fabric such as Clos network provides the higher capacity by using the smaller switching elements (SE). When the traffic load is balanced over the switches in a middle stage, all the traffic would get through the fabric, as long as the switch outputs are not overloaded. However, the delay that packets experience through the Clos switch depends on the granularity of flows that are balanced. We examine the maximum fabric utilization under which a tolerable delay is provided for various load balancing algorithms, and derive the general formula for this utilization in terms of the number of flows that are balanced. We show that the algorithms which balance flows with sufficiently coarse granularity provide both high fabric utilization and delay guarantees to the most sensitive applications. Since no admission control should be performed within the switch, the fast traffic-pattern Changes can be accommodated in the proposed scalable architecture.

             

Location Aided Routing

ABSTRACT
We study routing misbehavior in MANETs (Mobile Ad Hoc Networks) in this paper. In general, routing protocols for MANETs are designed based on the assumption that all participating nodes are fully cooperative. However, due to the open structure and scarcely available battery-based energy, node misbehaviors may exist. One such routing misbehavior is that some sel_sh nodes will participate in the route discovery and maintenance processes but refuse to forward data packets. In this paper, we propose the 2ACK scheme that serves as an add-on technique for routing schemes to detect routing misbehavior and to mitigate their adverse effect. The main idea of the 2ACK scheme is to send two-hop acknowledgment packets in the opposite direction of the routing path. In order to reduce additional routing overhead, only a fraction of the received data packets are acknowledged in the 2 ACK scheme. Analytical and simulation results are presented to evaluate the performance of the proposed Scheme.

             

Modeling and Automated Containment of Worms

ABSTRACT
Self-propagating codes, called worms, such as Code Red, Nimda, and Slammer, have drawn significant attention due to their enormously adverse impact on the Internet. Thus, there is great interest in the research community in modeling the spread of worms and in providing adequate defense mechanisms against them. In this paper, we present a (stochastic) branching process model for characterizing the propagation of Internet worms. The model is developed for uniform scanning worms and then extended to preference scanning worms. This model leads to the development of an automatic worm containment strategy that prevents the spread of a worm beyond its early stage. Specifically, for uniform scanning worms, we are able to determine whether the worm spread will eventually stop. We then extend our results to contain uniform scanning worms. Our automatic worm containment schemes effectively contain both uniform scanning worms and local preference scanning worms, and it is validated through simulations and real trace data to be non intrusive.

             

Multihoming Route Control

ABSTRACT
Multihoming approach implements to multiple Internet Service Providers (ISPs) have traditionally been employed by end-networks to ensure reliability of Internet access. However, over the past few years, multihoming has been increasingly leveraged for improving wide-area network performance, lowering bandwidth costs, and optimizing the way in which upstream links are used. Multihoming route control does not require any modification to routing protocols, and relies solely on end-network decisions.

             

Net Survey Simulation

ABSTRACT
The main aim of the project Netsurvey Simulation System is to permit the authenticated users to Better Understand the Functionalities of Different Protocols in Different Stages of Data Transfer using OSI Layers. The Netsurvey Simulation System is a new system bringing OSI Layers information in a better way, in which different way Layers differ with each other and the way of running of information in each and every Layer. The new Netsurvey Simulation System includes a no of features which helps the End User in a reliable and easiest Simulation of the Protocols • Can Check any one of the Layers Directly • Separate Links between Protocols of different Layers • Parallel execution of the sessions • Giving a chance for manipulating the settings or options of different Layers. • Can be accessed from anywhere on the web

             

Network Traffic Analysis

ABSTRACT
There is significant interest in the data mining and network management communities about the need to improve existing techniques for clustering multivariate network traffic flow records so that we can quickly infer underlying traffic patterns. In this paper, we investigate the use of clustering techniques to identify interesting traffic patterns from network traffic data in an efficient manner. We develop a framework to deal with mixed type attributes including numerical, categorical, and hierarchical attributes for a one-pass hierarchical clustering algorithm. We demonstrate the improved accuracy and efficiency of our approach in comparison to previous work on clustering network traffic.

             

Network Packet Losses Using Interleaving Method

ABSTRACT
We propose a model-based analytic approach for evaluating the overall efficacy of FEC coding combined with interleaving in combating packet losses in IP networks. The loss of various packets during the data transmission can be reduced by using FEC coding. In this project we are going to evaluate the efficacy of FEC coding. Particularly modeling the network path in terms of a single bottleneck node. We develop a recursive procedure for the exact evaluation of the packet-loss statistics for general arrival processes, based on a framework. We study both single-session and multiple-session scenarios, and provide a simple algorithm for the more complicated multiple-session scenario. We show that the unified approach provides an integrated framework for exploring the tradeoffs between the key coding parameters; specifically, interleaving depths, channel coding rates and block lengths. The approach facilitates the selection of optimal coding strategies for different multimedia applications with various user quality-of-service (QoS) requirements and system constraints. We also provide an information-theoretic bound on the performance achievable with FEC coding in IP networks

             

Network Routing

ABSTRACT
A simple definition of routing is "learning how to get from here to there." In some cases, the term routing is used in a very strict sense to refer only to the process of obtaining and distributing information, but not to the process of using that information to actually get from one place to. Since it is difficult to grasp the usefulness of information that is acquired but never used, we employ the term routing to refer in general to all the things that are done to discover and advertise paths from here to there and to actually move packets from here to there when necessary. The distinction between routing and forwarding is preserved in the formal discussion of the functions performed by OSI end systems and intermediate systems, in which context the distinction is meaningful. Routing is the act of moving information across an inter network from a source to a destination. Along the way, at least one intermediate node typically is encountered. Routing is the process of finding a path from a source to every destination in the network. It allows users in the remote part of the world to get to information and services provided by computers anywhere in the world. Routing is accomplished by means of routing protocols that establish mutually consistent routing tables in every router in the Network.

             

Optimal Mutlicast Routing Protocol In Ad-Hoc Networks

ABSTRACT
An ad-hoc mobile network is a collection of mobile nodes that are dynamically and arbitrarily located in such a manner that the interconnections between nodes are capable of changing on a continual basis. The primary goal of such an ad-hoc network routing protocol is correct and efficient route establishment between a pair of nodes so that messages may be delivered in a timely manner. Multicasting is to send single copy of a packet to all of those of Partners that requested it, and not to send multiple copies of a packet over the same portion of the network, nor to send packets to Partners who don't want it. The Adhoc Multicast Routing Protocol (AMRoute) presents a novel approach for robust IP Multicast in mobile ad-hoc networks by exploiting user-multicast trees and dynamic logical cores. It creates a bi-directional, shared tree for data distribution using only group senders and receivers as tree nodes. Unicast tunnels are used as tree links to connect neighbors on the User-multicast tree. Thus AMRoute does not need to be supported by network nodes that are not interested/capable of multicast, and group State Cost is incurred only by group senders and receivers. Also, the use of tunnels as tree links implies that tree structure does not need to change even in case of a dynamic network topology, which reduces the signaling traffic and packet loss. Thus AMRoute does not need to track network dynamics; the underlying Unicast protocol is solely responsible for this function.

             

Package Router Problem

ABSTRACT
Problem orientation is gaining interest as a way of approaching the development of software intensive systems, and yet, a significant example that explores its use is missing from the literature. In this paper, we present the basic elements of (POSE), which aims at bringing both non-formal and formal aspects of software development together in a single framework. We provide an example of a detailed and systematic POSE development of a software problem: that of designing the controller for a package router. The problem is drawn from the literature, but the analysis presented here is new. The aim of the example is twofold: to illustrate the main aspects of POSE and how it supports software engineering design and to demonstrate how a nontrivial problem can be dealt with by the approach.

             

Packet Loss Measurement

ABSTRACT
Measurement and estimation of packet loss characteristics are challenging due to the relatively rare occurrence and typically short duration of packet loss episodes. While active probe tools are commonly used to measure packet loss on end-to-end paths, there has been little analysis of the accuracy of these tools or their impact on the network. The objective of our study is to understand how to measure packet loss episodes accurately with end-to-end probes. We begin by testing the capability of standard Poisson- modulated end-to-end measurements of loss in a controlled laboratory environment using IP routers and commodity end hosts. Our tests show that loss characteristics reported from such Poisson-modulated probe tools can be quite inaccurate over a range of traffic conditions. Motivated by these observations, we introduce a new algorithm for packet loss measurement that is designed to overcome the deficiencies in standard Poisson-based tools. Specifically, our method entails probe experiments that follow a geometric distribution to 1) enable an explicit trade-off between accuracy and impact on the network, and 2) enable more accurate measurements than standard Poisson probing at the same rate. We evaluate the capabilities of our methodology experimentally by developing and implementing a prototype tool, called BADABING. The experiments demonstrate the trade-offs between impact on the network and measurement accuracy. We show that BADABING reports loss characteristics far more accurately than traditional loss measurement tools.

             

Packet Marking Algorithm

ABSTRACT
The packet marking algorithm is a promising way to discover the Internet map or an attack graph that the attack packets traversed during a distributed denial-of-service attack. However, the PPM algorithm is not perfect, as its termination condition is not well defined in the literature. More importantly, without a proper termination condition, the attack graph constructed by the PPM algorithm would be wrong. In this work, we provide a precise termination condition for the PPM algorithm and name the new algorithm the Rectified PPM (RPPM) algorithm. The most significant merit of the RPPM algorithm is that when the algorithm terminates, the algorithm guarantees that the constructed attack graph is correct, with a specified level of confidence. We carry out simulations on the RPPM algorithm and show that the RPPM algorithm can guarantee the correctness of the constructed attack graph under 1) different probabilities that a router marks the attack packets and 2) different structures of the network graph. The RPPM algorithm provides an autonomous way for the original PPM algorithm to determine its termination, and it is a promising means of enhancing the reliability of the PPM algorithm.

             

Packet Reordering

ABSTRACT
In TCP-PR, a transport protocol that performs well under persistent packet reordering. The key feature of TCP-PR is that duplicate ACKs are not used as an indication of packet loss. The basic idea behind TCP-PR is to detect packet losses through the use of timers instead of duplicate acknowledgments

             

Packet score

ABSTRACT
One of the major threats to cyber security is Distributed Denial-of-Service (DDoS) attacks in which victim networks are bombarded with a high volume of attack packets originating from a large number of machines. The aim of such attacks is to overload the victim with a flood of packets and render it incapable of performing normal services for legitimate users. In a typical three-tier DDoS attack, the attacker first compromises relay hosts called agents, which in turn compromise attack machines called zombies that transmit attack packets to the victim. Packets sent from zombie machines may have spoofed source IP addresses to make tracing difficult. DDoS attacks can be launched by unsophisticated casual attackers using widely available DDoS attack tools such as Trinoo, TFN2K, Stachedraht, etc.

             

Predictive Job Scheduling

ABSTRACT
Job scheduling is the key feature of any computing environment and the efficiency of computing depends largely on the scheduling technique used. Intelligence is the key factor which is lacking in the job scheduling techniques of today. Genetic algorithms are powerful search techniques based on the mechanisms of natural selection and natural genetics. Multiple jobs are handled by the scheduler and the resource the job needs are in remote locations. Here we assume that the resource a job needs are in a location and not split over nodes and each node that has a resource runs a fixed number of jobs.

             

Protocol Scrubbing

ABSTRACT
This paper describes the design and implementation of protocol scrubbers. Protocol scrubbers are transparent, interposed mechanisms for explicitly removing network scans and attacks at various protocol layers. The transport scrubber supports downstream passive network-based intrusion detection systems by converting ambiguous network flows into well-behaved flows that are unequivocally interpreted by all downstream endpoints. The fingerprint scrubber restricts an attacker's ability to determine the operating system of a protected host. As an example, this paper presents the implementation of a TCP scrubber that eliminates inserton and evasion attacks—attacks that use ambiguities to subvert detection—on passive network-based intrusion detection systems,while preserving high performance. The TCP scrubber is based on a novel, simplified state machine that performs in a fast and scalable manner. The fingerprint scrubber is built upon the TCP scrubber and removes additional ambiguities from flows that can reveal implementation-specific details about a host's operating system.

             

Query Processing In Broadcast Networks

ABSTRACT
Location-based spatial queries (LBSQ s) refer to spatial queries whose answers rely on the location of the inquirer. Efficient processing of LBSQ s is of critical importance with the ever-increasing deployment and use of mobile technologies. We show that LBSQ s has certain unique characteristics that the traditional spatial query processing in centralized databases does not address. For example, a significant challenge is presented by wireless broadcasting environments, which have excellent scalability but often exhibit high-latency database access. In this paper, we present a novel query processing technique that, though maintaining high scalability and accuracy, manages to reduce the latency considerably in answering LBSQ s. Our approach is based on peer-to-peer sharing, which enables us to process queries without delay at a mobile host by using query results cached in its neighboring mobile peers. We demonstrate the feasibility of our approach through a probabilistic analysis, and we illustrate the appeal of our technique through extensive simulation results.

             

Real Group Editors

ABSTRACT
Group editors allow a group of distributed human users to edit a shared graphical document at the same time over a computer network. In this project a normal operation transformation framework is developed to efficiently share the text and graphical data to the different users or a particular user connected in the network. The basic idea of operation transformation is to execute any local operation as soon as it is generated for high local responsiveness. Remote operations are transformed against concurrent operations that have been executed locally before its execution.

             

Re-Ordering Of Packets Using Retransmission Timer

ABSTRACT
Most standard implementations of TCP perform poorly when packets are reordered. In this paper, we propose a new version of TCP that maintains high throughput when reordering occurs and yet, when packet reordering does not occur, is friendly to other versions of TCP. The proposed TCP variant, or TCP-PR, does not rely on duplicate acknowledgments to detect a packet loss. Instead, timers are maintained to keep track of how long ago a packet was transmitted. In case the corresponding acknowledgment has not yet arrived and the elapsed time since the packet was sent is larger than a given threshold, the packet is assumed lost. Because TCP-PR does not rely on duplicate acknowledgments, packet reordering (including out-or-order acknowledgments) has no effect on TCP-PR's performance.

             

Routing In Mobile Networks

ABSTRACT
In this paper, we develop an energy-efficient routing scheme that takes into account the interference created by existing flows in the network. The routing scheme chooses a route such that the network expends the minimum energy satisfying with the minimum constraints of flows. Unlike previous works, we explicitly study the impact of routing a new flow on the energy consumption of the network. Using implementation, we show that the routes chosen by our algorithm (centralized and distributed) are more energy efficient than the state of the art.

             

Routing Simulator

ABSTRACT
A simple definition of routing is "learning how to get from here to there." In some cases, the term routing is used in a very strict sense to refer only to the process of obtaining and distributing information, but not to the process of using that information to actually get from one place to. Since it is difficult to grasp the usefulness of information that is acquired but never used, we employ the term routing to refer in general to all the things that are done to discover and advertise paths from here to there and to actually move packets from here to there when necessary. The distinction between routing and forwarding is preserved in the formal discussion of the functions performed by OSI end systems and intermediate systems, in which context the distinction is meaningful. Routing is the act of moving information across an inter network from a source to a destination. Along the way, at least one intermediate node typically is encountered. Routing is the process of finding a path from a source to every destination in the network. It allows users in the remote part of the world to get to information and services provided by computers anywhere in the world. Routing is accomplished by means of routing protocols that establish mutually consistent routing tables in every router in the Network.

             

Security System for DNS Using Cryptography

ABSTRACT
The mapping or binding of IP addresses to host names became a major problem in the rapidly growing Internet and the higher level binding effort went through different stages of development up to the currently used Domain Name System (DNS). The Security System for Dns Using Cryptography is designed to provide security by combining the concept of both the Digital Signature and Asymmetric key (Public key) Cryptography. Here the Public key is send instead of Private Key. The Security System for Dns Using Cryptography uses Message Digest Algorithm to compress the Message (text file) and PRNG (Pseudo Random Number Generator) Algorithm for generating Public and Private key. The message combines with the Private Key to form a Signature using DSA Algorithm, which is send along with the Public key. The receiver uses the Public key and DSA Algorithm to form a Signature. If this Signature matches with the Signature of the message received, the message is Decrypted and read else discarded.

             

Self-Interested Routing In Online Environments

ABSTRACT
A recent trend in routing research is to avoid inefficiencies in network-level routing by allowing hosts to either choose routes themselves (e.g., source routing) or use overlay routing networks (e.g., Detour or RON). Such approaches result in selfish routing, because routing decisions are no longer based on system-wide criteria but are instead designed to optimize host-based or overlay-based metrics. A series of theoretical results showing that selfish routing can result in suboptimal system behavior have cast doubts on this approach. In this paper, we use a game-theoretic approach to investigate the performance of selfish routing in Internet-like environments based on realistic topologies and traffic demands in our simulations. We show that in contrast to theoretical worst cases, selfish routing achieves close to optimal average latency in such environments. However, such performance benefits come at the expense of significantly increased congestion on certain links. Moreover, the adaptive nature of selfish overlays can significantly reduce the effectiveness of traffic engineering by making network traffic less predictable.

             

Sliding Window Protocol Simulation

ABSTRACT
The Sliding Window (SW) protocol has been widely used in many popular communication protocols. The protocol can ensure a correct data transfer over very poor quality communication channels where the packets may be duplicated, lost, or re-ordered .A number of parameters affects the performance characteristics of the SW protocol. Usually, these performance characteristics cannot be determined analytically. However, we need to study these key performance characteristics and to identify optimal parameter settings in the early design phases when parameter settings in the early design phases when designing an adaptive algorithm or novel protocols for specific computing environments.

             

TCP/IP Chat Server

ABSTRACT
Teleconferencing or Chatting, is a method of using technology to bring people and ideas "together" despite of the geographical barriers. The technology has been available for years but the acceptance it was quit recent. Our project is an example of a chat server. It is made up of 2 applications the client application, which runs on the user's Pc and server application, which runs on any Pc on the network. To start chatting client should get connected to server where they can practice two kinds of chatting, public one (message is broadcasted to all connected users) and private one (between any 2 users only) and during the last one security measures were taken. As a common technology used in modern computer network communication, Socket network programming is one of the most popular technology to develop based on TCP/IP because it can customize packets communicate with each other effectively.

              e

Terminal Controller

ABSTRACT
This project deals with the functionalities of the terminal systems connected through a network. This system implements Remote control at the application level. This project controls the remote systems by performing the terminal operations like shutdown, checking files and its permissions, etc. As the application is built purely on JAVA using RMI APIs, it is platform independent and the users can run their application using this project. Java also provides a strong development platform in its own right for remote-control solutions. This system helps in handling the operations of the administrator, in order to avoid time delay by executing the tasks, from the server itself. This enhances the work efficiency of the administrator and also reduces the physical work strain. It can also be used to reduce the unnecessary power consumption in an organization.