PING goes the Traceroute

When learning about how internet connections are made and the simple act of a google search sends out a message requesting information.  One can perform a PING command or Traceroute command.  I tested these commands on some websites and this is what my results were below.

First off the acronym PING is Packet Internet Groper.  This is command is used to test whether an IP address or domain is working correctly.  How this is done is the Ping command measures how long it takes for packets to be sent to the destination IP address and back.  This is measures in milliseconds.  When performing the Ping command on google.com multiple packets were sent out, the ping command is still going, the average response time is 22.746 ms.  It times out for a brief period and then continues on.  The next domain was Japan.go.jp which is a japanese government website, the average time was 15.944 ms.  The last domain was Abs.gov.au which is the Australian Bureau of Statistics website, and the average time 42.144 ms.  Even though there is a great geographic distance between the different domains the speed of information travel with the internet is extremely minimal.

The traceroute command is exactly how it sounds, it traces the route that information is sent from the domain to the  test computer.  Each time the packet switches to a different router its referred to as a hop.  The tracerout performed for the Google.com domain had 64 hops, the shortest length of time being 1.607 ms and longest 91.519 ms to complete the hop to another router.

Both of these command tools are useful for diagnosing networking capabilities.  The Ping command ensures that the IP address is functioning and at what speeds it is sending out packets.  It helps users be able to make sure IP addresses exist.  The traceroute command is a map of the route that packets are being sent.  This command can determine where a traceroute fails by tracking where the last hop occured on the router path.  A traceroute may fail if a router is down in the network or there is a connection error in the network.

 

Comments

Post a Comment

Popular posts from this blog

Operating System Theory and Design

Image
      The fundamental goal of computers is to execute programs so that users can solve problems faster and easier (Silberschatz, 2014).  The operating system is the one program that is constantly running on a computer.  This is because the opeating system creates a pathway or space where other programs can be useful.  Operating systems such as Mac, Windows, and even Android for smartphones allow computers and smart phones to boot up and be useful.  Without an operating system using a computer is very difficult because th operating system is what allows hardware and applications to communicate and run programs.  The major function of the operating system is to continually run in the background so that harware and applications can be accessed and used by the user.  The operating system is a link between the memory and storage and assists with opening and using application that have been saved in the storage. Describing the process is simple, it is the act of a program in execution, the p
Read more

Simple Explanation of Algorithmic Design and Data Structures

  Searching algorithms perform the function of comparing two values and a desired value in order to find the position of the desired value.  The two main algorithms that perform this task is linear search and binary search.  Linear search is the most basic of searches, checking each item until the desired item is located (Rajinikanth, B 2022).  When using linear search on average it will take searching half the list to find the position of the desired item.  Binary search is a lot more efficient than linear search.  It relies on elements of the list being sorted already, then smaller sub lists are searched.  It starts with the entire list and checks the middle element, halving the list each time.  Then the item is found the search stops. There is a long list of different sorting algorithms, selection sort, merge sort, bubble sort, quick sort, and shell sort, and insertion sort to name a few.  in order to complete selection sort the algorithm is finding minimum to maximum elements and s
Read more