click below
click below
Normal Size Small Size show me how
Ch4 Net+ Definitions
Chapter 4 - Network+ Guide to Networks Definitions
ACRONYM | TERM | DEFINITION |
---|---|---|
AD | administrative distance | A number indicating a protocol’s reliability, with lower values being given higher priority. This assignment can be changed by a network administrator. |
ARP | Address Resolution Protocol | A core protocol in the TCP/IP suite that belongs in the Data Link layer of the OSI model. Works in conjunction with IPv4 to discover the MAC address of a node on the local network and to maintain a database that maps local IP addresses to MAC addresses. |
(Φ ω Φ) | ARP table | A database of records that maps MAC addresses to IP addresses. The ARP table is stored on a computer’s hard disk where it is used by the ARP utility to supply the MAC addresses of network nodes, given their IP addresses. |
AS | autonomous system | group of networks, often on the same domain, that are operated by the same organization. |
(Φ ω Φ) | best path | The most efficient route from one node on a network to another, as calculated by a router. |
BGP | Border Gateway Protocol | Dubbed the “protocol of the Internet,” this path-vector routing protocol is the only current EGP and is capable of considering many factors in its routing metrics. |
(Φ ω Φ) | border router | A router that connects an autonomous system with an outside network—for example, the router that connects a business to its ISP. Also called edge router. |
(Φ ω Φ) | checksum | A method of error checking that determines if the contents of an arriving data unit match the contents of the data unit sent by the source. |
(Φ ω Φ) | collision | In Ethernet networks, the interference of one node’s data transmission with the data transmission of another node sharing the same segment. |
(Φ ω Φ) | collision domain | The portion of an Ethernet network in which collisions could occur if two nodes transmit data at the same time. Today, switches and routers separate collision domains. |
(Φ ω Φ) | convergence time | The time it takes for a router to recognize a best path in the event of a change or network outage. |
(Φ ω Φ) | core router | A router that directs data between networks within the same autonomous system. |
CSMA/CD | Carrier Sense Multiple Access with Collision Detection | A network access method used on 802.11 wireless networks. CSMA/CA does not eliminate, but minimizes, the potential for collisions. |
(Φ ω Φ) | default route | The gateway device that nodes on the network turn to first for access to the outside world. |
(Φ ω Φ) | distance-vector routing protocol | The simplest type of routing protocols; used to determine the best route for data based on the distance to a destination. |
(Φ ω Φ) | dynamic ARP table entry | A record in an ARP table that is created when a client makes an ARP request that cannot be satisfied by data already in the ARP table. |
(Φ ω Φ) | dynamic routing | A method of routing that automatically calculates the best path between two networks and accumulates this information in a routing table. |
(Φ ω Φ) | edge router | A router that connects an autonomous system with an outside network—for example, the router that connects a business to its ISP. |
EGP | exterior gateway protocol | A type of routing protocol used by edge routers and exterior routers to distribute data outside of autonomous systems. BGP is the only modern example of an exterior gateway protocol. |
EIGRP | Enhanced Interior Gateway Routing Protocol | An advanced distance-vector protocol developed by Cisco that combines some of the features of a link-state protocol and so is sometimes referred to as a hybrid protocol. |
(Φ ω Φ) | Ethernet II | The current Ethernet standard. Ethernet II is distinguished from other Ethernet frame types in that it contains a 2-byte type field to identify the upper-layer protocol contained in the frame. |
(Φ ω Φ) | exterior router | A router that directs data between autonomous systems, for example, routers used on the Internet’s backbone. |
(Φ ω Φ) | gateway of last resort | The router on a network that accepts all unroutable messages from other routers. |
(Φ ω Φ) | hop | The trip a unit of data takes from one connectivity device to another. Typically, hop is used in the context of router-to-router communications |
(Φ ω Φ) | hop limit | The number of times that an IPv6 packet can be forwarded by routers on the network; similar to the TTL field in IPv4 packets. |
(Φ ω Φ) | hybrid routing protocol | A routing protocol that exhibits characteristics of both distance-vector and link-state routing protocols. |
IGP | interior gateway protocol | A type of routing protocol, such as OSPF and IS-IS, used by core routers and edge routers within autonomous systems. |
(Φ ω Φ) | interior router | A router that directs data between networks within the same autonomous system. Also called core route |
(Φ ω Φ) | internetwork | To traverse more than one LAN segment and more than one type of network through a router. |
IS-IS | Intermediate System to Intermediate System | A link-state routing protocol that uses a bestpath algorithm. IS-IS was originally codified by ISO, which referred to routers as “intermediate systems,” thus the protocol’s name. |
(Φ ω Φ) | jumbo frame | A setting on Ethernet network devices that allows the creation and transmission of extra-large frames, as high as 9198 bytes. |
(Φ ω Φ) | latency | The delay between the transmission of a signal and its receipt. |
(Φ ω Φ) | Layer 3 switch | A switch capable of interpreting Layer 3 data and works much like a router in that it supports the same routing protocols and makes routing decisions. |
(Φ ω Φ) | Layer 4 switch | Layer 4 switch A switch capable of interpreting Layer 4 data, which means it can perform advanced filtering, keep statistics, and provide security functions. |
(Φ ω Φ) | link-state routing protocol | A type of routing protocol that enables routers to share information beyond neighboring routers, after which each router can independently map the network and determine the best path between itself and a message’s destination node. |
MTU | maximum transmission unit | The largest IP packet size in bytes that routers in a message’s path will allow without fragmentation and excluding the frame. |
(Φ ω Φ) | neighbor discovery | Process whereby routers learn about all the devices on their networks. IPv4: process is managed by ARP with help from ICMP. IPv6: NDP (Neighbor Discovery Protocol) detects neighboring devices and adjusts when nodes fail or are removed from the network. |
(Φ ω Φ) | netstat | A TCP/IP troubleshooting utility that displays statistics and details about TCP/IP components and connections on a host. It also lists ports, which can signal whether services are using the correct ports. |
OSPF | Open Shortest Path First | An IGP and link-state routing protocol that makes up for some of the limitations of RIP and can coexist with RIP on a network. |
(Φ ω Φ) | packet sniffer | A software package or hardwarebased tool that can capture data on a network. |
(Φ ω Φ) | pathping | A Windows utility that combines the functionality of the tracert and ping utilities to provide deeper information about network issues along a route; similar to UNIX’s mtr command. |
(Φ ω Φ) | probe | (1) A repeated trial message transmitted by the tracert and traceroute utilities to trigger routers along a route to return specific information about the route. |
(Φ ω Φ) | protocol analyzer | software package or hardwarebased tool that can capture and analyze data on a network. |
RIP | Routing Information Protocol | The oldest routing protocol that is still widely used. RIP is a distance-vector protocol that uses hop count as its routing metric and allows up to only 15 hops. |
RIPv2 | Routing Information Protocol version 2 | An updated version of the original RIP routing protocol that generates less broadcast traffic and functions more securely than its predecessor. However, RIPv2’s packet forwarding is still limited to a maximum 15 hops. |
(Φ ω Φ) | route command | A command-line tool that shows a host’s routing table. |
(Φ ω Φ) | routing cost | A value assigned to a particular route as judged by the network administrator; the more desirable the path, the lower its cost. |
(Φ ω Φ) | routing metric | Properties of a route used by routing protocols to determine the best path to a destination when various paths are available. Routing metrics are calculated using any of several variables, including hop count, bandwidth, delay, MTU, cost, and reliability. |
(Φ ω Φ) | routing protocol | The means by which routers communicate with each other about network status. Routing protocols determine the best path for data to take between networks. |
(Φ ω Φ) | routing table | A database stored in a router’s memory that maintains information about the location of hosts and best paths for forwarding packets to them. |
(Φ ω Φ) | spoofing | The act of impersonating fields of data in a transmission, such as when a source IP address is impersonated in a DRDoS attack. |
(Φ ω Φ) | static ARP table entry | A record in an ARP table that someone has manually entered using the ARP utility. |
(Φ ω Φ) | static routing | A technique in which a network administrator programs a router to use specific paths between networks. |
(Φ ω Φ) | tcpdump | A free, command-line packet sniffer utility that runs on Linux and other UNIX operating systems. |
(Φ ω Φ) | three-way handshake | A three-step process in which Transport layer protocols establish a connection between nodes |
(Φ ω Φ) | traceroute | A TCP/IP troubleshooting utility available in Linux, UNIX, and macOS systems that sends UDP messages to a random port on the destination node to trace the path from one networked node to another, identifying all intermediate hops between the two nodes. |
(Φ ω Φ) | tracert | A Windows utility that uses ICMP echo requests to trace the path from one networked node to another, identifying all intermediate hops between the two nodes. |