Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
174 views

Computer Network Applications

This document contains several examples related to networking applications and the physical and data layers. It includes examples involving: - Character encoding and different framing methods for transmission. - Bit stuffing and error detection using CRC and Hamming codes. - Throughput calculations for different window sizes using stop-and-wait and slide protocols over satellite channels. - Examples illustrating the Go Back N and Selective Repeat protocols using windowing parameters.

Uploaded by

Rusen Stefan
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
174 views

Computer Network Applications

This document contains several examples related to networking applications and the physical and data layers. It includes examples involving: - Character encoding and different framing methods for transmission. - Bit stuffing and error detection using CRC and Hamming codes. - Throughput calculations for different window sizes using stop-and-wait and slide protocols over satellite channels. - Examples illustrating the Go Back N and Selective Repeat protocols using windowing parameters.

Uploaded by

Rusen Stefan
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

11/1/2012

• http://class.stanford.edu/networking/Fall2012

• http://ocw.mit.edu/courses/electrical-
engineering-and-computer-science/6-263j-
data-communication-networks-fall-2002

Applications
• Physical layer
– Television channels are 6 MHz wide. How many bits/sec can be
sent if four-level digital signals are used? Assume a noiseless
channel.

– What signal-to-noise ratio is needed to put an E1 carrier on a


50-kHz line?

– Suppose that x bits of user data are to be transmitted over a k-


hop path in a packet-switched network as a series of packets,
each containing p data bits and h header bits, with x>> p + h.
The bit rate of the lines is b bps and the propagation delay is
negligible. What value of p minimizes the total delay?

Rețele de Comunicații 2

1
11/1/2012

Applications
• Physical layer
– The following character encoding is used in a data
link protocol: A: 01000111; B: 11100011; FLAG:
01111110; ESC: 11100000 Show the bit sequence
transmitted (in binary) for the four-character
frame: A B ESC FLAG when each of the following
framing methods are used:
• (a) Character count.
• (b) Flag bytes with byte stuffing.
• (c) Starting and ending flag bytes, with bit stuffing.

Rețele de Comunicații 3

Applications
• Physical layer
– A bit string, 0111101111101111110, needs to be
transmitted at the data link layer. What is the string
actually transmitted after bit stuffing?

– An 8-bit byte with binary value 10101111 is to be


encoded using an even-parity Hamming code. What is
the binary value after encoding?

– A 12-bit Hamming code whose hexadecimal value is


0xE4F arrives at a receiver. What was the original
value in hexadecimal? Assume that not more than 1
bit is in error.
Rețele de Comunicații 4

2
11/1/2012

Applications
• Physical layer
– A bit stream 10011101 is transmitted using the standard
CRC method described in the text. The generator
polynomial is x3 + 1. Show the actual bit string transmitted.
Suppose the third bit from the left is inverted during
transmission. Show that this error is detected at the
receiver's end.

– channel has a bit rate of 4 kbps and a propagation delay of


20 msec. For what range of frame sizes does stop-and-wait
give an efficiency of at least 50 percent?

– A 3000-km-long T1 trunk is used to transmit 64-byte


frames using protocol 5. If the propagation speed is 6
µsec/km, how many bits should the sequence numbers
be? Rețele de Comunicații 5

Applications
• Physical layer
– Consider an error-free 64-kbps satellite channel used to send
512-byte data frames in one direction, with very short
acknowledgements coming back the other way. What is the
maximum throughput for window sizes of 1, 7, 15, and 127? The
earth-satellite propagation time is 270 msec.

– Frames of 1000 bits are sent over a 1-Mbps channel using a


geostationary satellite whose propagation time from the earth is
270 msec. Acknowledgements are always piggybacked onto
data frames. The headers are very short. Three-bit sequence
numbers are used. What is the maximum achievable channel
utilization for
• (a) Stop-and-wait.
• (b) Protocol 5.
• (c) Protocol 6.
Rețele de Comunicații 6

3
11/1/2012

Applications
• Data Layer
– AE: ACK Expected
– NS: Next Frame to Send
– FE: Frame Expected
– WT: Transmit Window
– WR: Receive Window
– MAXSEQ: Maximum Sequence Number
• WT+WR  MAXSEQ+1

Applications
• Go Back N
– AE=1; NS=2; FE=2; WT=7; WR=1; MAXSEQ=7
• Send 6 packets; second packet is lost
– AE=0; NS=2; FE=1; WT=7; WR=1; MAXSEQ=7
• Send 6 packets; second packet is lost
– AE=6; NS=7; FE=6; WT=3; WR=1; MAXSEQ=8
• Send 5 packets; third packet is lost

4
11/1/2012

Applications
• Selective Repeat
– AE=1; NS=2; FE=2; WT=4; WR=2; MAXSEQ=7
• Send 7 packets; second packet is lost

You might also like