Java Project Titles With Abstracts (2fhfgh)

PROJECTS @ ORANGE
POWERED BY EXPERIENCE & KNOWLEDGE
JAVA, J2EE & J2ME

JAVA, J2EE, J2ME, JSP, JWS, Tomcat, Servlets, RMI, Struts, WAP
Java Projects
KNOWLEDGE AND DATA ENGINEERING / DATA MINING
Sno
TITLE
Binrank: Scaling Dynamic Authority-Based Search Using Materialized Sub graphs Combinatorial Approach for Preventing SQL Injection Attacks(Secure Computing) Effective and Identification Efficient Query Processing for Video Subsequence
Year
2010
1 2 3 4 5 6 7 8 9
2009
2009
PBFMCSP: Prefix Based Fast Mining of Closed Sequential Patterns Study on Intelligent E-Shopping System Based on Data Mining Truth Discovery With Multiple Conflicting Information Providers On Web Protection Of Database Security Via Collaborative Inference Detection Online Index Recommendations for High-Dimensional Databases Using Query Workloads An Efficient Clustering Scheme to Exploit Hierarchical Data in Network Traffic sis
2009 2009 2008 2008 2008 2008
Image Processing
1 0 1 1
Noise Reduction By Fuzzy Image Filtering(Fuzzy System) Application Of BPCS Steganography To Wavelet Compressed Video 2003 2004
Mobile Computing
1 2 1 3
14 Energy Maps for Mobile Wireless Networks: Coherence Time versus Spreading Period Intrusion Detection In Homogeneous & Heterogeneous Wireless Sensor Networks Cryptographic Versus Trust-based Methods for MANET Routing Security 2009 2008 2008
Orange Software Technologies, 1 st Floor, Harikrishna Building,Opp:Konark Theater,Dilsukhnagar,Hyd-60, Ph: +91 86 86 051194 ,86 86 061194. Email: services@orangehyd.com Website : www.orangehyd.com
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

2008 2008 2008 2006
1 5 1 6 1 7 1 8 1 9 2 0
Location Based Spatial Query Processing In Wireless Broadcast Environments Bandwidth Estimation For Ieee 802.11 Based Adhoc Network Benefit-Based Data Caching In Ad Hoc Networks Distributed Cache Updating For The Dynamic Source Routing Protocol
An Acknowledgment-Based Misbehavior In Mantes
Approach
For
The
Detection
Of
Routing
2007 2007
Detection Of Misbehavior In MANATES
NETWORKING
21 2 2 2 3 2 4 2 5 2 6
On Wireless Scheduling Algorithms For Minimizing The Queue-Overflow Probability Node Isolation Model And Age-Based Neighbor Selection In Unstructured P2p Networks Leveraging Identity-Based Structured P2p Systems Cryptography For Node Id Assignment In
2010
2009
2009
Measuring Capacity Bandwidth of Targeted Path Segments Capturing Router Congestion and Delay minimizing file download time in stochastic peer-to-peer networks congested sensor networks
2009 2009
2008
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

2008 2008 2008 2008
27 28 29 30
Geometric Approach To Improving Active Packet Loss Measurement BRA: A Bidirectional Routing Abstraction for Asymmetric Mobile Ad Hoc Networks Designing Less-Structured P2P Systems for the Expected High Churn Performance Of A Speculative Transmission Scheme For Scheduling Latency Reduction Modeling & Automated Containment Of Worms(Secure Computing With Networking) Constructing Inter-Domain Packet Filters To Control IP Spoofing Based On BGP Updates Dual-Link Failure Resiliency Through Backup Link Mutual Exclusion Security In Large Mediator Protocols A Distributed Database Architecture For Global Roaming In Next-Generation Mobile Networks A Novel Secure Communication Protocol For Ad Hoc Networks [SCP]
31
2008
32 33 34 35 36
2008 2008 2008 2004 2008
SOFTWARE ENGINEERING
3 7
Using The Conceptual Cohesion Of Classes For Fault Prediction In Object Oriented Systems
2008
PARALLEL AND DISTRIBUTED SYSTEMS

3 8 3 9 4 0
Dynamic Search Algorithm In Unstructured Peer-To-Peer Networks Distributed Algorithms For Constructing Approximate Minimum Spanning Trees In Wireless Sensor Networks Dynamic Routing With Security Considerations
2009
2009
2009
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

2008 2008 2008 2007 2007 2005
4 1 4 2 4 3 4 4 4 5 4 6
Quiver: Consistent Object Sharing For Edge Services DCMP: A Distributed Cycle Minimization Protocol for Peer-to-Peer Networks Computation-Efficient Multicast Key Distribution An Adaptive Programming Model For Fault-Tolerant Distributed Computing Homogenous Network Control And Implementation A BGP Based Mechanism For Lowest Cost Routing
Advance Computing, Secure Computing, JOURNAL AND CONFERENCE PAPERS

4 7 4 8 4 9 5 0 5 1 5 2
Enhancing Privacy And Authorization Control Scalability In The Grid Through Ontologies Combinatorial Approach For Preventing Sql Injection Attacks Evaluating the Vulnerability of Network Traffic Using Joint Security and Routing Analysis A Precise Algorithm Termination Condition Of The Probalastic Packet Marking
2009
2009
2009
2008
Hybrid Intrusion Detection With Anomalous Internet Episodes
Weighted
Signature
Generation
Over
2007
Network Border Patrol: Preventing Congestion Collapse And Promoting Fairness In The Internet
2004
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Web Based Project

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 21 22 Broken Links Handler DEFECT TRACKING TOOL / BUG Sluts Fashion Studios Smart City College Message System Scheduling And Dispatching Management System Town Online Complaint System Web Crawler Software Resource Planning Tool Spam Mailing Detection System Student Project Allocation And Management With Online Testing Adxpress Boardwalk Cotelligent Ezeemerchant Loan Amortizer Transport Plus CALTOOL - COMPUTER AIDED LEARNING TOOL E-School Organizational Internal Survey Orange Software Technologies, 1 st Floor, Harikrishna Building,Opp:Konark Theater,Dilsukhnagar,Hyd-60, Ph: +91 86 86 051194 ,86 86 061194. Email: services@orangehyd.com Website : www.orangehyd.com
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

23 24 25 27 28 29 31 32 34 35 36
Web Shop Web Forum E-Talk Telecom Inventory Maintenance System Project Automation System Work Flow Management System E-Banking Bus Scheduling And Dispatching Tutelage Imprinter Easy Journey Pharmacy Management System
Windows Based Project

1 2. 3. 4. 5. 6. 7 8 Protocol Scrubbing Structure Text Filling An Agent Based Intrusion Detection Hop By Hop Optical Multicast Routing In Ad Hoc-Network Image Rendering For A Grid Tech Network Analyzer Credit Card Approval System
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

9 10 11 12 13 14. 15 16. 17. 18. 19. 20. 21. 22. 23. 24. 25. 26. 27. 28. 29
Visual Cryptography Digital Water Marking JBrowser Public Key Validation For Dns Security Extension Webs Eye Web Extractor Online Database Wizard Visual Editor Stegohider Embedding Data Into Video File With Less Distortion Using Lsb Technique Remote Network Monitoring And Control Http Server Implementation Of Idea Algorithm Image Compression Pretty Good Privacy Car Sales System Remote File Repository Bank System Audio Track Finder Airways Reservation System Location Aided Routing Orange Software Technologies, 1 st Floor, Harikrishna Building,Opp:Konark Theater,Dilsukhnagar,Hyd-60, Ph: +91 86 86 051194 ,86 86 061194. Email: services@orangehyd.com Website : www.orangehyd.com
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

30 31 32 33 34
Web Importer Atm Simulator High Speed Download Manager Extreme Pc Java Productivity Aids
1. BINRANK: SCALING DYNAMIC AUTHORITY-BASED

PROJECTS @ ORANGE
JAVA, J2EE & J2ME

SEARCH USING MATERIALIZED SUB GRAPHS

Abstract Dynamic authority-based keyword search algorithms, such as ObjectRank and personalized PageRank, leverage semantic link information to provide high quality, high recall search in databases, and the Web. Conceptually, these algorithms require a querytime PageRank-style iterative computation over the full graph. This computation is too expensive for large graphs and not feasible at query time. Alternatively, building an index of precomputed results for some or all keywords involves very expensive preprocessing. We introduce BinRank, a system that approximates ObjectRank results by utilizing a hybrid approach inspired by materialized views in traditional query processing. We materialize a number of relatively small subsets of the data graph in such a way that any keyword query can be answered by running ObjectRank on only one of the subgraphs. BinRank generates the subgraphs by partitioning all the terms in the corpus based on their co-occurrence, executing ObjectRank for each partition using the terms to generate a set of random walk starting points, and keeping only those objects that receive non-negligible scores. The intuition is that a subgraph that contains all objects and links relevant to a set of related terms should have all the information needed to rank objects with respect to one of these terms. We demonstrate that BinRank can achieve subsecond query execution time on the English Wikipedia data set, while producing high-quality search results that closely approximate the results of ObjectRank on the original graph. The Wikipedia link graph contains about 108 edges, which is at least two orders of magnitude larger than what prior state of the art dynamic authority-based search systems have been able to demonstrate. Our experimental evaluation investigates the trade-off between query execution time, quality of the results, and storage requirements of BinRank.
Existing System:
PageRank algorithm utilizes the Web graph link structure to assign global importance to Web pages. It works by modeling the behavior of a random Web surfer who starts at a random Web page and follows outgoing links with uniform probability. The PageRank score is independent of a keyword query..
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Personalized PageRank (PPR) for Web graph data sets and ObjectRank for graph-modeled databases results. Therefore, the issue of scalability of PPR has attracted a lot of attention. ObjectRank extends (personalized) PageRank to perform keyword search in databases. ObjectRank uses a query term posting list as a set of random walk starting points and conducts the walk on the instance graph of the database. In this project, a BinRank system that employs a hybrid approach where query time can be traded off for preprocessing time and storage. BinRank closely approximates ObjectRank scores by running the same ObjectRank algorithm on a small subgraph, instead of the full data graph. BinRank query execution easily scales to large clusters by distributing the subgraphs between the nodes of the cluster. We are proposing the BinRank algorithm for the trade time of search. Our alogorithm solves the time consuming problem in query execution. Time will be reduced because of cache storage and redundant query handling method.
Processor Ram Hard Disk Input device Output device Operating System Pages developed using Techniques Web Browser Data Bases Client Side Scripting : Any Processor above 500 MHz. : 128Mb. : 10 GB. : Standard Keyboard and Mouse. : VGA and High Resolution Monitor. : Windows Family. : Java Server Pages and HTML. : Apache Tomcat Web Server 5.0, JDK 1.5 or higher : Microsoft Internet Explorer. : SQlServer 2000 : Java Script
Proposed System:
HARDWARE SPECIFICATION
SOFTWARE SPECIFICATION
2. Combinatorial Approach for Preventing SQL Injection Attacks(Secure Computing) Orange Software Technologies, 1 st Floor, Harikrishna Building,Opp:Konark Theater,Dilsukhnagar,Hyd-60, Ph: +91 86 86 051194 ,86 86 061194. Email: services@orangehyd.com Website : www.orangehyd.com
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Abstract: A combinatorial approach for protecting Web applications against SQL injection is discussed in this paper, which is a novel idea of incorporating the uniqueness of Signature based method and auditing method. The major issue of web application security is the SQL Injection, which can give the attackers unrestricted access to the database that underlie Web applications.Many software systems have evolved to include a Web-based component that makes them available to the public via the Internet and can expose them to a variety of Web-based attacks. One of these attacks is SQL injection, which can give attackers unrestricted access to the databases that underlie Web applications and has become increasingly frequent and serious. This paper presents a new highly automated approach for protecting Web applications against SQL injection that has both conceptual and practical advantages over most existing techniques. From a conceptual standpoint, the approach is based on the novel idea of positive tainting and on the concept of syntax-aware evaluation. From a practical standpoint, our technique is precise and efficient, has minimal deployment requirements, and incurs a negligible performance overhead in most cases. We have implemented our techniques in the Web Application SQL-injection Preventer (WASP) tool, which we used to perform an empirical evaluation on a wide range of Web applications that we subjected to a large and varied set of attacks and legitimate accesses. WASP was able to stop all of the otherwise successful attacks and did not generate any false positives.
Processor Ram Hard Disk Input device Output device : Any Processor above 500 MHz. : 128Mb. : 10 GB. : Standard Keyboard and Mouse. : VGA and High Resolution Monitor.
Operating System Pages developed using Techniques Web Browser Data Bases Client Side Scripting : Windows Family. : Java Server Pages and HTML. : Apache Tomcat Web Server 5.0, JDK 1.5 or higher : Microsoft Internet Explorer. : SQlServer 2000 : Java Script
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

3. Effective and Efficient Query Processing for Video Subsequence Identification Abstract This paper presents a graph transformation and matching approach to identify the occurrence of potentially different ordering or length due to content editing. With a novel batch query algorithm to retrieve similar frames, the mapping relationship between the query and database video is first represented by a bipartite graph. The densely matched parts along the long sequence are then extracted, followed by a filter-and-refine search strategy to prune some irrelevant subsequences. During the filtering stage, Maximum Size Matching is deployed for each sub graph constructed by the query and candidate subsequence to obtain a smaller set of candidates. During the refinement stage, Sub-Maximum Similarity Matching is devised to identify the subsequence with the highest aggregate score from all candidates, according to a robust video similarity model that incorporates visual content, temporal order, and frame alignment information. Existing System: With the growing demand for visual information of rich content, effective and efficient manipulations of large video databases are increasingly desired. Many investigations have been made on contentbased video retrieval. However, despite the importance, video subsequence identification, which is to find the similar content to a short query clip from a long video sequence, has not been well addressed. It is often undesirable to manually check whether a video is part of a long stream by browsing its entire length. Proposed System: Video subsequence identification involves locating the position of the most similar part with respect to a user-specified query clip Q from a long pre stored video sequence S. Ideally; it can identify relevant video, even if there exists some transformation distortion, partial content reordering, insertion, deletion, or replacement. Sub sequence identification task aims at finding if there exists any subsequence of a long database video that shares similar content to a query clip.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Modules: 1. Video Copy Detection 2. Video Similarity Search Module Descriptions: Video Copy Detection Extensive research efforts have been made on extracting and matching content-based signatures to detect copies of videos. In their work, query sequence slides frame by frame on database video with a fixed length window. Since the process of video transformation could give rise to several distortions, techniques circumventing these variations by globe signatures have been considered. They tend to depict a video globally rather than focusing on its sequential details. Some properties that are likely to be preserved even with these variations (e.g., shot length information) were suggested to be generated as compact signatures and string matching technique could be used to report such a copy. However, this method is only applicable for queries which consist of multiple shots. Video Similarity Search The methods mentioned above only have been designed to detect videos of the same temporal order and length. To further search videos with changes from query due to content editing, a number of algorithms have been proposed to evaluate video similarity. To deal with inserting in or cutting out partial content, here used dynamic programming based on ordinal measure of re sampled frames at a uniform sampling rate to find the best match for different length video sequences. We investigate sub sampled frame-based matching and take average inter frame similarity into account as well as the factors of temporal order, frame alignment, gap, and noise for accurate identification. An efficient heuristic method is devised to aggregate the scores of different factors for directly deriving the most similar subsequence according to this overall video similarity measure, without enumerating all combinations.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Software Requirements Microsoft Windows XP Professional JDK 6.0 JMF 2.0.1 Hardware Requirements Pentium 4 processor 1 GB RAM 80 GB Hard Disk Space
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

3. PREFIX BASED FAST MINING OF CLOSED SEQUENTIAL PATTERNS ABSTRACT In recent years, mining of sequential patterns has been studied extensively in various domains. Most of the existing algorithms find patterns in transactional databases. This paper proposes a novel algorithm to mine closed sequential patterns using an inverted matrix and prefix based sequence element matrix. Inverted matrix minimizes the search space for discovering various sequential patterns of different items. We use a prefix based sequence element matrix to minimize the scans required at levels k and k+1 in the mining process. Our experimental results show the performance improvement of the new algorithm over the previous work. EXISTING SYSTEM Frequent pattern mining in temporal domain, an emerging research trend is the focus of this study. Existing frequent pattern mining algorithms in temporal domain are all based on Aprioris candidate generation logic and hence suffer from repeated input scans setback. Prefix Span, a variant of FP-growth proposed for efficient sequential pattern mining requires input to be in the form of transactions or records and does not maintain temporal continuity across transactions. An algorithm on fast mining of closed sequential patterns mines patterns on transactional records. PROPOSED SYSTEM INVERTED MATRIX This paper uses an inverted matrix approach to associate each item with its sequence segments those are subsequences of the sequence in which it occurs as a prefix and to associate all items in each segment using pointers. Similar to the vertical approach in the transactional database representation, the item is the key of each record in this layout. The difference between this approach and the vertical approach is that each attribute on the inverted matrix is not the transaction ID, but a pointer points to the location of the next item on the same sequence segment. The construction of the inverted matrix is assumed to be pre-processing of the mining process. The inverted matrix that is made of two parts: the index and the sequence array. The index contains the items and the sequence array is a set of rows in which each row is associated with one item in the index part. Each row is made of pairs representing pointers, where each pair holds two information: the physical address in the index part of the next item in the same sequence segment, and the physical address in the row of the next item in the same sequence segment. The entries of the
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

sequence segments with items are done as follows: the given sequence is read, the location of the first item in the sequence is sought and an entry to its sequence array is added that holds the location of the next item in this sequence. For the second time the same process occurs, in which an entry in the inverted matrix of the second item is added to hold the location of the third item in the sequence. Table 1 shows the inverted matrix of the sample sequence ABCDBDACDBACBDCDABCD.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

5: Study on intelligent e-shopping system based on data mining
ABSTRACT
E-commerce is a related concept of data mining technologies and the realization process of data mining techniques are described. Combine data mining and guide features of e-shopping site, study intelligent shopping guide system based on data mining. Use data mining technology to guide customers to buy goods or to provide recommendations in order to provide higher quality services. We take the specific case as study object, we use data mining techniques to analyze and propose solutions. The use of data mining provide users with intelligent guide and make users easy in the range of goods which not only save user browsing net and considering time, but also provide users with a good proposal to allow the user to get the appropriate selection of goods, is a kind of high-quality services.
Existing System
Ecommerce can be achieved by a variety of electronic means of communication such as phone or fax. But now people are exploring e-commerce based on EDI (electronic data interchange) and the internet. Particularly as internet technology has become more sophisticated, real development of ecommerce will be built on the internet technology. So there were some people who take e-commerce as IC (internet commerce).E-commerce refers to the network as the carrier, the use of digital electronic means to carry out business activities. With the developing of internet technology and the Web technology, various types of e-commerce sites are coming out. It is not difficult to establish e-commerce sites, but to obtain economic and social benefits. On the e-commerce web site, there may be millions of on-line transactions, generating a large number of documents and records of the registration form every day. Ecommerce companies are faced with a wealth of data, lack of knowledge of embarrassment.
Problems in existing system:

The time complexity is very large. There are no guidelines for user to buy appropriate things. The schemes are cost effective.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Proposed System
E-commerce has changed people's consumption style, there have been a variety of online stores and Web sites devoted to business, consumers can also buy desirable commodity in homes, but a growing number of similar sites, and also to choose more and more, the face of online shopping, people often will fall into the plight of choice, especially choice of gifts, it is more difficult to select one satisfaction and newer. In real life, when I do not know how to choose, friends or other people as a guide, advise, but not on the Internet. Are there any web site can provide a service as user's guide this election? Smart guide realization of the program: the gift network establish a specialized section help you to choose gift, set up a number of multi-issue election, according to prompt the user answer, such as human sex, love, what kind of gifts they had received, and so on, these data will be connected to the database, using data mining to analyze the data, be able to find what kind of gifts send more appropriately, and then return a result to the user, help users make a decision. To achieve this function is to establish a model: study relationship between all information and gifts user chosen. Software requirements: Operating System: Windows 2000/XP Front end: Dot net Documentation: MS - Word XP Designing: Star UML Backend: SQL Hardware requirements: CPU: Pentium IV RAM: 512MB. Hard Disk: 40GB. Monitor: SVGA Color Monitor. Keyboard: 108 Standards. Mouse: Logitech scroll mouse.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

6. TRUTH DISCOVERY WITH MULTIPLE CONFLICTING INFORMATION PROVIDERS ON WEB Abstract The world-wide web has become the most important information source for most of us. Unfortunately, there is no guarantee for the correctness of information on the web. Moreover, different web sites often provide conflicting in-formation on a subject, such as different specifications for the same product. In this paper we propose a new problem called Veracity that is conformity to truth, which studies how to find true facts from a large amount of conflicting information on many subjects that is provided by various web sites. We design a general framework for the Veracity problem, and invent an algorithm called Truth Finder, which utilizes the relationships between web sites and their information, i.e., a web site is trustworthy if it provides many pieces of true information, and a piece of information is likely to be true if it is provided by many trustworthy web sites. Our experiments show that Truth Finder successfully finds true facts among conflicting information, and identifies trustworthy web sites better than the popular search engines.
Existing System:
Page Rank and Authority-Hub analysis is to utilize the hyperlinks to find pages with high authorities. These two approaches identifying important web pages that users are interested in, Unfortunately, the popularity of web pages does not necessarily lead to accuracy of information
5.4.2. Proposed System:

We formulate the Veracity problem about how to discover true facts from conflicting information. Second, we propose a framework to solve this problem, by defining the trustworthiness of websites, confidence of facts, and influences between facts.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Finally, we propose an algorithm called TRUTHFINDER for identifying true facts using iterative methods.
5.4.3. Disadvantage:
The popularity of web pages does not necessarily lead to accuracy of information. Even the most popular website may contain many errors. Where as some comparatively not-so-popular websites may provide more accurate information.
5.4.4. Advantage:
Our experiments show that TRUTHFINDER achieves very high accuracy in discovering true facts. It can select better trustworthy websites than authority-based search engines such as Google.
6. System Requirements: 6.1. Hardware:

PROCESSOR RAM MONITOR HARD DISK CDDRIVE KEYBOARD MOUSE : : : : : : : PENTIUM IV 2.6 GHz 512 MB DD RAM 15 COLOR 20 GB LG 52X STANDARD 102 KEYS 3 BUTTONS
6.2. Software:
FRONT END TOOL USED OPERATING SYSTEM BACK END : Java, J2ee (JSP) : JFrameBuilder : Windows Xp : Sql Server 2000
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

16. PROTECTION OF DATABASE SECURITY VIA COLLABORATIVE INFERENCE DETECTION Abstract Malicious users can exploit the correlation among data to infer sensitive information from a series of seemingly innocuous data accesses. Thus, we develop an inference violation detection system to protect sensitive data content. Based on data dependency, database schema and semantic knowledge. we constructed a semantic inference model (SIM) that represents the possible inference channels from any attribute to the pre-assigned sensitive attributes. The SIM is then instantiated to a semantic inference graph (SIG) for query-time inference violation detection. For a single user case, when a user poses a query, the detection system will examine his/her past query log and calculate the probability of inferring sensitive information. The query request will be denied if the inference probability exceeds the pre specified threshold. For multi-user cases, the users may share their query answers to increase the inference probability. Therefore, we develop a model to evaluate collaborative inference based on the query sequences of collaborators and their task-sensitive collaboration levels. Experimental studies reveal that information authoritativeness, communication fidelity and honesty in collaboration are three key factors that affect the level of achievable collaboration. An example is given to illustrate the use of the proposed technique to prevent multiple collaborative users from deriving sensitive information via inference.
Existing System
Multiple collaborative users from deriving sensitive information via inference. Experimental studies reveal that information authoritativeness, communication fidelity, and honesty in collaboration are three key factors that affect the level of achievable collaboration
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Proposed System
we develop a model for evaluating collaborative inference based on the query sequences of collaborators and their task-sensitive collaboration levels. A mechanism that propagates update to the user history files to ensure that no query is rejected based on the outdated information. To reduce the time in examining the entire history login computation inference.
System Requirements:
Hardware:
PROCESSOR RAM MONITOR HARD DISK CD-DRIVE KEYBOARD MOUSE : : : : : : : PENTIUM IV 2.6 GHz 512 MB DD RAM 15 COLOR 20 GB LG 52X STANDARD 102 KEYS 3 BUTTONS
Software:
FRONT END Back End OS IDE : JAVA(SWING) : SQL Server : Windows Xp SP2 : NetBeans 6.5, JFrameBuilder
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Online Index Recommendations for High-Dimensional Databases Using Query Workloads Abstract:
Usually users are interested in querying data over a relatively small subset of the entire attribute set at a time. A potential solution is to use lower dimensional indexes that accurately represent the user access patterns. If the query pattern change, then the query response using the physical database design that is developed based on a static snapshot of the query workload may significantly degrade. To address these issues, we introduce a parameterizable technique to recommend indexes based on index types that are frequently used for highdimensional data sets and to dynamically adjust indexes as the underlying query workload changes. We incorporate a query pattern change detection mechanism to determine when the access patterns have changed enough to warrant change in the physical database design. By adjusting analysis parameters, we trade off analysis speed against analysis resolution.
Existing System:
Query response does not perform well if query patterns change. Because it uses static query workload. Its performance may degrade if the database size gets increased. Tradition feature selection technique may offer less or no data pruning capability given query attributes.
Proposed System:
We develop a flexible index selection frame work to achieve static index selection and dynamic index selection for high dimensional data.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

A control feedback technique is introduced for measuring the performance. Through this a database could benefit from an index change. The index selection minimizes the cost of the queries in the work load. Online index selection is designed in the motivation if the query pattern changes over time. By monitoring the query workload and detecting when there is a change on the query pattern, able to evolve good performance as query patterns evolve
Software requirements: Hardware:

PROCESSOR RAM MONITOR HARD DISK FLOPPY DRIVE CDDRIVE : : : : : : PENTIUM IV 2.6 GHz 512 MB DD RAM 15 COLOR 20 GB 1.44 MB LG 52X
Software:
Front End : Back End : Tools Used : Operating System J2EE(JSP) MS SQL 2000 JFrameBuilder : WindowsXP
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

AN EFFICIENT CLUSTERING SCHEME TO EXPLOIT HIERARCHICAL DATA IN 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.
EXISTING SYSTEM:
Categorization based Network monitoring (Auto Focus) techniques. Traffic matrix: The aim of traffic matrix measurement is to estimate the volume of traffic between origin and destination points in the network for capacity planning. Traffic volume: The aim of traffic volume measurement is to determine the total traffic sent or received in a network. Of particular interest is the problem of measuring network usage of customers. Traffic dynamics: The aim of monitoring traffic dynamics is to measure the temporal variation in Internet traffic. Traffic mixture: when traffic volume data is aggregated over time, it can reveal important features of network usage for performance and security management. Deficiency of an Existing System: It does not has Hierarchical Classification DOS Attacker cannot be Found No Intimation for any violation
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

PROPOSED SYSTEM:
Hierarchical, distance-based clustering scheme (Echidna). To summarize the main types of traffic flows that are observed in a network. Introduction of a new distance measure for hierarchically structured attributes such as IP addresses and a set of heuristics. Summarize and compress reports of significant traffic clusters from a hierarchical clustering algorithm.
Proposed System Features : It has System based Hierarchical Classification Efficient Network Traffic Monitoring Infer of underlying patterns for multivariate traffic flows It Identify DOS Attack
SYSTEM REQUIREMENTS SPECIFICATION:

Hardware Requirements: Processor Hard Disk Ram : : : Pentium IV 3.3 GHz. 80 GB. 1 GB.
Software Requirements: Operating system Language Used Database : : : Windows XP Professional. Java 1.6 (Swings ,AWT ,Sockets) SQL Server 2000
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Noise Reduction by Fuzzy Image Filtering Abstract A new fuzzy filter is presented for the noise reduction of images corrupted with additive noise. The filter consists of two stages. The first stage computes a fuzzy derivative for eight different directions. The second stage uses these fuzzy derivatives to perform fuzzy smoothing by weighting the contributions of neighboring pixel values. Both stages are based on fuzzy rules which make use of membership functions. The filter can be applied iteratively to effectively reduce heavy noise. In particular, the shape of the membership functions is adapted according to the remaining noise level after each iteration, making use of the distribution of the homogeneity in the image. A statistical model for the noise distribution can be incorporated to relate the homogeneity to the adaptation scheme of the membership functions. Experimental results are obtained to show the feasibility of the proposed approach. These results are also compared to other filters by numerical measures and visual inspection.
Hardware specifications: Processor : RAM Hard disk CD drive Floppy drive Monitor Keyboard Mouse : : : : : : :
Intel Processor IV 128 MB 20 GB 40 x Samsung 1.44 MB 15 Samtron color 108 mercurykeyboard Logitech mouse : : Windows XP/2000 J2sdk1.4.0
Software Specification Operating System Language used
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

33 Application of BPCS steganography to wavelet compressed
video
Abstract This paper presents a steganography method using lossy compressed video which provides a natural way to send a large amount of secret data. The proposed method is based on wavelet compression for video data and bit-plane complexity segmentation (BPCS) steganography. In wavelet-based video compression methods such as 3-D set partitioning in hierarchical trees (SPIHT) algorithm and motion-JPEG2000, wavelet coefficients in discrete wavelet transformed video are quantized into a bit-plane structure and therefore BPCS steganography can be applied in the wavelet domain. 3-D SPIHT-BPCS steganography and motion-JPEG2000-BPCS steganography are presented and tested, which are the integration of 3-D SPIHT video coding and BPCS steganography and that of motion-JPEG2000 and BPCS, respectively. Experimental results show that 3-D SPIHT-BPCS is superior to motion-JPEG2000-BPCS with regard to embedding performance.
Hardware specifications: Processor : RAM Hard disk CD drive Floppy drive Monitor Keyboard Mouse Software Specification : : : : : : :
Intel Processor IV 128 MB 20 GB 40 x Samsung 1.44 MB 15 Samtron color 108 mercurykeyboard Logitech mouse
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Operating System Language used
: :
Windows XP/2000 J2sdk1.4.0
Energy Maps for Mobile Wireless Networks: Coherence Time versus Spreading Period
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. We show that if the coherence time is greater than the spreading period, the endto-end QoS metric can be tracked. We focus on the energy consumption as the end-to-end QoS metric, and describe a novel method by which an energy map can be constructed and refined in the joint memory of the mobile nodes. Finally, we show how energy maps can be utilized by an application that aims to minimize a node's total energy consumption over its near-future trajectory.
MODULES:
In this project we concentrated on main three modules these are 1. Node Module 2. Energy Calculation 3. Time Calculation
1. Node Module
Here we have taken totally five nodes called node A, Node B, Node C, Node D from these nodes we can transfer data to destination node whish one is six node after receiving the data in that node data will be displayed
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

2. Energy calculator
In this module we can calculate the energy values which is used by nodes to receive the data this is the main important thing for our project which is going to calculate the energy.
3. Time calculation
In this Module we are going to calculate time duration which is related to data receiver
EXISTING SYSTEM:
In mobile networking previously if we want to transfer some information from one place to fixed base station it will taking lot of energy. For this till now we are using proactive and reactive routing. We can send limited information only that to using a huge energy and one more important thing is still now we are not using end-to-end metrics. Deficiency of an Existing System: It does not Geographic routing protocols unaware of its implications for end-to-end QoS metrics
PROPOSED SYSTEM:
Application that aims to minimize a nodes total energy consumption over its near-future trajectory. our aim is to transfer information from location to a fixed base station BS with minimum energy through a mobile network in which the node buffers are not congested. we focus on paths through space, and the nodes are taken to be interchangeable, and we aim to associate a QoS metric with the physical path through space. Our aim will be to minimize the total energy consumption.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

SYSTEM REQUIREMENTS SPECIFICATION:

Hardware Requirements: Processor Hard Disk Ram : : : Pentium IV 3.3 GHz. 80 GB. 1 GB.
Software Requirements: Operating system Language Used : : Windows XP Professional. Java 1.6 (Swings ,AWT ,Sockets)
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Intrusion Detection in Homogeneous and Heterogeneous Wireless Sensor Networks

Abstract:
Intrusion detection in Wireless Sensor Network (WSN) 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.
Existing System:
1 In single-sensing detection, At a time only one intruder detected by the wsn. 2 Our Previous work was according to homogeneous and heterogeneous single sensor in wireless sensor network .
Proposed System:
1 In Heterogeneous wireless sensor ,Intruder detected anywhere in the network. 2. We are detecting the intruder in multiple sensor heterogeneous wireless sensor network.
Disadvantage:
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

1 The sensed information provided by a single sensor might be inadequate for recognizing the intruder. 2 So that there is no guarantee for our information has been sent securely. 3. Data will not routed if primary detector fails.
Advantage:
1 If primary detector fails another detector detect the intruder. 2 By finding the intruders we can send our information in a secured manner.
Hardware:
PROCESSOR RAM MONITOR HARD DISK CDDRIVE KEYBOARD MOUSE : PENTIUM IV 2.6 GHz : 512 MB DD RAM : 15 COLOR : 20 GB : LG 52X : STANDARD 102 KEYS : 3 BUTTONS
Software:
FRONT END : Java TOOL USED : JFrameBuilder OPERATING SYSTEM : Windows Xp
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Cryptographic Versus Trust-based Method s for MANET Routing Security

Abstract
Mobile Ad-hoc Networks (MANETs) allow wireless nodes to form a network without requiring a xed infrastructure. Early routing protocols for MANETs failed to take security issues into account. Subsequent proposals used strong cryptographic methods to secure the routing information. In the process, however, these protocols created new avenues for denial of service (DoS). Consequently, the trade-o between security strength and DoS vulnerability has emerged as an area requiring further investigation. It is believed that dierent trust methods can be used to develop protocols at various levels in this trade-o . To gain a handle on this exchange, real world testing that evaluates the cost of existing proposals is necessary. Without this, future protocol design is mere speculation. In this project, we give the rst comparison of SAODV and TAODV, two MANET routing protocols, which address routing security through cryptographic and trust-based means respectively. We provide performance comparisons on actual resource-limited hardware. EXISTING SYSTEM: As more applications were developed to take advantage of the unique properties of adhoc networks, it soon became obvious that security of routing information was an issue not addressed in the existing protocols. Lundberg presents several potential problems including node compromise, computational overload attacks energy consumption attacks, and black hole attacks. Deng et al. further discuss energy consumption and black hole attacks along with impersonation and routing information disclosure. Jakobsson et al. categorize attacks as manipulation of routing information and exhaustive power consumption, and provide detailed treatments of many characteristic attacks. PROPOSED SYSTEM: While research has focused on lightweight security mechanisms, some proposed protocols use more expensive asymmetric cryptography. Zhou and Haas present a multipath protocol extension that uses threshold cryptography to implement the key management system. It requires some nodes to function as servers and an authority to initialize these servers. Zapata and Asokan propose SAODV a secure version of AODV, which uses digital signatures and hash chains to secure the routing messages. Pissinou et al. propose a trust-based version of AODV using static trust levels. The same authors then extend this protocol to thwart multiple colluding nodes. Neither of these address securing the trust exchanges, or the overhead involved. Li et al. introduce a trust-based variant of AODV] that secures the trust information. However, their protocol requires an
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

intrusion detection system in the network. Finally, Meka et al. propose a third trusted AODV with a simple method of evaluating trust even without source routing. Our work in this paper considers the asymmetric cryptography and trust-based extensions to AODV presented and shows a real world comparison of the performance of the two protocols. Our results suggest that new protocols can be developed which take advantage of the best features of both types of protocols, and which share aspects of each security model.
Hardware Interface Hard disk : 40 GB RAM : 512 MB Processor Speed : 3.00GHz Processor : Pentium IV Processor Lan set up for 4 systems (min) Software Interface JDK 1.5 Java Swing
Location-Based Spatial Query Processing in Wireless Broadcast Environments

PROJECTS @ ORANGE
JAVA, J2EE & J2ME

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 highlatency 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.
Existing System
Existing techniques cannot be used effectively in a wireless broadcast environment, where only sequential data access is supported. It may not scale to very large user populations. In an existing system to communicate with the server, a client must most likely use a fee-based cellular-type network to achieve a reasonable operating range. Third, users must reveal their current location and send it to the server, which may be undesirable for privacy reasons
Proposed System
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

This System is a novel approach for reducing the spatial query access latency by leveraging results from nearby peers in wireless broadcast environments. Our scheme allows a mobile client to locally verify whether candidate objects received from peers are indeed part of its own spatial query result set. The method exhibits great scalability: the higher the mobile peer density, the more the queries answered by peers. The query access latency can be decreased with the increase in clients.
System Requirement Specification Software Interface JDK 1.5 Java Swing SQL Server
Hardware Interface PROCESSOR RAM : MONITOR : HARD DISK KEYBOARD MOUSE : : PENTIUM IV 2.6 GHz 512 MB DD RAM 15 COLOR : 40 GB : STANDARD 102 KEYS 3 BUTTON
Bandwidth Estimation for IEEE 802.11-Based Ad Hoc Networks

PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Abstract:
Since 2005, IEEE 802.11-based networks have been able to provide a certain level of quality of service (QoS) by the means of service differentiation, due to the IEEE 802.11e amendment. However, no mechanism or method has been standardized to accurately evaluate the amount of resources remaining on a given channel. Such an evaluation would, however, be a good asset for bandwidth-constrained applications. In multihop ad hoc networks, such evaluation becomes even more difficult. Consequently, despite the various contributions around this research topic, the estimation of the available bandwidth still represents one of the main issues in this field. In this paper, we propose an improved mechanism to estimate the available bandwidth in IEEE 802.11-based ad hoc networks. Through simulations, we compare the accuracy of the estimation we propose to the estimation performed by other state-of-the-art QoS protocols, BRuIT, AAC, and QoS-AODV.
Existing System:
The ad hoc networking community assumes that the underlying wireless technology is the IEEE 802.11 standard due to the broad availability of interface cards and simulation models. This standard has not been targeted especially for multihop ad hoc operation, and it is therefore not perfectly suited to this type. An accurate evaluation of the capabilities of the routes is necessary. Most of the current QoS proposals leave this problem aside, relying on the assumption that the link layer protocols are able to perform such an evaluation.
Proposed System:
In this system they are using 802.11 MAC layer to evaluate the correct bandwidth. This method combines channel monitoring to estimate each nodes medium occupancy.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Probabilistic combination of the values is to account for synchronization between nodes, estimation of the collision probability between each couple of nodes, and variable overheads impact estimation. This mechanism only requires one-hop information communication and may be applied without generating a too high additional overhead. We show the accuracy of the available bandwidth measurement through NS-2 simulations. These results show that single-hop flows and multihop flows are admitted more accurately, resulting in a better stability and overall performance.
System Requirements Hardware:

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 MOUSE : 3 BUTTONS
Software:
Front End : Java, Swing Back End : MS Access Tools Used : JFrameBuilder Operating System : WindowsXP
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Benefit-Based Data Caching In Ad Hoc Networks
ABSTRACT
Data caching can significantly improve the efficiency of information access in a wireless ad hoc twork by reducing theaccess latency and bandwidth usage. wever, designing efficient distributed caching algorithms is ontrivial when network nodeshave limited memory. In this article, we consider the cache placement problem of nimizing total data access cost in ad hoc networkswith multiple data items and nodes with limited memory pacity. The above optimization problem is known to be NP-hard. Definingbenefit as the reduction in total access cost, we present a polynomial-time centralized approximation algorithm that provably delivers asolution whose benefit is at least 1/4 (1/2 for uniform-size data items) of the optimal benefit. The approximation algorithm is amenableto localized distributed implementation, which is shown via simulations to perform close to the approximation lgorithm. Our distributedalgorithm naturally extends to networks with mobile nodes. We simulate our distributed algorithm using a network simulator (ns2) anddemonstrate that it significantly outperforms another existing caching echnique (by Yin and Cao [33]) in all important performancemetrics. The performance differential is particularly large in more challenging scenarios such as higher access frequency and smaller
4.2 Proposed System
Each node cache the items most frequently accessed by itself. Eliminate replications among neighboring nodes Creation of stable groups to gather neighborhood inform and determine caching placements. Each node act as a server Server maintains nearest cache node and Server nearest cache node by using routing protocol First save data item on local space IF any other items are exist that will be replace.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Software requirements: Operating System: windows 2000/NT Development Kit: J2SE 5.0 RDBMS: MS Access Hardware requirements: Hard Disk: 256 MB Process: Pentium IV
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Distributed Cache Updating for Dynamic Source Routing Protocol:
ABSTRACT
On-demand routing protocols (DSR), use route caches to make routing decisions. Due to mobility, cached routes easily become stale. The goal of the project is to proactively disseminating the broken link information to the nodes that have that link in their caches. It defines a new cache structure called a cache table and presents a distributed cache algorithm. Each node maintains in its cache table the information necessary for cache updates. When a link failure is detected, the algorithm notifies all reachable nodes that have cached the link in a distributed manner. It concludes that proactive cache updating is the key to the adaptation of ondemand routing protocols to mobility. ll 3 Hardware Requirements Hard disk RAM Processor Speed Processor 3.4.4 Software Requirements JDK 1.5 Java Swings MS-Access
: : : :
40 GB 512 MB 3.00GHz Pentium IV
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

An Acknowledgment-Based Approach For The Detection Of Routing Misbehavior In Mantes

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. A intrusion detection and intrusion blocker that can provide interim protection against a limited and changing set of high-likelihood or high-priority threats. It is expected that this mechanism would be easily and adaptively configured and deployed to keep pace with the ever-evolving threats on the network, intrusion detection and response based on agent system, digital signature used to provide a security. Active networks are an exciting development in networking services in which the infrastructure provides customizable network services to packets. The custom network services can be deployed by the user inside the packets themselves. In this paper we propose the use of agent based intrusion detection and response. Agents are integrated with the collaborative IDS in order to provide them with a wider array of information to use their response activities.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Detection Of Misbehavior In MANATES
Abstract
A Mobile Ad Hoc Network (MANET) is a collection of mobile nodes (hosts) which communicate with each other via wireless links either directly or relying on other nodes as routers. The operation of MANETs does not depend on pre-existing infrastructure or base stations. Network nodes in MANETs are free to move randomly. Therefore, the network topology of a MANET may change rapidly and unpredictably. All network activities, such as discovering the topology and delivering data packets, have to be executed by the nodes themselves, either individually or collectively. Depending on its application, the structure of a MANET may vary from a small, static network that is highly power-constrained to a large-scale, mobile, highly dynamic network. There are two types of MANETs: closed and open. In a closed MANET, all mobile nodes cooperate with each other toward a common goal, such as emergency search/rescue or military and law enforcement operations. In an open MANET, different mobile nodes with different goals share their resources in order to ensure global connectivity. However, some resources are consumed quickly as the nodes participate in the network functions. For instance, battery power is considered to be most important in a mobile environment. An individual mobile node may attempt to benefit from other nodes, but refuse to share its own resources. Such nodes are called selfish or misbehaving nodes, and their behavior is termed selfishness or misbehavior. One of the major sources of energy consumption in mobile nodes of MANETs is wireless transmission. A selfish node may refuse to forward data packets for other nodes in order to conserve its own energy. The 2ACK scheme is proposed to mitigate the adverse effects of misbehaving nodes. The basic idea of the 2ACK scheme is that, when a node forwards a data packet successfully over the next hop, the destination node of the next-hop link will send back a special two-hop acknowledgment called 2ACK to indicate that the data packet has been received successfully.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

This 2ACK scheme is implemented as add-on technique on the DSR protocol. The DSR protocol has two important modules. They are Route Discovery and Route Maintenance. Route Discovery is the mechanism by which a node S wishing to send a packet to a destination node D obtains a source route to D. Route Discovery is used only when S attempts to send a packet to D and does not already know a route to D. Route Maintenance is the mechanism by which node S is able to detect, while using a source route to D, if the network topology has changed such that it can no longer use its route to D because a link along the route no longer works. When Route Maintenance indicates a source route is broken, S can attempt to use any other route it happens to know to D, or can invoke Route Discovery again to find a new route. Route Maintenance is used only when S is actually sending packets to D.
SCOPE OF THE SYSTEM:

This project proposes the 2ACK scheme to mitigate the adverse effects of misbehaving nodes. The basic idea of the 2ACK scheme is that, when a node forwards a data packet successfully over the next hop, the destination node of the nexthop link will send back a special two-hop acknowledgment called 2ACK to indicate that the data packet has been received successfully. In this project, we present the details of the 2ACK scheme and our evaluation of the 2ACKscheme as an add-on to the Dynamic Source Routing (DSR) protocol.
3.1 EXISTING SYSTEM

In the Existing system routing misbehavior can severely degrade the performance at the routing layer. Specifically, nodes may participate in the route discovery and maintenance processes but refuse to forward data packets. In the existing system various techniques have been proposed to prevent selfishness in MANETs. These schemes can be broadly classified into two categories: Credit-based schemes and Reputation-based schemes. 1) Credit-Based Schemes: The basic idea of Credit-Based schemes is to provide incentives for nodes to faithfully perform networking functions. In order to achieve this goal, virtual (electronic) currency or similar payment system may be set up. Nodes get paid for providing services to other nodes. When they request other nodes to help them for packet forwarding, they use the same payment system to pay for such services
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

The main problem with credit-based schemes is that they usually require some kind of tamper resistant hardware and/or extra protection for the virtual currency or the payment system. 2) Reputation-Based Schemes: The second category of techniques to combat node misbehavior in MANETs is Reputation Based. In such schemes, network nodes collectively detect and declare the misbehavior of a suspicious node. Such a declaration is then propagated throughout the network, so that the misbehaving node will be cut off from the rest of the network. Due to its reliance on overhearing, however, the watchdog technique may fail to detect misbehavior or raise false alarms in the presence of ambiguous collisions, receiver collisions, and limited transmission power.
3.2 PROPOSED SYSTEM

The 2ACK scheme can be implemented as an add-on to existing routing protocols for MANETs, such as DSR. The 2ACK scheme detects misbehavior through the use of a new type of acknowledgment packet, termed 2ACK. A 2ACK packet is assigned a fixed route of two hops (three nodes), in the opposite direction of the data traffic route. The 2ACK scheme solves the problems of ambiguous collisions, receiver collisions, and limited transmission power. In this project, we propose the 2ACK scheme that serves as an addon 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 this project, we present the details of the 2ACK scheme and our evaluation of the 2ACKscheme as an add-on to the Dynamic Source Routing (DSR) protocol.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

3.3 SYSTEM REQUREMENTS

3.3.1 SOFTWARE REQUIREMENTS
OS Project Platform Software User Interface : : Windows Java : JDK1.5 : Swings
HARDWARE REQUIREMENTS
Key Board : Standard Key Board with 101 Keys Processor : Pentium IV Monitor : SVGA Color Monitor Hard disk : 20 GB
RAM
256 MB
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

ON WIRELESS SCHEDULING ALGORITHMS FOR MINIMIZING THE QUEUE-OVERFLOW PROBABILITY

AIM:
To Minimize the Queue-Overflow Probability in the wireless Network by using an Scheduling algorithm alpha in the router side.
Synopsis:
The link scheduling algorithm mainly focuses on to reduce the queue overflow rate over queue length. Let us consider a cellular network in which there are N users to transmit the data through the router in that each user connects with a router to transmit that makes the queue in the other end. To overcome the queue the base station selects user based on the service rate, after it reaches the threshold. The goal is to find algorithms for scheduling the transmissions such that the queues are stabilized at given offered loads. An important result along this direction is the development of the so-called throughput-optimal algorithms. In our system we have approached the scheduling algorithm in the Online Mobile Banking of the Mobile User.
Existing System:
The Constrained queuing system is used as a model of a radio networks, the server correspond to the link and the constraints disallows simultaneous transmission. At each time slot routing decision are taken for served customer and eligible set consider for activation.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Proposed System:
In scheduling algorithms collectively referred to as the alpha algorithms. For a given, the alpha algorithm picks the user for service at each time that has the largest product of the transmission rate. This result enables us to design scheduling algorithms that are both close to optimal in terms of the asymptotic decay rate of the overflow probability and empirically shown to maintain small queueoverflow probabilities over queue-length ranges of practical interest. Software Requirements JDK 1.6 My SQL 5.0
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Node Isolation Model and Age-Based Neighbor Selection in Unstructured P2P Networks
Abstract R ESILIENCE of P2P networks under random user arrival and departure (i.e., churn) has recently become an active research area [15][20], [22], [32]. One of the primary metrics of resilience is graph disconnection during which a P2P network partitions into several nontrivial sub graphs and starts to offer limited service to its users. However, as shown in [19], most partitioning events in well-connected P2P networks are single-node isolations, which occur when the immediate neighbors of a node fail before is able to detect their departure and then replace them with other alive users. For such networks, node isolation analysis has become the primary method for quantifying network resilience in the presence of user churn.
In fact, the second strategy based on random walks on age-proportional graphs demonstrates that, for lifetimes with infinite variance, the system monotonically increases its resilience as its age and size grow. Specifically, we show that the probability of isolation converges to zero as these two metrics tend to infinity. We finish the paper with simulations in finite-size graphs that demonstrate the effect of this result in practice. RESILIENCE of P2P networks under random user arrival and departure (i.e., churn) has recently become an active research. One of the primary metrics of resilience is graph disconnection during which a P2P network partitions into several nontrivial sub graphs and starts to offer limited service to its users. Most partitioning events in well-connected P2P networks are single-node isolations, which occur when the immediate neighbors of a node fail before is able to detect their departure and then replace them with other alive users. For such networks, node isolation analysis has become the primary method for quantifying network resilience in the presence of user churn.
3. SYSTEM ANALYSIS
Existing System
In existing system, unstructured p2p network consider only exponential (mean time to failure) user lifetime and age-independent neighbor replacement.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Unstructured P2P networks are single-node isolations, which occur when the immediate neighbors of a node fail before a node is able to detect their departure and then replace them with other alive users. Probability of user isolation is high in existing system and the users cannot communicate with the isolated nodes. When node gets isolated from the network, the links between the nodes get failure. So, graph gets disconnected. Newly joining node unable to detect the heavy-tailed user lifetime to avoid its probability of isolation from the network.
Disadvantages
Node isolated from network. So, communication problem occurs. Neighbor node unable to detect the failure previously. Graph Disconnection between the networks. Resilience of peer to peer networks under random user arrival and departure is difficult. New node cannot be able to identify the heavy-tailed node in the network. Probability of user isolation and graph disconnection is high.
Proposed System
In proposed system, we consider heavy-tailed user lifetime for improving residual lifetime of chosen users and reducing probability of user isolation and graph partitioning from network. Node isolation analysis has become the primary method for quantifying network resilience in the presence of user churn. A joining node randomly selects alive users from the system and chooses the user with the maximal age. Random walk algorithms have been used to build unstructured P2P systems and replace failed links with new ones.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Introduce a new-neighbor selection strategy that is based on random walks over weighted directed graphs to identify the isolated node. Calculating the age for each node based on sum of weight of indegrees of a node.
Advantages
Reducing probability of user isolation. Avoids graph partitioning from network. Overcome Communication problem. Resilience of peer to peer networks for random user arrival and departure is done. Probability of user isolation and graph disconnection is low.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Leveraging Identity Based Cryptography for NODE ID Assignment in structured P2P systems
Abstract:Structured peer-peer has grown rapidly because of their scalability, efficiency and reliability . They provide high secured resilient media for the efficiency storage and retrieval of file objects. Structured Peer to Peer Systems assign a unique key identifier to every object and node IDs associated with objects are mapped by P2P overlay protocols to the node responsible for that objects. The assignment of node IDs is therefore critically important to the efficiency and security of the system Sybil attacks allow an adversary to control large portions of P2P network by simultaneously obtaining many identifiers. The solution to these problems largely rely on the use of trusted certificate authorities and a structured public key infrastructure ( PKI ) to assign and certify node IDs . These schemas require maintenance of complex PKI systems .
Proposed System :We consider the use of identity based cryptography to assist in the security and\ performance critical assignment of user identities in p2p systems. Identity based cryptosystems use textual strings to derive public keys from cryptographic parameters advertised within a domain. This approach avoids many of the complexities of PKI usage as a public key is directly derivable from their identity and reduces overheads and associated with authentication. We exploit these features in p2p systems by assigning and ID and providing the associated identity based private key to which joining mode. The use of IBE systems leads to a trust model different than those differed by previous centralized identity management approaches. In our proposed system identities are keys are derived directly from the IP addresses of the participating entities. Users of the system compute the public keys of their peers directly. We identify three protocols representing diverse trust models and performance profiles based on identity based cryptography. Protocol 1:- a fully decentralized ID-based assignment scheme. Protocol 2:- A centralized scheme in which a single host system plays dual roles as ID assigning authority and P2P boot strap node. Protocol 3:- An approach that retains the separation of duties of a
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

decentralized model at a low cost by using a hybrid of identity based symmetric key cryptography
Measuring Capacity Bandwidth of Targeted Path Segments

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 endto-end scope. In this paper, we develop end-to-end probing methods which can measure bottleneck capacity bandwidth along arbitrary, targeted subpaths of a path in the network, including subpaths shared by a set of flows. We evaluate our technique through ns simulations, then provide a comparative Internet performance evaluation against hop-by-hop and end-toend techniques. We also describe a number of applications which we foresee as standing to benefit from solutions to this problem, ranging from network troubleshooting and capacity provisioning to optimizing the layout of application-level overlay networks, to optimized replica placement.
ALGORITHM / TECHNIQUE USED: ALGORITHM DESCRIPTION: EXISTING SYSTEM: PROPOSED SYSTEM:
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Measurement of network bandwidth is important for many Internet applications and protocols, especially those involving the transfer of large files and those involving the delivery of content with real-time QoS constraints, such as streaming media. Some specific examples of applications which can leverage accurate bandwidth estimation include endsystem multicast and overlay network configuration protocols content location and delivery in peer-to-peer (P2P) networks network-aware cache or replica placement policies and flow scheduling and admission control policies at massively-accessed content servers .In addition, accurate measurements of network bandwidth are useful to network operators concerned with problems such as capacity provisioning, traffic engineering, network troubleshooting and verification of service level agreements (SLAs).
SYSTEM SPECIFICATION: HARDWARE REQUIREMENT:
System Hard Disk Ram Floppy Drive Monitor Mouse
: Pentium IV 2.4 GHz. : 40 GB. : 256 Mb. : 1.44 Mb. : 15 VGA Colour. : Logitech. : Windows XP Professional. : Java. : Eclipse.
SOFTWARE REQUIREMENT:
Operating system Coding Language Tool Used
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

CAPTURING ROUTER CONGESTION AND DELAY Abstract:

Using a unique monitoring experiment, we capture all packets crossing a (lightly utilized) operational access router from a Tier-1 provider, and use them to provide a detailed examination of router congestion and packet delays. The complete capture enables not just statistics as seen from outside the router, but also an accurate physical router model to be identified. This enables a comprehensive examination of congestion and delay from three points of view: the understanding of origins, measurement, and reporting.Our study defines new methodologies and metrics. In particular,the traffic reporting enables a rich description of the diversity of micro congestion behavior, without model assumptions, and at achievable computational cost.
Existing System:
END-TO-END packet delay is one of the canonical metricsin Internet Protocol (IP) networks, and is important bothfrom the network operator and application performance pointsof view. For example the quality of Voice Over IP is directlydependent on delay, and network providers may have ServiceLevel Agreements (SLAs) specifying allowable values of delaystatistics across the domains they control. An important componentof endto-end delay is that due to forwarding elements, thefundamental building block of which is the delay incurred whena packet passes through a single IP router.
Proposed System:
The motivation for the present work is a detailed knowledge and understanding of such through-router delays. A thorough examination of delay leads inevitably to deeper questions about congestion, and router queueing dynamics in general. We provide a comprehensive examination of these issues from three points of view: the understanding of origins, measurement, and reporting, all grounded in a unique data set taken from a router in the access network of a Tier-1 provider.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

The first aim of this paper is a simple one, to exploit this unique data set by reporting in detail on the magnitudes, and also the temporal structure, of delays on high capacity links with nontrivial congestion. The result is one of the most comprehensive pictures of router delay performance that we are aware of. As our analysis is based on empirical results, it is not reliant on assumptions on traffic statistics or router operations. Our second aim is to use the completeness of the data as a tool to investigate how packet delays occur inside the router. In other words, we aim to provide a physical model capable of explaining the observed delay and congestion. Working in the context of the popular store and forward router architecture [5], we are able to justify the commonly held assumption that the bottleneck of such an architecture is in the output buffers, and thereby validate the fluid output queue model relied on routinely in the field of active probing. We go further to define a refined model with an accuracy close to the limits of timestamping precision, which is robust to many details of the architecture under reasonable loads. Packet delays and congestion are fundamentally linked, as the former occur precisely because periods of temporary resource starvation, or micro congestion episodes, are dealt with via buffering. Our third contribution is an investigation of the origins of such episodes, driven by the question, What is the dominant mechanism responsible for delays?. We use a powerful methodology of virtual or semi- experiments, that exploits both the availability of the detailed packet data, and the fidelity of the router model. We identify, and evaluate the contributions of, three known canonical mechanisms: i) reduction in link bandwidth from core to access; ii) multiplexing of multiple input streams; iii) burstiness of the input traffic stream(s).
Modules
CLIENT SERVER
Modules description:
SERVER: Server is main module in this project, server receive the data sent by client & calculate the congestion parameters for the client like delay, bandwidth, busy & status of client. CLIENT: Client sends the data to server & if client is free at server, data is successfully sent .Otherwise the data is in queue until previous data is send.
Hardware Requirements:
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

System Hard Disk Ram
: Pentium IV 2.4 GHz. : 40 GB. : 256 Mb.
Software Requirements:
Operating system Coding Language Tool Used : - Windows XP Professional. : - Java. : - Eclipse.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Minimizing File Download Time in Stochastic Peer-to-Peer Networks

ABSTRACT
The peer to peer(p2p) file-sharing application are becoming increasingly popular and account for more than 70% of the Internets bandwidth usage.Measurement studies show several hour s depending on the level of network congestion or the capacity fluctation.We consider two major factors that have significant impact on average download time,namely spatial service capability in different source peer.
EXISTING SYSTEM:
CLIENT - SERVER FILE SHARING Content distribution is a centralized one, where the content is distributed from the centralized server to all clients requesting the document. Clients send request to the centralized server for downloading the file. Server accepts the request and sends the file as response to the request.In most client-server setups, the server is a dedicated computer whose entire purpose is to distribute files. DRAWBACKS OF EXISTING SYSTEM Scalability problem arises when multi requests arises at a single time. Servers need heavy processing power Downloading takes hours when clients increases
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Requires heavy storage in case of multimedia content
PROPOSED SYSTEM:
Peer-to-peer content distribution provides more resilience and higher availability through wide-scale replication of content at large numbers of peers. A P2P content distribution community is a collection of intermittently-connected nodes with each node contributing storage, content and bandwidth to the rest of the community The peer-to-peer file sharing networks had a centralized server system. This system controls traffic amongst the users.
HARDWARE SPECIFICATION:
Processor : Speed RAM Hard Disk : General Pentium-IV : 1.1GHz : 512MB 40GB : KeyBoard, Monitor , Mouse
SOFTWARE SPECIFICATION:
Operating System : Windows XP Software : JAVA ( JDK 1.5.0) Protocol : UDP
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

A Geometric Approach to Improving Active 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. The objective of our study is to understand how to measure packet loss episodes accurately with end-to-end probes. Studies show that the standard Poisson-modulated end-to-end measurement of packet loss accuracy has to be improved. Thus, 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 enable more accurate measurements than standard Poisson probing and other traditional packet loss measurement tools. We also find the transfer rate. We evaluate the capabilities of our methodology experimentally by developing and implementing a prototype tool, called BADABING. BADABING reports loss characteristics are far more accurately than traditional loss measurement tools. Existing System:
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

In the Existing traditional packet loss measurement tools, the accuracy of the packet loss measurement has to be improved. Several studies include the use of loss measurements to estimate packet loss, such as Poisson modulated tools which can be quite inaccurate. Proposed System: The purpose of our study is to understand how to measure end-to-end packet loss characteristics accurately. The goal of our study is to understand how to accurately measure loss characteristics on end-to-end paths with probes. Specifically, our method entails probe experiments that follow a geometric approach to improve the accuracy of the packet loss measurement. System Requirements Hardware:
PROCESSOR RAM MONITOR HARD DISK CDDRIVE KEYBOARD : : : : : : PENTIUM IV 2.6 GHz 512 MB 15 20 GB 52X STANDARD 102 KEYS
Software:
FRONT END : JAVA, SWING TOOLS USED : JFRAME BUILDER OPERATING SYSTEM: WINDOWS XP
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

A Bidirectional Routing Abstraction for Asymmetric Mobile Ad Hoc Networks ABSTRACT

Wireless links are often asymmetric due to heterogeneity in the transmission power of devices, non-uniform environmental noise, and other signal propagation phenomenons. Unfortunately, routing protocols for mobile ad hoc networks typically work well only in bidirectional networks. This paper first presents a simulation study quantifying the impact of asymmetric links on network connectivity and routing performance. It then presents a framework called BRA that provides a bidirectional abstraction of the asymmetric network to routing protocols. BRA works by maintaining multi-hop reverse routes for unidirectional links and provides three new abilities: improved connectivity by taking advantage of the unidirectional links, reverse route forwarding of control packets to enable off-the-shelf routing protocols, and detection packet loss on unidirectional links. Extensive simulations of AODV layered on BRA show that packet delivery increases substantially (two-fold in some instances) in asymmetric networks compared to regular AODV, which only routes on bidirectional links.
Description of Problem
The similar system is already available are non-predictive and employs greedy based algorithms or a variant of it. That is the existing system will not predict in advance regarding the situation. So we cannot schedule the jobs in network in such a way that the resources are utilized at the optimal level. The problem is to reduce the processing overhead during scheduling. The proposed system work to data transfer between
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

computers of two networks. Generally, during data transfer between pc of two different networks.
Existing Method
The Data mining Algorithms can be categorized into the following: AODVAlgorithm Classification Clustering Algorithm Classification: The process of dividing a dataset into mutually exclusive groups such that the members of each group are as "close" as possible to one another, and different groups are as "far" as possible from one another, where distance is measured with respect to specific variable(s) you are trying to predict. For example, a typical classification problem is to divide a database of companies into groups that are as homogeneous as possible with respect to a creditworthiness variable with values "Good" and "Bad." Clustering: The process of dividing a dataset into mutually exclusive groups such that the members of each group are as "close" as possible to one another, and different groups are as "far" as possible from one another, where distance is measured with respect to all available variables. Given databases of sufficient size and quality, data mining technology can generate new business opportunities by providing these capabilities: Automated prediction of trends and behaviors . Data mining automates the process of finding predictive information in large databases. Questions that traditionally required extensive hands-on analysis can now be answered directly from the data quickly. A typical example of a predictive problem is targeted marketing. Data mining uses data on past promotional mailings to identify the targets most likely to maximize return on investment in future mailings. Other predictive problems include forecasting bankruptcy and other forms of default, and identifying segments of a population likely to respond similarly to given events.
Automated discovery of previously unknown patterns . Data mining tools sweep through databases and identify previously hidden patterns in one step. An example of pattern discovery is the analysis of retail sales data to identify seemingly unrelated products that are often purchased together. Other pattern discovery problems include detecting fraudulent credit card transactions and identifying anomalous data that could represent data entry keying errors.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Proposed System
Job scheduling is the key feature of any computing environment and the efficiency of computing depends largely on the scheduling technique used. Popular algorithm called Bi-Directional Routing concept is used in the systems across the network and scheduling the job according to predicting the load. Here the system will take care of the scheduling of data packets between the source and destination computers. Job scheduling to route the packets at all the ports in the router Maintaining queue of data packets and scheduling algorithm is implemented First Come First Serve scheduling and Bi-Directional Routing Algorithm scheduling is called for source and destination Comparison of two algorithm is shown in this proposed system
SYSTEM REQUIREMENTS: Hardware: PROCESSOR RAM HARD DISK Software: FRONT END : Java OPERATING SYSTEM : Windows XP : Dual Core : 1 GB : 160 GB
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Designing Less-Structured P2P Systems For the Expected High Churn

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 queryrelated 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 endapplication performance and in the context of dynamic and heterogeneous Internet environments. We do this using a number of currently adopted and proposed queryrelated strategies, including methods for query distribution, caching, and replication. We then show, through trace-driven simulation and wide-area experimentation, the performance advantages of lifespan-based, query-related strategies when layered over currently employed and lifespan-based organizational protocols. While merely illustrative, the evaluated strategies and protocols clearly demonstrate the advantages of considering peers session time in designing widely-deployed P2P systems.
EXISTING SYSTEM:
Query strategy is flooding, where a query is propagated to all neighbors within a certain radius. It provides scalability problem
PROPOSED SYSTEM:
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Lifespan-based strategies for query distribution, caching, and replication. The problem of highly transient populations in unstructured and loosely structured P2P systems can be rectified. We present trace-driven simulation and wide-area experiment results that illustrate the performance advantages of considering peers estimated session time as a key system attribute in the design of Churn-resilient P2P systems
SYSTEM REQUIREMENTS
Hardware: PROCESSOR RAM HARD DISK : : : PENTIUM IV 2.6 GHz 512 MB DD RAM 80 GB
Software: Front End : Java, Swing Tools Used : JFrameBuilder Back End : MS SQL 2000 Operating System : WindowsXP
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Performance of a Speculative Transmission Scheme for Scheduling-Latency Reduction

Abstract:
This work was motivated by the need to achieve low latency in an input-queued centrally-scheduled cell switch for high-performance computing applications; specifically, the aim is to reduce the latency incurred between a request and response arrival of the corresponding grant. The minimum latency in switches with centralized scheduling comprises two components, namely, the control-path latency and the data-path latency, which in a practical high-capacity, distributed switch implementation can be far greater than the cell duration. We introduce a speculative transmission scheme to significantly reduce the average control-path latency by allowing cells to proceed without waiting for a grant, under certain conditions. It operates in conjunction with any centralized matching algorithm to achieve a high maximum utilization. Using this model, performance measures such as the mean delay and the rate of successful speculative transmissions are derived. The results
demonstrate that the latency can be almost entirely eliminated between request and response for loads up to 50%. Our simulations confirm the analytical results.
Existing System:
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Brikoff-von-newmann Switch which is eliminate the scheduler. It incurs a worst-case latency penalty of N time slots. It has to wait for exactly N time slots for the next opportunity. Control and data path-latencies comprise serialization and deserialization delays, propagation delay, processing delay between request and response.
Proposed System:
We propose a novel method to scheduled transmission in a cross bar Speculative modes of operation utilization. Scheduled modes of operation throughput. combine speculative and switch. reduced latency at low achieve high maximum
Advantage:
The speculative transmission that does not have to wait for grant hence low latency. The scheduled transmission achieve high maximum throughput.
System Requirements: Hardware:

PROCESSOR RAM MONITOR HARD DISK : : : PENTIUM IV 2.6 GHz 512 MB DD RAM 15 COLOR : 20 GB
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

CDDRIVE KEYBOARD MOUSE
: LG 52X : STANDARD 102 KEYS : 3 BUTTONS
Software:
Front End : Java, Swing Tools Used : JFrameBuilder Operating System : Windows XP Back End : SQL Server 2000
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. Existing System:
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

In previous simulation model uses a combination of the deterministic epidemic model and a general stochastic epidemic model to model the effect of large-scale worm attacks. In an Existing system the complexity of the general stochastic epidemic model makes it difficult to derive insightful results that could be used to contain the worm. In a previous study it is used to detect the presence of a worm by detecting the trend, not the rate, of the observed illegitimate scan traffic. The filter is used to separate worm traffic from background non worm scan traffic. Proposed System: This model leads to the development of an automatic worm containment strategy that prevents the spread of a worm beyond its early stage. We obtain the probability that the total number of hosts that the worm infects is below a certain level. Our strategy can effectively contain both fast scan worms and slow scan worms without knowing the worm signature in advance or needing to explicitly detect the worm. Our automatic worm containment schemes effectively contain the worms and stop its spreading.
System Requirements
Hardware:
PROCESSOR RAM : PENTIUM IV 2.6 GHz : 512 MB
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

MONITOR HARD DISK CDDRIVE KEYBOARD MOUSE
: : : : :
15 20 GB 52X STANDARD 102 KEYS 3 BUTTONS
Software:
FRONT END : JAVA, SWING TOOLS USED : JFRAME BUILDER OPERATING SYSTEM: WINDOWS XP
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.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

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.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

System Requirements Hardware Requirements:

PROCESSOR RAM MONITOR HARD DISK FLOPPY DRIVE CDDRIVE KEYBOARD : PENTIUM IV 2.6 GHz :512 MB DD RAM :15 COLOR :20 GB :1.44 MB :LG 52X :STANDARD 102 KEYS
FRONT END : Java swing and Networking OPERATING SYSTEM : Windows XP BACK END :Ms Access
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

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
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

RAM MONITOR HARD DISK FLOPPY DRIVE CDDRIVE KEYBOARD
:512 MB DD RAM :15 COLOR :20 GB :1.44 MB :LG 52X :STANDARD 102 KEYS
FRONT END : Java swing and Networking OPERATING SYSTEM : Windows XP BACK END :Ms Access
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Dual-Link Failure Resiliency through Backup Link Mutual Exclusion

Abstract:
Networks employ link protection to achieve fast recovery from link failures. While the first link failure can be protected using link protection, there are several 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. The ILP formulation and heuristic are applied to six networks and their performance is compared with approaches that assume precise knowledge of dual-link failure. It is observed that a solution exists for all of the six networks considered. The heuristic approach is shown to obtain feasible solutions that are resilient to most dual-link failures, although the backup path lengths may be significantly higher than optimal. In addition, the paper illustrates the significance of the knowledge of failure location by illustrating that network with higher connectivity may require lesser capacity than one with a lower connectivity to recover from dual-link failures. System Requirements: Software: FRONT END : JAVA(SWING) OS : Windows Xp SP2 IDE : NetBeans 6.5, JFrameBuilder
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Hardware: PROCESSOR RAM MONITOR HARD DISK CD-DRIVE KEYBOARD MOUSE
: : : : : : :
PENTIUM IV 2.6 GHz 512 MB DD RAM 15 COLOR 20 GB LG 52X STANDARD 102 KEYS 3 BUTTONS
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Security in large Networks Using Mediator Protocols

Abstract: The combination of 3AQKDP (implicit) and 3AQKDPMA (explicit) quantum cryptography is used to provide authenticated secure communication between sender and receiver. In quantum cryptography, quantum key distribution protocols (QKDPs) employ quantum mechanisms to distribute session keys and public discussions to check for eavesdroppers and verify the correctness of a session key. However, public discussions require additional communication rounds between a sender and receiver. The advantage of quantum cryptography easily resists replay and passive attacks. A 3AQKDP with implicit user authentication, which ensures that confidentiality is only possible for legitimate users and mutual authentication is achieved only after secure communication using the session key start. In implicit quantum key distribution protocol(3AQKDP) have two phases such as setup phase and distribution phase to provide three party authentication with secure session key distribution. In this system there is no mutual understanding between sender and receiver. Both sender and receiver should communicate over trusted center. In explicit quantum key distribution protocol (3AQKDPMA) have two phases such as setup phase and distribution phase to provide three party authentications with secure session key distribution. I have mutual understanding between sender and receiver. Both sender and receiver should communicate directly with authentication of trusted center. Disadvantage of separate process 3AQKDP and 3AQKDPMA were provide the authentication only for message, to identify the security threads in the message. Not identify the security threads in the session key. 3.1 Existing System In classical cryptography, three-party key distribution protocols utilize challengeresponse mechanisms or timestamps to prevent replay attacks . However, challengeresponse mechanisms require at least two communication rounds between the TC and participants, and the timestamp approach needs the assumption of clock synchronization which is not practical in distributed systems (due to the unpredictable nature of network delays and potential hostile attacks) .
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Furthermore, classical cryptography cannot detect the existence of passive attacks such as eavesdropping. This fact can then be used to reduce the number ofrounds of other protocols based on challenge-response mechanisms to a trusted center (and not only three-party authenticated key distribution protocols). 3.2 Limitations of Existing System Disadvantage of separate process 3AQKDP and 3AQKDPMA were provide the authentication only for message, to identify the security threads in the message. Not identify the security threads in the session key. 3.3 Proposed System. In quantum cryptography, quantum key distribution protocols (QKDPs) employ quantum mechanisms to distribute session keys and public discussions to check for eavesdroppers and verify the correctness of a session key. However, public discussions require additional communication rounds between a sender and receiver and cost precious qubits. By contrast, classical cryptography provides convenient techniques that enable efficient key verification and user authentication. Hardware Interface Hard disk : 40 GB RAM : 512 MB Processor Speed : 3.00GHz Processor : Pentium IV Processor Software Interface JDK 1.5 Java Swing MS-Access/SQL Server
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

A Distributed Database Architecture For Global Roaming In Next-Generation Mobile Networks
Abstract
The next-generation mobile network will support terminal mobility, personal mobility, and service provider portability, making global roaming seamless. A locationindependent personal telecommunication number (PTN) scheme is conducive to implementing such a global mobile system. However, the nongeographic PTNs coupled with the anticipated large number of mobile users in future mobile networks may introduce very large centralized databases. This necessitates research into the design and performance of high-throughput database technologies used in mobile systems to ensure that future systems will be able to carry efficiently the anticipated loads. This project proposes a scalable, robust, efficient location database architecture based on the locationindependent PTNs. The proposed multitree database architecture consists of a number of database subsystems, each of which is a three-level tree structure and is connected to the others only through its root. By exploiting the localized nature of calling and mobility patterns, the proposed architecture effectively reduces the database loads as well as the signaling traffic incurred by the location registration and call delivery procedures. In addition, two memory-resident database indices, memory-resident direct file and T-tree, are proposed for the location databases to further improve their throughput. Analysis model and numerical results are presented to evaluate the efficiency of the proposed database architecture. Results have revealed that the proposed database architecture for location management can effectively support the anticipated high user density in the future mobile networks.
HARDWARE REQUIREMENTS:
Intel Pentium III Processor 128MB RAM
10 GB Free Hard disk space STD Color Monitor
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

SOFTWARE SPECIFICATION Operating System Software Database : Windows 2000/XP/NT. : JDK 1.5 : Microsoft Access
A Novel Secure Communication Protocol for Ad Hoc networks [SCP] Abstract
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

An ad hoc network is a self organized entity with a number of mobile nodes without any centralized access point and also there is a topology control problem which leads to high power consumption and no security, while routing the packets between mobile hosts. Authentication is one of the important security requirements of a communication network. The common authentication schemes are not applicable in Ad hoc networks. In this paper, we propose a secure communication protocol for communication between two nodes in ad hoc networks. This is achieved by using clustering techniques. We present a novel secure communication framework for ad hoc networks (SCP); which describes authentication and confidentiality when packets are distributed between hosts with in the cluster and between the clusters. These cluster head nodes execute administrative functions and network key used for certification. The cluster head nodes (CHs) perform the major operations to achieve our SCP framework with help of Kerberos authentication application and symmetric key cryptography technique which will be secure reliable transparent and scalable and will have less over head. 3.1 HARDWARE AND SOFTWARE SPECIFICATION: Hardware Environment: The selection of hardware is very important in the existence and proper working of any software. In the selection of hardware, the size and the capacity requirements are also important. The Web Based Manufacturing System can be efficiently run on Pentium system with at least 128 MB RAM and Hard disk drive having 20 GB. Floppy disk drive of 1.44 MB and 14 inch Samsung color monitor suits the information system operation.(A Printer is required for hard copy output). Processor : Intel P-III based system Processor Speed : 250 MHz to 833MHz RAM : 256MB Hard Disk : 40GB
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Software Environment: One of the most difficult tasks is that, the selection of the software, once system requirement is known is determining whether a particular software package fits the requirements. After initial selection further security is needed to determine the desirability of particular software compared with other candidates. This section first summarizes the application requirement question and then suggests more detailed comparisons. Operating System Browser Web/Application Server Database Database Connectivity Java Technologies Scripting Technology -------Windows 95/98/NT/2000 IE Tomcat Server Oracle JDBC Java (Servlets, Jsp) JavaScript
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Using the Conceptual Cohesion of Classes for Fault Prediction in Object-Oriented Systems
Abstract:
High cohesion is desirable property in software systems to achieve reusability and maintainability. In this project we are measures for cohesion in Object-Oriented (OO) software reflect particular interpretations of cohesion and capture different aspects of it. In existing approaches the cohesion is calculate from the structural information for example method attributes and references. In conceptual cohesion of classes, i.e. in our project we are calculating the unstructured information from the source code such as comments and identifiers. Unstructured information is embedded in the source code. To retrieve the unstructured information from the source code Latent Semantic Indexing is used. A large case study on three open source software systems is presented which compares the new measure with an extensive set of existing metrics and uses them to construct models that predict software faults. In our project we are achieving the high cohesion and we are predicting the fault in Object Oriented Systems.
Existing Systems:
1. Structural metrics are calculated from the source code such as references and data sharing between methods of a class belong together for cohesion. 2. It define and measure relationships among the methods of a class based on the number of pairs of methods that share instance or class variables one way or another for cohesion. Lacking of high cohesion
Disadvantage
Proposed Systems
1. In proposed System unstructural information is retrieved from the source code like comments and identifiers. 2. Information is retrieved from the source code using Latent Semantic Indexing.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

3. With the help of C3 and existing metrics we are achieving the high cohesion and low coupling.
Advantage
We can predict the fault prediction using high cohesion
System Requirements: Hardware Requirements: PROCESSOR RAM MONITOR HARD DISK FLOPPY DRIVE CDDRIVE KEYBOARD MOUSE Software Requirements: LANGUAGE : JAVA FRONT-END TOOL : SWING OPERATING SYSTEM : WINDOWS-XP
: : : : : :
PENTIUM III 866 MHz : 128 MB DD RAM 15 COLOR : 20 GB 1.44 MB LG 52X STANDARD 102 KEYS 3 BUTTONS
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

DYNAMIC SEARCH ALGORITHM IN UNSTRUCTURED PEER-TO-PEER NETWORKS

ABSTRACT:
Designing efficient search algorithms is a key challenge in unstructured peer-topeer networks. Flooding and random walk (RW) are two typical search algorithms. Flooding searches aggressively and covers the most nodes. However, it generates a large amount of query messages and, thus, does not scale. On the contrary, RW searches conservatively. It only generates a fixed amount of query messages at each hop but would take longer search time. We propose the dynamic search (DS) algorithm, which is a generalization of flooding and RW. DS takes advantage of various contexts under which each previous search algorithm performs well. It resembles flooding for short-term search and RW for long-term search. Moreover, DS could be further combined with knowledgebased search mechanisms to improve the search performance. We analyze the performance of DS based on some performance metrics including the success rate, search time, query hits, query messages, query efficiency, and search efficiency. Numerical results show that DS provides a good tradeoff between search performance and cost. On average, DS performs about 25 times better than flooding and 58 times better than RW in power-law graphs, and about 186 times better than flooding and 120 times better than RW in bimodal topologies. SYSTEM ANALYSIS: EXISTING SYSTEM: Flooding and RW are two typical examples of blind search algorithms by which query messages are sent to neighbors without any knowledge about the possible locations of the queried resources or any preference for the directions to send. Some other blind search algorithms include modified BFS (MBFS) , directed BFS expanding ring and random periodical flooding (RPF).These algorithms try to modify the operation of flooding to improve the efficiency. However, they still generate a large amount of query messages. DISADVANTAGES: In the existing system search cost is high. It produces considerable query messages even when the resource distribution is scarce. The search is especially inefficient when the target is far from the query source because the number of query messages would grow exponentially with the hop counts. Its more time consuming one.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

ROPOSED SYSTEM:
In this paper, we propose the dynamic search (DS) algorithm, which is a generalization of flooding and RW. DS overcomes the disadvantages of flooding and RW and takes advantage of different contexts under which each search algorithm performs well. The operation of DS resembles flooding for the short-term search and RW for the long-term search. In order to analyze the performance of DS, we apply the random graphs as the models of network topologies and adopt the probability generating functions to model the link degree distribution. We evaluate the performance of search algorithms in accordance with some performance metrics including the success rate, search time, number of query hits, and number of query messages, query efficiency, and search efficiency.
PROBLEM FORMULATION:
Flooding and RW are two typical examples of blind search algorithms by which query messages are sent to neighbors without any knowledge about the possible locations of the queried resources or any preference for the directions to send. Some other blind search algorithms include modified BFS (MBFS) [23], directed BFS [6], expanding ring and random periodical flooding (RPF).These algorithms try to modify the operation of flooding to improve the efficiency. However, they still generate a large amount of query messages. Jiang et al. propose a Light Flood algorithm, which is a combination of the initial pure flooding and subsequent tree-based flooding. PROPOSED SOLUTION: DS is designed as a generalization of flooding, MBFS, and RW. There are two phases in DS. Each phase has a different searching strategy. The choice of search strategy at each phase depends on the relationship between the hop count h of query messages and the decision threshold n of DS. Phase1. When h <= n At this phase, DS acts as flooding or MBFS. The number of neighbors that a query source sends the query messages to depends on the predefined transmission probability p. If the link degree of this query source is d, it would only send the query messages to d. p neighbors. When p is equal to 1, DS resembles flooding. Otherwise, it operates as MBFS with the transmission probability p. Phase2. When h > n At this phase, the search strategy switches to RW. Each node that receives the query message would send the query message to one of its neighbors if it does not have the queried resource. Assume that the number of nodes visited by DS at hop h n is the
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

coverage cn, and then the operation of DS at that time can be regarded as RW with cn walkers. However, there are some differences between DS and RW when we consider the whole operation.
KNOWLEDGE-BASED DYNAMIC SEARCH

In this section, we present the generic scheme to incorporate these knowledge-based search algorithms with our DS algorithm. We construct the probabilistic function based on the information learned from the past experiences, with respect to each search target, search time, and local topology information. Thus, a node has more information to intelligently decide how many query messages to send and to which peers these messages should be forwarded System Requirements: Hardware requirements: Processor : Any Processor above 500 MHz. Ram : 128Mb. Hard Disk : 10 Gb. Compact Disk : 650 Mb. Input device : Standard Keyboard and Mouse. Output device : VGA and High Resolution Monitor. Software requirements: Operating System Language Data Bases Front End : Windows Family. : JDK 1.5 : Microsoft Sql Server : Java Swing
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Distributed Algorithms for Constructing Approximate Minimum Spanning Trees In Wireless Sensor Networks
Abstract: While there are distributed algorithms for the Minimum Spanning Tree (MST) problem, these algorithms require relatively large number of messages and time, and are fairly involved, making them impractical for resource-constrained networks such as wireless sensor networks. In such networks, a sensor has very limited power and any algorithm needs to be simple, local and energy efficient. Motivated by these considerations, we design and analyze a class of simple and local distributed algorithms called Nearest Neighbor Tree (NNT) algorithms for energy- efficient construction of an approximate MST in wireless networks. Assuming that the nodes are uniformly distributed, we show provable bounds on both the quality of the spanning tree produced and the energy needed to construct them. We show that while NNT produces a close approximation to the MST, it consumes asymptotically less energy than the classical message-optimal distributed MST algorithm due to Gallagery, Humblet, and Spira. Further, the NNTs can be maintained dynamically with polylogarithmic rearrangements under node insertions/deletions. We also perform extensive simulations, which show that the bounds are much better in practice. Our results, to the best of our knowledge, demonstrate the first tradeoff between the quality of approximation and the energy required for building spanning trees on wireless networks, and motivate similar considerations for other important problems. Existing System: The minimum spanning tree (MST) problem is an important and commonly occurring primitive in the design and operation of data and communication networks . For instance , in ad hoc sensor networks , MST is the optimal routing tree for data aggregation. Traditionally, the efficiency of distributed algorithms is measured by the running time and the number of messages exchanged among the computing nodes , and a lot of research has gone into the design of algorithms that are optimal with respect to such criteria. The classical algorithm due to Gallagery, Humble t, and
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Spira (hence forth referred to as the GHS algorithm) uses _(n ln n ) jEj) messages , and is essentially optimal with respect to the message complexity . There are distributed algorithms that find the MST and are essentially optimal in terms of time complexity : they run in O(Diam(G) ) n1=2polylog(n)) time, and there are (almost) matching lower bounds. However, these time-optimal algorithms involve a lot of message transfers (much more than GHS). Even for a wireless network modeled by a unit disk graph (UDG) or even a ring, any distributed algorithm to construct an MST needs _(n ln n) messages . Despite their theoretical optimality, these algorithms are fairly involved, require synchronization and a lot of bookkeeping ;such algorithms are impractical for ad hoc and sensor networks . Disadvantages: The network management and communication has to be done in a local and distributed fashion. Battery limitations Energy is a very crucial resource. Exchanges a large number of messages, can consume a relatively large amount of energy (and also time) It is not suitable in an energy-constrained sensor network Cycle detection is another one disadvantage Proposed System: In this paper, we study a class of simple , local , distributed, approximation algorithms called the Nearest Neighbor Tree (NNT) algorithms that are provably good: they build slightly suboptimal trees with low energy complexity and are easy to maintain dynamically. The NNT algorithms bypass such a step completely by a very simple idea : each node chooses a unique rank, a quantity from a totally ordered set, and a node connects to the nearest node of higher rank. The algorithm consists of exchanging three types of messages : request, available, and connect among the nodes . Each node begins with broadcasting a request for connection message. System Requirement: Hardware requirements: Processor : Any Processor above 500 MHz. Ram Hard Disk : 128Mb. : 10 GB.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Compact Disk Input device Output device
: 650 Mb. : Standard Keyboard and Mouse. : VGA and High Resolution Monitor.
Software requirements: Operating System Language Data Bases Front End : Windows 2000 server Family. : JDK 1.5 : Microsoft SQL Server : Java Swing
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

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. Algorithm / Technique used: Distance-vector-based algorithm for dynamic routing. Algorithm Description: A distance-vector-based algorithm for dynamic routing to improve the security of data transmission. We propose to rely on existing distance information exchanged among neighboring nodes (referred to as routers as well in this paper) for the seeking of routing paths. In many distance-vector-based implementations, e.g., those based on RIP, each node Ni maintains a routing table in which each entry is associated with a tuple and Next hop denote some unique destination node, an estimated minimal cost to send a packet to t, and the next node along the minimal-cost path to the destination node, respectively.
Existing System:
Existing work on security-enhanced data transmission includes the designs of cryptography algorithms and system infrastructures and security-enhanced routing methods. Their common objectives are often to defeat various threats over the Internet, including eavesdropping, spoofing, session hijacking, etc. Among many well-known designs for cryptography based systems, the IP Security (IPSec) and the Secure Socket Layer (SSL) are popularly supported and implemented in many systems and platforms. Although IPSec and SSL do greatly improve the security level for data transmission, they
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

unavoidably introduce substantial overheads, especially on gateway/host performance and effective network bandwidth. For example, the data transmission overhead is 5 cycles/byte over an Intel Pentium II with the Linux IP stack alone, and the overhead increases to 58 cycles/byte when Advanced Encryption Standard (AES) is adopted for encryption/decryption for IPSec.
Proposed System:
We propose a dynamic routing algorithm that could randomize delivery paths for data transmission. The algorithm is easy to implement and compatible with popular routing protocols, such as the Routing Information Protocol in wired networks and Destination-Sequenced Distance Vector protocol in wireless networks, without introducing extra control messages
System : Pentium IV 2.4 GHz. Hard Disk : 40 GB. Floppy Drive : 1.44 Mb. Monitor : 15 VGA Colour. Mouse : Logitech. Ram : 256 Mb.
Operating system Coding Language Tool Used : - Windows XP Professional. : - Java. : - Eclipse.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Quiver: Consistent Object Sharing for Edge Services

Abstract
We present Quiver, a system that coordinates service proxies placed at the edge of the Internet to serve distributed clients accessing a service involving mutable objects. Quiver enables these proxies to perform consistent accesses to shared objects by migrating the objects to proxies performing operations on those objects. These migrations dramatically improve performance when operations involving an object exhibit geographic locality, since migrating this object into the vicinity of proxies hosting these operations will benefit all such operations. This system reduces the workload in the server. It performs the all operations in the proxies itself. In this system the operations performed in First-In-First-Out process. This system handles two process serializability and strict serializabilty for durability in the consistent object sharing . Other workloads benefit from Quiver, dispersing the computation load across the proxies and saving the costs of sending operation parameters over the wide area when these are large. Quiver also supports optimizations for single-object reads that do not involve migrating the object. We detail the protocols for implementing object operations and for accommodating the addition, involuntary disconnection, and voluntary departure of proxies. Finally, we discuss the use of Quiver to build an e-commerce application and a distributed network traffic modeling service. Existing System: In the existing system the proxies has been maintained in the critical path for each object updation or each proxy should connected with the centralized server. The consistency was not maintained while sharing the object. If the proxy has failed means the object has been lost. The existing system supports only single-object operations, and provides weak consistency semantics.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Disadvantages: Consistency was not maintained while migrating the object between the proxies. It does not handle the proxy disconnections. It supports only the single object operations. Proposed System: This system forms the proxies in the tree structure. It shares the objects within the proxies. It reduces the workload in the server. Quiver enables consistent multiobject operations and optimizations for single-object reads that are not possible in these prior algorithms. This system recovers the proxy disconnection. The disconnected proxies maintained by alternate proxies or it will be maintained through server. This System use the kruskals algorithm for maintaining tree structure. It reduces weightage in the tree structure. It holds the object even when the proxy has been disconnected.
System Requirements
Hardware: 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 MOUSE : 3 BUTTONS Software:
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Front End : Java Back End : MS Access Tools Used : NetBeans(ide) Operating System : WindowsXp
DCMP: A DISTRIBUTED CYCLE MINIMIZATION PROTOCOL FOR PEER-TO-PEER NETWORKS ABSTRACT

Broadcast-based peer-to-peer (P2P) networks, including flat (for example, Gnutella) and two-layer superpeer implementations (for example, Kazaa), are extremely popular nowadays due to their simplicity, ease of deployment, and versatility. The unstructured network topology, however, contains many cyclic paths, which introduce numerous duplicate messages in the system. Although such messages can be identified and ignored, they still consume a large proportion of the bandwidth and other resources, causing bottlenecks in the entire network. In this paper, 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. The overall structure is constructed fast with very low overhead. With the information collected during this process, distributed maintenance is performed efficiently even if peers quit the system without notification. The experimental results from our simulator and the prototype implementation on PlanetLab confirm that DCMP significantly improves the scalability of unstructured P2P systems without sacrificing their desirable properties. Moreover, due to its simplicity, DCMP can be easily implemented in various existing P2P systems and is orthogonal to the search algorithms. EXISTING SYSTEM Simplicity, ease of deployment, and versatility Unstructured network topology contains many cyclic paths It simplifies the implementation of large ad hoc distributed repositories of digital information. Queries are transmitted through the cyclic path
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

LIMITATIONS OF THE EXITING SYSTEM Introduce numerous duplicate messages in the system It consume a large proportion of the bandwidth and other resources It causes bottlenecks in the entire network. PROPOSED SYSTEM DCMP is dynamic fully decentralized protocol Queries are transmitted through the peers DCMP use message flooding to propagate queries DCMP use the method Native Duplicate Elimination (NDE) DCMP implements the prototype called Planet Lab ADVANTAGE OF PROPOSED SYSTEM Preserve the fault resilience and load balancing It avoid duplicate messages and repeated messages It reduce number of cycle per transaction
HARDWARE REQUIREMENTS Processor/system Main memory Cache memory Processor speed Keyboard Hard disk drive : : : : : : Pentium IV 512 MB RAM 512 KB 600 MHz 101 keys 40 GB
SOFTWARE REQUIREMENTS Operating system Front end designing Tool Programming Language Text Editor Database : Windows 2000 and above : Java Swing : Core Java : Note Pad : SQL-Server.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Computation-Efficient Multicast Key Distribution

ABSTRACT
Efficient key distribution is an important problem for secure group communications. The communication and storage complexity of multicast key distribution problem has been studied extensively. In this paper, we propose a new multicast key distribution scheme whose computation complexity is significantly reduced. Instead of using conventional encryption algorithms, the scheme employs MDS codes, a class of error control codes, to distribute multicast key dynamically. This scheme drastically reduces the computation load of each group member compared to existing schemes employing traditional encryption algorithms. Such a scheme is desirable for many wireless applications where portable devices or sensors need to reduce their computation as much as possible due to battery power limitations. Easily combined with any key-tree-based schemes, this scheme provides much lower computation complexity while maintaining low and balanced communication complexity and storage complexity for secure dynamic multicast key distribution.
Existing System
The communication complexity is usually ensured by the number of data bits that need to be transmitted from the GC to group members to convey information of session keys, whereas the storage complexity is measured by the number of data bits that the GC and group members need to store to obtain session keys. Another similarly important but usually under noticed, if not ignored, factor is the computation complexity, which can be measured by the number of computation operations (or the computation time on a given computing platform) that the GC and group members need to distribute and extract session keys. Hereafter, the problem of how resources can effectively be used to distribute session keys is referred to as the group key distribution problem. Draw Back: The group controller maintains whole group members information, so increase the storage complexity.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

The group members are not able to communicate with any other groups during the re keying process. The Group controller takes all responsibilities for the group such as key generation, re keying process and message transfer to any other groups
Proposed System:
The complexity of the rekeying operation is asymmetric between a new members join and an old members leave. When a new member joins, the GC can easily multicast the new session key encrypted by the current session key to all the current members, followed by a unicast to the new member to send the new session key encrypted by a predetermined encryption key shared between the GC and the new member. Thus, join is easy, with low communication and computation cost. However, when an old member leaves, the current session key cannot be used to convey the new session key information securely, since it is also known to the old member. Thus, hereafter, we will focus on the rekeying operation for a single member leave. The same idea can easily be extended to other rekeying operations such as batch rekeying. Advantages of the Proposed System: The Group controller responsibilities are shared by the Group control intermediater such as Re keying process and scalability of the group process Use the Identity tree based structure The group members are not affected by the key generation process when they are willing to communicate with any other group members The Centralized key server used for key generation process and the KGC is also act as a Router for group to group communication The Re keying process is done only to the particular group members not to the entire group members Hardware requirements: Processor : Pentium IV Ram : 256MB. Hard Disk : 80 GB Software requirements: Operating System : Windows XP Techniques : JDK 1.5 Data Bases : Microsoft Sql Server Front End : Java Swing.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

An Adaptive Programming Model for Fault-Tolerant Distributed Computing Abstract The capability of dynamically adapting to distinct runtime conditions is an important issue when designing distributed systems where negotiated quality of service (QOS) cannot always be delivered between processes. Providing fault tolerance for such dynamic environments is a challenging task. Considering such a context, this paper proposes an adaptive programming model for fault-tolerant distributed computing, which provides upper-layer applications with process state information according to the current system synchrony (or QOS). The underlying system model is hybrid, composed by a synchronous part (where there are time bounds on processing speed and message delay) and an asynchronous part (where there is no time bound). However, such a composition can vary over time, and, in particular, the system may become totally asynchronous (e.g., when the underlying system QOS degrade) or totally synchronous. Moreover, processes are not required to share the same view of the system synchrony at a given time. To illustrate what can be done in this programming model and how to use it, the consensus problem is taken as a benchmark problem. This paper also presents an implementation of the model that relies on a negotiated quality of service (QOS) for communication channels. SOFTWARE REQUIREMENTS: Java1.3 or More Java Swing front end Windows 98 or more. Ms Access Back end HARDWARE REQUIREMENTS: Hard disk : 40 GB RAM :128mb Processor : Pentium
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Homogenous Network Control And Implementation
ABSTRACT
This project, titled Homogenous Network Control and Implementation, presents a way of developing integrity-preserved computer networks.The propsed 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) comprise of similar kinds of PCs, 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. In general, a set of networks is classified as homogenous, if the networks are same(e.g., using the same basic technology, frame format and addressing); a set of networks is classified as heterogeneous if the set contains network that differ. The theme of the project is centered on the development of a homogenous network and establishment of process continuation module, which plays an imperative part in maintaining the network integrity.
Operating System Software : Windows XP/NT. : JDK 1.5
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

A BGP Based Mechanism For Lowest Cost Routing
ABSTRACT
The routing of traffic between internet domains and autonomous systems is handled by the Border Gateway Protocol (BGP). The internet comprised of many administrative domains to transmit the packets from one autonomous system to another or with in the system. There is set of bidirectional links between the no of nodes and the network is an AS graph because the routes selection problem arises when a node has multiple potential routes to destination .The main goal is to send each packet along the least cost path(LCP), the pricing mechanism must be strategy proof so that agents have no incentives to lie about their costs.
.1 Existing System
The drawback of this approach is that it tends to overwhelm the nodes on the least cost path, which is undesirable for sensor networks since all sensor nodes are collaborating for a common mission and the duties of failed nodes may not be taken by other nodes. A few schemes have been proposed to address this problem by studying the maximum lifetime routing problem. The problem focuses on computing the flow and transmission power to maximize the lifetime of the network, which is the time at which the first node in the network runs out of energy. Some distributed solutions based on sub gradient algorithms and utility-based algorithm have been proposed. The common assumption of these works is that the data flows are conserved during the transmission from the sensor nodes to the sink node, which however is not true for sensor networks because data collected by neighboring nodes are often spatially correlated.
3.2 Proposed System
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

The algorithm requires maintaining two treesthe coding tree for raw data aggregation and the Border gateway protocol (BGP) for delivering the compressed data to the sink node. These works demonstrate that data aggregation can greatly improve the performance of various communication protocols. By jointly optimizing routing and data aggregation, the network lifetime can be extended from two dimensions. One is to reduce the traffic across the network by data aggregation, which can reduce the power consumption of the nodes close to the sink node. The other is to balance the traffic to avoid overwhelming the bottleneck nodes. In this paper, we present a model to integrate routing and data aggregation. We adopt the geometric routing whereby the routing is determined solely according to the nodal position. This allows different data correlation models such as that in to be incorporated without intervening the underlying routing scheme.
3.3 System Requirements 3.3.1 Hardware Requirements

Processor Hard Disk RAM : : : Pentium IV 40GB 512MB
3.3.2 Software Requirements

Operating System User Interface Programming Language Web Applications IDE/Workbench : : : : : Windows XP/2003 or Linux AWT and Swings Java Socket programming My Eclipse 6.0
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Enhancing Privacy and Authorization Control Scalability in the Grid through Ontologies Abstract
The use of data Grids for sharing relevant data has proven to be successful in many research disciplines. However, the use of these environments when personal data are involved (such as in health) is reduced due to its lack of trust. There are many approaches that provide encrypted storages and key shares to prevent the access from unauthorized users. However, these approaches are additional layers that should be managed along with the authorization policies. We present in this paper a privacyenhancing technique that uses encryption and relates to the structure of the data and their organizations, providing a natural way to propagate authorization and also a framework that fits with many use cases. The paper describes the architecture and processes, and also shows results obtained in a medical imaging platform. Existing System One of the challenges for biomedical application is to provide efficient high-level interfaces, depending on the applications that enable access to Grids for nonexperts, ensuring transparent access to medical resources through services compatible with medical practice. As part of the interfaces, a flexible architecture for the management of the privacy of data is needed, compatible with medical practice and with preexisting Grid security systems are complex enough to be considered an obstacle in the successful Grid adoption. Proposed System
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

The main objective of this paper is to provide Grid middlewares such as TRENCADIS, with efficient and reliable privacy protection for sensitive data. This paper presents a model for long-term storage and management of encrypted data in distributed environments. Furthermore, the paper outlines how this model is implemented to preserve the privacy of patient information in Grid-based collaborative computational infrastructures for biomedical applications. This paper delineates a dependable security framework in overextended organizations. Throughout the assembly of this framework, organizations will encounter different degrees of data integrity and confidentiality. The specific objectives of the paper are 1) To propose an on-the-fly cryptographic infrastructure to protect privacy from users with administrative privileges. 2) To provide a flexible architecture for organizing key management for long-term storage of encrypted data. 3) To propose a model applicable in different environments, Compatible with current Grid middlewares. 4) To provide an access control mechanism for encryption keys based on ontological groups and roles.
Hardware requirements: Processor : Any Processor above 500 MHz. Ram : 128Mb (Min). Hard Disk : 10 GB (Min). Compact Disk : 650 Mb (Min). Input device : Standard Keyboard and Mouse. Output device : VGA and High Resolution Monitor. Software requirements:
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Operating System Language Data Bases Front End
: Windows Family. : JDK 1.5 : Microsoft SQL Server : Java Swing
Combinatorial Approach for Preventing SQL Injection Attacks

Abstract: A combinatorial approach for protecting Web applications against SQL injection is discussed in this paper, which is a novel idea of incorporating the uniqueness of Signature based method and auditing method. The major issue of web application security is the SQL Injection, which can give the attackers unrestricted access to the database that underlie Web applications.Many software systems have evolved to include a Web-based component that makes them available to the public via the Internet and can expose them to a variety of Web-based attacks. One of these attacks is SQL injection, which can give attackers unrestricted access to the databases that underlie Web applications and has become increasingly frequent and serious. This paper presents a new highly automated approach for protecting Web applications against SQL injection that has both conceptual and practical advantages over most existing techniques. From a conceptual standpoint, the approach is based on the novel idea of positive tainting and on the concept of syntax-aware evaluation. From a practical standpoint, our technique is precise and efficient, has minimal deployment requirements, and incurs a negligible performance overhead in most cases. We have implemented our techniques in the Web Application SQL-injection Preventer (WASP) tool, which we used to perform an empirical evaluation on a wide range of Web applications that we subjected to a large and varied set of attacks and legitimate accesses. WASP was able to stop all of the otherwise successful attacks and did not generate any false positives.
Objective
SQL injection techniques are an increasingly dangerous threat to the security of information stored upon Oracle Databases. These techniques are being discussed with greater regularity on security mailing lists, forums, and at conferences. There have been many good papers written about SQL Injection and a few about the security of Oracle databases and software but not many that focus on SQL injection and Oracle software. This is the first article in a two-part series that will examine SQL injection attacks against Oracle databases. The objective of this series is to introduce Oracle users to some of the dangers of SQL injection and to suggest some simple ways of protecting against these types of attack. SQL injection techniques are an increasingly dangerous threat to the security of information stored upon Oracle Databases. These techniques are being discussed with greater regularity on security mailing lists, forums, and at conferences. There have been many good papers written about SQL Injection and a few about the security of Oracle databases and software but not many that focus on SQL injection and Oracle software. This is the first article in a two-part series that will examine SQL injection attacks against Oracle databases. The objective of this series is to introduce Oracle users to some of the dangers of SQL injection and to suggest some simple ways of protecting against these types of attack.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Processor Ram Hard Disk Input device Output device : Any Processor above 500 MHz. : 128Mb. : 10 GB. : Standard Keyboard and Mouse. : VGA and High Resolution Monitor.
Operating System Pages developed using Techniques Web Browser Data Bases Client Side Scripting
: Windows Family. : Java Server Pages and HTML. : Apache Tomcat Web Server 5.0, JDK 1.5 or higher : Microsoft Internet Explorer. : SQlServer 2000 : Java Script
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Evaluating the Vulnerability of Network Traffic Using Joint Security and Routing Analysis ABSTRACT
Joint analysis of security and routing protocols in wireless networks reveals vulnerabilities of secure network traffic that remain undetected when security and routing protocols are analyzed independently. We formulate a class of continuous metrics to evaluate the vulnerability of network traffic as a function of security and routing protocols used in wireless networks. We discuss the availability of security parameters to the adversary and show that unknown parameters can be estimated using probabilistic analysis. We demonstrate vulnerability evaluation using the proposed metrics and node capture attacks using the GNAVE algorithm.
EXISTING SYSTEM:
ASSURANCE of secure applications and services in wireless networks relies on the properties of confidentiality and integrity, respectively defined as the ability to keep data Secret from unauthorized entities and the ability to verify that data has not been maliciously or accidentally altered. Eschenauer and Gligor recently demonstrated in that these properties can be efficiently compromised by physically capturing network nodes and extracting cryptographic keys from their memories. These node capture attacks are possible in most wireless networks due to the unattended operation of wireless nodes and the prohibitive cost of tamper-resistant hardware in portable devices. Furthermore, as shown in , an intelligent adversary can improve the efficiency of a node capture attack over that of approaches in recent literature focusing on random node capture using publicly available information leaked from the key assignment protocol.
PROPOSED SYSTEM:
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

We develop two complementary vulnerability definitions using set theoretic and circuit theoretic interpretations of the security of network traffic, allowing a network analyst or an adversary to determine weaknesses in the secure network. We formalize node capture attacks using the vulnerability metric as a nonlinear integer programming minimization problem and propose the GNAVE algorithm, a Greedy Node capture Approximation using Vulnerability Evaluation.
Hardware Requirements
SYSTEM HARD DISK RAM : Dual Core : 160 GB : 1 GB
Software Requirements
Operating system :- Windows XP Professional Front End : - Java Technology.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

A PRECISE TERMINATION CONDITION OF THE PROBABIISTIC PACKET MARKING ALGORITHM

Abstract
The probabilistic packet marking (PPM) 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.
Existing System: In the existing system PPM algorithm is not perfect, as its termination condition is not well defined. Without proper termination condition the attack constructed by the PPM algorithm would be wrong. graph
The algorithm requires prior knowledge about the network topology.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Proposed System: To propose termination condition of the PPM algorithm, this is missing or is not explicitly defined in the literature. Through the new termination condition, the user of the new algorithm is free to determine the correctness of the constructed graph. The constructed graph is guaranteed to reach the correctness assigned by the user, independent of the marking probability and the structure of the underlying network graph. In this system we proposed a Probabilistic Packet Marking Algorithm to encode the packet in the routers to detect the attacked packets. To reduce the a constructed graph such that the constructed graph is the same as the attack graph, where an attack graph is the set of paths the attack packets traversed, To construct a graph, is a graph returned by the PPM algorithm.
System Requirements
Hardware: 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 MOUSE : 3 BUTTONS
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Software: Front End : Java, Swing Tools Used : JFrameBuilder Operating System : WindowsXP Intrusion Detection In Homogeneous & Heterogeneous Wireless Sensor Networks
Abstract
Intrusion Detection, which is the art of detecting inappropriate, incorrect, or anomalous activity. This Project reports the design principles and evaluation results of a new experimental hybrid intrusion detection system. By mining anomalous traffic episodes from Internet connections, we build an ADS that detects anomalies beyond the capabilities of signature-based SNORT system. A weighted signature generation scheme is developed to integrate ADS with SNORT by extracting signatures from anomalies detected. HIDS extracts signatures from the output of ADS and adds them into the SNORT signature database for fast and accurate intrusion detection Existing System: Conventional systems that detect known attacks with low false alarms. However, the signature-based IDS cannot detect unknown attacks without any recollected signatures. Furthermore, signature matching performs well only for single-connection attacks. With the sophistication of attackers, more attacks involve multiple connections. This limits the detection range by signature matching. Proposed System :
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

An anomaly-based system uses a different philosophy. A network anomaly is detected if the incoming traffic pattern deviates from the normal profiles significantly. This system combines the positive features of both intrusion detection models to achieve higher detection accuracy, lower false alarms, and, thus, a raised level of cyber trust.
Software Requirements Operating System : Implementation Languages : Database : Windows 2000/XP Jdk 1.5.0 Microsoft Access
2.3.2. Hardware Requirements CPU: Memory: Disk Space: Network Devices:
466MHz Processor and above. 64 MB RAM and above. 1 GB and above. Switches, Router, Hubs, CD-ROM.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Network Border Patrol: Preventing Congestion Collapse And Promoting Fairness In The Internet
ABSTRACT 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. Perhaps the best example of the Internet philosophy is TCP congestion control, which is implemented primarily through algorithms operating at end systems. Unfortunately, TCP congestion control also illustrates some of the shortcomings the end-to-end argument. As a result of its strict adherence to end-to-end congestion control, the current Internet suffers from main maladies: congestion collapse from undelivered packets. The Internets 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 network border patrol (NBP). NBP 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. 2.1 EXISTING SYSTEM: Packets are buffered in the routers present in the network which causes Congestion collapse from undelivered packets arises when bandwidth is continuously consumed by packets that are dropped before reaching their ultimate destinations.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Retransmission of undelivered packets is required to ensure no loss of data. Unfair bandwidth allocation arises in the Internet due to the presence of undelivered packets.
2.2 PROPOSED SYSTEM Buffering of packets in carried out in the edge routers rather than in the core routers. The packets are sent into the network based on the capacity of the network and hence there is no possibility of any undelivered packets present in the network. Absence of undelivered packets avoids overload due to retransmission. Fair allocation of bandwidth is ensured. System requirements: Hardware Requirements: Processor: Intel Pentium III Processor Random Access Memory: 128MB Hard Disk: 40GB Processor Speed: 300 min Software Requirements: Language: Java Networking Front End Tool: Java Swing Operating System: Windows 98
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

An algorithm approach for to identify network link failures ABSTRACT Due to the Internets complexity and various routing policies, it is difficult to locate the exact connectivity changes that occur from time to time which are the causes for large volumes of BGP update messages. An Algorithmic Approach to Identify Network Link Failures is an approach to identify these connectivity changes exactly. Here an algorithm, called FindChange is used that can pin down the origin of routing changes due to any single link failure or link restoration. The algorithm set, FindChange uses a simplified model of BGP and graph model of internet. It has distinctions from BGP model such as assuming one best path between two nodes, single connection between two nodes. FindChange takes the update messages collected from vantage points as input and accurately locates the link changes. The input is taken as graphs and by making the comparisons of edges between two nodes the links which are failed, added or restored and links unchanged are identified. Using this information path between two nodes is computed before and after the connectivity changes.
Existing System
An ad-hoc combination of intuition, experience, and informal analysis is often used to speculate the causes of large swings in BGP updates. In addition to the challenge of scale, the underlying Internet topology is not known precisely and the monitoring points provide views from only a limited set of geographic locations. In such an environment, ad-hoc techniques are limited by the expertise of the administrator and it is not easy to identify the underlying events that cause BGP changes. To provide dependable global data delivery, analysis tools are needed that can help us to understand the BGP system and pinpoint the exact cause of connectivity changes.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

3.2 Proposed System

A formal approach is provided to identify the link failures which are supposed to cause route changes and pinpoint exact connectivity changes. Along with the links failed, the links which are restored or newly added, the links which remains unchanged are identified and the number of links failed, restored, unchanged.
3.3 System Requirements

3.3.1 Software Requirements
OS Project Platform Software User Interface : Windows : Java : JDK1.5 : Frames
3.3.2 Hardware Requirements

Key Board : Standard Key Board with 101 Keys : Pentium IV : SVGA Color Monitor : 20 GB : 256 MB
Processor Monitor Hard disk RAM
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

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. SYSTEM SPECIFICATIONS: The system on which the project developed has the following configuration.
HARDWARE SPECIFICATIONS: Main Memory MicroProcessor Hard Disk Drive Cache Memory SOFTWARE SPECIFICATIONS: Operating System Front End : : Windows 98/NT. Java ,Servlets,Jsp, : : : : 64MB. Pentium III. 4.3 GB. 512KB.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

1. Bug Tracker ABSTRACT The project is a developed based on the standards of the coding used by the developer is tested before giving to the client. System that interacts with the code developed bye the user. Using this project any developer with minimal knowledge can easily check correctness of the code easily without any errors. Business Requirements Analysis Before submitting to the client or hosting any site of the project should maintain a testing tools. Here this developing system is based on this process only. This project will maintain a database for each project, in that it maintains project code, bugs. Bug tracking developers read these bugs and fix the bugs and update the same information in the bug reports.
The following is the system developed for the above stated needs. An initial feasibility study was conducted & a conclusion was arrived at that automating such a system would not only achieve all the things mentioned above.
Hardware Specifications: Intel P-III Processor 64 MB RAM 40 GB Hard Disc Software Specifications
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Operating System Language BackEnd
: : :
Windows XP/2000 jsp,servlets. Oracle
Fashion Studio
ABSTRACT It seems that over the past few decades a new art form has emerged. This is an art form that painters, writers and photographers dive into on a daily basis. A piece of art is considered to be abstract when the image is not clearly defined or visibly noticeable in a quick glance. The word abstract means not relating to concrete objects but expressing something that can only be appreciated intellectually. This is a relatively new art form that takes mundane objects and transfers them to the unknown. Abstract art is one of the fastest growing fields of photography. A photographer is able to take abstract pictures of people, landscapes, places, animals and much more. A photographer is given a broader range to experiment abstractly when using a digital camera but a regular camera can also be used. There are several hints to help you when taking an abstract picture. First of all let us discuss what an abstract picture is. An abstract picture can be the wheel of a tractor, a photograph of a blurred chess piece, a screen window, a solitary fork sitting alone atop a table or the face of a person, unrecognizable and changed. Abstract art allows the photographer to create new images that only they may see or to turn ordinary objects into a spectacular work of art. A graduate student several years ago, who majored in abstract photography, was told to take a picture of her car. The student then took pictures of different parts of her car and then made a collage of the collection of pictures in the shape of her car. This is considered an abstract piece of artwork. When taking an abstract photograph of a person stop and think before you press the shutter button. Look at the subject and pick out the physical features, traits or characteristics that you want the abstract photograph to be composed of. If the subject has been through a tragedy, photograph the eyes, to convey this weight of sadness. If a person is joyous or laughing photograph their mouth in order to bring that joy and free spirit to the photograph. Abstract photography is great for artists who want to broaden and expand their creative range. It is also wonderful for photographers who have a unique eye and find beauty in things that are extraordinary. Next time you have you camera out fool around with a few of these abstract ideas. You might just fall in love with this relatively new art
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

form. There are 3 roles in this system namely, 1. Administrator Module 2. Model Module 3. Student Module 2. INTRODUCTION What is Project allocation with Fashion Technology? Fashion Technology is a one stop shop for all your fashion technology needs. FT partners with small to medium fashion and apparel companies to supply support and maintain all their IT needs. Fashion Technology offers more than just a product, it offers service and experience. Fashion Technology believes that the project isnt completed when the fashion software is implemented. Ongoing training is a critical factor in longterm business success. 3.4 H/W AND S/W REQUIREMENTS: HARDWARE REQUIREMENTS: Server side: Minimum 4GB Hard disk P-IV processor or equivalent RAM 512 MB Jdk 1.6 installed in it Client side: Any terminal with internet connection and a web browser. SOFTWARE REQUIREMENTS: Server side: Jdk 1.6 installed in it. Apache tomcat 4.1.36 t installed in it. Oracle 8i installed in it. Client side: Any Web Browser.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

2. Smart City ABSTRACT India is the one among the fast growing countries. Every one can visit the country throughout India. In the list of visiting places cities are the mostly visited places. Tourists are come from different places and new to the city they dont know about the cities, cultures of the people, local language to communicate and how to approach. Tourist guides are the persons who guide the tourists about the city like the visiting places, their importance and how to approach by taking money from them. Tourist guides may cheat tourists for money by telling lies and chance to rob them. In some cities they are not available.To overcome these problems an efficient and powerful web application called SMART CITY has implemented. This is the online application that provides brief information about the city by using efficient web applications. To get the details about top restaurants, hotels, lodges, events online SMART CITY is an efficient web application. It provides every one detailed description about entertainment, museum exhibits, monuments and memorials, movies, theaters, hotels, events for concerts and guides the visitors with stories, events listings and theater listings. SMART CITY also features arts and entertainment, attractions, recreation, festivals and most famous devotional places. Youll instantly get access to the information about the city and provides you with all the information you need to know about the things in the city. This system provides Lifestyle of the people in the city, Entertainment guide, latest information on accommodation, food, sightseeing, shopping, social, cultural and tourist information and is a comprehensive guide. Users in this module are Admin and the information seeker. Admin can modify the existing modules and add new modules. Whereas the information seeker can view the site only.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

MODULES: The different modules in this system are City culture Tourist places City branches Hospitals Educational institutes Entertainment City map Travels City culture:
Provides information about the culture of the people in the city

Tourist places:
This module contains the information about the popular tourist places City branches: Describes the most famous places in the city Hospitals: Provides information about the famous hospitals in the city Educational institutes:
This module contains detailed information about the various educational institutions
Entertainment:
Contains all the information about the entertainment like movies, cultural programmes etc.
Travels:
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Detailed description about travels
SOFTWARE REQUIREMENTS: Operating system Language Backend : : : Windows XP/2000 Java using Servlets and JSP Oracle
HARDWARE REQUIREMENTS Processor : Pentium II Harddisk : 40GB RAM : 128 MB
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

3. College Message System ABSTRACT College Messaging System represents a Technology based academic Student status delivery system. It incorporates the Educational Institutions and interactive parent communities. On-line Technology is an important development in delivering the educational services. Integrated approach of the system enhances the image and reputation of the Institution. Like in our college, we have a very prevalent system for monitoring the students presence in various classes. It often comes to our notice that many students abscond from classes for various reasons and more often, this goes unnoticed by their parents. Therefore, in our project we would like to develop and deploy a web based Messaging system, which would automatically inform the corresponding parents about the absence of their ward through an email to the parents email id or an SMS to the parents mobile. CMS, which would store all the information about the students ranging from their attendance to their corresponding semester marks and their fee details. The benefits of the proposed system are that there would be ease in the attendance taking process, which would get rid of the paper works and their respective calculations. We get prompt information regarding the attendance of a particular student either it is percentage for all classes or for each faculty. Finally, the auto generation of an email or SMS regarding the absence of the student would keep the parents in notice, about their wards presence in the college. The attendance system is based around tracking student absences, since there should be fewer of them than presences. An attendance record is stored for a student whether they are absent/present from college. No record is stored when they are present. This is the easiest approach in terms of record entry. Attendant is an online database system, which provides a straightforward way for departments to record attendance information about their students By using this system we can accept their attendance through biometrics device.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Modules in College Messing System: 1. Admin module 2. Parent module 3. SMS and E-Mail
HARDWARE REQUIREMENTS: Processor : Pentium IV HDD : 40GB SOFTWARE REQUIREMENTS: Operating System : Windows 2000 or Windows XP Language : JAVA BACK-END DATABASE : ORACLE
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Scheduling and Dispatching Management System

Abstract Development of a dispatching and scheduling software application using advanced 3-tier client/server architecture. The software application will enable shuttle operation management in real time. The system will have the ability to manage vehicle, drivers and passenger information, define and manage vehicle schedules and fixed routes, and so management reporting. In addition to operating a fixed route system, the application also provides scheduled routing for residential and non-fixed hotel routes and variable routing for load balancing. The web module will provide the capability to accept reservation requests from the Internet. Software Specification Java With Swings Databases: Ms-Access H/W Requirements: Processor Ram Hard Disk : Pentium III or above : 256MB or Above : 40GB or Above
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

4. Town online complaint system ABSTRACT The system deals with providing online support to the people who are facing problems with various software technologies. Problems with the current system, there is a communication gap between the customer and the organizations. People generally dont know the name of the sites of all organizations to post their problem. Customer usually face some problem while posting the bugs occurred in different softwares as they have to post their bugs to different sites individually and there is no surety of quick response from the organization. Few organizations may not be interested in responding to the customer problems. So in order to overcome all these limitations and to meet all their requirements, the current process is replaced with this application. 2.2.1 SOFTWARE USED
O/S Microsoft Windows 2000
Interface Tools :FRONT END PROGRAMMING LANGUAGES SCRIPTING TOOLS BACK END SERVER HTML , Style Sheets Java , Servlets , JDBC Java Script Oracle 8i Tomcat 4.0
2.2.2 HARDWARE USED Server side: PROCESSOR SPEED INTEL PENTIUM PROCESSOR 933 MHz
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

256 MB 40 GB 3.5 Inch floppy drive that possess enough backup capacity to maintain in case of system crash 512 KB. 32 bit.
RAM HARDDISK FDD
CACHE MEMORY MEMORY
Input Devices:
KEYBOARD MOUSE 101 Keys Samsung
TVS Zenith
Output Devices:
PRINTER MONITOR
Client side :PROCESSOR INTEL PENTIUM PROCESSOR
SPEED RAM HARDDISK FDD CACHE MEMORY MEMORY
933 MHz 128 MB or above 10.3 GB or above 1.44 MB Floppy Disk Drive 512 KB. 32 bit.
Input Devices:
KEYBOARD MOUSE 121 Keys Intel Intel
Output Devices:
MONITOR
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

5. Web Crawler ABSTRACT A web crawlers is a program, which automatically traverses the web by downloading documents and following links from page to page. They are mainly used by web crawlers engines to gather data for indexing. Other possible applications include page validation, structural analysis and visualization, update notification, mirroring and personal web assistants/agents etc. Web crawlers are also known as spiders, robots, worms etc. Web crawlerss start by parsing a specified web page, noting any hypertext links on that page that point to other web pages. They then parse those pages for new links, and so on, recursively. Web-Search software doesn't actually move around to different computers on the Internet, as viruses or intelligent agents do. A Search resides on a single machine. The Search simply sends HTTP requests for documents to other machines on the Internet, just as a web browser does when the user clicks on links. All the Search really does is to automate the process of following links. Web crawlersing speed is governed not only by the speed of ones own Internet connection, but also by the speed of the sites that are to be Searched. Especially if one is a Searching site from multiple servers, the total Searching time can be significantly reduced, if many downloads are done in parallel. This work implements the Breadth First Searching algorithm, a refined version of one of the first dynamic Web crawlers algorithm, In order to build a major search engine or a large repository such as the Internet Archive, high-performance Search start out at a small set of pages and then explore other pages by following links in a breadth first-like fashion.
SOFTWARE SPECIFICATIONS:
Operating System Language

H/W REQUIREMENTS:
: : : : :
Windows NT/ Windows 98 JAVA Pentium III or Above 256MB or Above 4GB or Above
Processor Ram Hard Disk
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

125.
Software Resource Planning Tool
ABSTRACT A method for the project engineering of an automation system is provided. An existing project is opened or a new project is created in a project engineering software tool. A project manager, who serves as supervise the work of a project team. The manager oversees not only the people and technology involved, client information, time and money constraints and quality of the work. In this automation system project manager is a administrator who assign the project to team and monitor the progress of work. Modules in PAS Administrator Module Manager Module Team Member Module Software Spefication JSP,Servlets Oracle 10g
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

125.Spam Mailing Detection System

Abstract Spam Mailing System
Spam is a growing problem for email users, and many solutions have been proposed, from a postage fee for email to Turing tests to simply not accepting email from people you don't know. Spam filtering is one way to reduce the impact of the problem on the individual user (though it does nothing to reduce the effect of the network traffic generated by spam). In its simplest form, a spam filter is a mechanism for classifying a message as either spam or not spam. There are many techniques for classifying a message. It can be examined for "spammarkers" such as common spam subjects, known spammer addresses, known mail forwarding machines, or simply common spam phrases. The header and/or the body can be examined for these markers. Another method is to classify all messages not from known addresses as spam. Another is to compare with messages that others have received, and find common spam messages. And another technique, probably the most popular at the moment, is to apply machine learning techniques in an email classifier. The Spam filter implemented is used to block spam also called unsolicited email. It uses statistical approach called Bayesian filtering to block the spam. First of all the program has to be trained using a set of spam and non-spam mails. These are put in a database. The performance increases with the number of training it gets. When a new mail comes it is tokenized and probability of each word is found by looking into the database. The total probability is found out and if it is greater than 0.9 it is marked as spam. With good training it can block 99% of the spam mails with 0 false positives. Bayesian Filtering In a nutshell, the approach is to tokenize a large corpus of spam and a large corpus of non-spam. Certain tokens will be common in spam messages and uncommon in non-spam messages, and certain other tokens will be common in non-spam messages and uncommon in spam messages. When a message is to be classified, we tokenize it and see whether the tokens are more like those of a spam message or those of a non-spam message. How we determine this similarity is what the math is all about. It isn't complicated, but it has a number of variations.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Theory of Operation Probabilities in this algorithm is calculated using a degenerate case of Bayes' Rule. There are two simplifying assumptions: that the probabilities of features (i.e. words) are independent, and that we know nothing about the prior probability of an email being spam. The first assumption is widespread in text classification. Algorithms that use it are called "naive Bayesian.' If spammers get good enough at obscuring tokens for this to be a problem, we can respond by simply removing white space, periods, commas, etc. and using a dictionary to pick the words out of the resulting sequence. And of course finding words this way that weren't visible in the original text would in itself be evidence of spam.
SOFTWARE REQUIREMENTS: Operating system : Windows XP/2000 Language : Java using JSP Web Server : Apache Tomcat 6.0 Backend : Oracle 9i o 10g Web Browser : ie,firefox,chrome Scripting Language : Java Script Web Designing : HTML,CSS HARDWARE REQUIREMENTS Processor : Pentium II Harddisk : 40GB RAM : 128 MB
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

PROJECTS @ ORANGE
JAVA, J2EE & J2ME

. Student Project Allocation And Management With Online Testing
ABSTRACT
This project is aimed at developing a web-based system, which manages the activity of Student Project Management and Online Testing. This is a system used by Educational Institutions or other organizations, which are willing to give student projects. This system will manage the database and maintain a list of all student groups that have registered on this site, conduct their online test and shortlist those students who have passed the eligibility criteria as set by the professors.
EXISTING SYSTEM AND ITS DRAWBACKS:

Today, student testing system is being done from classroom level. It includes lot of manual work. Depending on the result, he allocates the project to the student. This involves lot of manpower and consumes time, like evaluation of the paper, setting the paper, maintaining the records of the student, and security. This may some times prove to be costly.
PROPOSED SYSTEM AND ITS MERITS:

We find the need for the student management system to be computerized which results in the reduction in the manual work and reduces time. Since the whole system is computerized, the evaluation of the paper is done automatically. Then depending upon this result, the projects are allocated to the students. A new module by name Admin has been proposed in our project, which controls the system.
SOFTWARE REQUIREMENTS: Operating system Language Web Server Backend Web Browser Scripting Language Web Designing : : : : : : : Windows XP/2000 Java using Servlets and JSP Apache Tomcat 6.0 Oracle 9i ie,firefox,chrome Java Script HTML,CSS
HARDWARE REQUIREMENTS Processor Harddisk RAM : : : Pentium II 40GB 128 MB
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Abstract AdXpress is the largest single source of online intelligence for marketing, advertising, media and research communities worldwide. AdXpress offers a FREE World Advertising and Marketing News email service, ensuring the top global stories are delivered daily to your inbox. Our free classifieds will expose your ads to local, regional and national buyers in different countries across the globe. AdXpress is a full featured classified ad manager website. AdXpress is designed to seamlessly integrate ads in this website. Our AdXpress ad web site is organized using an easy-to-follow index so that you can locate the classified ads you're interested in quickly and easily. We hope you'll enjoy your visit and you will opt this site for placing the ads forever and you will definitely add our site as a bookmark in your web browser. Please come back and visit us again soon. Welcome to AdXpress. We are pleased to be able to offer you free classified advertising over the Internet. AdXpress splits your screen up into various sections. At the home page there are list of menu options. These allow you to go straight to a category you want by navigating through the sub options.
AdXpress
Existing System:
Here the existing system is nothing but manual traditional new paper systems in which we can post the ads then the customer of new paper can only see these details. In this system the company will store the business information in a record which is not safe. We need assign the tasks and get status of the tasks from an employee manually. Disadvanatges: Ad info can accessible for the customers of our new paper Allows to post limited no of ads Difficulty in managing different ads in different categories Difficulty in updated the new links for each and every time Difficulty in updated the yellow pages information Difficulty in managing daily business activities of the company Difficulty in tracking the tasks. Proposed system: Here the proposed system is to replace an existing system with a software solution using which we can post the ads in a classifieds portal sothat the customer this info from online by sitting at the home. Apart from it we can also post links and yellow pages information. We can track the tasks related to our ad business very easily from online. Advantages: Orange Software Technologies, 1 st Floor, Harikrishna Building,Opp:Konark Theater,Dilsukhnagar,Hyd-60, Ph: +91 86 86 051194 ,86 86 061194. Email: services@orangehyd.com Website : www.orangehyd.com
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

1.Posting the ads in a portal which the customers can access from online 2.Posting new links and yellows info which the customer can utilize from Online 3.Allows to company to efficient manage their tasks 4.Allows the company to manage their agents and observe the business 5.through an agent. 6. Allows to categorize the ads which customers to find out the Information 7. Very easily
HARDWARE AND SOFTWARE REQUIREMENTS

Processor Hard Disk RAM SOFTWARE : : : Intel 2.0 GHz or above 80 GB 512 MB RAM. : JDK1.5.0, Apache Tomcat 5.0.25, MYSQL 5.0 WINDOWS XP with SP2
OPERATING SYSTEM :
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Broadwalk
ABSTRACT
The project entitled BROADWALK REALERS NETWORK is developed for organization of NAVEEN TILES Pvt. Ltd located in Rajastan.The developed system helps the organization to receive orders through online for product tiles that can be supplied by the organization. This Activity includes three modules customers,dealers and administrator.Customer module facilitates the customers to place order through online,and can view catalog information provide by organization.In this module each customer order will be verified to determine whether author dealer existing in the area specified by customer.If dealer existing then the customer order will be redirected to corresponding dealer otherwise those orders will be registered as direct customers orders to Administrator. Dealer module facilitates authorized dealers to customer orders status in their area,to place order ,to manage their details in Administrator records. Administrator module facilitates the Administrator to view direct customers order status,dealers order status and also to maintain transport charges info and products catalog information.Administrator can also appoint new Dealer and remove existing Dealer. The project developed on platform windows98 using software HTML,JSP,JDBC, JavaScript, JavaMail and jdk1.4 with backend database Oracle 8.0. SOFTWARE REQUIREMENTS: Operating System Client Side ServerSide : : : Windows xp HTML,JavaScript. JDK 1.5,JSP2.1,JAVA MAIL 1.1.3 Oracle 10g Apache Tomcat 5.0 Pentium 2 366mhz SVGA Color monitor 10GB 32MB Digital 105 keys digital
Back-end : Server : HARDWARE REQUIREMENTS: PROCESSOR Monitor HardDisk RAM Mouse Keyboard : : : : : :
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Contelligent Abstract
Contelligent is a component-based Web Content Management solution. This system is based on the convenience of the students to communicate with the resources provided by the COMPUTER AIDED LEARNING TOOL section of the university.
This project is aimed to provide services to students over Internet, each student is given with a unique id and as the student logs on into the system he will be given access to anonymous number of sections.
The different sections that are involved in this system are: 1. Lecture notes 2. Assignment 3. Exam Time table 4. Library The services provided by these sections are: Lecture notes section deals with the notes of all the professors in the college depending on the subject they deal with. These notes are divided based on the subject, particular professor and on particular year and course. Assignments section is further divided into two sections namely assignment and repeat assignment. The difference is that assignment deals with the assignments for fresh students who are doing them for the first time and repeat assignment are for the students who are doing the assignment as a repeat. E x a m Ti m e Ta b l e s e c t i o n g i v e s t h e i n f o r m a t i o n o f t h e examination timetable of a course. This section is updated a c c o r d i n g l y. Library is a special section. This section deals with all the books in the library and their management. This section further divided based on the different categories like
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

computers, business, finance, and accounts. The status of the book i.e. if that particular book is available or not is displayed. The system uses 2 different types of users 1. administrator 2. Normal user (student) 3. Faculty 4. Corporate User
Required Hardware: Pentium IV Processor. 256 MB RAM. 80 GB Hard Disk space. Ethernet card with an Internet and Internet zone.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Ezeemerchant
ABSTRACT
The popularity of interactive media such as the World Wide Web (WWW) has been growing at a very rapid pace (see, e.g., GVU 1999). From a marketing perspective, this has manifested itself primarily in two ways: 1. A drastic increase in the number of companies that seek to use the WWW to communicate with (potential) customers, and 2. The rapid adoption of the WWW by broad consumer segments for a variety of purposes, including pre purchase information search and online shopping. The combination of these two developments provides a basis for substantial growth in the commercial use of interactive media for shopping called Online Shopping. We conceptualize this behavior as a shopping activity performed by a consumer via a computer-based interface, where the consumers computer is connected to, and can interact with, a retailers digital storefront (implemented on some computer) through a network (e.g., the WWW). A consumer can engage in online shopping in any location, and they can compare the prices and they can buy the product without face-to-face assistance to the shopper. This reduces the time and it is the solution for the to overcome the traffic and pollution problems in metropolitan cities. While making purchase decisions, consumers are often unable to evaluate all available alternatives in great depth and, thus, tend to use two-stage processes to reach their decisions. At the first stage, consumers typically screen a largeset of available products and identify a subset of the most promising alternatives. Subsequently, they evaluate the latter in more depth, perform relative comparisons across products on important attributes, and make a purchase decision. So this application provides a facilty to do this to greater extent.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

The shopper can take the decision to improve the business depending on the current customer rate and their bills. To satisfy the customer needs the online shopping cart system comes to the door step of very customer through online and provides all the facilities what the customer faces when he shops manually. The shopper can store the Day to day transactions in the database and so that he can go back to any earlier transaction and he can check it. The customer can see the status of goods delivery also by sitting at home. The shopper can also see the delivery status and can deliver goods to undelivered customers. Shopper can generate the userfriendly reports to analyze the business statistics. Shopper can maintain the list of categories, list of products in a category, list of orders, order tracking and payments through user-friendly screens. The customer has the tendency to pickup as many items irrespective of their needs. To avoid this the EzeeMerchant system provides a facility called cart so that the customer can check the items he has selected and what is the amount at a particular point time and he can take the decision to continue shopping, stop shopping or remove unnecessary goods. High security will provided for each and every customer by providing customerID and password which is generated through customer registration facility. Ultimately the EzeeMerchant System caters all the user needs through online. 4.2 Proposed System: This system allows the customers to register on their own after reading the license agreement. After registration each user will receive username and password using which the customer can shop different products and place it in a cart. The customer can check the items in the cart at any point of time and he can confirm the order and pay the bill using credit card. The shopper can manage different categories, products and the cart. He can also see the customer orders and confirm the order to deliver the good. The customer and the shopper can track the orders at any point of time. The main features of this system: 1. The user can shop the different branded items under one roof. 2. The shopper can change the any page dynamically with out touching the source code. 3. The shopper can change different processing charge values dynamically.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

4. The shopper can check the credited amounts and select different options to confirm the orders or else send the mails to customers using manageable email templates.
4.4 Software Requirements Specification 4.4.1. Introduction Purpose: The purpose of this project is to handle Human Resources of an organization. Document Conventions All the main heading are in BOLD and underlined. Error message will be denoted using a (!) prefix. The steps in the document follow Software Development Lifecycle methodology. 4.4.1.3. Product Scope The scope of the project is limited to a single organization. 4.4.1.4. Reference Java Server Programming J2EE edition wrox. J2EE Complete reference -McGraw Hill. MySql 5.0 Java Servlet Programming Oreilly.
4.4.2. Operating Environment

Operating System Windows 2000server and professional Hardware platform Pentium 4 processor 256 MB RAM Software specifications J2SDK 1.4 J2SDK 1.4 J2EE MySql 5.0 Microsoft Front Page Express Internet Explorer Tomcat 4.0
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

James Server
Required Software
Windows 2000/ XP operating system. Internet explorer 5.0 and Netscape navigator. MySQL Server. Java/J2EE. Web Server as Tomcat.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Loan Amortizer
ABSTRACT The life of a person is so hectic that he has to look after his family affairs as well as grow along with the rest of the society. In this struggle, sometimes he has to go for a loan to make small purchases for his family and repay the loan as per the schedule. In this case, small companies lending the loan on easy installments would be his choice. Loan Amortizer is a software that enables a lending company like Citi Financials, Fullerton etc to promote a transparent and secured environment in lending the loans as well as their recovery process. The administrator of this software can just view the information besides adding new users and employees and changing their passwords. Thus he cannot interfere with the loan process or payments. This part is dealt by manager who has authority to issue the loan to an individual. He can provide information on which type of loan being issued and to whom. Accountant and agents of the finance company can view all the details of the customer. When a customer makes a payment, they can store the payment details into the database. Thus, Loan Amortizer is an online software application which fulfills all the requirements of a typical finance company. It provides the interface to users in a graphical way to manage the daily transactions as well as historical data. The users can provide a clear picture to the customers regarding how much is already paid and how much is still pending. By extending this software, it is possible to make the customer to directly view his transactions right from beginning. This will eliminate any mischief played by any third party person. Also provides the management reports like Released Loans, Payments, Rejected Applications, Submitted Papers and Finance Report. This application maintains the centralized database so that any changes done at a location reflects immediately. This is an online tool so more than one user can login into system and use the tool simultaneously. The aim of this application is to reduce the manual effort needed to manage transactions and historical data used in a finance company. Also this application provides an interface to users to view the details like the Released Loans and Finance Report etc. Technologies used: J2SE, Servlets, JSP, JDBC and Java Script.
4.4.2. Operating Environment

Operating System Windows 2000server and professional Hardware platform Pentium 4 processor
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

256 MB RAM
Transport Plus
ABSTRACT It is every companys need to see the welfare of its employees by providing transportation for the employees to attend their duties successfully. This is the reason many MNC companies maintain their own fleet and sometimes takes the help of third party transport systems also. When several employees wish to utilize the bus services provided by the company, naturally the company employees need a system to allot the buses and oversee the transportation. Transport Plus is a software that quenches this need. Transport Plus has four types of users. The administrator of this software will be able to create new users and change the passwords. He can add or update the employee information in the company. He can add and view the information of Transport categories and also available routes. Depending on the users demands, new route and also new pick up points can be added to the database. Beyond this, the administrator can also act as a normal user and book a bus or cab for himself. He has authority to place a cab request or cancel a request for a bus. This system calculates fare depending on three categories: short distance, medium and long distance and the fare would be deducted from the employees salaries. When an employee of the company wants to avail the transportation facility, he will forward a request which will be approved by the administrator depending on the availability of room in the bus. When an employee wants a cab, it will be arranged by the approver and later depending on the recommendation of the project manager the charge may or may not be deducted from the employee salary. Approver is another user of this system. He can view the details of transport categories, routes and pick up points. He can approve a request for a cab from an employee and store the information of assigned cab. The transport people can view all the information related to who are the employees utilizing the transportation. They can take a decision to approve or disapprove the requests placed for transportation. They can arrange a cab physically for the employee and send the cab details to the employee who placed the request. Users and guest users are employees who want to use the transport facility. The users can place their request for a bus to reach the company or for a cab when they want to go to a different place. These requests are approved or declined by the transport people or project manager.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

This application has rich user interface so that novice users can access easily. This application provides the management reports like Occupancy report, Approval status report, to track the usage of companys transport facility as well as cab facility. CURRENT SYSTEM: Current system is a manual one in which employees has to submit their applications for transport facility as well as for cab facility. Employees has to follow up regularly with transport personnel to know the status of their requests which is time consuming and hectic. Disadvantages: The following are the disadvantages of current system 1. It is difficult to track the occupancy. 2. More manual hours need to generate required reports 3. It is tedious to track the details of cabs provided by third party. 4. There is no possibility to track the approvals of requests. 5. No co-ordination between various departments. PROPOSED SYSTEM: Proposed system is a software application which avoids more manual hours that need to spend in record keeping and generating reports. This application keeps the data in a centralized way which is available to all the users simultaneously. It is very easy to manage historical data in database. No specific training is required for the employees to use this application. They can easily use the tool that decreases manual hours spending for normal things and hence increases the performance. Advantages: The following are the advantages of proposed system
1. Easy to process requests 2. Can generate required reports easily 3. Easy to manage historical data in a secure manner 4. Centralized database helps in avoiding conflicts 5. Easy to use GUI that does not requires specific training. 6. Implementation of approval process is very easy 7. Occupancy tracking helps in decision making Technologies used: J2SE, Servlets, JSP, JDBC and Java Script.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

COMPUTER AIDED LEARNING TOOL ABSTRACT Education has become a part of every human. There are several types of education systems presently running. COMPUTER AIDED LEARNING TOOL is one of the education systems that are under process long before but only committed to the University. COMPUTER AIDED LEARNING TOOL is an out classes study that allow you to educate when you have a desire and time. A chance to study in any place you like, during your summer vocations or while some other activities. The only thing is that you should be provided with all the necessary materials. This system maintains all the course details so that the users of this system after registration views the list of the course details and also the scheduled course details. After finishing the course the user will test his performance by attending an online examination followed by a question and answer and finally when he finishes the exam there instantly system display his marks which he scored. COMPUTER AIDED LEARNING TOOL is developed in a web based technology with backend as Oracle Server. This system helps the user to not waste his time in distance training education when compared to remote education and finally he could instantly view the marks which he scored in the online exam. S/W Requirements: Technologies : Java, J2EE (JDBC, Servlets, JSP) Database : Oracle 9i H/W Requirements: P IV 900 MHz+ 128 MB RAM 40 GB HDD
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

E-School
ABSTRACT The project entitled as E-SCHOOL helps the school/college management to communicate the details of the attendance, marks, cultural activities and other information to the students/faculty/parents through Mail/SMS. This system makes use of threads to calculate the attendance. Then by generating reports on each day it will identify the students who have less percentage of attendance than the required aggregate percentage. It sends the messages to the mobiles of the parents about the attendance and marks details. Apart from this whenever the parents want to know about their childrens attendance and marks they can directly login into the site or they can send message to the administrator by giving that particular students registration number and they can get return message. Current Scenario In the existing system, the details of the students regarding their attendance and marks are being maintained in the database and a print of it is made and sent to parents by post monthly once. The problems here are: More manual work Chance of missing the letters through post Consumes more time
Proposed System This system helps the college to communicate the details of the attendance and marks to the parents through Mail/SMS. By generating reports daily, weekly, monthly it will identify the students who have less percentage of attendance than the stipulated attendance percentage and send SMS and Mails to the parents. Salient Features: Fast and accurate report generation Send attendance reports to parents mail Easy, interactive GUI Two way Communication through mails
Software Requirements Operating System User Interface : : Windows XP/2003 HTML, CSS, jsp
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

JavaScript Java JDBC, Servlets, JSP, JavaMailAPI Net beans Oracle 10g Tomcat5.5.9
Client-side Scripting Programming Language Web Applications IDE/Workbench Database Server Deployment
: : : : : :
Hardware Requirements Processor Hard Disk RAM : : : Pentium IV 40GB 256MB
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Organizational Internal Survey Abstract

Organizational Internal Survey supports multiple chatrooms. You can open new chatroom by following open a chatroom link. You can manage a chatroom by selecting the chatroom in the list box named Manage Chatroom . You can backup all the chatrooms by following Backuphatrooms link. You can add/remove/update moderators. A moderator is defined by an username(login), a password and an email. Email field is not mandatory. Links between moderators and chatrooms could be configuered in chatroom forums . In addition to chatrooms could be configuered in chatroom forums. In addition to chatrooms moderation (kick off, ban,transcript,.) a moderator can open many new chatrooms. However moderators cannot backup chatrooms, modify Organizational Internal Survey system properties , and add /remove/ update other moderators. Totally you have the control over chat rooms,users , systems properties to change.. DisplayMode: There are four ways to display chatrooms content (i.e chatrooms clients). It could be in an html/javascript page,an applet , a java application or in a MacroMedia flash5 client.So for html/javascript clients,you have to choose between Framed(jsp) or Buffered Framed(jsp) modes.Buffered-Framed one is optimixed to lower flickering effect.
System Analysis
Existing Systems:
There is no existing system. Here we have developed this application just to provide chat rooms to chat different kind of moderators. This is a system provides all the basic features pf a ChattingSystems.
ProposedSystems:
The first step of analysis process involves the identification of need. The success of a system depends laragely on how accurately a problem is defined thoroughly investigated and properly carried out through the choice of solution .
Software Requirements :
Operating System Linux Programming Language Web Applications JSP,XML Back End Font End : : : : :
Windows Java JDBC,
XP/2003
or
Servlets,
Flat File System(XML) JSP,Servlets,Html
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Pentium IV 40GB 512MB or more
Processor Hard Disk RAM
: : :
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Web shopping
ABSTRACT
Web shopping
Web shop is the process consumers go through to purchase products or services over the Internet. An online shop, eshop, e-store, internet shop, webshop, webstore, online store, or virtual store evokes the physical analogy of buying products or services at a bricksand-mortal retailer or in a shopping mall. The metaphor of an online catalog is also used, by analogy with mail order catalogs. All types of stores have retail web sites, including those that do and do not also have physical storefronts and paper catalogs. Webshop is a type of electronic commerce used for business-to-business (B2B) and business-to-consumer (B2C) transactions.
Contents
Benefits of Webshopping
1. Bargaining power of consumers. They enjoy a wider choice 2. Supplier power. It is more difficult for consumers to manage a non-digital channel. 3. Internet increases commoditization 4. Threat of new entrants. Online means it is easier to introduce new services with lower over-heads 5. Threat of substitutes 6. Rivalry among competitors. It is easier to introduce products and services to different markets
Overview of the System

Finding products
There are a few ways for you to locate the product that you are looking for:
View
You will find a View List option on the client services page web shopping web site, where you can view the name (or part of the name) or the product code of any product. This will view the products that matched your search criteria.
Category Navigation
On the left and top of on web shopping you will find 'client'. By clicking on you can log into respective product surfing where all products will be listed related to the category you chose. On the page you will find view items and purchases.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Brand Navigation
Requesting Products
If you cannot find a product that you are looking for, you are welcome to send your feedbacks and we will either send you a link to the specific product or we will try to source the product that you are looking for and add it to the web site.
How to buy a product

On purchase Items page you will find a Purchase button. When you click on this button your product will be added to your shopping list, and you will be redirected to your purchases list, where you can amend your product selection, by removing it from your list or by changing the quantity that you wish to buy. You will also be able to see what is currently in your list by looking at the purchases list. After the product has been added to your list and you are happy with your selection, you can click on the Bill button. This action will redirect you the Secure Online Web Shopping web site. Web Shopping will allow you to complete your sale.
New Users:
If you have shopped at any Web Shopping enabled store in the past, you will already have a web shopping account, and you would be able to login using your Web Shopping Account. If you are unsure if you have a web shopping account, you can register your by click on the sign in new user link, this will tell you if you are registered.
Non Registered Users:

If you have not yet registered at any web shopping enabled store, you can complete the form provided. This will allow web shopping to know who you are and where to ship your products. When your order is ready to be shipped you will receive another bill to notify you that your order is completed. At this stage the funds will no longer be reserved on your account, and will be moved from your account to our account. If you need to cancel your order, you can do so by visiting to Web shopping outlets, selecting the relevant order, and clicking on the Remove Item link at the bottom of your purchase list page. Just note that you can only cancel an order if the order has not been shipped yet.
Direct Deposit Payments

You need to allow up to 7 days from the date your order was placed for your order to be shipped. We have 3 Shipping options available, and you will be asked to choose one when you are on the Web shopping payment web site. The 3 shipping options are:
Remote Locations
Remote locations are any area that does not fall in the Web shopping outlet city limits.
Web shoppings Best Buy of the day

PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Web Shop will be putting a new product on special every day, at prices that have
never before been seen in India. The special will however be valid for just one day, and be replaced by another product the next day. You can also subscribe to our Suggestion box to stay up to date of the specials that we are running.
Suggestions
By visiting our Suggestions section, you can subscribe to any of our exciting search for items, and they will keep you up to date of the latest happenings on Web shopping.
Software and Hardware Requirements

Software requirements
Operating system: windows 98, MS-DOS Backend : ORACLE 8.0 Language : Java2.0(JDBC) Java script, JSP Driver : Micro Soft ODBC for oracle. Browser : Internet Explorer4.0 Hardware Requirements CPU : Pentium 2.0 RAM : 32 MB Hard disk : 1.74MB Monitor : SVGA color monitor Keyboard : 105 standard and mouse. Server : Any Java enabled web server.
E-Talk
Abstract:
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

E-Talk supports multiple chatrooms. You can open new chatroom by following open a chatroom link. You can manage a chatroom by selecting the chatroom in the list box named Manage Chatroom . You can backup all the chatrooms by following Backuphatrooms link. You can add/remove/update moderators. A moderator is defined by an username(login), a password and an email. Email field is not mandatory. Links between moderators and chatrooms could be configuered in chatroom forums . In addition to chatrooms could be configuered in chatroom forums. In addition to chatrooms moderation (kick off, ban,transcript,.) a moderator can open many new chatrooms. However moderators cannot backup chatrooms, modify E-Talk system properties , and add /remove/ update other moderators. Totally you have the control over chat rooms,users , systems properties to change.. DisplayMode: There are four ways to display chatrooms content (i.e chatrooms clients). It could be in an html/javascript page,an applet , a java application or in a MacroMedia flash5 client.So for html/javascript clients,you have to choose between Framed(jsp) or Buffered Framed(jsp) modes.Buffered-Framed one is optimixed to lower flickering effect.
Existing Systems:
There is no existing system. Here we have developed this application just to provide chat rooms to chat different kind of moderators. This is a system provides all the basic features pf a ChattingSystems.
ProposedSystems:
The first step of analysis process involves the identification of need. The success of a system depends laragely on how accurately a problem is defined thoroughly investigated and properly carried out through the choice of solution .
Software Requirements :
Operating System Linux Programming Language Web Applications JSP,XML Back End Font End : : : : : Windows Java JDBC, XP/2003 or
Servlets,
Flat File System(XML) JSP,Servlets,Html
Processor : Pentium IV
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

40GB 512MB or more
Hard Disk RAM
: :
62.
Telecom Inventory Maintenance System Abstract
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

The project entitled Telecom Inventory Maintenance System deals with fully automated system used by the Telecom department. Telecom industry is one of the major sectors, which provides so many services to their customers such as request for a new connection, change of number, billing etc. Maintaining all these services manually is complicated process. The main objective of this project is to automate the services provided by telecom system, by which customer can use all the services online. This project has been divided into four modules. 1. Applications 2. Entries 3. Enquiries 4. Complaints The Applications module provides following services. A customer can apply for a new telephone connection by filling the form. He can request for transferring phone connection to another location. He can modify the mode of bill payment details. He can also cancel his phone connection. The Entries module provides following services. If the customer requested for change of telephone number, here if we enter the old number, it will display the new number. The Enquiries module provides following services. The customer can make a request about his bill. He can also know the information about changed numbers. He can also ask about the status of his applications. The Complaints module provides following services. The customers can complaint regarding the service and all other issues Existing System: The existing system is a manual one where the entrant has to go to the Telecom Connection System and get details of the company for getting the new connection. Here it is getting a tedious one for the user to go and manually register with it. And in the process only a few users are take the connection. To overcome this they have proposed for the online Connection. Problem Statement: The previous system was a manual system. So, the system is not available to all globally. To make the system available globally, it is now proposed to be web enabled. In the existing manual process entrants cannot get the information of all the telecom system where by registering with Telecom Connection System they can get the updated share values and also since the registration process is atomized, participation in Connection is easy to the entrants.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Proposed System: The proposed system is the online registration of the entrants with the company. By atomizing this Connection process, the entrants enjoy the facility to participate from anywhere. Entrants can also get the information online about all the telecom system. By this process the user can get all the information of the Connection process from where ever he wants as there is no need for him to come to the office and register for Connection. Thus the proposed system is efficient all the way. 1 HARDWARE AND SOFTWARE SPECIFICATION: Hardware Environment: The selection of hardware is very important in the existence and proper working of any software. In the selection of hardware, the size and the capacity requirements are also important. The Web Based Manufacturing System can be efficiently run on Pentium system with at least 128 MB RAM and Hard disk drive having 20 GB. Floppy disk drive of 1.44 MB and 14 inch Samsung color monitor suits the information system operation.(A Printer is required for hard copy output). Processor : Intel P-III based system Processor Speed : 250 MHz to 833MHz RAM : 256MB Hard Disk : 40GB Software Environment: One of the most difficult tasks is that, the selection of the software, once system requirement is known is determining whether a particular software package fits the requirements. After initial selection further security is needed to determine the desirability of particular software compared with other candidates. This section first summarizes the application requirement question and then suggests more detailed comparisons. Operating System Browser Web/Application Server Database Database Connectivity Java Technologies Scripting Technology -------Windows 95/98/NT/2000 IE Tomcat Server Oracle JDBC Java (Servlets, Jsp) JavaScrip
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

126.
Project Automation System
ABSTRACT A method for the project engineering of an automation system is provided. An existing project is opened or a new project is created in a project engineering software tool. A project manager, who serves as supervise the work of a project team. The manager oversees not only the people and technology involved, client information, time and money constraints and quality of the work. In this automation system project manager is a administrator who assign the project to team and monitor the progress of work. Modules in PAS Administrator Module Manager Module Team Member Module Software Spefication JSP,Servlets Oracle 10g
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Work Flow Management System Abstract

Work Flow Management System is customer care management system. Work Flow Management System is called as Edesk or Help Desk System. It is so called as Help Desk System because it tries to solve all the HD (helpdesk) problems, which are coming from the users of Ecare. Work Flow Management System will take care of every request coming from their users and try to solve and produce the solution of the particular request. Work Flow Management System also will store the responses for the future use. Work Flow Management System contains six main members who play very important role in this Help Desk System. They include super user, level1 administrator, level2 administrator, level3 administrator, corporate client user and corporate user (or end-user). Super user is the chief head of the organization that assigns first level, second level, and third level administrators. The super user is responsible for all the three level administrators including the corporate clients. The Super user is the sole person who is responsible for creating categories, modules and the support team. Super user creates new categories only if HD problems dont belong to those categories present in Work Flow Management System and similarly with the creation of modules. When the super user creates new categories and modules he will label these categories and modules as levels and appoint one administrator for each of them. When the super user gets the HD problem as request he can modify the request or can answer it by sending solution to the level3 or the support team who is responsible for messaging the response or the solution to the end-user (corporateuser). Corporate client is the one who buys Work Flow Management System product for his business purpose. He can create corporate users for his product. Corporate user is the one who has to register himself to the corporate client before he submits the HD problems to the super user and corporate user is the actual enduser of the product or service. Corporate user will register to the corporate client and corporate client sends all the registration details to the super user, and after the registration the end-user will submit the HD problems to the super user. When the super user gets the HD problems he will check the details of the end-user and send the responses to the support team who will message the responses to the corporate users.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Work Flow Management System is very useful for the corporate clients who want their business to extend world wide i.e., by keeping contact and good relation with the corporate users who buy their products. The corporate clients who buy Work Flow Management System for their business can know what are the various problems of their product which are coming from their users so that they improve their products to the user needs. Any user who knows a little about of the computer can handle Work Flow Management System Software Requirements:
Jsp,servlets Oracle10g.
HARDWARE REQUIREMENTS
Processor Harddisk RAM : : : Pentium II 40GB 128 MB
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

E-Bank
ABSTRACT
The main objective of this proposed system is to online all the activities of a bank. The system is like to enable the bank employees to open accounts for their customers with ease and to add the details, to transfer amount from one account to another account and doing all the activities related to loan, making all type of transactions. Using the system employees can also generate different types of modules. Add Acct Type Information Add Loan Detail Information Create New Accounts Transaction (Deposits, Withdraws and Loan Payments) Issue Loans Generate Reports .
Using the system client can also generate different type of modules. Check Account Types Information Check Loans Information Check Balance Amount
2.3 PROBLEM SPECIFICATION 2.3.1 Existing System: The existing system is a manual process. Numerous accounts are to be maintained: 1) Maintain Records for each Account. 2) Note Deposits and with draw transaction for each account 3) Maintain Loan Records And 4) Maintain DDs Records. The existing system to be maintains lot of paper work informations. When any statistical analysis is to be carried out, for example: a comparison of the past years deposits or withdraws with that of the current
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

year, it is also a laborious task of referring to many record books, compiling lists, and carrying out the analysis work. 2.3.2 Problems With Existing System: Lot of space is required to store all the details of the candidates and the Companies. Data is spread across a number of record books, which have to be manually integrated to arrive at a solution. The system is prone to human errors. Detection of errors is a difficult task since every thing is done manually. Tracking of errors to their origin is difficult There is no security to data. Any one can view through the data concerning the activities of the Consultancy Any modification to the data requires searching through all the records and then making the relevant changes. The process is very time consuming.
2.3.3 Proposed System:

Manual processing of data is very tedious and time consuming and leads to erroneous results, at times. In order to overcome these snags computers are being used extensively in all fields thereby minimizing manual labor and errors to a great extent.
Taking all the advantages involved in computerizing, the proposed system Net Banking System integrates all the manual activities by linking them under a single head. This System processes the day-to-day activities and generates tender reports that help the user to get a good grasp of the situation(s) and take decisions quickly and intime.
HARDWARE SPECIFICATIONS Processor : Intel Pentium III or Above
Ram
Cache Hard disk : :
256 MB or more
512 KB 16 GB hard disk recommended for primary partition.
2.4.4 SOFTWARE SPECIFICATIONS
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Operating system
Windows XP or later
Front End Software :

Back End Software :
J2EE,TOMCAT
ORACLE-8i
Bus Scheduling and Dispatching Management System Abstract Development of a dispatching and scheduling software application using advanced 3-tier client/server architecture. The software application will enable shuttle operation management in real time. The system will have the ability to manage vehicle, drivers and passenger information, define and manage vehicle schedules and fixed routes, and so management reporting. In addition to operating a fixed route system, the application also provides scheduled routing for residential and non-fixed hotel routes and variable routing for load balancing. The web module will provide the capability to accept reservation requests from the Internet. Software Specification Java With Swings Databases: Ms-Access H/W Requirements: Processor Ram Hard Disk : Pentium III or above : 256MB or Above : 40GB or Above
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Tutelage Imprinter
ABSTRACT Education has become a part of every human. There are several types of education systems presently running. Tutelage Imprinter is one of the education systems that are under process long before but only committed to the University. TUTELAGE IMPRINTER is an out classes study that allow you to educate when you have a desire and time. A chance to study in any place you like, during your summer vocations or while some other activities. The only thing is that you should be provided with all the necessary materials. This system maintains all the course details so that the users of this system after registration views the list of the course details and also the scheduled course details. After finishing the course the user will test his performance by attending an online examination followed by a question and answer and finally when he finishes the exam there instantly system display his marks which he scored. Tutelage Imprinter is developed in a web based technology with backend as Oracle Server. This system helps the user to not waste his time in distance training education when compared to remote education and finally he could instantly view the marks which he scored in the online exam. S/W Requirements: Technologies : Java, J2EE (JDBC, Servlets, JSP) Database : Oracle 9i H/W Requirements: P IV 900 MHz+ 128 MB RAM 40 GB HDD
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Easy Journey ABSTRACT

India is the one among the fast growing countries. Every one can visit the country throughout India. In the list of visiting places cities are the mostly visited places. Tourists are come from different places and new to the city they dont know about the cities, cultures of the people, local language to communicate and how to approach. Tourist guides are the persons who guide the tourists about the city like the visiting places, their importance and how to approach by taking money from them. Tourist guides may cheat tourists for money by telling lies and chance to rob them. In some cities they are not available. To overcome these problems an efficient and powerful web application called EASY JOURNEY has implemented. This is the online application that provides brief information about the city by using efficient web applications. To get the details about top restaurants, hotels, lodges, events online EASY JOURNEY is an efficient web application.
It provides every one detailed description about entertainment, museum exhibits, monuments and memorials, movies, theaters, hotels, events for concerts and guides the visitors with stories, events listings and theater listings.
EASY JOURNEY also features arts and entertainment, attractions, recreation, festivals and most famous devotional places. Youll instantly get access to the information about the city and provides you with all the information you need to know about the things in the city. This system provides Lifestyle of the people in the city, Entertainment guide, latest information on accomodation, food, sightseeing, shopping, social, cultural and tourist information and is a comprehensive guide.
SOFTWARE REQUIREMENTS: Operating system : Windows XP/2000 Language : Java using Servlets and JSP Backend : Oracle HARDWARE REQUIREMENTS Processor : Pentium II
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Harddisk RAM
: :
40GB 128 MB
PHARMACY MANAGEMENT SYSTEM.doc Abstract

The Pharmacy Management System is a web application developed in Java with back end Oracle. This project can be used by a hospital for its pharmacy department or by a medical shop. The main basic theme of this application is to keep track about all of the medicines available in the pharmacy department. The administrator will maintain the medicines information along with medicine manufacturing date, expiry date and price. Administrator will also maintain information about the distributor of the medicines with his phone number,email ,address etc.The administrator also keep track of his staff details and maintain the equipment details. The staff/Employee of the organization will store the updated data about the medicines ie the medicines quantity and inspection information. The user can give his complaints to the administrator about the medicines.He can also view all the complaints posted by the other users.
Software Environment Operating System : Windows 2000/XP/NT Front end software: jdk1.5 Back end software : ORACLE8i Hardware Environment
Processor Ram Hard disk Monitor : : : :
Intel Pentium or more 256 Mb or more 10 Gb or more Color monitor (256 colors or more)
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

1.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 attackers 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 detectionon 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 hosts operating system.
Operating System Other Tools & Technologies Hardware Requirements P IV 2.4 128 MB Ram Hard Disk 40 GB : Windows 95/98/NT/2000 : Java, Swings, NetWorking
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

2.Structure Text Fillingz

ABSTRACT An approach for filling-in blocks of missing data in image transmission is presented in this paper. When compression algorithms such as JPEG are used as part of the wireless transmission process, images are first tiled into blocks of 8 8 pixels. When such images are transmitted over fading channels, the effects of noise can destroy entire blocks of the image. Instead of using common retransmission query protocols, we aim to reconstruct the lost data using correlation between the lost block and its neighbors. If the lost block contained structure, it is reconstructed using an image inpainting algorithm, while texture synthesis is used for the textured blocks. The switch between the two schemes is done in a fully automatic fashion based on the surrounding available blocks. The performance of this method is tested for various images and combinations of lost blocks. For our implementation, we consider PGM (Portable Gray Map) images for filling in of missing image blocks. We use Java 2, The Standard Edition for implementing the algorithm, and the holes (missing blocks) are placed randomly for testing the project.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

3. An Agent Based Intrusion Detection

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. A intrusion detection and intrusion blocker that can provide interim protection against a limited and changing set of high-likelihood or high-priority threats. It is expected that this mechanism would be easily and adaptively configured and deployed to keep pace with the ever-evolving threats on the network, intrusion detection and response based on agent system, digital signature used to provide a security. Active networks are an exciting development in networking services in which the infrastructure provides customizable network services to packets. The custom network services can be deployed by the user inside the packets themselves. In this paper we propose the use of agent based intrusion detection and response. Agents are integrated with the collaborative IDS in order to provide them with a wider array of information to use their response activities.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

4.Hop By Hop ABSTRACT IP multicast is facing a slow take-off although it has been a hotly debated topic for more than a decade. Many reasons are responsible for this status. Hence, the Internet is likely to be organized with both unicast and multicast enabled networks. Thus, it is of utmost importance to design protocols that allow the progressive deployment of the multicast service by supporting unicast clouds. This paper presents HBH (hop-by-hop multicast routing protocol). HBH adopts the source-specific channel abstraction to simplify address allocation and implements data distribution using recursive unicast trees, which allow the transparent support of unicast- only routers. An important original feature of HBH is its tree construction algorithm that takes into account the unicast routing asymmetries. Since most multicast routing protocols rely on the unicast infrastructure, the unicast asymmetries impact the structure of the multicast trees.We show through simulation that HBH outperforms other multicast routing protocols in terms of the delay experienced by the receivers and the bandwidth consumption of the multicast trees. Additionally, we show that HBH can be incrementally deployed and that with a small fraction of HBH-enabled routers in the network HBH outperforms application-layer multicast.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

5.Optical Multicast Routing In Ad Hoc-Network 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 clients that requested it, and not to send multiple copies of a packet over the same portion of the network, nor to send packets to clients who dont want it. The Adhoc Multicast Routing Protocol (AMRoute) presents a novel approach for robust IP Multicast in mobile ad-hoc networks by exploiting usermulticast 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 Usermulticast 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.
AMRoute does not require a specific Unicast routing protocol; therefore, it can operate seamlessly over separate domains with different Unicast protocols. We have tried to overcome the transient loops in the mesh creation. Also we have implemented the Dynamic core migration technique by using a timer which periodically changes the current core node, so that the efficiency of the protocol can be improved.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

6.Image Rendering For A Grid Tech ABSTRACT Grid Computing is an advanced technology of distributed computing. A Grid is a collection of computers, storage and other devices which are joined together by any means of communication like internet and which can be used to manage information and solve their problems among themselves. Grid Computing allows usage of the unutilized resources of other systems. This is achieved by distributing the workload of the system to the other systems in order to use their unused resources such as their memory, processor, etc which results in balancing the workload, decreasing the network traffic, bandwidth, etc. This concept is used in our project to render a large image in a very short time by distributing the image to many systems for using their resources. As the workload is evenly distributed among the grid network, even the large work can be done in a short time itself. The main scope is that using the unused resources to complete the work efficiently. This project helps to use the resources efficiently and cost effective. Grid Computing is about making large amounts of computing power available for applications and users. Collaborative development of Java Grid Engine technology provides the proper development framework to ensure that Grid Engine technology meets the requirements of the largest number of users.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Network Analyzer ABSTRACT This paper describes how to use an AEA Technology network analyzer to tune an antenna. This paper discusses tuning issues at a general level; no specific model of antenna is addressed here. For best link efficiency, you must properly tune the antenna to resonance. Additionally, if the antenna has two or more adjustments available, you should also tune the antenna for the optimum match. Resonance occurs when the reactive portion of the antenna impedance is zero. This causes the voltage to be in phase with the current, and allows the transmitter to generate its maximum power. SWR or return loss readings do not provide enough information to determine resonance. You must use a vector impedance reading to see resonance. The transmission lines used to feed the antenna can add a layer of confusion to the measurements. If practical, tune the antenna by itself first, then add in the feedline for more measurement
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

9. Credit Card Approval System

ABSTRACT An automated security credit checking system for checking a credit application for fraud before a credit card is issued. The credit checking system scans the credit application, and uses an optical character recognition program to check the application. The credit checking system helps determine whether the application is legible, and whether there is a discrepancy between the post mark and the mailing address. The credit checking system automatically determines whether the application is a corporate or individual application, and whether the application is one of numerous requests from the same person, employer, or address. The credit checking system also tracks the status of each application and the route each type of application has taken, whether it is a corporate application, a suspected fraudulent application, a verified fraudulent application, or a rejected application. This credit checking system checks online national fraud information sources, and fraud information that is compiled by the system and entered into system memory on a daily basis. A letter listing credit bureaus to contact for protection is generated and sent to any victim of fraud detected during daily credit checking. The automated credit checking system keeps a daily tally of the number of corporate applications received, the percentage of individual applications approved, the percentage of individual applications declined or rejected, and the percentage of individual applications that were detected as being fraudulent.
Operating System Other Tools & Technologies Hardware Requirements P IV 2.4 128 MB Ram Hard Disk 40 GB : Windows 95/98/NT/2000 : Java, Swings, Jdbc
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

10. Visual Cryptography

ABSTRACT Visual cryptography is a cryptographic technique which allows visual information (pictures, text, etc.) to be encrypted in such a way that the decryption can be performed by the human visual system, without the aid of computers. Visual cryptography was pioneered by Moni Naor and Adi Shamir in 1994. They demonstrated a visual secret sharing scheme, where an image was broken up into n shares so that only someone with all n shares could decrypt the image, while any n-1 shares revealed no information about the original image. Each share was printed on a separate transparency, and decryption was performed by overlaying the shares. When all n shares were overlayed, the original image would appear. Using a similar idea, transparencies can be used to implement a one-time pad encryption, where one transparency is a shared random pad, and another transparency acts as the ciphertext. Features: Share image into two parts Security
Operating System Other Tools & Technologies Hardware Requirements P IV 2.4 128 MB Ram Hard Disk 40 GB : Windows 95/98/NT/2000 : Java, Swings, Networking
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Digital Water Marking ABSTRACT Our project deals with the concept of watermarking. Recent advancements in computer technologies offer many facilities for duplication, creation, manipulation, reproduction and distribution of the digital multimedia. They are becoming extremely easier 7and faster with the existence of the Internet and the availability of pervasive and powerful multimedia tools. However, these advances have their drawbacks as well, for example unauthorized tampering of images. Digital watermarking has emerged as a possible method to tackle these issues. Digital watermarking is a process to embed secondary data in digital media. A digital watermark is created by inserting a digital signal, or pattern within multimedia content. This embedded information can be used to determine whether the host data are being tampered with or not. These embedded data are can be visible or invisible depend on the particular applications and the requirements of applications. , and can later be detected or extracted. It has made a considerable progress in recent years and attracted attention from both academia and industry. It plays a vital role as it allows to identify the legitimate owner, track authorized users via fingerprinting or detect malicious tampering of the document. Several watermarking methods exist for every kind of digital media .for example Text documents, images, video, audio even for 3D polygon models, maps and computer programs. Our project deals with watermarking the images with other images and text. Modules: 1. Text on image 2. Image on image
Operating System : Windows 95/98/NT/2000 Web/Application Server : Tomcat Database Server : Oracle 8i Other Tools & Technologies : Java (JDK), Servlets (JSDK), JavaMail
Pentium IV 64 MB Ram Hard Disk 4.3 GB
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

JBrowser ABSTRACT Our project deals with developing some tools, which help in enhancing the activities at different stages in the software development life cycle (SDLC). Our tools will fall under the category of CASE tools which enable sophistication during the software development. We aim at developing two tools, (a) Code Analyzer ( jBrowser ) and (b) Log Reader. The jBrowser would be a tool that would help the user track control flow between java classes via method calls. Given a starting point, this tool tracks the entire path within a particular location spotting various method calls under different scenarios. We aim at building this tool as an effective tool to understand the control flow while reengineering and reverse engineering and as a testing tool which would identify the broken links between the java classes. The Log Reader is another simple tool. This tool focuses on presenting the user with a user friendly GUI, using which the user can query and extract useful information from the log files generated by an application server in an interactive and understandable manner.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Public Key Validation For Dns Security Extension 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 DNS Security 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 DNS security 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. The Domain Name System (DNS) has become a critical operational part of the Internet Infrastructure, yet it has no strong security mechanisms to assure Data Integrity or Authentication. Extensions to the DNS are described that provide these services to security aware resolves are applications through the use of Cryptographic Digital Signatures. These Digital Signatures are included zones as resource records.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

15.Webs Eye ABSTRACT Webs Eye is software to develop web pages .Many people is aware of world wide web and web pages, but not even capable of dreaming a web page design. The Webs Eye is q user friendly software which will assist you in designing a web page and putting your creative ideas in the web to change you really professional in the Worlds Eyes. Suppose if you are a professional Webs Eye will show a different face as an intelligent colleague to navigate you. Webs Eye uses Java @ Platform to develop an extra featured user friendly software for creating web pages. Web page code generation is done in HTML. The strong graphical user interface which is the unique property of this project helps to distribute the tags intelligently . The project mainly aims at simplifying user effort for creating a web page. Extra features of Webs Eye Full fledged html help covers all the areas of HTML Inbuilt browser to have a preview Integrated IE allows downloading Two modals one for Beginners and other for Professionals Installation kit Vast library of button objects
Operating System Other Tools & Technologies P IV 2.4 128 MB Ram Hard Disk 40 GB : Windows 95/98/NT/2000 : Java, Swings, Networking
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

16.Web Extractor ABSTRACT A web web extract is a program, which automatically traverses the web by downloading documents and following links from page to page. Web search engines to gather data mainly use them. Other possible applications include page validation, structural analysis and visualization; update notification, mirroring and personal web assistants/agents etc. web extract are also known as spiders, robots, worms etc. web extracts start by parsing a specified web page, noting any hypertext links on that page that point to other web pages. They then parse those pages for new links, and so on, recursively. Web-Importer software doesn't actually move around to different computers on the Internet, as viruses or an intelligent agent does. An importer resides on a single machine. The importer simply sends HTTP requests for documents to other machines on the Internet, just as a web browser does when the user clicks on links. All the importer really does is to automate the process of following links. Web importing speed is governed not only by the speed of ones own Internet connection, but also by the speed of the sites that are to be downloaded. Especially if one is an importing site from multiple servers, the total downloading time can be significantly reduced, if many downloads are done in parallel. This work implements the Breadth First Importing algorithm, a refined version of one of the first dynamic Web search algorithm, In order to build a major search engine or a large repository such as the Internet Archive, high-performance importers start out at a small set of pages and then explore other pages by following links in a breadth first-like fashion.
Modules: 1. 2. Filter web pages Download pages

: Windows XP/2000 Professional : Jdk1.4 or higher : Pentium III or above : 256MB or Above : 40GB or Above
S/W Requirements: Operating System Language Name H/W Requirements: Processor Ram Hard Disk
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Online Database Wizard

ABSTRACT Online Database Wizard is an innovative, intuitive database wizard. Specifically aimed at developers developing , Internet database related projects, website, etc., Online Database Wizard profiles host of features that are very much crucial but neglected in general. This document provides very superficial information and capabilities of Online Database Wizard. In simple, using Online Database Wizard any developer with minimal knowledge can easily do the following things connect to multiple databases easily create databases modify databases import and export data execute SQL statements
Modules
Input entry screen (connection requirements) SQL Editor window Results Window Syntax highlighter and help Saving SQL statements Saving output results Schema generation with UI Multiple database connections o MS Access o MS SQL o Oracle o My SQL Storing multiple connection information Importing data directly from local disk to internet Exporting data from internet to local disk Relationship diagram between tables Database properties / structure details
Purpose of the Project:

PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Initial screen which is going to ask user on what type of database that the user wants to interact. Then it will ask for the required parameters to act on that particular database. Based on the parameters it establishes the connection and executes the user queries to his satisfaction. connect to multiple databases easily create databases modify databases import and export data execute SQL statements
Hardware Specifications: Intel P-III Processor 64 MB RAM 40 GB Hard Disc Software Specifications: Operating System Language : Windows NT/ Windows 98 : JAVA using Swings
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Visual Editor ABSTRACT Providing the users with the create documents main purpose of this application. The project implementation is mainly concerned with create documents are maintained by our editor. The project has been developed by utilizing JAVA2, using Swing, IO, and wt(Abstract Window Toolkit) The successful platform used is Windows and has its application in windows based System. The abstraction for a System is its Documents, the usual methods in now-a-days based on Windows Environments. The term Word Processing refers to the activity carried out using a computer and suitable software to create, view, edit, manipulate, transmit, store, retrieve and print documents.
Operating System Other Tools & Technologies Hardware Requirements P IV 2.4 128 MB Ram Hard Disk 40 GB : Windows 95/98/NT/2000 : Java, Swings
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

19. Stegohider
ABSTRACT Steganography is the art of hiding information. There are a large number of Steganographic methods used in different applicatons.It is extensively used in Digital Water marking, communication within closed community with additional degrees of security. An attempt is being made to implement a new technique , entitled Steganographic Application Tool, for image encoding in steganography. It provides more security for data transfer on Internet and other networks. Our intention is to hide the existence of the message; While Cryptography scrambles a message so that it can not be understood. Using Steganography a secret message can be transmitted without the fact of the transmission being discovered. This hiding of data can be done in three different media such as text, image and audio files. Though there are variety of image formats to implement the algorithms used in this system, we use the JPEG format to embed the Plain text as it contains the compressed image format. In this technique, firstly the pixels values (RGB values) of the image in which the plain text is to be embedded are extracted. The bits of the plain text into the two LSB bits of the RGB values in the image. The transparency bits of the pixels are not disturbed. The fact that we are embedding the plain text into the two LSB bits enables the recipient to get the original image without any distortions. In order to provide more security, we are first encrypting the message using DES algorithm and then cipher text as the input to our technique and the same message will be extracted and decrypted at the receiver end. Steganography is really interesting subject and the applications using Steganography are increasing day-by-day. A number of algorithms were developed and implemented to achieve Steganography in images and audio. Many new algorithms are coming and each of them uses a unique method of making life of a Steg-Analyst more miserable everyday.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

EMBEDDING DATA INTO VIDEO FILE WITH LESS DISTORTION USING LSB TECHNIQUE
ABSTRACT The Embedding Data into Video File is an application which deals with security during transmission of data across the network. Security for the data is required, as there is always a possibility for someone to read those secret data. The system deals with implementing security using steganography. Steganography is the art of hiding information in ways so as to prevent detection of hidden messages. Data Embedding into Video File is software, which tries to alter the originality of the data files in to some encrypted form by using Tiny Encryption Algorithm. Encryption of data plays a vital role in the real time environment to keep the data out of reach of unauthorized people, such that it is not altered and tampered. After encryption, the files can be transferred securely by using steganography. We are using video as stegno media to embed the encrypted data file .So this has been defined as Video Steganography. The application should have a reversal process as of which should be in a position to deembed data file from video and decrypt the data to its original format upon the proper request by the user. The goal of our project is to design a tool for providing security to the system during transmission of data through the network. The project is developed using graphics in java swings.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Remote Network Monitoring And Control

ABSTRACT
This project deals with the functionalities of the node systems connected through a network. This system implements Remote control at the application level. This project controls the remote systems by performing the node 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 software. Java also provides a strong development platform in its own right for remotecontrol 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.
1.1 CURRENT SYSTEM:

In the present generation systems, there is a need for the administrator has to go all around the network in order to terminate any system that is left non-terminated. The administrator has to take all the trouble of going to a particular system to access a file that is needed by him. In order to get the system configuration details of any particular system, the administrator has to take the trouble of going to that system for obtaining the information. The processes that are running in a particular system can be viewed only in that system itself by using the present generation softwares. In order to provide security for the files from unauthorized users, the administrator has to assign the file permissions. In the existing systems this is handled by performing the required actions on that particular system itself.
1.2 PROPOSED SYSTEM:

The disadvantages present in the existing systems can be overcome using the proposal systems. Using the Node Controller software the administrator can control the operations of the remote system from his system it self.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

With this software, he can search the files he wants that are present on the remote system and can download the files to his system in order to access them and can also upload them to any system. The administrator can get the configuration of the remote system from the server system itself using this software. In order to terminate the operations on the remote systems, the administrator can obtain the current process details of the remote systems from the server itself. In order to ensure the security for the files in an organization, the administrator can provide the file access permissions. Running rmiregistry in the client systems performs all the above operations.
5.3.1
OPERATING PLATFORM Technologies : : WINDOWS XP, VISTA JAVA, RMI, SWINGS,networking
5.3.2
Hardware Specifications:
PROCESSOR RAM HARD DISK VDU KEY BOARD LAN
: : : : : ENABLED
PENTIUM-4 256 MB (MINIMUM) 20 GB (MINIMUM) SVGA COLOR MONITOR 104 STANDARDS
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

HTTP Server
ABSTRACT GRAPHICAL WEB Server is a web based window application. A HTTP Server displays a browser page with a graphical user interface. Web browsers plays a critical role in making Web content accessible to people with disabilities. Access to Web content requires that Web browsers provide users with final control over the styling of rendered content, the type of content rendered and the execution of automated behaviors. The features available in Web browsers determine the extent to which users can orient themselves and navigate the structure of Web resources. . This project HTTP Server uses a port number to retrieve the applications on a web page This project is depending on the port number and using this port number in the url we access the pages . The present subject matter describes a HTTP Server stores visual representations of userselected web pages and provides a convenient way to collect web pages and related information . Using the techniques described herein, a user can easily save information including: a link to a web page; a thumbnail image related to the web page; a title of the web page; information from the web page; metadata associated with the web page; and user comments regarding the web page. In this paper we describe how we are using the visualization system to visualize the portion of the Web explored during a browsing session. As the user browses, the Web browser communicates the URL and title of each document fetched as well as all the anchors contained in the document. Finally we are creating our own server using port number.
5.3.1
OPERATING PLATFORM : Technologies : SWINGS,networking,JSP,Servlets WINDOWS XP, VISTA JAVA
5.3.3
: : : : : ENABLED
PENTIUM-4 256 MB (MINIMUM) 20 GB (MINIMUM) SVGA COLOR MONITOR 104 STANDARDS
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

8. Implementation of IDEA Algorithm ABSTRACT The IMPLEMENTATION AND ITS PERFORMANCE EVALUATION OF IDEA ALGORITHM is an application which deals with security during transmission of data across the network. Security for the data is required, as there is always a possibility for someone to read those secret data. Encryption of data plays a vital role in the real time environment to keep the data out of reach of unauthorized people, such that it is not altered and tampered. After encryption, the files can be uploaded by using File Transfer protocol. After transfer of data, the files are decrypted. This application also calculates the time taken to encrypt and decrypt the data using 64bit key,128-bit key,192-bit key,256-bit key. The main goal of our project is to design a tool for providing security to the system during transmission of data through the network. The project is developed using graphics in java swings.
5.3.1
OPERATING PLATFORM : Technologies : SWINGS,networking,JSP,Servlets WINDOWS XP, VISTA JAVA
5.3.4
: : : : : :
PENTIUM-4 256 MB (MINIMUM) 20 GB (MINIMUM) SVGA COLOR MONITOR 104 STANDARDS ENABLED
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

9. Image Compression ABSTRACT Image Compression is mainly used for compressing the image data with out any significant image data or image clarity. This is for easy maintenance, network transforming and security also provided. In this project the lousy compression techniques can be used in some contexts where data loss cannot affect the image clarity in this area. In some important situations image compression uses Lossless compression involves with compressing data which, when decompressed, will be an exact replica of the original data. This is the case when binary data such as executables, documents etc. are compressed. They need to be exactly reproduced when decompressed. On the other hand, images need not be reproduced 'exactly'. An approximation of the original image is enough for most purposes, as long as the error between the original and the compressed image is tolerable.
Pentium IV Processor. 128 MB RAM. 20GB Hard Disk space. Software Requirements Windows 2000 XP operating system. J2sdk1.4.0 or higher
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Pretty Good Privacy ABSTRACT PGP Encryption (Pretty Good Privacy) is a computer program that provides cryptographic privacy and authentication. The first PGP version, by designer and developer Phil Zimmermann, became available in 1991. Since then major enhancements have been made and a wide range of products are now available from PGP Corporation and other companies.
PGP encryption applications

While originally used primarily for encrypting the contents of email messages and attachments from a desktop client, PGP products have been diversified since 2002 into a set of encryption applications which can be managed by an optional central policy server. PGP encryption applications include email and attachments, digital signatures, laptop full disk encryption, file and folder security, protection for IM sessions, batch file transfer encryption, and protection for files and folders stored on network servers. The PGP Desktop 9.x application includes desktop email, digital signatures, IM security, laptop whole disk encryption, file and folder security, self decrypting archives, and secure shredding of deleted files. Capabilities are licensed in different ways depending on features required. The PGP Universal 2.x management server handles centralized deployment, security policy, policy enforcement and reporting. It is used for automated email encryption in the gateway and manages PGP Desktop 9.x clients. It works with the PGP public keyserver - called the PGP Global Directory - to find recipient keys. It has the capability of delivering email securely when no recipient key is found via a secure HTTPS browser session. With PGP Desktop 9.0 managed by PGP Universal Server 2.0, released in 2005, all PGP encryption applications are based on a new proxy-based architecture. These newer versions of PGP software eliminate the use of email plug-ins and insulate the user from changes to other desktop applications. All desktop and server operations are now based on security policies and operate in an automated fashion. The PGP Universal server automates the creation, management, and expiration of keys esharing these keys among all PGP encryption applications. New versions of PGP applications use both OpenPGP and the S/MIME, allowing communications with any user of a NIST specified standard.
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

How PGP encryption works:

PGP encryption uses public-key cryptography and includes a system which binds the public keys to user identities. The first version of this system was generally known as a web of trust to contrast with the later-developed X.509 system which uses a hierarchical approach based on certificate authority. Current versions of PGP encryption include both alternatives through an automated management server.
Encryption/decryption.
PGP message encryption uses asymmetric key encryption algorithms that use the public portion of a recipient's linked key pair, a public key, and a private key. The sender uses the recipient's public key to encrypt a shared key (aka a secret key or conventional key) for a symmetric cipher algorithm. That key is used, finally, to encrypt the plaintext of a message. Many PGP users' public keys are available to all from the many PGP key servers around the world which act as mirror sites for each other. The recipient of a PGP encrypted email message decrypts it using the session key for a symmetric algorithm. That session key is included in the message in encrypted form and was itself decrypted using the recipient's private key. Use of two ciphers in this way is sensible because of the very considerable difference in operating speed between asymmetric key and symmetric key ciphers (the differences are often 1000+ times). This operation is completely automated in current PGP desktop client products.
Digital signatures:
A similar strategy is used to detect whether a message has been altered since it was completed, and whether it was actually sent by the person/entity claimed to be the sender. It is used by default in conjunction with encryption, but can be applied to plaintext as well. The sender uses PGP encryption to create a digital signature for the message with either the RSA or DSA signature algorithms. To do so, PGP products compute a hash (also called a message digest) from the plaintext, and then creates the digital signature from that hash using the sender's private key. The message recipient uses the sender's public key and the digital signature to recover the original message digest. He compares this message digest with the message digest he computed himself from the (recovered) plaintext. If the signature matches the received plaintext's message digest, it must be presumed (to a very high degree of confidence) that the message received has not been tampered with, either deliberately or accidentally, since it was properly signed
SOFTWARE SPECIFICATIONS:
Operating System Language H/W REQUIREMENTS: Processor
: : :
Windows NT/ Windows 98 .Net(vb.Net) Pentium III or Above
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

256MB or Above 4GB or Above
Ram Hard Disk
: :
27.Car Sales System ABSTRACT An information processing technology of the present invention is capable of speeding up a process that a prospective buyer of a used car determines an intention of purchasing the car. A car sale information providing system of the present invention includes a car information storage unit stored with mappings of car information containing a name, a type, a year model etc of a car to car inspection information obtained as a result of inspecting the car concerned. A car information input device is provided for inputting the car information and getting the car information stored in the car information storage unit (A search unit is provided for outputting an input screen for searching the car information stored in the car information storage unit , and searching based on conditions inputted. The system includes a car information output unit , for outputting display information, including a purchase indication interface for transmitting car purchase information containing the searched car information and the car inspection information corresponding to the car information.
ENVIRONMENT: Operating System Server: Windows XP or later Programming language: Java Graphical User Interface: Jdk, Swings Hardware Specification:
Processor: Intel Pentium or More RAM: 512 MB Ram Hard Disk: PC with 20GB
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Remote File Repository

ABSTRACT This REMOTE FILE REPOSITORY development of a system that is simple and easy to find client system files. Using this project any one can search for a particular file or files on the client machine by simply giving the client machines IP address, file extension and location of the file by sitting on the server machine. The list of files with the specific extension will be displayed on the server machine.
Some of the features are:
The proposed system should be in the way, the user can enter the client system IP, file extension, path of the file or folder very quickly. It should display the matching files. The files should be display in the order as they exist. The modules are 1. User interface 2. Searching
User interface It provides very attractive and friendly user interface. The user can easily interact with the system ( to provide client system IP / file system extensions..Etc). Searching This module allows us to search the files and folders exist in client system. It allows regular expressions to Search the files. It displays in the files in an order as they exist in system. ENVIRONMENT: Operating System Server: Windows XP or later Programming language: Java Graphical User Interface: Java Swings API Hardware Specification: Orange Software Technologies, 1 st Floor, Harikrishna Building,Opp:Konark Theater,Dilsukhnagar,Hyd-60, Ph: +91 86 86 051194 ,86 86 061194. Email: services@orangehyd.com Website : www.orangehyd.com
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Bank System ABSTRACT The main objective of this proposed system is to all the activities of a bank. The system is like to enable the bank employees to open accounts for their customers with ease and to add the details, to transfer amount from one account to another account and doing all the activities related to loan, making all type of transactions. Using the system employees can also generate different types of modules.
Add Acct Type Information Add Loan Detail Information Create New Accounts Transaction (Deposits, Withdraws and Loan Payments) Issue Loans Issue DDs Generate Reports (Day, monthly, withdraws, dds, and deposits)
Using the system client can also generate different type of modules. Check Account Types Information Check Loans Information Check Balance Amount
Software Specification Operating System Server: Windows XP or later Programming language: Java Graphical User Interface: Java Swings,Jdbc Hardware Specification:
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

30. Audio Track Finder

ABSTRACT This program was created for individuals who own numerous unlabeled mixed cds and would love to have a means of locating tracks on the cd. In order for this program to work there have to be some type of distinction between the cds. For instance we label our cds with a number(ie, CD 1, CD 2..). Although "CD 1" is the most recommended format it isn't the only choice. There are many different alternatives like labeling the cds by color and so on. A user easily can find out the track of cd by using title or track number. Of course the saved cd name will have to match the label. For example, if you save the cd as "CD 1" then you should label your cd #1 or so, otherwise the program will not benefit you. S/W Requirements: JAVA/J2EE Oracle/MSSQL/MS-Access H/W Requirements: P IV 900 MHz+ 128 MB RAM 40 GB HDD
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Airways Reservation System ABSTRACT Airways Reservation System is used to give the customers the best of booking tickets. The web technologies have been developed in such a manner that they can provide good services to its users. The airlines ticketing system is a web-based application which have been developed in one of the web technologies Java with backend as Oracle9i. The airlines ticketing is the system that provides not only ticket booking services but also it gives the complete information about the Airlines Company. The ticket booking is made very easy that the customer can book his ticket by just giving his credit card number. His ticket will be sent to the prescribed address given by the customer. This online application is very flexible so that the customer can easily fill his details and receive the ticket in time. S/W Requirements: VB/.NET/JAVA/J2EE Oracle 9i/MSSQL/MS-Access H/W Requirements: P IV 900 MHz+ 128 MB RAM 40 GB HDD
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

32.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 2ACK scheme. Analytical and simulation results are presented to evaluate the performance of the proposed Scheme.
follows:
The various modules included in the project as 1: 2: 3: 4: 5: Route Discovery. Data Security. Data Transfer. Route Maintenance. Route Disconnection
: Windows 95/98/NT/2000 : Java
Module Module Module Module Module

Operating System Other Tools & Technologies
P IV 2.4 128 MB Ram Hard Disk 40 GB
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

33.Web Importer ABSTRACT A web importer is a program, which automatically traverses the web by downloading documents and following links from page to page. Web search engines to gather data mainly use them. Other possible applications include page validation, structural analysis and visualization; update notification, mirroring and personal web assistants/agents etc. Web importers are also known as spiders, robots, worms etc. Web Importers start by parsing a specified web page, noting any hypertext links on that page that point to other web pages. They then parse those pages for new links, and so on, recursively. Web-Importer software doesn't actually move around to different computers on the Internet, as viruses or an intelligent agent does. An importer resides on a single machine. The importer simply sends HTTP requests for documents to other machines on the Internet, just as a web browser does when the user clicks on links. All the importer really does is to automate the process of following links.
Web importing speed is governed not only by the speed of ones own Internet connection, but also by the speed of the sites that are to be downloaded. Especially if one is an importing site from multiple servers, the total downloading time can be significantly reduced, if many downloads are done in parallel. This work implements the Breadth First Importing algorithm, a refined version of one of the first dynamic Web search algorithm, In order to build a major search engine or a large repository such as the Internet Archive, high-performance importers start out at a small set of pages and then explore other pages by following links in a breadth first-like fashion. Modules: 3. 4. 5. Find file structure using WebCrawler Filter web pages Download pages
: Windows XP/2000 Professional
S/W Requirements: Operating System
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Language Name H/W Requirements: Processor Ram Hard Disk
: Jdk1.4 or higher : Pentium III or above : 256MB or Above : 40GB or Above 34.Atm Simulator
ABSTRACT The project ATM STIMULATOR is beneficial for the any people who are in villages or in ruler area or in metro city. A person who needs a fast cash and fast and hard cash. We presents a software ATM machine for the transaction of money and saving of money. The database is maintained for each individual account. This project has been designed as such the ATM using the software. In our project overall several forms have been created. For these form of records this database is used. This project is maintains a database for different records, it means that for the account transactions.Advantages: Fast accessing No manpower is needed No need to go to bank to deposit Time consuming process
Intel P-III Processor 64 MB RAM 4 GB Hard Disc
Software Specifications: Operating System Language Database : : :

Windows NT/ Windows 98 JAVA using SWINGS/AWT Access/Oracle/SqlServer
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

35.High Speed Download Manager ABSTRACT This is purely a java enabled Network project using which an end user downloads different files (data) from various servers with a high-speed data transfer. The end user activating the Download Manager need to submit an URL of the file to be downloaded, by which the software gets connected to the server and gets the file information with its status for the download. After which the user is asked for the path to save the file. The Download manager then downloads the requested file at a high speed. The software design supports the display of status information of the download carried out at every second (i.e.) the percentage of file downloaded. The most striking feature of this download manager is support of high-speed data transfer and it allows the user to download more than one file simultaneously. It provides a reliable data transfer by tracing the download status at every moment and helps to continue the file downloading from the position of its last download if the downloading is terminated by a sudden disaster like loss of connection due to any reason or failure of transmission.
Software Specifications: Operating System : Windows NT/ Windows 98 Language :JAVA using SWINGS/AWT,Networking
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Extreme Pc ABSTRACT XtremePC is an open source project has been developed using Java RMI-NIO and Win32 API with Windows XP Look & Feel. It provides opportunity to access files of your remote PC from anywhere in the world. You can even run any type of file with associated executable files, turn off the remote PC, restart, log off, lock etc. You can also download files from your Remote PC to the current PC, and upload files from the currently using PC to the Remote PC. You will also be able to know the file information before downloading and uploading files so that you would always know the file size which is being downloaded or uploaded. Caching the contents of drives, folders added extremely fast navigation so that you will always feel that you are accessing local drives. It also ensures the security of passed information both ways using Data Encryption Standard (DES) algorithm using Electronic Code Book (ECB). The Remote PC is always protected by password. You have to know the password in order for using the Remote PC from the current PC. Here is a snapshot attached with this email, how you will see your PC out of your house. However, Lite Edition does not support XP Look & Feel.
Whats new?
No more command-line interfaces. Now it is loaded with Graphical User Interface with Windows XP Look & Feel. Those who faced problem loading XP Look& Feel, may try this Lite Edition. It uses only built-in Java Look & Feel, which reduced size of the distributable file. Easy and EXTREMELY fast navigation through Internet, feels like local drives. Select a file from the remote PC and use menu to download, upload, and run on remote PC. Run files on remote PC with any kind of extension. New I/O, Remote Method Invocation (RMI) technologies are involved.
Software Specification Java RMI Swings

PROJECTS @ ORANGE
JAVA, J2EE & J2ME

38.Transportation System On Ids ABSTRACT Making cities liveable is a matter of growing concern for different groups across the globe. As such, the effects that the distinct means transportation can have on different communities have been an evolving subject of study. This coursework is intended to describe the design of Meeting Arrangement for a university or college, a simple meeting arrangement system based on the different means of transportation for students at the college or University. On a given day, students arrive to the college or university for different activities (lessons and meetings) using distinct means of transportation. Consequently, their arrival times vary according to not only to the means but also to the departure point. The idea is to produce a case study scenario where students can will fully register their routes and keep their classmates updated on their arrival times. With potential application to meeting arrangement and lesson start times, such system shall be modeled as an Informative Digital Screen (IDS) similar to the ones located at bus stops across the city. For our case study, we assume that such means are restricted to bus, car, and bicycle only. By using this system, students and staff at university or college can potentially arrange meetings and in general, be more informed to schedule activities. Such system is to be modeled using object oriented techniques and deployed accordingly as a Java computer programming application.
Software Specification Java Swings
PROJECTS @ ORANGE
JAVA, J2EE & J2ME

Java Productivity Aids(JBrowser)
ABSTRACT
Our project deals with developing some tools, which help in enhancing the activities at different stages in the software development life cycle (SDLC). Our tools will fall under the category of CASE tools which enable sophistication during the software development. We aim at developing two tools, (a) Code Analyzer ( jBrowser ) and (b) Log Reader. The jBrowser would be a tool that would help the user track control flow between java classes via method calls. Given a starting point, this tool tracks the entire path within a particular location spotting various method calls under different scenarios. We aim at building this tool as an effective tool to understand the control flow while reengineering and reverse engineering and as a testing tool which would identify the broken links between the java classes. The Log Reader is another simple tool. This tool focuses on presenting the user with a user friendly GUI, using which the user can query and extract useful information from the log files generated by an application server in an interactive and understandable manner.
Software Specification Java Swings

Java Project Titles With Abstracts (2fhfgh)

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Java Project Titles With Abstracts (2fhfgh)

Uploaded by

Copyright:

Available Formats

PROJECTS @ ORANGE

POWERED BY EXPERIENCE & KNOWLEDGE

JAVA, J2EE & J2ME

2009 2009 2008 2008 2008 2008

JAVA, J2EE & J2ME

An Acknowledgment-Based Misbehavior In Mantes

Detection Of Misbehavior In MANATES

JAVA, J2EE & J2ME

2008 2008 2008 2004 2008

PARALLEL AND DISTRIBUTED SYSTEMS

JAVA, J2EE & J2ME

Advance Computing, Secure Computing, JOURNAL AND CONFERENCE PAPERS

Hybrid Intrusion Detection With Anomalous Internet Episodes

JAVA, J2EE & J2ME

Web Based Project

JAVA, J2EE & J2ME

Windows Based Project

JAVA, J2EE & J2ME

JAVA, J2EE & J2ME

1. BINRANK: SCALING DYNAMIC AUTHORITY-BASED

JAVA, J2EE & J2ME

SEARCH USING MATERIALIZED SUB GRAPHS

JAVA, J2EE & J2ME

JAVA, J2EE & J2ME

JAVA, J2EE & J2ME

JAVA, J2EE & J2ME

JAVA, J2EE & J2ME

JAVA, J2EE & J2ME

JAVA, J2EE & J2ME

JAVA, J2EE & J2ME

5: Study on intelligent e-shopping system based on data mining

Problems in existing system:

JAVA, J2EE & J2ME

JAVA, J2EE & J2ME

5.4.2. Proposed System:

JAVA, J2EE & J2ME

6. System Requirements: 6.1. Hardware:

JAVA, J2EE & J2ME

JAVA, J2EE & J2ME

JAVA, J2EE & J2ME

JAVA, J2EE & J2ME

Software requirements: Hardware:

JAVA, J2EE & J2ME

AN EFFICIENT CLUSTERING SCHEME TO EXPLOIT HIERARCHICAL DATA IN NETWORK TRAFFIC ANALYSIS

JAVA, J2EE & J2ME

SYSTEM REQUIREMENTS SPECIFICATION:

JAVA, J2EE & J2ME

Software Specification Operating System Language used

JAVA, J2EE & J2ME

33 Application of BPCS steganography to wavelet compressed

JAVA, J2EE & J2ME

Operating System Language used

Windows XP/2000 J2sdk1.4.0

JAVA, J2EE & J2ME

JAVA, J2EE & J2ME

SYSTEM REQUIREMENTS SPECIFICATION:

JAVA, J2EE & J2ME

Intrusion Detection in Homogeneous and Heterogeneous Wireless Sensor Networks

JAVA, J2EE & J2ME

JAVA, J2EE & J2ME

Cryptographic Versus Trust-based Method s for MANET Routing Security

JAVA, J2EE & J2ME

Location-Based Spatial Query Processing in Wireless Broadcast Environments