Assignment of Telecom Network Design

Submitted by:
Ayesha Muzammil

Roll No:
BTS-17-01

Submitted to:
Engr. Sir Waqas Hashmi
Optimal Routing Protocol:
From source of the traffic to the destination, between the network nodes,
cumulative/total cost. It can be Layer 2 or Layer 3 protocol, we prefer shortest
path. Thus, overall which path provides more bandwidth, that path is considered
shortest path, thus Optimal Routing.

Use of Optimal Routing:

 There are many consultancy firms that uses optimal routing as compared to
the education of energy conservation and routing systems are used by other
firms such as retail industry and aviation industry as a major part because the
demand is high.
 The current status has been received and it has been observed that routing
and scheduling is associated with the planning problems in different
organizations. At the strategic planning level the design of routing network and
transfer systems are practiced.
 Companies use tactical and operational planning to consider problems with
various routing and scheduling aspects. Different modes of operations for
optimal routing networking is used on an industrial level.

Features of Optimal Routing:

Various directions and routing are placed on various routing places in order to
generate optimal routes and the nearest place for the calculation of the
accessible amount of time according to the planned schedule.

Key Features:
● A to B ports are connected internally.
● The multiple locations of the optimized routes.
● The desired locations in the network will be set according to the optimized .
 The roamers are inbound within the routing network and it is cost saver.

Assumptions:
 The expense of utilizing a connection is a component of the stream on that
interface.
 The all out network cost is the amount of the connection costs.
 The necessary traffic rate between each source-objective pair is known
ahead of time.
 Traffic between source-objective pairs can be part along various ways with
endless exactness.

Examples:
 Routing information protocols (RIP)
 Metric used is hop-count (dij=1)
 Routing information exchanged every 30 seconds Interior Gateway
Routing Protocol (IGRP)
  CISCO proprietary
 Metric takes load into account
 Dij ~ 1/(µ−λ) ( delay through link)
Features:
 Update every 90 seconds.
 Multi-path routing capability.

Formulation of optimal routing

 Let Dij (fij) be the cost function for using link (i,j) with flow fij
 Fij is the total traffic flow along link (i,j)
 Dij() can represent delay or queue size along the link
 Assume Dij is a differentiable function

33
 Let D(F) be the total cost for the network with flow vector F
 Assume additive cost: D(F) = Sum(ij) Dij (fij)
 For S-D pair w with total rate rw
 Pw is the set of paths between S and D
 Xp is the rate sent along path p ∈ Pw

Optimal routing solution:

Let dD(*)/dxp be the partial derivative of D with respect to Xp
 Then,
 D’xp = dD(*)/dxp = Sum(i,j) ∈p D’(I,j) – Where D’(i,j) is evaluat ed at the
total flow corresponding to xp
 D’xp consists of first derivative lengths along path p
Suppose now that X* = {x* p } is an optimal flo w vector for some S-D pair w with
paths PW
• Any shift in traffic from any path p to some other path p’ cannot possibly
decrease the total cost (since X* is assumed optimal)
 • Define ∆ as the change in cost due to a shift of a small amount of traffic ( δ)
from some path p with x*p > 0 to another path p’
∆ = δ ∂D ( X*) / ∂x p' − δ ∂D ( X*) / ∂xp ≥ 0 ⇒ ∂D ( X*) ∂xp' ≥ ∂D ( X*) ∂xp, ∀ p' ∈
Pw
• Optimality conditions ( necessary and sufficient)
: – optimal flows can only be positive on paths with minimum first d erivative
lengths
– All paths along which rw is split must have same first derivative lengths