Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

-- R 1,1 ---- R 1,2 ---- ... ---- R 1,n1 -- | | Client ---- R 2,1 ---- R 2,2 ---

ID: 3527944 • Letter: #

Question

-- R1,1 ---- R1,2 ---- ... ---- R1,n1 --
| |
Client ---- R2,1 ---- R2,2 ---- ... ---- R2,n2 ---- Server
| |
-- Rk,1 ---- Rk,2 ---- ... ---- Rk,nk --


Suppose a Client and a Server are connected through k different paths, as shown above, where Rx,y indicates Router number y on path x. The Server sends data to the Client, and the links traversed by the packets may all have different bandwidths. No other data is transmitted on any of the links.

Let L(Rw,z, Rx,y) be the bandwith for the link between routers Rw,z and Rx,y, and assume that all the links that connect the Client and the Server to the different paths have a very high bandwidth (much larger than any router-to-router link). Answer the following questions:

1) Assuming the Server can select only one (fixed) path j to transfer the data, write a generalize expression for computing the highest possible throughtput on that path.

2) Suppose the Server has knowledge of the bandwidth of each of the links between itself and the Client. Write an expression that allows the Server to select the path with the best possible throughput.

3) What if the Server can send data on all paths at the same time? What would be the highest possible throughput in this case?

Explanation / Answer

https://www.google.co.in/url?sa=t&rct=j&q=&esrc=s&source=web&cd=2&cad=rja&ved=0CEAQFjAB&url=http%3A%2F%2Fresearch.cs.wisc.edu%2Fwisa%2Fpapers%2Ftr1526%2Ftr1526.pdf&ei=ZMYHUZ-AIYPyrQfv_4HACA&usg=AFQjCNEEo_LYljsPmckvWQCIPlqY98cdhw&sig2=oKQSwQ6KecEKmChUybRCDw&bvm=bv.41524429,d.bmk https://www.google.co.in/url?sa=t&rct=j&q=&esrc=s&source=web&cd=3&cad=rja&ved=0CEkQFjAC&url=http%3A%2F%2Fresearch.cs.wisc.edu%2Fwpis%2Fpapers%2Fcsfw03.ps&ei=ZMYHUZ-AIYPyrQfv_4HACA&usg=AFQjCNEN6fcIA27LidMw5HgW0DNTh7iY5w&sig2=NaLivrBjC9o2vdKQ99s_tQ&bvm=bv.41524429,d.bmk https://www.google.co.in/url?sa=t&rct=j&q=&esrc=s&source=web&cd=4&cad=rja&ved=0CFMQFjAD&url=http%3A%2F%2Fswarm.cs.pub.ro%2F~mihai%2Fbooks%2FPetri%2520Net.pdf&ei=ZMYHUZ-AIYPyrQfv_4HACA&usg=AFQjCNF7--z1vG6KG7EaxyBRAXOqgXDLXw&sig2=1B24XWtwVa1NM-YPkwxxZg&bvm=bv.41524429,d.bmk