Term
|
Definition
| Also known as the physical address, is a unique, hardware level address assigned to every networking device by its manufacturer. 6 bytes long 2 to the 48th power |
|
|
Term
| What are the first three bytes of a MAC Address called? |
|
Definition
| OUI: Organizationally Unique Identifier |
|
|
Term
| What are the last three bytes of a MAC address called? |
|
Definition
| Universal LAN Address or Device ID |
|
|
Term
|
Definition
| A protocol specific identifier assigned to a node consisting of a network portion and an node portion |
|
|
Term
|
Definition
| Is a number that seperates the network portion of the network address from the node portion of the network address |
|
|
Term
|
Definition
| Is a user-friendly name assigned to a node to help users and techinician locate the device easily on the network. A network name is mapped to a network address or a MAC address by a naming service |
|
|
Term
|
Definition
| Domain Name System:Maps fully qualified domain names to an IP address |
|
|
Term
|
Definition
| A simple broadcast based naming service |
|
|
Term
|
Definition
| Windows Internet Naming Service: An older type of naming service used on Windows based networks |
|
|
Term
|
Definition
| Is a unit of data sent across the network |
|
|
Term
|
Definition
| Made up of a preamble and a destination and source address, the header describes the source and target of the packet |
|
|
Term
|
Definition
| Contains an error correction code as part of the packet |
|
|
Term
|
Definition
| An ACKnowlegdement signal that data has been received successfully. The source sits idle waiting for an ACk signal before transmitting more data to the destination node |
|
|
Term
| Unacknowledged Connectionless Service |
|
Definition
| This service provides NO acknowledgement of successfully transmitted data(Simplex Mode uses this type of service) |
|
|
Term
| Acknowledged Connectionless Service |
|
Definition
| Nodes do not establish a virtual connection for the duration of the service. However they do acknowledge the successful receipt of packets(HTTP Web Servers use this form of service) |
|
|
Term
| Connection-Oriented Service |
|
Definition
| With this service nodes establish a virtual connection for the duration of the session. nodes negotiate communication parameters and share security information to establish a connection(provides flow control,packet sequencing and EDC |
|
|
Term
|
Definition
| A class of techniques for optimizing the exchange of data between systems |
|
|
Term
|
Definition
| A way of dividing data up to transmit over the network and labeling them in the sequence they were divided to ensure that the data is reassembled in the right order |
|
|
Term
| Simplex Mode Communication |
|
Definition
| Is the one way transmission of information. There is NO RETURN PATH(uses full bandwidth) |
|
|
Term
| Half Duplex Mode Communication |
|
Definition
| Permits two-way transmission of communication but only ONE DIRECTION AT A TIME and uses full bandwidth(think walkie-talkie) |
|
|
Term
| Full Duplex Communication |
|
Definition
| Permits SIMULTANEOUS TWO WAY communication. A device can send and receive at the same time. Sending and receiving can happen on the same channels or different channels(does not use the full bandwidth) |
|
|
Term
|
Definition
| Is the process of determining if transmitted data has been received correctly and completely, typically by attaching extra bits in the form of an EDC or EDAC |
|
|
Term
| What does EDC stand for ? |
|
Definition
|
|
Term
| What does EDAC stand for? |
|
Definition
| Error Detection and Correction |
|
|
Term
|
Definition
| Operates on a word by word basis. The sender adds one bit to each word of data then transmits to the receiver the receiver compares the number of 1 bits within the byte of data and if the 1 bits match then the data is assumed to have been correctly transmitted |
|
|
Term
|
Definition
| Counts the number of 1 bits and adds a parity 1 bit to the byte of data to make the total number of 1 bits to an even number |
|
|
Term
|
Definition
| Counts the number of 1 bits and adds a parity 1 bit to the byte of data to make the total number of 1 bits to an odd number |
|
|
Term
|
Definition
| Cylic Redundency Check: uses a predefined mathematical operation to calculate a CRC code. The source node attaches the CRC to a block of data and transmits it to receiver. The receiving(destination) node calculates its own CRC value for the data and compares it to the transmitted CRC value. If BOTH values match then the data is assumed to be unaltered |
|
|
Term
| How much over head does Parity add to transmitted data? |
|
Definition
| Parity adds 12.5% overhead to data sent over a network |
|
|
Term
|
Definition
| Is the technique for optimizing the exchange of data between systems. An overwhelmed node will start dropping packets that arrive to quickly to process. To little data and the node sits idle |
|
|
Term
| What a two flow control techniques? |
|
Definition
| Buffering and Data Windows |
|
|
Term
|
Definition
| A flow control technique in which data is stored in a temporary high speed memory(like cache from A+ training) called a buffer until the main system components are ready to work with the data |
|
|
Term
|
Definition
| Data arrives to quickly to be handle(EVEN WITH HIGH SPEED BUFFERING). |
|
|
Term
|
Definition
| A signal sent from a node receiving to much data to be process to the sending node telling the sending node to slow down or halt the transmission until the receiving node is able to process the data |
|
|
Term
|
Definition
| a flow control technique combining multiple packets to be transmitted allowing the receiving to respond with an ACK signal to an entire block or window of data instead of individual packets |
|
|
Term
|
Definition
| Every block or window of data contains the same number of packets, TO AVOID flooding buffers of some devices. More efficient than sending individual packets |
|
|
Term
|
Definition
| Use variable block sizes that will adjust constantly in size with the maximum size being transmitted until a squelch signal is received an then the sender will reduce the size of the blocks of data and then slowly increase the size repeating the process with the maximum amount of data trying to be sent at all times |
|
|
