Copyright © 1995-2009 Clifford Neuman - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE Advanced Operating Systems Lecture notes Dr.

Slides:



Advertisements
Similar presentations
What Is an Ad Hoc Network?
Advertisements

Dr. Kalpakis CMSC621 Advanced Operating Systems Naming.
Naming Computer Engineering Department Distributed Systems Course Asst. Prof. Dr. Ahmet Sayar Kocaeli University - Fall 2014.
Active Directory: Final Solution to Enterprise System Integration
Univ. of TehranDistributed Operating Systems1 Advanced Operating Systems University of Tehran Dept. of EE and Computer Engineering By: Dr. Nasser Yazdani.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved DISTRIBUTED SYSTEMS.
Name Services Jessie Crane CPSC 550. History ARPAnet – experimental computer network (late 1960s) hosts.txt – a file that contained all the information.
Copyright © Clifford Neuman - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE CS582: Distributed Systems Lecture 19 - November.
Computer Science Lecture 9, page 1 CS677: Distributed OS Today: Naming Names are used to share resources, uniquely identify entities and refer to locations.
NamingCS-4513, D-Term Naming CS-4513 Distributed Computing Systems (Slides include materials from Operating System Concepts, 7 th ed., by Silbershatz,
CSCI 4550/8556 Computer Networks Comer, Chapter 19: Binding Protocol Addresses (ARP)
OCT1 Principles From Chapter One of “Distributed Systems Concepts and Design”
Distributed Systems CS Naming – Part II Lecture 6, Sep 26, 2011 Majd F. Sakr, Vinay Kolar, Mohammad Hammoud.
Copyright © Clifford Neuman - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE USC CSci599 Trusted Computing Lecture Six –
A Data Resolver Architecture for Discovering Pervasive Data Sources Matthew Denny Database Group U.C. Berkeley.
Reliable Distributed Systems Naming (Communication Basics Part II) Slide set based on one by Prof. Paul Francis, Cornell University. Updated by Bina Ramamurthy.
NamingCS-4513, D-Term Naming CS-4513 Distributed Computing Systems (Slides include materials from Operating System Concepts, 7 th ed., by Silbershatz,
Copyright © Clifford Neuman - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE Distributed Systems Shahab Baqai Lahore University.
Naming Names in computer systems are used to share resources, to uniquely identify entities, to refer to locations and so on. An important issue with naming.
Hands-On Microsoft Windows Server 2008 Chapter 8 Managing Windows Server 2008 Network Services.
Distributed Computing COEN 317 DC2: Naming, part 1.
Database System Concepts and Architecture Lecture # 3 22 June 2012 National University of Computer and Emerging Sciences.
Ch-9: NAME SERVICES By Srinivasa R. Gudipati. To be discussed.. Fundamentals of Naming Services Naming Resolution The Domain Name System (DNS) Directory.
Computer Science Lecture 9, page 1 CS677: Distributed OS Today: Naming Names are used to share resources, uniquely identify entities and refer to locations.
4/11/06Tuesday Seminar1 The State of Service Discovery Jeff Pang.
COMP 410 & Sky.NET May 2 nd, What is COMP 410? Forming an independent company The customer The planning Learning teamwork.
IT 351 Mobile &Wireless Computing Semester 2, Dr. Hala Mokhtar Room 79- 2nd floor.
5.1 Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved DISTRIBUTED.
1 School of Computer, National University of Defense Technology A Profile on the Grid Data Engine (GridDaEn) Xiao Nong
Naming Chapter 4.
Distributed Computing COEN 317 DC2: Naming, part 1.
© Oxford University Press 2011 DISTRIBUTED COMPUTING Sunita Mahajan Sunita Mahajan, Principal, Institute of Computer Science, MET League of Colleges, Mumbai.
Copyright © Clifford Neuman and Dongho Kim - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE Advanced Operating Systems Lecture.
IT 351 Mobile &Wireless Computing Semester 1, Dr. Hala Mokhtar Room th floor.
Copyright © Clifford Neuman - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE Advanced Operating Systems Lecture notes Dr.
Univ. of TehranDistributed Operating Systems1 Advanced Operating Systems University of Tehran Dept. of EE and Computer Engineering By: Dr. Nasser Yazdani.
Copyright © Clifford Neuman and Dongho Kim - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE Advanced Operating Systems Lecture.
Introduction Infrastructure for pervasive computing has many challenges: 1)pervasive computing is a large aspect which includes hardware side (mobile phones,portable.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved DISTRIBUTED SYSTEMS.
Scalable Content- Addressable Networks Prepared by Kuhan Paramsothy March 5, 2007.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved DISTRIBUTED SYSTEMS.
Copyright © Clifford Neuman and Dongho Kim - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE Advanced Operating Systems Lecture.
1. Outline  Introduction  Different Mechanisms Broadcasting Multicasting Forward Pointers Home-based approach Distributed Hash Tables Hierarchical approaches.
Copyright © Clifford Neuman and Dongho Kim - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE Advanced Operating Systems Lecture.
Copyright © Clifford Neuman and Dongho Kim - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE Advanced Operating Systems Lecture.
Object storage and object interoperability
The Personal Server Changing the Way We Think About Ubiquitous Computing Roy Want, et al. / Intel Research UBICOMP 2002 Nov Seungjae Lee
Introduction to Active Directory
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved DISTRIBUTED SYSTEMS.
Naming CSCI 6900/4900. Mounting Mounting – Merging different namespaces transparently File system example –Directory node of one namespace stores identifier.
Lecture 9: Name and Directory Servers CDK4: Chapter 9 CDK5: Chapter 13 TVS: Chapter 5.
Naming CSCI 6900/4900. Names & Naming System Names have unique importance –Resource sharing –Identifying entities –Location reference Name can be resolved.
Active Directory Domain Services (AD DS). Identity and Access (IDA) – An IDA infrastructure should: Store information about users, groups, computers and.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved DISTRIBUTED SYSTEMS.
Week-3 (Lecture-1). Some Important internet terms: Archie : A program used to search files at FTP sites. There are currently 30 Archie servers in the.
Advanced Operating Systems Lecture notes
Advanced Operating Systems Lecture notes
Mobile &Wireless Computing
CHAPTER 3 Architectures for Distributed Systems
Naming Chapter 4.
Lecture 7: Name and Directory Servers
Lecture 7: Name and Directory Servers
Distributed Systems Bina Ramamurthy 12/2/2018 B.Ramamurthy.
Lecture 8: Name and Directory Servers
Bina Ramamurthy Chapter 9
Distributed Systems CS
Distributed Systems CS
Distributed Systems CS
Bina Ramamurthy Chapter 9
Bina Ramamurthy Chapter 9
Presentation transcript:

Copyright © Clifford Neuman - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE Advanced Operating Systems Lecture notes Dr. Clifford Neuman University of Southern California Information Sciences Institute

Copyright © Clifford Neuman - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE CSci555: Advanced Operating Systems Lecture 4 – September Naming and Binding Dr. Clifford Neuman University of Southern California Information Sciences Institute

Copyright © Clifford Neuman - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE Naming Concepts  Name  What you call something  Address  Where it is located  Route  How one gets to it  But it is not that clear anymore, it depends on perspective. A name from one perspective may be an address from another.  Perspective means layer of abstraction What is ?

Copyright © Clifford Neuman - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE What are the things we name  Users  To direct, and to identify  Hosts (computers)  High level and low level  Services  Service and instance  Files and other “objects”  Content and repository  Groups  Of any of the above

Copyright © Clifford Neuman - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE How we name things  Host-Based Naming  Host-name is required part of object name  Global Naming  Must look-up name in global database to find address  Name transparency  User/Object Centered Naming  Namespace is centered around user or object  Attribute-Based Naming  Object identified by unique characteristics  Related to resource discovery / search / indexes

Copyright © Clifford Neuman - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE Namespace  A name space maps:     X  O At a particular point in time.  The rest of the definition, and even some of the above, is open to discussion/debate.  What is a “flat namespace”  Implementation issue

Copyright © Clifford Neuman - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE Case Studies  Host Table  Flat namespace (?)  Global namespace (?)  Domain name system  Arbitrary depth  Iterative or recursive(chained) lookup  Multi-level caching  Grapevine Grapevine  Two-level, iterative lookup  Clearinghouse 3 level GetHostByName(usc.arpa){ scan(host file); return(matching entry); } GetHostByName(host. sc) es gv sc

Copyright © Clifford Neuman - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE Domain Name System edu usc isi veneraaludra Iterative query Lookup(venera.isi.edu) 1 2 3

Copyright © Clifford Neuman - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE Caching in the Domain Name System cache edu usc isi venera cache aludra Chained query Lookup(venera.isi.edu) 1a 23 4

Copyright © Clifford Neuman - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE Scalability of naming  Scalability  Ability to continue to operate efficiently as a system grows large, either numerically, geographically, or administratively.  Affected by  Frequency of update  Granularity  Evolution/reconfiguration  DNS characteristics  Multi-level implementation  Replication of root and other servers  Multi-level caching

Copyright © Clifford Neuman - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE Closure  Closure binds an object to the namespace within which names embedded in the object are to be resolved.  “Object” may as small as the name itself  GNS binds the names to namespaces  Prospero binds enclosing object to multiple namespaces  Tilde and quicksilver bind users to namespaces  NFS mount table constructs system centered namespace  Movement of objects can cause problems  When closure is associated with wrong entity

Copyright © Clifford Neuman - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE Other implementations of naming  Broadcast  Limited scalability, but faster local response  Prefix tables  Essentially a form of caching  Capabilities  Combines security and naming  Traditional name service built over capability based addresses

Copyright © Clifford Neuman - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE Advanced Name Systems  DEC’s Global Naming  Support for reorganization the key idea  Little coordination needed in advance  Half Closure  Names are all tagged with namespace identifiers  DID - Directory Identifier  Hidden part of name - makes it global  Upon reorganization, new DID assigned  Old names relative to old root  But the DID’s must be unique - how do we assign?

Copyright © Clifford Neuman - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE Prospero Directory Service  Multiple namespace centered around a “root” node that is specific to each namespace.  Closure binds objects to this “root” node.  Layers of naming  User level names are “object” centered  Objects still have an address which is global  Namespaces also have global addresses  Customization in Prospero  Filters create user level derived namespaces on the fly  Union links support merging of views

Copyright © Clifford Neuman - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE Resource Discovery  Similar to naming  Browsing related to directory services  Indexing and search similar to attribute based naming  Attribute based naming  Profile  Multi-structured naming  Search engines  Computing resource discovery

Copyright © Clifford Neuman - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE The Web  Object handles  Uniform Resource Identifier (URI’s)  Uniform Resource Locators (URL’s)  Uniform Resource Names (URN’s)  XML  Definitions provide a form of closure  Conceptual level rather than the “namespace” level.

Copyright © Clifford Neuman - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE LDAP  Manage information about users, services  Lighter weight than X.500 DAP  Heavier than DNS  Applications have conventions on where to look  Often data is duplicated because of multiple conventions  Performance enhancements not as well defined  Caching harder because of less constrained patterns of access

Copyright © Clifford Neuman - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE CSci555: Advanced Operating Systems Lecture 5 – September ADVANCE SLIDES (These slides WILL change) Dr. Clifford Neuman University of Southern California Information Sciences Institute

Copyright © Clifford Neuman - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE New Computing Environments  Ubiquitous and Pervasive Computing  Including Sensor Nodes  Managing Devices  Mobile computing  Portable Devices

Copyright © Clifford Neuman - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE Characteristics  Low power availability  Constrained resources  Transient relationships  Ad-hoc deployment  Peer to Peer relationships  Weakly managed

Copyright © Clifford Neuman - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE Ubiquitous computing  According to Mark Weiser at Xerox:  Transparent computing is the ultimate goal  Computers should disappear into the background  Computation becomes part of the environment

Copyright © Clifford Neuman - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE Ubiquitous Computing  Computing everywhere  Desktop, Laptop, Palmtop  Cars, Cell phones  Shoes, Clothing, Walls (paper / paint)  Connectivity everywhere  Broadband  Wireless  Mobile everywhere  Users move around  Disposable devices

Copyright © Clifford Neuman - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE Ubiquitous Computing  Structure  Resource and service discovery critical  User location an issue  Interface discovery  Disconnected operation  Ad-hoc organization  Security  Small devices with limited power  Intermittent connectivity  Agents  Sensor Networks

Copyright © Clifford Neuman - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE Mobile Computing  Often managed devices  Cell phones  PDA’s  Subscription Services

Copyright © Clifford Neuman - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE Ad-hoc Networking  Peer-to-peer of network routing  Transient devices  Issues:  Discovery  Security  Power  Examples:  Many Sensor Networks

Copyright © Clifford Neuman - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE CSci555: Advanced Operating Systems Lecture 5 – September Ubiquitous and Mobile Computing Dr. Clifford Neuman University of Southern California Information Sciences Institute

Copyright © Clifford Neuman - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE New Computing Environments  Ubiquitous and Pervasive Computing  Including Sensor Nodes  Managing Devices  Mobile computing  Portable Devices

Copyright © Clifford Neuman - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE Characteristics  Low power availability  Constrained resources  Transient relationships  Ad-hoc deployment  Peer to Peer relationships  Weakly managed  Context aware

Copyright © Clifford Neuman - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE Ubiquitous computing  According to Mark Weiser at Xerox:  Transparent computing is the ultimate goal  Computers should disappear into the background  Computation becomes part of the environment

Copyright © Clifford Neuman - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE Ubiquitous Computing  Computing everywhere  Desktop, Laptop, Palmtop  Cars, Cell phones  Shoes, Clothing, Walls (paper / paint)  Connectivity everywhere  Broadband  Wireless  Mobile everywhere  Users move around  Disposable devices

Copyright © Clifford Neuman - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE Ubiquitous Computing  Structure  Resource and service discovery critical  User location an issue  Interface discovery  Disconnected operation  Ad-hoc organization  Security  Small devices with limited power  Intermittent connectivity  Agents  Sensor Networks

Copyright © Clifford Neuman - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE Mobile Computing  Often managed devices  Cell phones  PDA’s  Subscription Services

Copyright © Clifford Neuman - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE Ad-hoc Networking  Peer-to-peer of network routing  Transient devices  Issues:  Discovery  Security  Power  Examples:  Many Sensor Networks

Copyright © Clifford Neuman - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE Communication/Computation Technology Projection Assume: 10kbit/sec. Radio, 10 m range. Large cost of communications relative to computation continues (source – talk by Deborah Estrin) Source: ISI & DARPA PAC/C Program

Copyright © Clifford Neuman - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE Active Badges  Provides location information and one or more buttons  Simple interface  Controlled access  Carries context  Two way, device knows where your are, and your location knows you are present  Moves your environment

Copyright © Clifford Neuman - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE In-Network Processing  Communication is expensive, computing less-so, so pre-process to reduce data sent.  Send information, not-data.  Requires more knowledge at the edges so that query can be distributed.  Intermediate nodes correlate and agregate results.

Copyright © Clifford Neuman - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE Directed Diffusion  Publish/Subscribe model  Data named, not nodes  But what are the implications  discussion

Copyright © Clifford Neuman - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE A Taxonomy  Approaches/Products/Devices differ by placement/nature of:  Management  Storage  Computing  Communication  Context maintenance  Authority

Copyright © Clifford Neuman - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE Classes  Mobile Terminals  Passive devices  Personal Devices  Remote Sensors/Actuators  Communicating Devices  Sensor Networks

Copyright © Clifford Neuman - UNIVERSITY OF SOUTHERN CALIFORNIA - INFORMATION SCIENCES INSTITUTE Examples  Cell Phones  i-phone  PDA  Home automation  Proximity cards  Laptop computer  In Vehicle networks  Active Badges