Ping

Ping is the name of a data-processing order (developed by Mike Muuss) making it possible to send a request ICMP “Echo” of a machine to another machine.

The analogy with the table tennis is that this order sends a screen (the Ping ) and awaits its return. According to the answer one knows the state of the distant machine.

This order network basic makes it possible to obtain information and in particular response time of the machine through the network and also which is the state of the Connection with this machine (reference corresponding error code).

History

Mike Muuss wrote this program in December 1983 for débugger an abnormal behavior on network IP. The name is drawn from the onomatopoeia describing the sound emitted by a Sonar since their action is similar (emission of a signal which comes to rebound on a target to be allocated to the sender). Thereafter, David L. Millets provided a Retro-acronym: " P acket I nter' and G rouper (Groper) ".

Examples

Example of ping under Windows, towards the Address IP of the waiter DNS of Wikipédia:

C:\ >ping 66.230.200.16 Pinging 66.230.200.16 with 32 bytes of data: Answer of 66.230.200.16: octets=32 temps<10ms TTL=255 Answer of 66.230.200.16: octets=32 temps<10ms TTL=255 Answer of 66.230.200.16: octets=32 temps<10ms TTL=255 Answer of 66.230.200.16: octets=32 temps<10ms TTL=255

It is also possible to carry out a ping on a name instead of an address IP.

To record the result of the order ping in a textual file type in one Invite orders: ping 66.230.200.16 > c:\ping.txt

Example of ping under Linux, towards fr.wikipedia.org:

$ ping fr.wikipedia.org PING R, r.knams.wikimedia.org (145.97.39.137): 56 dated bytes 64 bytes from 145.97.39.137: icmp_seq=0 ttl=53 time=51.9 ms 64 bytes from 145.97.39.137: icmp_seq=1 ttl=53 time=16.9 ms 64 bytes from 145.97.39.137: icmp_seq=2 ttl=53 time=16.7 ms --- rr.knams.wikimedia.org ping statistics --- 3 packets transmitted, 3 packets received, 0% packet loss round-trip min/avg/max = 16.7/28.5/51.9 ms

The TTL (Time-To-Live), means the maximum number of Routeur S which the message will be able to borrow before being destroyed.

Example of (F) ping (6) under Linux, towards an address IPv6: $ fping6 fe80:: 211: d8ff: fe25: 2092 fe80:: 211: d8ff: fe25: 2092 is alive

Another example of (F) ping (6) under Linux, towards an address IPv6:

$ fping6 - C 2 - E fe80:: 211: d8ff: fe25: 2092 fe80:: 211: d8ff: fe25: 2092: , 64 bytes, 0.06 ms (0.06 avg, 0% loss) fe80:: 211: d8ff: fe25: 2092: , 64 bytes, 0.06 ms (0.06 avg, 0% loss) fe80:: 211: d8ff: fe25: 2092: xmt/rcv/%loss = 2/2/0%, min/avg/max = 0.06/0.06/0.06

Generalization

The principle of the ping can easily be wide beyond the ping of address IP or name.

  • the visible ping on the internal networks ( LAN ) is a Néologisme for RTT (round trip time), which estimates the time of return ticket of a package between two machines. More it is small more the communications will be reactive and thus the transfer of information will be fluid, in the event of high and significant value one speaks then about lag or Latence. This approach is not relevant since the active elements of the network do not treat the requests ICMP in priority (see QoS ).

  • Plus your Ping is high, plus you will have evil to connect you on applications which require that your computer functions in full power. This " High Ping" can be caused by a bad connection on Internet, or and even by a chart RAM (random access memory) not very powerful.

  • On the majority of the customers IRC, you can type the order /ping to know the response time of a user or a living room of discussion.

See too

External bonds

  • Man linux of order PING in French

  • WEB PING
  • Site to carry out ping inter alia things

Random links:Ganga quadribande | Amorots-Succos | ÅšwinoujÅ›cie | Saint-Valérien-of-Milton | Chelsea Quinn Yarbro | Cartography of the risks | Raymond_Queneau