{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

siniftacozulensoru

# siniftacozulensoru - Problem Consider a packet switched...

This preview shows page 1. Sign up to view the full content.

Problem Consider a packet switched network with two intermediate nodes between sender A and receiver B (that is, A x y B). Define C as the capacity of the links in bps. Define D as the bit size of application data. Define H as the header size in bits. Define P as the number of packets for this application data. Assume no processing and propagation delays. Nodes receive the whole packet and then transmit to the next node. a) Derive a formula for the end-to-end delay for that particular application data. b) Given that C = 5,000 bps, D = 50,000 bits, H = 500 bits, what would be the optimum number of packets that minimizes the total end-to-end delay? Calculate the delay too. Solution a) T end-to-end = (Total #of bits transmitted) / (Channel Capacity) Since D is the total size of application data, and P is the packet number, each packet consists of D/P bits. The first packet arrives with a three packets delay. The total number of packets on the wire will be (P+2) Time necessary to send one packet is : (H + (D/P)) / C Then total time necessary to send (P+2) packets will be: T end-to-end = (P+2)*(H + (D/P)) / C b)
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}