Bài giảng Operating system Concepts - Module 15: Network Structures

Nội dung text: Bài giảng Operating system Concepts - Module 15: Network Structures

1. Module 15: Network Structures n Background n Topology n Network Types n Communication n Communication Protocol n Robustness n Design Strategies Operating System Concepts 15.1 Silberschatz, Galvin and Gagne 2002
2. A Distributed System Operating System Concepts 15.2 Silberschatz, Galvin and Gagne 2002
3. Motivation n Resource sharing F sharing and printing files at remote sites F processing information in a distributed database F using remote specialized hardware devices n Computation speedup – load sharing n Reliability – detect and recover from site failure, function transfer, reintegrate failed site n Communication – message passing Operating System Concepts 15.3 Silberschatz, Galvin and Gagne 2002
4. Network-Operating Systems n Users are aware of multiplicity of machines. Access to resources of various machines is done explicitly by: F Remote logging into the appropriate remote machine. F Transferring data from remote machines to local machines, via the File Transfer Protocol (FTP) mechanism. Operating System Concepts 15.4 Silberschatz, Galvin and Gagne 2002
5. Distributed-Operating Systems n Users not aware of multiplicity of machines. Access to remote resources similar to access to local resources. n Data Migration – transfer data by transferring entire file, or transferring only those portions of the file necessary for the immediate task. n Computation Migration – transfer the computation, rather than the data, across the system. Operating System Concepts 15.5 Silberschatz, Galvin and Gagne 2002
6. Distributed-Operating Systems (Cont.) n Process Migration – execute an entire process, or parts of it, at different sites. F Load balancing – distribute processes across network to even the workload. F Computation speedup – subprocesses can run concurrently on different sites. F Hardware preference – process execution may require specialized processor. F Software preference – required software may be available at only a particular site. F Data access – run process remotely, rather than transfer all data locally. Operating System Concepts 15.6 Silberschatz, Galvin and Gagne 2002
7. Topology n Sites in the system can be physically connected in a variety of ways; they are compared with respect to the following criteria: F Basic cost. How expensive is it to link the various sites in the system? F Communication cost. How long does it take to send a message from site A to site B? F Reliability. If a link or a site in the system fails, can the remaining sites still communicate with each other? n 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. n The following six items depict various network topologies. Operating System Concepts 15.7 Silberschatz, Galvin and Gagne 2002
8. Network Topology Operating System Concepts 15.8 Silberschatz, Galvin and Gagne 2002
9. Network Types n Local-Area Network (LAN) – designed to cover small geographical area. F Multiaccess bus, ring, or star network. F Speed 10 megabits/second, or higher. F Broadcast is fast and cheap. F Nodes: 4 usually workstations and/or personal computers 4 a few (usually one or two) mainframes. Operating System Concepts 15.9 Silberschatz, Galvin and Gagne 2002
10. Network Types (Cont.) n Depiction of typical LAN: Operating System Concepts 15.10 Silberschatz, Galvin and Gagne 2002
11. Network Types (Cont.) n Wide-Area Network (WAN) – links geographically separated sites. F Point-to-point connections over long-haul lines (often leased from a phone company). F Speed 100 kilobits/second. F Broadcast usually requires multiple messages. F Nodes: 4 usually a high percentage of mainframes Operating System Concepts 15.11 Silberschatz, Galvin and Gagne 2002
12. Communication Processors in a Wide-Area Network Operating System Concepts 15.12 Silberschatz, Galvin and Gagne 2002
13. Communication The design of a communication network must address four basic issues: n Naming and name resolution: How do two processes locate each other to communicate? n Routing strategies. How are messages sent through the network? n Connection strategies. How do two processes send a sequence of messages? n Contention. The network is a shared resource, so how do we resolve conflicting demands for its use? Operating System Concepts 15.13 Silberschatz, Galvin and Gagne 2002
14. Naming and Name Resolution n Name systems in the network n Address messages with the process-id. n Identify processes on remote systems by pair. n Domain name service (DNS) – specifies the naming structure of the hosts, as well as name to address resolution (Internet). Operating System Concepts 15.14 Silberschatz, Galvin and Gagne 2002
15. Routing Strategies n Fixed routing. A path from A to B is specified in advance; path changes only if a hardware failure disables it. F Since the shortest path is usually chosen, communication costs are minimized. F Fixed routing cannot adapt to load changes. F Ensures that messages will be delivered in the order in which they were sent. n 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. F Partial remedy to adapting to load changes. F Ensures that messages will be delivered in the order in which they were sent. Operating System Concepts 15.15 Silberschatz, Galvin and Gagne 2002
16. Routing Strategies (Cont.) n Dynamic routing. The path used to send a message form site A to site B is chosen only when a message is sent. F Usually a site sends a message to another site on the link least used at that particular time. F Adapts to load changes by avoiding routing messages on heavily used path. F Messages may arrive out of order. This problem can be remedied by appending a sequence number to each message. Operating System Concepts 15.16 Silberschatz, Galvin and Gagne 2002
17. Connection Strategies n Circuit switching. A permanent physical link is established for the duration of the communication (i.e., telephone system). n Message switching. A temporary link is established for the duration of one message transfer (i.e., post-office mailing system). n 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. n 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. Operating System Concepts 15.17 Silberschatz, Galvin and Gagne 2002
18. Contention Several sites may want to transmit information over a link simultaneously. Techniques to avoid repeated collisions include: n CSMA/CD. Carrier sense with multiple access (CSMA); collision detection (CD) F 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. F When the system is very busy, many collisions may occur, and thus performance may be degraded. n SCMA/CD is used successfully in the Ethernet system, the most common network system. Operating System Concepts 15.18 Silberschatz, Galvin and Gagne 2002
19. Contention (Cont.) n 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. n 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 Operating System Concepts 15.19 Silberschatz, Galvin and Gagne 2002
20. Communication Protocol The communication network is partitioned into the following multiple layers; n Physical layer – handles the mechanical and electrical details of the physical transmission of a bit stream. n Data-link layer – handles the frames, or fixed-length parts of packets, including any error detection and recovery that occurred in the physical layer. n 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. Operating System Concepts 15.20 Silberschatz, Galvin and Gagne 2002
21. Communication Protocol (Cont.) n 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. n Session layer – implements sessions, or process-to- process communications protocols. n Presentation layer – resolves the differences in formats among the various sites in the network, including character conversions, and half duplex/full duplex (echoing). n Application layer – interacts directly with the users’ deals with file transfer, remote-login protocols and electronic mail, as well as schemas for distributed databases. Operating System Concepts 15.21 Silberschatz, Galvin and Gagne 2002
22. Communication Via ISO Network Model Operating System Concepts 15.22 Silberschatz, Galvin and Gagne 2002
23. The ISO Protocol Layer Operating System Concepts 15.23 Silberschatz, Galvin and Gagne 2002
24. The ISO Network Message Operating System Concepts 15.24 Silberschatz, Galvin and Gagne 2002
25. The TCP/IP Protocol Layers Operating System Concepts 15.25 Silberschatz, Galvin and Gagne 2002
26. Robustness n Failure detection n Reconfiguration Operating System Concepts 15.26 Silberschatz, Galvin and Gagne 2002
27. Failure Detection n Detecting hardware failure is difficult. n To detect a link failure, a handshaking protocol can be used. n 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. n 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. n Site A can now send an Are-you-up? message to Site B. n If Site A does not receive a reply, it can repeat the message or try an alternate route to Site B. Operating System Concepts 15.27 Silberschatz, Galvin and Gagne 2002
28. Failure Detection (cont) n If Site A does not ultimately receive a reply from Site B, it concludes some type of failure has occurred. n 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 n However, Site A cannot determine exactly why the failure has occurred. Operating System Concepts 15.28 Silberschatz, Galvin and Gagne 2002
29. Reconfiguration n 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. n When the link or the site becomes available again, this information must again be broadcast to all other sites. Operating System Concepts 15.29 Silberschatz, Galvin and Gagne 2002
30. Design Issues n Transparency – the distributed system should appear as a conventional, centralized system to the user. n Fault tolerance – the distributed system should continue to function in the face of failure. n Scalability – as demands increase, the system should easily accept the addition of new resources to accommodate the increased demand. n Clusters – a collection of semi-autonomous machines that acts as a single system. Operating System Concepts 15.30 Silberschatz, Galvin and Gagne 2002
31. Networking Example n The transmission of a network packet between hosts on an Ethernet network. n Every host has a unique IP address and a corresponding Ethernet (MAC) address. n Communication requires both addresses. n Domain Name Service (DNS) can be used to acquire IP addresses. n Address Resolution Protocol (ARP) is used to map MAC addresses to IP addresses. n 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. Operating System Concepts 15.31 Silberschatz, Galvin and Gagne 2002
32. An Ethernet Packet Operating System Concepts 15.32 Silberschatz, Galvin and Gagne 2002