Difference between revisions of "IPv4 calculations"

(... transposed to computers)
Line 8: Line 8:
 
<illustration goes here TCP/IP model>
 
<illustration goes here TCP/IP model>
  
The above illustration sounds horribly familiar : yes, it is sounds like this good old OSI model. Indeed it is a tailored view of the original OSI model and it works the exact same way.
+
The above illustration sounds horribly familiar : yes, it is sounds like this good old OSI model. Indeed it is a tailored view of the original OSI model and it works the exact same way: so the data sent by an application A1 (residing on computer C1) to another application A2 (residing on computer C2) goes through C1's TCP/IP stack (from top to bottom), reach the C1's lower layers that will take the responsibility to move the bits from C1 to C2 over a physical link (electrical or lights pulses, radio waves...sorry no quantum mechanism yet) . C2's lower layers will receive the bits sent by C1 and pass  what has been received to the C2's TCP/IP stack (bottom to top) which will pass the data to A2. If C1 and C2 are not on the same network the process is a bit more complex because it involves relays (routers) but the global idea remains the same. Also there is no shortcuts in the process : both TCP/IP stacks are crossed in their whole, either from top to bottom for the sender or bottom to top for the receiver. The transportation process in itself is also absolutely transparent from an application's point of view:  A1 knows it can rely on the TCP/IP stack to transmits some data to A2, ''how'' the data is transmitted is not its problem, A1 just assumes the data can be transmitted by some means. The TCP/IP stack is also loosely coupled to a particular network technology because its frontier is precisely the physical transportation of bits over a medium and so the physical network's technology, just the same way A1 does not care about how the TCP/IP stack will move the data from one computer to another. The TCP/IP stack itself does not care about the details about how the bits are physically moved and thus it can work with any network technology no matter the technology is Ethernet, Token Ring or FDDI for example.  
 
+
== The postal mail service ==
+
If you are not super familiar with OSI or TCP/IP models let's take an analogy with the national postal service because it works in a similar way. Suppose you want to send a parcel to your cousin  located in another in a town in the same country using the the national postal service. Both of you are using PO boxes located your respective postal outlets.  So basically you :
+
 
+
# take a box and pack what you want to send inside
+
# write the address of the destinee on the box like "to : Mr A, PO Box 123, 99 Street ABC, Oldcity.... from: Mr B, PO Box 456, 45 Street DEF, Newcity...."
+
# give the box to the clerk at your post office outlet. The clerk will ask you for the level of service you want (standard or registered mail)
+
 
+
Once you drop the parcel to the postal service, you know they will route it to your cousin's PO box. You don't know exactly how it will be transported from one postal facility to another through the country, you only know that it will travel through the postal service networks then eventually reach the addressee. If you opted for the registered mail service additional care will be brought to ensure your parcel won't be lost in the middle.
+
 
+
A few days later you receive a greeting card from your cousin with an address like "to : Mr B, PO Box 456, 45 Street DEF, Newcity.... from: Mr A, PO Box 123, 99 Street ABC, Oldcity...."
+
 
+
== ... transposed to computers ==
+
 
+
For a computer this is more or less the same. An application A1 residing on a computer C1 wants to send some data to another application A2 located on a remote computer C2. A1 knows the "PO Box" (port number in technical terms) of A2 which is P2, and of course the computer where the application A2 resides which is C2.
+
 
+
# A1 solicits the TCP/IP stack of C1  and talks to its ''Transport layer'' (the only one A1 can interact with) : "here is the '''data''' to send to computer C2, port P2 using a reliable transport".
+
# The ''Transport layer'' adds ''Transport layer header'' in front of the data supplied by A1. This header includes several informations depending on whether a reliable transport (TCP) is asked or not (UDP). The result of concatenating the data and the transport layer's header is called an ''Layer 4 PDU'' shortened as '''L4PDU''' (PDU standing for ''Protocol Data Unit'').  
+
# The ''Transport layer'' then gives the L4PDU to the ''Internet layer'' : "here is a data '''segment''' to send to computer C2".
+
# The ''Internet layer'' will add its own header (differs between IPv4 and IPv6 but basically it includes C1 and C2's network address) to the L4PDU thus giving an L3PDU.
+
# Before giving the packet (or L3PDU) to the lower layers, the C1's TCP/IP stack has to determine where the packet has to be sent. Two possibilities: either the packet is destined to a computer on a network on which C1 is directly connected either the packet is destined to a computer located on a network on which C1 is not directly connected. In that latter case the packet has to be forwarded to a relay that interconnects the network where C1 resides with one or more other networks. That relay (or '''gateway''' in technicals terms) will on its turn decide where the packet received from C1 has to be sent : either the gateway is connected to the same network where C2 resides and the gateway will directly forward the packet to C2, either it has to be forwarded to another gateway and so on.  No magic here! You apply the same principles when you drive your car looking for routes to follow to reach your final destination : if a sign at at the crossroad explicitly points toward your final destination you follow that specific road else you follow the road indicated by "all destinations", hopping to encounter a more precise route at the next crossroad. For a computer the "all destinations" road is more : send the packet to a '''gateway''' (to another network).
+
# The C1's routing table is simply a set of rules like ''"All packets destined to computers located on network N1 have to be sent via the network interface NIC1 of C1"'' or ''"all packets destined to computers located on network N2 have to be sent via the network interface NIC2 of C2"'' or even ''"for all other destinations use the gateway GW1 reachable via the the network interface NIC1 of C1"''. How the C1's TCP/IP stacks knows what computer is located in what network? Shhh the explanation will be given in following paragraphs, this is ''precisely'' where netmasks intervenes. for now just assume that C1 knows which one of its network interface it has to use to send the packet over the network.
+
  
 
= Classful and classless networks =
 
= Classful and classless networks =
  
 +
The goal of this article being more focused on calculation of addresses used at the ''Internet layer'' so  let's forget the gory details of the TCP/IP stack works (you can find an extremely detailed discussion in [[How the TCP/IP stack works]]...  to be written...). From here, we assume you have a good general understanding of its functionalities and how a network transmission works. As you know the ''Internet'' layer is responsible to handle logical addressing issues of a TCP segment (or UDP datagram) that has either to be transmitted over the network or that has been received from the network.
  
 
  Who would ''ever'' need millions of addresses afterall?  So in theory with those 32 bits we can have around 4 billions of computers within that network and arbitrarily retain that the very first connected computer must be given the number "0", the second one "1", the third one "2" and so on until we exhaust the address pool at number 4294967295 giving no more than 4294967296 (2^32) computers on that network because no number can be a duplicate.  
 
  Who would ''ever'' need millions of addresses afterall?  So in theory with those 32 bits we can have around 4 billions of computers within that network and arbitrarily retain that the very first connected computer must be given the number "0", the second one "1", the third one "2" and so on until we exhaust the address pool at number 4294967295 giving no more than 4294967296 (2^32) computers on that network because no number can be a duplicate.  

Revision as of 15:54, January 16, 2014

WARNING: Work in progress. Do not edit this article unless you are the original author.


Refresh on TCP/IP model

When the ARPANet (a packet oriented network) was born in those good old seventies, engineers had to solve the problem of making computers being able to exchange packets of information over the network and they invented in 1974 something you are now using to view this page: TCP/IP! TCP/IP is a collection of various network protocols, being organized as a stack. Just like your boss does not do everything in the company and delegates at lower levels which in turn delegates at an even more lower level, no protocol in the TCP/IP suite takes all responsibilities, they are working together in a hierarchical and cooperative manner. A level of the TCP/IP stack knows what its immediate lower subordinate can do for it and whatever it will do will be done the right way and will not worry about the manner the job will be done. Also the only problem for a given level of the stack is to fulfill its own duties and deliver the service requested by the upper layer, it does not have to worry about the ultimate goal of what upper levels do.

<illustration goes here TCP/IP model>

The above illustration sounds horribly familiar : yes, it is sounds like this good old OSI model. Indeed it is a tailored view of the original OSI model and it works the exact same way: so the data sent by an application A1 (residing on computer C1) to another application A2 (residing on computer C2) goes through C1's TCP/IP stack (from top to bottom), reach the C1's lower layers that will take the responsibility to move the bits from C1 to C2 over a physical link (electrical or lights pulses, radio waves...sorry no quantum mechanism yet) . C2's lower layers will receive the bits sent by C1 and pass what has been received to the C2's TCP/IP stack (bottom to top) which will pass the data to A2. If C1 and C2 are not on the same network the process is a bit more complex because it involves relays (routers) but the global idea remains the same. Also there is no shortcuts in the process : both TCP/IP stacks are crossed in their whole, either from top to bottom for the sender or bottom to top for the receiver. The transportation process in itself is also absolutely transparent from an application's point of view: A1 knows it can rely on the TCP/IP stack to transmits some data to A2, how the data is transmitted is not its problem, A1 just assumes the data can be transmitted by some means. The TCP/IP stack is also loosely coupled to a particular network technology because its frontier is precisely the physical transportation of bits over a medium and so the physical network's technology, just the same way A1 does not care about how the TCP/IP stack will move the data from one computer to another. The TCP/IP stack itself does not care about the details about how the bits are physically moved and thus it can work with any network technology no matter the technology is Ethernet, Token Ring or FDDI for example.

Classful and classless networks

The goal of this article being more focused on calculation of addresses used at the Internet layer so let's forget the gory details of the TCP/IP stack works (you can find an extremely detailed discussion in How the TCP/IP stack works... to be written...). From here, we assume you have a good general understanding of its functionalities and how a network transmission works. As you know the Internet layer is responsible to handle logical addressing issues of a TCP segment (or UDP datagram) that has either to be transmitted over the network or that has been received from the network.

Who would ever need millions of addresses afterall?  So in theory with those 32 bits we can have around 4 billions of computers within that network and arbitrarily retain that the very first connected computer must be given the number "0", the second one "1", the third one "2" and so on until we exhaust the address pool at number 4294967295 giving no more than 4294967296 (2^32) computers on that network because no number can be a duplicate. 


Those addresses follows the thereafter logic:

32 bits (fixed length)
Network part (variable length of N bits ) Host part (length : 32 - N bits)
  • The network address : this part is uniquely assigned amongst all of the organizations in the world (i.e. No one in the world can hold the same network part)
  • The host address : unique within a given network part

So in theory we can have something like this (remember the network nature is not to be unique, it hs to be be a collection of networks  :

  • Network 1 Host 1


Just like your birthday cake is divided in more or less smaller parts depending on how guests' appetite, the IPv4 address space has also been divided into more or less smaller parts just because organizations needs more or less computers on their networks. How to make this possible? Simply by dedicating a variable number of bits to the network part! Do you see the consequence? An IPv4 address being always 32 bits wide, the more bits you dedicate to the network part the lesser you have for the host part and vice-versa, this is a tradeoff, always. Basically, having more bits in :

  • the network part : means more networks possible at the cost of having less hosts per network
  • the host part : means less networks but more hosts per network

It might sounds a bit abstract but let's take an example : imagine we dedicate only 8 bits for the network part and the remaining 24 for the hosts part. What happens? First if we only


Is the network part assigned by each organization to itself? Of course not! Assignment are coordinated at the worldwide level by what we call Regional Internet Registries or RIRs which, in turn, can delegate assignments to third-parties located within their geographic jurisdiction. Those latter are called Local Internet Registries or LIRs (the system is detailed in RFC 7020). All of those RIRs are themselves put under the responsibility of now now well-known Internet Assigned Numbers Authority or IANA. As of 2014 five RIR exists :

  • ARIN (American Registry for Internet Numbers) : covers North America
  • LACNIC (Latin America and Caribbean Network Information Centre): covers South America and the Caribbean
  • RIPE-NCC (Réseaux IP Européens / or RIPE Network Coordination Centre): covers Europe, Russia and middle east
  • Afrinic (Africa Network Information Center) : covers the whole Africa
  • APNIC (Asian and Pacific Network Information Centre) : covers oceania and far east.