search
Log In
0 votes
101 views
Use the traceroute (UNIX) or tracert (Windows) programs to trace the route from
your computer to various universities on other continents. Make a list of transoceanic
links you have discovered. Some sites to try are

www.berkeley.edu (California)
www.mit.edu (Massachusetts)
www.vu.nl (Amsterdam)
www.ucl.ac.uk (London)
www.usyd.edu.au (Sydney)
www.u-tokyo.ac.jp (Tokyo)
www.uct.ac.za (Cape Town)
in Computer Networks 101 views

1 Answer

0 votes

Simply write <tracert www.berkeley.edu>(without brackets) in windows CMD (Access CMD by pressing "Win + R" and typing CMD and press enter on keyboard). You can use any other web site also. For wired connection, after 2-3 hops you will get local ISP router, then routers for various countries. I got 1 singapore and 2 los angeles routers then there are local routers af ter which you will get your destination.

 

The three addresses which are of singapore , los angeles are most likely the answer.

Related questions

0 votes
0 answers
1
41 views
Write a function to do forwarding in an IP router. The procedure has one parameter, an IP address. It also has access to a global table consisting of an array of triples. Each triple contains three integers: an IP address, a subnet mask, and the outline line to use. The function looks up the IP address in the table using CIDR and returns the line to use as its value.
asked Mar 18, 2019 in Computer Networks ajaysoni1924 41 views
0 votes
0 answers
2
62 views
Write a program that simulates a computer network using discrete time. The first packet on each router queue makes one hop per time interval. Each router has only a finite number of buffers. If a packet arrives and there is no room for it, it is discarded and ... the source router. Plot the throughput of the network as a function of the end-to-end timeout interval, parameterized by error rate.
asked Mar 18, 2019 in Computer Networks ajaysoni1924 62 views
0 votes
0 answers
3
90 views
Write a program to simulate routing using flooding. Each packet should contain a counter that is decremented on each hop. When the counter gets to zero, the packet is discarded. Time is discrete, with each line handling one packet per time interval. Make three versions ... best k lines are flooded. Compare flooding with deterministic routing (k = 1) in terms of both delay and the bandwidth used.
asked Mar 18, 2019 in Computer Networks ajaysoni1924 90 views
0 votes
1 answer
4
...