DOCSLIB.ORG

Mastering JXTA: Building Java Peer-To-Peer Applications by Joseph D

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Mastering JXTA: Building Java Peer-To-Peer Applications by Joseph D Mastering JXTA: Building Java Peer-to-Peer Applications by Joseph D. Gradecki (Author), Joe Gradecki Paperback: 552 pages ; Publisher: John Wiley & Sons; ISBN: 0471250848 Mastering JXTA Building Java Peer-to-Peer Applications Joseph D. Gradecki Wiley Publishing, Inc. Mastering JXTA Building Java Peer-to-Peer Applications Mastering JXTA Building Java Peer-to-Peer Applications Joseph D. Gradecki Wiley Publishing, Inc. Publisher: Robert Ipsen Copyeditor: Elizabeth Welch Editor: Robert M. Elliott Proofreader: Nancy Sixsmith Managing Editor: John Atkins Compositor: Gina Rexrode Book Packaging: Ryan Publishing Group, Inc. Technical Editor: Stan Ng Designations used by companies to distinguish their products are often claimed as trademarks. In all instances where Wiley Publishing, Inc., is aware of a claim, the product names appear in initial capital or ALL CAPITAL LETTERS. Readers, however, should contact the appropriate companies for more complete information regarding trademarks and registration. This book is printed on acid-free paper. ∞ Published by Wiley Publishing, Inc., Indianapolis, Indiana Published simultaneously in Canada. No part of this publication may be reproduced, stored in a retrieval system, or transmitted in any form or by any means, electronic, mechanical, photocopying, recording, scanning, or otherwise, except as permitted under Section 107 or 108 of the 1976 United States Copyright Act, without either the prior written permission of the Publisher, or authorization through payment of the appropriate per-copy fee to the Copyright Clearance Center, Inc., 222 Rosewood Drive, Danvers, MA 01923, (978) 750-8400, fax (978) 750-4470. Requests to the Publisher for permission should be addressed to the Legal Department, Wiley Publishing, Inc., 10475 Crosspointe Blvd., Indianapolis, IN 46256, (317) 572-3447, fax (317) 572- 4447, email: [email protected]. Limit of Liability/Disclaimer of Warranty: While the publisher and author have used their best efforts in preparing this book, they make no representations or warranties with respect to the accuracy or com- pleteness of the contents of this book and specifically disclaim any implied warranties of mer- chantability or fitness for a particular purpose. No warranty may be created or extended by sales representatives or written sales materials. The advice and strategies contained herein may not be suit- able for your situation. You should consult with a professional where appropriate. Neither the pub- lisher nor author shall be liable for any loss of profit or any other commercial damages, including but not limited to special, incidental, consequential, or other damages. For general information on our other products and services please contact our Customer Care Depart- ment within the United States at (800) 762-2974, outside the United States at (317) 572-3993 or fax (317) 572-4002. Wiley also publishes its books in a variety of electronic formats. Some content that appears in print may not be available in electronic books. Library of Congress Cataloging-in-Publication Data: ISBN: 0-471-25084-8 Printed in the United States of America 10 9 8 7 6 5 4 3 2 1 Contents ix Chapter 8 Peer Information Protocol 123 An Overview of the PIP 123 PIP Query Messages 124 PIP Response Messages 124 Java Binding of the PIP 126 Requesting Peer Information 127 Building a Listener 127 Viewing the Information Returned 128 Summary 129 Chapter 9 Peer Endpoint Protocol 131 An Overview of the Peer Endpoint Protocol 131 Endpoint Service 132 Sending a Message 133 Endpoint Protocols 133 Java Binding of the Peer Endpoint Protocol 134 Summary 136 Chapter 10 Pipe Binding Protocol 137 Overview of the Pipe Binding Protocol 137 Pipe Advertisements 138 Pipe Binding Query Messages 138 Java Binding 140 Creating a Pipe 141 Receiving Information 142 Building the Pipe 143 Advertising the Pipe 143 Discovering an Input Pipe 144 Summary 144 Chapter 11 Rendezvous Protocol 145 Rendezvous Advertisements 146 Message Propagation 146 The Java Binding 147 Dynamic Rendezvous Service Implementation 147 Finding Rendezvous Peers Dynamically 148 Connecting to Rendezvous Peers 148 Disconnecting from a Rendezvous Peer 149 Summary 150 Chapter 12 Developing a JXTA Application 151 The Basic Structure for JXTA Applications 152 Connecting to the JXTA Network 153 Viewing Peer Group Information 154 Viewing Peer Group Advertisement 155 x Contents Building a Peer to Offer Services 157 Obtaining Group Services 162 Building and Publishing the Module Class Advertisement 163 Building the Pipe Advertisement 164 Building and Publishing the Module Specification Advertisement 166 Waiting for Messages 167 Putting It All Together 168 Building a Peer for Using Services 169 Code for the Receiver Peer 170 Getting Services 175 Finding the Advertisement through Discovery 175 Building an Output Pipe 176 Sending a Message through a Pipe 177 Application Basics 177 Creating a New Peer Group 178 Creating a Peer Group ID 178 Creating a Module Implementation Advertisement 179 Creating a Group Advertisement 180 Creating a New Peer Group 180 A Peer that Discovers and Joins a New Peer Group 187 Creating a Secure Peer Group 192 Using a Membership Service Implementation 192 Changing the Default Class Implementation Advertisement 193 Code for a Secure Peer Group 194 A Secure Peer Group Advertisement 201 Becoming Authenticated 202 New Class Implementation Advertisement Details 204 Peer Group Advertisement Details 205 authenticateMe() Method Details 206 Client for the Secure Peer Group 207 Summary 207 Chapter 13 JXTA Pipes 209 Publishing and Discovering Pipes 210 Publishing 210 Discovery 210 Unicast Pipes 214 Unicast Pipes on a Local Peer 214 Remote Peers 216 UnicastSecure Pipes 218 Propagate Pipes 218 Bidirectional Pipes 225 The Bidirectional Pipe Code 225 The Bidirectional Pipe Discovery Code 229 Reliable Pipes 234 Sender Code 237 The Receiver Code 242 Summary 242 Contents xi Part III JXTA Implementation Chapter 14 Content Sharing and the Content Management Service (CMS) 243 Overview of the CMS 243 Implementing the CMS in Peers 245 Initializing the CMS 250 Sharing Content 250 Viewing the Shared Content List 251 Searching For and Getting Content 251 Summary 254 Chapter 15 Implementing Security 255 JXTA Security Toolkit 255 Building Keys 256 Secure Membership Service 263 Building a New Membership Service 264 Changing the Peer Group Creator Code 275 Secure Transport 277 JxtaUnicastSecure Pipes 277 Separately Encrypted Data 279 Summary 300 Chapter 16 Peer Monitoring and Metering 301 Finding Peers in a Group 301 Building the Peer Discovery Listener 301 Interpreting Events 302 The Discovery Code 304 Local Peers versus Remote Peers 305 Obtaining Information about a Peer 307 A Sample Application for Discovering Peers 309 Explaining the Code 315 Code Output 316 Summary 317 Chapter 17 Configuring NAT and Firewall Peers 319 The JXTA Network Topology 319 Running a Peer Behind a Firewall/NAT 320 Communication Peer Configuration 320 Gateway Configuration 323 The Discovery Peer Configuration 324 Using the Configurator’s Debug Option 326 Building a Router/Rendezvous Peer 327 Summary 330 xii Contents Chapter 18 Using Endpoints for Low-Level Communication 331 The Endpoint Service 331 Code for the Endpoint Receiving Peer 334 Code for the Endpoint Sending Peer 337 Summary 341 Chapter 19 Building a Generic Framework for Distributed Computing 343 Master Code 344 Worker Code 349 Setup 355 Work 355 Computational Code 356 Summary 358 Chapter 20 Building an Encrypted, Highly Available Storage System 359 System Architecture 359 Our Example 361 Database Schema 362 Message Schema 362 Executing the System 363 DatabasePeer 366 DatabasePeer Connectivity 372 Setup 374 Publishing a Data Input Pipe 375 Publishing a Query Bidirectional Pipe 375 Processing Input 375 BusinessPeer 377 Setup 383 Discovery 384 Processing Input 384 GatheringPeers 385 ClientPeer 386 Setup 393 Pipe Discovery 394 The Query Request 395 The Image Request 395 Summary 396 Part IV JXTA Reference Appendix A Installing JXTA and Compiling JXTA Applications 397 Installing JXTA 397 Easy Install 397 Installing on a Windows System 398 Contents xiii Installing on a Linux System 399 JXTA Libraries 399 Stable Builds 400 Daily Builds 401 Compiling the Examples 401 Windows 401 Linux 402 Running the Examples 402 Windows 402 Linux 403 JBuilder Compiling and Execution 403 Adding a New JBuilder Project 404 Appendix B JXTA API 407 Class Advertisement 407 Field Summary 408 Constructor Summary 408 Method Summary 408 Example 408 Class AdvertisementFactory 408 Method Summary 408 Class AuthenticationCredential 409 Constructor Summary 410 Method Summary 410 Example 410 Class Codat 411 Field Summary 411 Constructor Summary 411 Method Summary 411 Example 411 Class CodatID 412 Constructor Summary 412 Method Summary 412 Example 412 Interface Credential 412 Method Summary 412 Class DiscoveryEvent 413 Constructor Summary 413 Method Summary 413 Example 413 Interface DiscoveryListener 413 Method Summary 414 Example 414 Class DiscoveryQueryMsg 414 Field Summary 414 Constructor Summary 414 Method Summary 414 xiv Contents Class DiscoveryResponseMsg 415 Field Summary 415 Constructor Summary 415 Method Summary 415 Example 416 Interface DiscoveryService 416 Field Summary 416 Method Summary 417 Example 418 Interface Document 418 Method Summary 418 Example 418 Interface Element 419 Method Summary 419 Example 419 Interface EndpointAddress 419 Method Summary 419 Example 420 Class EndpointAdvertisement 420 Constructor Summary 420 Method Summary 420 Interface EndpointFilterListener
Load more

Recommended publications
  • Planning Guide
    Oracle AutoVue 20.2, Client/Server Deployment Planning Guide March 2012 Copyright © 1999, 2012, Oracle and/or its affiliates. All rights reserved. Portions of this software Copyright 1996-2007 Glyph & Cog, LLC. Portions of this software Copyright Unisearch Ltd, Australia. Portions of this software are owned by Siemens PLM © 1986-2012. All rights reserved. This software uses ACIS® software by Spatial Technology Inc. ACIS® Copyright © 1994-2008 Spatial Technology Inc. All rights reserved. Oracle is a registered trademark of Oracle Corporation and/or its affiliates. Other names may be trademarks of their respective owners. This software and related documentation are provided under a license agreement containing restrictions on use and disclosure and are protected by intellectual property laws. Except as expressly permitted in your license agreement or allowed by law, you may not use, copy, reproduce, translate, broadcast, modify, license, transmit, distribute, exhibit, perform, publish or display any part, in any form, or by any means. Reverse engineering, disassembly, or decompilation of this software, unless required by law for interoperability, is prohibited. The information contained herein is subject to change without notice and is not warranted to be error-free. If you find any errors, please report them to us in writing. If this software or related documentation is delivered to the U.S. Government or anyone licensing it on behalf of the U.S. Govern- ment, the following notice is applicable: U.S. GOVERNMENT RIGHTS Programs, software, databases, and related documentation and technical data delivered to U.S. Government customers are "com- mercial computer software" or "commercial technical data" pursuant to the applicable Federal Acquisition Regulation and agency- specific supplemental regulations.
    [Show full text]
  • Dynamic Integration of Mobile JXTA with Cloud Computing for Emergency Rural Public Health Care
    Osong Public Health Res Perspect 2013 4(5), 255e264 http://dx.doi.org/10.1016/j.phrp.2013.09.004 pISSN 2210-9099 eISSN 2233-6052 - ORIGINAL ARTICLE - Dynamic Integration of Mobile JXTA with Cloud Computing for Emergency Rural Public Health Care Rajasekaran Rajkumar*, Nallani Chackravatula Sriman Narayana Iyengar School of Computing Science and Engineering, VIT University, Vellore, India. Received: August 21, Abstract 2013 Objectives: The existing processes of health care systems where data collection Revised: August 30, requires a great deal of labor with high-end tasks to retrieve and analyze in- 2013 formation, are usually slow, tedious, and error prone, which restrains their Accepted: September clinical diagnostic and monitoring capabilities. Research is now focused on 3, 2013 integrating cloud services with P2P JXTA to identify systematic dynamic process for emergency health care systems. The proposal is based on the concepts of a KEYWORDS: community cloud for preventative medicine, to help promote a healthy rural ambulance alert alarm, community. We investigate the approaches of patient health monitoring, emergency care, and an ambulance alert alarm (AAA) under mobile cloud-based cloud, telecare or community cloud controller systems. JXTA, Methods: Considering permanent mobile users, an efficient health promotion mHealth, method is proposed. Experiments were conducted to verify the effectiveness of P2P the method. The performance was evaluated from September 2011 to July 2012. A total of 1,856,454 cases were transported and referred to hospital, identified with health problems, and were monitored. We selected all the peer groups and the control server N0 which controls N1,N2, and N3 proxied peer groups.
    [Show full text]
  • Solving Quarto with JXTA and JNGI
    Solving Quarto with JXTA and JNGI Matthew Shepherd University of Texas at Austin Abstract. This paper presents an implementation of a grid-based autonomous quarto player. The implementation uses the JNGI framework which itself is written on top of JXTA. 1 Introduction Quarto is a game reminiscent of tic-tac-toe. It is played with sixteen unique pieces on a four-by-four square board. Each piece is large or small, black or white, solid or hollow and square or round. The game begins with an empty board and all sixteen pieces available. Two players take successive turns with the first player choosing an available piece. That piece is given to the second player who places it on an empty spot on the board. The roles reverse and the process repeats. A player wins by placing the final piece in a row, column or diagonal where all four pieces have at least one attribute in common. For example, the winner might place a piece that completes a row of four black pieces or a column of four round pieces. My goal was to write an implementation of the game and an autonomous program for a human player to compete against. The program performs an exhaustive search of possible moves in order to find the most appropriate one. If the program were to perform the search on the first move of the game, the sixteen available pieces and sixteen empty squares would combine to produce a (16!)^2 search space. Eliminating the moves that take place after a game has already been won reduces that number, but a single processor would still not be sufficient to perform such a task in a reasonable amount of time.
    [Show full text]
  • Extensions of JADE and JXTA for Implementing a Distributed System
    EXTENSIONS OF JADE AND JXTA FOR IMPLEMENTING A DISTRIBUTED SYSTEM Edward Kuan-Hua Chen A THESIS SUBMITTED IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF MASTER OF APPLIED SCIENCE School of Engineering Science O Edward Kuan-Hua Chen 2005 SIMON FRASER UNIVERSITY Spring 2005 All rights reserved. This work may not be reproduced in whole or in part, by photocopy or other means, without the permission of the author. APPROVAL Edward Kuan-Hua Chen Master of Applied Science Extensions of JADE and JXTA for Implementing a Distributed System EXAMINING COMMITTEE Chair: John Jones Professor, School of Engineering Science William A. Gruver Academic Supervisor Professor, School of Engineering Science Dorian Sabaz Technical Supervisor Chief Technology Officer Intelligent Robotics Corporation Shaohong Wu External Examiner National Research Council Date Approved: April 8, 2004 SIMON FRASER UNIVERSITY PARTIAL COPYRIGHT LICENCE The author, whose copyright is declared on the title page of this work, has granted to Simon Fraser University the right to lend this thesis, project or extended essay to users of the Simon Fraser University Library, and to make partial or single copies only for such users or in response to a request from the library of any other university, or other educational institution, on its own behalf or for one of its users. The author has further granted permission to Simon Fraser University to keep or make a digital copy for use in its circulating collection. The author has further agreed that permission for multiple copying of this work for scholarly purposes may be granted by either the author or the Dean of Graduate Studies.
    [Show full text]
  • Peer-To-Peer Virtualized Services
    International Journal on Advances in Internet Technology, vol 4 no 3 & 4, year 2011, http://www.iariajournals.org/internet_technology/ 89 Peer-to-Peer Virtualized Services David Bailey and Kevin Vella University of Malta Msida, Malta Email: [email protected], [email protected] Abstract—This paper describes the design and operation advance a rethink of general purpose operating system of a peer-to-peer framework for providing, locating and architecture. consuming distributed services that are encapsulated within The performance hit commonly associated with virtual- virtual machines. We believe that the decentralized nature of peer-to-peer networks acting in tandem with techniques such ization has been partly addressed on commodity computers as live virtual machine migration and replication facilitate by recent modifications to the x86 architecture [3], with both scalable and on-demand provision of services. Furthermore, AMD and Intel announcing specifications for integrating the use of virtual machines eases the deployment of a wide IOMMUs (Input/Output Memory Management Units) with range of legacy systems that may subsequently be exposed upcoming architectures. While this largely resolves the issue through the framework. To illustrate the feasibility of running distributed services within virtual machines, several computa- of computational slow-down and simplifies hypervisor de- tional benchmarks are executed on a compute cluster running sign, virtualized I/O performance will remain mostly below our framework, and their performance characteristics are par until I/O devices are capable of holding direct and evaluated. While I/O-intensive benchmarks suffer a penalty concurrent conversations with several virtual machines on due to virtualization-related limitations in the prevailing I/O the same host.
    [Show full text]
  • Open Source Software Packages
    Hitachi Ops Center V. 10.3.1 Open Source Software Packages Contact Information: Hitachi Ops Center Project Manager Hitachi Vantara LLC 2535 Augustine Drive Santa Clara, California 95054 Name of Product/Product Version License Component aesh 2.4 Apache License, Version 2.0 aesh Extensions 1.8 Apache License, Version 2.0 aesh Readline 2.0 Apache License, Version 2.0 aesh Terminal API 2.0 Apache License, Version 2.0 @angular-builders/custom- 8.0.0-RC.0 The MIT License webpack @angular-devkit/build-angular 0.800.0-rc.2 The MIT License @angular-devkit/build-angular 0.803.25 The MIT License @angular-devkit/core 7.3.8 The MIT License @angular-devkit/schematics 7.3.8 The MIT License @angular/animations 7.2.15 The MIT License @angular/animations 8.2.14 The MIT License @angular/cdk 7.3.7 The MIT License Name of Product/Product Version License Component @angular/cli 8.0.0 The MIT License @angular/cli 8.3.25 The MIT License @angular/common 7.2.15 The MIT License @angular/common 8.2.14 The MIT License @angular/compiler 7.2.15 The MIT License @angular/compiler 8.2.14 The MIT License @angular/compiler-cli 8.2.14 The MIT License @angular/core 7.2.15 The MIT License @angular/forms 7.2.13 The MIT License @angular/forms 7.2.15 The MIT License @angular/forms 8.2.14 The MIT License @angular/forms 8.2.7 The MIT License @angular/language-service 8.2.14 The MIT License @angular/platform-browser 7.2.15 The MIT License @angular/platform-browser 8.2.14 The MIT License Name of Product/Product Version License Component @angular/platform-browser- 7.2.15 The MIT License
    [Show full text]
  • Decentralized Grid Services on P2P Networks: a Case Study
    Decentralized Grid Services on P2P Networks: A Case Study FREDRIK SÖDERSTRÖM Master of Science Thesis Stockholm, Sweden 2005 IMIT/LECS-2005-05 Decentralized Grid Services on P2P Networks: A Case Study FREDRIK SÖDERSTRÖM Exam iner Assoc. Prof. Vladim ir Vlassov (IM IT/KTH) Master of Science Thesis Stockholm, Sweden 2005 IMIT/LECS-2005-05 Abstract Computers have been connected to networks for a long time. Traditional networks usually provide only simple services. To keep up with the ever- increasing demand for computing resources, like processing power and storage, there is a need to leverage more power from existing networks. One way of managing all resources of large networks, and letting multiple organizations share these resources with each other, is called Grid comput- ing. In this thesis, we examine one of the services that is necessary for a Grid, namely resource discovery, a mechanism for finding the available re- sources on a network. Resource discovery services are often designed to rely on some kind of central repository where all resources must be regis- tered. But this approach does not work well in very large networks, be- cause the central repository will become a bottleneck. Resource discovery can also be decentralized, and we suggest that it should be built on peer-to- peer technology to achieve maximum scalability. Using JXTA, a peer-to- peer platform, and the Globus Toolkit for Grid services, we create and evaluate a prototype implementation of a distributed discovery service. Acknowledgments I would like to thank my father, Håkan Söderström, for helping me with a number of bugs and reading drafts of the report.
    [Show full text]
  • CA Server Automation Release Notes, See the Bookshelf at CA Support Online
    CA Server Automation Release Notes Release 12.8 This Documentation, which includes embedded help systems and electronically distributed materials, (hereinafter referred to as the “Documentation”) is for your informational purposes only and is subject to change or withdrawal by CA at any time. This Documentation may not be copied, transferred, reproduced, disclosed, modified or duplicated, in whole or in part, without the prior written consent of CA. This Documentation is confidential and proprietary information of CA and may not be disclosed by you or used for any purpose other than as may be permitted in (i) a separate agreement between you and CA governing your use of the CA software to which the Documentation relates; or (ii) a separate confidentiality agreement between you and CA. Notwithstanding the foregoing, if you are a licensed user of the software product(s) addressed in the Documentation, you may print or otherwise make available a reasonable number of copies of the Documentation for internal use by you and your employees in connection with that software, provided that all CA copyright notices and legends are affixed to each reproduced copy. The right to print or otherwise make available copies of the Documentation is limited to the period during which the applicable license for such software remains in full force and effect. Should the license terminate for any reason, it is your responsibility to certify in writing to CA that all copies and partial copies of the Documentation have been returned to CA or destroyed. TO THE EXTENT PERMITTED BY APPLICABLE LAW, CA PROVIDES THIS DOCUMENTATION “AS IS” WITHOUT WARRANTY OF ANY KIND, INCLUDING WITHOUT LIMITATION, ANY IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, OR NONINFRINGEMENT.
    [Show full text]
  • Project JXTA Technology Overview
    PPrroojjeecctt JXTJXTAA TTeecchhnnoollooggyy OOveverrvviieeww Dr Simon See Technical Director Asia Pacific Science & Technology Center www.jxta.org Sun Microsystems Inc. The Time Is Right for P2P and Project JXTA Peer-to-Peer (P2P) is not new. However, the time is now right for the broad P2P applications deployment. The Project JXTA technology lets developers build and deploy P2P solutions more quickly. Topics • Peer-to-Peer computing • Project JXTA technology • Project JXTA today • Future directions What Is Peer-to-Peer (P2P)? • P2P covers a wide range of applications… – Sharing files, distributed search and indexing – Sharing CPU and storage resources – Instant messaging & devices communicating together – Collaborative work (and games) – Web services – New forms of content distribution, sharing, and delivery • P2P is not… – New or a specific architecture, technology, business model, or market – About eliminating servers or centralized services PP22PP iiss aabboouutt aannyy ddeevviiccee eeaassiillyy ccoonnnneeccttiinngg ““ddiirreeccttllyy”” ttoo ootthheerr ddeevviicceess ttoo eennaabbllee aa mmoorree ccooooppeerraattiivvee,, oorr ssoocciiaall,, ssttyyllee ooff ccoommppuuttiinngg.. P2P Makes Sense Now • More people connected, more Network Computing Explosion data generated Everythiing that touches • More nodes on the Internet the network iis growiing Devices and wireless Web at an exponential rate Data • More bandwidth available Users Services • More computing power Transactions Bandwidth available (disk, memory, CPU) Use of the Network/
    [Show full text]
  • Java Everywhere
    Java Everywhere Simon Ritter Technology Evangelist Sun Microsystems, Inc. Agenda ● Data & Web Services ● The Sun Java Enterprise System ● Future Directions For Java – Ease of Development ● Summary Things - 1014 Embedded Computers Waves of the Internet 11 10 TThheerrmmoossttatatss CCararss Switches Computers TVs 8 Packages 10 PPhohoneness GGamameess Clothes Desktops Clients Functions Transfers Transactions Content Telemetry CControol IP v4 IP Layer IP v6 Protocols Organization Things - 1014 Embedded Computers Waves of the Internet 11 10 Thermostats CCararss SSwwiittcchehess Computers TVs 8 Packages 10 PPhohoneness GGamameess Clothes Desktops Clients Functions Transfers Transactions Content Telemetry Control IP v4 IP Layer IP v6 Protocols FTP SMTP X RMI/IIOP RPC/XDR Identity LDAP Identity Organization Telnet HTTP SOAP Jini Client/Server UDDI JXTA N-tier Web Applications Web Polyarchical Services FFrracacttalal Auto-ID/RFID: The New Barcode ● Radio Frequency Identity Tags ● Data can be changed ● No line of site required ● 96-bits is plenty of storage Lots Of Possibilities... ● Supply chain management ● Parcel tracking ● Refrigerator/oven ● Washing machine ● Personalised advertising ● Use your imagination... Three “Laws” of Computing ● Moore's Law – Computing power doubles every 18 months ● Gilder's Law – Network bandwidth capacity doubles every 12 months ● Metcalfe's Law (Net Effect) – Value of network increases exponentially as number of participants increases Platform Evolution The Network The Computer Is Network of Catch Is the Computer Legacy to the Embedded Network Phrase Objects the Web Network Things of Things Scale 100s 1,000s 1,000,000s 10,000,000s 100,000,000s 100,000,000s When/Peak 1984/1987 1990/1993 1996/1999 2001/2003 1998/2004 2004/2007 Leaf X X +HTTP +XML +RM Unknown Protocol(s) (+JVM) Portal Directory(s) NS, NS+ +CDS +LDAP(*) +UDDI +Jini +? Session RPC, XDR +CORBA +CORBA, +SOAP, +RM/Jini +? RM XML Schematic Design Patterns: Web Service Bus.
    [Show full text]
  • Edge-Based Network Attack Detection Using Apache Pulsar
    Volume 5, Issue 8, August – 2020 International Journal of Innovative Science and Research Technology ISSN No:-2456-2165 Edge Based Network Attack Detection Using Pulsar Sheetal Dash IJISRT20AUG624 www.ijisrt.com 1501 Volume 5, Issue 8, August – 2020 International Journal of Innovative Science and Research Technology ISSN No:-2456-2165 ABSTRACT The edge-based network attacks are increasing largely in size, scale and frequency with the booming internet. The Distributed Denial of Service (DDoS) attacks is one of the most diffused types of attacks in the cyberworld which is a great concern for all organizations today. There were 5.2 billion Google searches in the year 2017 alone. Research shows that there cannot be a better example to show how prevalent internet use is nowadays. What started off as a point to point conversation in 1970s as a mode of communication has expanded to millions and millions of devices communicating with each other via some or the other form of the web. And therefore, this research focuses on the strategic approach that has been taken to defend from the growing cyber threat. In this dissertation, the focus is on defending against these edge-based network attacks and collaborating with other neighboring networks in order to communicate with them to transfer information about potentially malicious hosts. This research has focused on exploring ways of integrating the Software Defined Networking with the pub-sub messaging system in order to show a collaborative approach of defense to these attacks. The attacks from unknown multiple sources have also been analyzed in order to cope with them through this robust solution that has been proposed and implemented in this dissertation.
    [Show full text]
  • Extending JXTA for P2P File Sharing Systems
    Extending JXTA for P2P File Sharing Systems Bhanu Krushna Rout(10506012) Smrutiranjan Sahu(10506034) Department of Computer Science and Engi nee ring National Institute of Technology Rourkel a Rourkela-769 008, Orissa, India Extending JXTA for P2P File Sharing Systems Thesis submitted in partial fulfillment of the requirements for the degree of Bachelor of Technology in Computer Science and Engineering by Bhanu Krushna Rout(10506012) Smrutiranjan Sahu(10506034) under the guidance of Prof. Sujata Mohanty Department of Computer Science and Engi nee ring National Institute of Technology Rourkel a Rourkela-769 008, Orissa, India May 2009 Department of Computer Science and Engineering National Institute of Technology Rourkela Rourkela-769 008, Orissa, India. Certifica te This is to certify that the work in the thesis entitled Extending JXTA for P2P File Sharing Systems , submitted by Smrutiranjan Sahu and Bhanukrushna Rout is a record of an original research work carried out by them under our supervision and guidance in partial fulfillment of the requirements for the award of the degree of Bachelor of Technology in Computer Sci ence and Engineering during the session 2008–2009 in the department of Computer Science and Engineering, National Institute of Technology Rourkela(Deemed University). Neither this thesis nor any part of it has been submitted for any degree or academic award elsewhere. HOD Prof Sujata Mohanty Department of CSE Department of CSE NIT Rourkela NIT Rourkela Place: NIT Rourkela Place: NIT Rourkela Date: Date: Signature of External Acknowledgement We express our sincere gratitude to Sujata Mohanty Professor Department of Computer science and Engineering, National Institute of Technology, Rourkela, for her valuable guidance and timely suggestions during the entire duration of our project work, without which this work would not have been possible.
    [Show full text]