Distributed minimum delay routing

1
Distributed minimum delay routing
2
Problem formulation

• network represented by graph G (V,E)
• traffic matrix given by
• rs(d) traffic entering s destined for d
• r ?s,d?V rs(d)
• - expected traffic (bps) on link (i,k) for
  source/dest. pair s,d
• fik expected traffic (bps) on link (i,k)

3

• Tsd - delay of msg from s to d
• T - delay of random message
• DT(fik) ? ET r-1 ?s,d?V rs(d) ETsd
• minimize DT(fik)
• s.t. flow constraints

4

• N number of pkts in network
• Nik number of pkts in (i,k) ? E
• T pkt network delay DT ET
• Tik pkt delay on (i,k) ? E Dik ETik
• EN ?(i,k)?E ENik ?(i,k)?E fik ETik
• r ET
• or
• ET (?(i,k)?E fik ETik)/r

5

• fik Dik(fik) convex in fik
• convex solution set

6

• Poisson arrivals exponential pkt sizes (m)
• link independence assumption

7
Definitions

• network G (V, E) n routers (nodes), L links
• ri(j) expected input traffic (bps) at node i?j
• ti(j) node flow at node i, destined for j
• sum ri(j) and neighbor traffic destined for j,
  through i
• ?ik(j) routing parameter
• fraction of traffic ti(j) routed over link (i, k)
• fik expected traffic (bps) on link (i,k)

8
Model Formulation
for arbitrary routing, r, t, ?, f satisfy (1)
(2)
9
Uniqueness

• Question do (r, ?) uniquely specify (t, f)?
• Theorem 1
• Given r, ?, equations (1) have unique solution
  for t. Each component ti(j) is non-negative and
  continuously differentiable as function of r, ?
• ?ik(j) 0 if (i, k) ? E or if i j
• ??ik(j) 1
• routing path exists from i to j, (i ? j)

10
Conditions for Min Delay

• delay function Dik
• Expected Num_Msg/sec on link (i, k)Expected
  Delay/Msg
• Dik only function of link flow fik
• since fik(r, ?), Dik depends on ? through fik
• total delay function DT
• Total Expected Num_Msg_Arr/secTotal Expected
  Delay/Msg

11
Conditions for Min Delay

• marginal link delay
• obtain marginal delays as partial derivatives

12
Necessary Condition for Min Delay

• Theorem 3
• Necessary condition for min of DT w.r.t. ? ?
  i?j, (i, k)?E
• where l is positive number
• links with positive fractional ? have same
  marginal delay this is less than or equal to
  marginal delays for links with ? 0

13
Sufficient Condition for Min Delay

• Theorem 3 (cont.) sufficient condition to
  minimize DT w.r.t. ? ? i?j, (i, k)?E
• each node i incrementally decreases ?ik(j) for
  which marginal delays Dik?DT/?rk(j) are large
  increases those for which they are small

14
Distributed min delay algorithm

• (A) Calculate marginal delays
• obtain Dik(fik), ?ik(j)
• given ?DT/?rk(j) for each neighboring node k, k?j
  use (4) to compute marginal delay ?DT/?ri(j) for
  node i
• broadcast ?DT/?ri(j) to neighbors

15
Distributed min delay algorithm

• (B) Update ?ik(j) for each i,j
• obtain set Bi(j) node k ?ik(j) 0 or
  (i,k)?E
• for k?Bi(j) do
• compute updates ?ik(j) given by

16
Comments

• updating info propagation similar to RIP
• marginal delays instead of delays
• changes propagate in one update
• if initial routes are loop-free, subsequent
  routes are loop-free
• update propagation time
• speed relatively unimportant in slowly varying
  traffic situation

17
Application to quasi-static routing

• algorithm converges to minimum average delay for
  static inputs links
• can algorithm react fast enough for quasi-static
  input statistics?
• requires more study
• scale parameter ??
• initializing loop-free ?
• shortest path algorithm?

18
Summary

• traffic engineering as shortest-paths problem
• distributed minimum delay routing