1 / 56

Ch 2: TCP/IP and OSI

Ch 3: Underlying Technologies. Ch 2: TCP/IP and OSI. Lecture 3 and 4. How TCP/IP maps to OSI ??. TCP/IP Model. Explain Suite and Stack Concept. SCTP. Protocols for different underlying technologies – this is key. Explain communications at the physical layer.

amckissack
Télécharger la présentation

Ch 2: TCP/IP and OSI

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Ch 3: Underlying Technologies Ch 2: TCP/IP and OSI Lecture 3 and 4 Lecture 3 and 4

  2. How TCP/IP maps to OSI ?? Lecture 3 and 4

  3. TCP/IP Model Explain Suite and Stack Concept SCTP Protocols for different underlying technologies – this is key Lecture 3 and 4

  4. Explain communications at the physical layer Signal to bits translation and vice versa (note: digital data is different from digital signal) Lecture 3 and 4

  5. Physical addresses • Physical address is also known as the link address • Physical address can be different sizes (depend on the network) • Unicast type physical addresses – single Rx • Multicast type physical address – multiple Rxs • Broadcast type physical address – all Rxs can pickup message Lecture 3 and 4

  6. Physical Address Example Most local area networks use a 48-bit (6 bytes) physical address written as 12 hexadecimal digits, with every 2 bytes separated by a hyphen as shown below: 07-01-02-01-2C-4B A 6-byte (12 hexadecimal digits) physical address Lecture 3 and 4

  7. Explain communications at the data link layer Framing – encapsulation - decapsulation Lecture 3 and 4

  8. Explain communications at the network layer IP Addresses can be either unicast, multicast or broadcast types Going from network A physical address 10 to network P physical address 95. Can’t use the physical address because different networks The network layer address contains the uniqueness we need from source to sink. Network layer address is A-P Unit at this layer - datagram Lecture 3 and 4

  9. IP Address Example An Internet address (in IPv4) is 32 bits in length, normally written as four decimal numbers (or 4 octal numbers), with each number representing 1 byte. How many bits is a byte ? A nibble ?? The numbers are separated by a dot. Below is an example of such an address. Call “dot notation” 132.24.75.9 Example of IPv6 Address (128 bits): Lecture 3 and 4

  10. ADDRESSING We explained the physical address. We explained the need for an Internetworking (IP) address or Logical address Are the Physical and Logical addresses enough ????? Lecture 3 and 4

  11. Addresses in TCP/IP Application Specific Address Converts to a part address Lecture 3 and 4

  12. Relation- ship between layers and addresses in TCP/IP “Specific Addresses” Lecture 3 and 4

  13. Port addresses Addresses of sending and receiving processes (j and k) Add IP address Overhead (H2, T2) added for what ? Lecture 3 and 4

  14. Port Address Example As we will see in Chapters 11 and 12, a port address is a 16-bit address represented by one decimal number as shown below. 753 A 16-bit port address Lecture 3 and 4

  15. Relation- ship between Layers, Addresses, and Units in TCP/IP Messages Segments Datagrams (Packets) Frames Bits Lecture 3 and 4 Signals

  16. Ch 3: Underlying Technologies (1 of 3) Lecture #3 Lecture 3 and 4

  17. Internet – Underlying Technologies • As we mentioned before, the Internet is an interconnection of “backbone” networks JOINED together via routers, gateways and switches • Before getting into the higher level protocols, let’s cover more concerning the underlying technologies. Let’s talk about LANS and WANS and etc… • Internet is comprised of LANs, Point-to-Point WANs and Switched WANs • We will cover LANS: Ethernet, Token Ring (not in book), Wireless and FDDI Ring (not in book) • We will cover Pt-to-Pt WANs: Telephony Modem, DSL, Cable/Modem, T-Lines and SONET • We will cover Switched WANs: X.25, Frame Relay and ATM Token Ring (not in book) FDDI Ring (not in book) Lecture 3 and 4

  18. In putting these technologies in perspective Most of the technologies we are about to highlight could be covered as a full blown course – in some cases, multiple courses We will look at each technology from a high level in gathering a general appreciation and understanding of the technology Lecture 3 and 4

  19. LOCAL AREA NETWORKS (LANS) • LAN – a data communication system connecting multiple INDEPENDENT devices such computers, servers, printers, etc.. • Covers up to a certain geographical area – typically within a building or campus • Some Popular LANs: Ethernet, Token Ring, Wireless type LANs, and ATM LANs • Ethernet LAN • Ethernet is the more popular LAN protocol • Designed in 1973 by Xerox • Started out with a 10 Mbps data rate (bus topology) • Today, 100 Mbps and 1 gigabit per second exist (gig=1000 Mbps) • IEEE 802.3 standard describes the Ethernet protocol Lecture 3 and 4

  20. CSMA/CD • The 802.3 standard describes the CSMA/CD standard as the access method for the original Ethernet • CSMA/CD stands for carrier sense multiple access with collision detection. • The transport medium is shared – only one station or node can use the medium at a time • All stations can receive a sent frame however, only the destination station takes it in (the other stations drop the frame) • How can we make sure no two stations are using the transport medium at the same time ? If this happened, the 2 frames could “collide” • CSMA/CD solves this problem: • CSMA/CD Process • Every station has equal access to the medium • Station listens to or senses the medium before sending frame – if no data, it can send – if data exist, wait • Suppose 2 stations sense at the same time and find no data on the medium, crash will happen • In this case, all stations sense the collision and each Tx send a “jam signal” to delete the data it sent • Then each station waits a randomly amount of time and try it again – this prevents a second collision Notice that Station Z receives a collision signal 1 time period earlier than Station A Lecture 3 and 4

  21. CSMA/CD • Only one signal can travel down the transport at any time • Node has to look out and make sure path is clear • Which can be detected faster – large or small signal ? Why (sensing) • Which will clear the hall faster ? Large or small ? Why (waiting) • If you wait too little – what’s the problem • If you wait too long – what’s the problem • What’s the optimum wait time ? • If the larger signal is moving very fast – which can be detected faster ? Why ? Is speed a factor (sensing, waiting) • Does the length of the transport play a factor in “how fast” something clears the hall ? (waiting) Lecture 3 and 4

  22. CSMA/CD • 3 factors relate to CSMA/CD • 1. Minimum frame length • 2. Data transmission rate • 3. Collision domain (maximum network distance) • The amount of time a station needs to wait in making sure no data is on the line) is minimum frame length divided by the data transmission rate. Why ?? (Speed=Distance/Time) – the larger the frame, the longer the time to wait – however, sensing is shorter) • Amount of time to send the smallest frame (ie. an 8 bit frame at 2 bps will take 8/2 = 4 seconds to send – therefore, need to wait ATLEAST 4 seconds) • This time is proportionate to the time it will take the first bit to travel the maximum network distance (collision domain). • Therefore, (max network distance)/(propagation speed) proportionate to (min frame length)/(transmission-rate) • Data transmission rate – data transfer rate – how fast to send a certain amount of bits from one device to another • For the original Ethernet: min frame size=520 bits, transmission rate=10 Mbps and the max network distance=2500 meters Lecture 3 and 4

  23. Increasing Speed of Ethernet • Decrease collision domain • Increase minimum frame length Detect faster Larger frame Smaller frame Lecture 3 and 4

  24. Ethernet layers • Ethernet’s data link layer is sub-divided into MAC Layer and LLC Layer • MAC Layer – media access control layer – controls the CSMA/CD access method. Also performs the “framing” work. • LLC Layer – logical link control layer – performs the error and flow control routines Lecture 3 and 4

  25. Ethernet frame • The Ethernet frame consist of 7 fields: preamble, SFD, DA, SA, length/type of PDU, 802.2 frame (the actual data) and CRC • Frame doesn’t provide acknowledgment or “hand shaking” fields – unreliable medium • Preamble – alternating 1s and 0s t alert and synchronize the Rx • SFD – start field delimiter – signals the beginning of the frame • Destination address – contains the address of the next node( intermediate or Rx) • Source address – contains the address of the sending node (Tx or intermediate) • Length of protocol data unit – if less than 1518, defines the length up-and-coming data field – if greater than 1536, tells the protocol that uses the service • Data & padding – data encapsulated from higher layers – size ranges between 46 bytes to 1500 bytes • CRC – cyclic redundancy check – error detection info Lecture 3 and 4

  26. Ethernet implementation Each device on an Ethernet network has a NIC (network interface card) Contains the physical address –ah ha, this is how I can change locations and still get emails • Ethernet addressing: • Unicast • Multicast • Broadcast • Some implementations of Ethernet: • 10BASE5 (thick ethernet) • 10BASE2 (thin ethernet) • 10BASE-T (twisted pair) • 10BASE-FL (fiber link) Connects host to medium and perform CSMA/CD British naval connector or bayonet nut connector – for coaxial cable Lecture 3 and 4

  27. Ethernet implementation Lecture 3 and 4

  28. Ethernet implementation Unshielded twisted pair Lecture 3 and 4

  29. Ethernet implementation Lecture 3 and 4

  30. Fast Ethernet implementation 100 Mbps Ethernet 2-wire type (100BASE-TX or 100BASE-FX) 4-wire type (only 100BASE-T4) To make faster, collision domain was decreased 10 fold (250 meters vs 2500 meters) Lecture 3 and 4

  31. Fast Ethernet implementation Lecture 3 and 4

  32. Fast Ethernet implementation Lecture 3 and 4

  33. Gigabit Ethernet implementation Need for data rates higher than 100 Mbps resulted in a 1000 Mbps Ethernet called gigabit Ethernet Again, we had the choice to either decrease the collision domain or increase the minimum frame size Because 25 meters for the 100 Mbps Ethernet was short enough, the minimum frame size was increased to get the desired speed Another option is to do away with the CSMA/CD overhead by connecting every station to the hub using 2 separate paths (this will do away with collisions) – called full-duplex Ethernet Lecture 3 and 4

  34. Gigabit Ethernet implementation Lecture 3 and 4

  35. Ten-Gigabit Ethernet implementation Lecture 3 and 4

  36. Token Ring LAN • Token Ring is a protocol defined by IEEE 802.5 • Use a token passing ACCESS method • Token Passing Method • During idle times (network not being used), a token circulates • The token is passed station to station until a station needs to send data • When the station sends it’s data, it holds the token • The data (or frame) circulates and get re-generated by each station • The Rx takes in and COPY the frame (based on destination address) • The data then continues back to the original Tx • Token is then release to circulate Lecture 3 and 4

  37. Token Ring layers • Uses the same layers as Ethernet (MAC and LLC) • LLC Layer – logical link control layer – performs the error and flow control routines (same as Ethernet) • MAC Layer – media access control layer –it implements the Token Passing Access Method (versus Ethernet’s CSMA/CD access method) Token Ring Lecture 3 and 4

  38. Token Ring Data frame • Token Ring frame defines 3 types of frames: data, token and abort • Data Frame – carries a protocol data unit (actual data) and is addressed to a specific Rx (not broadcasted) • Token Frame – is the placeholder frame (token) and uses only 3 of the 9 fields (SD, AC and ED) • Abort Frame – doesn’t carry any info and is used to stop transmission • SD – start delimiter – alert and synch the Rx • AC – Access control - 3 bits set priority, 1 bit tells what type of frame, 1 bit is a monitor bit tells which station is monitoring or sending at the time, and 3 reservation bits for station wishing for access • FC – Frame control – 1 bit tells if PDU is control info or data, 7 bits is used by Token Ring (ie. tells how to use AC field info) • DA – Destination address • SA – Source Address • Data • CRC – cyclic redundancy check – error checking • ED – end delimiter – signals end of data • FS – frame status – intermediate stations can set it letting the Tx know they read it, Rx can set it letting the Tx know it was copied and can be discarded now Lecture 3 and 4

  39. Token Ring Implementation • Token Ring is a series of shielded twisted pair transport medium linking each station into a ring • Because the token needs to pass through each station with in the ring, if a station is down, it could be a problem • Therefore, for each station, a switch is used to by pass the down (or disabled) station • These bypass switches are packaged together as a MAU – multi-station access unit NOTE: As we covered last lecture, don’t confuse the Ring Token technology with the Ring topology. With a ring topology approach, you would want to traverse in either direction (this is the main benefit of a ring topology) – explain Ethernet in ring topology. Lecture 3 and 4

  40. FDDI Ring • FDDI stands for Fiber Distributed Data Interconnect • Data rate is the same as Fast Ethernet (100 Mbps) • Light signals versus electrical signals are used • Uses a token passing access method with self-healing • What do we mean by “self healing” ? Ability to detect and fix problems. The hardware automatically recognizes and fix problems Lecture 3 and 4

  41. FDDI Ring • How does the “self-healing” works ? • Two independent rings connecting all stations are used – dual counter-rotating rings • The second ring is used only if a failure occurs • Functions like a Token Ring LAN until a failure (ie. fiber cut, node failure) • In this case, the intermediate (non-Rx) nodes keep copies of the sent frame too Lecture 3 and 4

  42. FDDI Ring • When the station detects it can’t communicate with the adjacent station, it uses the second ring to bypass the adjacent station • Given a fiber cut or node failure, this station is bypassed and the ring is closed Lecture 3 and 4

  43. FDDI Frame Lecture 3 and 4

  44. WIRELESS LANS Wireless communication is one of the fastest growing technologies. The demand for connecting devices without the use of cables is increasing everywhere. Wireless LANs can be found on college campuses, in office buildings, and in many public areas. • In this section, we concentrate on two wireless technologies for LANs: • IEEE 802.11 wireless LANs, sometimes called wireless Ethernet, • and Bluetooth, a technology for small wireless LANs. Lecture 3 and 4

  45. Wireless Transmission (not in book) • Wireless devices can transmit signals using radio frequency narrow band, infrared waves and radio frequency spread spectrum. • The frequency spread spectrum technique is typically used for internet applications • Two types of frequency spread spectrum techniques: (1) FHSS- Frequency Hopping Spread Spectrum and (2) DSSS – Direct Sequence Spread Spectrum Lecture 3 and 4

  46. FHSS- Frequency Hopping Spread Spectrum (not in book) • Tx transmits at different carrier frequencies for the same period of time (rotates between a set of frequencies) • The required bandwidth must be N times the original bandwidth, where N is the number of different carrier frequencies • Tx and Rx must agree to the hopping pattern. In this case, the first bit signal is transmitted in spectrum 2.01-2.02Ghz, 2nd bit transmitted in the 2.03-2.04 Ghz spectrum, 3rd bit transmitted in the 2.04-2.05 GHz spectrum, etc.. • Good technique for security reasons – if someone tunes to one of the 5 frequency spectrums below, they would only get 1/5 of the info being transmitted. Lecture 3 and 4

  47. DSSS – Direct Sequence Spread Spectrum (not in book) • Each bit sent by the Tx is replaced with a set of bits called a “chip code” • For the time it takes to send the original single bit, it now will take more time to send the chip code • Therefore, the data rate must be N times the original data rate, where N is the # of bits of the chip code • Also, the bandwidth for the chip code should N times greater than the original bit stream’s BW Example of original bits being transmitted as 6-bit chip codes Lecture 3 and 4

  48. ISM bands (not in book) • In 1985, the FCC modified the radio spectrum to allow unlicensed devices (operating at 1 watt or less) to ISM bands – Industrial, Scientific and Medical bands • Stimulated growth in wireless technology Lecture 3 and 4

  49. Wireless LANs Architecture • IEEE 802.11 covers 2 services – (1) BSS - Basic service set and (2) ESS – Extended service set • BSS – is the base architecture for a wireless LAN – it contains a stationary or mobile stations and a central access point (optional) • Without central access point, the BSS can’t transmit to other BSS’s example ? example ? Lecture 3 and 4

  50. Wireless LANs Architecture - ESS • Contains 2 or more BSS’s with central access points • The BBS’s central access points are connected via a distribution system (could be a wired LAN) – this network is called an Infrastructure network • BBS’s within reach of one another can communicate • BBS’s not within reach have to communicate via the central access points Lecture 3 and 4

More Related