Task2: In packet switching technology the packet size is an import parameter when it con o efficiency and reducing the network latency. Let us assume a network which consists o ender host and a receiver host at nh hops faraway from each other's (nh-1 routers R). s>R>R→ ...→s. If we assume that all links have a bit-rate B bps and originally the message to be send from the sender to the receiver is of size L bits. 1) Give the formula to compute the network latency if we assume circuit switching (switching time per switch is s seconds). 2) Same as in 1) but we assume packet switching with packet size p bits. 3) From 2) drive the best packet size p which give the best performance (minimum network latency). Hint. One way to find out the minimum of a function f is to find derivative f'(0). 4) Verify your result by providing prove example.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
Task2: In packet switching technology the packet size is an import parameter when it comes
to efficiency and reducing the network latency. Let us assume a network which consists of a
sender host and a receiver host at nh hops faraway from each other's (nh-1 routers R).
s>R>R> ...>S. If we assume that all links have a bit-rate B bps and originally the
message to be send from the sender to the receiver is of size L bits.
1) Give the formula to compute the network latency if we assume circuit switching
(switching time per switch is s seconds).
2) Same as in 1) but we assume packet switching with packet size p bits.
3) From 2) drive the best packet size p which give the best performance (minimum
network latency). Hint. One way to find out the minimum of a function f is to find its
derivative f'(0).
4) Verify your result by providing prove example.
Transcribed Image Text:Task2: In packet switching technology the packet size is an import parameter when it comes to efficiency and reducing the network latency. Let us assume a network which consists of a sender host and a receiver host at nh hops faraway from each other's (nh-1 routers R). s>R>R> ...>S. If we assume that all links have a bit-rate B bps and originally the message to be send from the sender to the receiver is of size L bits. 1) Give the formula to compute the network latency if we assume circuit switching (switching time per switch is s seconds). 2) Same as in 1) but we assume packet switching with packet size p bits. 3) From 2) drive the best packet size p which give the best performance (minimum network latency). Hint. One way to find out the minimum of a function f is to find its derivative f'(0). 4) Verify your result by providing prove example.
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Types of Protocols
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education