The document discusses Address Resolution Protocol (ARP) and Reverse Address Resolution Protocol (RARP). It explains that ARP is used to dynamically map between IP addresses and MAC addresses on local area networks. ARP broadcasts a request to map an IP to MAC, and the host with that IP responds with its MAC. This mapping is stored in an ARP cache for future lookups to avoid broadcasting for every packet. RARP is the reverse process for a host to learn its IP from a server based on its MAC.
Network Layer addresses data at the logical and physical levels. Logical addresses are generated by CPUs and allow virtual addressing, while physical addresses map to specific memory locations. The network layer provides routing across multiple physical links from one device to another. IP addresses uniquely identify devices on the Internet, though they can change over time as connections change. IPv6 was developed to address the impending exhaustion of IPv4 addresses by expanding the address space to 128 bits.
The document discusses transport layer protocols TCP and UDP. It provides an overview of process-to-process communication using transport layer protocols. It describes the roles, services, requirements, addressing, encapsulation, multiplexing, and error control functions of the transport layer. It specifically examines TCP and UDP, comparing their connection-oriented and connectionless services, typical applications, and segment/datagram formats.
TCP and UDP are transport layer protocols used for data transfer in the OSI model. TCP is connection-oriented, requiring a three-way handshake to establish a connection that maintains data integrity. It guarantees data will reach its destination without duplication but is slower than UDP. UDP is connectionless and used for applications requiring fast transmission like video calls, but does not ensure packet delivery and order. Both protocols add headers to packets with TCP focused on reliability and UDP on speed.
This document provides an overview of Ethernet and wireless computer networks. It discusses Ethernet standards and protocols including CSMA/CD, frame formats, addressing, and the transmitter algorithm. It also covers wireless networking technologies such as Bluetooth, Wi-Fi (IEEE 802.11), and WiMAX (IEEE 802.16). Key aspects summarized include the use of carrier sensing and collision detection in Ethernet, exponential backoff for retransmission after collisions, and the use of frequency hopping and direct sequence spread spectrum in wireless networks.
This document discusses IP addressing and classful addressing in TCP/IP networking. It covers the following key points:
- IP addresses are 32-bit addresses that uniquely identify devices on the Internet. They are organized into classes A, B, C, D and E based on the binary pattern of the address.
- Classful addressing allocates address blocks to organizations based on these classes. However, this led to inefficient address usage and rapid depletion of available addresses.
- Subnetting and supernetting were introduced to allow better allocation of addresses within the original classful blocks through the use of subnet and supernet masks. However, classful addressing is now mostly obsolete.
The document discusses the key features and mechanisms of the Transmission Control Protocol (TCP). It begins with an introduction to TCP's main goals of reliable, in-order delivery of data streams between endpoints. It then covers TCP's connection establishment and termination processes, flow and error control techniques using acknowledgments and retransmissions, and congestion control methods like slow start, congestion avoidance, and detection.
TCP & UDP ( Transmission Control Protocol and User Datagram Protocol)Kruti Niranjan
This document provides information about the Transport Layer protocols TCP and UDP. It describes:
1) TCP is a connection-oriented protocol that provides reliable, in-order delivery of data through features like flow control, error control, and congestion control. UDP is a connectionless protocol that does not guarantee delivery or order of packets.
2) The TCP header contains fields for source/destination ports, sequence numbers, acknowledgement numbers, flags, window size, checksum, and options. The UDP header contains fields for source/destination ports, length, and checksum.
3) The main differences between TCP and UDP are that TCP is connection-oriented, provides error control and flow control, and supports full duplex communication
The document discusses address resolution protocol (ARP) which maps logical IP addresses to physical MAC addresses on a local area network. It explains that ARP broadcasts a request to find the MAC address associated with a given IP address, and the device with that IP address responds with its MAC. This dynamic address mapping is stored in an ARP cache for future use. It also describes how different network protocols may use ARP or similar methods to perform address mapping between logical and physical addresses.
Network Layer addresses data at the logical and physical levels. Logical addresses are generated by CPUs and allow virtual addressing, while physical addresses map to specific memory locations. The network layer provides routing across multiple physical links from one device to another. IP addresses uniquely identify devices on the Internet, though they can change over time as connections change. IPv6 was developed to address the impending exhaustion of IPv4 addresses by expanding the address space to 128 bits.
The document discusses transport layer protocols TCP and UDP. It provides an overview of process-to-process communication using transport layer protocols. It describes the roles, services, requirements, addressing, encapsulation, multiplexing, and error control functions of the transport layer. It specifically examines TCP and UDP, comparing their connection-oriented and connectionless services, typical applications, and segment/datagram formats.
TCP and UDP are transport layer protocols used for data transfer in the OSI model. TCP is connection-oriented, requiring a three-way handshake to establish a connection that maintains data integrity. It guarantees data will reach its destination without duplication but is slower than UDP. UDP is connectionless and used for applications requiring fast transmission like video calls, but does not ensure packet delivery and order. Both protocols add headers to packets with TCP focused on reliability and UDP on speed.
This document provides an overview of Ethernet and wireless computer networks. It discusses Ethernet standards and protocols including CSMA/CD, frame formats, addressing, and the transmitter algorithm. It also covers wireless networking technologies such as Bluetooth, Wi-Fi (IEEE 802.11), and WiMAX (IEEE 802.16). Key aspects summarized include the use of carrier sensing and collision detection in Ethernet, exponential backoff for retransmission after collisions, and the use of frequency hopping and direct sequence spread spectrum in wireless networks.
This document discusses IP addressing and classful addressing in TCP/IP networking. It covers the following key points:
- IP addresses are 32-bit addresses that uniquely identify devices on the Internet. They are organized into classes A, B, C, D and E based on the binary pattern of the address.
- Classful addressing allocates address blocks to organizations based on these classes. However, this led to inefficient address usage and rapid depletion of available addresses.
- Subnetting and supernetting were introduced to allow better allocation of addresses within the original classful blocks through the use of subnet and supernet masks. However, classful addressing is now mostly obsolete.
The document discusses the key features and mechanisms of the Transmission Control Protocol (TCP). It begins with an introduction to TCP's main goals of reliable, in-order delivery of data streams between endpoints. It then covers TCP's connection establishment and termination processes, flow and error control techniques using acknowledgments and retransmissions, and congestion control methods like slow start, congestion avoidance, and detection.
TCP & UDP ( Transmission Control Protocol and User Datagram Protocol)Kruti Niranjan
This document provides information about the Transport Layer protocols TCP and UDP. It describes:
1) TCP is a connection-oriented protocol that provides reliable, in-order delivery of data through features like flow control, error control, and congestion control. UDP is a connectionless protocol that does not guarantee delivery or order of packets.
2) The TCP header contains fields for source/destination ports, sequence numbers, acknowledgement numbers, flags, window size, checksum, and options. The UDP header contains fields for source/destination ports, length, and checksum.
3) The main differences between TCP and UDP are that TCP is connection-oriented, provides error control and flow control, and supports full duplex communication
The document discusses address resolution protocol (ARP) which maps logical IP addresses to physical MAC addresses on a local area network. It explains that ARP broadcasts a request to find the MAC address associated with a given IP address, and the device with that IP address responds with its MAC. This dynamic address mapping is stored in an ARP cache for future use. It also describes how different network protocols may use ARP or similar methods to perform address mapping between logical and physical addresses.
This presentation outlines the core functions of TCP - Transmission Control Protocol.
These comprise TCP Connection Control, TCP Flow Control, TCP Error Control, TCP Congestion Control, TCP Options and TCP Timers.
TCP/IP is the Internet core protocol that provides reliable, connection-oriented and stream-based communication service. Most of Internet traffic is carried in TCP connections, so scalability and reliability are crucial for a stable network on a global scale.
The document discusses various aspects of transport layer protocols including services provided, primitives, addressing, connection establishment and release, flow control, multiplexing, crash recovery, TCP and UDP, and performance issues. Specific topics covered include Berkeley sockets, an example file server, TCP and UDP headers, congestion control, and fast TPDU processing techniques.
ARP is a protocol that maps IP addresses to MAC addresses. It works by broadcasting an ARP request packet to all devices on the local network segment. The device with the matching IP address responds with its MAC address, allowing the requesting device to send packets directly to the destination MAC address on the local network.
This document provides an overview of transport layer protocols TCP, UDP, and SCTP. It discusses the history and evolution of TCP, including key developments like congestion control algorithms. UDP is described as a connectionless and unreliable protocol. SCTP is introduced as a protocol developed to transport telephony signaling over IP networks. It addresses limitations of TCP like head-of-line blocking and provides features like multi-homing and message orientation. The document defines SCTP terminology and describes its chunks, states, congestion control approach, and similarities to TCP. In summary, it serves as a high-level introduction to transport protocols with a focus on motivations and capabilities of SCTP.
The document discusses various topics related to flow and error control in computer networks, including stop-and-wait ARQ, sliding window protocols, and selective reject ARQ. Stop-and-wait ARQ allows transmission of one frame at a time, while sliding window protocols allow multiple outstanding frames using sequence numbers and acknowledgments. Go-back-N ARQ requires retransmission of frames from the lost frame onward, while selective reject ARQ only retransmits the lost frame to minimize retransmissions.
Computer Networks Unit 2 UNIT II DATA-LINK LAYER & MEDIA ACCESSDr. SELVAGANESAN S
The document discusses data link layer framing and protocols. It describes:
1) Two main approaches to framing - byte-oriented (using sentinel characters) and bit-oriented (using bit stuffing). Protocols discussed include BISYNC, DDCMP, and HDLC.
2) Features of PPP framing including negotiated field sizes and use of LCP control messages.
3) Functions of data link layer including framing, flow control, error control, and media access control. The relationship between the logical link control and media access control sublayers is also covered.
The document discusses the Internet Control Message Protocol (ICMP). ICMP provides error reporting, congestion reporting, and first-hop router redirection. It uses IP to carry its data end-to-end and is considered an integral part of IP. ICMP messages are encapsulated in IP datagrams and are used to report errors in IP datagrams, though some errors may still result in datagrams being dropped without a report. ICMP defines various message types including error messages like destination unreachable and informational messages like echo request and reply.
This document discusses wireless local area networks (WLANs) and the IEEE 802.11 standard. It covers the architectural comparison of wired vs wireless networks, common problems in WLANs including attenuation, interference and multipath propagation. It also summarizes the addressing modes, access methods, frame format and architecture of WLANs including the basic service set, extended service set, and distributed coordination and point coordination functions.
The document discusses various data link layer protocols. It begins by introducing stop-and-wait and sliding window protocols. It then provides an example of a stop-and-wait protocol where a frame is lost, leading the sender to retransmit a duplicate frame. Next, it discusses sliding window protocols and provides an example where the window allows multiple outstanding frames. Finally, it gives an example of a one-bit sliding window protocol that uses acknowledgments to control the window.
This document provides an overview of Mobile IP, including its key requirements, terminology, and technical processes. Mobile IP allows devices to change networks without losing connectivity by updating their location through registration with a home agent. It aims to remain compatible with existing IP standards while providing transparency to higher-level applications and efficiency at scale. The document explains concepts such as home and foreign networks, care-of addresses, agents, registration, tunneling, and optimization techniques.
The document discusses the differences between packets and frames, and provides details on the transport layer. It explains that the transport layer is responsible for process-to-process delivery and uses port numbers for addressing. Connection-oriented protocols like TCP use three-way handshaking for connection establishment and termination, and implement flow and error control using mechanisms like sliding windows. Connectionless protocols like UDP are simpler but unreliable, treating each packet independently.
RIP is an interior gateway protocol that uses distance vector routing and the Bellman-Ford algorithm to dynamically adapt to network changes. It works by having each router calculate the distances to reachable networks and share these distances with neighboring routers. However, RIP has issues with slow convergence and count-to-infinity problems when network failures occur. Several techniques are used to address these issues, including hold downs, split horizon, poison reverse updates, and triggered updates.
The document discusses flow control in TCP. It explains that TCP uses a sliding window mechanism for flow control to balance the sender's transmission rate with the receiver's reception rate. The sliding window allows packets within the window to be transmitted, and slides to the right when acknowledgments are received, making room for more packets. Problems like delayed acknowledgments, silly window syndrome, and solutions like Nagle's algorithm are also covered. TCP provides reliable data transfer using error control mechanisms like checksums, acknowledgments, and retransmissions of lost packets.
The First Come First Serve (FCFS) CPU scheduling algorithm processes jobs in the order that they arrive in the ready queue. Newly arrived processes are added to the tail of the FIFO queue. The first process in the queue is scheduled first and removed from the queue. This is the simplest scheduling algorithm to implement but can result in long average wait times for processes as later arriving processes may have to wait for all earlier processes to complete.
This document discusses various data link control protocols. It covers framing, flow and error control, and specific protocols like HDLC and PPP. Framing involves adding structure like headers and trailers to organize data into packets. Flow and error control techniques like stop-and-wait ARQ and sliding window protocols are used to ensure reliable transmission over noisy channels. HDLC is a widely used bit-oriented protocol that defines frame structures and error control. PPP is a point-to-point protocol commonly used for dial-up internet access.
Mobile computing unit2,SDMA,FDMA,CDMA,TDMA Space Division Multi Access,Frequ...Pallepati Vasavi
This document discusses various terminology related to the MAC sublayer, including:
1. The station model consisting of independent stations that generate frames for transmission.
2. The single channel assumption where a single channel is available for all communication.
3. The collision assumption where if two frames are transmitted simultaneously they will overlap and be garbled.
It then covers concepts such as carrier sensing, hidden and exposed terminals, and near and far terminals that create challenges for wireless networks. Finally, it introduces various multiple access methods including SDMA, FDMA, TDMA, and CDMA.
The document discusses MAC layer protocols, specifically CSMA/CD and CSMA/CA.
CSMA/CD is used for wired networks and works by having nodes listen to check if the medium is free before transmitting. If a collision is detected, transmission stops and resumes after a backoff time.
CSMA/CA is used for wireless networks and aims to avoid collisions through the use of request to send, clear to send, and acknowledgement frames exchanged between nodes, rather than detecting collisions.
Both protocols reduce collisions compared to simple CSMA, but CSMA/CA is less efficient and cannot completely solve collisions in wireless networks due to issues like hidden terminals.
GSM uses frequency division duplexing with carriers separated by 200 kHz. Each carrier is divided into 8 time slots using TDMA. Logical channels like traffic channels and signaling channels are mapped onto these physical time slots. Traffic channels carry user data at either full rate or half rate, while signaling channels include broadcast, common, and dedicated control channels used for functions like synchronization, paging, call setup, and handover.
The document provides an overview of the Address Resolution Protocol (ARP). It discusses:
- ARP allows mapping between a host's logical IP address to its physical MAC address on a local area network.
- Each device maintains an ARP cache table to map IP-MAC address pairs for other devices on the network. An ARP request is broadcast to resolve addresses and the responding device unicasts an ARP reply.
- ARP spoofing vulnerabilities exist since ARP does not authenticate requests/replies, allowing an attacker to poison a device's ARP cache with false address mappings and intercept network traffic.
The mapping of Layer 3 (IP) to Layer 2 (MAC) addresses is a key service in IP networks, and is achieved via the ARP protocol in IPv4, and the NDP protocol in IPv6. Due to their stateless nature and lack of authentication, both ARP and NDP are vulnerable to spoofing attacks, which can enable Denial of Service (DoS) or man-in-the-middle (MITM) attacks. In this paper, we discuss the problem of ARP spoofing in the context of Software Defined Networks (SDNs), and present a new mitigation approach which leverages the centralised network control of SDN.
This presentation outlines the core functions of TCP - Transmission Control Protocol.
These comprise TCP Connection Control, TCP Flow Control, TCP Error Control, TCP Congestion Control, TCP Options and TCP Timers.
TCP/IP is the Internet core protocol that provides reliable, connection-oriented and stream-based communication service. Most of Internet traffic is carried in TCP connections, so scalability and reliability are crucial for a stable network on a global scale.
The document discusses various aspects of transport layer protocols including services provided, primitives, addressing, connection establishment and release, flow control, multiplexing, crash recovery, TCP and UDP, and performance issues. Specific topics covered include Berkeley sockets, an example file server, TCP and UDP headers, congestion control, and fast TPDU processing techniques.
ARP is a protocol that maps IP addresses to MAC addresses. It works by broadcasting an ARP request packet to all devices on the local network segment. The device with the matching IP address responds with its MAC address, allowing the requesting device to send packets directly to the destination MAC address on the local network.
This document provides an overview of transport layer protocols TCP, UDP, and SCTP. It discusses the history and evolution of TCP, including key developments like congestion control algorithms. UDP is described as a connectionless and unreliable protocol. SCTP is introduced as a protocol developed to transport telephony signaling over IP networks. It addresses limitations of TCP like head-of-line blocking and provides features like multi-homing and message orientation. The document defines SCTP terminology and describes its chunks, states, congestion control approach, and similarities to TCP. In summary, it serves as a high-level introduction to transport protocols with a focus on motivations and capabilities of SCTP.
The document discusses various topics related to flow and error control in computer networks, including stop-and-wait ARQ, sliding window protocols, and selective reject ARQ. Stop-and-wait ARQ allows transmission of one frame at a time, while sliding window protocols allow multiple outstanding frames using sequence numbers and acknowledgments. Go-back-N ARQ requires retransmission of frames from the lost frame onward, while selective reject ARQ only retransmits the lost frame to minimize retransmissions.
Computer Networks Unit 2 UNIT II DATA-LINK LAYER & MEDIA ACCESSDr. SELVAGANESAN S
The document discusses data link layer framing and protocols. It describes:
1) Two main approaches to framing - byte-oriented (using sentinel characters) and bit-oriented (using bit stuffing). Protocols discussed include BISYNC, DDCMP, and HDLC.
2) Features of PPP framing including negotiated field sizes and use of LCP control messages.
3) Functions of data link layer including framing, flow control, error control, and media access control. The relationship between the logical link control and media access control sublayers is also covered.
The document discusses the Internet Control Message Protocol (ICMP). ICMP provides error reporting, congestion reporting, and first-hop router redirection. It uses IP to carry its data end-to-end and is considered an integral part of IP. ICMP messages are encapsulated in IP datagrams and are used to report errors in IP datagrams, though some errors may still result in datagrams being dropped without a report. ICMP defines various message types including error messages like destination unreachable and informational messages like echo request and reply.
This document discusses wireless local area networks (WLANs) and the IEEE 802.11 standard. It covers the architectural comparison of wired vs wireless networks, common problems in WLANs including attenuation, interference and multipath propagation. It also summarizes the addressing modes, access methods, frame format and architecture of WLANs including the basic service set, extended service set, and distributed coordination and point coordination functions.
The document discusses various data link layer protocols. It begins by introducing stop-and-wait and sliding window protocols. It then provides an example of a stop-and-wait protocol where a frame is lost, leading the sender to retransmit a duplicate frame. Next, it discusses sliding window protocols and provides an example where the window allows multiple outstanding frames. Finally, it gives an example of a one-bit sliding window protocol that uses acknowledgments to control the window.
This document provides an overview of Mobile IP, including its key requirements, terminology, and technical processes. Mobile IP allows devices to change networks without losing connectivity by updating their location through registration with a home agent. It aims to remain compatible with existing IP standards while providing transparency to higher-level applications and efficiency at scale. The document explains concepts such as home and foreign networks, care-of addresses, agents, registration, tunneling, and optimization techniques.
The document discusses the differences between packets and frames, and provides details on the transport layer. It explains that the transport layer is responsible for process-to-process delivery and uses port numbers for addressing. Connection-oriented protocols like TCP use three-way handshaking for connection establishment and termination, and implement flow and error control using mechanisms like sliding windows. Connectionless protocols like UDP are simpler but unreliable, treating each packet independently.
RIP is an interior gateway protocol that uses distance vector routing and the Bellman-Ford algorithm to dynamically adapt to network changes. It works by having each router calculate the distances to reachable networks and share these distances with neighboring routers. However, RIP has issues with slow convergence and count-to-infinity problems when network failures occur. Several techniques are used to address these issues, including hold downs, split horizon, poison reverse updates, and triggered updates.
The document discusses flow control in TCP. It explains that TCP uses a sliding window mechanism for flow control to balance the sender's transmission rate with the receiver's reception rate. The sliding window allows packets within the window to be transmitted, and slides to the right when acknowledgments are received, making room for more packets. Problems like delayed acknowledgments, silly window syndrome, and solutions like Nagle's algorithm are also covered. TCP provides reliable data transfer using error control mechanisms like checksums, acknowledgments, and retransmissions of lost packets.
The First Come First Serve (FCFS) CPU scheduling algorithm processes jobs in the order that they arrive in the ready queue. Newly arrived processes are added to the tail of the FIFO queue. The first process in the queue is scheduled first and removed from the queue. This is the simplest scheduling algorithm to implement but can result in long average wait times for processes as later arriving processes may have to wait for all earlier processes to complete.
This document discusses various data link control protocols. It covers framing, flow and error control, and specific protocols like HDLC and PPP. Framing involves adding structure like headers and trailers to organize data into packets. Flow and error control techniques like stop-and-wait ARQ and sliding window protocols are used to ensure reliable transmission over noisy channels. HDLC is a widely used bit-oriented protocol that defines frame structures and error control. PPP is a point-to-point protocol commonly used for dial-up internet access.
Mobile computing unit2,SDMA,FDMA,CDMA,TDMA Space Division Multi Access,Frequ...Pallepati Vasavi
This document discusses various terminology related to the MAC sublayer, including:
1. The station model consisting of independent stations that generate frames for transmission.
2. The single channel assumption where a single channel is available for all communication.
3. The collision assumption where if two frames are transmitted simultaneously they will overlap and be garbled.
It then covers concepts such as carrier sensing, hidden and exposed terminals, and near and far terminals that create challenges for wireless networks. Finally, it introduces various multiple access methods including SDMA, FDMA, TDMA, and CDMA.
The document discusses MAC layer protocols, specifically CSMA/CD and CSMA/CA.
CSMA/CD is used for wired networks and works by having nodes listen to check if the medium is free before transmitting. If a collision is detected, transmission stops and resumes after a backoff time.
CSMA/CA is used for wireless networks and aims to avoid collisions through the use of request to send, clear to send, and acknowledgement frames exchanged between nodes, rather than detecting collisions.
Both protocols reduce collisions compared to simple CSMA, but CSMA/CA is less efficient and cannot completely solve collisions in wireless networks due to issues like hidden terminals.
GSM uses frequency division duplexing with carriers separated by 200 kHz. Each carrier is divided into 8 time slots using TDMA. Logical channels like traffic channels and signaling channels are mapped onto these physical time slots. Traffic channels carry user data at either full rate or half rate, while signaling channels include broadcast, common, and dedicated control channels used for functions like synchronization, paging, call setup, and handover.
The document provides an overview of the Address Resolution Protocol (ARP). It discusses:
- ARP allows mapping between a host's logical IP address to its physical MAC address on a local area network.
- Each device maintains an ARP cache table to map IP-MAC address pairs for other devices on the network. An ARP request is broadcast to resolve addresses and the responding device unicasts an ARP reply.
- ARP spoofing vulnerabilities exist since ARP does not authenticate requests/replies, allowing an attacker to poison a device's ARP cache with false address mappings and intercept network traffic.
The mapping of Layer 3 (IP) to Layer 2 (MAC) addresses is a key service in IP networks, and is achieved via the ARP protocol in IPv4, and the NDP protocol in IPv6. Due to their stateless nature and lack of authentication, both ARP and NDP are vulnerable to spoofing attacks, which can enable Denial of Service (DoS) or man-in-the-middle (MITM) attacks. In this paper, we discuss the problem of ARP spoofing in the context of Software Defined Networks (SDNs), and present a new mitigation approach which leverages the centralised network control of SDN.
The document discusses Address Resolution Protocol (ARP), which allows a machine on a network to dynamically map logical IP addresses to physical hardware addresses. It describes how ARP works by broadcasting a request packet to find the physical address associated with a target IP address. The target machine then responds with its physical address in an ARP reply message. The original sender can then directly address packets to the target using its physical address. The document outlines the ARP packet format and encapsulation process, as well as the basic steps of how ARP operates to perform dynamic address mapping on a network.
This document presents a technique to identify the correct IP to MAC address mapping when an attacker is performing ARP spoofing. It discusses limitations of existing probe packet-based detection techniques when facing a strong attacker. The proposed technique generates broadcast ARP requests to identify the correct mapping, even if the attacker can modify the protocol stack. Experimental results show the technique can correctly identify the attacker in both weak and strong attacking environments with only a small increase in network traffic overhead.
ARP resolves IP addresses to MAC addresses for local network delivery. It uses broadcast datagrams to request MAC addresses and unicasts to reply. Proxy ARP allows routers to answer for hosts on remote networks during subnet transition. RARP and Inverse ARP work in reverse to resolve MAC addresses to IP addresses.
ARP and RARP protocols are used to map IP addresses to MAC addresses on local area networks. ARP requests are broadcast to the network to resolve IP to MAC addresses, and ARP replies provide the requested mapping. Hosts cache ARP entries to avoid frequent address resolution, with entries expiring after 20 minutes. Proxy ARP allows a router to respond to ARP requests on behalf of hosts on different connected networks.
Et3003 sem2-1314-6 network layers iii (arp)Tutun Juhana
The document discusses address resolution protocol (ARP) which allows devices on a local area network to dynamically map IP addresses to physical addresses. It describes ARP's operation where a device sends an ARP request as a broadcast to find the physical address associated with a known IP address. The target device responds with its physical address allowing future communication. Proxy ARP is also described, where a router will respond to ARP requests on behalf of devices, acting as a proxy to allow routing between subnets.
The document discusses the Address Resolution Protocol (ARP) which relates IP addresses to hardware addresses to allow communication within a local area network (LAN). ARP works by broadcasting a query to find the MAC address associated with a given IP address, and the corresponding host responds with its MAC address. Devices store IP-MAC bindings learned from ARP in a local cache to avoid broadcasting for each packet. The router can also respond to ARP requests on behalf of hosts on different subnets using proxy ARP.
Address resolution protocol and internet control message protocolasimnawaz54
ICMP provides error reporting and feedback messages for IP. It uses IP datagrams to transport control messages between hosts and routers. ICMP messages include echo requests/replies used by ping, time exceeded and destination unreachable errors, redirects, and path MTU discovery fragments needed messages. ARP resolves IP addresses to hardware addresses locally through broadcast requests and unicast replies to populate caches. Proxy ARP allows routers to answer for hosts on remote networks to allow communication before subnet migration.
The document discusses several Internet protocols:
- IP prepares packets for transmission across the Internet and provides unreliable packet delivery. IPv6 was created to address issues with IPv4 like exhaustion of addresses.
- ARP resolves IP addresses to hardware addresses on local networks and maintains address mappings in caches.
- ICMP provides error reporting and network monitoring functions to support IP.
- TCP provides reliable data transmission and UDP provides simple transmission of datagrams.
The document discusses Address Resolution Protocol (ARP) which resolves IP addresses to MAC addresses on local area networks. It provides details on ARP requests, replies, and vulnerabilities like ARP poisoning. It also covers related topics like proxy ARP and variants of ARP used in other network types. The case study certificate is for a student who completed a case study on internet technology and ARP.
This document describes a group project to build a NAT64 server that connects IPv4 clients to IPv6 servers and vice versa. The project involves implementing IPv4 to IPv6 and IPv6 to IPv4 conversion algorithms and combining them into a NAT64 module. Key steps include implementing a tri-mode Ethernet MAC wrapper, mapping IPv4 and IPv6 header fields, and using a static NAT table to map IPv4 and IPv6 addresses. The project was developed on a Virtex-5 FPGA board and debugged using ChipScope Pro and Wireshark due to limitations of available simulators.
This document discusses the Address Resolution Protocol (ARP) and Reverse Address Resolution Protocol (RARP). ARP maps logical IP addresses to physical hardware addresses, allowing communication on a local area network. RARP performs the inverse mapping of physical to logical addresses. The document covers the need for and use cases of ARP and RARP, their packet formats, encapsulation, and key components like caches, queues and servers that perform the address mappings.
The Address Resolution Protocol (ARP) resolves IP addresses to MAC addresses to allow communication between hosts on a local area network (LAN). ARP maintains a cache that maps IP addresses to MAC addresses. Static and dynamic entries are stored in the ARP cache, with dynamic entries expiring after a timeout period. Proxy ARP and other protocols like Reverse ARP and Serial Line ARP provide additional ARP functionality in certain network configurations.
This document provides an overview of topics in the network layer, including IPv4, IPv6, routing algorithms, and routing protocols. It describes the basics of IPv4 addressing and how IPv6 was developed to address limitations in IPv4, notably its limited 32-bit address space. It also outlines link state and distance vector routing algorithms, and examines specific routing protocols like RIP, OSPF, and BGP. The key topics covered provide essential information on the fundamental concepts and components that make up network layer operations.
This document discusses Address Resolution Protocol (ARP) which maps IP addresses to physical addresses to allow communication between hosts on a local area network (LAN). It describes how ARP uses broadcasts to resolve addresses dynamically and how static mappings can also be used. It also discusses how ARP works over ATM networks using ATMARP, including request/reply messages and building mapping tables. Finally, it outlines the typical components of an ARP software package including cache tables, queues, input/output modules, and cache control.
ARP enables hosts on a network to dynamically map IP addresses to physical hardware addresses. Each host maintains an ARP cache containing IP to physical address mappings. When a host needs to send data to another host, it first checks its ARP cache for the mapping. If no mapping exists, the host broadcasts an ARP request containing the target IP address. The host with that IP address responds with its physical address, which the requesting host adds to its ARP cache. This process allows hosts to dynamically learn each other's physical addresses as needed for packet transmission.
presentation pour nouvrlle technologie.pptmerazgaammar2
The document discusses the IEEE 802.15.4 standard for low-power wireless personal area networks. It describes the standard's key aspects like operating frequencies and data rates, topologies, addressing schemes, and channel access methods. The standard aims to enable low-rate wireless personal area networks and supports star and peer-to-peer topologies with full-function and reduced-function device types.
This module covers address resolution protocols. It discusses how ARP works to resolve IPv4 addresses to MAC addresses. It also discusses IPv6 neighbor discovery, which uses ICMPv6 messages to resolve IPv6 addresses to MAC addresses. The module includes topics on MAC and IP addressing, how ARP functions, IPv6 neighbor discovery messages and operations, and hands-on labs to examine address resolution processes.
This document discusses IP forwarding and the delivery of IP datagrams. It covers:
- IP networks are logical entities represented as "clouds" that ignore the underlying data link layers.
- For successful delivery, each data link network must connect to another via a router and network prefixes must correspond to unique data link networks.
- Routers and hosts use routing tables to determine the next hop for outgoing datagrams based on destination address and interface.
- IP forwarding processes incoming datagrams, looking them up in routing tables to determine the outgoing interface. It is enabled on routers and disabled on hosts.
- The longest prefix match is used for routing table lookups to determine the most specific match. Route aggregation reduces routing table
Routing protocols RIP, OSPF, and BGP are discussed. RIP uses distance vector routing and shares periodic updates with direct neighbors. OSPF is an intra-domain link state protocol where routers flood their link state information. BGP is an inter-domain path vector protocol that shares the full path to a destination rather than just hop counts.
The document discusses the Border Gateway Protocol (BGP), which is used to exchange routing information between autonomous systems on the Internet. It describes how BGP uses path attributes and policy-based routing to establish the best routes between networks administered by different autonomous systems. BGP speakers exchange updates to populate forwarding tables and compute the optimal path while applying local routing policies.
The document discusses TCP/IP networks and network management using SNMP. It covers:
- TCP/IP is a suite of protocols including IP, TCP, UDP, and ICMP that power the Internet.
- Network management involves functions like fault management, configuration management, and performance monitoring. It aims to ensure network reliability.
- SNMP is the standard network management protocol that runs over TCP/IP. It allows network devices to be monitored and controlled remotely using get, set, and trap operations.
This document discusses two file transfer protocols: FTP and TFTP. FTP uses TCP and requires two connections - one for control and one for data transfer. It addresses issues like different file formats between systems. TFTP is simpler, using UDP instead of TCP. It is used to quickly download small bootstrap and configuration files when systems boot. TFTP uses well-known port 69 while FTP uses ports 20 and 21. The document provides diagrams illustrating the connections and operations of each protocol.
The document discusses several application layer protocols used for remote access and file transfer over TCP/IP networks, including HTTP, Telnet, and SSH. It provides the following key details:
1. HTTP is the application layer protocol that defines how web clients and servers communicate to transfer web pages and other content. It allows clients to send requests for files and receive responses from servers.
2. Telnet is an older protocol that allows establishing terminal sessions with remote systems, making the local terminal appear like it is directly connected to the remote system. It uses options negotiation to configure settings like echoing of characters.
3. SSH was developed as a more secure replacement for Telnet, using encryption for authentication and data transfer
IP is the principal communications protocol in the Internet protocol suite for relaying datagrams across network boundaries. It is a connectionless, best-effort protocol that does not guarantee delivery. IP packets can be fragmented into smaller units if their size exceeds the maximum transmission unit of the network. Fragmentation involves splitting the packet into multiple fragments that contain the same identification field but varying fragment offset and total length fields. The fragments are reassembled into the original packet at the destination.
TCP uses three main control mechanisms:
1. Flow control prevents senders from overrunning receivers using acknowledgments and a sliding window approach.
2. Error control uses retransmission timers and exponential backoff to recover from lost packets.
3. Congestion control prevents senders from overloading the network by adjusting the congestion window based on network feedback.
The document discusses the Transmission Control Protocol (TCP). It explains that TCP provides reliable, ordered delivery of a stream of bytes between applications on networked hosts. It accomplishes this through functions like segmenting data, assigning port numbers to identify applications, establishing connections, providing acknowledgements and retransmissions to ensure reliable delivery, and maintaining sequence numbers to ensure correct ordering. The document also describes TCP's three-way handshake for connection establishment and four-step process for connection termination.
UDP is a connectionless transport protocol that does not guarantee packet delivery or order. It is faster than TCP but does not ensure reliability. UDP packets have a header containing source and destination port numbers as well as length fields. The checksum field allows detecting errors but packets are not retransmitted if errors occur. UDP is suitable for real-time applications where speed is critical and packet loss can be tolerated.
The document discusses the User Datagram Protocol (UDP) and transport layer protocols. It provides information on UDP including that it is a connectionless protocol that does not guarantee packet delivery or order. UDP has lower overhead than TCP but also does not ensure data integrity. The document also discusses transport layer responsibilities like process-to-process delivery using port numbers, end-to-end connections with TCP and UDP, and multiplexing/demultiplexing.
The Domain Name System (DNS) is a hierarchical distributed database that maps domain names to IP addresses. It uses a client-server model where clients submit queries and servers respond authoritatively. DNS provides mapping from human-readable domain names to numerical IP addresses to make the internet easier to use. It is a critical service that enables users to access internet resources by name.
This document provides an overview of the Internet Control Message Protocol (ICMP). It discusses how ICMP supports IP by providing error reporting and simple queries. It describes the ICMP message format including type, code, and checksum fields. It gives examples of common ICMP query messages like echo request/reply and timestamp request/reply. It also discusses ICMP error messages, including how they are formatted and common error types like destination unreachable, redirect, time exceeded, and parameter problem. It provides details on some destination unreachable error subtypes and gives an example of an ICMP port unreachable message.
This document discusses IP addresses and their structure. It covers the following key points in 3 sentences:
IP addresses have both a network prefix that identifies a network and a host number that identifies a specific device. Subnetting allows an organization to split the host number portion of an IP address into a subnet number and a smaller host number, creating a three-level address hierarchy. The traditional class-based IP address system had problems with inefficient address allocation and inflexible network sizes that motivated the development of subnetting and Classless Inter-Domain Routing (CIDR).
The document provides information on the TCP/IP protocol suite including:
- TCP/IP has 4 layers (Application, Transport, Network, Data Link) compared to OSI's 7 layers.
- Common application layer protocols include FTP, Telnet, SMTP, HTTP.
- Transport layer protocols are TCP and UDP which provide reliable and unreliable data transmission.
- Network layer protocols like IP, ARP, and ICMP handle routing and addressing.
- Layers communicate through encapsulation where each layer adds its own header to protocol data units.
This document provides an overview of important networking concepts. It discusses data communication components and various transmission mediums including Ethernet, Fast Ethernet, Gigabit Ethernet, LocalTalk, Token Ring, FDDI, ATM, and wireless technologies. It also describes common network hardware such as hubs, switches, bridges, repeaters, routers, and NICs. Finally, it covers common network media including twisted pair, coaxial, fiber optic, and wireless and discusses specifications for Ethernet and optical fiber.
This document provides an overview of computer networks and networking concepts. It discusses different types of networks like local area networks (LANs), metropolitan area networks (MANs), and wide area networks (WANs). It also covers topics like network topologies, protocols, the OSI model, and how data is transmitted across networks from one location to another. The document appears to be teaching materials for a university-level computer networking course.
Main Java[All of the Base Concepts}.docxadhitya5119
This is part 1 of my Java Learning Journey. This Contains Custom methods, classes, constructors, packages, multithreading , try- catch block, finally block and more.
This presentation was provided by Steph Pollock of The American Psychological Association’s Journals Program, and Damita Snow, of The American Society of Civil Engineers (ASCE), for the initial session of NISO's 2024 Training Series "DEIA in the Scholarly Landscape." Session One: 'Setting Expectations: a DEIA Primer,' was held June 6, 2024.
Executive Directors Chat Leveraging AI for Diversity, Equity, and InclusionTechSoup
Let’s explore the intersection of technology and equity in the final session of our DEI series. Discover how AI tools, like ChatGPT, can be used to support and enhance your nonprofit's DEI initiatives. Participants will gain insights into practical AI applications and get tips for leveraging technology to advance their DEI goals.
Macroeconomics- Movie Location
This will be used as part of your Personal Professional Portfolio once graded.
Objective:
Prepare a presentation or a paper using research, basic comparative analysis, data organization and application of economic information. You will make an informed assessment of an economic climate outside of the United States to accomplish an entertainment industry objective.
Introduction to AI for Nonprofits with Tapp NetworkTechSoup
Dive into the world of AI! Experts Jon Hill and Tareq Monaur will guide you through AI's role in enhancing nonprofit websites and basic marketing strategies, making it easy to understand and apply.
A workshop hosted by the South African Journal of Science aimed at postgraduate students and early career researchers with little or no experience in writing and publishing journal articles.
A Strategic Approach: GenAI in EducationPeter Windle
Artificial Intelligence (AI) technologies such as Generative AI, Image Generators and Large Language Models have had a dramatic impact on teaching, learning and assessment over the past 18 months. The most immediate threat AI posed was to Academic Integrity with Higher Education Institutes (HEIs) focusing their efforts on combating the use of GenAI in assessment. Guidelines were developed for staff and students, policies put in place too. Innovative educators have forged paths in the use of Generative AI for teaching, learning and assessments leading to pockets of transformation springing up across HEIs, often with little or no top-down guidance, support or direction.
This Gasta posits a strategic approach to integrating AI into HEIs to prepare staff, students and the curriculum for an evolving world and workplace. We will highlight the advantages of working with these technologies beyond the realm of teaching, learning and assessment by considering prompt engineering skills, industry impact, curriculum changes, and the need for staff upskilling. In contrast, not engaging strategically with Generative AI poses risks, including falling behind peers, missed opportunities and failing to ensure our graduates remain employable. The rapid evolution of AI technologies necessitates a proactive and strategic approach if we are to remain relevant.
2. Discussion
• Understand the need for ARP
• Understand the cases in which ARP is used
• Understand the components and interactions in an ARP package
• Understand the need for RARP
Department of Computer Science, Pondicherry University, Puducherry - 605014
4. Address Mapping
• The delivery of a packet to a host or a router requires
two levels of addressing: logical and physical.
• It needs to be able to map a logical address to its
corresponding physical address and vice versa.
• These can be done using either static or dynamic
mapping.
Department of Computer Science, Pondicherry University, Puducherry - 605014
5. Address Mapping
• Anytime a host or a router has an IP datagram to send to
another host or router, it has the logical (IP) address of
the receiver.
• But the IP datagram must be encapsulated in a frame to
be able to pass through the physical network.
• This means that the sender needs the physical address of
the receiver.
• A mapping corresponds a logical address to a physical
address.
• ARP accepts a logical address from the IP protocol,
maps the address to the corresponding physical address
and pass it to the data link layer.
Department of Computer Science, Pondicherry University, Puducherry - 605014
8. ARP and RARP
– The Internet is based on IP addresses
– Data link protocols (Ethernet, FDDI, ATM) may have
different (MAC) addresses
• The ARP and RARP protocols perform the translation
between IP addresses and MAC layer addresses
• ARP for broadcast LANs, particularly Ethernet LANs
RARP
Ethernet MAC
address
(48 bit)
ARPIP address
(32 bit)
Department of Computer Science, Pondicherry University, Puducherry - 605014
9. Processing of IP packets by network device drivers
loopback
Driver
IP Input
Put on IP
input queue
ARP
demultiplex
Ethernet Frame
Ethernet
IP destination of packet
= local IP address ?
IP destination = multicast
or broadcast ?
IP Output
Put on IP
input queue
No: get MAC
address with
ARP
ARP
Packet
IP datagram
No
Yes
Yes
Ethernet
Driver
Department of Computer Science, Pondicherry University, Puducherry - 605014
10. Address Translation with ARP
ARP Request:
Sender broadcasts an ARP request to all stations on the
network: What is the hardware address of Router137?
Argon
128.143.137.144
00:a0:24:71:e4:44
Router137
128.143.137.1
00:e0:f9:23:a8:20
ARP Request:
What is the MAC address
of 128.143.71.1?
Department of Computer Science, Pondicherry University, Puducherry - 605014
11. Address Translation with ARP
DCHP Server
Department of Computer Science, Pondicherry University, Puducherry - 605014
13. Example 1: ARP Request
Department of Computer Science, Pondicherry University, Puducherry - 605014
14. Example 1: ARP Reply
Department of Computer Science, Pondicherry University, Puducherry - 605014
15. Address Translation with ARP
ARP Reply:
Router 137 responds with an ARP Reply which contains
the hardware address
Argon
128.143.137.144
00:a0:24:71:e4:44
Router137
128.143.137.1
00:e0:f9:23:a8:20
ARP Reply:
The MAC address of 128.143.71.1
is 00:e0:f9:23:a8:20
Department of Computer Science, Pondicherry University, Puducherry - 605014
16. ARP Packet Format
Destination
address
6
ARP Request or ARP Reply
28
Source
address
6 2
CRC
4
Type
0x8060
Padding
10
Ethernet II header
Hardware type (2 bytes)
Hardware address
length (1 byte)
Protocol address
length (1 byte)
Operation code (2 bytes)
Target hardware address*
Protocol type (2 bytes)
Source hardware address*
Source protocol address*
Target protocol address*
* Note: The length of the address fields is determined by the corresponding address length fields
Department of Computer Science, Pondicherry University, Puducherry - 605014
22. ARP Encapsulation
• ARP request and reply packets.
• Note that the ARP data field in this case is 28 bytes,
and that the individual addresses do not fit in the 4-
byte boundary.
• That is why we do not show the regular 4-byte
boundaries for these addresses.
• Also note that the IP addresses are shown in
hexadecimal.
Department of Computer Science, Pondicherry University, Puducherry - 605014
24. Four Cases on ARP
Department of Computer Science, Pondicherry University, Puducherry - 605014
25. Case1: Host - Host
The IP address of destination host is taken from the IP datagram.
Department of Computer Science, Pondicherry University, Puducherry - 605014
26. Case 2: Host to Router
• The IP address of the destination (router) is not taken
from the IP datagram.
• Instead it is taken from the next-hop column of the
Routerng table of the source host.
27. Case 3: Router to Router
• The IP address of destination (router) is not taken from
the IP datagram.
• Instead it is taken from the next-hop column of the
sending router’s routing table
Department of Computer Science, Pondicherry University, Puducherry - 605014
28. Case 4: Router to Host
• Now, the IP address of destination host is taken from the
IP datagram.
Department of Computer Science, Pondicherry University, Puducherry - 605014
30. Example
A host with IP address 130.23.43.20 and physical
address B2:34:55:10:22:10 has a packet to send to
another host with IP address 130.23.43.25 and physical
address A4:6E:F4:59:83:AB.
The two hosts are on the same Ethernet network. Show
the ARP request and reply packets encapsulated in
Ethernet frames.
Department of Computer Science, Pondicherry University, Puducherry - 605014
31. Example
Solution
Figure 8.6 shows the ARP request and reply packets.
Note that the ARP data field in this case is 28 bytes, and
that the individual addresses do not fit in the 4-byte
boundary.
That is why we do not show the regular 4-byte
boundaries for these addresses.
Also note that the IP addresses are shown in
hexadecimal.
Department of Computer Science, Pondicherry University, Puducherry - 605014
32. ARP Cache Table
It would be very inefficient to use ARP to deliver each
IP datagram.
Therefore the most recent mappings are kept in a
cache table.
In order to be consistent with network dynamics,
entries in the ARP cache have a timeout value which
is used to remove aged entries.
Department of Computer Science, Pondicherry University, Puducherry - 605014
33. ARP Cache Table (Contd.)
The ARP cache of a host can be displayed with the
command:
arp –a (the command is the same on Windows and UNIX)
Department of Computer Science, Pondicherry University, Puducherry - 605014
34. ARP Cache Table (Contd.)
The implementation of an ARP cache table requires
more than the essential information shown on the
previous two slides
Department of Computer Science, Pondicherry University, Puducherry - 605014
35. ARP Cache
Since sending an ARP request/reply for each IP datagram is
inefficient, hosts maintain a cache (ARP Cache) of current
entries.
The entries expire after 20 minutes.
Contents of the ARP Cache:
(128.143.71.37) at 00:10:4B:C5:D1:15 [ether] on eth0
(128.143.71.36) at 00:B0:D0:E1:17:D5 [ether] on eth0
(128.143.71.35) at 00:B0:D0:DE:70:E6 [ether] on eth0
(128.143.136.90) at 00:05:3C:06:27:35 [ether] on eth1
(128.143.71.34) at 00:B0:D0:E1:17:DB [ether] on eth0
(128.143.71.33) at 00:B0:D0:E1:17:DF [ether] on eth0
Department of Computer Science, Pondicherry University, Puducherry - 605014
36. ARP Caching
• The ARP output module receives an IP datagram (from the IP layer) with
the destination address 114.5.7.89.
• It checks the cache table and finds that an entry exists for this destination
with the RESOLVED state (R in the table).
• It extracts the hardware address, which is 457342ACAE32, and sends the
packet and the address to the data link layer for transmission.
• The cache table remains the same.
Department of Computer Science, Pondicherry University, Puducherry - 605014
37. ARP Caching
• Twenty seconds later, the ARP output module receives an IP datagram (from
the IP layer) with the destination address 116.1.7.22.
• It checks the cache table and does not find this destination in the table. The
module adds an entry to the table with the state PENDING and the Attempt
value 1.
• It creates a new queue for this destination and enqueues the packet. It then
sends an ARP request to the data link layer for this destination.
• The new cache table is shown in Table
Department of Computer Science, Pondicherry University, Puducherry - 605014
38. ARP Caching
• Fifteen seconds later, the ARP input module receives an ARP packet with
target protocol (IP) address 188.11.8.71.
• The module checks the table and finds this address.
• It changes the state of the entry to RESOLVED and sets the time-out value
to 900. The module then adds the target hardware address (E34573242ACA)
to the entry.
• Now it accesses queue 18 and sends all the packets in this queue, one by
one, to the data link layer.
• The new cache table is shown in Table 8.7.
Department of Computer Science, Pondicherry University, Puducherry - 605014
39. ARP Caching
• Twenty-five seconds later, the cache-control module updates every entry. The
time-out values for the first three resolved entries are decremented by 60.
• The time-out value for the last resolved entry is decremented by 25. The state
of the next-to-the last entry is changed to FREE because the time-out is zero.
• For each of the three pending entries, the value of the attempts
• field is incremented by one. After incrementing, the attempts value for one
entry (the one with IP address 201.11.56.7) is more than the maximum; the
state is changed to FREE, the queue is deleted, and an ICMP message is sent to
the original destination (see Chapter 9). See Table 8.8.
Department of Computer Science, Pondicherry University, Puducherry - 605014
41. Proxy ARP
• Proxy ARP: Host or router responds to ARP Request that
arrives from one of its connected networks for a host that is
on another of its connected networks.
Department of Computer Science, Pondicherry University, Puducherry - 605014
45. Things to know about ARP
What happens if an ARP Request is made for a non-existing
host?
Several ARP requests are made with increasing time
intervals between requests. Eventually, ARP gives up.
On some systems (including Linux) a host periodically
sends ARP Requests for all addresses listed in the ARP
cache.
This refreshes the ARP cache content, but also introduces
traffic.
Gratuitous ARP Requests: A host sends an ARP request for
its own IP address:
Useful for detecting if an IP address has already been
assigned.
Department of Computer Science, Pondicherry University, Puducherry - 605014
46. Vulnerabilities of ARP
1. Since ARP does not authenticate requests or replies, ARP Requests
and Replies can be forged
2. ARP is stateless: ARP Replies can be sent without a corresponding
ARP Request
3. According to the ARP protocol specification, a node receiving an
ARP packet (Request or Reply) must update its local ARP cache
with the information in the source fields, if the receiving node
already has an entry for the IP address of the source in its ARP
cache. (This applies for ARP Request packets and for ARP Reply
packets)
Typical exploitation of these vulnerabilities:
A forged ARP Request or Reply can be used to update the ARP
cache of a remote system with a forged entry (ARP Poisoning)
This can be used to redirect IP traffic to other hosts
Department of Computer Science, Pondicherry University, Puducherry - 605014
55. Reverse Address Resolution Protocol
(RARP)
The RARP is an obsolete computer networking protocol used
by a client computer to request its Internet Protocol (IPv4)
address from a computer network, when all it has available
is its link layer or hardware address, such as a
MAC address.
56. RARP
• RARP finds the logical address for a machine that
only knows its physical address.
• The RARP request packets are broadcast;
• the RARP reply packets are unicast.
Department of Computer Science, Pondicherry University, Puducherry - 605014
57. RARP
• Bootstrapping a diskless terminal - this was the original
problem in the 70s and 80s
• Reverse ARP [RFC903] - a way to obtain an IP address starting
from MAC address
• Today problem: dynamic IP address assignment - limited pool
of addresses assigned only when needed
• RARP not sufficiently general for modern usage
– BOOTP (Bootstrap Protocol - RFC 951): significant
changes to RARP (a different approach)
– DHCP (Dynamic Host Configuration Protocol - RFC 1541):
extends and replaces BOOTP
Department of Computer Science, Pondicherry University, Puducherry - 605014
63. RARP Problems
• Network traffic
– for reliability, multiple RARP servers need to be configured
on the same Ethernet
– to allow bootstrap of terminals even when one server is
down
– But this implies that ALL servers simultaneously respond to
RARP request
• contention on the Ethernet occurs ÎRARP requests not
forwarded by routers
– being hardware level broadcasts...
Department of Computer Science, Pondicherry University, Puducherry - 605014
65. BOOTP/DHCP approach
• Requests/replies encapsulated in UDP datagrams
– may cross routers
– no more dependent on physical medium
• request addressing:
– destination IP = 255.255.255.255
– source IP = 0.0.0.0
– destination port (BOOTP): 67
– source port (BOOTP): 68
• router crossing:
– router configured as BOOTP relay agent
– forwards broadcast UDP requests with destination port 67
Department of Computer Science, Pondicherry University, Puducherry - 605014