amazon

Monday, August 24, 2015

CONGESTION CONTROL USING NBP

                Congestion Control Using NBP                   
    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.
          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.

         The fundamental philosophy behind the Internet is expressed by the scalability argument: no protocol, mechanism, or service should be introduced into the Internet if it does not scale well. A key corollary to the scalability argument is the end-to-end argument: to maintain scalability, algorithmic complexity should be pushed to the edges of the network whenever possible.

CONSTRAINED DIMENSIONALITY REDUCTION USING A MIXED NORM PENALTY WITH NEURAL NETWORKS

CONSTRAINED DIMENSIONALITY REDUCTION USING A MIXED NORM PENALTY WITH NEURAL NETWORKS
                
 ABSTRACT
                              An artificial neural network (ANN), usually called "neural network" (NN), is a mathematical model or computational model that tries to simulate the structure and/or functional aspects of biological neural networks.
                   It consists of an interconnected group of artificial neurons and processes information using a connectionist approach to computation. In most cases an ANN is an adaptive system that changes its structure based on external or internal information that flows through the network during the learning phase.                      Modern neural networks are non-linear statistical data modeling tools. They are usually used to model complex relationships between inputs and outputs or to find patterns in data.
                    For our work, neural networks provide an ideal platform, since they can be trained to provide near optimum classification for almost any problem.
                  
                   We use the neural net here because of the straightforward relationship between the functional dimensionality of the problem and the number of neurons in the first hidden layer of the net. The result that is obtained May also be used directly on the pruning problem of neural networks to reduce the total number of neurons.
Existing System:                    
                   Existing system does not have any formulae to neutralize the unauthorized access of the tested platform. There is no record of to identify whether the pan card holder is taken the share or it is used by others as BROKER.
It is having more chance for the BROKERS do destabilize the system. The existing neural does not implements fixed dimensionality for neural layers.

Disadvantage of Existing System

                   Existing system uses fixed norm algorithms which operate for the system that has predefined inputs, for change in input needs the algorithm to be restructured which makes it more complex and time consuming.
The existing neural does not implements fixed dimensionality for neural layers.

Advantage of Existing System
                   Neural network requires less formal statistical training for the hidden layer neurons. Ability to detect all possible interactions between predictor variables, and the availability of multiple training algorithms.
                   The input object will be transformed automatically into its binary forms on the computational process.

 Proposed System

           Our system tasted with the day to day STOCK EXCHANGE system, in current system there is no provision of identifying the user that taking share and the source of money that comes from which opens our system more open towards black marketers or black money may be within or outside country.
         
          To protect we have done a quite efficient system that identifies the user based on their user image, here to purchase or sale any share from the STOCK EXCHANGE user needs a strong authentication which cannot be avoided.
         
          To make our system more real we implemented our system with latest technologies which having a better market perspective such as Struts 2.X, Hibernate 3.X of J2EE technology.
         
          Our solution towards the problem that we are facing in existing system cannot be overlooked.
                              








SYSTEM REQUIREMENTS
Hardware Specification:
•         Processor             : Dual Core/Pentium.
•         Hard Disk            : Min 20GB.
•        RAM                    : 512 MB.
Software Specification:
•         Operating system           : Windows XP Professional.
•         Front End             : J2EE
•         Back End             : MySQL
•         Framework                    : Struts Hibernate.




CONSTRUCTING INTER-DOMAIN PACKET FILTERS TO CONTROL IP SPOOFING BASED ON BGP UPDATES

Constructing Inter-Domain Packet Filters to        Control                           IP SPOOFING Based on BGP Updates
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 addresses in IP packets.
                   By employing IP spoofing, attackers can evade detection and put a substantial burden on the destination network for policing attack packets. In this paper, 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 scheme is that it does not require global routing information. IDPFs are constructed from the information implicit in Border Gateway Protocol (BGP) route updates and are deployed in network border routers.
                   We establish the conditions under which the IDPF framework correctly works in that it does not discard packets with valid source addresses.
                   Based on extensive simulation studies, we show that, even with partial deployment on the Internet, IDPFs can proactively limit the spoofing capability of attackers. In addition, they can help localize the origin of an attack packet to a small number of candidate networks.
Existing System:
*   Existing system uses Network Ingress Filtering.
*   Ingress filtering primarily prevents a specific network from being used for attacking others.
Proposed System:
*   In our project we propose and study IDPF architecture as an effective countermeasure to the IP spoofing-based DDoS attacks. IDPFs rely on BGP update messages exchanged on the Internet to infer the validity of source address of a packet forwarded by a neighbor.
System Requirements
Hardware Requirements:
•         PROCESSOR              : PENTIUM IV 2.6 GHz
•         RAM                             :512 MB DD RAM
•         MONITOR                   :15” COLOR
•         HARD DISK                :20 GB
•         FLOPPY DRIVE         :1.44 MB
•         CDDRIVE                    :LG 52X
•         KEYBOARD               :STANDARD 102 KEYS
Software Requirements:
•         FRONT END                    :  Java, swing
•         OPERATING SYSTEM   :  Window’s XP

•         BACK END                      :Ms SQL

C-TREND: TEMPORAL CLUSTER GRAPHS FOR IDENTIFYING AND VISUALIZING TRENDS IN MULTIATTRIBUTE TRANSACTIONAL DATA

C-TREND: Temporal Cluster Graphs for Identifying and Visualizing Trends in Multiattribute Transactional Data

Abstract   : 
                        Organizations and firms are capturing increasingly more data about their customers, suppliers, competitors, and business environment. Most of this data is multiattribute (multidimensional) and temporal in nature.
                         Data mining and business intelligence techniques are often used to discover patterns in such data; however, mining temporal relationships typically is a complex task. This paper proposes a new data analysis and visualization technique for representing trends in multiattribute temporal data using a clustering based approach.
                        This paper introduce Cluster-based Temporal Representation of EvenT Data (C-TREND), a system that implements the temporal cluster graph construct, which maps multiattribute temporal data to a two-dimensional directed graph that identifies trends in dominant data types over time.
                        This paper present temporal clustering-based technique, discuss its algorithmic implementation and performance, demonstrate applications of the technique by analyzing data on wireless networking technologies and baseball batting statistics, and introduce a set of metrics for further analysis of discovered trends.

Existing System:
  •  Existing algorithms uses matrices to produce partition.
  • Distance between the matrices is used for calculation.

Disadvantages:
·         Existing Schemes Consumes more time.
                       





Proposed System:
·               This project use DENDROGRAM Data structure for storing and Extracting cluster solutions generated by hierarchical clustering algorithms
·               Calculations are made using  Tree structure
Advantages:
·         Efficiency is considerably increased.
·         N is user defined.

System Requirements:

Hardware:
PROCESSOR              :  PENTIUM IV 2.6 GHz
RAM                             :  512 MB DD RAM


Software:

FRONT END                      :  J2EE (JSP)
OPERATING SYSTEM    :  Windows XP
                        BACK END                         : Sql Server 2000


DATA SECLUSION IN AUDIO FILES

DATA SECLUSION IN AUDIO FILES

ABSTRACT

          Our project, Data Hiding in Audio files is the software developed for hiding information which uses the technology called as Steganography –derived from the Greek words meaning, “Covered writing”, is the art of hiding information in ways that prevent its detection.
          It is a method akin to covert channels, and invisible links, which add another step in security. A message in cipher text may arouse suspicion while an invisible message is not.             
                    Digital stenography uses a host data or message known as a “Container” or “Cover” to hide another data or message in it. The conventional way of protecting information was to use a standard symmetric or asymmetric key system in encryption. Steganography can also be used to place a hidden “trademark” in images, music, and software, a technique referred to as watermarking.
                    Steganography, if however used along with cryptography ,for example, if a message is encrypted using triple DES(EDE) which requires a 112 bit key then the message has become quite secure as far as cryptanalytic attack are concerned. Now, if this cipher text is embedded in an image, video, voice, etc., it is even more secure. If an encrypted message is intercepted, the interceptor   knows the text is an encrypted message. With Steganography, the interceptor may know the object contains a message.
          When performing data hiding on audio, one must exploit the weakness of the Human Auditory System (HAS), while at the same time being aware of the extreme sensitivity of the human auditory system.
          As we were growing up, we have occasionally heard the very popular phrase that the world is becoming smaller with each passing day. Looking at it from a geographical viewpoint, it seems to appear utterly nonsensical. However, that is not what it means. It basically symbolizes that with improving technology, it is becoming increasingly easier and faster to communicate. It is a widespread belief that telecommunications holds the key to the future.
          However along with good, there is always the bad (hackers). The bad in this case being the case of misuse of the technology to further ones own personal needs at the expense of others. Communication holds the key to business, personal life, etc. As people tend to rely on these new means of communication, more and more important information is being conveyed along these new lines.   
          In order to ensure the privacy of the communication between two parties, various new methods are being developed. Cryptography being the mother to all those projects. However, cryptography is like a tool, it can do as well as it is programmed to do. Also, there are various different techniques that can be implemented to attain a certain level of security.
          Here we implement a technique for data hiding in audio images, known as Audio file Steganography. However, Steganography alone is not able to provide a sufficiently high enough level of security. In order to improve the security of our technique, we will also be incorporating encryption of data to be hidden.

 


Existing System
          Nowadays, several methods are used for communicating secret messages for defense purposes or in order to ensure the privacy of communication between two parties. So we go for hiding information in ways that prevent its detection.
          Some of methods used for privacy communication are the use of invisible Links; covert channels are some of existing systems that are used to convey the messages. 

Proposed System
                    The proposed system uses Audio file as a carrier medium which add another step in security. The objective of the newly proposed system is to create a system that makes it very difficult for an opponent to detect the existence of a secret message by encoding it in the carrier medium as a function of some secret key and that remains as the advantage of this system.

Aim of the project
         
          We are of the belief that the easiest way to keep something from prying eyes is to place it right in front of the person looking for it and make it look as innocuous as possible.
                    Everyone has a taste for a certain kind of music. Hence, it is more than likely that the person will have that kind of music on the storage device of his computer. Also, it is quite common case where people share and transfer different music files to one another. If one were able to hide the message can be. Also, transfer of this message can be done quite conveniently without raising any eyebrows.
                    Our aim is to come up with a technique of hiding the message in the audio file in such a way, that there would be no perceivable changes in the audio file after the message insertion.
                    At the same time, if the message that is to be hidden were encrypted, the level of security would be raised to quite a satisfactory level. Now, even if the hidden message were to be discovered the person trying to get the message would only be able to lay his hands on the encrypted message with no way of being able to decrypt it.

System Hardware and Software Requirements
Hardware Requirements
Monitors     : 800x600 minimum resolutions at 256 colors minimum
Memory      : Approximately 64 MB of on board memory
I/O              : two or three button mouse and standard 101-key keyboard
MHZ           : At least 166 MHZ processor

Software Requirements
Java tool is used to perform Data hiding in an Audio file and the Operating System used is Windows 9x, 2000, XP. There are many algorithms available to achieve this. The need of algorithm is to develop concepts and a practical embedding method for Audio files that would provide high stenographic capacity without sacrificing security.
The algorithm used in our project is PBE (MD5) algorithm. This algorithm is chosen because it provides more security.



v Module I (Media Reading & Analyzing) :
ü Java language
v Module II (Message encryption and embedding into audio)
ü Java language
v Module III (Extracting of Message from Audio and encryption)
ü Java language
v Gel editor for Java.

 

 

 



DATA TRANSMISSION USING MULTI-TASKIN SOCKETS

Data Transmission Using Multi-Taskin Sockets

                      
  ABSTARCT
                            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.
                  It supports both client and server sockets. A server socket can be referred as to a socket that can accept many connections. And a client socket is a socket that is connected to server socket.
                  You may still use this class to communicate between two applications without establishing a connection. In the latter case, you will want to create two UDP server sockets (one for each application).
                   This class also helps reduce coding need to create chat-like applications and IPC (Inter-Process Communication) between two or more applications (processes).
                  Reliable communication between two peers is also supported with TCP/IP with error handling. You may want to use the smart addressing operation to control the destination of the data being transmitted (UDP only).
                  TCP operation of this class deals only with communication between two peers.

n","serif"'> 




DECENTRALIZED QOS-AWARE CHECKPOINTING ARRANGEMENT IN MOBILE GRID COMPUTING


Decentralized QoS-Aware Checkpointing
Arrangement in Mobile Grid Computing
Abstract
                        This paper deals with decentralized, QoS-aware middleware for check pointing arrangement in Mobile Grid (MoG) computing systems.
                        Check pointing is more crucial in MoG systems than in their conventional wired counterparts due to host mobility, dynamicity, less reliable wireless links, frequent disconnections and variations in mobile systems.
                        We've determined the globally optimal checkpoint arrangement to be NP-complete and so consider Reliability Driven (ReD) middleware, employing decentralized QoS-aware heuristics, to construct superior check pointing arrangements efficiently.
                        With ReD, an MH (mobile host) simply sends its check pointed data to one selected neighboring MH, and also serves as a stable point of storage for check pointed data received from a single approved neighboring MH.
                        ReD works to maximize the probability of check pointed data recovery during job execution, increasing the likelihood that a distributed application, executed on the MoG, completes without sustaining an unrecoverable failure.
                        It allows collaborative services to be offered practically and autonomously by the MoG.
                        Simulations and actual tested implementation show ReD's favorable recovery probabilities with respect to Random Check pointing Arrangement (RCA) middleware, a QoS-blind comparison protocol producing random arbitrary check pointing arrangements.