A selection function based distributed algorithm for delay-constraint least-cost unicast routing

@inproceedings{Liu2003ASF,
  title={A selection function based distributed algorithm for delay-constraint least-cost unicast routing},
  author={Wei E. I. Liu and Wenjing Lou and Yuguang Fang},
  booktitle={ICC},
  year={2003}
}
each network node and is always able to find a loop-free path satisfying the delay bound if such paths exist. Simulation study shows that the SF-DCLC is not as sensitive to the delay bound and network size as some other DCLC routing algorithms, and attains very low cost-inefficiency (less than 3% to the optimal one) in various network scenarios we simulate… CONTINUE READING