1/25/2000 Active Names: Flexible Location and Transport of Wide-Area Resources Luis Rivera.

Slides:



Advertisements
Similar presentations
1 Dynamic Proxies Explained Simply. 2 Dynamic Proxies License Copyright © 2008 Ciaran McHale. Permission is hereby granted, free of charge, to any person.
Advertisements

웹 서비스 개요.
Why am I here Development techniques are headed down the wrong path! Our world should be getting simpler – it is not The solutions that will solve the.
P2P data retrieval DHT (Distributed Hash Tables) Partially based on Hellerstein’s presentation at VLDB2004.
Jaringan Informasi Pengantar Sistem Terdistribusi oleh Ir. Risanuri Hidayat, M.Sc.
EXTENSIBILITY, SAFETY AND PERFORMANCE IN THE SPIN OPERATING SYSTEM B. Bershad, S. Savage, P. Pardyak, E. G. Sirer, D. Becker, M. Fiuczynski, C. Chambers,
An Engineering Approach to Computer Networking
Technical Architectures
OCT1 Principles From Chapter One of “Distributed Systems Concepts and Design”
EEC-681/781 Distributed Computing Systems Lecture 3 Wenbing Zhao Department of Electrical and Computer Engineering Cleveland State University
©Silberschatz, Korth and Sudarshan1.1Database System Concepts Chapter 1: Introduction Purpose of Database Systems View of Data Data Models Data Definition.
CS CS 5150 Software Engineering Lecture 13 System Architecture and Design 1.
CS CS 5150 Software Engineering Lecture 13 System Architecture and Design 1.
Managing Agent Platforms with the Simple Network Management Protocol Brian Remick Thesis Defense June 26, 2015.
1 Lecture 8: Naming l Challenge: how do we efficiently locate wide area resources? n Naming: name -> IP address n Routing: IP address -> packet delivery.
1 Personal Activity Coordinator (PAC) Xia Hong UC Berkeley ISRG retreat 1/11/2000.
Tcl Agent : A flexible and secure mobile-agent system Paper by Robert S. Gray Dartmouth College Presented by Vipul Sawhney University of Pennsylvania.
UCB Communication Networks: Big Picture Jean Walrand U.C. Berkeley
DNS: Revising the Current Protocol Matt Gustafson Matt Weaver CS522 Computer Communications University of Colorado, Colorado Springs.
1 Web Content Delivery Reading: Section and COS 461: Computer Networks Spring 2007 (MW 1:30-2:50 in Friend 004) Ioannis Avramopoulos Instructor:
Content Networking - CON Content Overlay Network Vishal Kumar Singh Eilon Yardeni April, 28 th 2005.
Distributed Systems Architecture Presentation II Presenters Rose Kit & Turgut Tezir.
Distributed Systems: Client/Server Computing
Web Cache. Introduction what is web cache?  Introducing proxy servers at certain points in the network that serve in caching Web documents for faster.
Web Server Load Balancing/Scheduling Asima Silva Tim Sutherland.
10/02/2004ELFms meeting1 Linux Virtual Server Miroslav Siket FIO-FS.
Distributed Computing COEN 317 DC2: Naming, part 1.
Ch4: Distributed Systems Architectures. Typically, system with several interconnected computers that do not share clock or memory. Motivation: tie together.
Active Network Applications Tom Anderson University of Washington.
Locating objects identified by DDI3 Uniform Resource Names Part of Session: Concurrent B2: Reports and Updates on DDI activities 2nd Annual European DDI.
Chapter 16 – DNS. DNS Domain Name Service This service allows client machines to resolve computer names (domain names) to IP addresses DNS works at the.
Introduction to Networking Concepts. Introducing TCP/IP Addressing Network address – common portion of the IP address shared by all hosts on a subnet/network.
5.1 Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved DISTRIBUTED.
International Telecommunication Union Geneva, 9(pm)-10 February 2009 ITU-T Security Standardization on Mobile Web Services Lee, Jae Seung Special Fellow,
Comparison of Web Services, RMI, CORBA, DCOM Usha, Lecturer MCA Department of Computer Science and Engineering.
Distributed Computing COEN 317 DC2: Naming, part 1.
Web Services based e-Commerce System Sandy Liu Jodrey School of Computer Science Acadia University July, 2002.
Management for IP-based Applications Mike Fisher BTexaCT Research
Crowds: Anonymity for Web Transactions Michael K. Reiter Aviel D. Rubin Jan 31, 2006Presented by – Munawar Hafiz.
DBAS: A Deployable Bandwidth Aggregation System Karim Habak†, Moustafa Youssef†, and Khaled A. Harras‡ †Egypt-Japan University of Sc. and Tech. (E-JUST)
Middleware for FIs Apeego House 4B, Tardeo Rd. Mumbai Tel: Fax:
Jan 30, 2001CSCI {4,6}900: Ubiquitous Computing1 Announcements Project Milestone 2 due today. Undergraduate projects should have 3 students per project.
Distributed Information Systems. Motivation ● To understand the problems that Web services try to solve it is helpful to understand how distributed information.
CS CS 5150 Software Engineering Lecture 13 System Architecture and Design 1.
Distribution and components. 2 What is the problem? Enterprise computing is Large scale & complex: It supports large scale and complex organisations Spanning.
1 Choices “Our object-oriented system architecture embodies the notion of customizing operating systems to tailor them to support particular hardware configuration.
Tussle in Cyberspace: Defining Tomorrow’s Internet Presented by: Khoa To.
Security Vulnerabilities in A Virtual Environment
Protocol Requirements draft-bryan-p2psip-requirements-00.txt D. Bryan/SIPeerior-editor S. Baset/Columbia University M. Matuszewski/Nokia H. Sinnreich/Adobe.
Seminar on Service Oriented Architecture Distributed Systems Architectural Models From Coulouris, 5 th Ed. SOA Seminar Coulouris 5Ed.1.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved DISTRIBUTED SYSTEMS.
CS 6401 Overlay Networks Outline Overlay networks overview Routing overlays Resilient Overlay Networks Content Distribution Networks.
/ Fast Web Content Delivery An Introduction to Related Techniques by Paper Survey B Li, Chien-chang R Sung, Chih-kuei.
Distributed Server Scheduler Eyal Serero Alex Fishgate Supervisor : Vitaly Suchin.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved DISTRIBUTED SYSTEMS.
Cofax Scalability Document Version Scaling Cofax in General The scalability of Cofax is directly related to the system software, hardware and network.
Multicast in Information-Centric Networking March 2012.
System Architecture CS 560. Project Design The requirements describe the function of a system as seen by the client. The software team must design a system.
Web Server Load Balancing/Scheduling
Web Server Load Balancing/Scheduling
Alternatives to Mobile Agents
Improving searches through community clustering of information
Domain Name System (DNS)
Distribution and components
Chapter 9: The Client/Server Database Environment
HWP2 – Distributed search
Outline Review of Quiz #1 Distributed File Systems 4/20/2019 COP5611.
An Engineering Approach to Computer Networking
Presentation transcript:

1/25/2000 Active Names: Flexible Location and Transport of Wide-Area Resources Luis Rivera

1/25/2000 Luis Rivera Outline Motivation Active Names »Definition »Goals »Architecture Conclusions Related Work Discussion »In case something had not been discussed yet!

1/25/2000 Luis Rivera Motivation Problem »Mobile computing and modern web applications does not fit well into the static DNS scheme »Need for rapid deployment and extensibility of Internet services Solutions »Active Networks »Active Services »Active Cache »Smart Clients »Active Routing »Active Names!!!

1/25/2000 Luis Rivera Active Names Name »Chain of programs to resolve and reply »The name is ACTIVE: “There is not second step to request the service after name resolution”. R RR R RR R R CS

1/25/2000 Luis Rivera Architecture Goals Namespace should be »Customizable –Clients and services customize their namespaces »Extensible –Add functionality without modifying the architecture »Composible Efficient use of network resources Location independence resolution »The chain of programs should not be linked to fixed locations Discussion »Efficiency through extensibility! »Extensibility through naming!

1/25/2000 Luis Rivera Resolution Active chain mechanisms »Delegation »CPS  Continuation Passing Style Resolvers »Located in strategic points in the network R R R CS Name Namespace program Partially Solved Name Next Namespace program After Method Service Reply After Method list Solved Name Service Request Service Reply

1/25/2000 Luis Rivera Active Name Programs Microkernel approach Resolvers must provide »A loader to fetch namespace programs »Security for untrusted code (Java-2) »Local soft state »Communication interfaces Bootstrap »Some initial programs are loaded onto each Active Name machine Discussion »This works at the service level, we still need DNS right? »With different services in the same machine, who dictates security and resource access policies?

1/25/2000 Luis Rivera Namespace A namespace is a program Locates data and resources Hierarchically organized »Root interprets all names »Each namespace can interpret a name according to its own rules »Those rules are set by the owner of that portion of the namespace Discussion »Namespace boundaries are fuzzy! »How scalable is this architecture?

1/25/2000 Luis Rivera After Methods and API After methods »Multi-way RPC based on distributed CPS »The remaining work of the namespace is prepended to the After Method list »The list represents the way to follow back to the client API »Partially resolved name »Reference to the data stream »List of after methods The framework support legacy applications

1/25/2000 Luis Rivera Active Names Principles Extensibility »Functionality can be added as needed »Example: Replicated Service Access Location Independence »A name does not reveal the location of the service »Example: Image Distiller Composibility »Combination of client and server extensions to improve service performance »Example: Web caching

1/25/2000 Luis Rivera Performance Replicated Service »DNS Round Robin: Best performance at low load. »Distributed Director: Best performance high load. »Active Names –Technique: Selection is biased by the number of hops and a decaying histogram of previous performance. –Best performance overall Distiller »Server: Worse performance when server is loaded »Proxy: Overall good performance in both cases »Active Names: –Technique: Selection biased by end-to-end distillation cost. –Best performance in most of the cases

1/25/2000 Luis Rivera Performance (cont…) Data on Table 1 is interesting »Justify composibility? Test »Analysis of server-initiated and client-initiated customizations »Distillation implements client-initiated customizations »Combination of server and client customizations –Better than distillation only by 50% –Better than server-only by 104% Discussion »In all these examples, the client is mobile and the service is static »Does this represents a solution the applications of tomorrow?

1/25/2000 Luis Rivera Related Work TP monitors (Transaction Processing monitors) »“A Swiss Army knife of tools reflecting the particular holes in the surrounding system” Intentional Naming System (INS) »Applications specify what they are looking for, not where to locate them. Ninja project Smart Clients Active Caches

1/25/2000 Luis Rivera Conclusions Active names »Programs that resolve the name and retrieve the reply from the requested service The Active names framework support »Extensibility »Location-independence »Composibility The experiments showed a significant performance gain using the Active Name extensions »Even with the use of Java to code the programs.

1/25/2000 Luis Rivera Discussion Good or bad? »I think is a cool idea !!! Where these experiments enough? What could happened with a very long chain of active names? Is this a solution for a really mobile environment where services are not fixed? How scalable is this framework? »They say that several thousands, but where are they justifying it?