Professional Documents
Culture Documents
Packet Transmission
Concept of Packet.
o Network system divides data into small blocks called packets, which it
sends individually.
o Computer networks are often called packet networks or packet switching
networks because they use packet technologies.
o A sender and receiver need to coordinate transmission to ensure that data
arrives correctly.
o Dividing the data helps the sender and receiver determine which block
arrive intact and which do not.
o Multiple computers often share underlying connections and hardware.
Packets and TDM.
o TDM-Time Division Multiplexing.
o Dividing transmission time slots and allocating it among different transmitters.
o This approach round robin algorithm.
o Dividing packets into small packets ensure that all sources receive prompt
service because it prohibits one source from gaining exclusive access for an
arbitrarily long time.
o If one source has a few packets to send and another has many, allowing both
sources to take turns sending packets guarantees that the source with small
amount of data will finish promptly.
o The mapping has been chosen carefully to guarantee that after a sender
finishes byte stuffing, the character soh and eot do not occur in the data
section of a frame.
o Thus, a receiver can be sure that soh always delimits the beginning of a frame
and eot always delimits end of the frame.
Transmission errors.
o Much of the complexity networks arises because digital transmission systems
are susceptible to interference that can cause random data to appear or
transmitted data to be lost or changed.
o Transmission errors, the problem of lost, changed, or spuriously appearing bits
account for much of the complexity needed in computer networks.
Parity bits and Parity checking.
o To detect errors, network systems usually send a small amount of additional
information with the data.
o A sender computes the value of the additional information from the data, and a
receiver performs the same computation to verify that the packet was
transmitted without error.
o A sender compute additional bit called parity bit, and to attach it to each
character before sending.
o After all bits of character arrives, the receiver removes the parity bit, and
performs same computation as sender.
Cyclic Redundancy Check.
o CRC is used, without increasing the amount of additional information in the
packets.
o It can detect more error than checksum.
o Shift register and exclusive or is used in CRC.
o Shift register has two operations: initialize and shift. When told to initialize a
shift register sets all bits to zero, its output also becomes zero.
o When told shift, a shift register instantaneously moves all bits to the left one
position, sets the rightmost bit according to the current input, and sets the
output according to the leftmost bit.