An oblivious shortest-path routing algorithm for fully connected cubic networks

Xiaofan Yang, Graham M. Megson, David J. Evans. An oblivious shortest-path routing algorithm for fully connected cubic networks. J. Parallel Distrib. Comput., 66(10):1294-1303, 2006. [doi]

@article{YangME06,
  title = {An oblivious shortest-path routing algorithm for fully connected cubic networks},
  author = {Xiaofan Yang and Graham M. Megson and David J. Evans},
  year = {2006},
  doi = {10.1016/j.jpdc.2006.03.008},
  url = {http://dx.doi.org/10.1016/j.jpdc.2006.03.008},
  tags = {routing},
  researchr = {https://researchr.org/publication/YangME06},
  cites = {0},
  citedby = {0},
  journal = {J. Parallel Distrib. Comput.},
  volume = {66},
  number = {10},
  pages = {1294-1303},
}