Question

IF a device wants to send the frame “Header A B ESC C ESC FLAG FLAG...

IF a device wants to send the frame “Header A B ESC C ESC FLAG FLAG D Trailer”, and the datalink layer uses the byte stuffing protocol. 1- What is the output frame after stuffing? 2- If we consider the stuffed bytes to be an overhead, what is the percentage of such overhead to the total size of the output frame?

Homework Answers

Answer #1

1. Byte Stuffing

It is one one of the easiest methods to create frames, this method is character oriented. In byte stuffing, a special byte called the escape character (ESC) is stuffed before every byte in the message with the same pattern as the flag byte. If the ESC sequence is found in the message byte, then another ESC byte is stuffed before it.

Frame before Byte Stuffing : “Header A B ESC C ESC FLAG FLAG D Trailer”

Frame after Byte Stuffing: " Header FLAG A B ESC ESC C ESC ESC ESC FLAG ESC ESC FLAG ESC D FLAG Trailer"

2. Using PPP (Point to Point protocol) byte stuffing, the overall overhead is increased by 1% or less, but individual packets can increase in size by as much as 100%. So the overhead depends on the size of the frame it does increase the overhead but not at higher rate.  

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
1) A client uses TCP to send 100 bytes data, with minimum 20 bytes header at...
1) A client uses TCP to send 100 bytes data, with minimum 20 bytes header at TCP and IP layers each, and minimum 40 bytes header/trailer at Ethernet layer. Explain the i) efficiency of encapsulation process at each of TCP, IP and Ethernet layers showing the fractions (numerator and denominator without solving), in first box below. ii) Next, calculate the efficiency in % (ratio of useful data to total bytes, i.e. goodput data) at TCP, IP and Ethernet layers. Use...
CITM-600 Assignment-1 (5%) Characterizing Network Traffic There are 1000 stations in a network. Each of the...
CITM-600 Assignment-1 (5%) Characterizing Network Traffic There are 1000 stations in a network. Each of the stations transmit 5 frames/second and size of one frame is 2000-bits. As, we know in addition to application data, different protocols add differently sized header with application data before they are sent through media. The additional data from protocols are called overhead. For example, TCP/IP add 20 bytes overhead, UDP adds 8 bytes overhead and Ethernet II adds 38 bytes overhead, with each data...
- An ISP has a CIDR block 71.94.128.0/17 (01000111 01011110 10000000 00000000). The ISP wants to...
- An ISP has a CIDR block 71.94.128.0/17 (01000111 01011110 10000000 00000000). The ISP wants to sub-divide this into 4 smaller CIDR blocks (all of the same size) for its customers. a. How many bits should the ISP add to the mask to identify the subnets? b. What are the addresses of each smaller block in binary? (Show Work) - A large IPv4 packet with Identification = 123 and with a 20 byte header and 1000 bytes of payload data...
Suppose Host A wants to send a large file to Host B. The path from Host...
Suppose Host A wants to send a large file to Host B. The path from Host A to Host B has three links, of rates R1 = 500 Kbps, R2 = 2 Mbps, and R3=1 Mbps.      a. Assuming no other traffic in the network, what is the throughput for the file transfer? b. Suppose the file is 4 million bytes. Dividing the file size by the throughput, roughly how long will it take to transfer the file to Host B?...
1)This question may require some research. If a computer wants to send a broadcast message to...
1)This question may require some research. If a computer wants to send a broadcast message to all other computers on the same network, what MAC address does it put in the Destination Address field of the frame? 2)This question may require some research. In one of the videos this week we mentioned that Uplink ports have the transmit and receive connectors reversed from the regular ports. What would be the purpose for doing that? 3)Which of the following is the...
Consider the following variable definitions: char a, *b, *c; int d[2], *e; int i, *j; How...
Consider the following variable definitions: char a, *b, *c; int d[2], *e; int i, *j; How many total bytes does this code allocate for variables?  Assume a 32-bit representation for integer and pointer values. a     sizeof(char) b     sizeof(char *) c     sizeof(char *) d    2*sizeof(int) e     sizeof(int *) i     sizeof(int) j     sizeof(int *) Total number of bytes ? What is the output of the following piece of code? (Use the above variable definitions). j = &i; *j = 50;                      /* i = 50 */ e = &d[0]; *e...
A fast food chain wants to compare daily sales during three types (A,B,C) of sales promotions....
A fast food chain wants to compare daily sales during three types (A,B,C) of sales promotions. The sales promotions were employed in four different cities, and the orders of promotions were randomly assigned within each city. The amount of sales (in thousands of dollars) for one store in each city was measured. Test if the mean amount of sales for the three types of promotions are different. A B C City 1 5 6 4 City 2 3 7 3...
Week 2 HW: Elasticity Step 1 - E L A S T I C or INELASTIC?...
Week 2 HW: Elasticity Step 1 - E L A S T I C or INELASTIC? Price Elasticity of Demand is a measure of how responsive demand is to a change in price. If a price change leads to a considerably bigger change in quantity demanded, we would consider the good to be responsive to a price change—hence elastic. If, however, a similar price change leads to a much smaller change in demand, we would consider it inelastic. To get...
Consider the C program (twoupdate) to demonstrate race condition. In this assignment, we will implement Peterson's...
Consider the C program (twoupdate) to demonstrate race condition. In this assignment, we will implement Peterson's algorithm to ensure mutual exclusion in the respective critical sections of the two processes, and thereby eliminate the race condition. In order to implement Peterson's Algorithm, the two processes should share a boolean array calledflagwith two components and an integer variable called turn, all initialized suitably. We will create and access these shared variables using UNIX system calls relating to shared memory – shmget,...
Complete this in C++ and explain what is being done. 1      Introduction The functions in the...
Complete this in C++ and explain what is being done. 1      Introduction The functions in the following subsections can all go in one big file called pointerpractice.cpp. 1.1     Basics Write a function, int square 1(int∗ p), that takes a pointer to an int and returns the square of the int that it points to. Write a function, void square 2(int∗ p), that takes a pointer to an int and replaces that int (the one pointed to by p) with its...
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT