Silberschatz, Galvin and Gagne  2002 15.1 Operating System Concepts Chap15: Distributed System Structures Background Topology Network Types Communication.

Slides:



Advertisements
Similar presentations
Module 14: Network Structures
Advertisements

Review of Topology and Access Techniques / Switching Concepts BSAD 141 Dave Novak Sources: Network+ Guide to Networks, Dean 2013.
OSes: 14. Dist. System Structures 1 Operating Systems v Objectives –introduce the basic notions behind a networked/distributed system Certificate Program.
Silberschatz and Galvin  Operating System Concepts Module 16: Distributed-System Structures Network-Operating Systems Distributed-Operating.
Lecture 11: Networks & Networking. Lecture 11 / Page 2AE4B33OSS Silberschatz, Galvin and Gagne ©2005 Contents Distributed systems Network types Network.
Answers of Exercise 7 1. Explain what are the connection-oriented communication and the connectionless communication. Give some examples for each of the.
NETWORK STRUCTURES This chapter sets the foundation for our discussion about networks and distributed OS. VOCABULARY   Tightly coupled systems Same clock,
Network Operating Systems Users are aware of multiplicity of machines. Access to resources of various machines is done explicitly by: –Logging into the.
Distributed System Structures CS 3100 Distributed System Structures1.
Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition Module 16: Distributed System Structures.
1 Chapter 9 Computer Networks. 2 Chapter Topics OSI network layers Network Topology Media access control Addressing and routing Network hardware Network.
Networking Theory (Part 1). Introduction Overview of the basic concepts of networking Also discusses essential topics of networking theory.
LAN Risanuri Hidayat. LAN-Local Area Network A LAN is a high-speed data network that covers a relatively small geographic area. It typically connects.
16: Distributed Systems1 DISTRIBUTED SYSTEM STRUCTURES NETWORK OPERATING SYSTEMS The users are aware of the physical structure of the network. Each site.
Modified from Silberschatz, Galvin and Gagne Principles of Computer Operating Systems Lecture 23 Chapter 16/18: Distributed Systems.
TCP: Software for Reliable Communication. Spring 2002Computer Networks Applications Internet: a Collection of Disparate Networks Different goals: Speed,
Chapter 2 Network Models.
1 Networking A computer network is a collection of computing devices that are connected in various ways in order to communicate and share resources. The.
COMPUTER NETWORKS.
Distributed System Structures 16: Distributed Structures
Chapter 17: Distributed Systems
Protocols and the TCP/IP Suite Chapter 4. Multilayer communication. A series of layers, each built upon the one below it. The purpose of each layer is.
CS 149: Operating Systems April 23 Class Meeting Department of Computer Science San Jose State University Spring 2015 Instructor: Ron Mak
Chapter 2 The Infrastructure. Copyright © 2003, Addison Wesley Understand the structure & elements As a business student, it is important that you understand.
Silberschatz, Galvin and Gagne ©2013 Operating System Concepts – 9 th Edition Module 17: Distributed Systems.
Lecture 2 TCP/IP Protocol Suite Reference: TCP/IP Protocol Suite, 4 th Edition (chapter 2) 1.
CSCI-235 Micro-Computer in Science The Network. © Prentice-Hall, Inc Communications  Communication is the process of sending and receiving messages 
1 Module 15: Network Structures n Topology n Network Types n Communication.
The OSI Model.
1 The Internet and Networked Multimedia. 2 Layering  Internet protocols are designed to work in layers, with each layer building on the facilities provided.
Silberschatz, Galvin and Gagne ©2013 Operating System Concepts – 9 th Edition Chapter 17: Distributed Systems.
Multiprossesors Systems.. What are Distributed Databases ? “ A Logically interrelated collection of shared data ( and a description of this data) physically.
Lecture 4: Sun: 23/4/1435 Distributed Operating Systems Lecturer/ Kawther Abas CS- 492 : Distributed system & Parallel Processing.
Network Protocols n ISO OSI 7-layer model n TCP/IP suite l TCP/UDP l IP l Ethernet/Token Ring l ICMP.
Module 16: Distributed System Structures
William Stallings Data and Computer Communications
Lecture 4 Overview. Ethernet Data Link Layer protocol Ethernet (IEEE 802.3) is widely used Supported by a variety of physical layer implementations Multi-access.
Silberschatz and Galvin  Operating System Concepts Module 15: Network Structures Background Motivation Topology Network Types Communication.
Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition, Chapter 16: Distributed System Structures.
Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition, Module 16: Distributed System Structures.
Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition, Chapter 16: Distributed System Structures Chapter 17: Distributed-File Systems.
Silberschatz, Galvin and Gagne ©2013 Operating System Concepts – 9 th Edition Chapter 17: Distributed Systems.
Silberschatz, Galvin and Gagne ©2013 Operating System Concepts – 9 th Edition Chapter 17: Distributed Systems.
Open System Interconnection Describe how information from a software application in one computer moves through a network medium to a software application.
Lecture 11: Networks & Networking. Lecture 11 / Page 2AE4B33OSS Silberschatz, Galvin and Gagne ©2005 Contents Distributed systems Network types Network.
Network Models.
Workshop 6 Agenda Homework review: 15.1, 16.5, 17.4 Study group project milestone Lecture & discussion on network structures Group activity on distributed.
Chapter 14: Distributed Operating Systems Silberschatz, Galvin and Gagne ©2005 Operating System Concepts – 7 th Edition, Apr 4, 2005 Outline n Motivation.
Module 16: Distributed System Structures Silberschatz, Galvin and Gagne ©2005 Operating System Concepts – 7 th Edition, Apr 4, 2005 Distributed.
Operating Systems Network Structures. Topics –Background –Motivation –Topology –Network Types –Communication –Design Strategies Topics –Background –Motivation.
CS307 Operating Systems Distributed System Structures Guihai Chen Department of Computer Science and Engineering Shanghai Jiao Tong University Spring 2012.
TCP/IP Protocol Suite Suresh Kr Sharma 1 The OSI Model and the TCP/IP Protocol Suite Established in 1947, the International Standards Organization (ISO)
Network Models. The OSI Model Open Systems Interconnection (OSI). Developed by the International Organization for Standardization (ISO). Model for understanding.
CSE Operating System Principles Distributed Systems & Networking Fundamentals.
Operating Systems Distributed-System Structures. Topics –Network-Operating Systems –Distributed-Operating Systems –Remote Services –Robustness –Design.
Silberschatz, Galvin and Gagne ©2013 Operating System Concepts – 9 th Edition Chapter 17: Distributed Systems.
OSI Model OSI MODEL. Communication Architecture Strategy for connecting host computers and other communicating equipment. Defines necessary elements for.
OSI Model OSI MODEL.
Network Models.
Chapter 19: Distributed Systems
Chapter 15: Distributed Structures
LAN Risanuri Hidayat.
Module 16: Distributed System Structures
Chapter 16: Distributed System Structures
Module 15: Network Structures
OSI Model OSI MODEL.
LEARNING COMPUTER NETWORKS OSI Model (layers). Why a layered model?  Easier to teach communication process.  Speeds development, changes in one layer.
Presentation transcript:

Silberschatz, Galvin and Gagne  Operating System Concepts Chap15: Distributed System Structures Background Topology Network Types Communication Communication Protocol Robustness Design Strategies

Silberschatz, Galvin and Gagne  Operating System Concepts A Distributed System

Silberschatz, Galvin and Gagne  Operating System Concepts Motivation Resource sharing  sharing and printing files at remote sites  processing information in a distributed database  using remote specialized hardware devices Computation speedup – load sharing Reliability – detect and recover from site failure, function transfer, reintegrate failed site Communication – message passing

Silberschatz, Galvin and Gagne  Operating System Concepts Network-Operating Systems Users are aware of multiplicity of machines. Access to resources of various machines is done explicitly by:  Remote logging into the appropriate remote machine.  Transferring data from remote machines to local machines, via the File Transfer Protocol (FTP) mechanism.

Silberschatz, Galvin and Gagne  Operating System Concepts Distributed-Operating Systems Users not aware of multiplicity of machines. Access to remote resources similar to access to local resources. Data Migration – transfer data by transferring entire file, or transferring only those portions of the file necessary for the immediate task. Computation Migration – transfer the computation, rather than the data, across the system.

Silberschatz, Galvin and Gagne  Operating System Concepts Distributed-Operating Systems (Cont.) Process Migration – execute an entire process, or parts of it, at different sites.  Load balancing – distribute processes across network to even the workload.  Computation speedup – subprocesses can run concurrently on different sites.  Hardware preference – process execution may require specialized processor.  Software preference – required software may be available at only a particular site.  Data access – run process remotely, rather than transfer all data locally.

Silberschatz, Galvin and Gagne  Operating System Concepts Topology Sites in the system can be physically connected in a variety of ways; they are compared with respect to the following criteria:  Basic cost. How expensive is it to link the various sites in the system?  Communication cost. How long does it take to send a message from site A to site B?  Reliability. If a link or a site in the system fails, can the remaining sites still communicate with each other? The various topologies are depicted as graphs whose nodes correspond to sites. An edge from node A to node B corresponds to a direct connection between the two sites. The following six items depict various network topologies.

Silberschatz, Galvin and Gagne  Operating System Concepts Network Topology

Silberschatz, Galvin and Gagne  Operating System Concepts Network Types Local-Area Network (LAN) – designed to cover small geographical area.  Multiaccess bus, ring, or star network.  Speed  10 megabits/second, or higher.  Broadcast is fast and cheap.  Nodes:  usually workstations and/or personal computers  a few (usually one or two) mainframes.

Silberschatz, Galvin and Gagne  Operating System Concepts Network Types (Cont.) Depiction of typical LAN:

Silberschatz, Galvin and Gagne  Operating System Concepts Network Types (Cont.) Wide-Area Network (WAN) – links geographically separated sites.  Point-to-point connections over long-haul lines (often leased from a phone company).  Speed  100 kilobits/second.  Broadcast usually requires multiple messages.  Nodes:  usually a high percentage of mainframes

Silberschatz, Galvin and Gagne  Operating System Concepts Communication Processors in a Wide-Area Network

Silberschatz, Galvin and Gagne  Operating System Concepts Communication Naming and name resolution: How do two processes locate each other to communicate? Routing strategies. How are messages sent through the network? Connection strategies. How do two processes send a sequence of messages? Contention. The network is a shared resource, so how do we resolve conflicting demands for its use? The design of a communication network must address four basic issues:

Silberschatz, Galvin and Gagne  Operating System Concepts Naming and Name Resolution Name systems in the network Address messages with the process-id. Identify processes on remote systems by pair. Domain name service (DNS) – specifies the naming structure of the hosts, as well as name to address resolution (Internet).

Silberschatz, Galvin and Gagne  Operating System Concepts Routing Strategies Fixed routing. A path from A to B is specified in advance; path changes only if a hardware failure disables it.  Since the shortest path is usually chosen, communication costs are minimized.  Fixed routing cannot adapt to load changes.  Ensures that messages will be delivered in the order in which they were sent. Virtual circuit. A path from A to B is fixed for the duration of one session. Different sessions involving messages from A to B may have different paths.  Partial remedy to adapting to load changes.  Ensures that messages will be delivered in the order in which they were sent.

Silberschatz, Galvin and Gagne  Operating System Concepts Routing Strategies (Cont.) Dynamic routing. The path used to send a message form site A to site B is chosen only when a message is sent.  Usually a site sends a message to another site on the link least used at that particular time.  Adapts to load changes by avoiding routing messages on heavily used path.  Messages may arrive out of order. This problem can be remedied by appending a sequence number to each message.

Silberschatz, Galvin and Gagne  Operating System Concepts Connection Strategies Circuit switching. A permanent physical link is established for the duration of the communication (i.e., telephone system). Message switching. A temporary link is established for the duration of one message transfer (i.e., post-office mailing system). Packet switching. Messages of variable length are divided into fixed-length packets which are sent to the destination. Each packet may take a different path through the network. The packets must be reassembled into messages as they arrive. Circuit switching requires setup time, but incurs less overhead for shipping each message, and may waste network bandwidth. Message and packet switching require less setup time, but incur more overhead per message.

Silberschatz, Galvin and Gagne  Operating System Concepts Contention CSMA/CD. Carrier sense with multiple access (CSMA); collision detection (CD)  A site determines whether another message is currently being transmitted over that link. If two or more sites begin transmitting at exactly the same time, then they will register a CD and will stop transmitting.  When the system is very busy, many collisions may occur, and thus performance may be degraded. SCMA/CD is used successfully in the Ethernet system, the most common network system. Several sites may want to transmit information over a link simultaneously. Techniques to avoid repeated collisions include:

Silberschatz, Galvin and Gagne  Operating System Concepts Contention (Cont.) Token passing. A unique message type, known as a token, continuously circulates in the system (usually a ring structure). A site that wants to transmit information must wait until the token arrives. When the site completes its round of message passing, it retransmits the token. A token-passing scheme is used by the IBM and Apollo systems. Message slots. A number of fixed-length message slots continuously circulate in the system (usually a ring structure). Since a slot can contain only fixed-sized messages, a single logical message may have to be broken down into a number of smaller packets, each of which is sent in a separate slot. This scheme has been adopted in the experimental Cambridge Digital Communication Ring

Silberschatz, Galvin and Gagne  Operating System Concepts Communication Protocol Physical layer – handles the mechanical and electrical details of the physical transmission of a bit stream. Data-link layer – handles the frames, or fixed-length parts of packets, including any error detection and recovery that occurred in the physical layer. Network layer – provides connections and routes packets in the communication network, including handling the address of outgoing packets, decoding the address of incoming packets, and maintaining routing information for proper response to changing load levels. The communication network is partitioned into the following multiple layers;

Silberschatz, Galvin and Gagne  Operating System Concepts Communication Protocol (Cont.) Transport layer – responsible for low-level network access and for message transfer between clients, including partitioning messages into packets, maintaining packet order, controlling flow, and generating physical addresses. Session layer – implements sessions, or process-to- process communications protocols. Presentation layer – resolves the differences in formats among the various sites in the network, including character conversions, and half duplex/full duplex (echoing). Application layer – interacts directly with the users’ deals with file transfer, remote-login protocols and electronic mail, as well as schemas for distributed databases.

Silberschatz, Galvin and Gagne  Operating System Concepts Communication Via ISO Network Model

Silberschatz, Galvin and Gagne  Operating System Concepts The ISO Protocol Layer

Silberschatz, Galvin and Gagne  Operating System Concepts The ISO Network Message

Silberschatz, Galvin and Gagne  Operating System Concepts The TCP/IP Protocol Layers

Silberschatz, Galvin and Gagne  Operating System Concepts Robustness Failure detection Reconfiguration

Silberschatz, Galvin and Gagne  Operating System Concepts Failure Detection Detecting hardware failure is difficult. To detect a link failure, a handshaking protocol can be used. Assume Site A and Site B have established a link. At fixed intervals, each site will exchange an I-am-up message indicating that they are up and running. If Site A does not receive a message within the fixed interval, it assumes either (a) the other site is not up or (b) the message was lost. Site A can now send an Are-you-up? message to Site B. If Site A does not receive a reply, it can repeat the message or try an alternate route to Site B.

Silberschatz, Galvin and Gagne  Operating System Concepts Failure Detection (cont) If Site A does not ultimately receive a reply from Site B, it concludes some type of failure has occurred. Types of failures: - Site B is down - The direct link between A and B is down - The alternate link from A to B is down - The message has been lost However, Site A cannot determine exactly why the failure has occurred.

Silberschatz, Galvin and Gagne  Operating System Concepts Reconfiguration When Site A determines a failure has occurred, it must reconfigure the system: 1. If the link from A to B has failed, this must be broadcast to every site in the system. 2. If a site has failed, every other site must also be notified indicating that the services offered by the failed site are no longer available. When the link or the site becomes available again, this information must again be broadcast to all other sites.

Silberschatz, Galvin and Gagne  Operating System Concepts Design Issues Transparency – the distributed system should appear as a conventional, centralized system to the user. Fault tolerance – the distributed system should continue to function in the face of failure. Scalability – as demands increase, the system should easily accept the addition of new resources to accommodate the increased demand. Clusters – a collection of semi-autonomous machines that acts as a single system.

Silberschatz, Galvin and Gagne  Operating System Concepts Networking Example The transmission of a network packet between hosts on an Ethernet network. Every host has a unique IP address and a corresponding Ethernet (MAC) address. Communication requires both addresses. Domain Name Service (DNS) can be used to acquire IP addresses. Address Resolution Protocol (ARP) is used to map MAC addresses to IP addresses. If the hosts are on the same network, ARP can be used. If the hosts are on different networks, the sending host will send the packet to a router which routes the packet to the destination network.

Silberschatz, Galvin and Gagne  Operating System Concepts An Ethernet Packet