Professional Documents
Culture Documents
OSI Reference Model Via TCP/IP Reference Model
OSI Reference Model Via TCP/IP Reference Model
Application
Application protocol
Application
Presentation protocol
Presentation
Interface
6
Presentation
Interface
5 Session
Session protocol
Session
Transport protocol
Transport
Transport
3 Network
Network
Network
Network
Data Link
Data Link
Data Link
Data Link
Physical
Physical
Physical
Physical
Host A
Router
Router
Host B
This model deals with connecting open systems that is, systems that are open
for communication with other systems. Note that the OSI model itself is not a network
architecture because it does not specify the exact services & protocols to be used in
each layer. However, common standards were produced by ISO (International
Standards Organization) for each layer:
1.1.1
Physical Layer
The physical layer is concerned with transmitting raw bits over communication
channel under assumption , that it is 100% reliable.
1.1.2 Data Link Layer
The data link layer takes a raw transmission facility and transforms it into a
line that appears free of undetected transmission errors to the network layer. This
task is accomplished by using data & acknowledgment frames and error detection
algorithms (like code Humming).
1.1.3
Network Layer
The network layer is concerned with controlling the operation of the subnet.
That is routing the packets from the source to destination. Routes can be based on
static or dynamic routing tables as will be reviewed later. *(This layer is the one
that we are actually interested in)*.
1.1.4
Transport Layer
The transport layer basic function is to accept data from the session layer
derive it into packet (if necessary) , pass these to the network layer and restore the
data on the other end.
The session , presentation & application layers are less interesting for us,
however you can find their reviews in Computer Network of Andrew Tanenbaum (3-d
edition).
Internet Layer
The internet layer is the linchpin that holds the whole architecture together. It
allows hosts to inject their packets into any network and have them travel
independently to their destination. This layer defines official protocol called IP.
1.2.2
Transport Layer
The transport layer lies above the internet layer and its functionality is much
alike to the same layer in OSI model it allows peer entities on the source &
destination hosts to carry on a conversation (2 end-to-end protocols were defined
here: TCP & UDP).
There are tow more layers application & host-to-network that less interest us
(the host-to-network layer plays minor part in TCP/IP protocol, steel being
significant enough by itself) , you can find further information at the same
reference as before.
2. Routing
2.1 Field of interest.
So far we have had a surface glance on two major reference models in network:
OSI & TCP/IP. In this course we are mainly interested in one particular layer the
network layer, which is also divided into two approaches:
2.1.1
connectionless type
2.1.2
The connection oriented type refers to such protocols as ATM, telephony and so
on. This type of connection doesnt fit the hardware described below (CISCO Router
2600/11), thus it will not be discussed here.
2.2
Also , the establishment and release of network or transport layer connections do not
require any special work on the part of the routers.
2.2.1
Routing Algorithms.
The main function of the network layer is routing packets from source to
destination. The algorithms that chouse the routes and the data structures that
they use area major area of network layer design.
The routing algorithm is that part of the network layer software
responsible for deciding which output line an incoming packet should be
transmitted on. If the subnet uses datagrams internally , this decision must be
made anew for every arriving data packet since the best route may have
changed since last time. In the subnet using virtual circuits such decision is
made ones per session.
Routing algorithms can be grouped into two major classes: nonadaptive
and adaptive.
1) Nonadaptive algorithms do not base their routing decisions on
measurements or estimates of the current traffic and topology.
Instead , the choice of the route to use to get from I to J is
computed in advance , of-line, and downloaded to the routers
when the network is booted. This procedure is sometimes called
static routing.
2) Adaptive algorithms ,in contrast, change their routing decisions to
reflect changes in the topology , and usually the traffic as well.
Adaptive algorithms differ in where the get their information
,when they change the routes , and what metric is used for
optimization . They are also called dynamic.
2.2.2
2.2.3
Flooding
Flow-Based Routing
The algorithms seen above took only topology into account and did not
consider the load. The following algorithm considers both and is called flowbased routing.
In some networks, the mean data flow between each pair of nodes is
relatively stable and predictable. Under conditions in which the average traffic
from i to j is known in advance and to a reasonable approximation ,constant in
time, it is possible to analyze the flows mathematically to optimize the routing.
The idea behind the analysis is that for a given line, if the capacity and
average flow are known, it is possible to compute the mean packet delay on
that line from queuing theory. From the mean delays on all the lines , it is
straightforward to calculate a flow-weighted average to get the mean packet
delay for the whole subnet. The routing problem then reduces to finding the
routing algorithm that produces the minimum average delay for the subnet.
This technology demands certain information in advance. First the subnet
topology, second the traffic matrix, third the capacity matrix and finally a
routing algorithm (further explanation look at the same reference as above).
2.2.6
The idea behind link state routing is simple and can be stated as five parts.
Each router must:
1) Discover its neighbors and learn their network addresses.
2) Measure the delay or cost to each of its neighbors.
3) Construct a packet telling to all it has just learned.
4) Send the packet to all other routers.
5) Compute the shortest path to every other router.
Hierarchical Routing
Through the last years more and more people purchase portable computer
under natural assumption that they can be used all over the world. These
mobile hosts introduce new complication: to route a packet to a mobile host
the network first has to find it. Generally that requirement is implemented
through creation of two new issues in LAN foreign agent and home agent.
Each time any mobile host connects to the network it collects a foreign
agent packet or generates a request for foreign agent, as a result they establish
connection between them and the mobile host supplies the foreign agent with
its home & some security information.
After that the foreign agent contacts the mobile hosts home agent and
delivers the information about the mobile host.
Subsequently the home agent examines the received information and if it
authorizes the security information of mobile host it allows the foreign agent
to proceed. As the result the foreign agent enters the mobile host into its
routing table.
When the packet for the mobile host arrive its home agent it encapsulates
it and redirects to the foreign agent where the mobile host is hosting. Then it
returns encapsulation data to the router that sent the packet so that all next
packet would be directly sent to correspondent router (foreign agent).