Computer Communication and Distributed Algorithms 202 -2 -1131 Eyal Cohen: eyalco@cs. bgu. ac. il Introduction Computer Communication and Distributed Algorithms (Fall 2012 -13) 1
Administration 1 p Practical sessions: n p Mondays 12: 00 -13: 00. Books: n Computer Networking: A Top-Down Approach Featuring the Internet / Kurose-Ross n Computer Networks / Tanenbaum Computer Communication and Distributed Algorithms (Fall 2012 -13) 2
Administration 2 Practical session: Room 104 Building 28. p Office Hors: Room 504 Building 37. Tuesday 14: 00 -16: 00 or scheduled by Email p Assignments are given in the lectures. p Computer Communication and Distributed Algorithms (Fall 2012 -13) 3
Session Objectives p Learn the basics of data communication and computer networks. ( ללמוד את הבסיס של תקשורת נתונים )ורשתות מחשב p To understand the main concepts and principles of communication. ( להבין את המושגים העיקריים ואת )העקרונות של תקשורת p To present modern communication networks and their applications. ( להציג את רשתות התקשורת המודרניות )והיישומיים שלהם Computer Communication and Distributed Algorithms (Fall 2012 -13) 4
Session Plan Introduction An initial introduction to communication and a historical review of the network world. The (OSI) layered network architecture. p Physical Layer The electric signals that allow data transfer and principles of communication systems. p Data Link Layer Collection of data into blocks. Error checking and fixing. Protocols. p Network Layer OSI and Internet approach. Designing networks and protocols. IP(v 4, v 6). Routing Protocols p Layer Transport OSI and Internet approach. Designing and interface. TCP, UDP. p Application Layer OSI and Internet approach. Support of the network applications: FTP, SMTP, HTTP, Mail, DNS p p Distributed Systems Computer Communication and Distributed Algorithms (Fall 2012 -13) 5
Network - Definition רשת מחשבים היא אוסף של מחשבים אוטונומיים שמדברים זה עם זה דרך תווך פיזי A Computer Network is a collection of autonomous computers, interconnected through a physical medium Computer Communication and Distributed Algorithms (Fall 2012 -13) 6
Simplified communication model Computer Communication and Distributed Algorithms (Fall 2012 -13) 7
Simplified communication model Computer Communication and Distributed Algorithms (Fall 2012 -13) 8
Motivation p Sharing p resources. Reliability. (Backup or Decentralization) p Additional p Some computing capabilities. things are more fun in a group. Computer Communication and Distributed Algorithms (Fall 2012 -13) 9
What do computers need in order to communicate? Computer Communication and Distributed Algorithms (Fall 2012 -13) 10
Physical medium Old Standard New Standard RS-232 Transmit Computer Communication and Distributed Algorithms (Fall 2012 -13) Receive 11
Computer hardware CPU - Central Processing Unit is executing the commands stored in the computer’s memory. CPU Memory CPU Bus PCI Controller Computer Memory – (Memory) A component or devices that contain digital data used for processing. Cache – Data storage component. Data is restored fast or cheaply. PCI - Peripheral Component Interconnect. A computer channel protocol designed by Intel in order to attach peripheral components to a computer’s motherboard. These components include: • Printed circuits on the motherboard • Additional cards that fit on a socket. Motherboard – is the main printed circuit of the computer. All the essential components needed to operate the computer are an integral part of the motherboard, or directly connected Controller by different extension slots. These components include the CPU, Memory, Disk drives, etc. Every motherboard is based on a Chipset which manage the bridging of the different Controller components. In addition to the essential components it is possible to connect additional components over extension Boards (e. g. Modem) slots: Display card, Sound cards, Network cards, Modem. SCSI – Small Computer System Interface. A data ISA (Industry Standard Architecture) a transfer protocol, allows faster rates than the computer’s protocol for personal computers serial and parallel protocols. Another advantage- More presented in 1984 which extended XT than one component could be connected to the same 12 architecture to 16 Bit. Designed to port. attach peripherals to the motherboard. ISA SCSI Computer Communication and Distributed Algorithms (Fall 2012
Two computers communication example Application User to User Communication Data packet Computer Hardware Application Computer to Computer Communication Computer Hardware A B Computer to Network Communication Computer Communication and Distributed Computer to Network Communication Physical medium 13
Introduction to a post system BGU A book on Computer Communication Technion Guy Yair Admin Computer Communication and Distributed Algorithms (Fall 2012 -13) 14
Properties of the post system. (Each envelope is individually routed) כל מעטפה נשלחת בנפרד . (No time guarantee for delivery) אין זמן מובטח למשלוח . (No guarantee of delivery in sequence) אין הבטחה לסדר השליחה . (No guarantee of delivery at all !) ! אין כלל הבטחה למשלוח . (Things get lost) דברים יכולים ללכת לאיבוד (How can we acknowledge delivery? ) ? כיצד אנו יכולים לאשר קבלת משלוח : (Retransmission) שליחה חוזרת ? אך נקבע מתי לשלוח מחדש ? פסק-זמן . (Need local copies of contents of each envelope) נצטרך העתקים מקומיים של תוכן כל מעטפה . (How long to keep each copy) כמה זמן צריך להחזיק כל אחד מן העתקים . (How to determine when to retransmit? Timeout? ) . (What if an acknowledgement is lost? ) Computer Communication and Distributed Algorithms (Fall 2012 -13) ? מה אם האישור נאבד v v n n n v v 15
Postal system and the Layer model BGU שכבת הישום Application Layer Technion Guy Admin Yair שכבת התעבורה Transport Layer Admin שכבת הרשת Network Layer שכבת הקו Link Layer Computer Communication and Distributed Algorithms (Fall 2012 -13) 16
Internet introduction cs. bgu. ac. il Application Layer ie. technion. ac. il Guy Yair Transport Layer Linux Data Packet Data Header Win XP Network Layer Link Layer Computer Communication and Distributed Algorithms (Fall 2012 -13) 17
Properties of a communication system (Internet). (Each packet is individually routed) כל חבילה נשלחת בנפרד v . (No time guarantee for delivery) אין זמן מובטח למשלוח . (No guarantee of delivery in sequence) אין הבטחה לסדר השליחה (No guarantee of delivery at all!) ! אין כלל הבטחה למשלוח . (Things get lost) דברים יכולים ללכת לאיבוד . (Acknowledgements) אישור על קבלה (Retransmission) שליחה חוזרת ? אך נקבע מתי לשלוח מחדש ? פסק-זמן . (Need local copies of contents of each envelope) נצטרך העתקים מקומיים של תוכן כל חבילה . (How long to keep each copy) כמה זמן צריך להחזיק כל אחד מן העתקים (What if an acknowledgement is lost? ) ? מה אם האישור נאבד . (How to determine when to retransmit? Timeout? ) Computer Communication and Distributed Algorithms (Fall 2012 -13) v v v v 18 v v v
Internet Properties (cont. ) No guarantee of ) אין הבטחה לאמינות )או שלמות( הנתונים . (integrity of data Packets can be ) חבילות יכולה להתחלק למספר חלקים . (fragmented (Packets may be חבילה יכולה להיות משוכפלת . duplicated) v v v All those properties and demands are v addresed today by the modern networks and systems. Computer Communication and Distributed Algorithms (Fall 2012 -13) 19
Data transfer Transfer of digital data throughout the network: מעבר מידע ממערכת מחשב אחת לשניה n. (Out of the computer from one system to another) . (Usually in a serial בדרך כלל עם שמירה על הסדר n manner) משתמשים בתווך ספציפי: סיבים אופטים, כבלים, רדיו n. (Using a specific medium (fiber, cables, radio)) " אופציה של לעבור דרך "תחנות בינים n. (Option of passing through “intermediate stations”) טעויות אפשריות לפני להגיע ליעד n. (Possible errors before reaching to the destination) p Computer Communication and Distributed Algorithms (Fall 2012 -13) 20
Early communication systems p p p Telephone Point to Point communication. Direct connection of users to a central switchboard. Custom design of circuits. If the distance between users is too far, links and relays are used. Computer Communication and Distributed Algorithms (Fall 2012 -13) 21
Overview of data networks p p p A series of nodes that exchange information Sharing of the transmission circuits = “Circuit Switching”. Connecting two edges. Many nodes mean more than one path between two nodes. A network must choose the apropriate path for each link demand. Example of a network: Computer Communication and Distributed Algorithms (Fall 2012 -13) 22
Overview data networks Overview of Hardware: How to configure a group of computers as a network LAN - Local Area Network. A network spread over one or several buildings. p MAN – Metropolitan Area Network. A network spread over a city or a campus (such as a university network). p WAN – Wide Area Network. A network that connects a few LANs and WANs, which are usually far from one another. p Internetworks – Connection of many networks. Software: Makes the network – Not the equipment! p p p The Internet deals with redirecting messages through networks of networks or internetworks. How? Protocols: Describe how two sides that are active in transferring data exchange data between them. Computer Communication and Distributed Algorithms (Fall 2012 -13) 23
Network classification by size 0. 1 m Circuit Board 1 m System 10 m Room 100 m Building 1 Km Campus 10 Km City 100 Km Country 1000 Km Continent 10000 Km Earth LAN MAN WAN Computer Communication and Distributed Algorithms (Fall 2012 -13) 25
Overview of data networks p Services: What the network offers to the communicating nodes. p Interfaces: How a user can utilize network services and make them available. p Two models: OSI – Open System Interconnection, developed by the international standard organization (ISO), and the Internet network model. Computer Communication and Distributed Algorithms (Fall 2012 -13) 26
Local area networks (LAN) p p p Local Area Network is a confined computer (or data) network. LAN are different than other networks by size, broadcast technology, and by simple topologies. Usually “Shared media” method- A single cable that connects all the computers. Bus – All the stations are on a shared bus. When one computer transmits no one else can transmit (Disadvantage). Typical transmission rates: 10 Mbps-1 Gbps Computer Communication and Distributed Algorithms (Fall 2012 -13) 27
Local area networks (LAN) 1 2 4 Token-based A token which is essentially a packet that goes along the ring. The Transmitting computer (1) Waits until the token comes and removes it. (2) Sends the packet to the ring. (3) Waits until the packet returns. (4) Transmits the token again Why do we need a token? 3 28 Computer Communication and Distributed Algorithms (Fall 2012 -13)
Wide Area Network (WAN) p p WAN covers a large geographic area, such as a city, a province, or a country. WAN usually connects smaller networks such as LANs. Router – Connects the LANs into a WAN. A standard transmission rate: 2. 5 Gbps-10 Gbps Computer Communication and Distributed Algorithms (Fall 2012 -13) 29
Internetworks p p p Until now the assumption was that the network is homogenous and there is a little variation of the equipment. Hoever, Big networks could only be built by connecting different types of networks to an internet. Examples: Different types of LANs in the same department (Bus and Ring). - Connecting LANs to all other networks through WAN. The WAN is a subnet. - Connecting WANs to all other networks – Internet. Computer Communication and Distributed Algorithms (Fall 2012 -13) 30
Internet network p Addressing – A method of accessing network resources IP addresses 132. 66. 48. 37, Refer to a host , interface = network number + host number For example 132. 66. 48 represents the network and 37 represents the specific computer. p Routing – How to find the path from the source to the destination. Packet switching- moving packets between the routers independently. p Information Units – How is the data transmitted Self-descriptive data: packet = data + metadata (header). Computer Communication and Distributed Algorithms (Fall 2012 -13) 31
Protocol Layers p p Organizing the network structure. A series of steps and structures using protocols: n n n A protocol is a group of rules and patterns to regulate the communication between two colleagues. A protocol is needed for any action that requires a cooperation between all the colleagues. Examples of communication protocols: p p p ARP – Address Resolution Protocol. Used to convert IP addresses to MAC addresses. DHCP – Dynamic Host Configuration Protocol. Used to automatically assign IP addresses for devices that do not have a predefined static IP address. DNS – Domain Name System. Used to translate literal domain names to IP addresses. Computer Communication and Distributed Algorithms (Fall 2012 -13) 32
Protocol Layers n The network that provides many services (i. e. Web, Vo. IP, Email, games, Ecommerce, file sharing) needs many protocols. n Some of the services are independent but others rely on others. n A protocol may use another protocol as a step of its execution. n This relationship between the layers is called layering – one protocol layer is layered over another protocol layer. Computer Communication and Distributed Algorithms (Fall 2012 -13) 33
Open protocols and systems p A group of protocols is open if: n n The details of the protocol are clear and available. The changes in the protocols are managed by organizations that publish the protocols and its meetings are open to the public A system that utilizes open protocols is called an open system. p International Organization for Standards (ISO) - Standardizing to create open systems. p n p open system interconnect (OSI) Layered protocols model has a major impact. 34
ISO OSI reference model p Source model n p Service architecture n p Describes the service that each layer provides and the interfaces between the layers. Protocol architecture n p Formally defines a layer, a service etc. A group of protocols that executes the service architecture. A collection of all the protocols of the different layers is called – Protocol Stack. Computer Communication and Distributed Algorithms (Fall 2012 -13) 35
Seven Layers Model Application Presentation Session Transport Network Data Link Physical Intermediate system End system Computer Communication and Distributed Algorithms (Fall 2012 -13) 36
Physical layer p The physical layer defines 4 properties of the physical connection: 1. The mechanical properties - the interface of the communication device. The electric signals that allow data transfer. The logical function of the electric signals, and their order of appearance over the different communication lines in a given time. The protocol that controls the timing of events and their order is defined. Protocol Examples: 2. 3. 4. p n n 802. 11 x-Wi. Fi – A family of protocols for wireless LAN. 10 Base-T – A physical protocol of the Ethernet. Allow stations to be connected by twisted pairs wires. Bluetooth – A private wireless protocol in the personal space. Frequency 2. 45 GHz. Short range low bandwidth. i. e. computer connection to peripherals. DSL – A digital data transmission technology over local phone lines. 37
Data link layer p After the physical connections are established, there is a need to control the data transfer. 1. 2. 3. 4. p The link layer directs the data in the network in a reliable and understandable way to all the communication devices. The link layer collects the data packets and orders them into frames. The link layer adds bytes and bits to identify each field in the frame. Defines a protocol that finds and fixes errors created by the data transfer. Protocols n n n Ethernet - Allows sending information without prior notification. Deals with collisions. Token Ring – Uses a 24 bit token transmitted between computers in the network where only the computer who has it may transmit. FDDI – Two rings that pass a token in opposite directions. The Main ring is used most of the time. The secondary ring is used when there is a failure in the network. Computer Communication and Distributed Algorithms (Fall 2012 -13) 38
Network layer p p p The network layer allows routing of the data from the source to the destination. Hides the behavior of the link layer. Provides the addresses needed. Decides which physical route will be used according to the network condition, service priorities, and other settings. Exists in every node. In the source, the destination and the routers. Common protocols: n n IPv 4 – Internet Protocol, or simply IP. A communication protocol used to transfer data without data check or acknowledgement, but it is very fast and efficient. Very common in computer networks, and the Internet. IPv 6 – A protocol used to transfer data based on packages. The 3 rd version of the protocol after IPv 4 ICMP – A part of a group of protocols of the Internet. Generally created as a result of errors in IP packets, or for routing and diagnostics. 39 RIP – A routing protocol based on Hop Count in order to make routing decisions.
Transport layer p p The transport layer is responsible for services and optimization between two systems. This layer provides data transport between the source and the destination. Responsible of the reliability of the connection and the reliability of the data. The Transport layer include several protocols that implement the function of the layer in different ways. In addition some decide to implement or not to implement certain functions. Every application (from the upper layer) chooses its appropriate protocol, according to it’s needs. Common protocols: n n TCP – Transmission Control Protocol. Provides error control, flow control and multiplexing of many messages at a time. UDP – User Datagram Protocol. Provides multiplexing of only a few messages at a time Computer Communication and Distributed Algorithms (Fall 2012 -13) 40
Session layer p p p Supports the connection of two open systems who wishes to maintain a “session”. This layer manages the dialog between the systems depending on the transport layer. Every session link requires a transport link. The session layer performs the functions that allow two applications to connect over the network. I provides security, identification, system login etc. These functions include bidirectional data flow and synchronization. Over the internet Internet there is no session layer. Protocols: n n n PPTP – Allows a safe private virtual private network (VPN) over TCP/IP. SSH – Allows a remote access and login. Replaces RSH, rlogin and telnet. Allows a safe and encrypted communication between two computers over unsecured networks. SSH is working over TCP. SSL – A protocol that allows safe and encrypted communication between two applications. 41
Presentation layer p p p In charge of the data format created in two open systems and converting them into a readable content. In charge of the translation and verifying the data transport between the two systems. For example, if one system is working on ASCII format and the other on EBDIC, the presentation layer must provide the translation of the protocols. The presentation layer holds the formatting data to ensure a valid and wanted output over the appropriate peripherals. (Screen, Printers, etc. ) The layer is dealing with the mapping of the screen. An application written for IBM terminal needs to reformat the data in order to be displayed on another terminal. No presentation layer over the internet Protocols: n n n ASCII – A Code for Information Interchange, in computer memory and files. Unicode – An international standard for presenting text in computer systems. Defines a code system that includes all active worldwide writing systems, and also common scientific and technical signs. MIME – Extends Email capabilities by adding these features: p p Non ASCII text Non text attachments Non ASCII headers Almost all Email sent today uses MIME Computer Communication and Distributed Algorithms (Fall 2012 -13) 42
Application layer p p The upper layer that includes the user applications. This includes operating the network system, file management, printing queue, Emails etc. This layer does not provide service to another layer. Protocols: n n HTTP – A protocol used to transfer HTML pages and their objects (Images, sounds, flash etc), over the Internet. FTP – A file transfer protocol based on TCP. Computer Communication and Distributed Algorithms (Fall 2012 -13) 43
Next: p The physical layer Signal processing basics. n Nyquist-Shannon sampling n p The relation between data flow and bandwidth. p The maximum transmission rate of a noisy channel. n Wave modulation and coding basics Computer Communication and Distributed Algorithms (Fall 2012 -13) 44
Скачать презентацию Computer Communication and Distributed Algorithms 202 -2 -1131
421be911b2c466f21ab74e5cbe29a13a.ppt