- 10-30-01:I made a mistake in question 5. The time from bayou.uh.edu to www.baylor.edu should be 40 ms (not 11ms).
There are 5 questions, 4 written ones and one experiment. Each question weights 20 points.
3 A ------------ C | | \ | | \6 |8 B |1 \ | \ | F | \2 | | \ | D ------------ E 2 Figure 4.39For the network given in Figure 4.39, give distance-vector tables for node A like Figure 4.6 in Kurose & Ross when
- (a) Each node knows only the distances to its immediate neighbors.
- (b) Each node has reported the information it had in the preceding step to its immediate neighbors.
- (c) Step (b) happens a second time.
For the network given in Figure 4.39, show how the link-state algorithm builds the routing table for node D.
Table 4.14 (below) is a routing table using CIDR. Address bytes are in hexadecimal. The notation "/12" in C184.108.40.206/12 denotes a netmask with 12 leading 1 bits, that is, FF.F0.0.0. Note that the last three entries cover every address and thus serve in lieu of a default route. State to what next hop of the following will be delivered.-----------------+---------- Net/MaskLength | nexthop -----------------+---------- C220.127.116.11/12 | A C4.5E.10.0/20 | B C18.104.22.168/12 | C C22.214.171.124/14 | D 126.96.36.199/1 | E 188.8.131.52/2 | F 00.0.0.0/2 | G -----------------+---------- Table 4.14
Suppose P, Q, and R are network service providers, with respective CIDR address allocations (using the notation of Exercise 38) C184.108.40.206/8, C220.127.116.11/8, and C18.104.22.168/8. Each provider's customers initially receive address allocations that are a subset of the provider's. P has the following customers:
PA, with allocation C1.A3.0.0/16 and
PB, with allocation C1.B0.0.0/12.
Q has the following customers:
QA, with allocation C2.0A.10.0/20, and
QB, with allocation C2.0B.0.0/16.
Assume there are no other providers or customers.
- Giving routing tables for P, Q, and R assuming each provider connects to both of the others.
- Now assume P is connected to Q and Q is connected to R, but P and R are not directly connected. Give tables for P and R.
- Suppose customer PA acquires a direct link to Q, and QA acquires a direct link to P, in addition to existing links. Give tables for P and Q, ignoring R.
This problem requires you to run a traceroute from your computer to some hosts and count number of hops required to reach the destination and also record the latency to reach the destination. You can run "traceroute using any of the following ways.
- from textbook companion website,
- run "tracert" on your Windows 95/98/NT/2000 machines, or
- if you have an account on bayou, you can run "traceroute" at prompt or /usr/sbin/traceroute if it can't be found. Here is the man page of traceroute. It contains detail info about the command line parameters and the format of output.
- There is a web site called www.traceroute.org. This site provides links to hosts all over the world which provide interfaces to run traceroute from their local machines or routers. So you can run traceroute from Finland (EUNet) or Italy (IHnet).
- There is an interesting shareware called VisualRoute which shows the traceroute path on a world map. It's very cool. And you can also try their live demo on 7 VisualRoute servers around the world (using JAVA as interface).
Here is what you need to do. First of all, pick three (3) of the following hosts and label them as H1, H2, and H3.
- www.tamu.edu - Texas A & M University, College Station, Texas, U.S.A.
- www.foundrynet.com - Foundry Networks, Inc., San Jose, California, U.S.A.
- www.dtu.dk - Technical University of Denmark, Lyngby, Denmark
- www.kmitl.ac.th - King Mongkut's Institute of Technology Ladkrabang, Bangkok, Thailand
- www.cob.edu.bs - The College of the Bahamas, Nassau, Bahamas
- www.upc.edu.pe - Universidad Peruana de Ciencias Aplicadas, Monterrico, Peru
Secondly, pick two hosts as routers from www.traceroute.org and label them as R1 and R2. Also, record their host names.
Thirdly, run traceroute from source (R1 and R2) to destination (H1, H2, and H3). Record number of hops and latency between source and destination. You should have 6 values for number of hops and 6 values for latency.
Fourthly, pick a home site. You can use your own PC (running Linux/BSD/Windows 95/98/NT/2000), bayou, or any host from www.traceroute.org (other than R1 and R2). We will label it as HS. Record host name or IP address of HS.
Fifthly, run traceroute from source (HS) to destination (R1, R2, H1, H2, and H3). Record number of hops and smallest latency between source and destination. You should have 5 values for number of hops and 5 values for latency.
Now draw a graph similar to this one. Replace H1, H2, H3, R1, R2, and HS with their host names or IP addresses. Label each link with number of hops and latency.
Finally, calculate the total number of hops and latency between home site (HS) and hosts (H1, H2, and H3). Also, calculate the total number of hops and latency from home site (HS) via routers (R1 or R2) to hosts (H1, H2, and H3). You will have a table like this.
Paths # of hops Latency (msec) HS-H1 + HS-H2 + HS-H3 HS-R1-H1 + HS-R1-H2 + HS-R1-H3 HS-R2-H1 + HS-R2-H2 + HS-R2-H3
Questions you might have:
- Question: When calculating latency time from host to destination, which values do we use in the traceroute result? Each hop has 3 time fields listed after it. I'm not sure which to use.
Answer: Traceroute lunches 3 probes (by default). Just pick the smallest one.
- Question: What number in the output of traceroute should we use as the latency?
Answer: Here is an example (traceroute to Baylor University, Waco, Texas).
bay.uh.edu> traceroute www.baylor.edu traceroute to www.baylor.edu (22.214.171.124): 1-30 hops, 38 byte packets 1 Flavia-Vlan696.gw.UH.EDU (126.96.36.199) 0.977 ms 0.976 ms 0.0 ms 2 Flavia-vlan113.sw-e.UH.EDU (172.16.254.221) 0.977 ms 0.977 ms 0.0 ms 3 caesar-fe1-10.gw.uh.edu (188.8.131.52) 0.976 ms 0.977 ms 0.976 ms 4 a1-3-1-0-3.a01.hstntx01.us.ra.verio.net (184.108.40.206) 2.93 ms 1.95 ms 1.95 ms 5 ge-0-1-0.r00.hstntx01.us.bb.verio.net (220.127.116.11) 1.95 ms (ttl=250!) 1.95 ms (ttl=250!) 0.976 ms (ttl=250!) 6 p4-4-0-0.r01.dllstx01.us.bb.verio.net (18.104.22.168) 7.81 ms (ttl=249!) 6.83 ms (ttl=249!) 6.83 ms (ttl=249!) 7 p16-2-0-0.r01.crtntx01.us.bb.verio.net (22.214.171.124) 7.81 ms (ttl=248!) 7.81 ms (ttl=248!) 7.81 ms (ttl=248!) 8 p16-2-0-0.r00.stngva01.us.bb.verio.net (126.96.36.199) 39.0 ms (ttl=247!) 39.0 ms (ttl=247!) 39.0 ms (ttl=247!) 9 p16-1-0-0.r01.mclnva02.us.bb.verio.net (188.8.131.52) 40.0 ms (ttl=246!) 40.0 ms (ttl=246!) 40.0 ms (ttl=246!) 10 p4-0-0.r00.mclnva02.us.bb.verio.net (184.108.40.206) 40.0 ms 40.0 ms 40.0 ms 11 mae-atm3-e.ixc-comm.com (220.127.116.11) 41.0 ms 41.9 ms 41.9 ms 12 P4-2.a0.wash.broadwing.net (18.104.22.168) 41.0 ms 41.9 ms 41.0 ms 13 P4-2.c0.wash.broadwing.net (22.214.171.124) 41.9 ms 41.9 ms 41.9 ms 14 P2-1.c0.atln.broadwing.net (126.96.36.199) 52.7 ms 52.7 ms 52.7 ms 15 P2-0.c0.ftwo.broadwing.net (188.8.131.52) 60.5 ms (ttl=243!) 61.5 ms (ttl=243!) 60.5 ms (ttl=243!) 16 P3-0.a0.dlls.broadwing.net (184.108.40.206) 61.5 ms (ttl=242!) 61.5 ms (ttl=242!) 60.5 ms (ttl=242!) 17 p5-0-0.e0.dlls.broadwing.net (220.127.116.11) 61.5 ms (ttl=241!) 62.5 ms (ttl=241!) 61.5 ms (ttl=241!) 18 18.104.22.168 (22.214.171.124) 77.1 ms (ttl=240!) 81.0 ms (ttl=240!) 77.1 ms (ttl=240!) 19 126.96.36.199 (188.8.131.52) 89.8 ms (ttl=239!) 90.8 ms (ttl=239!) 81.0 ms (ttl=239!) 20 184.108.40.206 (220.127.116.11) 77.1 ms (ttl=238!) 79.1 ms (ttl=238!) 72.2 ms (ttl=238!) 21 itc01.baylor.edu (18.104.22.168) 80.0 ms (ttl=46!) 81.0 ms (ttl=46!) 83.9 ms (ttl=46!)There are 3 numbers (80, 81, 83.9) in very last line (No. 21). They are round-trip time to the destination. So you should pick the shortest time and divide it by 2. In this case, the latency between bayou.uh.edu to www.baylor.edu is 40.0 ms.
One interesting observation is that the route from UH to Baylor actually goes through Dallas(6), Vaginia(8-10), Washington(12-13), Atlanta(14) and comes back to Dallas(16-17), then to Waco, Texas, although Baylor University is located about 96 miles south(west) of Dallas.
Last modified: October 30, 2001
tihuang at cs . uh . edu